AFTD Auto-Formalizing Theoretical Domains

six_circle_total_const_zero

theoremverified

Under the constant zero protocol, the total number of 1s in any circular seating π of six sages is 0.

Statement

theorem six_circle_total_const_zero (π : Equiv.Perm (Fin 6)) :
    ∑ i : Fin 6, ((fun _ : Fin 6 × Fin 6 × Fin 6 × Fin 6 => (0 : Fin 2)) (π i, i, π (i - 1), π (i + 1)) : ℕ) = 0
Source
folklore
Verified
28 Oct 2026
Axioms
Classical.choiceQuot.soundpropext

Read back from the Lean

For every permutation π of Fin 6, the sum over all i : Fin 6 of the constant function (which maps any 4-tuple in Fin 6 × Fin 6 × Fin 6 × Fin 6 to 0 : Fin 2) applied to (π i, i, π (i - 1), π (i + 1)) and coerced to ℕ equals 0.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The theorem asserts that summing the constant-zero protocol over all six positions in any seating permutation $\pi$ yields 0. Because the protocol unconditionally outputs 0, each term evaluates to 0 in $\mathbb{N}$, and the sum of six zeros is 0. The Lean simplifier verifies this directly by beta reduction and standard arithmetic on finite sums.

  1. The summation evaluates to 0, establishing the identity. automation

    The summand applies a constant function that returns $0 \in \mathrm{Fin}\;2$, which casts to $0 \in \mathbb{N}$. The simplifier beta-reduces the application, evaluates the cast of $0$ to $0$, and sums six zeros to obtain $0$.

    line 4

      simp

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- Sanity lemma: the constant zero protocol yields a total of 0 in every seating. -/theorem six_circle_total_const_zero (π : Equiv.Perm (Fin 6)) :    ∑ i : Fin 6, ((fun _ : Fin 6 × Fin 6 × Fin 6 × Fin 6 => (0 : Fin 2)) (π i, i, π (i - 1), π (i + 1)) : ℕ) = 0 := by  simp
See it in the graphDiscuss this resultChallenge it