The largest possible antichain of subsets of an n-element set, meaning a family in which no member is a subset of another, has size equal to the central binomial coefficient, achieved by taking all subsets of the middle size. Proved by Emanuel Sperner, it is a foundational result of extremal set theory, distinct from the same mathematician's combinatorial lemma on simplex triangulations.
Facts
StatementSperner's theorem, in discrete mathematics, describes the largest possible families of finite sets none of which contain any other sets in the family. 1 Classification
Statement Form Connections
Has Statement Form
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
In Branch
Sources
1. Sperner's Theorem (Wikipedia)
Wikimedia Foundationlead paragraph, opening sentence
Sperner's theorem, in discrete mathematics, describes the largest possible families of finite sets none of which contain any other sets in the family.
lead paragraph, sentence naming the publication year
It is named after Emanuel Sperner, who published it in 1928.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.