AFTD Auto-Formalizing Theoretical Domains

gf8_mult_coeff

def

The structure constants for multiplication in GF(8) with respect to the basis {1, alpha, alpha^2} with irreducible polynomial alpha^3 + alpha + 1.

Statement

def gf8_mult_coeff (q r l : Fin 3) : ZMod 2
Defined in
arXiv:2610.01024, Proposition 55
Verified
04 Oct 2026
Axioms
none listed
Used by 3
  • gf8_oracle_syndrome_eq_zero_of_card_ne_threeThe syndrome of the GF(8) multiplication oracle vanishes on any subset A ⊆ Fin 9 whose cardinality is not 3, because non-zero syndrome…
  • 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 =…
  • 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…

Read back from the Lean

A definition of a function gf8_mult_coeff mapping three elements q, r, and l of Fin 3 to ZMod 2. Its value is determined by the natural number sum q.val + r.val and the natural number l.val: - It evaluates to 1 if (q.val + r.val, l.val) is equal to (0, 0), (1, 1), (2, 2), (3, 0), (3, 1), (4, 1), or (4, 2). - It evaluates to 0 for all other pairs (q.val + r.val, l.val).

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

/-- Multiplication structure constants of GF(8) in the polynomial basis with alpha^3 = alpha + 1. -/
def gf8_mult_coeff (q r l : Fin 3) : ZMod 2 := match q.val + r.val, l.val with | 0, 0 => 1 | 1, 1 => 1 | 2, 2 => 1 | 3, 0 => 1 | 3, 1 => 1 | 4, 1 => 1 | 4, 2 => 1 | _, _ => 0
See it in the graphDiscuss this resultChallenge it