Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Combining / DirectLowDegree / Transport / Consistency / State

Definition
QPBT_QPBT_Combining_DirectLowDegree_Transport_Consistency_State

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

qpbt

This bundle defines the state and evaluated point-measurement families used in the direct-to-LDT transport. It constructs Alice and Bob coordinate families, evaluates transported polynomial measurements, and places Alice's family on the left register.

Principal definitions:

  • MIPStarRE.QPBT.gameStrategyPureState: defines the pure state carried by a game strategy as a low-degree-test pure state.
  • MIPStarRE.QPBT.directPointCoordinateMeasurementA: defines Alice's direct point measurement followed by projection to a selected coordinate.
  • MIPStarRE.QPBT.directPointCoordinateMeasurementB: defines Bob's direct point measurement followed by projection to a selected coordinate.
  • MIPStarRE.QPBT.directPolynomialEvaluationMeasurement: evaluates a transported low-degree polynomial measurement at a direct point.
  • MIPStarRE.QPBT.ldtCoordinatePointMeasurementA: defines Alice's low-degree-test point family obtained from a direct coordinate.
  • MIPStarRE.QPBT.ldtCoordinatePointMeasurementB: defines Bob's low-degree-test point family obtained from a direct coordinate.
  • MIPStarRE.QPBT.ldtPolynomialEvaluationMeasurement: defines the projective evaluation family associated with a global polynomial projective measurement.
  • MIPStarRE.QPBT.ldtPointAPlaced: defines the left placement of Alice's low-degree-test point family.

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/DirectLowDegree/Transport/Consistency/State.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_Basic_SubMeasurementCore
import Definitions.Def_LIDT_MIPStarRE_LDT_Basic_SubMeasurementFamilies
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_LIDT_MIPStarRE_Quantum_FiniteMatrix_Basic
import Definitions.Def_LIDT_MIPStarRE_Quantum_Measurement
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_DirectLowDegree_Transport_Consistency_Measurements
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Correspondence
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Questions
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_Strategy
import Definitions.Def_QPBT_QPBT_Games_Defs
import Definitions.Def_QPBT_QPBT_Games_DistanceTheorems_Support
import Definitions.Def_QPBT_QPBT_Games_StrategyClasses
import Definitions.Def_QPBT_QPBT_Test_LowDegreeGameMeasurements
import Mathlib

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

/-!
# State conversion and direct point readout

This module contains the pure-state conversion and direct point-readout
portion of the low-degree consistency transport.

## References

- `references/qpbt-paper/08_classical_and_quantum_low_degree_tests.tex:393-458`
- `references/ldt-paper/test_definition.tex:180-202`
- `docs/paper-gaps/qpbt_ld-dimension-divisibility.tex`
-/

@[expose] public section

open scoped BigOperators Matrix MatrixOrder ComplexOrder

namespace MIPStarRE.QPBT

open LIDT.MIPStarRE.LDT
open LIDT.MIPStarRE.LDT.Preliminaries
open LIDT.MIPStarRE.Quantum

noncomputable section

/-! ## Equality of the two consistency formulations -/

-- The following identities identify pure-state expectation with the
-- Euclidean quadratic form used in the consistency calculations below.  They
-- send a pure state to its Euclidean coordinate vector and identify the
-- quadratic form of that vector with evaluation in the associated density
-- state; they are stated for an arbitrary finite index type in
-- `MIPStarRE/QPBT/Games/DistanceTheorems/Support.lean`.




/-! ## Direct-strategy state and point readout -/



/-- The pure state carried by a game strategy, regarded as an LDT pure state. -/
noncomputable def gameStrategyPureState {G : _root_.MIPStarRE.QPBT.Game} (S : _root_.MIPStarRE.QPBT.Strategy G) :
    letI : Nonempty (S.ιA × S.ιB) :=
      (_root_.MIPStarRE.QPBT.strategyQuantumState_isNormalized S).nonempty
    _root_.LIDT.MIPStarRE.LDT.PureState (S.ιA × S.ιB) := by
  letI : Nonempty (S.ιA × S.ιB) :=
    (_root_.MIPStarRE.QPBT.strategyQuantumState_isNormalized S).nonempty
  exact _root_.MIPStarRE.QPBT.strategyPureState S

