Skip to content
September 9, 2014 / porton

Funcoids are filters? Conjecture II

Earlier I have conjectured that the set of funcoids is order-isomorphic to the set of filters on the set of finite joins of funcoidal products of two principal filters. For an equivalent open problem I found a counterexample.

Now I propose another similar but weaker open problem:

Conjecture Let U be a set. The set of funcoids on U is order-isomorphic to the set of filters on the set \Gamma (moreover the isomorphism is (possibly infinite) meet of the filter), where \Gamma is the set of unions \bigcup_{X\in S}(X\times Y_X) where S is a finite partition of U and Y\in \mathscr{P} U for every X\in S

The last conjecture is equivalent to this question formulated in elementary terms. If you solve this (elementary) problem, it could be a major advance in mathematics.

Advertisements

One Comment

Leave a Comment
  1. porton / Sep 10 2014 01:57

    Today is a happy day: I’ve proved this conjecture:
    http://www.mathematics21.org/binaries/funcoids-are-filters.pdf

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 )

Twitter picture

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

Facebook photo

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

Google+ photo

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

Connecting to %s

%d bloggers like this: