Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The six principles: Axioms 1–5 and the purification postulate

Definition
InfoDerivQT_principles

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

operational-probabilistic-theoriesquantum-foundationsquantum-information

The six principles of the paper, for an operational-probabilistic theory TTT.

  1. Causality (Axiom 1). For every preparation test {ρi}\{\rho_i\}{ρi​} and observation tests {aj}\{a_j\}{aj​}, {bk}\{b_k\}{bk​} of the same system, ∑j(aj∣ρi)=∑k(bk∣ρi)\sum_j(a_j|\rho_i)=\sum_k(b_k|\rho_i)∑j​(aj​∣ρi​)=∑k​(bk​∣ρi​) for every iii.
  2. Perfect distinguishability (Axiom 2). Every normalized state that is not completely mixed is perfectly distinguishable from some other normalized state.
  3. Ideal compression (Axiom 3). For every normalized state ρ\rhoρ of AAA there are a system CCC with DC≤DAD_C\le D_ADC​≤DA​, an encoding E∈Transf(A,C)\mathcal E\in\mathrm{Transf}(A,C)E∈Transf(A,C) and a decoding D∈Transf(C,A)\mathcal D\in\mathrm{Transf}(C,A)D∈Transf(C,A) with DEσ=σ\mathcal D\mathcal E\sigma=\sigmaDEσ=σ for all σ∈Fρ\sigma\in F_\rhoσ∈Fρ​ (lossless) and such that every normalized state of CCC equals Eσ\mathcal E\sigmaEσ for some σ∈Fρ\sigma\in F_\rhoσ∈Fρ​ (maximally efficient).
  4. Local distinguishability (Axiom 4). If ρ≠σ\rho\neq\sigmaρ=σ are normalized states of ABABAB, there are effects aaa of AAA and bbb of BBB with (a⊗b∣ρ)≠(a⊗b∣σ)(a\otimes b|\rho)\neq(a\otimes b|\sigma)(a⊗b∣ρ)=(a⊗b∣σ).
  5. Pure conditioning (Axiom 5). If Ψ\PsiΨ is a pure normalized state of ABABAB and {ai}\{a_i\}{ai​} is an observation test on AAA made of atomic effects, every induced state (ai∣A∣Ψ)AB(a_i|_A|\Psi)_{AB}(ai​∣A​∣Ψ)AB​ of BBB is pure; and symmetrically for atomic observation tests on BBB.
  6. Purification (Postulate 1). Every normalized state ρ\rhoρ of AAA has a purification: a pure normalized state Ψ\PsiΨ of some ABABAB whose marginal (e∣B∣Ψ)AB(e|_B|\Psi)_{AB}(e∣B​∣Ψ)AB​ under a deterministic effect eee of BBB is ρ\rhoρ. If Ψ,Ψ′\Psi,\Psi'Ψ,Ψ′ are purifications of the same ρ\rhoρ with the same purifying system BBB, then Ψ′=(IA⊗U)Ψ\Psi'=(\mathcal I_A\otimes\mathcal U)\PsiΨ′=(IA​⊗U)Ψ for some reversible transformation U\mathcal UU of BBB.

SatisfiesPrinciples is the conjunction of the six.

Formalization Note The marginal in Postulate 1 is taken with any deterministic effect of BBB; under causality the deterministic effect is unique.

Definition code
import Mathlib
import Definitions.Def_InfoDerivQT_framework

namespace InfoDerivQT

namespace OPT

variable (T : OPT)

/-- Axiom 1 (Causality): the marginal probability `∑ⱼ (aⱼ|ρᵢ)` of a preparation outcome does
not depend on the choice of the observation test `{aⱼ}`. -/
def Causal : Prop :=
  ∀ (A : T.Sys) (X Y Z : Type) [Fintype X] [Fintype Y] [Fintype Z]
    (ρ : X → Vec (T.size A)) (a : Y → Module.Dual ℝ (Vec (T.size A)))
    (b : Z → Module.Dual ℝ (Vec (T.size A))),
    ρ ∈ T.PrepTest A X → a ∈ T.ObsTest A Y → b ∈ T.ObsTest A Z →
    ∀ i, ∑ j, a j (ρ i) = ∑ k, b k (ρ i)

/-- Axiom 2 (Perfect distinguishability): every normalized state that is not completely mixed
can be perfectly distinguished from some other normalized state. -/
def PerfectDistinguishabilityAxiom : Prop :=
  ∀ (A : T.Sys) (ρ : Vec (T.size A)), ρ ∈ T.St1 A → ¬ T.IsCompletelyMixed A ρ →
    ∃ σ ∈ T.St1 A, T.PerfectlyDistinguishable A ![ρ, σ]

