Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Games / MeasurementCompression

Definition
QPBT_QPBT_Games_MeasurementCompression

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

qpbt

This bundle defines compression of measurements to a fixed ancillary matrix block. It restricts every effect to the corresponding principal submatrix and records the effect-level formula for that compression.

Principal definitions:

  • MIPStarRE.Quantum.Measurement.compressAt: compresses a POVM at one ancillary coordinate.
  • MIPStarRE.Quantum.Measurement.compressAt_effect: identifies the compressed effect as a principal submatrix.

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/Games/MeasurementCompression.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_LIDT_MIPStarRE_Quantum_FiniteMatrix_Basic
import Definitions.Def_LIDT_MIPStarRE_Quantum_Measurement

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

/-!
# Ground-slice compression of measurements

This module restricts a POVM on a product space to one distinguished ancillary
coordinate. It also records that this restriction commutes with deterministic
outcome postprocessing, recovers a POVM from its one-measurement Naimark
dilation, and preserves consistency defects evaluated on the correspondingly
padded bipartite state.

The construction supports the pullback after the first paragraph of the proof
of paper `lem:qld-4-7`,
`references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:1279-1289`.
-/

@[expose] public section

open scoped BigOperators Matrix MatrixOrder ComplexOrder

namespace LIDT
namespace MIPStarRE.Quantum.Measurement

/-- Restrict every effect of a POVM to the matrix block at one fixed ancillary
coordinate. The principal submatrix of a positive semidefinite effect remains
positive semidefinite, and restricting the sum of the effects restricts the
identity to the identity. -/
noncomputable def compressAt
    {Outcome I κ : Type*}
    [Fintype Outcome] [Fintype I] [DecidableEq I]
    [Fintype κ] [DecidableEq κ]
    (k₀ : κ) (M : _root_.LIDT.MIPStarRE.Quantum.Measurement Outcome (I × κ)) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement Outcome I :=
  _root_.LIDT.MIPStarRE.Quantum.Measurement.ofSumEqOne
    (fun a => (M.effect a).submatrix (fun i => (i, k₀)) (fun i => (i, k₀)))
    (fun a => Matrix.nonneg_iff_posSemidef.mpr
      ((Matrix.nonneg_iff_posSemidef.mp (M.pos a)).submatrix (fun i => (i, k₀))))
    (by
      classical
      ext i j
      simpa only [Matrix.sum_apply, Matrix.submatrix_apply, Matrix.one_apply,
        Prod.mk.injEq, and_true]
        using congrFun (congrFun M.sum_eq_one (i, k₀)) (j, k₀))

@[simp] theorem compressAt_effect
    {Outcome I κ : Type*}
    [Fintype Outcome] [Fintype I] [DecidableEq I]
    [Fintype κ] [DecidableEq κ]
    (k₀ : κ) (M : _root_.LIDT.MIPStarRE.Quantum.Measurement Outcome (I × κ)) (a : Outcome) :
    (M.compressAt k₀).effect a =
      (M.effect a).submatrix (fun i => (i, k₀)) (fun i => (i, k₀)) :=
  rfl



end MIPStarRE.Quantum.Measurement
end LIDT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Games/MeasurementCompression.lean#L25-L53

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