Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Observables / WinImplications / Setup

Definition
QPBT_QPBT_Observables_WinImplications_Setup

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

qpbt

This bundle supplies the finite types and encodings needed for Pauli win implications. It provides option-completed point measurements and coordinate codes for canonical line descriptions.

Principal definitions:

  • MIPStarRE.QPBT.pauliQuestionPairFintype: the finite type structure on Pauli question pairs.
  • MIPStarRE.QPBT.pauliQuestionPairDecidableEq: decidable equality for Pauli question pairs.
  • MIPStarRE.QPBT.LineDescCode: the coordinate type for canonical line descriptions.
  • MIPStarRE.QPBT.lineDescCode: maps a canonical line to its kind and coordinate data.
  • MIPStarRE.QPBT.lineDescFintype: the finite type structure on canonical lines.
  • MIPStarRE.QPBT.linePointFintype: the finite type structure on line and point pairs.
  • MIPStarRE.QPBT.ProjectiveSetting.pointMeasOption: completes a point measurement with a none outcome.

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/Observables/WinImplications/Setup.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_Measurement
import Definitions.Def_QPBT_QPBT_Algebra_FieldBasis
import Definitions.Def_QPBT_QPBT_Algebra_Lines
import Definitions.Def_QPBT_QPBT_Algebra_LowDegreeCode
import Definitions.Def_QPBT_QPBT_Algebra_Pauli
import Definitions.Def_QPBT_QPBT_Games_Defs
import Definitions.Def_QPBT_QPBT_Observables_Anticommuting
import Definitions.Def_QPBT_QPBT_Observables_Defs
import Definitions.Def_QPBT_QPBT_Observables_LineDefs
import Definitions.Def_QPBT_QPBT_State
import Definitions.Def_QPBT_QPBT_Test_LowDegreeGame
import Definitions.Def_QPBT_QPBT_Test_MagicSquare
import Definitions.Def_QPBT_QPBT_Test_PauliBasisTest
import Mathlib

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.ProjectiveSetting
end MIPStarRE.QPBT.ProjectiveSetting

/-!
# Definitions for winning implications

This module defines the measurements, marginals, and induced Magic Square
strategy used by the exact and approximate winning implications.

## References

The definitions support `lem:qld-win-implications` and
`lem:qld-win-implications-obs` in
`references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:192-354` and
blueprint `lem:qld-win-implications` and `lem:qld-win-implications-obs`.
-/

@[expose] public section

open scoped BigOperators Matrix ComplexOrder

namespace MIPStarRE.QPBT

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

noncomputable section



/-- Reindex a heterogeneous strategy state after interchanging its two tensor
factors. This is the state used by the factor-interchanged conclusions at
paper `14_analysis_of_the_pauli_basis_test.tex:227-228`. -/
noncomputable def ProjectiveSetting.swappedState
    {P : _root_.MIPStarRE.QPBT.AdmissibleParams} {ε : ℝ} (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε) :
    EuclideanSpace ℂ (S.toStrategy.ιB × S.toStrategy.ιA) :=
  _root_.MIPStarRE.QPBT.reindexState (Equiv.prodComm S.toStrategy.ιA S.toStrategy.ιB)
    S.toStrategy.ψ

