Distributive lattice embedding into a finite lattice. - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-25T23:55:50Z http://mathoverflow.net/feeds/question/121123 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/121123/distributive-lattice-embedding-into-a-finite-lattice Distributive lattice embedding into a finite lattice. Rob Myers 2013-02-07T21:53:11Z 2013-02-09T15:54:45Z <p>Suppose one has an inclusion $\iota : D \hookrightarrow S$ where $D$ is a finite distributive lattice and $S$ is a finite join-semilattice.</p> <p>If $\iota$ preserves all meets and joins one can show that $|J(D)| \leq |J(S)|$ i.e. $D$ has no more join-irreducibles than $S$.</p> <p>Does this also hold if $\iota$ only preserves finite joins?</p> <p>I only know that it is true in the special cases where $S$ is a distributive lattice or $S \cong S^{op}$ is order-dual.</p> http://mathoverflow.net/questions/121123/distributive-lattice-embedding-into-a-finite-lattice/121325#121325 Answer by Rob Myers for Distributive lattice embedding into a finite lattice. Rob Myers 2013-02-09T15:54:45Z 2013-02-09T15:54:45Z <p>Well, I proved that it is true with a friend yesterday, so I'll include it here.</p> <p>Recall that we have an inclusion $\iota : D \hookrightarrow S$ where $S$ is a finite join-semilattice and $D$ is a finite distributive lattice. More explicitly: $S$ has all finite joins, so it is a complete lattice with a top and bottom element and furthermore $D$ has a top and bottom too.</p> <p>In the case where $\iota$ preserves all meets then the same function defines a meet-semilattice morphism $\iota : D^{op} \hookrightarrow S^{op}$, so by duality we have the surjection $\iota' : S \twoheadrightarrow D$, hence $|J(D)| \leq |J(S)|$ because join-irreducibles (we exclude zero) in join-semilattices form the minimal generating set.</p> <p>But the question was whether the same is true when $\iota$ preserves all joins.</p> <p>First recall that in any finite distributive lattice $D$, the cardinality $|J(D)|$ is the size of the maximal chain in $D$ (counting the edges). Since we have an embedding $\iota : D \hookrightarrow S$, it follows that $S$'s maximal chain has size more than or equal to $n = |J(D)|$. For a contradiction assume that $|J(S)| &lt; n$. Then $S$ is generated by $n-1$ elements, so we have a join-semilattice morphism $f : 2^{n-1} \twoheadrightarrow S$. By duality there is an embedding $f' : S^{op} \hookrightarrow (2^{n-1})^{op}$, hence $S^{op}$'s maximal chain has size at most $n-1$, as does its order-dual $S$, this being a contradiction.</p>