Every 64-element field has a trace-self-dual binary basis
ProvedMetricSelfDualCompletion.Completion.TraceProof.exists_selfDualBasis_of_card64coding-theoryfinite-fieldsself-dual-basistrace
Let be a field with exactly elements, equipped with its -algebra structure. There is a basis of over for which
This is the concrete degree-six instance of the self-dual trace basis used in Guruswami's binary-expansion step. It asserts existence of the basis itself, without assuming a self-dual basis or any coding-theoretic host family. The statement uses only Mathlib objects and does not prescribe a particular carrier for the field. Such a basis converts field symbols to six binary coordinates while identifying the field trace pairing with the binary dot product; the associated coding/algorithmic theorems are separate results.
Preamble
import Mathlib
Formal statement
theorem MetricSelfDualCompletion.Completion.TraceProof.exists_selfDualBasis_of_card64
(E : Type*) [Field E] [Fintype E] [Algebra (ZMod 2) E]
(hcard : Fintype.card E = 64) :
∃ b : Module.Basis (Fin 6) (ZMod 2) E, ∀ i j,
Algebra.trace (ZMod 2) E (b i * b j) = if i = j then 1 else 0 := by sorrySource
V. Guruswami, Appendix A of A. Shpilka, Constructions of low-degree and error-correcting epsilon-biased generators, Computational Complexity 18(4):495–525 (2009), author manuscript pp.25–26: definition and existence of self-dual trace bases immediately before Lemma25; Lemmas25–26 and the final paragraph specialize binary expansion to F64 (s=6). Used by STOC2027 submission5, Theorem11. Construction pattern adapted from Lean-QECert commit4a64933303628b4f94c4567347e86636853f64a4, QEC/Coding/FiniteFieldMultiplication/SelfDualBasis.lean and QEC/Coding/QuditQubitConversion/SelfDualBasis.lean; the new degree-six cyclotomic quotient is proved directly.