@[simp] theorem gameStrategyPureState_vector {G : _root_.MIPStarRE.QPBT.Game} (S : _root_.MIPStarRE.QPBT.Strategy G) :
    letI : Nonempty (S.ιA × S.ιB) :=
      (_root_.MIPStarRE.QPBT.strategyQuantumState_isNormalized S).nonempty
    (_root_.MIPStarRE.QPBT.gameStrategyPureState S).vector = S.ψ := by
  letI : Nonempty (S.ιA × S.ιB) :=
    (_root_.MIPStarRE.QPBT.strategyQuantumState_isNormalized S).nonempty
  rfl



/-- The Euclidean vector of the strategy's pure-state presentation is the
original game vector. -/
@[simp] theorem gameStrategyPureState_euclideanVector
    {G : _root_.MIPStarRE.QPBT.Game} (S : _root_.MIPStarRE.QPBT.Strategy G) :
    letI : Nonempty (S.ιA × S.ιB) :=
      (_root_.MIPStarRE.QPBT.strategyQuantumState_isNormalized S).nonempty
    _root_.MIPStarRE.QPBT.DistanceCalculus.pureStateEuclideanVector (_root_.MIPStarRE.QPBT.gameStrategyPureState S) = S.ψ := by
  letI : Nonempty (S.ιA × S.ιB) :=
    (_root_.MIPStarRE.QPBT.strategyQuantumState_isNormalized S).nonempty
  apply (EuclideanSpace.equiv (S.ιA × S.ιB) ℂ).injective
  rfl



@[simp] theorem directPointQuestionOf_directPointEquiv
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) (u : Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) :
    _root_.MIPStarRE.QPBT.directPointQuestionOf D (_root_.MIPStarRE.QPBT.directPointEquiv D u) =
      _root_.MIPStarRE.QPBT.directLdPointQuestionOf D u := by
  unfold _root_.MIPStarRE.QPBT.directPointQuestionOf _root_.MIPStarRE.QPBT.ldtPointToDirect
  rw [(_root_.MIPStarRE.QPBT.directPointEquiv D).symm_apply_apply]



/-- The LDT scalar readout is the direct coordinate readout followed by
the scalar coding equivalence. -/
@[simp] theorem directPointAnswerReadout_eq
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) (r : Fin D.k) (answer : _root_.MIPStarRE.QPBT.DirectLdAnswer D) :
    letI := D.toLDTFieldModel
    _root_.MIPStarRE.QPBT.directPointAnswerReadout D r answer =
      _root_.MIPStarRE.QPBT.directScalarEquiv D (_root_.MIPStarRE.QPBT.directLdPointValuesOrZero D answer r) := by
  letI := D.toLDTFieldModel
  cases answer <;> rfl





/-- Alice's direct point measurement followed by projection to coordinate
`r`. -/
noncomputable def directPointCoordinateMeasurementA
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.directLdGame D))
    (r : Fin D.k) (u : Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.MIPStarRE.QPBT.DirectScalarQ D) S.ιA :=
  (S.A (_root_.MIPStarRE.QPBT.directLdPointQuestionOf D u)).postprocess
    (fun answer => _root_.MIPStarRE.QPBT.directLdPointValuesOrZero D answer r)

/-- Bob's direct point measurement followed by projection to coordinate
`r`. -/
noncomputable def directPointCoordinateMeasurementB
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.directLdGame D))
    (r : Fin D.k) (u : Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.MIPStarRE.QPBT.DirectScalarQ D) S.ιB :=
  (S.B (_root_.MIPStarRE.QPBT.directLdPointQuestionOf D u)).postprocess
    (fun answer => _root_.MIPStarRE.QPBT.directLdPointValuesOrZero D answer r)

