AFTD Auto-Formalizing Theoretical Domains

gf8_oracle_syndrome_singleton

theoremverified

Sanity check: the GF(8) oracle has no order-one syndrome.

Statement

theorem gf8_oracle_syndrome_singleton (a : Fin 9) : gf8_oracle_syndrome {a} = 0
Source
sanity check of the definition gf8_oracle_syndrome (arXiv:2610.01024 Prop. 55 and Fact 21)
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • gf8_oracle_syndromeThe syndrome s_A of the GF(8) multiplication phase oracle U_3 |x, y, z> = (-1)^{z . (x * y)} |x, y, z> on nine qubits: s_A = 1 iff A =…
Used by 1
  • gf8_oracle_t_count_ge_20The slice-rank floor of arXiv:2610.01024 Proposition 59 at k = 3: every parity representation of the GF(8) multiplication oracle's…

The proof, explained

The theorem states that no singleton set in $\mathrm{Fin}(9)$ has a nonzero syndrome under the GF(8) oracle. According to the definition, the syndrome is 1 only for three-element sets of the form $\{q, 3+r, 6+l\}$, which cannot equal a singleton. The proof moves the parameter $a$ into the goal and closes it by exhaustive finite computation (`decide`) over all 9 elements of $\mathrm{Fin}(9)$.

  1. For every $a \in \mathrm{Fin}(9)$, $\mathrm{gf8\_oracle\_syndrome}(\{a\}) = 0$. automation

    Reverting $a$ generalizes the goal to the universal statement $\forall a : \mathrm{Fin}(9), \mathrm{gf8\_oracle\_syndrome}(\{a\}) = 0$. Because $\mathrm{Fin}(9)$ has only 9 elements and the existential quantifier in the definition of $\mathrm{gf8\_oracle\_syndrome}$ ranges over the finite type $\mathrm{Fin}(3) \times \mathrm{Fin}(3) \times \mathrm{Fin}(3)$ (27 candidates), the proposition is decidable and is closed by exhaustive evaluation (`decide`).

    line 2

      revert a; decide

Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

theorem gf8_oracle_syndrome_singleton (a : Fin 9) : gf8_oracle_syndrome {a} = 0 := by  revert a; decide
See it in the graphDiscuss this resultChallenge it