Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10 — spectral decomposition into perfectly distinguishable pure states

Open
InfoDerivQT.spectral_decomposition

by Lucas · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

operational-probabilistic-theoriesquantum-foundationsquantum-information

Let TTT satisfy the six principles and AAA a system. Every normalized state ρ∈St1(A)\rho\in\mathrm{St}_1(A)ρ∈St1​(A) can be written as

ρ=∑i=1Npi φi,pi≥0,∑ipi=1,\rho=\sum_{i=1}^N p_i\,\varphi_i,\qquad p_i\ge0,\quad \sum_i p_i=1,ρ=i=1∑N​pi​φi​,pi​≥0,i∑​pi​=1,

where φ1,…,φN\varphi_1,\dots,\varphi_Nφ1​,…,φN​ are perfectly distinguishable pure states.

This is the operational counterpart of the spectral theorem for density matrices.

Formalization Note The paper states the result for mixed states; for pure states it holds trivially with N=1N=1N=1, so the formal statement covers all normalized states.

Preamble
import Mathlib
import Definitions.Def_InfoDerivQT_principles
Formal statement
namespace InfoDerivQT
theorem spectral_decomposition (T : OPT) (hT : T.SatisfiesPrinciples) (A : T.Sys)
    (ρ : Vec (T.size A)) (hρ : ρ ∈ T.St1 A) :
    ∃ (N : ℕ) (φ : Fin N → Vec (T.size A)) (p : Fin N → ℝ),
      T.PerfectlyDistinguishable A φ ∧ (∀ i, T.IsPure A (φ i)) ∧
      (∀ i, 0 ≤ p i) ∧ ∑ i, p i = 1 ∧ ρ = ∑ i, p i • φ i := by sorry
end InfoDerivQT
Source
G. Chiribella, G. M. D'Ariano, P. Perinotti, *Informational derivation of quantum theory*, Phys. Rev. A 84, 012311 (2011), https://doi.org/10.1103/PhysRevA.84.012311 (arXiv:1011.6451), p. 012311-17, Sec. VIII, Theorem 10 (Spectral decomposition)
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

NON-BLIND READ-BACK — NOT INDEPENDENT TESTIMONY. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statements, with full knowledge of the source paper and of the intended meaning. It is not a blind audit and must not be mistaken for independent testimony; an independent, blind read-back should replace it before the proposal is relied upon.

Fix TTT satisfying all six principles, a system AAA, and a deterministic state ρ\rhoρ of AAA (the one-element family {ρ}\{\rho\}{ρ} is a preparation test). The conclusion is that there exist a natural number NNN, a family φ0,…,φN−1\varphi_0,\dots,\varphi_{N-1}φ0​,…,φN−1​ in RDA\mathbb R^{D_A}RDA​ and real numbers p0,…,pN−1p_0,\dots,p_{N-1}p0​,…,pN−1​ such that: the family φ\varphiφ is perfectly distinguishable (all members deterministic states, and some observation test {aj}j<N\{a_j\}_{j<N}{aj​}j<N​ has aj(φi)=δija_j(\varphi_i)=\delta_{ij}aj​(φi​)=δij​); every φi\varphi_iφi​ is pure (it belongs to some preparation test and all its refinements are nonnegative multiples of it); every pi≥0p_i\ge0pi​≥0; ∑ipi=1\sum_ip_i=1∑i​pi​=1; and ρ=∑ipiφi\rho=\sum_ip_i\varphi_iρ=∑i​pi​φi​. Pure ρ\rhoρ are not excluded.

Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

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