Research / Sep 2, 2026

Daykin–Frankl conjecture for convex subsets of the Boolean lattice

Must a convex subset P of the Boolean lattice contain at least |P| times the normalized middle-layer size in pairwise incomparable elements?

Model / AI: GPT-5.6 Sol Pro

self-reported

Sep 2, 2026

LLM-generated inductive proof

Model / AI: GPT-5.6 Sol Pro

self-reported

Kada Williams reports verifying and communicating an LLM-generated proof. The argument proves a stronger product inequality for convex subsets and obtains the 1983 conjecture as a consequence.

Source read 2026-09-08. Read the full short preprint and its provenance statement. No independent or machine check was found.

Paper — Paper