/-- Evaluate a transported LDT polynomial measurement at a direct point. -/
noncomputable def directPolynomialEvaluationMeasurement
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) :
    letI := D.toLDTFieldModel
    {iota : Type*} → [Fintype iota] → [DecidableEq iota] →
      _root_.LIDT.MIPStarRE.LDT.ProjMeas (_root_.LIDT.MIPStarRE.LDT.Polynomial D.toLDTParameters) iota →
        (Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) →
          _root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.MIPStarRE.QPBT.DirectScalarQ D) iota := by
  letI := D.toLDTFieldModel
  intro iota _ _ G u
  exact (_root_.MIPStarRE.QPBT.directPolynomialMeasurement D G).postprocess
    (fun g => MvPolynomial.eval u g.1)

/-- Alice's LDT point family obtained from direct coordinate `r`. -/
noncomputable def ldtCoordinatePointMeasurementA
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.directLdGame D))
    (hS : S.IsProjective) (r : Fin D.k) :
    letI := D.toLDTFieldModel
    _root_.LIDT.MIPStarRE.LDT.IdxProjMeas (_root_.LIDT.MIPStarRE.LDT.Point D.toLDTParameters) (_root_.LIDT.MIPStarRE.LDT.Fq D.toLDTParameters) S.ιA := by
  letI := D.toLDTFieldModel
  exact (_root_.MIPStarRE.QPBT.directCoordinateProjStrat D S hS r).pointMeasurementA

/-- Bob's LDT point family obtained from direct coordinate `r`. -/
noncomputable def ldtCoordinatePointMeasurementB
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.directLdGame D))
    (hS : S.IsProjective) (r : Fin D.k) :
    letI := D.toLDTFieldModel
    _root_.LIDT.MIPStarRE.LDT.IdxProjMeas (_root_.LIDT.MIPStarRE.LDT.Point D.toLDTParameters) (_root_.LIDT.MIPStarRE.LDT.Fq D.toLDTParameters) S.ιB := by
  letI := D.toLDTFieldModel
  exact (_root_.MIPStarRE.QPBT.directCoordinateProjStrat D S hS r).pointMeasurementB

/-- The LDT projective evaluation family associated with a global
polynomial projective measurement. -/
noncomputable def ldtPolynomialEvaluationMeasurement
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) :
    letI := D.toLDTFieldModel
    {iota : Type*} → [Fintype iota] → [DecidableEq iota] →
      _root_.LIDT.MIPStarRE.LDT.ProjMeas (_root_.LIDT.MIPStarRE.LDT.Polynomial D.toLDTParameters) iota →
        _root_.LIDT.MIPStarRE.LDT.IdxProjMeas (_root_.LIDT.MIPStarRE.LDT.Point D.toLDTParameters) (_root_.LIDT.MIPStarRE.LDT.Fq D.toLDTParameters) iota := by
  letI := D.toLDTFieldModel
  intro iota _ _ G u
  exact _root_.LIDT.MIPStarRE.LDT.ProjMeas.postprocess G (fun g => g u)

/-- Left placement of Alice's LDT point family. -/
noncomputable def ldtPointAPlaced
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.directLdGame D))
    (hS : S.IsProjective) (r : Fin D.k) :
    letI := D.toLDTFieldModel
    _root_.LIDT.MIPStarRE.LDT.Point D.toLDTParameters → _root_.LIDT.MIPStarRE.LDT.Fq D.toLDTParameters → _root_.LIDT.MIPStarRE.Quantum.Op (S.ιA × S.ιB) := by
  letI := D.toLDTFieldModel
  intro u a
  exact _root_.MIPStarRE.QPBT.heteroKron ((_root_.MIPStarRE.QPBT.ldtCoordinatePointMeasurementA D S hS r u).outcome a) 1

/-- Right placement of Bob's LDT point family. -/
noncomputable def ldtPointBPlaced
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) (S : _root_.MIPStarRE.QPBT.Strategy (_root_.MIPStarRE.QPBT.directLdGame D))
    (hS : S.IsProjective) (r : Fin D.k) :
    letI := D.toLDTFieldModel
    _root_.LIDT.MIPStarRE.LDT.Point D.toLDTParameters → _root_.LIDT.MIPStarRE.LDT.Fq D.toLDTParameters → _root_.LIDT.MIPStarRE.Quantum.Op (S.ιA × S.ιB) := by
  letI := D.toLDTFieldModel
  intro u a
  exact _root_.MIPStarRE.QPBT.heteroKron 1 ((_root_.MIPStarRE.QPBT.ldtCoordinatePointMeasurementB D S hS r u).outcome a)

