Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Definition
QPBT_QPBT_Combining_DirectLowDegree_Transport_Consistency_Measurements

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

qpbt

This bundle connects LDT measurement families with the direct QPBT polynomial representation and its seed-fiber compression. It defines polynomial equivalences, matrix-valued measurement conversion, diagonal-block compression, seed-fiber specialization, and the variable-reversal identity for direct representatives.

Principal definitions:

  • MIPStarRE.QPBT.directPolyEquivPolynomial: equivalence between direct representatives and LDT polynomial outcomes.
  • MIPStarRE.QPBT.ldtMeasurementToMatrixMeasurement: views an LDT measurement as a matrix-valued QPBT measurement.
  • MIPStarRE.QPBT.directPolynomialMeasurement: relabels an LDT projective measurement by direct representatives.
  • MIPStarRE.QPBT.averageDiagonalBlock: averages diagonal blocks over an ancillary register.
  • MIPStarRE.QPBT.correlatedAncillaCompressMeasurement: compresses a POVM through the normalized diagonal-block average.
  • MIPStarRE.QPBT.seedFiberCompressMeasurement: specializes compression to the nonempty seed residue fiber.
  • MIPStarRE.QPBT.seedFiberCompressPolyMeasTuple: compresses a polynomial-tuple POVM to a seed-indexed POVM.
  • MIPStarRE.QPBT.directPolyEquivPolynomial_poly: identifies the direct variable-reversal renaming.

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/Measurements.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_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_Correspondence
import Definitions.Def_QPBT_QPBT_Combining_DirectLowDegree_Transport_SeedFiber
import Definitions.Def_QPBT_QPBT_Test_LowDegreeGame
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

/-!
# Low-degree consistency transport

This module identifies the low individual degree polynomial outcomes with the
bounded polynomial representatives used by the directly indexed QPBT game.  It
also transports complete measurements and their evaluation postprocessings
without changing either coordinate order or consistency error.

## 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

/-! ## Polynomial outcomes -/

private theorem directPolynomialRename_degreeOf_le
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) (p : MvPolynomial (Fin D.m) (_root_.MIPStarRE.QPBT.DirectScalarQ D))
    (hp : ∀ i, MvPolynomial.degreeOf i p ≤ D.d) (i : Fin D.m) :
    MvPolynomial.degreeOf i (MvPolynomial.rename Fin.rev p) ≤ D.d := by
  rw [← Fin.rev_rev i,
    MvPolynomial.degreeOf_rename_of_injective Fin.rev_injective]
  exact hp (Fin.rev i)

private theorem ldtPolynomial_ext
    {params : _root_.LIDT.MIPStarRE.LDT.Parameters} [_root_.LIDT.MIPStarRE.LDT.FieldModel params.q]
    {g h : _root_.LIDT.MIPStarRE.LDT.Polynomial params} (hpoly : g.poly = h.poly) : g = h := by
  cases g with
  | mk gp hg =>
      cases h with
      | mk hp hh =>
          simp only at hpoly
          subst hp
          rfl

/-- Bounded QPBT polynomial representatives are equivalent to LDT
polynomial outcomes.  The variable renaming is the same coordinate reversal
as `directPointEquiv`, so evaluation retains the direct coordinate order. -/
noncomputable def directPolyEquivPolynomial (D : _root_.MIPStarRE.QPBT.DirectLdParams) :
    letI := D.toLDTFieldModel
    _root_.MIPStarRE.QPBT.PolyIndex D.m (_root_.MIPStarRE.QPBT.DirectScalarQ D) D.d ≃
      _root_.LIDT.MIPStarRE.LDT.Polynomial D.toLDTParameters := by
  letI := D.toLDTFieldModel
  refine
    { toFun := fun g =>
        { poly := MvPolynomial.rename Fin.rev g.1
          lowIndividualDegree := by
            exact directPolynomialRename_degreeOf_le D g.1
              (_root_.LIDT.MIPStarRE.LDT.Preliminaries.degreeOf_le_of_mem_polyFunc g.2) }
      invFun := fun g =>
        ⟨MvPolynomial.rename Fin.rev g.poly, by
          rw [MvPolynomial.mem_restrictDegree]
          intro s hs i
          exact (MvPolynomial.degreeOf_le_iff.mp (by
            exact directPolynomialRename_degreeOf_le D g.poly
              g.lowIndividualDegree i)) s hs⟩
      left_inv := ?_
      right_inv := ?_ }
  · intro g
    apply Subtype.ext
    change MvPolynomial.rename Fin.rev
      (MvPolynomial.rename Fin.rev g.1) = g.1
    rw [MvPolynomial.rename_rename]
    rw [show Fin.rev ∘ Fin.rev = id by funext i; simp]
    exact MvPolynomial.rename_id_apply g.1
  · intro g
    cases g with
    | mk p hp =>
        have hpoly : MvPolynomial.rename Fin.rev
            (MvPolynomial.rename Fin.rev p) = p := by
          rw [MvPolynomial.rename_rename]
          rw [show Fin.rev ∘ Fin.rev = id by funext i; simp]
          exact MvPolynomial.rename_id_apply p
        exact (by
          exact ldtPolynomial_ext hpoly)

