Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Relabelling the basis of a POVM along a bijection of index sets

Proved
BosonicLearn.fockPOVM_reindex

by Senrui Chen · Nov 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

bosonic-gaussian-statesquantum-informationquantum-learning

A POVM can be transported along a relabelling of the basis.

Let MMM be a POVM on ℓ2(J)\ell^2(J)ℓ2(J) with outcomes in a measurable space Ω\OmegaΩ and let e ⁣:J→J′e\colon J\to J'e:J→J′ be a bijection of index sets. Then there is a POVM M′M'M′ on ℓ2(J′)\ell^2(J')ℓ2(J′) with outcomes in Ω\OmegaΩ such that for every density operator ρ\rhoρ on ℓ2(J)\ell^2(J)ℓ2(J) the outcome law of M′M'M′ on the relabelled operator

ρ′(i,j)=ρ(e−1(i),e−1(j)),i,j∈J′,\rho'(i,j)=\rho\big(e^{-1}(i),e^{-1}(j)\big),\qquad i,j\in J',ρ′(i,j)=ρ(e−1(i),e−1(j)),i,j∈J′,

equals the outcome law of MMM on ρ\rhoρ.

Role. The NNN-copy Fock space has a product basis that can be indexed by NNN-tuples of Fock labels or by nested pairs. This statement passes between the two, as needed when a protocol is built round by round in BosonicLearn.adaptive_scheme_product_povm.

Formalization Note Both POVMs are FockPOVMs, and density operators are IsDensity of Dependency50.P33. The index sets are arbitrary.

Related platform material The space ℓ2(A)\ell^2(A)ℓ2(A) used here (Hilbert A) is the same Lean type as OAI.TensorLp.H A, and ℓ2(Nn)\ell^2(\mathbb N^n)ℓ2(Nn) is the same type as OAI.EntropyPhotonNumber.Fock n. The published definitions OAI_Analysis_TensorLp (tensor products, slices and operator lifts on ℓ2(A×B)\ell^2(A\times B)ℓ2(A×B)) and OAI_MathematicalPhysics_Fock_Operators (OAI.CrossEnsemble.operator, the bounded operator ∑i∣ui⟩⟨vi∣\sum_i|u_i\rangle\langle v_i|∑i​∣ui​⟩⟨vi​∣ of a family, with hasSum_operator and entry_hasSum) are sorry-free and can be imported. Proved lemmas of this mission that can be imported: BosonicLearn.traceDist_le_one (nuclear expansions, truncation to finite index sets) BosonicLearn.effect_matrix_operator (effect matrices as bounded positive operators), BosonicLearn.effect_trace_pairing (Born sums along nuclear expansions), BosonicLearn.fockPOVM_form_measure (effects are weakly σ\sigmaσ-additive) and BosonicLearn.fockPOVM_postprocess.

Preamble
import Mathlib
import Definitions.Def_BosonicLearn_FockPOVM

open QAlgorithms.Papers.Independent.Dependency50.P33 (IsDensity)
open MeasureTheory
open scoped ENNReal Matrix
Formal statement
namespace BosonicLearn

/-- **Relabelling the basis of a POVM.**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, §1.1, p. 4: "A natural basis for H^{(n)} is the Fock basis {|m⟩ ≡ |m_1⟩ ⊗ ⋯ ⊗ |m_n⟩}_{m ∈ ℕⁿ}"; the
`N`-copy space has the product basis, which can be indexed by tuples or by nested pairs.

Let `M` be a POVM on `ℓ²(J)` with outcomes in `Ω` and let `e : J ≃ J'` be a bijection of index sets. There is a
POVM `M'` on `ℓ²(J')` with outcomes in `Ω` such that for every density operator `ρ` on `ℓ²(J)` the outcome law of
`M'` on the relabelled operator `ρ'(i, j) = ρ(e⁻¹ i, e⁻¹ j)` is the outcome law of `M` on `ρ`.

**Formalization Note.** Both are `FockPOVM`s. The statement is used to pass between the index types
`(Fin k → ℕⁿ) × ℕⁿ` and `Fin (k + 1) → ℕⁿ` of `k + 1` copies. -/
theorem fockPOVM_reindex {J J' Ω : Type} [DecidableEq J] [DecidableEq J'] [MeasurableSpace Ω]
    (M : FockPOVM J Ω) (e : J ≃ J') :
    ∃ M' : FockPOVM J' Ω, ∀ ρ : Matrix J J ℂ, IsDensity ρ →
      M'.law (fun i j => ρ (e.symm i) (e.symm j)) = M.law ρ := by sorry

end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, §1.1, p. 4 ("A natural basis for H^{(n)} is the Fock basis {|m⟩ ≡ |m_1⟩ ⊗ ⋯ ⊗ |m_n⟩}"); the N-copy space of Theorem 3, pp. 6–7

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