Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Combining / ExtendedLineGame / PairMeasurement

Definition
QPBT_QPBT_Combining_ExtendedLineGame_PairMeasurement

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

qpbt

This bundle defines the canonical coefficient-field pair measurement for the extended line game. It identifies actual rounded outcomes with polynomial pairs, relabels the measurement, preserves individual effects, and proves that coefficient maps retain the required degree bounds.

Principal definitions:

  • MIPStarRE.QPBT.ExtendedLineGame.directPolynomialEquiv: the equivalence between actual rounded outcomes and bounded polynomial pairs.
  • MIPStarRE.QPBT.ExtendedLineGame.directCombinedEmbedding: the actual outcome corresponding to a polynomial pair.
  • MIPStarRE.QPBT.ExtendedLineGame.canonicalPolynomialMeasurement: the relabeled canonical measurement.
  • MIPStarRE.QPBT.ExtendedLineGame.directPairMeasurement: the complete projective pair measurement.
  • MIPStarRE.QPBT.ExtendedLineGame.canonicalPolynomialMeasurement_effect: preservation of each original effect under relabeling.
  • MIPStarRE.QPBT.ExtendedLineGame.map_mem_polyFunc: preservation of coordinatewise degree bounds under coefficient mapping.

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/PairMeasurement.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_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_Defs
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Game
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Geometry
import Definitions.Def_QPBT_QPBT_Combining_PairCompletion
import Definitions.Def_QPBT_QPBT_Combining_Witnesses
import Definitions.Def_QPBT_QPBT_Games_Sandwich_Support
import Definitions.Def_QPBT_QPBT_Test_LowDegreeGameMeasurements
import Definitions.Def_QPBT_QPBT_Test_PauliBasisTest
import Mathlib
import Mathlib.Algebra.MvPolynomial.Equiv
import Mathlib.Analysis.MeanInequalitiesPow

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

/-!
# Transport of the polynomial-pair completion

The actual singleton outcomes are transported by the canonical field
equivalence before applying the algebraic completion.
Every original outcome is retained, including those outside the combining image.

## References

Paper `eq:qld-sgg-completeness` and the completion paragraph of `lem:qld-4-7`,
`references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:1375-1404`.
-/

@[expose] public section

open scoped BigOperators MatrixOrder

namespace MIPStarRE.QPBT.ExtendedLineGame

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

noncomputable section

private theorem map_mem_polyFunc {K L : Type*} [CommSemiring K] [CommSemiring L]
    {n d : ℕ} (e : K →+* L) (p : _root_.LIDT.MIPStarRE.LDT.Preliminaries.polyFunc n K d) :
    MvPolynomial.map e p.1 ∈ _root_.LIDT.MIPStarRE.LDT.Preliminaries.polyFunc n L d := by
  rw [MvPolynomial.mem_restrictDegree]
  intro s hs i
  exact (MvPolynomial.mem_restrictDegree _ _ _).mp p.2 s
    (MvPolynomial.support_map_subset e p.1 hs) i

