Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eval Coefficient Ne Imp Direct Eval Opt Ne Or Eq None

Proved
MIPStarRE.QPBT.ExtendedLineGame.evalCoefficient_ne_imp_directEvalOpt_ne_or_eq_none

by Dengnifer · Oct 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

qpbt

A successful completed readout at the point represented by parameter equals coefficient evaluation at parameter. This includes zero directions.

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

asserted by the formal QPBT declaration.\text{asserted by the formal QPBT declaration.}asserted by the formal QPBT declaration.

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_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_Coefficients
import Definitions.Def_QPBT_QPBT_Algebra_FieldBasis
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Game
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Geometry
import Mathlib
import Mathlib.Analysis.MeanInequalitiesPow

namespace LIDT.MIPStarRE.LDT
end LIDT.MIPStarRE.LDT
namespace MIPStarRE.QPBT
end MIPStarRE.QPBT
namespace MIPStarRE.QPBT.ExtendedLineGame
end MIPStarRE.QPBT.ExtendedLineGame

/-!
# Parameter evaluation versus completed line evaluation

Completed evaluation of a coefficient vector may return `none`, notably on a
zero-direction line when the represented polynomial is not constant.  A
successful completed readout at the point represented by a parameter agrees
with ordinary coefficient evaluation at that parameter.  Consequently,
parameter-value disagreement is contained in the union of completed-readout
disagreement and the two failure events.

The final theorem lifts this inclusion to the Born weights of two arbitrary
strategy POVMs.  It uses neither projectivity nor a collision estimate.

## References

- `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:230-390`
- `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:1267-1402`
-/



open MIPStarRE.QPBT

open LIDT.MIPStarRE.LDT



open MIPStarRE.QPBT.ExtendedLineGame
Formal statement
theorem MIPStarRE.QPBT.ExtendedLineGame.evalCoefficient_ne_imp_directEvalOpt_ne_or_eq_none
    {params : _root_.MIPStarRE.QPBT.DirectLdParams} {degree : ℕ}
    (line : _root_.MIPStarRE.QPBT.DirectLineDesc params) (coeffsA coeffsB : _root_.MIPStarRE.QPBT.DirectDegPoly params degree)
    (parameter : _root_.MIPStarRE.QPBT.DirectScalarQ params)
    (hne : _root_.MIPStarRE.QPBT.evalCoefficient coeffsA parameter ≠ _root_.MIPStarRE.QPBT.evalCoefficient coeffsB parameter) :
    _root_.MIPStarRE.QPBT.directEvalOpt line (line.base + parameter • line.direction) coeffsA ≠
        _root_.MIPStarRE.QPBT.directEvalOpt line (line.base + parameter • line.direction) coeffsB ∨
      _root_.MIPStarRE.QPBT.directEvalOpt line (line.base + parameter • line.direction) coeffsA = none ∨
      _root_.MIPStarRE.QPBT.directEvalOpt line (line.base + parameter • line.direction) coeffsB = none := by sorry
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Combining/ExtendedLineGame/ParameterCompletion.lean#L47-L79

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me