Exists Conditioned Polynomial Bound
ProvedMIPStarRE.QPBT.exists_conditioned_polynomial_boundAdditive polynomial errors remain polynomial after conditioning and insertion of a polynomially small point error. The minimum uses the independent unit bound for normalized POVM consistency, not a replacement measurement. This scalar lemma supports lem:qld-xz-lines, paper lines 950--963; see issue Dengnifer/MIPStarRE-QPBT-bak#118 and docs/paper-gaps/qpbt_combined-lines-error-term.tex.
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_Games_ErrorFunctions import Mathlib import Mathlib.Analysis.MeanInequalitiesPow namespace MIPStarRE.QPBT end MIPStarRE.QPBT /-! # Scalar error bounds for combining polynomial measurements This module proves the formalization-only scalar estimates used by the combining argument: nonnegativity of the real fourth root, the quarter-power form of a square root of two deficit terms, polynomial bounds after conditioning, composition with the dimension factor retained, and absorption into the global polynomial-pair error scale. The estimates quantify over error functions and numerical parameters; they do not construct measurements, and none of them is specific to Claims 17-1 through 17-3. ## References The auxiliary blueprint statements are `thm:qld-conditioned-polynomial-bound`, `thm:qld-combining-polynomial-bound`, and `thm:qld-global-pair-error-bound` in `blueprint/src/chapter/ch15_qpbt_combining.tex`. They support the calculations in `lem:qld-xz-lines`, `lem:qld-4-13`, and `lem:qld-4-7` of `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:950-963,1134-1246` and `:1278-1288,1402`. The corrected error notation and the retained dimension factor are documented in `docs/paper-gaps/qpbt_combined-lines-error-term.tex`. -/ open MIPStarRE.QPBT
theorem MIPStarRE.QPBT.exists_conditioned_polynomial_bound (pointError : ℝ → ℝ)
(hpoint : _root_.MIPStarRE.QPBT.IsPolyErr pointError) (constant : ℝ) (hconstant : 1 ≤ constant)
(pastingError : ℝ → ℝ → ℝ) (hpasting : _root_.MIPStarRE.QPBT.IsPolyErr₂ pastingError) :
∃ lineError : ℝ → ℝ → ℝ, _root_.MIPStarRE.QPBT.IsPolyErr₂ lineError ∧
∀ error ratio mass : ℝ, 0 ≤ error → 0 ≤ ratio →
1 / 2 ≤ mass → mass ≤ 1 →
min 1 (mass * pastingError ratio
((8 * pointError error + constant * (error + Real.sqrt error)) / mass) + ratio) ≤
lineError error ratio := by sorry