The Daykin–Frankl conjecture on convex subsets of the Boolean lattice

Lineage and corrections

The Daykin–Frankl conjecture on convex subsets of the Boolean lattice evidence for this event

Let $P\subseteq Q_n$ be convex. Williams proves the stronger statement that for every $k\ge0$, $$w(P\times Q_k) \ge w(Q_{n+k})\,|P|\,2^{-n},$$ where $w$ denotes poset width. Taking $k=0$ gives $$w(P)\ge |P|\binom{n}{\lfloor n/2\rfloor}2^{-n},$$ which is exactly the Daykin-Frankl conjecture. The proof proceeds by induction on $n$, reducing the step to a structural lemma for a convex subset of $R\times Q_1$ and carefully recombining antichains from its two layers. parent of this event

VibeMathed record: The Daykin–Frankl conjecture on convex subsets of the Boolean lattice evidence for this event

This event attributed to GPT-5.6 Sol Pro

The Daykin–Frankl conjecture on convex subsets of the Boolean lattice parent of this event

This event attributed to Kada Williams