`ComparatorChallenges/SecondKahnKalai.lean`

Explanation legend Lean4 Domain Explanation Language (L4DEL)

L4DEL explanations are a separate layer. They do not change the Lean source. Intuition is explanatory prose; numbered items are a reading path; sources link the wording back to evidence.

L4DEL: Lean4 Domain Explanation Language

Annotation provenance. This overlay contains 120 curated AI-written annotations and 1273 mechanical source-derived annotations. They have not been human-reviewed as explanations; treat them as unverified and not mathematical authority. Retained generation history: The 9 original curated annotations were produced in a Claude Sonnet 5.5 session at medium effort; Claude Opus 5.5 is recorded in that session as the advisor model, not the direct author. Those 9 annotations were revised on 2026-10-14 to bind all of them to exact page-one quotations from 6 pinned OpenAI manuscripts, the matching pinned formalization notes, and named historical primary sources; no human review is claimed, and the exact runtime model identifier was not exposed to the artifact generator. The 3 manuscript-grounded matrix-multiplication annotations were composed from pinned OpenAI manuscripts and named historical sources in a Codex session on 2026-10-14; no human review is claimed, and the exact runtime model identifier was not exposed to the artifact generator. Six additional target-specific annotations for Catalan's constant, the irrationality exponent of pi, dyadic Erdos similarity, Unique Games, quintic Lienard systems, and Yau nodal growth were composed from pinned OpenAI manuscripts, exact page-one quotations, exact Lean statements, and named historical sources in a Codex session on 2026-10-14; no human review is claimed, and the exact runtime model identifier was not exposed to the artifact generator. Four additional target-specific annotations for Seymour's second-neighborhood conjecture, Cannon's conjecture, Koebe circle-domain uniformization, and circle-domain rigidity were composed from 4 pinned OpenAI manuscripts, exact page-one quotations, exact Lean statements, and named historical primary sources in a Codex session on 2026-10-14; no human review is claimed, and the exact runtime model identifier was not exposed to the artifact generator. Four additional target-specific annotations for simple Lebesgue spectrum on the three-torus, Rokhlin multiple mixing, the nine-dimensional Borsuk counterexample, and Tingley's sphere-isometry problem were composed from 4 pinned OpenAI manuscripts, exact page-one quotations, exact Lean statements, and named historical primary sources in a Codex session on 2026-10-14; no human review is claimed, and the exact runtime model identifier was not exposed to the artifact generator. Four additional target-specific annotations for the Abhyankar-Sathaye counterexample, the circulant Hadamard conjecture, the Eilenberg-Ganea counterexample, and short Egyptian fractions were composed from 4 pinned OpenAI manuscripts, exact page-one quotations, exact Lean statements, and quotations from Sathaye, Turyn with Storer, Eilenberg with Ganea, and Erdos in a Codex session on 2026-10-14; no human review is claimed, and the exact runtime model identifier was not exposed to the artifact generator. Four additional target-specific annotations for the complete Crouzeix inequality, unrestricted Euclidean five-coloring, the general Mahler conjecture, and Thompson F nonamenability were composed on 2026-10-14 from exact Lean statements, 4 pinned OpenAI manuscripts, the matching formalization notes, and linked historical sources by Crouzeix, de Grey, Mahler, Cannon, Floyd, and Parry; no human review is claimed. Four additional target-specific annotations for algorithmic strong thin trees, Barnette's Hamiltonian-cycle conjecture, the explicit Artin CAT(0) counterexample, and generalized amplitude-damping capacity were composed on 2026-10-14 from exact Lean statements, 4 pinned OpenAI manuscripts, matching formalization notes, and linked historical sources by Anari with Goddyn, Arts with Hopman and Timmermans, Charney, and Khatri with Sharma and Wilde; no human review is claimed. Fourteen solution-level annotations for Seymour's second-neighborhood theorem were added on 2026-10-14 from the pinned 15-page manuscript, covering the exact-neighborhood model, minimal-counterexample reduction, subset deficit, transitive blowup, pruning, extremal contradiction, and proof-bearing final theorem. The subset and blowup annotations also bind exact quotations from Tyler Seacrest (2019) and Brantner, Brockman, Kay, and Snively (2009); no human review is claimed. Thirty-seven declaration-level annotations were added on 2026-10-14 for the rest of ComparatorChallenges/AlgorithmicThinTrees.lean, covering its multigraph semantics, stack-machine cost model, explicit and binary-multiplicity encodings, output certificate, and complete algorithmic proposition. They are bound to the pinned OpenAI manuscript and linked earlier thin-tree sources by Luis Goddyn, Nima Anari, and Shayan Oveis Gharan; the annotation explicitly preserves that the concluding comparator theorem still has body by sorry, and no human review is claimed. Thirty-one supporting declarations in ComparatorChallenges/UniqueGamesTheorem.lean were upgraded or added on 2026-10-14, completing curated coverage of all thirty-two declarations in that file. The annotations cover the finite game model, Boolean formula and parser, binary-vector translations, explicit output serialization, finite-alphabet machine contract, and gap theorem; they distinguish manuscript-backed mathematics from Lean-specific canonical parsing and unary game output encoding, bind exact OpenAI manuscript quotations, and credit Subhash Khot through his 2010 survey. The comparator theorem remains explicitly labeled as having body by sorry; no human review is claimed. The source-derived generator was hardened on 2026-10-14 so a formalization note covering multiple comparator results no longer copies its combined Scope prose onto each declaration; those targets now use declaration-specific source comments when available and otherwise remain explicitly bounded to the exact Lean statement. The remaining source-derived annotations were generated mechanically from pinned formalization notes and source comments by tooling developed in a GPT-5.6 Sol session at ultra reasoning; GPT-5.6 Sol did not originate the source prose.

