Skip to content
March 29, 2017 / porton

A surprisingly easy proof of yesterday conjecture

I have found a surprisingly easy proof of this conjecture which I proposed yesterday.

Theorem Let S be a set of binary relations. If for every X, Y \in S we have \mathrm{up} (X \sqcap^{\mathsf{FCD}} Y) \subseteq S then there exists a funcoid f such that S = \mathrm{up}\, f.

The proof (currently available in this PDF file) is based on “Funcoids are filters” chapter of my book.

Advertisements

One Comment

Leave a Comment
  1. porton / Mar 30 2017 01:36

    Oops, my proof is erroneous. I hope to salvage the proof, however.

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 )

w

Connecting to %s

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

%d bloggers like this: