Combine Line Poly Spec
ProvedMIPStarRE.QPBT.combineLinePoly_specEvaluating the polynomial represented by a coefficient list agrees with evalCoefficient.
All objects, parameters, typeclass assumptions, and hypotheses are quantified in the accompanying formal statement; each symbol denotes the object of the displayed Lean type with that name. The conclusion is the proposition
This result is an importable reduction step in the formal dependency graph for the quantum Pauli basis test completeness or soundness argument.
Formalization Credit. This Lean declaration is part of the Quantum Pauli basis test formalization by Ruixuan Deng. The source code was generated by AI agents; Ruixuan Deng is the responsible maintainer.
Mathematical Source. The mathematical source is Ji, Natarajan, Vidick, Wright, and Yuen, MIP*=RE, arXiv:2001.04383v3.
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_AxisParallelLine import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_DiagonalLine import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LinePolynomials import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_LowDegreePolynomial import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_OpFamily import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_ParametersBase import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_ParametersFiniteAnswers import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_QuantumState import Definitions.Def_LIDT_MIPStarRE_LDT_CommutativityPoints_Defs import Definitions.Def_LIDT_MIPStarRE_LDT_ExpansionHypercubeGraph_Defs_Core import Definitions.Def_LIDT_MIPStarRE_LDT_GlobalVariance_Defs_Core import Definitions.Def_LIDT_MIPStarRE_LDT_MakingMeasurementsProjective_Defs import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Defs_Families import Definitions.Def_LIDT_MIPStarRE_LDT_Pasting_Defs_Interpolation import Definitions.Def_LIDT_MIPStarRE_LDT_Tactic_AvgCongr import Definitions.Def_LIDT_MIPStarRE_LDT_Test_StrategyCore import Definitions.Def_QPBT_QPBT_Algebra_Coefficients import Definitions.Def_QPBT_QPBT_Combining_Defs import Mathlib namespace LIDT.MIPStarRE.LDT end LIDT.MIPStarRE.LDT namespace LIDT.MIPStarRE.LDT.Preliminaries end LIDT.MIPStarRE.LDT.Preliminaries namespace MIPStarRE.QPBT end MIPStarRE.QPBT /-! # Polynomial combination and restricted line distributions This file contains the concrete definitions at the foundation of the Chapter 15 combining argument. A pair of bounded individual-degree polynomials is embedded into the two coordinate blocks of an extended polynomial. On lines, explicit affine reparameterizations are composed with coefficient-list polynomials. The original-dimensional restricted line laws are formed before decoding, while their field seed is still present. ## References The combining map is blueprint `def:combine-map`, with paper origin `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:970-989`. The restricted laws are blueprint `def:ith-restricted-line`, with paper origin in the same source at lines 1038--1048. -/ open scoped BigOperators open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT open LIDT.MIPStarRE.LDT.Preliminaries
theorem MIPStarRE.QPBT.combineLinePoly_spec {K : Type*} [Field K] {m c : ℕ}
(u v : Fin (2 * m + 2) → K) (uX vX uZ vZ : Fin m → K)
(aX bX aZ bZ uα vα uβ vβ : K) (f g : Fin (c + 1) → K)
(hcompat : _root_.MIPStarRE.QPBT.IsCombineLineCompatible u v uX vX uZ vZ
aX bX aZ bZ uα vα uβ vβ) :
∀ t : K,
_root_.MIPStarRE.QPBT.projX (u + t • v) = uX + (aX + bX * t) • vX ∧
_root_.MIPStarRE.QPBT.projZ (u + t • v) = uZ + (aZ + bZ * t) • vZ ∧
_root_.MIPStarRE.QPBT.evalCoefficient
(_root_.MIPStarRE.QPBT.combineLinePoly aX bX aZ bZ uα vα uβ vβ f g) t =
(uα + t * vα) * _root_.MIPStarRE.QPBT.evalCoefficient f (aX + bX * t) +
(uβ + t * vβ) * _root_.MIPStarRE.QPBT.evalCoefficient g (aZ + bZ * t) := by sorry