What was already known
Chen, Gohari and Nair posed a broader Hellinger conjecture and developed the finite-dimensional reduction used in this work.
AI involvement
The authors credit OpenAI GPT models with substantial work on the proof of the central three-point inequality during extended exchanges. They wrote the manuscript and Lean theorem statements. Codex generated the Lean proofs under their supervision.
- Statement on use of AIStatement on use of AI
Importance
The theorem establishes a two-summary special case of the Hellinger problem through a concrete inequality that can be checked in Lean.
Technical verification
The paper links the Lean statement for the weak inequality and distinguishes it from the separate statement for its three-point inequality.
Formal checking
Checked the weak Hellinger theorem in the pinned Lean source.
- Checker
- Lean 4 kernel
- Scope
- The paper proves the weak Hellinger inequality for a noisy Boolean channel with a one-bit summary at each end. A central step is a three-parameter inequality proved with Bernstein-polynomial bounds and finite positivity checks.
- Basis
- Reported by the linked checker
- Lean statement of the weak inequalityLean statement of the weak inequality
Human understanding
The authors explain their reduction and the Bernstein-polynomial method. The disclosure leaves independent human reconstruction of the central AI-assisted positivity proof undocumented.
Other useful sources
Correction and publication history
Reviewed the primary result and its documented AI and checking scope.
Read this published revision