glove_number_complete_graph_eq_of_not_has_seq
For any integer $n \\ge 2$, if no clean handshake sequence using $n - 2$ gloves covers all edges of $K_n$, then the glove number of $K_n$ is equal to $n - 1$.
Statement
theorem glove_number_complete_graph_eq_of_not_has_seq (n : ℕ) (hn : 2 ≤ n)
(h : ¬ has_clean_handshake_seq (SimpleGraph.completeGraph (Fin n)) (n - 2)) :
glove_number (SimpleGraph.completeGraph (Fin n)) = n - 1- Source
- arXiv:2610.17602 -- Clean handshake sequences
- Verified
- 08 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- glove_number_complete_graph_eq_iff_not_has_seqFor any integer $n \\ge 2$, the glove number of the complete graph $K_n$ is equal to $n - 1$ if and only if no clean handshake sequence…
- has_clean_handshake_seqA simple graph $G$ has a clean handshake sequence with $k$ gloves if there exists a sequence of handshakes over glove type…
- 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 \ge 2$, if the complete graph on $n$ vertices (with vertex type Fin n) does not admit a clean handshake sequence using $n - 2$ gloves, then the glove number of the complete graph on $n$ vertices is equal to $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 follows directly from the characterization theorem glove_number_complete_graph_eq_iff_not_has_seq, which states that for n ≥ 2, the glove number of the complete graph K_n is n - 1 if and only if no clean handshake sequence with n - 2 gloves covers all edges of K_n. Applying the reverse implication of this if-and-only-if statement to the hypothesis completes the proof in one step.
The glove number of the complete graph K_n is equal to n - 1.
The lemma glove_number_complete_graph_eq_iff_not_has_seq states that for n ≥ 2, the glove number of K_n is n - 1 if and only if there is no clean handshake sequence covering K_n with n - 2 gloves. Applying the right-to-left direction (.mpr) of this equivalence to the hypothesis h yields the result directly.
uses
glove_number_complete_graph_eq_iff_not_has_seqexact (glove_number_complete_graph_eq_iff_not_has_seq n hn).mpr h
glove_number_complete_graph_eq_iff_not_has_seq- For any integer n ≥ 2, the glove number of the complete graph K_n equals n - 1 if and only if no clean handshake sequence using n - 2 gloves covers all edges of K_n.
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.
/-- If no clean handshake sequence with n - 2 gloves covers all edges of K_n, then the glove number of K_n equals n - 1. -/theorem glove_number_complete_graph_eq_of_not_has_seq (n : ℕ) (hn : 2 ≤ n) (h : ¬ has_clean_handshake_seq (SimpleGraph.completeGraph (Fin n)) (n - 2)) : glove_number (SimpleGraph.completeGraph (Fin n)) = n - 1 := by exact (glove_number_complete_graph_eq_iff_not_has_seq n hn).mpr h