bipartite_link_template_three_graph_card
The template 3-graph has 24 edges.
Statement
theorem bipartite_link_template_three_graph_card : bipartite_link_template_three_graph.card = 24- Source
- Sanity check of the definitions of arXiv:2610.11642 (A counterexample to the bipartite-link conjecture for 3-graphs).
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- bipartite_link_template_three_graphThe 9-vertex template 3-graph on {0, …, 8} with the 24 triples listed in (2.1).
The proof, explained
The theorem states that the 3-uniform hypergraph bipartite_link_template_three_graph has cardinality 24. Because the hypergraph is explicitly defined as a concrete finite set of 24 triples over the 9-element vertex set {0, …, 8}, its cardinality is decidable. The proof succeeds by direct computational evaluation via the decide tactic.
The hypergraph bipartite_link_template_three_graph contains exactly 24 edges. automation
Because bipartite_link_template_three_graph is defined by an explicit enumeration of 24 triples of vertices in Fin 9, its cardinality is a decidable arithmetic quantity. The decide tactic evaluates the set by computational reflection, verifying that all 24 triples are pairwise distinct and that their count equals 24.
decide
- The equality is established entirely by computational reflection (`decide`), with Lean calculating the cardinality of the explicit finite set directly without intermediate human-readable steps.
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
theorem bipartite_link_template_three_graph_card : bipartite_link_template_three_graph.card = 24 := by decide