Lemma circulantBitsProg_correct of the MIP* = RE formalization
ProvedMIPRE.LowDegree.BinaryLinear.circulantBitsProg_correctmip-remipre-formalizationverifiers
A statement of the module MIPRE.Foundations.LowDegree.BinaryCirculantProg of the MIP* = RE formalization (commit 70cbf1c of vidick/MIPRE-formalization). # Executable circulant matrices and their inverse square roots
Formal statement. In Lean, with the scope shown:
open MIPRE
open MIPRE.LowDegree
open MIPRE.LowDegree.BinaryLinear
open MIPRE.Cost MIPRE.Cost.PolyTimeFun
theorem MIPRE.LowDegree.BinaryLinear.circulantBitsProg_correct {k : ℕ} [NeZero k] (v : Fin k → ZMod 2) :
circulantBitsProg (vectorBits v) = matrixBits (Matrix.circulant v)
Formalization Note MIPRE.LowDegree.BinaryLinear.circulantBitsProg_correct is declared in MIPRE/Foundations/LowDegree/BinaryCirculantProg.lean, lines 89–101. The binders, hypotheses and conclusion are exactly those of the Lean statement above; the uploaded statement elaborates to the same type as the declaration in the repository. The definitions it mentions are those of the published definition bundles of the module's import closure.
Preamble
import Mathlib.Algebra.CharP.Algebra import Mathlib.Algebra.CharP.Two import Mathlib.Algebra.Field.ZMod import Mathlib.Algebra.MonoidAlgebra.Basic import Mathlib.Algebra.MvPolynomial.CommRing import Mathlib.Algebra.MvPolynomial.Degrees import Mathlib.Algebra.Polynomial.Eval.Defs import Mathlib.Algebra.Polynomial.Monic import Mathlib.Data.List.Basic import Mathlib.Data.List.Rotate import Mathlib.Data.Matrix.Mul import Mathlib.Data.Nat.Bits import Mathlib.Data.Nat.Notation import Mathlib.Data.Nat.Size import Mathlib.Data.ZMod.Basic import Mathlib.FieldTheory.Finite.Basic import Mathlib.LinearAlgebra.FiniteDimensional.Lemmas import Mathlib.LinearAlgebra.LinearIndependent.Lemmas import Mathlib.LinearAlgebra.Matrix.Circulant import Mathlib.LinearAlgebra.Matrix.ToLin import Mathlib.Tactic.Linarith import Mathlib.Tactic.Ring import Definitions.Def_MIPRE_Foundations_Cost_Basic_B import Definitions.Def_MIPRE_Foundations_Cost_Encoding_B import Definitions.Def_MIPRE_Foundations_SAT_Circuit import Definitions.Def_MIPRE_Foundations_Cost_PolyTime import Definitions.Def_MIPRE_Foundations_Cost_Closure import Definitions.Def_MIPRE_Foundations_Cost_Loops_B import Definitions.Def_MIPRE_Foundations_Cost_Fold import Definitions.Def_MIPRE_Foundations_Cost_Unary import Definitions.Def_MIPRE_Foundations_Cost_Numeric_B import Definitions.Def_MIPRE_Foundations_LowDegree_Encoding import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryRepresentation import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryPolynomial import Definitions.Def_MIPRE_Foundations_Cost_Binary import Definitions.Def_MIPRE_Foundations_SAT_Formula import Definitions.Def_MIPRE_Foundations_SAT_FmlLib import Definitions.Def_MIPRE_Foundations_SAT_Flatten import Definitions.Def_MIPRE_Foundations_Cost_Reader import Definitions.Def_MIPRE_Foundations_SAT_FmlProg import Definitions.Def_MIPRE_Foundations_SAT_ArrayProg import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryLinear import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryElimination import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryBasisProg import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryEchelon import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryEchelon_B import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryBasis import Definitions.Def_MIPRE_Foundations_LowDegree_BinarySolve import Definitions.Def_MIPRE_Foundations_LowDegree_BinarySolve_B import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryMatrixSolve import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryMatrixSolve_B import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryMatrixInverse import Definitions.Def_MIPRE_Foundations_LowDegree_SelfDualize import Definitions.Def_MIPRE_Foundations_LowDegree_BinarySquareRoot import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryCirculant import Definitions.Def_MIPRE_Foundations_Cost_Iterates import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryCirculantProg import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryCirculantProg_B open MIPRE open MIPRE.LowDegree open MIPRE.LowDegree.BinaryLinear open MIPRE.Cost MIPRE.Cost.PolyTimeFun
Formal statement
theorem MIPRE.LowDegree.BinaryLinear.circulantBitsProg_correct {k : ℕ} [NeZero k] (v : Fin k → ZMod 2) :
circulantBitsProg (vectorBits v) = matrixBits (Matrix.circulant v) := by sorrySource