AFTD Auto-Formalizing Theoretical Domains

gf8_oracle_syndrome_same_register

theoremverified

Sanity check: the syndrome of the GF(8) oracle vanishes on a triple inside one register.

Statement

theorem gf8_oracle_syndrome_same_register : gf8_oracle_syndrome {0, 1, 2} = 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 =…

The proof, explained

The theorem checks that evaluating the GF(8) oracle syndrome on the subset {0, 1, 2} yields 0. By definition, the syndrome is 1 only when the input set contains one element from each of the three three-element registers {0, 1, 2}, {3, 4, 5}, and {6, 7, 8}. Because the set {0, 1, 2} lies entirely within the first register, the condition fails, and the claim is verified by finite computation.

  1. gf8_oracle_syndrome {0, 1, 2} = 0 automation

    By definition, `gf8_oracle_syndrome A` evaluates to 1 if and only if A has the form {q, 3 + r, 6 + l} for some q, r, l : Fin 3 with `gf8_mult_coeff q r l = 1`, and evaluates to 0 otherwise. For A = {0, 1, 2}, all three elements belong to the first register {0, 1, 2}, whereas any set satisfying the condition must contain one element from {0, 1, 2}, one from {3, 4, 5}, and one from {6, 7, 8}. Since all domains are finite, the tactic `decide` exhaustively verifies that no such triple (q, r, l) exists, so the defining condition is false and the syndrome evaluates to 0.

    line 1

    theorem gf8_oracle_syndrome_same_register : gf8_oracle_syndrome {0, 1, 2} = 0 := by 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_same_register : gf8_oracle_syndrome {0, 1, 2} = 0 := by decide
See it in the graphDiscuss this resultChallenge it