Poly Func Eval Collision Le
ProvedMIPStarRE.QPBT.polyFunc_eval_collision_leA uniform average over a finite type is its normalized finite sum.
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_Preliminaries_Polynomials import Definitions.Def_LIDT_MIPStarRE_LDT_Tactic_AvgCongr import Definitions.Def_LIDT_MIPStarRE_LDT_Test_StrategyCore 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 /-! # Real polynomial collision bounds The existing Schwartz–Zippel estimate for bounded polynomial representatives is expressed as a nonnegative rational cardinality ratio. This module converts it to the real uniform average used by the sandwich support comparison and specializes it to the polynomial outcomes of the Pauli basis test. ## References * `references/qpbt-paper/04_preliminaries.tex`, `lem:schwartz-zippel`. * Blueprint `lem:schwartz-zippel-individual` and the collision calculation preceding `eq:qld-nonencoding-mass` in `sec:separating`. * `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:1483-1492`, the consistency calculation in `lem:qld-construct-the-paulis` whose decoder substitution requires the blueprint's nonencoding-mass estimate. * `docs/paper-gaps/qpbt_decoding-identity.tex`, for that substitution's scope. -/ open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT LIDT.MIPStarRE.LDT.Preliminaries
theorem MIPStarRE.QPBT.polyFunc_eval_collision_le {m d : ℕ} {K : Type*} [Field K] [Fintype K]
[DecidableEq K] (first second : _root_.LIDT.MIPStarRE.LDT.Preliminaries.polyFunc m K d) (hne : first ≠ second) :
_root_.LIDT.MIPStarRE.LDT.avgOver (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (Fin m → K))
(fun point => if MvPolynomial.eval point first.1 = MvPolynomial.eval point second.1
then (1 : ℝ) else 0) ≤ (m * d : ℝ) / Fintype.card K := by sorry