Consistency Defect Codewords Le Evaluated Add
ProvedMIPStarRE.QPBT.SandwichProduct.consistencyDefect_codewords_le_evaluated_addIf distinct codewords collide under a random evaluation with probability at most ε, their full-outcome consistency defect is at most the evaluated defect plus ε. This is the formalization-only estimate lem:sandwich-codeword-defect for the first step of lem:ld-sandwich; detailed source argument references/neexp-paper/05_quantum_preliminaries.tex:975-987.
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_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_Games_Consistency import Definitions.Def_QPBT_QPBT_Games_Defs import Definitions.Def_QPBT_QPBT_Games_DistanceTheorems_Support import Definitions.Def_QPBT_QPBT_Games_DistributionAux import Definitions.Def_QPBT_QPBT_Games_Sandwich_Support 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 namespace MIPStarRE.QPBT.SandwichProduct end MIPStarRE.QPBT.SandwichProduct /-! # Quantitative support for sandwiched measurements This module develops the consistency and operator-distance estimates used in the quantitative sandwich argument. ## References Blueprint `lem:ld-sandwich` and `lem:ld-sandwich-measurement`; paper `references/qpbt-paper/06_nonlocal_games_and_mipstar.tex:465-501`. -/ open scoped BigOperators MatrixOrder Matrix ComplexOrder open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT hiding Measurement open LIDT.MIPStarRE.Quantum open MIPStarRE.QPBT.DistanceCalculus open MIPStarRE.QPBT.SandwichProduct
set_option maxHeartbeats 600000 in
-- The proof rearranges question, evaluation, and two outcome sums.
theorem MIPStarRE.QPBT.SandwichProduct.consistencyDefect_codewords_le_evaluated_add
{X Y Γ R ιA ιB : Type*}
[Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y] [Nonempty Y]
[Fintype Γ] [DecidableEq Γ] [Fintype R] [DecidableEq R]
[Fintype ιA] [DecidableEq ιA] [Fintype ιB] [DecidableEq ιB]
(μ : _root_.LIDT.MIPStarRE.LDT.Distribution X) (A : X → _root_.LIDT.MIPStarRE.Quantum.Measurement Γ ιA)
(B : X → _root_.LIDT.MIPStarRE.Quantum.Measurement Γ ιB) (ψ : EuclideanSpace ℂ (ιA × ιB))
(eval : Γ → Y → R) (ε : ℝ)
(hμ : μ.IsProbability) (hψ : ‖ψ‖ = 1) (hε : 0 ≤ ε)
(hcollision : ∀ g g' : Γ, g ≠ g' →
_root_.LIDT.MIPStarRE.LDT.avgOver (_root_.LIDT.MIPStarRE.LDT.uniformDistribution Y)
(fun y => if eval g y = eval g' y then 1 else 0) ≤ ε) :
_root_.MIPStarRE.QPBT.consistencyDefect μ
(fun x g => _root_.MIPStarRE.QPBT.heteroKron ((A x).effect g) 1)
(fun x g => _root_.MIPStarRE.QPBT.heteroKron 1 ((B x).effect g)) ψ ≤
_root_.MIPStarRE.QPBT.consistencyDefect (_root_.MIPStarRE.QPBT.Distribution.prod μ (_root_.LIDT.MIPStarRE.LDT.uniformDistribution Y))
(fun xy r => _root_.MIPStarRE.QPBT.heteroKron
(((A xy.1).postprocess (fun g => eval g xy.2)).effect r) 1)
(fun xy r => _root_.MIPStarRE.QPBT.heteroKron 1
(((B xy.1).postprocess (fun g => eval g xy.2)).effect r)) ψ + ε := by sorry