Documentation

LeanPool.BooleanIsoperimetry

Boolean Isoperimetry and Conway--Guy Coherent Gaps #

Source: doi:10.1016/S0021-9800(66)80059-5, url:https://doi.org/10.1090/S0002-9939-96-03653-2 Authors: Alexey Milovanov, Egor Lyfar Status: verified Main declarations: BooleanIsoperimetry.harper_theorem, BooleanIsoperimetry.conwayGuyGapRigidity Tags: additive-combinatorics, isoperimetry, boolean-cube, subset-sums, coherent-orders MSC: 05D05, 05C35

Mathematical overview #

The vertices of the n-dimensional Boolean cube are represented as finite sets of active coordinates. The formalization orders them first by cardinality and then by reverse binary order within each layer. The first k vertices in this simplicial order form the canonical generalized Hamming ball of size k.

The main result, BooleanIsoperimetry.harper_theorem, proves that for every family A of k cube vertices, the closed radius-one Hamming neighborhood of the simplicial initial segment of size k is no larger than the corresponding neighborhood of A. The development includes the required binomial-cascade identities, Kruskal--Katona shadow estimates, coordinate compressions, and the final induction over cube dimension.

For the Conway--Guy distinct-subset-sum sequence, the development also proves an all-dimension certificate recurrence. Every real row whose consecutive subset-sum gaps in the Conway--Guy order are at least one dominates the Conway--Guy row coordinatewise. Bohman's theorem that the sequence has distinct subset sums remains the external input showing that its subset-sum comparison is a total coherent Boolean term order.

Provenance #

Imported from https://github.com/AlexeyMilovanov/BooleanIsoperimetry, branch lean-v4.31, and ported to Lean 4.32.0-rc1 for this import. The proof follows P. Frankl and Z. Füredi, "A short proof for a theorem of Harper about Hamming-spheres," Discrete Mathematics 34 (1981), doi:10.1016/0012-365X(81)90009-1. The formalization was developed with extensive LLM assistance under the author's supervision.

The Conway--Guy recurrence follows T. Bohman, "A sum packing problem of Erdős and the Conway--Guy sequence," Proceedings of the AMS 124 (1996), 3627--3636, doi:10.1090/S0002-9939-96-03653-2. Its normalized chamber-rigidity certificate induction was added by Egor Lyfar with AI assistance.