sages_row_edge_set
def
The set of adjacent pairs of sages in a row seating π of S sages: all unordered pairs {π i, π (i + 1)} with i.val + 1 < S.
Statement
def sages_row_edge_set {S : ℕ} (π : Equiv.Perm (Fin S)) : Finset (Finset (Fin S))- Source
- step towards sages_row_upper_bound_binomial
- Verified
- 29 Oct 2026
- Axioms
- none listed
- Used by 1
- sages_row_upper_bound_binomialFor every integer S ≥ 3, the anonymous-slip puzzle for S sages in a row with unlabeled seats can be solved using Nat.choose S 2 symbols.
Lean source view module on GitHub
/-- The set of adjacent pairs (edges) of a row seating, indexed by the subtype of positions with a right neighbour. -/ def sages_row_edge_set {S : ℕ} (π : Equiv.Perm (Fin S)) : Finset (Finset (Fin S)) := Finset.univ.image fun i : {i : Fin S // i.val + 1 < S} => ({π i.1, π ⟨i.1.val + 1, i.2⟩} : Finset (Fin S))