Direct Ld Soundness Of K Eq One Explicit
ProvedMIPStarRE.QPBT.direct_ld_soundness_of_k_eq_one_explicitQuantum soundness of the low individual degree test (thm:main-formal, paper references/ldt-paper/test_definition.tex:180-202) applied to one coordinate of a projective strategy for the direct low-degree game.
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_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_Preliminaries_Polynomials import Definitions.Def_LIDT_MIPStarRE_LDT_Tactic_AvgCongr import Definitions.Def_LIDT_MIPStarRE_LDT_Test_StrategyCore import Definitions.Def_LIDT_MIPStarRE_Quantum_FiniteMatrix_Basic import Definitions.Def_LIDT_MIPStarRE_Quantum_Measurement import Definitions.Def_QPBT_QPBT_Algebra_FieldBasis import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Game import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_GameValue import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Geometry import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Consistency_Measurements import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Consistency_State import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Correspondence import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Error import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Strategy import Definitions.Def_QPBT_QPBT_ExplicitConstants import Definitions.Def_QPBT_QPBT_Games_Consistency import Definitions.Def_QPBT_QPBT_Games_Defs import Definitions.Def_QPBT_QPBT_Games_StrategyClasses import Definitions.Def_QPBT_QPBT_Test_LowDegreeGameMeasurements import Mathlib import Mathlib.Analysis.MeanInequalitiesPow namespace LIDT.MIPStarRE.LDT end LIDT.MIPStarRE.LDT namespace LIDT.MIPStarRE.LDT.Preliminaries end LIDT.MIPStarRE.LDT.Preliminaries namespace LIDT.MIPStarRE.Quantum end LIDT.MIPStarRE.Quantum namespace MIPStarRE.QPBT end MIPStarRE.QPBT /-! # Soundness for the directly indexed low-degree game This module proves the quantum soundness statement for the directly indexed low-degree game, in the form used by the Chapter 15 combining argument: the polynomial-tuple measurements of `prop:ld-simultaneous-general-k` satisfy the three consistency relations of `lem:ld-soundness` with the error function `deltaLd` at the parameters `(q, m, d, k)` of the game. In the regime `0 < ε ≤ 1` the error carried by `prop:ld-simultaneous-general-k` — the error of `thm:main-formal` at the combined parameters of `def:ld-combining-parameters` together with the recovery loss `(m + k) d / q` — is absorbed into `deltaLd` at the universal constants `a = 10^23` and `b = 1/80000` by `exists_directCombinedTransportConstants`. In the regime `1 ≤ ε` the error function is at least one, while every bipartite consistency defect on a unit state is at most one, so the conclusion carries no information there. ## Main statements * `exists_direct_ld_soundness` — quantum soundness of the directly indexed low-degree game, with the error function `deltaLd`. * `exists_direct_ld_soundness_of_k_eq_one` retains the one-coordinate proof used by the seed-indexed soundness transport. ## References The obligation supports the Chapter 15 combining argument at `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:1267-1288`. -/ open scoped BigOperators open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT open LIDT.MIPStarRE.LDT.Preliminaries open LIDT.MIPStarRE.Quantum /-! ## Absorbing the error bound from the low individual degree theorem The specializations below combine three inputs: polynomial-tuple conclusions whose error is built from `mainFormalError`, the error bound of `thm:main-formal` at the auxiliary sampling parameter; the absorption `exists_directLdTransportConstants` of that error into `deltaLd`; and the coarse bound `consistencyDefect_heteroKron_le_one`, which closes both the regime `1 ≤ ε` and the regime where the transport argument exceeds one, in each of which `deltaLd` is already at least one. -/
theorem MIPStarRE.QPBT.direct_ld_soundness_of_k_eq_one_explicit :
∀ (D : _root_.MIPStarRE.QPBT.DirectLdParams) (ε : ℝ), D.k = 1 → 0 < ε →
∀ S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.directLdGame D), S.IsProjective → 1 - ε ≤ S.value →
∃ GA : _root_.MIPStarRE.QPBT.DirectPolyMeasTuple D S.ιA,
∃ GB : _root_.MIPStarRE.QPBT.DirectPolyMeasTuple D S.ιB,
_root_.MIPStarRE.QPBT.consistencyDefect
(_root_.LIDT.MIPStarRE.LDT.uniformDistribution (Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D))
(fun u outcome =>
_root_.MIPStarRE.QPBT.heteroKron
(((S.A (_root_.MIPStarRE.QPBT.directLdPointQuestionOf D u)).postprocess
(_root_.MIPStarRE.QPBT.directLdPointValuesOrZero D)).effect outcome) 1)
(fun u outcome =>
_root_.MIPStarRE.QPBT.heteroKron 1
((GB.postprocess (_root_.MIPStarRE.QPBT.evalDirectPolyTupleAt u)).effect outcome))
S.ψ ≤ _root_.MIPStarRE.QPBT.deltaLd _root_.MIPStarRE.QPBT.pauliBaselineLowDegreeConstant
_root_.MIPStarRE.QPBT.pauliBaselineLowDegreePower ε D.q D.m D.d D.k ∧
_root_.MIPStarRE.QPBT.consistencyDefect
(_root_.LIDT.MIPStarRE.LDT.uniformDistribution (Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D))
(fun u outcome =>
_root_.MIPStarRE.QPBT.heteroKron
((GA.postprocess (_root_.MIPStarRE.QPBT.evalDirectPolyTupleAt u)).effect outcome) 1)
(fun u outcome =>
_root_.MIPStarRE.QPBT.heteroKron 1
(((S.B (_root_.MIPStarRE.QPBT.directLdPointQuestionOf D u)).postprocess
(_root_.MIPStarRE.QPBT.directLdPointValuesOrZero D)).effect outcome))
S.ψ ≤ _root_.MIPStarRE.QPBT.deltaLd _root_.MIPStarRE.QPBT.pauliBaselineLowDegreeConstant
_root_.MIPStarRE.QPBT.pauliBaselineLowDegreePower ε D.q D.m D.d D.k ∧
_root_.MIPStarRE.QPBT.consistencyDefect (_root_.LIDT.MIPStarRE.LDT.uniformDistribution Unit)
(fun _ g => _root_.MIPStarRE.QPBT.heteroKron (GA.effect g) 1)
(fun _ g => _root_.MIPStarRE.QPBT.heteroKron 1 (GB.effect g))
S.ψ ≤ _root_.MIPStarRE.QPBT.deltaLd _root_.MIPStarRE.QPBT.pauliBaselineLowDegreeConstant
_root_.MIPStarRE.QPBT.pauliBaselineLowDegreePower ε D.q D.m D.d D.k := by sorry