Combined Polynomial Evaluates To
ProvedMIPStarRE.QPBT.SubLineWitness.combinedPolynomial_evaluatesToqpbt
Evaluation commutes with the canonical scalar identification.
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.
Preamble
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_AxisParallelLine import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_DiagonalLine import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_Distribution 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_Algebra_FieldBasis import Definitions.Def_QPBT_QPBT_Combining_Defs import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Game import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Geometry import Definitions.Def_QPBT_QPBT_Combining_ExtendedLines_Measurement import Definitions.Def_QPBT_QPBT_Combining_Witnesses import Definitions.Def_QPBT_QPBT_Observables_LineDefs import Definitions.Def_QPBT_QPBT_Test_LowDegreeGame import Definitions.Def_QPBT_QPBT_Test_PauliBasisTest import Mathlib import Mathlib.Analysis.MeanInequalitiesPow namespace LIDT.MIPStarRE.LDT end LIDT.MIPStarRE.LDT namespace LIDT.MIPStarRE.Quantum end LIDT.MIPStarRE.Quantum namespace MIPStarRE.QPBT end MIPStarRE.QPBT namespace MIPStarRE.QPBT.DistanceCalculus end MIPStarRE.QPBT.DistanceCalculus /-! # Conditional extended-line measurements This directly indexed auxiliary construction follows the first consistency route for combined lines. The question carrier, completed answer alphabet, and corrected error convention retain their existing meanings. ## References Paper `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:1118-1246`, blueprint `lem:qld-4-13-established`. See `docs/paper-gaps/qpbt_combined-lines-error-term.tex` and `docs/paper-gaps/qpbt_ld-dimension-divisibility.tex` for the remaining comparison with the printed source theorem. -/ open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT hiding Measurement open LIDT.MIPStarRE.Quantum MIPStarRE.QPBT.DistanceCalculus open scoped BigOperators Matrix MatrixOrder ComplexOrder
Formal statement
theorem MIPStarRE.QPBT.SubLineWitness.combinedPolynomial_evaluatesTo {params : _root_.MIPStarRE.QPBT.AdmissibleParams}
(sublines : _root_.MIPStarRE.QPBT.SubLineWitness params) (sample : _root_.MIPStarRE.QPBT.SubLineTriple params)
(hsample : sample ∈ sublines.D.support)
(polynomials : _root_.MIPStarRE.QPBT.DegPoly params.toLdParams (params.m * params.d) ×
_root_.MIPStarRE.QPBT.DegPoly params.toLdParams (params.m * params.d))
(point : Fin params.extendedDirectLd.m → _root_.MIPStarRE.QPBT.DirectScalarQ params.extendedDirectLd)
(hpoint : point ∈ sample.1.pointSet) (valueX valueZ : _root_.MIPStarRE.QPBT.PauliScalar params)
(hevalX : _root_.MIPStarRE.QPBT.EvaluatesTo sample.2.1 polynomials.1
(_root_.MIPStarRE.QPBT.projX (_root_.MIPStarRE.QPBT.directPointToPauli params point)) valueX)
(hevalZ : _root_.MIPStarRE.QPBT.EvaluatesTo sample.2.2 polynomials.2
(_root_.MIPStarRE.QPBT.projZ (_root_.MIPStarRE.QPBT.directPointToPauli params point)) valueZ) :
_root_.MIPStarRE.QPBT.DirectEvaluatesTo sample.1 (sublines.combinedPolynomial sample hsample polynomials) point
((_root_.MIPStarRE.QPBT.extendedDirectScalarEquiv params).symm
((_root_.MIPStarRE.QPBT.directPointToPauli params point) (_root_.MIPStarRE.QPBT.alphaVar params.m) * valueX +
(_root_.MIPStarRE.QPBT.directPointToPauli params point) (_root_.MIPStarRE.QPBT.betaVar params.m) * valueZ)) := by sorrySource