TOPICS
Search

Lubell-Yamamoto-Meshalkin Inequality


The Lubell-Yamamoto-Meshalkin inequality, commonly abbreviated the LYM inequality, is a bound for an antichain F of subsets of an n-element set X. It states that

 sum_(A in F)1/((n; |A|))<=1.

For a short proof, choose a maximal chain of subsets of X uniformly at random. A fixed k-element set belongs to the chain with probability 1/(n; k). Since a chain meets an antichain in at most one member, summing these probabilities over F gives the inequality.

Since (n; |A|)<=(n; |_n/2_|) for every A subset= X, the LYM inequality implies Sperner's theorem.


See also

Antichain, Binomial Coefficient, Boolean Lattice, Sperner's Theorem

Explore with Wolfram|Alpha

References

Bogomolny, A. "Sperner's Theorem." https://cut-the-knot.org/pigeonhole/sperner.shtml#LYM.Lubell, D. "A Short Proof of Sperner's Lemma." J. Combin. Th. 1, 299, 1966. https://doi.org/10.1016/S0021-9800(66)80035-2.Meshalkin, L. D. "A Generalization of Sperner's Theorem on the Number of Subsets of a Finite Set." Theory Probab. Appl. 8, 203-204, 1963.Yamamoto, K. "Logarithmic Order of Free Distributive Lattice." J. Math. Soc. Japan 6, 343-353, 1954.

Cite this as:

Weisstein, Eric W. "Lubell-Yamamoto-Meshalkin Inequality." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Lubell-Yamamoto-MeshalkinInequality.html

Subject classifications