(In a past version of this article I erroneously concluded that our main conjecture follows from join-closedness of $latex {Z (D \mathcal{A})}&fg=000000$.)
Let $latex {U}&fg=000000$ is a set. A filter $latex {\mathcal{F}}&fg=000000$ (on $latex {U}&fg=000000$) is a non-empty set of subsets of $latex {U}&fg=000000$ such that $latex {A, B \in \mathcal{F} \Leftrightarrow A \cap B \in \mathcal{F}}&fg=000000$. Note that unlike some other authors I do not require $latex {\emptyset \notin \mathcal{F}}&fg=000000$. I will denote $latex {\mathfrak{f}}&fg=000000$ the lattice of all filters (on $latex {U}&fg=000000$) ordered by set inclusion.
Conjecture 1 Let $latex {\mathcal{A} \in \mathfrak{f}}&fg=000000$ is some (fixed) filter. Let $latex {D = \left\{ \mathcal{X} \in \mathfrak{f} \hspace{1em} | \hspace{1em} \mathcal{X} \supseteq \mathcal{A} \right\}}&fg=000000$. (Obviously $latex {D}&fg=000000$ is a bounded lattice.) Then the set of complemented elements of the lattice $latex {D}&fg=000000$ (ordered by set inclusion) is a complete lattice.
This conjecture was first formulated in this blog post and suggested as a polymath project in this blog post.
1. Filter objects
(Borrowed from this blog post)
For greater clarity I will use {filter objects} instead of filters. Below I will describe the properties of filter objects without exact definition and the proofs. You can look here for the formalistic behind.
I will denote the set of all filters objects on $latex {U}&fg=000000$ as $latex {\mathfrak{F}}&fg=000000$. Filter objects are bijectively related with filters by the bijection “$latex {\mathrm{up}}&fg=000000$” from the set of filter objects to the set of filters. A filter object corresponding to principal filter generated by a set $latex {A}&fg=000000$ is equal to $latex {A}&fg=000000$. (Thus the set of subsets of $latex {U}&fg=000000$ is a subset of $latex {\mathfrak{F}}&fg=000000$.)
For formal definition of filter objects in the framework of ZF see here. Below we will not need the exact definition of filter objects, but only the facts that “$latex {\mathrm{up}}&fg=000000$” is a bijection from filter objects to filters and that a filter object corresponding to principal filter generated by a set $latex {A}&fg=000000$ is equal to $latex {A}&fg=000000$.
I will define the order on the set of filter objects by the formula $latex {\mathcal{A} \subseteq \mathcal{B} \Leftrightarrow \mathrm{up} \mathcal{A} \supseteq \mathrm{up} \mathcal{B}}&fg=000000$ for every filter objects $latex {\mathcal{A}}&fg=000000$ and $latex {\mathcal{B}}&fg=000000$. This order well-agrees with the order of sets on $latex {U}&fg=000000$.
$latex {\mathfrak{F}}&fg=000000$ is a complete lattice. (See here for a proof.)
2. Second definition
Let $latex {\mathfrak{A}}&fg=000000$ is a bounded distributive lattice. Let $latex {a \in \mathfrak{A}}&fg=000000$. I will denote $latex {D a = \left\{ x \in \mathfrak{A} \hspace{1em} | \hspace{1em} x \subseteq a \right\}}&fg=000000$. Obviously $latex {D a}&fg=000000$ is a bounded lattice.
The center of a bounded distributive lattice $latex {\mathfrak{A}}&fg=000000$ is by definition the set $latex {Z (\mathfrak{A})}&fg=000000$ of all complemented elements of $latex {\mathfrak{A}}&fg=000000$. It is a well known fact that the center is a boolean lattice.
I will call $latex {Z (D \mathcal{A})}&fg=000000$ the elements {complementive} to $latex {\mathcal{A}}&fg=000000$.
Now our conjecture can be equivalently reformulated:
Conjecture 2 $latex {Z (D \mathcal{A})}&fg=000000$ is a complete lattice whenever $latex {\mathcal{A}}&fg=000000$ is an element of the lattice $latex {\mathfrak{F}}&fg=000000$.
If the conjecture is true it may be generalized for the case of $latex {\mathfrak{F}}&fg=000000$ being the set of filter objects on some lattice instead of our less general case of filters on a set.
3. Special case of $latex {\mathcal{A}}&fg=000000$ being a set
I almost believe that our conjecture is true in general, because it is true in the special case when $latex {\mathcal{A}}&fg=000000$ is a set. Trueness of this special case of our conjecture trivially follows from the following theorem:
Theorem 3 $latex {Z (D A) = \mathscr{P} A}&fg=000000$ if $latex {A \in \mathscr{P} U}&fg=000000$.
Proof: It follows from this theorem. $latex \Box&fg=000000$
4. Ways to attack our conjecture
4.1. Calculating meets and joins
To prove that a lattice is complete is enough to prove one of the following two statements: 1. it has all joins; or 2. it has all meets.
Directly calculating meets and joins for the lattice $latex {Z (D \mathcal{A})}&fg=000000$ seems a complicated problem.
It could be simplified if meets or joins on $latex {Z (D \mathcal{A})}&fg=000000$ coincide with meets or joins on $latex {\mathcal{\mathfrak{F}}}&fg=000000$.
For meets it is not the case. (A counter-example is simple to find in the case $latex {\mathcal{A} = U}&fg=000000$ when $latex {U}&fg=000000$ is any infinite set.)
For joins it seems true that joins on $latex {Z (D \mathcal{A})}&fg=000000$ coincide with joins on $latex {\mathcal{\mathfrak{F}}}&fg=000000$. However I failed to prove it.
Proposition 4 If our main conjecture is true, then the sublattice $latex {Z (D \mathcal{A})}&fg=000000$ of the lattice $latex {\mathfrak{F}}&fg=000000$ is join-closed.
Proof: Let $latex {S \in \mathscr{P} Z (D \mathcal{A})}&fg=000000$. Let our main conjecture is true and thus $latex {\bigcup^{Z (D \mathcal{A})} S}&fg=000000$ exists. We need to prove that $latex {\bigcup^{Z (D \mathcal{A})} S = \bigcup^{\mathfrak{F}} S}&fg=000000$. Because $latex {Z (D \mathcal{A})}&fg=000000$ is a sublattice of $latex {\mathfrak{F}}&fg=000000$ it’s enough to prove that for any $latex {\mathcal{F} \in D \mathcal{A}}&fg=000000$
$latex \displaystyle \forall K \in S : K \subseteq \mathcal{F} \Rightarrow \mathcal{F} \supseteq \bigcup {\nobreak}^{Z (D \mathcal{A})} S. &fg=000000$
Really: Let $latex {C \in \mathrm{up}^{D \mathcal{A}} \mathcal{F}}&fg=000000$ and $latex {\forall K \in S : K \subseteq \mathcal{F}}&fg=000000$. Then $latex {C \supseteq \mathcal{F}}&fg=000000$; $latex {C \supseteq \bigcup {\nobreak}^{Z (D \mathcal{A})} S}&fg=000000$; $latex {C \in \mathrm{up}^{D \mathcal{A}} \bigcup {\nobreak}^{Z (D \mathcal{A})} S}&fg=000000$. Thus $latex {\mathcal{F} \supseteq \bigcup {\nobreak}^{Z (D \mathcal{A})} S}&fg=000000$. $latex \Box&fg=000000$
4.2. Intersection with a set
An other way to characterize elements of $latex {Z (D \mathcal{A})}&fg=000000$ is:
Theorem 5 $latex {\mathcal{X} \in Z (D \mathcal{A}) \Leftrightarrow \exists X \in \mathscr{P} U : \mathcal{X} = X \cap^{\mathfrak{F}} \mathcal{A}}&fg=000000$ for every$latex {\mathcal{X} \in \mathfrak{F}}&fg=000000$.
Proof:
We may attempt to attack our conjecture by proving that meets or joins of filter objects of the form $latex {K \cap^{\mathfrak{F}} \mathcal{A}}&fg=000000$ are also of the form $latex {K \cap^{\mathfrak{F}} \mathcal{A}}&fg=000000$.
Let $latex {S \in \mathscr{P} Z (D \mathcal{A})}&fg=000000$. Then $latex {S = \left\{ X \cap^{\mathfrak{F}} \mathcal{A} \hspace{1em} | \hspace{1em} X \in T \right\}}&fg=000000$ where $latex {T \in \mathscr{P} \mathscr{P} U}&fg=000000$.
How to calculate $latex {\bigcup^{Z (D \mathcal{A})} \left\{ X \cap^{\mathfrak{F}} \mathcal{A} \hspace{1em} | \hspace{1em} X \in T \right\}}&fg=000000$ and $latex {\bigcap^{Z (D \mathcal{A})} \left\{ X \cap^{\mathfrak{F}} \mathcal{A} \hspace{1em} | \hspace{1em} X \in T \right\}}&fg=000000$?
I conjecture:
$latex {\bigcup^{Z (D \mathcal{A})} \left\{ X \cap^{\mathfrak{F}} \mathcal{A} \hspace{1em} | \hspace{1em} X \in T \right\} = \mathcal{A} \cap^{\mathfrak{F}} \bigcup T}&fg=000000$ and $latex {\bigcap^{Z (D \mathcal{A})} \left\{ X \cap^{\mathfrak{F}} \mathcal{A} \hspace{1em} | \hspace{1em} X \in T \right\} = \mathcal{A} \cap^{\mathfrak{F}} \bigcap T}&fg=000000$.
It probably may be helpful if we would calculate $latex {\bigcup^{\mathfrak{F}} S}&fg=000000$ or $latex {\bigcap^{\mathfrak{F}} S}&fg=000000$. (However it simple to show that in general $latex {\bigcap^{\mathfrak{F}} S \neq \bigcap^{Z (D \mathcal{A})} S}&fg=000000$.)
$latex {\bigcup^{\mathfrak{F}} S = \bigcup^{\mathfrak{F}} \left\{ X \cap^{\mathfrak{F}} \mathcal{A} \hspace{1em} | \hspace{1em} X \in T \right\}}&fg=000000$. Sadly there are no distributive law we could apply here.
$latex {\bigcap^{\mathfrak{F}} S = \bigcap^{\mathfrak{F}} \left\{ X \cap^{\mathfrak{F}} \mathcal{A} \hspace{1em} | \hspace{1em} X \in T \right\} = \mathcal{A} \cap^{\mathfrak{F}} \bigcap^{\mathfrak{F}} T}&fg=000000$. Sadly $latex {\bigcap^{\mathfrak{F}} T}&fg=000000$ is not necessarily a set.
5. Consequences of our conjecture
5.1. Closedness of joins on $latex {Z (D \mathcal{A})}&fg=000000$
Above it was proved that closedness of joins of $latex {Z (D \mathcal{A})}&fg=000000$ follows from our main conjecture.
5.2. Coinciding pseudodifference and second pseudodifference
It seems that using our conjecture we can prove that quasidifference and second quasidifference coincide for the lattice of filter objects.
See this and this wiki pages for details about the current state of the problem about coinciding quasidifference and second quasidifference.
One Response