Credit: OpenAI's pinned repository says an unreleased internal model produced the manuscripts and supporting proof artifacts. The collection builds on the mathematics community's accumulated problems, results, language, and formal libraries; each manuscript's BibTeX and bibliography are the authority for individual scholarly credit.

Project sources: Pinned openai/math documentation, Pinned formalization catalogue

13 declarations, 1 contain sorry, 0 declared as axioms

def OAI.LeanBlast.SecondKahnKalai.bernoulliWeight line 15
Also declared: OAI/Combinatorics/GraphThreshold/Model.lean:15 (same declaration text).
def OAI.LeanBlast.SecondKahnKalai.bernoulliExpectation line 19
Also declared: OAI/Combinatorics/GraphThreshold/Model.lean:19 (same declaration text).
def OAI.LeanBlast.SecondKahnKalai.bernoulliProbability line 23
Also declared: OAI/Combinatorics/GraphThreshold/Model.lean:23 (same declaration text).
abbrev OAI.LeanBlast.SecondKahnKalai.Edge The unordered non-loop edges of the complete graph on n vertices line 29
Source documentation
The unordered non-loop edges of the complete graph on n vertices.
L4DEL explanation
The unordered non-loop edges of the complete graph on n vertices.
1. This explanation is a condensed rendering of the declaration's own doc comment at the pinned source commit; consult the exact Lean statement below for authority.
Sources and attribution: Pinned Lean source (fd4aeeb2ee4f)
Also declared: OAI/Combinatorics/GraphThreshold/Model.lean:29 (same declaration text).
```
abbrev Edge (n : ℕ) := {e : Sym2 (Fin n) // ¬e.IsDiag}
```
def OAI.LeanBlast.SecondKahnKalai.graphOfEdges A set of edges, interpreted as an ordinary graph on all n vertices line 32
Source documentation
A set of edges, interpreted as an ordinary graph on all n vertices.
L4DEL explanation
A set of edges, interpreted as an ordinary graph on all n vertices.
1. This explanation is a condensed rendering of the declaration's own doc comment at the pinned source commit; consult the exact Lean statement below for authority.
Sources and attribution: Pinned Lean source (fd4aeeb2ee4f)
Also declared: OAI/Combinatorics/GraphThreshold/Model.lean:32 (same declaration text).
```
def graphOfEdges {n : ℕ} (W : Finset (Edge n)) : SimpleGraph (Fin n) :=
…
```
Mentions: OAI.LeanBlast.SecondKahnKalai.Edge
def OAI.LeanBlast.SecondKahnKalai.edgeCount The number of unordered edges, each counted once line 36
Source documentation
The number of unordered edges, each counted once.
L4DEL explanation
The number of unordered edges, each counted once.
1. This explanation is a condensed rendering of the declaration's own doc comment at the pinned source commit; consult the exact Lean statement below for authority.
Sources and attribution: Pinned Lean source (fd4aeeb2ee4f)
Also declared: OAI/Combinatorics/GraphThreshold/Model.lean:36 (same declaration text).
```
def edgeCount {V : Type u} (H : SimpleGraph V) : ℕ := Nat.card H.edgeSet
```
def OAI.LeanBlast.SecondKahnKalai.expectedCopies Expected number of actual unlabelled non-induced copies in G(n,p) line 39
Source documentation
Expected number of actual unlabelled non-induced copies in G(n,p).
L4DEL explanation
Expected number of actual unlabelled non-induced copies in G(n,p).
1. This explanation is a condensed rendering of the declaration's own doc comment at the pinned source commit; consult the exact Lean statement below for authority.
Sources and attribution: Pinned Lean source (fd4aeeb2ee4f)
Also declared: OAI/Combinatorics/GraphThreshold/Model.lean:39 (same declaration text).
```
def expectedCopies {V : Type u} (n : ℕ) (p : ℝ) (H : SimpleGraph V) : ℝ :=
…
```
def OAI.LeanBlast.SecondKahnKalai.containmentProbability Probability that G(n,p) contains at least one non-induced copy line 44
Source documentation
Probability that G(n,p) contains at least one non-induced copy.
L4DEL explanation
Probability that G(n,p) contains at least one non-induced copy.
1. This explanation is a condensed rendering of the declaration's own doc comment at the pinned source commit; consult the exact Lean statement below for authority.
Sources and attribution: Pinned Lean source (fd4aeeb2ee4f)
Also declared: OAI/Combinatorics/GraphThreshold/Model.lean:44 (same declaration text).
```
def containmentProbability {V : Type u} (n : ℕ) (p : ℝ)
    (H : SimpleGraph V) : ℝ :=
…
```
def OAI.LeanBlast.SecondKahnKalai.criticalThreshold line 49
Also declared: OAI/Combinatorics/GraphThreshold/Model.lean:49 (same declaration text).
def OAI.LeanBlast.SecondKahnKalai.expectationThreshold line 52
Also declared: OAI/Combinatorics/GraphThreshold/Model.lean:52 (same declaration text).
def OAI.LeanBlast.SecondKahnKalai.logTwo line 56
Also declared: OAI/Combinatorics/GraphThreshold/Model.lean:56 (same declaration text).
def OAI.LeanBlast.SecondKahnKalai.SecondKahnKalaiBounds line 58
Also declared: OAI/Combinatorics/GraphThreshold/Model.lean:58 (same declaration text).
theorem OAI.LeanBlast.SecondKahnKalai.secondKahnKalaiBounds Challenge statement: The second Kahn–Kalai conjecture with an edge-count bound sorry line 65
L4DEL explanation
The second Kahn–Kalai conjecture compares the threshold for a random graph to contain a fixed graph with its expectation threshold. The formalized result proves the comparison up to a universal factor times $1+\log_2|E(H)|$, and hence up to a universal factor times $\log_2 n$, for every graph $H$ with at least one edge and at most $n$ vertices, $n\ge2$. The bounds use the actual containment and expectation thresholds.
1. This is an exact comparator target linked by the pinned repository's formalization note for this result.
2. The repository's comparator configuration selects OAI.Combinatorics.GraphThreshold.Main as the released solution module checked against this declaration.
Sources and attribution: Pinned Lean source (fd4aeeb2ee4f)
Distinct definitions of this name: OAI/Combinatorics/GraphThreshold/Main.lean:25 (same statement text; different proof or body). Qualify references as OAI.LeanBlast.SecondKahnKalai.secondKahnKalaiBounds@path.
```
theorem secondKahnKalaiBounds (n : ℕ) (V : Type u) [Fintype V]
    (H : SimpleGraph V) (hn : 2 ≤ n) (hcard : Fintype.card V ≤ n)
    (hedge : 1 ≤ edgeCount H) : SecondKahnKalaiBounds n H := by
…
```
Mentions: OAI.LeanBlast.SecondKahnKalai.edgeCount, OAI.LeanBlast.SecondKahnKalai.SecondKahnKalaiBounds