@[simp] theorem directPolyEquivPolynomial_poly
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) (g : _root_.MIPStarRE.QPBT.PolyIndex D.m (_root_.MIPStarRE.QPBT.DirectScalarQ D) D.d) :
    letI := D.toLDTFieldModel
    (_root_.MIPStarRE.QPBT.directPolyEquivPolynomial D g).poly = MvPolynomial.rename Fin.rev g.1 := by
  letI := D.toLDTFieldModel
  rfl

/-- The polynomial equivalence commutes with evaluation after the direct point
and scalar codings. -/
@[simp] theorem directPolyEquivPolynomial_apply
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) (g : _root_.MIPStarRE.QPBT.PolyIndex D.m (_root_.MIPStarRE.QPBT.DirectScalarQ D) D.d)
    (u : Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D) :
    letI := D.toLDTFieldModel
    _root_.MIPStarRE.QPBT.directPolyEquivPolynomial D g (_root_.MIPStarRE.QPBT.directPointEquiv D u) =
      _root_.MIPStarRE.QPBT.directScalarEquiv D (MvPolynomial.eval u g.1) := by
  letI := D.toLDTFieldModel
  unfold _root_.LIDT.MIPStarRE.LDT.Polynomial.toFun _root_.LIDT.MIPStarRE.LDT.evalPolynomialModel
  rw [_root_.MIPStarRE.QPBT.directPolyEquivPolynomial_poly]
  unfold _root_.LIDT.MIPStarRE.LDT.decodePoint
  rw [MvPolynomial.eval_rename]
  congr 1
  apply congrArg (fun v : Fin D.m → _root_.MIPStarRE.QPBT.DirectScalarQ D =>
    MvPolynomial.eval v g.1)
  funext i
  simp only [Function.comp_apply, _root_.MIPStarRE.QPBT.directPointEquiv_apply, Fin.rev_rev]
  change (_root_.MIPStarRE.QPBT.directScalarEquiv D).symm (_root_.MIPStarRE.QPBT.directScalarEquiv D (u i)) = u i
  exact (_root_.MIPStarRE.QPBT.directScalarEquiv D).symm_apply_apply (u i)

/-! ## Complete measurements -/

/-- Regard a complete LDT measurement as a matrix-valued QPBT
measurement, with exactly the same effects. -/
noncomputable def ldtMeasurementToMatrixMeasurement
    {alpha iota : Type*} [Fintype alpha] [Fintype iota] [DecidableEq iota]
    (M : _root_.LIDT.MIPStarRE.LDT.Measurement alpha iota) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement alpha iota :=
  _root_.LIDT.MIPStarRE.Quantum.Measurement.ofSumEqOne M.outcome M.outcome_pos (by
    rw [M.sum_eq_total, M.total_eq_one])

@[simp] theorem ldtMeasurementToMatrixMeasurement_effect
    {alpha iota : Type*} [Fintype alpha] [Fintype iota] [DecidableEq iota]
    (M : _root_.LIDT.MIPStarRE.LDT.Measurement alpha iota) (a : alpha) :
    (_root_.MIPStarRE.QPBT.ldtMeasurementToMatrixMeasurement M).effect a = M.outcome a :=
  rfl

