Collision Bound Of Fiber Averages
ProvedMIPStarRE.QPBT.collision_bound_of_fiber_averagesAn unnormalized collision estimate on every first-question fiber implies the positive-mass conditional collision predicate of lem:pasting. This is a formalization-only normalization lemma for paper lines 504--525.
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_QPBT_QPBT_Games_Sandwich_Defs namespace LIDT.MIPStarRE.LDT end LIDT.MIPStarRE.LDT namespace MIPStarRE.QPBT end MIPStarRE.QPBT /-! # Conditional collision bounds from fiber averages This module converts an unnormalized collision estimate on every first-question fiber into the positive-mass conditional collision predicate used by the pasting theorem. ## References The conditional collision hypothesis is from `lem:pasting`, `references/qpbt-paper/06_nonlocal_games_and_mipstar.tex:504-525`. Its use in the QPBT combining argument occurs at `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:950-963`. -/ open scoped BigOperators open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT
theorem MIPStarRE.QPBT.collision_bound_of_fiber_averages {X Y₁ Y₂ R₂ Γ₂ : Type*}
[Fintype X] [DecidableEq X] [Fintype Y₁] [DecidableEq Y₁]
[Fintype Y₂] [DecidableEq Y₂] [Fintype R₂] [DecidableEq R₂]
[Fintype Γ₂] (dist : _root_.LIDT.MIPStarRE.LDT.Distribution ((X × Y₁) × Y₂))
(eval₂ : Γ₂ → Y₂ → R₂) (eta : ℝ)
(hbound : ∀ fixed : X × Y₁, ∀ first second : Γ₂, first ≠ second →
_root_.LIDT.MIPStarRE.LDT.avgOver dist (fun sample => if sample.1 = fixed then
(if eval₂ first sample.2 = eval₂ second sample.2 then 1 else 0) else 0) ≤
eta * _root_.LIDT.MIPStarRE.LDT.avgOver dist (fun sample => if sample.1 = fixed then 1 else 0)) :
_root_.MIPStarRE.QPBT.HasConditionalCollisionBound dist eval₂ eta := by sorry