Combined Restrict Combining Linear Form Avg Le
ProvedMIPStarRE.QPBT.combinedRestrict_combiningLinearForm_avg_leA polynomial in the combined variables is combined exactly when its coefficients vanish outside the k standard basis vectors. This is the first half of the characterisation used in lem:ld-combining-exact-linearity.
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 Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_Coefficients import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_Linearity import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_Polynomial import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Combining_Restriction 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 /-! # Exact linearity in the combining variables The recovery step of the combining reduction needs to know that a polynomial in the combined variables which is not the combined polynomial of any tuple only rarely restricts to a linear form in the combining variables: writing `p = ∑_μ c_μ α^μ` with coefficients `c_μ` in the point variables, the polynomial `p` is combined exactly when `c_μ` vanishes for every exponent vector `μ` outside the `k` standard basis vectors, and the restriction `p(u, ·)` is a linear form exactly when `c_μ(u)` vanishes for every such `μ`. Fixing one such `μ` with `c_μ ≠ 0`, whose total degree is at most `m d`, the Schwartz--Zippel lemma bounds the probability of `c_μ(u) = 0` by `m d / q`. ## Main statements * `exists_eq_combiningLinearForm_iff` — a polynomial in the combining variables is a linear form exactly when its coefficients vanish off the standard basis vectors. * `combinedRestrict_combiningLinearForm_avg_le` — `lem:ld-combining-exact-linearity`. * `directCombinedExactLinearity_avg_le` — the same bound in the parameters of the directly indexed low-degree game. ## References * `references/neexp-paper/05_quantum_preliminaries.tex:1440-1477` * `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:413-458` * `blueprint/src/chapter/ch13_qpbt_test.tex:575-600` -/ open scoped BigOperators open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT open LIDT.MIPStarRE.LDT.Preliminaries /-! ## Linear forms in terms of their coefficients -/ /-! ## The exact-linearity estimate -/
open scoped Classical in
theorem MIPStarRE.QPBT.combinedRestrict_combiningLinearForm_avg_le {K : Type*} [Field K] [Fintype K]
[DecidableEq K] {m k d : ℕ} {p : MvPolynomial (Fin (m + k)) K}
(hp : p ∈ _root_.LIDT.MIPStarRE.LDT.Preliminaries.polyFunc (m + k) K d)
(hnc : ∀ g : Fin k → MvPolynomial (Fin m) K, p ≠ _root_.MIPStarRE.QPBT.combinePolyTuple g) :
_root_.LIDT.MIPStarRE.LDT.avgOver (_root_.LIDT.MIPStarRE.LDT.uniformDistribution (Fin m → K))
(fun u => if ∃ c : Fin k → K, _root_.MIPStarRE.QPBT.combinedRestrict p u = _root_.MIPStarRE.QPBT.combiningLinearForm c then
(1 : _root_.LIDT.MIPStarRE.LDT.Error) else 0) ≤
((((m * d : ℕ) : ℚ≥0) / Fintype.card K : ℚ≥0) : _root_.LIDT.MIPStarRE.LDT.Error) := by sorry