/-- Exact singleton and coefficient-field equivalence for the actual rounded
outcomes. The degree certificates are transported through support inclusion. -/
def directPolynomialEquiv (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
    _root_.MIPStarRE.QPBT.DirectPolyTuple P.extendedDirectLd ≃
      _root_.LIDT.MIPStarRE.LDT.Preliminaries.polyFunc (2 * P.m + 2) (_root_.MIPStarRE.QPBT.PauliScalar P) P.d where
  toFun g := ⟨MvPolynomial.map (_root_.MIPStarRE.QPBT.extendedDirectScalarEquiv P).toRingHom (g (0 : Fin 1)).1,
    by exact map_mem_polyFunc _ _⟩
  invFun p := fun _ => ⟨MvPolynomial.map (_root_.MIPStarRE.QPBT.extendedDirectScalarEquiv P).symm.toRingHom p.1,
    by exact map_mem_polyFunc _ _⟩
  left_inv g := by
    funext i
    have hi : i = (0 : Fin 1) := @Subsingleton.elim (Fin 1) _ i 0
    subst i
    apply Subtype.ext
    exact (MvPolynomial.mapEquiv _ (_root_.MIPStarRE.QPBT.extendedDirectScalarEquiv P)).symm_apply_apply _
  right_inv p := by
    apply Subtype.ext
    exact (MvPolynomial.mapEquiv _ (_root_.MIPStarRE.QPBT.extendedDirectScalarEquiv P)).apply_symm_apply _

/-- The actual singleton outcome corresponding to a bounded polynomial pair. -/
def directCombinedEmbedding (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
    _root_.MIPStarRE.QPBT.PolyPair P ↪ _root_.MIPStarRE.QPBT.DirectPolyTuple P.extendedDirectLd :=
  (_root_.MIPStarRE.QPBT.combinedPolyEmbedding P).trans (_root_.MIPStarRE.QPBT.ExtendedLineGame.directPolynomialEquiv P).symm.toEmbedding

/-- Relabel the actual rounded measurement in the canonical coefficient field. -/
def canonicalPolynomialMeasurement {P : _root_.MIPStarRE.QPBT.AdmissibleParams} {ι : Type*}
    [Fintype ι] [DecidableEq ι] (R : _root_.MIPStarRE.QPBT.DirectPolyMeasTuple P.extendedDirectLd ι) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.LIDT.MIPStarRE.LDT.Preliminaries.polyFunc (2 * P.m + 2) (_root_.MIPStarRE.QPBT.PauliScalar P) P.d) ι :=
  R.postprocess (_root_.MIPStarRE.QPBT.ExtendedLineGame.directPolynomialEquiv P)

/-- The canonical relabeling retains each original effect exactly. -/
@[simp] theorem canonicalPolynomialMeasurement_effect {P : _root_.MIPStarRE.QPBT.AdmissibleParams} {ι : Type*}
    [Fintype ι] [DecidableEq ι] (R : _root_.MIPStarRE.QPBT.DirectPolyMeasTuple P.extendedDirectLd ι)
    (p : _root_.LIDT.MIPStarRE.LDT.Preliminaries.polyFunc (2 * P.m + 2) (_root_.MIPStarRE.QPBT.PauliScalar P) P.d) :
    (_root_.MIPStarRE.QPBT.ExtendedLineGame.canonicalPolynomialMeasurement R).effect p =
      R.effect ((_root_.MIPStarRE.QPBT.ExtendedLineGame.directPolynomialEquiv P).symm p) := by
  have h := _root_.MIPStarRE.QPBT.SandwichProduct.postprocess_effect_of_injective R (_root_.MIPStarRE.QPBT.ExtendedLineGame.directPolynomialEquiv P)
    (_root_.MIPStarRE.QPBT.ExtendedLineGame.directPolynomialEquiv P).injective ((_root_.MIPStarRE.QPBT.ExtendedLineGame.directPolynomialEquiv P).symm p)
  simpa only [_root_.MIPStarRE.QPBT.ExtendedLineGame.canonicalPolynomialMeasurement, Equiv.apply_symm_apply] using h

/-- The complete projective pair construction applied to the actual
rounded measurement, including all excluded outcomes at one chosen pair. -/
def directPairMeasurement {P : _root_.MIPStarRE.QPBT.AdmissibleParams} {ι : Type*}
    [Fintype ι] [DecidableEq ι] (R : _root_.MIPStarRE.QPBT.DirectPolyMeasTuple P.extendedDirectLd ι)
    (pair₀ : _root_.MIPStarRE.QPBT.PolyPair P) : _root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.MIPStarRE.QPBT.PolyPair P) ι :=
  _root_.MIPStarRE.QPBT.completedPairMeasurement P (_root_.MIPStarRE.QPBT.ExtendedLineGame.canonicalPolynomialMeasurement R) pair₀







end

end MIPStarRE.QPBT.ExtendedLineGame
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Combining/ExtendedLineGame/PairMeasurement.lean#L30-L83

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