Consistency Defect Codeword Fine Le Coarse Add Distinct Families
ProvedMIPStarRE.QPBT.consistencyDefect_codeword_fine_le_coarse_add_distinct_familiesA positive semidefinite operator has nonnegative state quadratic form. This is the formalization-only order fact lem:distance-qform-nonnegative, used for the nonnegative overlap terms in lem:ld-sandwich; detailed source proof references/neexp-paper/05_quantum_preliminaries.tex:952-999.
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_DistanceTheorems_TensorSupport 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 /-! # Consistency and commutation of the pasting codeword families This module records the cross consistency of the coarse second codeword family, the commutator estimate for the two coarse families, the collision average of the distinct second codewords, and the comparison of the fine second codeword family with its coarse-graining. These are the codeword-family steps of the proof of `lem:pasting` recorded in `docs/paper-gaps/qpbt_pasting-product-error.tex`. ## References Blueprint `blueprint/src/chapter/ch12_qpbt_games.tex:960-1050`; paper `references/qpbt-paper/06_nonlocal_games_and_mipstar.tex:504-525`. -/ open scoped BigOperators MatrixOrder Matrix ComplexOrder open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT hiding Measurement open LIDT.MIPStarRE.Quantum open MIPStarRE.QPBT.DistanceCalculus
theorem MIPStarRE.QPBT.consistencyDefect_codeword_fine_le_coarse_add_distinct_families
{X Y₁ Y₂ R₂ Γ₂ ι : Type*}
[Fintype X] [DecidableEq X] [Fintype Y₁] [DecidableEq Y₁]
[Fintype Y₂] [DecidableEq Y₂] [Fintype R₂] [DecidableEq R₂]
[Fintype Γ₂] [DecidableEq Γ₂] [Fintype ι] [DecidableEq ι]
(D : _root_.LIDT.MIPStarRE.LDT.Distribution ((X × Y₁) × Y₂)) (eval₂ : Γ₂ → Y₂ → R₂)
(G₂ opposite : X → _root_.LIDT.MIPStarRE.Quantum.Measurement Γ₂ ι) (ψ : EuclideanSpace ℂ (ι × ι)) (η : ℝ)
(hD : D.IsProbability) (hψ : ‖ψ‖ = 1) (hη : 0 ≤ η)
(hcoll : ∀ x y₁, 0 < (D.map Prod.fst).weight (x, y₁) →
∀ g g' : Γ₂, g ≠ g' →
(∑ y₂ : Y₂, D.weight ((x, y₁), y₂) *
if eval₂ g y₂ = eval₂ g' y₂ then 1 else 0) ≤
η * (D.map Prod.fst).weight (x, y₁)) :
_root_.MIPStarRE.QPBT.consistencyDefect D
(fun q g => _root_.MIPStarRE.QPBT.heteroKron ((opposite q.1.1).effect g) 1)
(fun q g => _root_.MIPStarRE.QPBT.heteroKron 1 ((G₂ q.1.1).effect g)) ψ ≤
_root_.MIPStarRE.QPBT.consistencyDefect D
(fun q a₂ => _root_.MIPStarRE.QPBT.heteroKron (((opposite q.1.1).postprocess
(fun g => eval₂ g q.2)).effect a₂) 1)
(fun q a₂ => _root_.MIPStarRE.QPBT.heteroKron 1 (((G₂ q.1.1).postprocess
(fun g => eval₂ g q.2)).effect a₂)) ψ + η := by sorry