Exists Ld Soundness
ProvedMIPStarRE.QPBT.exists_ld_soundnessA uniform average over a finite type is its normalized finite sum.
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_Geometry import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Consistency_Measurements import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Correspondence import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_SeedFiber import Definitions.Def_QPBT_QPBT_Games_Consistency import Definitions.Def_QPBT_QPBT_Games_Defs import Definitions.Def_QPBT_QPBT_Games_DistanceTheorems_TensorSupport import Definitions.Def_QPBT_QPBT_Games_DistributionAux import Definitions.Def_QPBT_QPBT_Games_Sandwich_Support import Definitions.Def_QPBT_QPBT_Games_StrategyClasses import Definitions.Def_QPBT_QPBT_Test_LowDegreeGame 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 /-! # Quantum soundness of the seed-indexed low-degree game The general simultaneity reduction for the directly indexed game is transported through the correlated seed dilation. Point consistency survives compression exactly; global polynomial consistency is recovered by point agreement and Schwartz--Zippel, with the square-root loss absorbed into `deltaLd`. ## References * `arXiv:2001.04383v3, Section 7.1, Theorem 7.8` * `arXiv:1904.05870v3, Theorem 4.43 and its proof` * Blueprint `lem:ld-soundness` -/ open scoped BigOperators open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT open LIDT.MIPStarRE.LDT.Preliminaries open LIDT.MIPStarRE.Quantum
set_option maxHeartbeats 1000000 in
theorem MIPStarRE.QPBT.exists_ld_soundness :
∃ a b : ℝ, 1 ≤ a ∧ 0 < b ∧ b ≤ 1 ∧
∀ (L : _root_.MIPStarRE.QPBT.LdParams) (ε : ℝ), 0 < ε →
∀ S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.ldGame L), S.IsProjective → 1 - ε ≤ S.value →
∃ GA : _root_.MIPStarRE.QPBT.PolyMeasTuple L S.ιA, ∃ GB : _root_.MIPStarRE.QPBT.PolyMeasTuple L S.ιB,
_root_.MIPStarRE.QPBT.consistencyDefect (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (Fin L.m → _root_.MIPStarRE.QPBT.ScalarQ L))
(fun u outcome =>
_root_.MIPStarRE.QPBT.heteroKron
(((S.A (_root_.MIPStarRE.QPBT.ldPointQuestionOf L u)).postprocess
(_root_.MIPStarRE.QPBT.ldPointValuesOrZero L)).effect outcome) 1)
(fun u outcome =>
_root_.MIPStarRE.QPBT.heteroKron 1
((GB.postprocess (_root_.MIPStarRE.QPBT.evalPolyTupleAt u)).effect outcome))
S.ψ ≤ _root_.MIPStarRE.QPBT.deltaLd a b ε L.q L.m L.d L.k ∧
_root_.MIPStarRE.QPBT.consistencyDefect (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (Fin L.m → _root_.MIPStarRE.QPBT.ScalarQ L))
(fun u outcome =>
_root_.MIPStarRE.QPBT.heteroKron
((GA.postprocess (_root_.MIPStarRE.QPBT.evalPolyTupleAt u)).effect outcome) 1)
(fun u outcome =>
_root_.MIPStarRE.QPBT.heteroKron 1
(((S.B (_root_.MIPStarRE.QPBT.ldPointQuestionOf L u)).postprocess
(_root_.MIPStarRE.QPBT.ldPointValuesOrZero L)).effect outcome))
S.ψ ≤ _root_.MIPStarRE.QPBT.deltaLd a b ε L.q L.m L.d L.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 a b ε L.q L.m L.d L.k := by sorry