Corollary 2.5
ProvedQAlgorithms.Papers.Independent.Support50.P12.corollary_2_5Let be positive semidefinite operators on a nonzero finite-dimensional complex Hilbert space. Let be continuous on with signed extended recession slope . Write for the paper's quantum divergence, , and for the support projection. All powers vanish on the kernel, including exponent zero. Traces are representation traces.
For , mutually orthogonal support joins of two positive pairs, any linear or anti-linear isometry , and any unit vector , respectively,
In the sum identity the hypothesis is . Zero scaling is included. These are the basic covariance and direct-sum rules.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P12
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P12
open Filter MeasureTheory Set
open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)
open QAlgorithms.Papers.Independent.Information100.P30 (MatrixMap)
open QAlgorithms.Papers.Independent.Dependency50.P28 (tr LE logNonnegativeExtended pinch)
open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint spectralFunction petz relativeEntropy)
open QAlgorithms.Papers.Independent.Frontier18.P17 (hs)
open QAlgorithms.Papers.Independent.Next46.P23 (Supports)
open QAlgorithms.Papers.Independent.Support21.P03 (ExtendedConvex)
open QAlgorithms (spectralProjector)
open QAlgorithms.Learning (IsDistribution)
open QAlgorithms.Papers.Independent.Information100.P04 (absOp)
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Topology Kronecker
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
variable {I J K : Type} [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
[Fintype K] [DecidableEq K]
/-- Corollary 2.5, PDF p.6: zero scaling, orthogonal sums, both sorts of isometry,
and tensoring with any unit-vector projection. -/
theorem corollary_2_5 [Nonempty I] [Nonempty J] (f : ℝ → ℝ) (hf : DivergenceGenerator f)
(A B A1 B1 A2 B2 : Mat I) (hA : A.PosSemidef) (hB : B.PosSemidef)
(hA1 : A1.PosSemidef) (hB1 : B1.PosSemidef)
(hA2 : A2.PosSemidef) (hB2 : B2.PosSemidef) :
(∀ l : ℝ, 0 ≤ l → div f ((l : ℂ) • A) ((l : ℂ) • B) = (l : EReal) * div f A B) ∧
((A1 + B1) * (A2 + B2) = 0 →
div f (A1 + A2) (B1 + B2) = div f A1 B1 + div f A2 B2) ∧
(∀ (anti : Bool) (W : Matrix J I ℂ), Wᴴ * W = 1 →
div f (isometricConjugation anti W A) (isometricConjugation anti W B) = div f A B) ∧
(∀ x : J → ℂ, ∑ j, ‖x j‖ ^ 2 = 1 →
div f (Matrix.kronecker A (fun i j => x i * conj (x j)))
(Matrix.kronecker B (fun i j => x i * conj (x j))) = div f A B) := by sorry
end QAlgorithms.Papers.Independent.Support50.P12
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be nonempty finite types with decidable equality, and let be continuous on , with converging in the extended reals at to its selected limit. For positive semidefinite matrices , define
where the sums run over distinct eigenvalues, is the eigenspace projection, and . Define to be embedded in the extended reals if , and otherwise the total selected right limit of at zero. For any six positive semidefinite complex matrices , all four claims hold: for every real , including ,
if , then
for every Boolean choice and every complex matrix with ,
where when is true and when it is false; and, for every satisfying ,
There are no trace-normalization or nonzero assumptions on the six matrices, and the displayed identities use extended-real arithmetic.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.