Papers·paper:Chvatal
Chvátal's Conjecture
Machine-checked by Palomar.
Fidelity F2: The correspondence is declared through a Comparator challenge, an alignment table and written divergences.
AI activity
How grades workNo AI contribution recorded against this statement.
Fidelity
How fidelity is gradedF2 declared. The correspondence is declared through a Comparator challenge, an alignment table and written divergences.
Checks
1-
verified·Palomar
Registered by Palomar at c46f715a: Comparator confirmed 9 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel
Declared by the projects
1As each project's formalization.yaml states it.
A formalization of Chang, Liu, and Liu's proof of Chvátal's conjecture
- authors
- Boon Suan Ho
- method
- agent — GPT-6
- review
- agent-reviewed (GPT-6 (Codex agents))
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- results
- 9 main results named, checked with Comparator, with an alignment table
- sources
- A proof of Chvátal's conjecture via a sharp correlation inequality — formalizes, authors other
- related
- leanprover-community/mathlib4/tree/0df444a360eaa60ab8c11dca51a86af692955474 — builds-on
- divergences
- The paper's cube is represented by finite subsets of an arbitrary finite coordinate type; Fin n gives its n-dimensional case. Statements requiring a star center, a minimum coordinate, or the maximal-intersecting/antipodal characterization explicitly require a nonempty coordinate type. This states the paper's implicit n >= 1 convention. The main quadratic and harmonic correlation inequalities also hold for zero coordinates. Influence is mean squared flip difference, proved equal to change probability for Boolean functions. The empty-index maximum is zero and contributes nothing to the spectral sum. Lean's zero-denominator division agrees with Theorem 1.2's convention. Proposition 5.3 is first proved for any selector contained in each nonempty index and then specialized to a fixed total-order maximum. Its layer-cake step is a finite positive-level decomposition rather than an integral, with no restriction on real nonnegative decreasing weights. No weakening of the advertised principal statements was identified by the AI-assisted checks. These checks do not establish that every sentence of the informal paper is correct.
- checked by
- Palomar
Follow and discuss
All discussionFollow this problem
An email when it has a new claim, check, bounty or discussion. You confirm once and can stop with one click.
Discussion and bounties for this problem load here.
Seen recently
What the monitors picked up in the last thirty days, not yet graded.
Something wrong or missing here? Request a correction or add a claim, with its sources.
Claims and corrections from readers
All of themFormal material
Formal statements · 1
Also known as · 2
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Paper/Chvatal.lean
- FormalConjectures/Paper/Chvatal.lean
Cite this record
qed.bot, “Chvátal's Conjecture”, https://qed.bot/s/paper-chvatal, as of 20 Nov 2026.