CircleProblemSolvable
Given natural numbers S and n and a hypothesis hS : 3 ≤ S, CircleProblemSolvable S n hS asserts that there exists a protocol p : CircleLocalView (Fin S) → Fin n satisfying CircleProtocolSolves S hS p.
Statement
def CircleProblemSolvable (S n : ℕ) (hS : 3 ≤ S) : Prop
- 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…
- 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 natural numbers S and n, and a hypothesis hS : 3 ≤ S, this asserts that there exists a protocol function p : Fin S × Fin S × Fin S → Fin n such that:
for every sage label x : Fin S and any two permutations π₁, π₂ : Equiv.Perm (Fin S),
if the local view of x under π₁ equals the local view of x under π₂ (that is, (x, π₁(π₁⁻¹(x) - 1), π₁(π₁⁻¹(x) + 1)) = (x, π₂(π₂⁻¹(x) - 1), π₂(π₂⁻¹(x) + 1)) in Fin S),
and the multiset of protocol outputs across all positions is identical for π₁ and π₂ (that is, the multiset of p(π₁(i), π₁(i - 1), π₁(i + 1)) over all i : Fin S equals the multiset of p(π₂(i), π₂(i - 1), π₂(i + 1)) over all i : Fin S),
then π₁ and π₂ are rotational shifts of each other (that is, there exists k : Fin S such that for all i : Fin S, π₁(i + k) = π₂(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
/-- Solvability of the circle anonymous-slip puzzle with n symbols without seat labels. -/ def CircleProblemSolvable (S n : ℕ) (hS : 3 ≤ S) : Prop := ∃ p : CircleLocalView (Fin S) → Fin n, CircleProtocolSolves S hS p