A.10-equality: For full spectral resolution rho=sum lambda_i p_i, entropy is preserved by restriction to the generated algebra or any intermediat
ProvedQAlgorithms.Papers.Independent.Renew46.P43.spectralEntropyEqualityLet be a full fine orthogonal pure spectral resolution in a finite intrinsic algebra, with and . Any included subalgebra containing every preserves entropy, including the generated subalgebra. The spectral observable also preserves entropy. These are sufficient equality cases, not a characterization.
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
/-- Equality cases following Theorem A.10, PDF p.71. Any subsystem containing
the full fine spectral resolution preserves entropy, as does its spectral observable. -/
theorem spectralEntropyEquality {A : IntrinsicSystem} {m : ℕ}
(rho : Matrix (Fin A.dim) (Fin A.dim) ℂ) (hrho : A.IsState rho)
(p : Fin m → ℝ) (P : Fin m → Matrix (Fin A.dim) (Fin A.dim) ℂ)
(hp : ∀ i, 0 ≤ p i) (hP : ∀ i, A.IsPureState (P i))
(horth : ∀ i j, i ≠ j → P i * P j = 0) (hcomplete : ∑ i, P i = 1)
(hdecomp : rho = ∑ i, (p i : ℂ) • P i) :
(∀ (X : IntrinsicSystem) (E : Embedding X A),
(∀ i, ∃ T, InBlocks X.block T ∧ E.map T = P i) → viewedEntropy X E.map rho = vnEntropy rho) ∧
countableEntropy (fun i => effectProb rho (P i)) = ENNReal.ofReal (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 consisting of a positive integer dimension and a block label ; a matrix respects its blocks when its -entry is zero whenever . Let be a positive semidefinite matrix of trace respecting these blocks. For any natural number , let be nonnegative real numbers, and let respect the blocks of , with each for some complex unit vector . Assume for every , , and . Write , where denotes continuous functional calculus. Then both of the following hold. First, for every other system with positive dimension , block labels , and an embedding into , if each for some matrix respecting the blocks of , then , where
and is the matrix unit with its only nonzero entry, equal to , at . Here an embedding is a complex-linear map on the full matrix spaces which sends to , sends block-respecting matrices to block-respecting matrices, preserves products and adjoints on that block algebra, is injective on that algebra, and has the following positivity property: for every natural number , including , applying the map to each matrix block of any positive semidefinite matrix on whose entries vanish between unequal -block labels produces a positive semidefinite matrix. Second, putting , one has
as an equality in . The hypotheses permit zero values of ; although is quantified over, completeness would then require in the positive dimension , so no such data satisfy the hypotheses.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.