AFTD Auto-Formalizing Theoretical Domains

CircleProtocolSolves

def

Given a natural number S, an implicit type α, a hypothesis hS : 3 ≤ S, and a protocol p : CircleLocalView (Fin S) → α, CircleProtocolSolves S hS p asserts that for all sages x : Fin S and all seatings π₁ π₂ : Equiv.Perm (Fin S), if circleViewOfSage hS π₁ x = circleViewOfSage hS π₂ x and circleMultiset hS p π₁ = circleMultiset hS p π₂, then there exists k : Fin S such that for all i : Fin S, π₁ (i + k) = π₂ i.

Statement

def CircleProtocolSolves (S : ℕ) {α : Type*} (hS : 3 ≤ S) (p : CircleLocalView (Fin S) → α) : Prop
Defined in
arXiv:2610.33032, Section 2
Verified
30 Oct 2026
Axioms
none listed
Built on 4
  • 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…
  • circleViewOfSageGiven an implicit natural number S, a hypothesis hS : 3 ≤ S, a permutation π : Equiv.Perm (Fin S), and a sage x : Fin S, circleViewOfSage…
  • circleMultisetGiven an implicit natural number S and an implicit type α, a hypothesis hS : 3 ≤ S, a protocol p : CircleLocalView (Fin S) → α, and a…
Used by 1
  • CircleProblemSolvableGiven natural numbers S and n and a hypothesis hS : 3 ≤ S, CircleProblemSolvable S n hS asserts that there exists a protocol p :…

Read back from the Lean

The definition CircleProtocolSolves takes a natural number S, an implicit type α, a proof hS : 3 ≤ S, and a protocol function p : CircleLocalView (Fin S) → α. It asserts that for every element x : Fin S and every pair of permutations π₁, π₂ : Equiv.Perm (Fin S): - if the local view of x under π₁ equals the local view of x under π₂ (circleViewOfSage hS π₁ x = circleViewOfSage hS π₂ x), and - the multiset of protocol values produced under π₁ equals that under π₂ (circleMultiset hS p π₁ = circleMultiset hS p π₂), then there exists a cyclic shift k : Fin S such that for all positions i : Fin S, π₁ (i + k) = π₂ i (i.e., π₂ is obtained from π₁ by rotating the indices by k).

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

/-- Predicate that a protocol solves the circle anonymous-slip puzzle without seat labels. -/
def CircleProtocolSolves (S : ℕ) {α : Type*} (hS : 3 ≤ S) (p : CircleLocalView (Fin S) → α) : Prop :=
  have : NeZero S := ⟨by omega⟩
  ∀ (x : Fin S) (π₁ π₂ : Equiv.Perm (Fin S)),
    circleViewOfSage hS π₁ x = circleViewOfSage hS π₂ x →
    circleMultiset hS p π₁ = circleMultiset hS p π₂ →
    ∃ k : Fin S, ∀ i : Fin S, π₁ (i + k) = π₂ i
See it in the graphDiscuss this resultChallenge it