/-- An ideal compression scheme for the normalized state `ρ` of `A` into the system `C`:
an encoding `E ∈ Transf(A,C)` and a decoding `D ∈ Transf(C,A)` with `D_C ≤ D_A`, which is
lossless (`D E σ = σ` for all `σ ∈ F_ρ`) and maximally efficient (every normalized state of
`C` is `E σ` for some `σ ∈ F_ρ`). -/
def IsIdealCompression (A C : T.Sys) (ρ : Vec (T.size A))
    (E : Vec (T.size A) →ₗ[ℝ] Vec (T.size C)) (D : Vec (T.size C) →ₗ[ℝ] Vec (T.size A)) :
    Prop :=
  E ∈ T.Transf A C ∧ D ∈ T.Transf C A ∧ T.size C ≤ T.size A ∧
    (∀ σ ∈ T.face A ρ, D (E σ) = σ) ∧
    (∀ τ ∈ T.St1 C, ∃ σ ∈ T.face A ρ, E σ = τ)

/-- Axiom 3 (Ideal compression): every normalized state admits an ideal compression scheme. -/
def IdealCompressionAxiom : Prop :=
  ∀ (A : T.Sys) (ρ : Vec (T.size A)), ρ ∈ T.St1 A →
    ∃ (C : T.Sys) (E : Vec (T.size A) →ₗ[ℝ] Vec (T.size C))
      (D : Vec (T.size C) →ₗ[ℝ] Vec (T.size A)), T.IsIdealCompression A C ρ E D

/-- Axiom 4 (Local distinguishability): two different normalized states of `AB` give
different probabilities for at least one product effect `a ⊗ b`. -/
def LocalDistinguishability : Prop :=
  ∀ (A B : T.Sys) (ρ σ : Vec (T.size (T.comp A B))), ρ ∈ T.St1 (T.comp A B) →
    σ ∈ T.St1 (T.comp A B) → ρ ≠ σ →
    ∃ a ∈ T.Eff A, ∃ b ∈ T.Eff B, T.tensorEff (A := A) (B := B) a b ρ ≠ T.tensorEff (A := A) (B := B) a b σ

/-- Axiom 5 (Pure conditioning): if `Ψ` is a pure normalized state of `AB` and `{aᵢ}` is an
atomic observation test on one side, then each induced state on the other side is pure. -/
def PureConditioning : Prop :=
  ∀ (A B : T.Sys) (Ψ : Vec (T.size (T.comp A B))) (X : Type) [Fintype X],
    Ψ ∈ T.St1 (T.comp A B) → T.IsPure (T.comp A B) Ψ →
    (∀ a : X → Module.Dual ℝ (Vec (T.size A)), a ∈ T.ObsTest A X →
      (∀ i, T.IsAtomicEff A (a i)) → ∀ i, T.IsPure B (T.condL (A := A) (B := B) (a i) Ψ)) ∧
    (∀ b : X → Module.Dual ℝ (Vec (T.size B)), b ∈ T.ObsTest B X →
      (∀ i, T.IsAtomicEff B (b i)) → ∀ i, T.IsPure A (T.condR (A := A) (B := B) (b i) Ψ))

/-- `Ψ ∈ St₁(AB)` is a purification of `ρ ∈ St₁(A)` (with purifying system `B`): `Ψ` is pure
and its marginal on `A`, obtained by applying a deterministic effect on `B`, is `ρ`. -/
def IsPurification (A B : T.Sys) (ρ : Vec (T.size A)) (Ψ : Vec (T.size (T.comp A B))) :
    Prop :=
  Ψ ∈ T.St1 (T.comp A B) ∧ T.IsPure (T.comp A B) Ψ ∧ ∃ e ∈ T.DetEff B, T.condR (A := A) (B := B) e Ψ = ρ

