Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Combining / ExtendedLineGame / LinePointRejection

Definition
QPBT_QPBT_Combining_ExtendedLineGame_LinePointRejection

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

qpbt

This bundle defines the answer-reading operations for the one-coordinate extended direct low-degree game. It extracts the unique coordinate, reads axis and diagonal line answers by completed evaluation, and exposes the optional Pauli scalar at the sampled point.

Principal definitions:

  • MIPStarRE.QPBT.ExtendedLineGame.onlyCoordinate: selects the unique coordinate of the one-coordinate extended direct low-degree game.
  • MIPStarRE.QPBT.ExtendedLineGame.axisGameRead: reads an axis-line answer by completed evaluation at the sampled point.
  • MIPStarRE.QPBT.ExtendedLineGame.pointGameRead: reads the unique point coordinate as an optional Pauli scalar.
  • MIPStarRE.QPBT.ExtendedLineGame.diagonalGameRead: reads a diagonal-line answer by completed evaluation at the sampled point.

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/Combining/ExtendedLineGame/LinePointRejection.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_Combining_DirectLowDegree_Game
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Geometry
import Definitions.Def_QPBT_QPBT_Combining_Witnesses
import Definitions.Def_QPBT_QPBT_Observables_Defs
import Definitions.Def_QPBT_QPBT_Test_PauliBasisTest
import Mathlib
import Mathlib.Analysis.MeanInequalitiesPow

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

/-!
# Line/point rejection for the extended direct game

This module identifies the axis-line/point, diagonal-line/point, and reversed
point/axis-line branch rejections of the strategy constructed from an
`ExtendedLinesWitness` with the corresponding completed line-point defects.
These are finite postprocessing and state-transport steps in the first
paragraph of the proof of `lem:qld-4-7`; they do not establish a passing-value
bound or construct the supplied witness.

## References

- `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:1279-1288`
- Blueprint `lem:qld-4-7`.
- Issues #302, #305, #307, and #309.
-/
@[expose] public section
open scoped BigOperators MatrixOrder ComplexOrder

-- The six-register products use the same instance-search budget as StateTransport.
set_option synthInstance.maxSize 400

namespace MIPStarRE.QPBT

open LIDT.MIPStarRE.LDT hiding Measurement
open LIDT.MIPStarRE.Quantum

noncomputable section

namespace ExtendedLineGame

variable {P : _root_.MIPStarRE.QPBT.AdmissibleParams} {epsilon deltaQ deltaL : ℝ}
variable {setting : _root_.MIPStarRE.QPBT.ProjectiveSetting P epsilon}
variable {points : _root_.MIPStarRE.QPBT.CombinedPointsWitness setting deltaQ}

/-- The unique coordinate of the one-coordinate extended direct low-degree game. -/
def onlyCoordinate : Fin P.extendedDirectLd.k :=
  ⟨0, by change 0 < 1; decide⟩

/-- Read an axis-line answer by completed evaluation at the sampled point.
Failed completed evaluation, including a zero-direction ambiguity, remains
the `none` outcome. -/
def axisGameRead
    (sample : _root_.MIPStarRE.QPBT.DirectLdSpace P.extendedDirectLd) :
    _root_.MIPStarRE.QPBT.DirectLdAnswer P.extendedDirectLd → Option (_root_.MIPStarRE.QPBT.PauliScalar P)
  | .alinePolys coeffs =>
      (_root_.MIPStarRE.QPBT.directEvalOpt (_root_.MIPStarRE.QPBT.directALineDescOf P.extendedDirectLd sample) sample.point
        (coeffs _root_.MIPStarRE.QPBT.ExtendedLineGame.onlyCoordinate)).map (_root_.MIPStarRE.QPBT.extendedDirectScalarEquiv P)
  | _ => none

/-- Read the unique point coordinate as an optional Pauli scalar. Support for
`lem:qld-4-7`, paper `14_analysis_of_the_pauli_basis_test.tex:1279-1288`. -/
def pointGameRead :
    _root_.MIPStarRE.QPBT.DirectLdAnswer P.extendedDirectLd → Option (_root_.MIPStarRE.QPBT.PauliScalar P)
  | .pointVals values => some (_root_.MIPStarRE.QPBT.extendedDirectScalarEquiv P (values _root_.MIPStarRE.QPBT.ExtendedLineGame.onlyCoordinate))
  | _ => none

















/-- Read a diagonal-line answer by completed evaluation at the sampled point.
Other answer formats and undefined evaluations return `none`.
Support for `lem:qld-4-7`, paper `14_analysis_of_the_pauli_basis_test.tex:1279-1288`. -/
def diagonalGameRead
    (sample : _root_.MIPStarRE.QPBT.DirectLdSpace P.extendedDirectLd) :
    _root_.MIPStarRE.QPBT.DirectLdAnswer P.extendedDirectLd → Option (_root_.MIPStarRE.QPBT.PauliScalar P)
  | .dlinePolys coeffs =>
      (_root_.MIPStarRE.QPBT.directEvalOpt (_root_.MIPStarRE.QPBT.directDLineDescOf P.extendedDirectLd sample) sample.point
        (coeffs _root_.MIPStarRE.QPBT.ExtendedLineGame.onlyCoordinate)).map (_root_.MIPStarRE.QPBT.extendedDirectScalarEquiv P)
  | _ => none

































end ExtendedLineGame
end

end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Combining/ExtendedLineGame/LinePointRejection.lean#L39-L377

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