/-- Relabel an LDT polynomial projective measurement by direct QPBT
polynomial representatives. -/
noncomputable def directPolynomialMeasurement
    (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_.MIPStarRE.QPBT.PolyMeas D.m (_root_.MIPStarRE.QPBT.DirectScalarQ D) D.d iota := by
  letI := D.toLDTFieldModel
  intro iota _ _ G
  exact _root_.MIPStarRE.QPBT.matrixMeasurementTransport (_root_.MIPStarRE.QPBT.directPolyEquivPolynomial D).symm
    (_root_.MIPStarRE.QPBT.ldtMeasurementToMatrixMeasurement G.toMeasurement)

@[simp] theorem directPolynomialMeasurement_effect
    (D : _root_.MIPStarRE.QPBT.DirectLdParams) :
    letI := D.toLDTFieldModel
    ∀ {iota : Type*} [Fintype iota] [DecidableEq iota]
      (G : _root_.LIDT.MIPStarRE.LDT.ProjMeas (_root_.LIDT.MIPStarRE.LDT.Polynomial D.toLDTParameters) iota)
      (g : _root_.MIPStarRE.QPBT.PolyIndex D.m (_root_.MIPStarRE.QPBT.DirectScalarQ D) D.d),
      (_root_.MIPStarRE.QPBT.directPolynomialMeasurement D G).effect g =
        G.outcome (_root_.MIPStarRE.QPBT.directPolyEquivPolynomial D g) := by
  letI := D.toLDTFieldModel
  intro iota _ _ G g
  rfl











/-! ## Correlated-ancilla compression -/

/-!
The diagonal-block conditional expectation preserves either mixed defect
exactly because the point measurement on the opposite carrier is constant on
the residue register.  It does not yield a global/global compression theorem:
the lifted state pairs equal residues, whereas separately compressing both
polynomial measurements produces an independent double average over residues.
Neither quantity bounds the other in general.  This open obstruction is
recorded in `docs/paper-gaps/qpbt_ld-dimension-divisibility.tex`.
-/

/-- The normalized diagonal-block average of an operator on a carrier with a
finite ancillary register.  This is the local conditional expectation used to
discard one half of the correlated seed-residue ancilla. -/
noncomputable def averageDiagonalBlock
    {iota block : Type*} [Fintype iota] [Fintype block]
    (A : _root_.LIDT.MIPStarRE.Quantum.Op (iota × block)) : _root_.LIDT.MIPStarRE.Quantum.Op iota := by
  classical
  exact (Fintype.card block : ℝ)⁻¹ •
    ∑ r, A.submatrix (fun i => (i, r)) (fun i => (i, r))

/-- Compress a POVM through the normalized diagonal-block average.  The
nonemptiness assumption says precisely that the normalized finite average is
defined over at least one ancillary basis element. -/
noncomputable def correlatedAncillaCompressMeasurement
    {alpha iota block : Type*}
    [Fintype alpha] [Fintype iota] [DecidableEq iota]
    [Fintype block] [DecidableEq block] [Nonempty block]
    (M : _root_.LIDT.MIPStarRE.Quantum.Measurement alpha (iota × block)) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement alpha iota :=
  _root_.LIDT.MIPStarRE.Quantum.Measurement.ofSumEqOne
    (fun a => _root_.MIPStarRE.QPBT.averageDiagonalBlock (M.effect a))
    (fun a => by
      unfold _root_.MIPStarRE.QPBT.averageDiagonalBlock
      apply smul_nonneg
      · positivity
      · exact Finset.sum_nonneg fun r _ =>
          Matrix.nonneg_iff_posSemidef.mpr
            ((Matrix.nonneg_iff_posSemidef.mp (M.pos a)).submatrix
              (fun i => (i, r))))
    (by
      classical
      ext i j
      simp only [_root_.MIPStarRE.QPBT.averageDiagonalBlock, Matrix.sum_apply, Matrix.smul_apply,
        Matrix.submatrix_apply]
      calc
        ∑ a, (Fintype.card block : ℝ)⁻¹ •
              ∑ r, M.effect a (i, r) (j, r) =
            (Fintype.card block : ℝ)⁻¹ •
              ∑ a, ∑ r, M.effect a (i, r) (j, r) := by
                rw [Finset.smul_sum]
        _ = (Fintype.card block : ℝ)⁻¹ •
              ∑ r, ∑ a, M.effect a (i, r) (j, r) := by
                rw [Finset.sum_comm]
        _ = (Fintype.card block : ℝ)⁻¹ •
              ∑ r, (1 : _root_.LIDT.MIPStarRE.Quantum.Op (iota × block)) (i, r) (j, r) := by
                congr 1
                apply Finset.sum_congr rfl
                intro r _
                simpa only [Matrix.sum_apply] using
                  congrFun (congrFun M.sum_eq_one (i, r)) (j, r)
        _ = (1 : _root_.LIDT.MIPStarRE.Quantum.Op iota) i j := by
              simp [Matrix.one_apply, Fintype.card_ne_zero])

@[simp] theorem correlatedAncillaCompressMeasurement_effect
    {alpha iota block : Type*}
    [Fintype alpha] [Fintype iota] [DecidableEq iota]
    [Fintype block] [DecidableEq block] [Nonempty block]
    (M : _root_.LIDT.MIPStarRE.Quantum.Measurement alpha (iota × block)) (a : alpha) :
    (_root_.MIPStarRE.QPBT.correlatedAncillaCompressMeasurement M).effect a =
      _root_.MIPStarRE.QPBT.averageDiagonalBlock (M.effect a) :=
  rfl





/-- Specialize ancillary compression to the nonempty residue fiber supplied by
the divisibility data of `LdParams`. -/
noncomputable def seedFiberCompressMeasurement
    (L : _root_.MIPStarRE.QPBT.LdParams) {alpha iota : Type*}
    [Fintype alpha] [Fintype iota] [DecidableEq iota]
    (M : _root_.LIDT.MIPStarRE.Quantum.Measurement alpha
      (iota × Fin (L.q / L.m))) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement alpha iota := by
  letI : Nonempty (Fin (L.q / L.m)) :=
    Fin.pos_iff_nonempty.mp L.seedFiberCard_pos
  exact _root_.MIPStarRE.QPBT.correlatedAncillaCompressMeasurement M

@[simp] theorem seedFiberCompressMeasurement_effect
    (L : _root_.MIPStarRE.QPBT.LdParams) {alpha iota : Type*}
    [Fintype alpha] [Fintype iota] [DecidableEq iota]
    (M : _root_.LIDT.MIPStarRE.Quantum.Measurement alpha
      (iota × Fin (L.q / L.m))) (a : alpha) :
    (_root_.MIPStarRE.QPBT.seedFiberCompressMeasurement L M).effect a =
      _root_.MIPStarRE.QPBT.averageDiagonalBlock (M.effect a) :=
  rfl



/-- Compress a direct polynomial-tuple POVM from the correlated seed-residue
carrier to the corresponding seed-indexed polynomial POVM. -/
noncomputable def seedFiberCompressPolyMeasTuple
    (L : _root_.MIPStarRE.QPBT.LdParams) {iota : Type*} [Fintype iota] [DecidableEq iota]
    (G : _root_.MIPStarRE.QPBT.DirectPolyMeasTuple L.toDirectLdParams
      (iota × Fin (L.q / L.m))) : _root_.MIPStarRE.QPBT.PolyMeasTuple L iota := by
  exact _root_.MIPStarRE.QPBT.seedFiberCompressMeasurement L G

@[simp] theorem seedFiberCompressPolyMeasTuple_effect
    (L : _root_.MIPStarRE.QPBT.LdParams) {iota : Type*} [Fintype iota] [DecidableEq iota]
    (G : _root_.MIPStarRE.QPBT.DirectPolyMeasTuple L.toDirectLdParams
      (iota × Fin (L.q / L.m))) (g : _root_.MIPStarRE.QPBT.PolyTuple L) :
    (_root_.MIPStarRE.QPBT.seedFiberCompressPolyMeasTuple L G).effect g =
      _root_.MIPStarRE.QPBT.averageDiagonalBlock (G.effect g) :=
  rfl









end

end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Combining/DirectLowDegree/Transport/Consistency/Measurements.lean#L34-L402

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