Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Observables / ExpandedPlacement

Definition
QPBT_QPBT_Observables_ExpandedPlacement

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

qpbt

This bundle defines register placements and the two bipartitions used for expanded Pauli observables. It proves that placed local operators become ordinary left or right tensor factors, with identity on unused EPR registers.

Principal definitions:

  • MIPStarRE.QPBT.ProjectiveSetting.placeStrategySide: places a strategy-local operator on its supplying player side.
  • MIPStarRE.QPBT.ProjectiveSetting.aaBaBipartition: the AA-prime versus BA-double-prime grouping.
  • MIPStarRE.QPBT.ProjectiveSetting.abBbBipartition: the AB-double-prime versus BB-prime grouping.
  • MIPStarRE.QPBT.ProjectiveSetting.reindexOp_aaBaBipartition_left: the AA-prime left-placement identity.
  • MIPStarRE.QPBT.ProjectiveSetting.reindexOp_aaBaBipartition_right: the BA-double-prime right-placement identity.
  • MIPStarRE.QPBT.ProjectiveSetting.reindexOp_abBbBipartition_left: the AB-double-prime left-placement identity.
  • MIPStarRE.QPBT.ProjectiveSetting.reindexOp_abBbBipartition_right: the BB-prime right-placement identity.

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/ExpandedPlacement.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_QPBT_QPBT_Algebra_FieldBasis
import Definitions.Def_QPBT_QPBT_Algebra_LowDegreeCode
import Definitions.Def_QPBT_QPBT_Games_Defs
import Definitions.Def_QPBT_QPBT_Observables_Defs
import Definitions.Def_QPBT_QPBT_Observables_ExpandedDefs
import Definitions.Def_QPBT_QPBT_State
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

/-!
# Placing operators on the expanded state

The four register placements of `def:symmetric-equivalents` put an operator of
one player's expanded local space on one of the register pairs `AA'`, `BA''`,
`BB'` and `AB''` of the expanded state `psiHat`.  This module records how such
a placement acts on `psiHat`: after the shuffle of `eq:def-psihat` the placed
operator is a threefold tensor product, so a factorized operator whose Pauli
factor is an isometry has the same state-dependent norm as its strategy factor
placed on the original state.  No symmetry between the two players is used;
each of the four placements is treated explicitly.

## References

The declarations support `def:symmetric-equivalents` and `lem:qld-comm-cons`
in `blueprint/src/chapter/ch14_qpbt_observables.tex:1002-1031` and
`blueprint/src/chapter/ch14_qpbt_observables.tex:1139-1178`.  Their paper source
is `references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:420-505`.
-/

@[expose] public section

-- The unshuffled six-register index type of `eq:def-psihat` is a fourfold
-- iterated product; instance search for its `Fintype` and `DecidableEq`
-- structure needs a larger budget than the default.
set_option synthInstance.maxSize 400

open scoped BigOperators Matrix ComplexOrder

namespace MIPStarRE.QPBT

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

noncomputable section

/-! ## Coordinate tensors -/











namespace ProjectiveSetting





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

/-! ## The strategy factor of a placement -/

/-- Place a strategy-local operator on the player side that supplies the local
space of a register placement. Paper
`14_analysis_of_the_pauli_basis_test.tex:420-450`, blueprint
`ch14_qpbt_observables.tex:1002-1031`. -/
noncomputable def placeStrategySide (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε) :
    (side : _root_.MIPStarRE.QPBT.PlayerSide) → _root_.LIDT.MIPStarRE.Quantum.Op (S.LocalSpace side) →
      _root_.LIDT.MIPStarRE.Quantum.Op (S.toStrategy.ιA × S.toStrategy.ιB)
  | .alice, T => _root_.MIPStarRE.QPBT.heteroKron T 1
  | .bob, T => _root_.MIPStarRE.QPBT.heteroKron 1 T



/-! ## The action of a placement on the expanded state -/





/-! ## Opposite-placement bipartitions -/

/-- Regroup `AA'A''BB'B''` as `AA' | BA''(B'B'')`. This is the tensor
bipartition used for data processing on the `AA'`--`BA''` placement pair in
item 1 of `lem:qld-comm-cons`, paper
`references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:455-465`. -/
def aaBaBipartition (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (ιA ιB : Type*) :
    _root_.MIPStarRE.QPBT.SixReg P ιA ιB ≃
      (ιA × _root_.MIPStarRE.QPBT.PauliRegister P) ×
        ((ιB × _root_.MIPStarRE.QPBT.PauliRegister P) × (_root_.MIPStarRE.QPBT.PauliRegister P × _root_.MIPStarRE.QPBT.PauliRegister P)) where
  toFun p := ((p.1.1, p.1.2.1), ((p.2.1, p.1.2.2), (p.2.2.1, p.2.2.2)))
  invFun p := ((p.1.1, (p.1.2, p.2.1.2)),
    (p.2.1.1, (p.2.2.1, p.2.2.2)))
  left_inv p := by cases p; rfl
  right_inv p := by cases p; rfl

/-- Regroup `AA'A''BB'B''` as `AB'' | BB'(A'A'')`. This is the tensor
bipartition used for data processing on the `AB''`--`BB'` placement pair in
item 1 of `lem:qld-comm-cons`, paper
`references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:455-465`. -/
def abBbBipartition (P : _root_.MIPStarRE.QPBT.AdmissibleParams) (ιA ιB : Type*) :
    _root_.MIPStarRE.QPBT.SixReg P ιA ιB ≃
      (ιA × _root_.MIPStarRE.QPBT.PauliRegister P) ×
        ((ιB × _root_.MIPStarRE.QPBT.PauliRegister P) × (_root_.MIPStarRE.QPBT.PauliRegister P × _root_.MIPStarRE.QPBT.PauliRegister P)) where
  toFun p := ((p.1.1, p.2.2.2), ((p.2.1, p.2.2.1), (p.1.2.1, p.1.2.2)))
  invFun p := ((p.1.1, (p.2.2.1, p.2.2.2)),
    (p.2.1.1, (p.2.1.2, p.1.2)))
  left_inv p := by cases p; rfl
  right_inv p := by cases p; rfl

/-- Under the `AA' | BA''(B'B'')` bipartition, an `AA'` placement is the
ordinary left tensor placement. -/
theorem reindexOp_aaBaBipartition_left (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε)
    (O : _root_.LIDT.MIPStarRE.Quantum.Op (S.ExpandedLocalSpace .alice)) :
    _root_.MIPStarRE.QPBT.reindexOp (_root_.MIPStarRE.QPBT.ProjectiveSetting.aaBaBipartition P S.toStrategy.ιA S.toStrategy.ιB)
        (_root_.MIPStarRE.QPBT.heteroKron O
          (1 : _root_.LIDT.MIPStarRE.Quantum.Op ((S.toStrategy.ιB × _root_.MIPStarRE.QPBT.PauliRegister P) ×
            (_root_.MIPStarRE.QPBT.PauliRegister P × _root_.MIPStarRE.QPBT.PauliRegister P)))) =
      S.place .AA' O := by
  ext i j
  simp [_root_.MIPStarRE.QPBT.reindexOp, _root_.MIPStarRE.QPBT.ProjectiveSetting.aaBaBipartition, _root_.MIPStarRE.QPBT.ProjectiveSetting.place, _root_.MIPStarRE.QPBT.heteroKron, Matrix.kronecker,
    Matrix.kroneckerMap_apply, Matrix.one_apply, _root_.MIPStarRE.QPBT.ProjectiveSetting.LocalSpace, Prod.ext_iff]
  split_ifs
  all_goals simp_all
  all_goals rfl

/-- Under the `AA' | BA''(B'B'')` bipartition, a `BA''` placement is the
ordinary right tensor placement, with identity on the unused EPR pair. -/
theorem reindexOp_aaBaBipartition_right (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε)
    (O : _root_.LIDT.MIPStarRE.Quantum.Op (S.ExpandedLocalSpace .bob)) :
    _root_.MIPStarRE.QPBT.reindexOp (_root_.MIPStarRE.QPBT.ProjectiveSetting.aaBaBipartition P S.toStrategy.ιA S.toStrategy.ιB)
        (_root_.MIPStarRE.QPBT.heteroKron (1 : _root_.LIDT.MIPStarRE.Quantum.Op (S.toStrategy.ιA × _root_.MIPStarRE.QPBT.PauliRegister P))
          (_root_.MIPStarRE.QPBT.heteroKron O (1 : _root_.LIDT.MIPStarRE.Quantum.Op (_root_.MIPStarRE.QPBT.PauliRegister P × _root_.MIPStarRE.QPBT.PauliRegister P)))) =
      S.place .BA'' O := by
  ext i j
  simp [_root_.MIPStarRE.QPBT.reindexOp, _root_.MIPStarRE.QPBT.ProjectiveSetting.aaBaBipartition, _root_.MIPStarRE.QPBT.ProjectiveSetting.place, _root_.MIPStarRE.QPBT.heteroKron, Matrix.kronecker,
    Matrix.kroneckerMap_apply, Matrix.one_apply, _root_.MIPStarRE.QPBT.ProjectiveSetting.LocalSpace, Prod.ext_iff]
  split_ifs
  all_goals simp_all
  all_goals rfl

/-- Under the `AB'' | BB'(A'A'')` bipartition, an `AB''` placement is the
ordinary left tensor placement. -/
theorem reindexOp_abBbBipartition_left (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε)
    (O : _root_.LIDT.MIPStarRE.Quantum.Op (S.ExpandedLocalSpace .alice)) :
    _root_.MIPStarRE.QPBT.reindexOp (_root_.MIPStarRE.QPBT.ProjectiveSetting.abBbBipartition P S.toStrategy.ιA S.toStrategy.ιB)
        (_root_.MIPStarRE.QPBT.heteroKron O
          (1 : _root_.LIDT.MIPStarRE.Quantum.Op ((S.toStrategy.ιB × _root_.MIPStarRE.QPBT.PauliRegister P) ×
            (_root_.MIPStarRE.QPBT.PauliRegister P × _root_.MIPStarRE.QPBT.PauliRegister P)))) =
      S.place .AB'' O := by
  ext i j
  simp [_root_.MIPStarRE.QPBT.reindexOp, _root_.MIPStarRE.QPBT.ProjectiveSetting.abBbBipartition, _root_.MIPStarRE.QPBT.ProjectiveSetting.place, _root_.MIPStarRE.QPBT.heteroKron, Matrix.kronecker,
    Matrix.kroneckerMap_apply, Matrix.one_apply, _root_.MIPStarRE.QPBT.ProjectiveSetting.LocalSpace, Prod.ext_iff]
  split_ifs
  all_goals simp_all
  all_goals rfl

/-- Under the `AB'' | BB'(A'A'')` bipartition, a `BB'` placement is the
ordinary right tensor placement, with identity on the unused EPR pair. -/
theorem reindexOp_abBbBipartition_right (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε)
    (O : _root_.LIDT.MIPStarRE.Quantum.Op (S.ExpandedLocalSpace .bob)) :
    _root_.MIPStarRE.QPBT.reindexOp (_root_.MIPStarRE.QPBT.ProjectiveSetting.abBbBipartition P S.toStrategy.ιA S.toStrategy.ιB)
        (_root_.MIPStarRE.QPBT.heteroKron (1 : _root_.LIDT.MIPStarRE.Quantum.Op (S.toStrategy.ιA × _root_.MIPStarRE.QPBT.PauliRegister P))
          (_root_.MIPStarRE.QPBT.heteroKron O (1 : _root_.LIDT.MIPStarRE.Quantum.Op (_root_.MIPStarRE.QPBT.PauliRegister P × _root_.MIPStarRE.QPBT.PauliRegister P)))) =
      S.place .BB' O := by
  ext i j
  simp [_root_.MIPStarRE.QPBT.reindexOp, _root_.MIPStarRE.QPBT.ProjectiveSetting.abBbBipartition, _root_.MIPStarRE.QPBT.ProjectiveSetting.place, _root_.MIPStarRE.QPBT.heteroKron, Matrix.kronecker,
    Matrix.kroneckerMap_apply, Matrix.one_apply, _root_.MIPStarRE.QPBT.ProjectiveSetting.LocalSpace, Prod.ext_iff]
  split_ifs
  all_goals simp_all
  all_goals rfl

/-! ## The four placements -/



























end ProjectiveSetting

end

end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Observables/ExpandedPlacement.lean#L206-L332

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