Direct Coefficient Collision Avg Le
ProvedMIPStarRE.QPBT.directCoefficientCollision_avg_leThe scalar field of a directly indexed low-degree game has q elements.
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_Algebra_Coefficients import Definitions.Def_QPBT_QPBT_Algebra_FieldBasis import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Game import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Geometry import Mathlib namespace LIDT.MIPStarRE.LDT end LIDT.MIPStarRE.LDT namespace LIDT.MIPStarRE.LDT.Preliminaries end LIDT.MIPStarRE.LDT.Preliminaries namespace MIPStarRE.QPBT end MIPStarRE.QPBT /-! # Collision bounds for direct line coefficients This module bounds the probability that two distinct coefficient vectors give the same value at a uniformly sampled affine parameter. It uses the existing coefficient-polynomial representation and Mathlib's univariate root count. ## References - `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:331-344` - `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:1595-1603` -/ open scoped BigOperators open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT open LIDT.MIPStarRE.LDT.Preliminaries
theorem MIPStarRE.QPBT.directCoefficientCollision_avg_le (D : _root_.MIPStarRE.QPBT.DirectLdParams) (degree : ℕ)
(a b : _root_.MIPStarRE.QPBT.DirectDegPoly D degree) (hne : a ≠ b) :
_root_.LIDT.MIPStarRE.LDT.avgOver (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (_root_.MIPStarRE.QPBT.DirectScalarQ D))
(fun t => if _root_.MIPStarRE.QPBT.evalCoefficient a t = _root_.MIPStarRE.QPBT.evalCoefficient b t then
(1 : ℝ) else 0) ≤
(degree : ℝ) / (D.q : ℝ) := by sorry