A CONTINUOUS ANALOGUE OF SPERNER'S THEOREM

One of the best-known results of extremal combinatorics is Sperner’s theorem, which asserts that the maximum size of an antichain of subsets of an -element set equals the binomial coefficient , that is, the maximum of the binomial coefficients. In the last twenty years, Sperner’s theorem has been generalized to wide classes of partially ordered sets. It is the purpose of the present paper to propose yet another generalization that strikes in a different direction. We consider the lattice of linear subspaces (through the origin) of the vector space . Because this lattice is infinite, the usual methods of extremal set theory do not apply to it. It turns out, however, that the set of elements of rank of the lattice , that is, the set of all subspaces of dimension of , or Grassmannian, possesses an invariant measure that is unique up to a multiplicative constant. Can this multiplicative constant be chosen in such a way that an analogue of Sperner’s theorem holds for , with measures on Grassmannians replacing binomial coefficients? We show that there is a way of choosing such constants for each level of the lattice that is natural and unique in the sense defined below and for which an analogue of Sperner’s theorem can be proven. The methods of the present note indicate that other results of extremal set theory may be generalized to the lattice by similar reasoning. c 1997 John Wiley & Sons, Inc.

[1]  Daniel A. Klain,et al.  Introduction to Geometric Probability , 1997 .

[2]  R. Schneider.  Convex Bodies: The Brunn–Minkowski Theory: Minkowski addition , 1993 .

[3]  E. Artin,et al.  The Gamma Function , 1964 .

[4]  Joseph P. S. Kung,et al.  Gian-Carlo Rota on combinatorics : introductory papers and commentaries , 1995 .

[5]  Daniel A. Klain.  A short proof of Hadwiger's characterization theorem , 1995 .

[6]  Warren M. Hirsch,et al.  SPERNER FAMILIES, s‐SYSTEMS, AND A THEOREM OF MESHALKIN † , 1970 .

[7]  K. Ball.  CONVEX BODIES: THE BRUNN–MINKOWSKI THEORY , 1994 .

[8]  L. D. Meshalkin.  Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set , 1963 .

[9]  L. D. Mesalkin.  A Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set , 1963 .

[10]  Gian-Carlo Rota,et al.  Gian-Carlo Rota on combinatorics , 1995 .

[11]  Totally invariant set functions of polynomial type , 1994 .

[12]  D. Kleitman.  On a combinatorial conjecture of Erdös , 1966 .

[13]  L. Santaló.  Integral geometry and geometric probability , 1976 .

[14]  Peter McMullen,et al.  Valuations on convex bodies , 1983 .

[15]  P Mcmullen,et al.  Non-linear angle-sum relations for polyhedral cones and polytopes , 1975, Mathematical Proceedings of the Cambridge Philosophical Society.

[16]  L. Nachbin,et al.  The Haar integral , 1965 .

[17]  E. Sperner.  Ein Satz über Untermengen einer endlichen Menge , 1928 .

[18]  H. Hadwiger.  Vorlesungen über Inhalt, Oberfläche und Isoperimetrie , 1957 .

[19]  P. Erdös.  On a lemma of Littlewood and Offord , 1945 .

[20]  Steve Fisk.  Whitney Numbers of Projective Space over R, C, H and the P-Adics , 1995, J. Comb. Theory, Ser. A.