AFTD Auto-Formalizing Theoretical Domains

circleMultiset

def

Given an implicit natural number S and an implicit type α, a hypothesis hS : 3 ≤ S, a protocol p : CircleLocalView (Fin S) → α, and a permutation π : Equiv.Perm (Fin S), circleMultiset hS p π is the multiset Finset.univ.val.map (fun i => p (circleView hS π i)).

Statement

def circleMultiset {S : ℕ} {α : Type*} (hS : 3 ≤ S) (p : CircleLocalView (Fin S) → α) (π : Equiv.Perm (Fin S)) : Multiset α
Defined in
arXiv:2610.33032, Section 2
Verified
30 Oct 2026
Axioms
none listed
Built on 2
  • CircleLocalViewFor sages of type α, a local view in an unlabeled circle consists of the sage's own identity together with their left neighbor and right…
  • circleViewGiven an implicit natural number S, a hypothesis hS : 3 ≤ S, a permutation π : Equiv.Perm (Fin S), and a seat index i : Fin S, circleView…
Used by 1
  • CircleProtocolSolvesGiven a natural number S, an implicit type α, a hypothesis hS : 3 ≤ S, and a protocol p : CircleLocalView (Fin S) → α,…

Read back from the Lean

Given a natural number S, a type α, a hypothesis hS : 3 ≤ S, a function p : CircleLocalView (Fin S) → α, and a permutation π of Fin S, circleMultiset is defined as the multiset in Multiset α obtained by mapping each i : Fin S in the universal finset Finset.univ to p (circleView hS π i).

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 multiset of symbols announced by sages in a circular seating. -/
def circleMultiset {S : ℕ} {α : Type*} (hS : 3 ≤ S) (p : CircleLocalView (Fin S) → α) (π : Equiv.Perm (Fin S)) : Multiset α := Finset.univ.val.map (fun i => p (circleView hS π i))
See it in the graphDiscuss this resultChallenge it