handshake_edge
def
The unordered edge in $\mathrm{Sym}^2(V)$ covered by a handshake between vertices $x$ and $y$, namely $s(x, y)$.
Statement
def handshake_edge {V : Type*} {Γ : Type*} (h : Handshake V Γ) : Sym2 V
- Defined in
- scout/2610-17602-clean-handshake-sequences.md:154
- Verified
- 18 Oct 2026
- Axioms
- none listed
- Built on 1
- HandshakeA handshake between vertices in $V$ using gloves from $\Gamma$, which is either single-gloved (one vertex wears a glove side inside, the…
- Used by 8
- 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_number_complete_graph_no_zero_glovesFor any integer $n \ge 2$, there is no clean handshake sequence with zero gloves covering all edges of the complete graph $K_n$.
- glove_number_complete_graph_le_iffFor $n \ge 2$ and every $k$, the glove number of $K_n$ is at most $k$ if and only if $K_n$ has a clean handshake sequence with $k$ gloves.
- 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_number_complete_graph_upper_boundFor all integers $n \ge 2$, the glove number of the complete graph $K_n$ is at most $n - 1$.
- glove_number_complete_graph_posFor every integer $n \ge 2$, the glove number of the complete graph $K_n$ is at least 1.
- has_clean_handshake_seq_succIf a graph $G$ admits a clean handshake sequence with $k$ gloves, then it admits one with $k+1$ gloves: an extra glove can be left unused.
Read back from the Lean
Given types V and Γ, handshake_edge defines a function from Handshake V Γ to Sym2 V (the type of unordered pairs of elements of V). Given h : Handshake V Γ, it returns the unordered pair s(x, y) consisting of the two vertex endpoints:
- If h is Handshake.single x a y, it returns s(x, y).
- If h is Handshake.double x a b y, it returns s(x, y).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The edge covered by a handshake. -/ def handshake_edge {V : Type*} {Γ : Type*} (h : Handshake V Γ) : Sym2 V := match h with | .single x _ y => s(x, y) | .double x _ _ y => s(x, y)