Direct Combining Collision Avg Le
ProvedMIPStarRE.QPBT.directCombiningCollision_avg_leqpbt
The coefficient of the variable α_r in a linear form is c r.
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.
Preamble
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_FieldBasis
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Geometry
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_Linearity
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
/-!
# The linear form in the combining variables and its collision estimate
At a fixed point `u` of the original space, the combined polynomial of a tuple
`g` restricts, as a function of the combining variables `α`, to the linear form
`α ↦ ∑_{r < k} g_r(u) α_r`. The recovery step of the reduction compares two
such linear forms: if the tuple of values `(g_0(u), …, g_{k-1}(u))` differs from
a tuple `b` of answers, then the two linear forms are distinct polynomials of
total degree at most one, so by the Schwartz--Zippel lemma they agree at a
uniformly sampled `α` with probability at most `1/q`.
This module proves that estimate. It is the quantitative content of the last
paragraph of the source proof, where the same bound is obtained for the
combining map of the surface game.
## Main statements
* `combiningLinearForm_injective` — a linear form determines its coefficients.
* `combiningLinearForm_agreementProbability_le` — the Schwartz--Zippel bound.
* `directCombiningCollision_avg_le` — the bound in the averaged form used by the
consistency calculus of the directly indexed game.
## References
* `references/neexp-paper/05_quantum_preliminaries.tex:1484-1503`
* `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:413-458`
* `blueprint/src/chapter/ch13_qpbt_test.tex:240-250`
-/
open scoped BigOperators
open MIPStarRE.QPBT
open LIDT.MIPStarRE.LDT
open LIDT.MIPStarRE.LDT.Preliminaries
/-! ## The linear form of a tuple of scalars -/
/-! ## The averaged form -/Formal statement
theorem MIPStarRE.QPBT.directCombiningCollision_avg_le (D : _root_.MIPStarRE.QPBT.DirectLdParams)
(c b : Fin D.k → _root_.MIPStarRE.QPBT.DirectScalarQ D) (hne : c ≠ b) :
_root_.LIDT.MIPStarRE.LDT.avgOver (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (Fin D.k → _root_.MIPStarRE.QPBT.DirectScalarQ D))
(fun α => if ∑ r : Fin D.k, c r * α r = ∑ r : Fin D.k, b r * α r then
(1 : _root_.LIDT.MIPStarRE.LDT.Error) else 0) ≤
(1 : _root_.LIDT.MIPStarRE.LDT.Error) / D.q := by sorrySource