---What’s been checked · C(24,14,4) ≥ 20
C(24,14,4)≥ 20

What’s been checked

How much to trust this

A Lean proof can fail to mean what it says in two ways: it can rely on extra assumptions, or prove a different statement than intended. Here is what rules each out, and what hasn’t been checked yet.

The statement to audit

This is the whole of Challenge.lean. It imports only Mathlib’s Finset and uses the textbook definition of a covering design. The two sorrys are the holes that Solution.lean fills.

module

public import Mathlib.Data.Finset.Card

public section

/-!
# Lower bounds for the covering numbers C(24,14,4) and C(25,15,5)

A `(v, k, t)` covering design is a family of `k`-element subsets (blocks) of a `v`-element set
such that every `t`-element subset is contained in at least one block. The covering number
`C(v, k, t)` is the least number of blocks in such a design.

The two theorems below say that `C(24, 14, 4) ≥ 20` and `C(25, 15, 5) ≥ 34`. The point set is
`Fin v`, a family of blocks is a `Finset` of `Finset`s, and no other definitions are used.
-/

/-- Every family of 14-element subsets of a 24-element set that covers every 4-element subset
has at least 20 members. That is, `C(24, 14, 4) ≥ 20`. -/
theorem Covering.Palomar.covering_24_14_4_lower_bound (𝒯 : Finset (Finset (Fin 24)))
    (hk : ∀ B ∈ 𝒯, B.card = 14)
    (hcov : ∀ S : Finset (Fin 24), S.card = 4 → ∃ B ∈ 𝒯, S ⊆ B) :
    20 ≤ 𝒯.card := by
  sorry

/-- Every family of 15-element subsets of a 25-element set that covers every 5-element subset
has at least 34 members. That is, `C(25, 15, 5) ≥ 34`. -/
theorem Covering.Palomar.covering_25_15_5_lower_bound (𝒯 : Finset (Finset (Fin 25)))
    (hk : ∀ B ∈ 𝒯, B.card = 15)
    (hcov : ∀ S : Finset (Fin 25), S.card = 5 → ∃ B ∈ 𝒯, S ⊆ B) :
    34 ≤ 𝒯.card := by
  sorry

Both proved theorems report:

depends on axioms: [propext, Classical.choice, Quot.sound]

The checks

  • Checked by Lean

    The proof compiles, with no gaps

    All 69 proof modules build with Lean 4.35.0-rc3 and Mathlib v4.35.0-rc3, with no sorry. Every final theorem depends only on Lean’s three standard axioms. CI rebuilds it on every push.

  • Checked by Comparator

    It proves exactly the stated theorem

    Comparator confirms that Solution.lean proves the statements in Challenge.lean, replaying the proof through Lean’s kernel and two independent kernels, NanoDa and con-ron. CI runs it on every push.

  • Registered on Palomar

    An independent registry checked it

    Palomar, a registry of Lean-verified results, ran the same check on its own machines and registered the proof that follows the paper as version 2 of entry PALOMAR-2026-10-04-000003, at commit 401d986, whose Lean sources this site shows. Version 1, registered on 4 October, is the agents’ original Lean proof at commit 17bca00.

  • Checked by Lean

    The definitions mean the textbook ones

    The development works with indexed families, lists of blocks that may repeat. Covering/Finset.lean derives the textbook Finset statement from those theorems, so a definition that secretly meant something stronger would make that derivation fail.

  • Rebuilt twice

    The agents’ original proof, rebuilt on two Lean versions

    Before the rewrite, every module of the agents’ proof was rebuilt from source and re-checked with leanchecker on Lean 4.34.1 and 4.35.0-rc3. The records are in the verification folder, and that proof is kept at tag agent-proof-v1.

  • Not yet reviewed

    A mathematician reading the proof

    Nobody has reviewed the mathematics yet; a review has been requested. Agents reviewed each other during the campaign, which is not peer review.

  • Not checked

    The paper and this site match the Lean

    Lean checks the formal proof, not the prose of the paper or of this site. The repository’s README maps each numbered result of the paper to the Lean declarations that prove it, and this site checks at build time that every declaration it cites exists. Whether each statement says what the paper says is for a reader to judge.

Check it yourself

With elan installed, in a clone of the repository:

lake exe cache get
lake build

The build prints the axioms of each final theorem and takes a few minutes on a laptop. lake env leanchecker <Module> re-checks a module with Lean’s kernel, and scripts/verify-comparator.sh runs Comparator the way Palomar does (Linux only).

Versions

Palomar entry
PALOMAR-2026-10-04-000003, version 2, at commit 401d986; version 1 at 17bca00
This site
Built from the paper and the Lean sources at 36ec6e6
The agents’ proof
Tag agent-proof-v1, the proof Palomar registered as version 1
Original sources
Tag original-2026-10-03, exactly as the agents left them, on Lean 4.34.1
Toolchain
Lean 4.35.0-rc3, Mathlib v4.35.0-rc3

Read the proof →