AFTD Auto-Formalizing Theoretical Domains

rowMultiset

def

Given a hypothesis 2 ≤ S, the public multiset of values produced by a protocol p : RowLocalView (Fin S) → α on a row seating π : Equiv.Perm (Fin S) is the multiset obtained by mapping fun i => p (rowView hS π i) over all seats i : Fin S in Finset.univ.val.

Statement

def rowMultiset {S : ℕ} {α : Type*} (hS : 2 ≤ S) (p : RowLocalView (Fin S) → α) (π : Equiv.Perm (Fin S)) : Multiset α
Defined in
arXiv:2610.33032:180
Verified
27 Oct 2026
Axioms
none listed
Built on 2
  • RowLocalViewFor sages of type α, a local view in an unlabeled row consists of the sage's own identity together with an optional left neighbor and an…
  • rowViewGiven a row seating of S sages represented as a permutation π with 2 ≤ S, the local view at position i is the sage π i along with their…
Used by 4
  • row_solvable_monoIf the anonymous-slip puzzle for S sages in a row with unlabeled seats is solvable with n symbols (RowProblemSolvable S n hS), then it is…
  • row_protocol_solves_of_injectiveIf a protocol with announcements in α solves the row puzzle, then composing it with any injective map α → β gives a protocol with…
  • 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.
  • RowProtocolSolvesA protocol p : RowLocalView (Fin S) → α solves the anonymous-slip puzzle for S sages in a row with 2 ≤ S without seat labels if for every…

Read back from the Lean

Given a natural number S ≥ 2, a type α, a function p : RowLocalView (Fin S) → α, and a permutation π of Fin S, rowMultiset is the multiset obtained by evaluating p on the local view (rowView hS π i) for every index i : Fin S (as i ranges over Finset.univ).

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 public multiset of values produced by a protocol on a row seating. -/
def rowMultiset {S : ℕ} {α : Type*} (hS : 2 ≤ S) (p : RowLocalView (Fin S) → α) (π : Equiv.Perm (Fin S)) : Multiset α := Finset.univ.val.map (fun i => p (rowView hS π i))
See it in the graphDiscuss this resultChallenge it