/-- The space of Pauli question pairs is finite because the underlying field
model is finite. Paper `14_analysis_of_the_pauli_basis_test.tex:197-199`;
blueprint `lem:qld-win-implications`. -/
noncomputable instance pauliQuestionPairFintype (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
    Fintype (_root_.MIPStarRE.QPBT.PauliQuestion P × _root_.MIPStarRE.QPBT.PauliQuestion P) :=
  Fintype.ofFinite _

/-- Equality of Pauli question pairs is decidable. This is used in the
consistency defect from item 1 of blueprint
`lem:qld-win-implications`. -/
noncomputable instance pauliQuestionPairDecidableEq (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
    DecidableEq (_root_.MIPStarRE.QPBT.PauliQuestion P × _root_.MIPStarRE.QPBT.PauliQuestion P) :=
  Classical.decEq _

/-- The coordinate space records the base and seed of an axis line, or the
base, seed, and direction of a diagonal line. It is finite and indexes the
line-point average in blueprint
`lem:qld-win-implications`. -/
abbrev LineDescCode (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :=
  ((Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P) × _root_.MIPStarRE.QPBT.PauliScalar P) ⊕
    ((Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P) × _root_.MIPStarRE.QPBT.PauliScalar P ×
      (Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P))

/-- Map a canonical line to its kind and coordinate data: base and seed for an
axis line, and base, seed, and direction for a diagonal line. Blueprint
`lem:qld-win-implications`. -/
def lineDescCode (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
    _root_.MIPStarRE.QPBT.LineDesc P.toLdParams → _root_.MIPStarRE.QPBT.LineDescCode P
  | .axis base seed _ => .inl (base, seed)
  | .diagonal base seed direction _ _ => .inr (base, seed, direction)

/-- The coordinate-data map on canonical lines is injective: lines of the same
kind with equal base, seed, and direction data are equal. This supports the
line-point average in blueprint
`lem:qld-win-implications`. -/
private theorem lineDescCode_injective (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
    Function.Injective (_root_.MIPStarRE.QPBT.lineDescCode P) := by
  intro x y h
  cases x with
  | axis base seed baseFixed =>
      cases y with
      | axis base' seed' baseFixed' =>
          simp only [_root_.MIPStarRE.QPBT.lineDescCode, Sum.inl.injEq, Prod.mk.injEq] at h
          rcases h with ⟨rfl, rfl⟩
          rfl
      | diagonal => simp [_root_.MIPStarRE.QPBT.lineDescCode] at h
  | diagonal base seed direction baseFixed prefixZero =>
      cases y with
      | axis => simp [_root_.MIPStarRE.QPBT.lineDescCode] at h
      | diagonal base' seed' direction' baseFixed' prefixZero' =>
          simp only [_root_.MIPStarRE.QPBT.lineDescCode, Sum.inr.injEq, Prod.mk.injEq] at h
          rcases h with ⟨rfl, rfl, rfl⟩
          rfl

/-- The set of canonical axis and diagonal lines is finite. This finiteness is
used in the line-point average from item 2 of blueprint
`lem:qld-win-implications`. -/
noncomputable instance lineDescFintype (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
    Fintype (_root_.MIPStarRE.QPBT.LineDesc P.toLdParams) :=
  Fintype.ofInjective (_root_.MIPStarRE.QPBT.lineDescCode P) (by
    exact lineDescCode_injective P)

/-- The set of pairs consisting of a canonical line and a point is finite.
These pairs index the line-point distribution in the low-degree winning
implication. Paper
`14_analysis_of_the_pauli_basis_test.tex:200-204`, blueprint
`lem:qld-win-implications`. -/
noncomputable instance linePointFintype (P : _root_.MIPStarRE.QPBT.AdmissibleParams) :
    Fintype (_root_.MIPStarRE.QPBT.LineDesc P.toLdParams × (Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P)) :=
  Fintype.ofFinite _

namespace ProjectiveSetting

variable {P : _root_.MIPStarRE.QPBT.AdmissibleParams} {ε : ℝ}

/-- Complete a point measurement with a zero `none` outcome. This is the
right-hand family in the corrected low-degree item of
blueprint
`lem:qld-win-implications`, paper
`14_analysis_of_the_pauli_basis_test.tex:197-204`. -/
noncomputable def pointMeasOption (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε)
    (side : _root_.MIPStarRE.QPBT.PlayerSide) (W : _root_.MIPStarRE.QPBT.PauliKind) (u : Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement (Option (_root_.MIPStarRE.QPBT.PauliScalar P)) (S.LocalSpace side) :=
  (S.pointMeas side W u).postprocess some

/-- Trace-coarse-graining of a strategy point measurement. This is the family
`M^((Point,W),u)_[tr(·r)=a]` in items 5 and 7 of
`lem:qld-win-implications`, paper
`14_analysis_of_the_pauli_basis_test.tex:232-263`, blueprint
`lem:qld-win-implications`. -/
noncomputable def pointTraceMeas (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε)
    (side : _root_.MIPStarRE.QPBT.PlayerSide) (W : _root_.MIPStarRE.QPBT.PauliKind) (u : Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P)
    (r : _root_.MIPStarRE.QPBT.PauliScalar P) : _root_.LIDT.MIPStarRE.Quantum.Measurement (ZMod 2) (S.LocalSpace side) :=
  (S.pointMeas side W u).postprocess fun a => _root_.MIPStarRE.QPBT.fixedBinTrace P.model (a * r)

/-- Evaluate a Pauli-register answer through its low-degree encoding at `u`.
This is `M^(Pauli,W)_[g_h(u)=a]` in item 3 of
`lem:qld-win-implications`, paper
`14_analysis_of_the_pauli_basis_test.tex:205-209`, blueprint
`lem:qld-win-implications`. -/
noncomputable def pauliEvalMeas (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε)
    (side : _root_.MIPStarRE.QPBT.PlayerSide) (W : _root_.MIPStarRE.QPBT.PauliKind) (u : Fin P.m → _root_.MIPStarRE.QPBT.PauliScalar P) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement (_root_.MIPStarRE.QPBT.PauliScalar P) (S.LocalSpace side) :=
  (S.pauliMeas side W).postprocess fun h => _root_.MIPStarRE.QPBT.lowDegreeEnc h u

/-- Select the `W` bit of a Pair answer. This is the bracketed Pair family in
item 4 of `lem:qld-win-implications`, paper
`14_analysis_of_the_pauli_basis_test.tex:210-231`, blueprint
`lem:qld-win-implications`. -/
noncomputable def pairComponentMeas (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε)
    (side : _root_.MIPStarRE.QPBT.PlayerSide) (W : _root_.MIPStarRE.QPBT.PauliKind) (ω : _root_.MIPStarRE.QPBT.PauliTuple P) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement (ZMod 2) (S.LocalSpace side) :=
  (S.pairMeas side ω.1 ω.2.1 ω.2.2.1 ω.2.2.2).postprocess fun bits =>
    match W with
    | .X => bits.1
    | .Z => bits.2

/-- The bit measurement for a Magic Square variable question. This is
`M^(Variable_j,omega)_a` in item 7 of `lem:qld-win-implications`, paper
`14_analysis_of_the_pauli_basis_test.tex:250-263`, blueprint
`lem:qld-win-implications`. -/
noncomputable def msVarBitMeas (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε)
    (side : _root_.MIPStarRE.QPBT.PlayerSide) (j : Fin 9) (ω : _root_.MIPStarRE.QPBT.PauliTuple P) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement (ZMod 2) (S.LocalSpace side) :=
  (S.msMeas side (.var j) ω.1 ω.2.1 ω.2.2.1 ω.2.2.2).postprocess _root_.MIPStarRE.QPBT.msBitOrZero

/-- The Magic Square strategy induced by the test measurements at a fixed
Pauli tuple. It retains the original heterogeneous local spaces and state, as
required by item 6 of `lem:qld-win-implications`, paper
`14_analysis_of_the_pauli_basis_test.tex:240-249`, blueprint
`lem:qld-win-implications`. -/
noncomputable def msStrategyAt (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε)
    (ω : _root_.MIPStarRE.QPBT.PauliTuple P) : _root_.MIPStarRE.QPBT.Strategy _root_.MIPStarRE.QPBT.msGame where
  ιA := S.toStrategy.ιA
  ιB := S.toStrategy.ιB
  ψ := S.toStrategy.ψ
  ψ_norm := S.toStrategy.ψ_norm
  A t := S.msMeas .alice t ω.1 ω.2.1 ω.2.2.1 ω.2.2.2
  B t := S.msMeas .bob t ω.1 ω.2.1 ω.2.2.1 ω.2.2.2

/-- The Magic Square value `Lambda_omega` is the ordinary tensor-product game
value of `msStrategyAt`. This is item 6 of `lem:qld-win-implications`, paper
`14_analysis_of_the_pauli_basis_test.tex:240-249`, blueprint
`lem:qld-win-implications`. -/
noncomputable def msValueAt (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε) (ω : _root_.MIPStarRE.QPBT.PauliTuple P) : ℝ :=
  (S.msStrategyAt ω).value

end ProjectiveSetting

end

end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Observables/WinImplications/Setup.lean#L40-L194

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