Corollary A.11: Maximal observable Xobs in Xalg has H(Xobs)≥H(Xalg); maximal subalgebra Xprime in Xalg has H(Xprime)≥H(Xalg).
ProvedQAlgorithms.Papers.Independent.Renew46.P43.maximalEntropyFix a normalized state on the finite intrinsic algebra . An observable is maximal here when the trace of each effect is at most one, equivalently its Heisenberg map is trace nonincreasing on positive elements. An included subalgebra is maximal when its inclusion has that trace property. The observable may have countably many outcomes and infinite entropy.
This is the source result with its stated operational or information-theoretic domain.
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Renew46.P43
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)
open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)
attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace
/-- Corollary A.11, PDF p.71: both maximal-observable and maximal-subalgebra clauses.
The countable observable entropy is allowed to be infinite. -/
theorem maximalEntropy {A : IntrinsicSystem} (rho : Matrix (Fin A.dim) (Fin A.dim) ℂ)
(hrho : A.IsState rho) :
(∀ {B : Type*} [Countable B] (D : B → Matrix (Fin A.dim) (Fin A.dim) ℂ),
IsCountablePOVM D → (∀ b, InBlocks A.block (D b)) → (∀ b, (D b).trace.re ≤ 1) →
ENNReal.ofReal (vnEntropy rho) ≤ countableEntropy (fun b => effectProb rho (D b))) ∧
(∀ (X : IntrinsicSystem) (E : Embedding X A), TraceNonincreasing E.toIntrinsicOperation →
viewedEntropy X E.map rho ≥ vnEntropy rho) := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a system with positive finite dimension and block labels , and let be a positive semidefinite matrix of trace whose entries vanish whenever its two indices have different block labels. Write , where is applied by continuous functional calculus. Two conclusions hold. First, for every countable outcome type and every family of matrices on , if each is positive semidefinite and block diagonal, the family has sum , and for every , then, with ,
Here , regarded as an extended nonnegative real, the countable sum may be infinite, and the entropy contribution at is zero. An empty outcome type cannot satisfy the sum-to-identity hypothesis because . Second, for every system of positive finite dimension and every complex linear map from matrices on to matrices on that preserves the identity and block diagonality, preserves products and adjoints of block diagonal matrices, is injective on block diagonal matrices, and preserves positive semidefiniteness under every finite amplification restricted to the -block algebra, assume also that for every positive semidefinite block diagonal -matrix . Define
where is the matrix unit on . Then .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.