/-- Postulate 1 (Purification): every normalized state has a purification, and, for a fixed
purifying system `B`, any two purifications of the same state are connected by a reversible
transformation on `B`. -/
def Purification : Prop :=
  (∀ (A : T.Sys) (ρ : Vec (T.size A)), ρ ∈ T.St1 A →
    ∃ (B : T.Sys) (Ψ : Vec (T.size (T.comp A B))), T.IsPurification A B ρ Ψ) ∧
  (∀ (A B : T.Sys) (ρ : Vec (T.size A)) (Ψ Ψ' : Vec (T.size (T.comp A B))),
    T.IsPurification A B ρ Ψ → T.IsPurification A B ρ Ψ' →
    ∃ U : Vec (T.size B) →ₗ[ℝ] Vec (T.size B), T.IsReversible B B U ∧
      T.tensorT (A := A) (B := A) (A' := B) (B' := B) LinearMap.id U Ψ = Ψ')

/-- The six principles of the paper: Axioms 1–5 and Postulate 1. -/
structure SatisfiesPrinciples : Prop where
  causal : T.Causal
  perfectDistinguishability : T.PerfectDistinguishabilityAxiom
  idealCompression : T.IdealCompressionAxiom
  localDistinguishability : T.LocalDistinguishability
  pureConditioning : T.PureConditioning
  purification : T.Purification

end OPT

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), pp. 012311-7 to 012311-9, Sec. III: Axioms 1–5 and Postulate 1
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.

The file imports the framework and defines, for a theory TTT (structure OPT), the following propositions.

  1. Causal: for every system AAA, finite types X,Y,ZX,Y,ZX,Y,Z, preparation test {ρi}i∈X\{\rho_i\}_{i\in X}{ρi​}i∈X​ and observation tests {aj}j∈Y\{a_j\}_{j\in Y}{aj​}j∈Y​, {bk}k∈Z\{b_k\}_{k\in Z}{bk​}k∈Z​ of AAA, and every iii: ∑jaj(ρi)=∑kbk(ρi)\sum_ja_j(\rho_i)=\sum_kb_k(\rho_i)∑j​aj​(ρi​)=∑k​bk​(ρi​).
  2. PerfectDistinguishabilityAxiom: for every system AAA and ρ∈St1(A)\rho\in\mathrm{St}_1(A)ρ∈St1​(A) that is not completely mixed, there is σ∈St1(A)\sigma\in\mathrm{St}_1(A)σ∈St1​(A) such that the two-element family (ρ,σ)(\rho,\sigma)(ρ,σ) is perfectly distinguishable.
  3. IsIdealCompression A C ρ E D (for systems A,CA,CA,C, a vector ρ\rhoρ, linear maps E:RDA→RDCE:\mathbb R^{D_A}\to\mathbb R^{D_C}E:RDA​→RDC​, D:RDC→RDAD:\mathbb R^{D_C}\to\mathbb R^{D_A}D:RDC​→RDA​): E∈Transf(A,C)E\in\mathrm{Transf}(A,C)E∈Transf(A,C), D∈Transf(C,A)D\in\mathrm{Transf}(C,A)D∈Transf(C,A), DC≤DAD_C\le D_ADC​≤DA​, D(Eσ)=σD(E\sigma)=\sigmaD(Eσ)=σ for all σ∈Fρ\sigma\in F_\rhoσ∈Fρ​, and every τ∈St1(C)\tau\in\mathrm{St}_1(C)τ∈St1​(C) equals EσE\sigmaEσ for some σ∈Fρ\sigma\in F_\rhoσ∈Fρ​. IdealCompressionAxiom: every ρ∈St1(A)\rho\in\mathrm{St}_1(A)ρ∈St1​(A) admits some system CCC and maps E,DE,DE,D with this property.
  4. LocalDistinguishability: for all systems A,BA,BA,B and ρ,σ∈St1(AB)\rho,\sigma\in\mathrm{St}_1(AB)ρ,σ∈St1​(AB) with ρ≠σ\rho\neq\sigmaρ=σ, there are a∈Eff(A)a\in\mathrm{Eff}(A)a∈Eff(A), b∈Eff(B)b\in\mathrm{Eff}(B)b∈Eff(B) with (a⊗b)(ρ)≠(a⊗b)(σ)(a\otimes b)(\rho)\neq(a\otimes b)(\sigma)(a⊗b)(ρ)=(a⊗b)(σ).
  5. PureConditioning: for all systems A,BA,BA,B, every Ψ∈St1(AB)\Psi\in\mathrm{St}_1(AB)Ψ∈St1​(AB) that is pure, and every finite type XXX: (i) for every observation test {ai}i∈X\{a_i\}_{i\in X}{ai​}i∈X​ of AAA all of whose members are atomic effects, each vector condL(ai)Ψ\mathrm{condL}(a_i)\PsicondL(ai​)Ψ is a pure state of BBB; (ii) for every observation test {bi}i∈X\{b_i\}_{i\in X}{bi​}i∈X​ of BBB with atomic members, each condR(bi)Ψ\mathrm{condR}(b_i)\PsicondR(bi​)Ψ is a pure state of AAA.
  6. IsPurification A B ρ Ψ: Ψ∈St1(AB)\Psi\in\mathrm{St}_1(AB)Ψ∈St1​(AB), Ψ\PsiΨ is pure, and condR(e)Ψ=ρ\mathrm{condR}(e)\Psi=\rhocondR(e)Ψ=ρ for some deterministic effect eee of BBB. Purification: (i) for every system AAA and ρ∈St1(A)\rho\in\mathrm{St}_1(A)ρ∈St1​(A) there are a system BBB and Ψ\PsiΨ with IsPurification A B ρ Ψ; (ii) for all systems A,BA,BA,B, every vector ρ\rhoρ and every Ψ,Ψ′\Psi,\Psi'Ψ,Ψ′ that are both purifications of ρ\rhoρ with purifying system BBB, there is a linear map UUU of RDB\mathbb R^{D_B}RDB​ that is a reversible transformation from BBB to BBB with (idA⊗U)Ψ=Ψ′(\mathrm{id}_A\otimes U)\Psi=\Psi'(idA​⊗U)Ψ=Ψ′.

SatisfiesPrinciples is the structure (conjunction) of these six propositions: Causal, PerfectDistinguishabilityAxiom, IdealCompressionAxiom, LocalDistinguishability, PureConditioning, Purification.

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