Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: Combining / Points / PlacementSupport

Definition
QPBT_QPBT_Combining_Points_PlacementSupport

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

qpbt

This bundle defines placement of local expanded measurements into the six-register Pauli setting. It proves that placements preserve completeness, identifies each register bipartition, preserves positivity under reindexing, and distributes over identities and finite sums.

Principal definitions:

  • MIPStarRE.QPBT.ProjectiveSetting.placedMeasurement: places a complete local measurement on a chosen register pair.
  • MIPStarRE.QPBT.ProjectiveSetting.place_AA'_eq: identifies the AA-prime placement as the left factor.
  • MIPStarRE.QPBT.ProjectiveSetting.place_BA''_eq: identifies the BA-double-prime placement as the right factor.
  • MIPStarRE.QPBT.ProjectiveSetting.place_AB''_eq: identifies the AB-double-prime placement as the left factor in the second grouping.
  • MIPStarRE.QPBT.ProjectiveSetting.place_BB'_eq: identifies the BB-prime placement as the right factor.
  • MIPStarRE.QPBT.ProjectiveSetting.reindexOp_nonneg: preserves positivity under placement reindexing.
  • MIPStarRE.QPBT.ProjectiveSetting.place_one: places the local identity as the global identity.
  • MIPStarRE.QPBT.ProjectiveSetting.place_finsetSum: distributes placement over finite sums.

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/Points/PlacementSupport.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_FiniteMatrix_Order
import Definitions.Def_LIDT_MIPStarRE_Quantum_Measurement
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_Observables_ExpandedPlacement
import Definitions.Def_QPBT_QPBT_Observables_LineMeasurement_LinePointOverlap
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

/-!
# Placement calculus on the expanded state

This module records the algebra of the four register placements used by the
combining argument: a placement is a unital `*`-homomorphism, placements on
opposite register pairs commute, and the crosswise exchange of the two EPR
pairs of the expanded state carries the placement `AA'` to `AB''` and `BA''`
to `BB'` while fixing the expanded state.  The last fact transfers every
state-dependent distance between the two bipartition schemes of
`def:symmetric-equivalents` without assuming a symmetric strategy.

## References

The placements are those of `def:symmetric-equivalents`, blueprint
`blueprint/src/chapter/ch14_qpbt_observables.tex`, paper
`references/qpbt-paper/14_analysis_of_the_pauli_basis_test.tex:420-450`.  The
placement module proves EPR-exchange invariance for the involution
`(A' B'')(A'' B')`, which fixes `A` and `B`, in
`ProjectiveSetting.reindexState_eprCrossSwap_psiHat`; its use for
`lem:qld-4-10` is analyzed in
`docs/paper-gaps/qpbt_linearity-theorem-quotation.tex`.
-/

@[expose] public section

open scoped BigOperators Matrix MatrixOrder ComplexOrder

namespace MIPStarRE.QPBT

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

noncomputable section

namespace ProjectiveSetting

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

/-! ## Placements as reindexed tensor factors -/

/-- The `AA'` placement is the reindexed left factor of the
`AA' | BA''(B'B'')` bipartition. -/
theorem place_AA'_eq (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε)
    (O : _root_.LIDT.MIPStarRE.Quantum.Op (S.ExpandedLocalSpace _root_.MIPStarRE.QPBT.Placement.AA'.side)) :
    S.place .AA' O =
      _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)))) :=
  (_root_.MIPStarRE.QPBT.ProjectiveSetting.reindexOp_aaBaBipartition_left S O).symm

/-- The `BA''` placement is the reindexed right factor of the
`AA' | BA''(B'B'')` bipartition. -/
theorem place_BA''_eq (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε)
    (O : _root_.LIDT.MIPStarRE.Quantum.Op (S.ExpandedLocalSpace _root_.MIPStarRE.QPBT.Placement.BA''.side)) :
    S.place .BA'' O =
      _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)))) :=
  (_root_.MIPStarRE.QPBT.ProjectiveSetting.reindexOp_aaBaBipartition_right S O).symm

/-- The `AB''` placement is the reindexed left factor of the
`AB'' | BB'(A'A'')` bipartition. -/
theorem place_AB''_eq (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε)
    (O : _root_.LIDT.MIPStarRE.Quantum.Op (S.ExpandedLocalSpace _root_.MIPStarRE.QPBT.Placement.AB''.side)) :
    S.place .AB'' O =
      _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)))) :=
  (_root_.MIPStarRE.QPBT.ProjectiveSetting.reindexOp_abBbBipartition_left S O).symm

/-- The `BB'` placement is the reindexed right factor of the
`AB'' | BB'(A'A'')` bipartition. -/
theorem place_BB'_eq (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε)
    (O : _root_.LIDT.MIPStarRE.Quantum.Op (S.ExpandedLocalSpace _root_.MIPStarRE.QPBT.Placement.BB'.side)) :
    S.place .BB' O =
      _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)))) :=
  (_root_.MIPStarRE.QPBT.ProjectiveSetting.reindexOp_abBbBipartition_right S O).symm



/-- Reindexing an operator along an equivalence preserves positivity. -/
theorem reindexOp_nonneg {ι κ : Type*} [Finite ι] [Finite κ]
    (e : ι ≃ κ) {M : _root_.LIDT.MIPStarRE.Quantum.Op κ} (hM : 0 ≤ M) :
    0 ≤ _root_.MIPStarRE.QPBT.reindexOp e M := by
  letI := Fintype.ofFinite ι
  letI := Fintype.ofFinite κ
  rw [Matrix.nonneg_iff_posSemidef] at hM ⊢
  exact hM.submatrix e.symm.symm

/-! ## The placement is a unital `*`-homomorphism -/



/-- A placement sends the local identity to the identity of the six-register
space. -/
theorem place_one (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε) (p : _root_.MIPStarRE.QPBT.Placement) :
    S.place p (1 : _root_.LIDT.MIPStarRE.Quantum.Op (S.ExpandedLocalSpace p.side)) = 1 := by
  ext i j
  cases p <;>
    · simp only [_root_.MIPStarRE.QPBT.ProjectiveSetting.place, Matrix.one_apply, Prod.ext_iff]
      split_ifs <;> simp_all

/-- A placement is additive over finite sums of local operators.
Compatibility name for `place_finset_sum`, retained for the combining-point
proofs that use this spelling. -/
theorem place_finsetSum (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε) (p : _root_.MIPStarRE.QPBT.Placement) {γ : Type*}
    (s : Finset γ) (O : γ → _root_.LIDT.MIPStarRE.Quantum.Op (S.ExpandedLocalSpace p.side)) :
    S.place p (∑ x ∈ s, O x) = ∑ x ∈ s, S.place p (O x) :=
  S.place_finset_sum p s O



set_option synthInstance.maxSize 400 in
/-- A placement preserves positivity. -/
theorem place_nonneg (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε) :
    ∀ (p : _root_.MIPStarRE.QPBT.Placement) {A : _root_.LIDT.MIPStarRE.Quantum.Op (S.ExpandedLocalSpace p.side)}, 0 ≤ A →
      0 ≤ S.place p A
  | .AA', A, hA => by
      classical
      rw [_root_.MIPStarRE.QPBT.ProjectiveSetting.place_AA'_eq]
      exact _root_.MIPStarRE.QPBT.ProjectiveSetting.reindexOp_nonneg _ (_root_.LIDT.MIPStarRE.Quantum.kronecker_nonneg hA
        (Matrix.PosSemidef.one.nonneg))
  | .BA'', A, hA => by
      classical
      rw [_root_.MIPStarRE.QPBT.ProjectiveSetting.place_BA''_eq]
      exact _root_.MIPStarRE.QPBT.ProjectiveSetting.reindexOp_nonneg _ (_root_.LIDT.MIPStarRE.Quantum.kronecker_nonneg
        (Matrix.PosSemidef.one.nonneg)
        (_root_.LIDT.MIPStarRE.Quantum.kronecker_nonneg hA (Matrix.PosSemidef.one.nonneg)))
  | .BB', A, hA => by
      classical
      rw [_root_.MIPStarRE.QPBT.ProjectiveSetting.place_BB'_eq]
      exact _root_.MIPStarRE.QPBT.ProjectiveSetting.reindexOp_nonneg _ (_root_.LIDT.MIPStarRE.Quantum.kronecker_nonneg
        (Matrix.PosSemidef.one.nonneg)
        (_root_.LIDT.MIPStarRE.Quantum.kronecker_nonneg hA (Matrix.PosSemidef.one.nonneg)))
  | .AB'', A, hA => by
      classical
      rw [_root_.MIPStarRE.QPBT.ProjectiveSetting.place_AB''_eq]
      exact _root_.MIPStarRE.QPBT.ProjectiveSetting.reindexOp_nonneg _ (_root_.LIDT.MIPStarRE.Quantum.kronecker_nonneg hA
        (Matrix.PosSemidef.one.nonneg))







/-- A complete measurement on a local expanded space, placed on one of the
four register pairs, is a complete measurement on the six-register space. -/
def placedMeasurement (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε) (p : _root_.MIPStarRE.QPBT.Placement) {α : Type*}
    [Fintype α] (M : _root_.LIDT.MIPStarRE.Quantum.Measurement α (S.ExpandedLocalSpace p.side)) :
    _root_.LIDT.MIPStarRE.Quantum.Measurement α (_root_.MIPStarRE.QPBT.SixReg P S.toStrategy.ιA S.toStrategy.ιB) :=
  _root_.LIDT.MIPStarRE.Quantum.Measurement.ofSumEqOne (fun a => S.place p (M.effect a))
    (fun a => S.place_nonneg p (M.pos a))
    (by rw [← _root_.MIPStarRE.QPBT.ProjectiveSetting.place_finsetSum, M.sum_eq_one, _root_.MIPStarRE.QPBT.ProjectiveSetting.place_one])

/-- The effects of a placed measurement are the placed effects. -/
@[simp] theorem placedMeasurement_effect (S : _root_.MIPStarRE.QPBT.ProjectiveSetting P ε)
    (p : _root_.MIPStarRE.QPBT.Placement) {α : Type*} [Fintype α]
    (M : _root_.LIDT.MIPStarRE.Quantum.Measurement α (S.ExpandedLocalSpace p.side)) (a : α) :
    (S.placedMeasurement p M).effect a = S.place p (M.effect a) := rfl



end ProjectiveSetting

end

end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/Combining/Points/PlacementSupport.lean#L45-L272

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