Skip to content
April 21, 2010 / porton

A counterexample against “Meet of discrete funcoids is discrete”

I found a counterexample to the following conjecture:

Conjecture f\cap^{\mathsf{FCD}} g = f\cap g for every binary relations f and g.

The counter-example is f = {(=)}|_{\mho} and g = \mho\times\mho \setminus f. I proved f \cap^{\mathsf{FCD}} g = {(=)} |_{\Omega} (where \Omega is the Frechet filter object).

The proof of this equality is presented in Funcoids and Reloids online article, the section Some counter-examples.

I hope the above counter-example may probably serve also as a base for disproving some conjectures about relationships of funcoids and reloids.

Advertisements

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: