`ComparatorChallenges/TraceReconstruction.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

16 declarations, 3 contain sorry, 0 declared as axioms

abbrev OAI.TraceReconstruction.Word line 10
Also declared: OAI/Probability/TraceReconstruction/Model.lean:19 (same declaration text).
abbrev OAI.TraceReconstruction.Mask line 11
Also declared: OAI/Probability/TraceReconstruction/Model.lean:20 (same declaration text).
abbrev OAI.TraceReconstruction.Trace line 12
Also declared: OAI/Probability/TraceReconstruction/Model.lean:21 (same declaration text).
def OAI.TraceReconstruction.traceOfMask true retains the bit line 15
Source documentation
true retains the bit. The observer gets only the resulting list.
L4DEL explanation
true retains the bit. The observer gets only the resulting list.
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/Probability/TraceReconstruction/Model.lean:24 (same declaration text).
```
def traceOfMask {n : ℕ} (x : Word n) (a : Mask n) : Trace :=
…
```
Mentions: OAI.TraceReconstruction.Word, OAI.TraceReconstruction.Mask, OAI.TraceReconstruction.Trace
def OAI.TraceReconstruction.maskWeight The deletion-mask probability, with deletion probability q line 19
Source documentation
The deletion-mask probability, with deletion probability q.
L4DEL explanation
The deletion-mask probability, with deletion probability q.
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/Probability/TraceReconstruction/Model.lean:28 (same declaration text).
```
def maskWeight {n : ℕ} (q : ℝ) (a : Mask n) : ℝ :=
…
```
Mentions: OAI.TraceReconstruction.Mask
def OAI.TraceReconstruction.traceMass Law of a single complete trace line 23
Source documentation
Law of a single complete trace.
L4DEL explanation
Law of a single complete trace.
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/Probability/TraceReconstruction/Model.lean:32 (same declaration text).
```
def traceMass {n : ℕ} (q : ℝ) (x : Word n) (w : Trace) : ℝ :=
…
```
Mentions: OAI.TraceReconstruction.Word, OAI.TraceReconstruction.Trace
def OAI.TraceReconstruction.traceSpace All possible complete outputs from length-n inputs, with lengths included line 27
Source documentation
All possible complete outputs from length-n inputs, with lengths included.
L4DEL explanation
All possible complete outputs from length-n inputs, with lengths included.
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/Probability/TraceReconstruction/Model.lean:36 (same declaration text).
```
def traceSpace (n : ℕ) : Finset Trace :=
…
```
Mentions: OAI.TraceReconstruction.Trace
def OAI.TraceReconstruction.traceTV 1/2 sum of absolute differences, on the full finite output space line 32
Source documentation
1/2 sum of absolute differences, on the full finite output space.
L4DEL explanation
1/2 sum of absolute differences, on the full finite output space.
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/Probability/TraceReconstruction/Model.lean:41 (same declaration text).
```
def traceTV {n : ℕ} (q : ℝ) (x y : Word n) : ℝ :=
…
```
Mentions: OAI.TraceReconstruction.Word
def OAI.TraceReconstruction.IsEstimator The estimator may depend arbitrarily on n, q and every complete sample line 37
Source documentation
The estimator may depend arbitrarily on n, q and every complete sample. Its value is its conditional probability of reporting the given input.
L4DEL explanation
The estimator may depend arbitrarily on n, q and every complete sample. Its value is its conditional probability of reporting the given input.
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/Probability/TraceReconstruction/Model.lean:46 (same declaration text).
```
def IsEstimator {n m : ℕ} (A : (Fin m → Trace) → Word n → ℝ) : Prop :=
…
```
Mentions: OAI.TraceReconstruction.Trace, OAI.TraceReconstruction.Word
def OAI.TraceReconstruction.reconstructionSuccess Independent masks generate independent complete traces; no retained positions, boundaries or other latent variables are revealed to A line 42
Source documentation
Independent masks generate independent complete traces; no retained positions, boundaries or other latent variables are revealed to A.
L4DEL explanation
Independent masks generate independent complete traces; no retained positions, boundaries or other latent variables are revealed to A.
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/Probability/TraceReconstruction/Model.lean:51 (same declaration text).
```
def reconstructionSuccess {n m : ℕ} (q : ℝ)
    (A : (Fin m → Trace) → Word n → ℝ) (x : Word n) : ℝ :=
…
```
Mentions: OAI.TraceReconstruction.Trace, OAI.TraceReconstruction.Word
def OAI.TraceReconstruction.SufficientBudget line 47
Also declared: OAI/Probability/TraceReconstruction/Model.lean:56 (same declaration text).
def OAI.TraceReconstruction.sampleComplexity Natural fixed sample budget; infimum of the empty set is infinity line 52
Source documentation
Natural fixed sample budget; infimum of the empty set is infinity.
L4DEL explanation
Natural fixed sample budget; infimum of the empty set is infinity.
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/Probability/TraceReconstruction/Model.lean:61 (same declaration text).
```
noncomputable def sampleComplexity (n : ℕ) (q s : ℝ) : ℝ≥0∞ :=
…
```
def OAI.TraceReconstruction.minTraceTV The real infimum is a minimum for n>0 (a nonempty finite set) line 56
Source documentation
The real infimum is a minimum for n>0 (a nonempty finite set).
L4DEL explanation
The real infimum is a minimum for n>0 (a nonempty finite set).
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)
Distinct definitions of this name: OAI/Probability/TraceReconstruction/Model.lean:65 (same statement text; different proof or body). Qualify references as OAI.TraceReconstruction.minTraceTV@path.
```
noncomputable def minTraceTV (n : ℕ) (q : ℝ) : ℝ :=
…
```
theorem OAI.TraceReconstruction.quantitative_sample_lower_bound Challenge statement: Quantitative trace-reconstruction bounds with a uniform decoder sorry line 62
L4DEL explanation
The formalization proves superpolynomial sample lower bounds for exact worst-case reconstruction of binary words from independent deletion traces, with unrestricted computation and any fixed positive success probability. For every fixed deletion probability $q\in(0,1)$, sample complexity grows faster than every fixed power of the word length; the minimum total-variation distance between two one-trace laws decays faster than every inverse power. More quantitatively, along sequences with $q^3\log n\to\infty$, the required number of samples is at least $n^{c\log(q^3\log n)}$ eventually for every fixed $0<c<1/(4\log2)$. All logarithms are natural.
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.Probability.TraceReconstruction as the released solution module checked against this declaration.
Sources and attribution: Pinned Lean source (fd4aeeb2ee4f)
Distinct definitions of this name: OAI/Probability/TraceReconstruction.lean:213 (same statement text; different proof or body). Qualify references as OAI.TraceReconstruction.quantitative_sample_lower_bound@path.
```
theorem quantitative_sample_lower_bound
    (s c : ℝ) (hs : s ∈ Set.Ioc 0 1)
    (hc : c ∈ Set.Ioo 0 (1 / (4 * Real.log 2)))
    (n : ℕ → ℕ) (q : ℕ → ℝ)
    (hn : Tendsto n atTop atTop)
    (hq : ∀ k, q k ∈ Set.Ioo 0 1)
    (hscale : Tendsto (fun k => (q k) ^ 3 * Real.log (n k)) atTop atTop) :
    ∀ᶠ k in atTop,
      ENNReal.ofReal ((n k : ℝ) ^ (c * Real.log ((q k) ^ 3 * Real.log (n k)))) ≤
        sampleComplexity (n k) (q k) s := by
…
```
Mentions: OAI.TraceReconstruction.sampleComplexity
theorem OAI.TraceReconstruction.superpolynomial_one_trace Challenge statement: Quantitative trace-reconstruction bounds with a uniform decoder sorry line 74
L4DEL explanation
The formalization proves superpolynomial sample lower bounds for exact worst-case reconstruction of binary words from independent deletion traces, with unrestricted computation and any fixed positive success probability. For every fixed deletion probability $q\in(0,1)$, sample complexity grows faster than every fixed power of the word length; the minimum total-variation distance between two one-trace laws decays faster than every inverse power. More quantitatively, along sequences with $q^3\log n\to\infty$, the required number of samples is at least $n^{c\log(q^3\log n)}$ eventually for every fixed $0<c<1/(4\log2)$. All logarithms are natural.
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.Probability.TraceReconstruction as the released solution module checked against this declaration.
Sources and attribution: Pinned Lean source (fd4aeeb2ee4f)
Distinct definitions of this name: OAI/Probability/TraceReconstruction.lean:332 (different declaration text). Qualify references as OAI.TraceReconstruction.superpolynomial_one_trace@path.
```
theorem superpolynomial_one_trace
    (q : ℝ) (hq : q ∈ Set.Ioo 0 1) (C : ℝ) (hC : 0 < C) :
    Tendsto (fun n : ℕ => (n : ℝ) ^ C * minTraceTV n q) atTop (𝓝 0) := by
…
```
theorem OAI.TraceReconstruction.superpolynomial_sample_complexity Challenge statement: Quantitative trace-reconstruction bounds with a uniform decoder sorry line 79
L4DEL explanation
The formalization proves superpolynomial sample lower bounds for exact worst-case reconstruction of binary words from independent deletion traces, with unrestricted computation and any fixed positive success probability. For every fixed deletion probability $q\in(0,1)$, sample complexity grows faster than every fixed power of the word length; the minimum total-variation distance between two one-trace laws decays faster than every inverse power. More quantitatively, along sequences with $q^3\log n\to\infty$, the required number of samples is at least $n^{c\log(q^3\log n)}$ eventually for every fixed $0<c<1/(4\log2)$. All logarithms are natural.
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.Probability.TraceReconstruction as the released solution module checked against this declaration.
Sources and attribution: Pinned Lean source (fd4aeeb2ee4f)
Distinct definitions of this name: OAI/Probability/TraceReconstruction.lean:378 (same statement text; different proof or body). Qualify references as OAI.TraceReconstruction.superpolynomial_sample_complexity@path.
```
theorem superpolynomial_sample_complexity
    (q : ℝ) (hq : q ∈ Set.Ioo 0 1) (s : ℝ) (hs : s ∈ Set.Ioc 0 1)
    (C : ℝ) (hC : 0 < C) :
    Tendsto
      (fun n : ℕ => sampleComplexity n q s / ENNReal.ofReal ((n : ℝ) ^ C))
      atTop (𝓝 ⊤) := by
…
```
Mentions: OAI.TraceReconstruction.sampleComplexity