/-- Left placement of an LDT polynomial evaluation family. -/
noncomputable def ldtPolynomialEvaluationLeft
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) {iotaA iotaB : Type*}
    [Fintype iotaA] [DecidableEq iotaA]
    [Fintype iotaB] [DecidableEq iotaB] :
    letI := D.toLDTFieldModel
    _root_.LIDT.MIPStarRE.LDT.ProjMeas (_root_.LIDT.MIPStarRE.LDT.Polynomial D.toLDTParameters) iotaA →
      _root_.LIDT.MIPStarRE.LDT.Point D.toLDTParameters → _root_.LIDT.MIPStarRE.LDT.Fq D.toLDTParameters → _root_.LIDT.MIPStarRE.Quantum.Op (iotaA × iotaB) := by
  letI := D.toLDTFieldModel
  intro G u a
  exact _root_.MIPStarRE.QPBT.heteroKron ((_root_.MIPStarRE.QPBT.ldtPolynomialEvaluationMeasurement D G u).outcome a) 1

/-- Right placement of an LDT polynomial evaluation family. -/
noncomputable def ldtPolynomialEvaluationRight
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) {iotaA iotaB : Type*}
    [Fintype iotaA] [DecidableEq iotaA]
    [Fintype iotaB] [DecidableEq iotaB] :
    letI := D.toLDTFieldModel
    _root_.LIDT.MIPStarRE.LDT.ProjMeas (_root_.LIDT.MIPStarRE.LDT.Polynomial D.toLDTParameters) iotaB →
      _root_.LIDT.MIPStarRE.LDT.Point D.toLDTParameters → _root_.LIDT.MIPStarRE.LDT.Fq D.toLDTParameters → _root_.LIDT.MIPStarRE.Quantum.Op (iotaA × iotaB) := by
  letI := D.toLDTFieldModel
  intro G u a
  exact _root_.MIPStarRE.QPBT.heteroKron 1 ((_root_.MIPStarRE.QPBT.ldtPolynomialEvaluationMeasurement D G u).outcome a)

/-- Left placement of an LDT global polynomial measurement. -/
noncomputable def ldtPolynomialLeftPlaced
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) {iotaA iotaB : Type*}
    [Fintype iotaA] [DecidableEq iotaA]
    [Fintype iotaB] [DecidableEq iotaB] :
    letI := D.toLDTFieldModel
    _root_.LIDT.MIPStarRE.LDT.ProjMeas (_root_.LIDT.MIPStarRE.LDT.Polynomial D.toLDTParameters) iotaA →
      _root_.LIDT.MIPStarRE.LDT.Polynomial D.toLDTParameters → _root_.LIDT.MIPStarRE.Quantum.Op (iotaA × iotaB) := by
  letI := D.toLDTFieldModel
  intro G g
  exact _root_.MIPStarRE.QPBT.heteroKron (G.outcome g) 1

/-- Right placement of an LDT global polynomial measurement. -/
noncomputable def ldtPolynomialRightPlaced
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) {iotaA iotaB : Type*}
    [Fintype iotaA] [DecidableEq iotaA]
    [Fintype iotaB] [DecidableEq iotaB] :
    letI := D.toLDTFieldModel
    _root_.LIDT.MIPStarRE.LDT.ProjMeas (_root_.LIDT.MIPStarRE.LDT.Polynomial D.toLDTParameters) iotaB →
      _root_.LIDT.MIPStarRE.LDT.Polynomial D.toLDTParameters → _root_.LIDT.MIPStarRE.Quantum.Op (iotaA × iotaB) := by
  letI := D.toLDTFieldModel
  intro G g
  exact _root_.MIPStarRE.QPBT.heteroKron 1 (G.outcome g)

/-! ## Deprecated names

The names below were used before the constructions above were named after the
low individual degree test they belong to.  They are retained only because the
stacked branch `issue-134-simultaneous-polynomial-measurements` refers to them.
-/





















end

end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Combining/DirectLowDegree/Transport/Consistency/State.lean#L137-L408

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