glove_number_complete_graph_le_three
For any integer $n$ such that $2 \\le n \\le 3$, the glove number of the complete graph $K_n$ is equal to $n - 1$.
Statement
theorem glove_number_complete_graph_le_three (n : ℕ) (h2 : 2 ≤ n) (h3 : n ≤ 3) :
glove_number (SimpleGraph.completeGraph (Fin n)) = n - 1- Source
- arXiv:2610.17602 line 348 -- Clean handshake sequences
- Verified
- 08 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- glove_number_k2The glove number of the complete graph $K_2$ is equal to 1.
- glove_number_k3The glove number of the complete graph $K_3$ is equal to 2.
- glove_numberThe glove number $\mathrm{gl}(G)$ of a simple graph $G$ is the minimum number of gloves $k \in \mathbb{N}$ admitting a clean handshake…
Read back from the Lean
For any natural number $n$ such that $2 ≤ n$ and $n ≤ 3$ (that is, $n \in \{2, 3\}$), the glove number of the complete graph on vertices Fin n equals $n - 1$.
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 theorem is proved by a case analysis on the natural number n. Because 2 ≤ n ≤ 3, the only possibilities are n = 2 and n = 3. Each case then follows immediately from the known glove numbers for K₂ and K₃, which are 1 and 2, respectively.
The claim reduces to checking the cases n = 2 and n = 3.
Given the hypotheses 2 ≤ n (h2) and n ≤ 3 (h3) on the natural number n, the only integer values n can take are 2 and 3. The proof splits into these two cases.
interval_cases n
For n = 2, the glove number of K₂ is 2 - 1 = 1.
In the case n = 2, the goal asks for the glove number of K₂ to equal 2 - 1 = 1, which is established directly by glove_number_k2.
uses
glove_number_k2· exact glove_number_k2For n = 3, the glove number of K₃ is 3 - 1 = 2.
In the case n = 3, the goal asks for the glove number of K₃ to equal 3 - 1 = 2, which is established directly by glove_number_k3.
uses
glove_number_k3· exact glove_number_k3
glove_number_k2- The glove number of the complete graph on 2 vertices, K₂, is 1.
glove_number_k3- The glove number of the complete graph on 3 vertices, K₃, is 2.
- The arithmetic expressions 2 - 1 and 3 - 1 reduce definitionally to 1 and 2, so the goals match the lemma statements directly.
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.
/-- The glove number of K_n equals n - 1 for n = 2 and n = 3. -/theorem glove_number_complete_graph_le_three (n : ℕ) (h2 : 2 ≤ n) (h3 : n ≤ 3) : glove_number (SimpleGraph.completeGraph (Fin n)) = n - 1 := by interval_cases n · exact glove_number_k2 · exact glove_number_k3