The six principles: Axioms 1–5 and the purification postulate
DefinitionInfoDerivQT_principlesThe six principles of the paper, for an operational-probabilistic theory .
- Causality (Axiom 1). For every preparation test and observation tests , of the same system, for every .
- Perfect distinguishability (Axiom 2). Every normalized state that is not completely mixed is perfectly distinguishable from some other normalized state.
- Ideal compression (Axiom 3). For every normalized state of there are a system with , an encoding and a decoding with for all (lossless) and such that every normalized state of equals for some (maximally efficient).
- Local distinguishability (Axiom 4). If are normalized states of , there are effects of and of with .
- Pure conditioning (Axiom 5). If is a pure normalized state of and is an observation test on made of atomic effects, every induced state of is pure; and symmetrically for atomic observation tests on .
- Purification (Postulate 1). Every normalized state of has a purification: a pure normalized state of some whose marginal under a deterministic effect of is . If are purifications of the same with the same purifying system , then for some reversible transformation of .
SatisfiesPrinciples is the conjunction of the six.
Formalization Note The marginal in Postulate 1 is taken with any deterministic effect of ; under causality the deterministic effect is unique.
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
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 (structure OPT), the following propositions.
Causal: for every system , finite types , preparation test and observation tests , of , and every : .PerfectDistinguishabilityAxiom: for every system and that is not completely mixed, there is such that the two-element family is perfectly distinguishable.IsIdealCompression A C ρ E D(for systems , a vector , linear maps , ): , , , for all , and every equals for some .IdealCompressionAxiom: every admits some system and maps with this property.LocalDistinguishability: for all systems and with , there are , with .PureConditioning: for all systems , every that is pure, and every finite type : (i) for every observation test of all of whose members are atomic effects, each vector is a pure state of ; (ii) for every observation test of with atomic members, each is a pure state of .IsPurification A B ρ Ψ: , is pure, and for some deterministic effect of .Purification: (i) for every system and there are a system and withIsPurification A B ρ Ψ; (ii) for all systems , every vector and every that are both purifications of with purifying system , there is a linear map of that is a reversible transformation from to with .
SatisfiesPrinciples is the structure (conjunction) of these six propositions: Causal, PerfectDistinguishabilityAxiom, IdealCompressionAxiom, LocalDistinguishability, PureConditioning, Purification.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.