The executable composed-sum output has the specified product interpretation
ProvedMIPRE.LowDegree.BinaryQuotient.map_composedSumBitsA statement of the module MIPRE.Foundations.LowDegree.BinaryComposedSum of the MIP* = RE formalization (commit 70cbf1c of vidick/MIPRE-formalization). # Correctness of the effective coprime-degree composed-sum construction
The executable composed-sum output has the specified product interpretation.
Formal statement. In Lean, with the scope shown:
open MIPRE
open MIPRE.LowDegree
open MIPRE.LowDegree.BinaryQuotient
open MIPRE.Cost MIPRE.LowDegree.BinaryPolynomial Polynomial MIPRE.LowDegree.BinaryFiniteField
variable (f : Polynomial (ZMod 2)) (hf : f.Monic) [Fact (Irreducible f)]
theorem MIPRE.LowDegree.BinaryQuotient.map_composedSumBits (p g : BitStr) (hp : p.length = f.natDegree)
(hpoly : f = polyOfBits (p ++ [true])) (hg : (polyOfBits g).Monic) :
(polyOfBits (composedSumBits p g)).map (algebraMap (ZMod 2) (AdjoinRoot f)) =
composedSumPolynomial (polyOfBits g) (AdjoinRoot.root f) f.natDegree
Formalization Note MIPRE.LowDegree.BinaryQuotient.map_composedSumBits is declared in MIPRE/Foundations/LowDegree/BinaryComposedSum.lean, lines 27–67. 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.
import Mathlib.Algebra.CharP.Algebra import Mathlib.Algebra.CharP.Two import Mathlib.Algebra.Field.ZMod 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.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.FieldTheory.Finite.Extension import Mathlib.FieldTheory.IsAlgClosed.AlgebraicClosure import Mathlib.LinearAlgebra.FiniteDimensional.Lemmas import Mathlib.LinearAlgebra.LinearIndependent.Lemmas import Mathlib.LinearAlgebra.Matrix.ToLin import Mathlib.RingTheory.AdjoinRoot 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_LowDegree_BinaryConstants import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryQuotient 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_BinaryBasis import Definitions.Def_MIPRE_Foundations_LowDegree_BinarySolve import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryMatrixSolve import Definitions.Def_MIPRE_Foundations_Cost_Iterates import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryKernel import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryQuotientFrobenius import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryQuotientOrbit import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryOrbitPolynomial import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryOrbitDescent import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryQuotientPolynomial import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryQuotientTranslation import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryCoprimeDegree import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryComposedSumPolynomial import Definitions.Def_MIPRE_Foundations_LowDegree_BinaryComposedSumProg open MIPRE open MIPRE.LowDegree open MIPRE.LowDegree.BinaryQuotient open MIPRE.Cost MIPRE.LowDegree.BinaryPolynomial Polynomial MIPRE.LowDegree.BinaryFiniteField variable (f : Polynomial (ZMod 2)) (hf : f.Monic) [Fact (Irreducible f)] include hf
theorem MIPRE.LowDegree.BinaryQuotient.map_composedSumBits (p g : BitStr) (hp : p.length = f.natDegree)
(hpoly : f = polyOfBits (p ++ [true])) (hg : (polyOfBits g).Monic) :
(polyOfBits (composedSumBits p g)).map (algebraMap (ZMod 2) (AdjoinRoot f)) =
composedSumPolynomial (polyOfBits g) (AdjoinRoot.root f) f.natDegree := by sorry