Avg Over Collision Le
ProvedMIPStarRE.QPBT.avgOver_collision_leAveraging a collision term against the conditional collision bound. A family of nonnegative weights indexed by pairs of distinct second codewords, of total mass at most one for every question of the first marginal, has average at most η once each pair is restricted to the second questions at which the two codewords agree. This is the averaging step used twice in the proof of the adopted statement in docs/paper-gaps/qpbt_pasting-product-error.tex, the hypothesis being the conditional collision assumption of lem:pasting written out; in step 4 to pass from the coarse to the fine second codeword family and in step 5 to discard the colliding part of the coarse cross term; blueprint ch12_qpbt_games.tex:960-990.
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 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.avgOver_collision_le {X Y₁ Y₂ R₂ Γ₂ : Type*}
[Fintype X] [DecidableEq X] [Fintype Y₁] [DecidableEq Y₁]
[Fintype Y₂] [DecidableEq Y₂] [Fintype R₂] [DecidableEq R₂]
[Fintype Γ₂] [DecidableEq Γ₂]
(D : _root_.LIDT.MIPStarRE.LDT.Distribution ((X × Y₁) × Y₂)) (eval₂ : Γ₂ → Y₂ → R₂)
(c : (X × Y₁) → Γ₂ → Γ₂ → ℝ) (η : ℝ)
(hD : D.IsProbability) (hη : 0 ≤ η)
(hc : ∀ p g g', 0 ≤ c p g g')
(hmass : ∀ p, (∑ g : Γ₂, ∑ g' : Γ₂, if g = g' then 0 else c p g g') ≤ 1)
(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_.LIDT.MIPStarRE.LDT.avgOver D (fun q => ∑ g : Γ₂, ∑ g' : Γ₂,
if g = g' then 0 else
if eval₂ g q.2 = eval₂ g' q.2 then c q.1 g g' else 0) ≤ η := by sorry