Polynomial On Line Low Degree Encoding Nat Degree Le One Of Axis
ProvedMIPStarRE.QPBT.polynomialOnLine_lowDegreeEncoding_natDegree_le_one_of_axisA coordinate with zero direction is constant along the line. This is a formalization-only auxiliary for the axis case of blueprint lem:low-degree-encoding-line-restriction.
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_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_Algebra_Lines import Definitions.Def_QPBT_QPBT_Algebra_LowDegreeCode import Definitions.Def_QPBT_QPBT_Observables_LineDefs import Definitions.Def_QPBT_QPBT_Observables_LineMeasurement_Restriction 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`. -/ open scoped BigOperators open MIPStarRE.QPBT open LIDT.MIPStarRE.LDT
theorem MIPStarRE.QPBT.polynomialOnLine_lowDegreeEncoding_natDegree_le_one_of_axis
(L : _root_.MIPStarRE.QPBT.LdParams) (line : _root_.MIPStarRE.QPBT.LineDesc L) (haxis : line.kind = .axis)
(h : _root_.MIPStarRE.QPBT.Cube L.m → _root_.MIPStarRE.QPBT.ScalarQ L) :
(_root_.MIPStarRE.QPBT.polynomialOnLine L line (_root_.MIPStarRE.QPBT.lowDegreeEncoding h)).natDegree ≤ 1 := by sorry