Theorem 9 (with Lemma 10) — the invariant state is
OpenInfoDerivQT.invariant_state_uniform_mixtureLet satisfy the six principles, a system and a maximal set of perfectly distinguishable pure states. Put . Then
- for every reversible transformation of ;
- is the only normalized state of with this property.
Thus the unique invariant state of Lemma 10 equals for every maximal set.
import Mathlib import Definitions.Def_InfoDerivQT_principles
namespace InfoDerivQT
theorem invariant_state_uniform_mixture (T : OPT) (hT : T.SatisfiesPrinciples) (A : T.Sys)
{N : ℕ} (φ : Fin N → Vec (T.size A)) (hφ : T.IsMaximalPerfDistPure A φ) :
(∀ U : Vec (T.size A) →ₗ[ℝ] Vec (T.size A), T.IsReversible A A U →
U ((1 / (N : ℝ)) • ∑ i, φ i) = (1 / (N : ℝ)) • ∑ i, φ i) ∧
∀ ω ∈ T.St1 A, (∀ U : Vec (T.size A) →ₗ[ℝ] Vec (T.size A), T.IsReversible A A U →
U ω = ω) → ω = (1 / (N : ℝ)) • ∑ 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 , a natural number and a maximal perfectly distinguishable family of pure states of (deterministic members, an observation test with , no deterministic state can be appended, all members pure). Let (if this is the zero vector, since in this convention). The statement asserts two things: (1) for every linear map of that is a reversible transformation (it lies in some test from to and has a two-sided inverse that also lies in some test from to ), ; (2) every deterministic state of with for all reversible equals .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.