Theorem 10 — spectral decomposition into perfectly distinguishable pure states
OpenInfoDerivQT.spectral_decompositionLet satisfy the six principles and a system. Every normalized state can be written as
where 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 , so the formal statement covers all normalized states.
import Mathlib import Definitions.Def_InfoDerivQT_principles
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 InfoDerivQTRead-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 satisfying all six principles, a system , and a deterministic state of (the one-element family is a preparation test). The conclusion is that there exist a natural number , a family in and real numbers such that: the family is perfectly distinguishable (all members deterministic states, and some observation test has ); every is pure (it belongs to some preparation test and all its refinements are nonnegative multiples of it); every ; ; and . Pure are not excluded.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.