AFTD Auto-Formalizing Theoretical Domains

turan_hypergraph_four_card

theoremverified

The balanced 3-partite Turán hypergraph T₄ on 4 vertices has exactly 3 hyperedges.

Statement

theorem turan_hypergraph_four_card : (turan_hypergraph 4).card = 3
Source
arXiv:2611.16654:389
Verified
14 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • turan_hypergraphThe balanced 3-partite Turán 3-uniform hypergraph T_n on vertex set Fin n: its edges are all 3-element subsets e of Fin n such that either…

Read back from the Lean

The cardinality of turan_hypergraph 4 is equal to 3.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The result is established by direct finite computation. The vertex set $\mathrm{Fin}\ 4$ contains only $\binom{4}{3} = 4$ candidate triples of vertices, and the tripartite condition defining the Turán hypergraph $T_4$ is decidable for each candidate. Lean's kernel evaluates this condition exhaustively across all candidates to verify that exactly 3 triples qualify.

  1. Evaluating the definition of the Turán hypergraph on the 4-element vertex set yields a collection of exactly 3 hyperedges. automation

    Because $\mathrm{Fin}\ 4$ is a finite type, the collection of all subsets and the conditions in the definition of $\mathrm{turan\_hypergraph}$ (cardinality checks and existential quantification over $\mathbb{Z}/3\mathbb{Z}$) are algorithmically decidable. The `decide` tactic executes this computation directly, exhausting the $\binom{4}{3} = 4$ candidate 3-element subsets and determining that exactly 3 of them satisfy the partition condition.

    line 2

    theorem turan_hypergraph_four_card : (turan_hypergraph 4).card = 3 := by decide

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- T_4 has 3 edges. -/theorem turan_hypergraph_four_card : (turan_hypergraph 4).card = 3 := by decide
See it in the graphDiscuss this resultChallenge it