Lemma 32 — all maximal sets of perfectly distinguishable pure states have the same size
OpenInfoDerivQT.maximal_sets_same_cardLet satisfy the six principles and a system. If and are both maximal sets of perfectly distinguishable pure states of , then
The common value is the informational dimension of the system.
import Mathlib import Definitions.Def_InfoDerivQT_principles
namespace InfoDerivQT
theorem maximal_sets_same_card (T : OPT) (hT : T.SatisfiesPrinciples) (A : T.Sys)
{N M : ℕ} (φ : Fin N → Vec (T.size A)) (ψ : Fin M → Vec (T.size A))
(hφ : T.IsMaximalPerfDistPure A φ) (hψ : T.IsMaximalPerfDistPure A ψ) :
N = M := 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 , natural numbers and families , . Assume each family is a maximal perfectly distinguishable family of pure states: all members are deterministic states, there is an observation test indexed by the same set with , no deterministic state can be appended keeping the family perfectly distinguishable, and every member is pure (all its refinements in preparation tests are nonnegative multiples of it). The conclusion is . Neither nor is required to be positive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.