Skip to content
May 31, 2012 / porton

A difficulty on the way of my research

The following conjecture seems trivial but I have a hard hour trying to prove it. I suspect I have a big difficulty on the course of my research.

Conjecture \prod^{\mathsf{FCD}} a \not\asymp\prod^{\mathsf{FCD}} b \Leftrightarrow \forall i\in n : a_i \not\asymp b_i for every n-indexed (where n is an arbitrary index set) families of filters a and b.

See This Web page and specifically this draft article for the notation I use.

3 Comments

Leave a Comment
  1. porton / May 31 2012 19:14

    It seems I have found a proof. See a proof sketch (with minor errors) in this rough draft.

    Like

    • porton / May 31 2012 19:26

      Well, there is an unfounded step in this proof. I keep trying to prove it.

      Like

  2. porton / May 31 2012 22:00

    I give up. I am going to publish it as a conjecture.

    Like

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.

%d bloggers like this: