Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

QPBT definitions: State

Definition
QPBT_QPBT_State

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

qpbt

This bundle defines the state geometry and local isometry operations used in the rigidity comparison. It transports coordinates and operators through the two local isometries, shuffles tensor factors, and records norm preservation for coordinate reindexing and tensor products.

Principal definitions:

  • MIPStarRE.QPBT.conjIsometry: defines conjugation by the local isometries used in the rigidity comparison.
  • MIPStarRE.QPBT.reindexState: defines coordinate transport for the strategy-distance construction.
  • MIPStarRE.QPBT.isometryTensor: applies the two independent local isometries.
  • MIPStarRE.QPBT.vecTensor: defines the coordinate tensor used in the ideal state.
  • MIPStarRE.QPBT.reindexOp: defines operator transport for the strategy-distance construction.
  • MIPStarRE.QPBT.prodShuffle: defines the four-factor tensor shuffle used by the rigidity comparison.
  • MIPStarRE.QPBT.reindexState_norm_eq: states that reindexing Euclidean coordinates along an equivalence preserves norm.
  • MIPStarRE.QPBT.vecTensor_norm_eq: states that the coordinate tensor of two Euclidean vectors has the product norm.

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/State.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

namespace LIDT.MIPStarRE.Quantum
end LIDT.MIPStarRE.Quantum
namespace MIPStarRE.QPBT
end MIPStarRE.QPBT

/-!
# Finite-dimensional state transformations

This file defines the tensor and reindexing operations used for strategy
distance, Magic Square rigidity, and the qudit-to-qubit isomorphism. See
blueprint chapters 11--13 and the declaration-level references below.
-/

@[expose] public section

open scoped Matrix

namespace MIPStarRE.QPBT

open LIDT.MIPStarRE.Quantum

/-- Conjugation by the local isometries in `thm:ms-rigidity` and
`lem:pauli-binary`; blueprint `thm:ms-rigidity` and
`lem:pauli-binary`, paper
`08_classical_and_quantum_low_degree_tests.tex:620-652` and
`04_preliminaries.tex:1163-1208`. -/
noncomputable def conjIsometry {ι ι' : Type*}
    [Fintype ι] [DecidableEq ι] [Fintype ι'] [DecidableEq ι']
    (φ : EuclideanSpace ℂ ι →ₗᵢ[ℂ] EuclideanSpace ℂ ι')
    (M : _root_.LIDT.MIPStarRE.Quantum.Op ι) : _root_.LIDT.MIPStarRE.Quantum.Op ι' :=
  let U : Matrix ι' ι ℂ := Matrix.toEuclideanLin.symm φ.toLinearMap
  U * M * Uᴴ

/-- Coordinate transport used by blueprint
`def:strategy-distance`, paper `06_nonlocal_games_and_mipstar.tex:273-285`. -/
noncomputable def reindexState {ι ι' : Type*} [Fintype ι] [DecidableEq ι]
    [Fintype ι'] [DecidableEq ι'] (e : ι ≃ ι')
    (ψ : EuclideanSpace ℂ ι) : EuclideanSpace ℂ ι' :=
  (EuclideanSpace.equiv ι' ℂ).symm
    (fun j => (EuclideanSpace.equiv ι ℂ ψ) (e.symm j))

/-- Apply the two independent local isometries of blueprint
`thm:ms-rigidity`, paper
`08_classical_and_quantum_low_degree_tests.tex:620-652`. -/
noncomputable def isometryTensor
    {ιA ιB κA κB : Type*}
    [Fintype ιA] [DecidableEq ιA] [Fintype ιB] [DecidableEq ιB]
    [Fintype κA] [DecidableEq κA] [Fintype κB] [DecidableEq κB]
    (φA : EuclideanSpace ℂ ιA →ₗᵢ[ℂ] EuclideanSpace ℂ κA)
    (φB : EuclideanSpace ℂ ιB →ₗᵢ[ℂ] EuclideanSpace ℂ κB)
    (ψ : EuclideanSpace ℂ (ιA × ιB)) :
    EuclideanSpace ℂ (κA × κB) :=
  (EuclideanSpace.equiv (κA × κB) ℂ).symm
    (fun p =>
      ∑ i : ιA, ∑ j : ιB,
        ((EuclideanSpace.equiv κA ℂ)
            (φA ((EuclideanSpace.equiv ιA ℂ).symm (Pi.single i 1))) p.1) *
          ((EuclideanSpace.equiv κB ℂ)
            (φB ((EuclideanSpace.equiv ιB ℂ).symm (Pi.single j 1))) p.2) *
          ((EuclideanSpace.equiv (ιA × ιB) ℂ) ψ (i, j)))

/-- Coordinate tensor used in the ideal state of blueprint
`thm:ms-rigidity`, paper
`08_classical_and_quantum_low_degree_tests.tex:620-652`. -/
noncomputable def vecTensor {ι κ : Type*}
    [Fintype ι] [DecidableEq ι] [Fintype κ] [DecidableEq κ]
    (u : EuclideanSpace ℂ ι) (v : EuclideanSpace ℂ κ) :
    EuclideanSpace ℂ (ι × κ) :=
  (EuclideanSpace.equiv (ι × κ) ℂ).symm
    (fun p => (EuclideanSpace.equiv ι ℂ u) p.1 * (EuclideanSpace.equiv κ ℂ v) p.2)

/-- Operator transport used by blueprint
`def:strategy-distance`, paper `06_nonlocal_games_and_mipstar.tex:273-285`. -/
def reindexOp {ι ι' : Type*} (e : ι ≃ ι') (M : _root_.LIDT.MIPStarRE.Quantum.Op ι') : _root_.LIDT.MIPStarRE.Quantum.Op ι :=
  (Matrix.reindex e.symm e.symm) M

/-- Four-factor tensor shuffle used by blueprint
`thm:ms-rigidity`, paper
`08_classical_and_quantum_low_degree_tests.tex:620-652`. -/
def prodShuffle {α β γ δ : Type*} :
    (α × β) × (γ × δ) ≃ (α × γ) × (β × δ) where
  toFun p := ((p.1.1, p.2.1), (p.1.2, p.2.2))
  invFun p := ((p.1.1, p.2.1), (p.1.2, p.2.2))
  left_inv p := by cases p; rfl
  right_inv p := by cases p; rfl

/-! ## Norm identities for the coordinate operations -/

/-- Reindexing Euclidean coordinates along an equivalence preserves norm.
This is a formalization-only auxiliary identity (no source counterpart). -/
theorem reindexState_norm_eq
    {iota kappa : Type*}
    [Fintype iota] [DecidableEq iota]
    [Fintype kappa] [DecidableEq kappa]
    (e : iota ≃ kappa) (psi : EuclideanSpace ℂ iota) :
    ‖_root_.MIPStarRE.QPBT.reindexState e psi‖ = ‖psi‖ := by
  rw [← sq_eq_sq₀ (norm_nonneg _) (norm_nonneg _)]
  rw [EuclideanSpace.norm_sq_eq, EuclideanSpace.norm_sq_eq]
  change (∑ j : kappa, ‖psi (e.symm j)‖ ^ 2) = ∑ i : iota, ‖psi i‖ ^ 2
  exact e.symm.sum_comp (fun i => ‖psi i‖ ^ 2)

/-- The coordinate tensor of two Euclidean vectors has the product norm.
This is a formalization-only auxiliary identity (no source counterpart). -/
theorem vecTensor_norm_eq
    {iota kappa : Type*}
    [Fintype iota] [DecidableEq iota]
    [Fintype kappa] [DecidableEq kappa]
    (u : EuclideanSpace ℂ iota) (v : EuclideanSpace ℂ kappa) :
    ‖_root_.MIPStarRE.QPBT.vecTensor u v‖ = ‖u‖ * ‖v‖ := by
  rw [← sq_eq_sq₀ (norm_nonneg _) (mul_nonneg (norm_nonneg _) (norm_nonneg _))]
  rw [EuclideanSpace.norm_sq_eq, mul_pow, EuclideanSpace.norm_sq_eq,
    EuclideanSpace.norm_sq_eq]
  change (∑ p : iota × kappa, ‖u p.1 * v p.2‖ ^ 2) =
    (∑ i : iota, ‖u i‖ ^ 2) * ∑ j : kappa, ‖v j‖ ^ 2
  simp only [norm_mul, mul_pow]
  rw [← Finset.univ_product_univ, Finset.sum_product, Finset.sum_mul]
  apply Finset.sum_congr rfl
  intro i _
  rw [Finset.mul_sum]

end MIPStarRE.QPBT
Source
https://github.com/Dengnifer/MIPStarRE-QPBT/blob/8f4118aeea7be16912adbaee3df6dce1741a2c26/QPBT/State.lean#L23-L120

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