Exists Poly Pair Of Scalar Separated
ProvedMIPStarRE.QPBT.ExtendedLineGame.exists_polyPair_of_scalar_separatedqpbt
Exists Poly Pair Of Scalar Separated
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_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_Preliminaries_Polynomials import Definitions.Def_LIDT_MIPStarRE_LDT_Tactic_AvgCongr import Definitions.Def_LIDT_MIPStarRE_LDT_Test_StrategyCore 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_DirectLowDegree_Transport_Combining_Polynomial import Definitions.Def_QPBT_QPBT_Combining_ExtendedLineGame_ScalarPolynomial import Definitions.Def_QPBT_QPBT_Combining_Witnesses import Definitions.Def_QPBT_QPBT_Test_PauliBasisTest import Mathlib import Mathlib.Algebra.MvPolynomial.Equiv import Mathlib.Analysis.MeanInequalitiesPow namespace LIDT.MIPStarRE.LDT end LIDT.MIPStarRE.LDT namespace MIPStarRE.QPBT end MIPStarRE.QPBT namespace MIPStarRE.QPBT.ExtendedLineGame end MIPStarRE.QPBT.ExtendedLineGame /-! # Scalar and base coefficients of the rounded polynomial outcomes The singleton polynomial is transported through the canonical field equivalence and Mathlib's equivalence between a polynomial in a sum of variables and an iterated polynomial ring. Its individual-degree certificate controls both levels. Splitting each base coefficient by either block gives the partial degrees used in the fiber calculation. Independence of both wrong blocks identifies the outcome with the existing bounded polynomial-pair combining map. ## References `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:1310-1326`, the coefficient expansion preceding `eq:qld-g-prime-bound`. The partial coefficient argument and separated image are at lines 1341--1368, `eq:qld-g-2` and `eq:qld-g-non-separable`; blueprint `lem:qld-4-7`. -/ open scoped BigOperators open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT hiding Measurement open MIPStarRE.QPBT.ExtendedLineGame
Formal statement
theorem MIPStarRE.QPBT.ExtendedLineGame.exists_polyPair_of_scalar_separated (P : _root_.MIPStarRE.QPBT.AdmissibleParams)
(g : _root_.MIPStarRE.QPBT.DirectPolyTuple P.extendedDirectLd)
(hlin : ∃ r t : MvPolynomial (Fin (2 * P.m)) (_root_.MIPStarRE.QPBT.PauliScalar P),
_root_.MIPStarRE.QPBT.ExtendedLineGame.scalarPolynomial P g = MvPolynomial.C r * MvPolynomial.X 0 +
MvPolynomial.C t * MvPolynomial.X 1)
(hX : ∃ r, _root_.MIPStarRE.QPBT.ExtendedLineGame.blockCoefficientPolynomial P g (Finsupp.single 0 1) true = MvPolynomial.C r)
(hZ : ∃ r, _root_.MIPStarRE.QPBT.ExtendedLineGame.blockCoefficientPolynomial P g (Finsupp.single 1 1) false = MvPolynomial.C r) :
∃ pair : _root_.MIPStarRE.QPBT.PolyPair P,
MvPolynomial.map (_root_.MIPStarRE.QPBT.extendedDirectScalarEquiv P).toRingHom (g (0 : Fin 1)).1 =
_root_.MIPStarRE.QPBT.combinePoly pair.1.1 pair.2.1 := by sorrySource