Given a poset $L$, call it trivial if $\left|L\right| < 2$ and let $\mathcal I\left(L\right)$ be its poset of ideals, $\mathcal C\left(L\right)$ be its set of chains, and $\mathcal M\left(L\right)$ be its poset of (finitely) meet-irreducible elements. Frankl's union-closed sets conjecture can be stated equivalently as follows.
- In any nontrivial finite lattice $L$, there exists a nonempty meet-irreducible ideal $I \in \mathcal M\left(\mathcal I\left(L\right)\right)$ such that $\left|I\right| \le \left|L\setminus I\right|$.
This conjecture is notorious for thwarting attempts at generalization, including the obvious generalization to infinite lattices. However, all counterexamples I have seen to generalizations to infinite lattices involve an infinite strictly descending chain (see here and here). Are there any known/obvious counterexamples to either of the following generalizations?
- In any nontrivial lattice $L$ satisfying the descending chain condition, there exists a nonempty meet-irreducible ideal $I \in \mathcal M\left(\mathcal I\left(L\right)\right)$ such that $\left|I\right| \le \left|L\setminus I\right|$.
- In any nontrivial lattice $L$, there exists a chain of nonempty meet-irreducible ideals $C \in \mathcal C\left(\mathcal M\left(\mathcal I\left(L\right)\right)\right)$ such that $\left|\bigwedge C\right| \le \left|L\setminus \bigwedge C\right|$.
Edit: To clarify, here I am including the empty set in the lattice of ideals so $\mathcal I\left(L\right)$ is complete and $\bigwedge C$ in (3.) exists. However, the ideal $I$ in (1.) and (2.) and the ideals in $C$ in (3.) must be nonempty.