QPBT definitions: Observables / LineMeasurement / Restriction
DefinitionQPBT_QPBT_Observables_LineMeasurement_Restrictionqpbt
This bundle defines restriction of a multivariate polynomial to a canonical line. It substitutes the affine parameterization, forms the coefficient list, and identifies when the restricted list lies in the embedded lower-degree subspace.
Principal definitions:
MIPStarRE.QPBT.polynomialOnLine: substitutes a line parameterization into a polynomial.MIPStarRE.QPBT.restrictToLine: forms the coefficient list after restriction.- The degree-fitting predicate identifies when higher restricted coefficients vanish.
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.
Definition code
-- Generated from QPBT/Observables/LineMeasurement/Restriction.lean by skeleton subtraction.
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_AxisParallelLine
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_DiagonalLine
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_Observables_LineDefs
import Definitions.Def_QPBT_QPBT_Test_LowDegreeGame
import Mathlib
namespace LIDT.MIPStarRE.LDT
end LIDT.MIPStarRE.LDT
namespace MIPStarRE.QPBT
end MIPStarRE.QPBT
/-!
# Restriction of low-degree encodings to canonical lines
This module substitutes a canonical line into a multivariate polynomial and
records the resulting univariate polynomial as a coefficient list. The
multilinear low-degree encoding has degree at most `m ≤ m*d` on any line and
degree at most `1 ≤ d` on an axis-parallel line. Its coefficient list evaluates
to the original encoding at every point on the line, including a line with
zero direction.
## References
The encoding is equation `eq:ld-encoding` in
`references/qpbt-paper/04_preliminaries.tex:869-896`. Restriction supplies the
line answers in `lem:pauli-completeness`, paper
`08_classical_and_quantum_low_degree_tests.tex:1244-1273`, and the ancillary
line projector in the proof of `lem:qld-comm-line-cons`, paper
`14_analysis_of_the_pauli_basis_test.tex:552-556`. The restriction bounds and
evaluation identities are recorded in blueprint
`lem:low-degree-encoding-line-restriction`.
-/
@[expose] public section
open scoped BigOperators
namespace MIPStarRE.QPBT
open LIDT.MIPStarRE.LDT
noncomputable section
/-- Substitute the affine parameterization of a canonical line into a
multivariate polynomial. This is the polynomial `g_h(u₀ + tv)` used in
`def:expanded-line-measurement`, paper
`14_analysis_of_the_pauli_basis_test.tex:535-557`, blueprint
`def:expanded-line-measurement`. -/
noncomputable def polynomialOnLine (L : _root_.MIPStarRE.QPBT.LdParams) (line : _root_.MIPStarRE.QPBT.LineDesc L)
(g : MvPolynomial (Fin L.m) (_root_.MIPStarRE.QPBT.ScalarQ L)) : Polynomial (_root_.MIPStarRE.QPBT.ScalarQ L) :=
MvPolynomial.eval₂Hom _root_.Polynomial.C
(fun i : Fin L.m =>
(_root_.Polynomial.C (line.base i) +
_root_.Polynomial.X * _root_.Polynomial.C (line.direction i) :
Polynomial (_root_.MIPStarRE.QPBT.ScalarQ L))) g
/-- The degree-`m*d` coefficient list obtained by restricting `g` to `line`.
This is the concrete restriction operation in `def:expanded-line-measurement`,
paper `14_analysis_of_the_pauli_basis_test.tex:535-557`, blueprint
`def:expanded-line-measurement`. -/
noncomputable def restrictToLine (L : _root_.MIPStarRE.QPBT.LdParams) (line : _root_.MIPStarRE.QPBT.LineDesc L)
(g : MvPolynomial (Fin L.m) (_root_.MIPStarRE.QPBT.ScalarQ L)) : _root_.MIPStarRE.QPBT.DegPoly L (L.m * L.d) :=
fun i => (_root_.MIPStarRE.QPBT.polynomialOnLine L line g).coeff i.val
/-- A degree-`m*d` coefficient list actually lies in the embedded degree-`d`
subspace when all coefficients above `d` vanish. This is the coefficient
interpretation of `deg_d(line) ⊆ deg_md(line)` in
`def:expanded-line-measurement`, paper
`14_analysis_of_the_pauli_basis_test.tex:548-557`. -/
def DegPoly.FitsDegree {L : _root_.MIPStarRE.QPBT.LdParams} {c : ℕ} (d : ℕ)
(f : _root_.MIPStarRE.QPBT.DegPoly L c) : Prop :=
∀ i : Fin (c + 1), d < i.val → f i = 0
/-! ## Evaluation of the restriction along the line -/
end
end MIPStarRE.QPBT
Source