Lemma 3.11
OpenQAlgorithms.Papers.Independent.Support50.P12.lemma_3_11Let and be concrete unital algebras on nonzero finite-dimensional complex Hilbert spaces, and let be complex linear. The adjoint is for . A substochastic map has a Schwarz-contracting adjoint; stochastic additionally means trace preserving. Let . Powers are zero on kernels and traces are not normalized. Write for the unnormalized Petz Rényi entropy, , , and . Logarithms are natural and . The Petz map is .
Assume , is trace non-increasing and two-positive, and . There are shared orthogonal decompositions , where , , invertible right density operators , and unitaries such that
All blocks lie in the stated algebras, and the same data describe the entire positive fixed cone. Neither cone equality nor the action formula is assumed as input data.
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]
/-- Lemma 3.11, PDF pp.15–16: one shared decomposition for the ENTIRE positive
fixed cone, with the block action formula as a conclusion. -/
theorem lemma_3_11 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J)
(Phi : MatrixMap I J) (hc : AlgebraExtension A B Phi) (hp : AlgebraKPositive A Phi 2) (ht : AlgebraTraceNonincreasing A Phi)
(Y : Mat I) (hY : Y ∈ A) (hYp : Y.PosSemidef) (hn : Y ≠ 0) (htr : tr (Phi Y) = tr Y) :
∃ D : RecoveryBlocks I J, BlockSupports D {Y} {Phi Y} ∧
(∀ X ∈ A, (X.PosSemidef ∧ petz Y Phi (Phi X) = X) ↔
∃ Z : ∀ k, Mat (Fin (D.left1 k)), (∀ k, (Z k).PosSemidef) ∧
X = ∑ k, inputBlock D k (Z k)) ∧
(∀ k X, inputBlock D k X ∈ A ∧ Phi (inputBlock D k X) = outputBlock D k X) := 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, let and be unital complex subalgebras closed under conjugate transpose, and let be complex linear. Write , let
and assume that sends every matrix into , sends every matrix into , applying blockwise preserves positivity of every positive semidefinite block matrix whose blocks lie in , and for every positive semidefinite . Let be nonzero and positive semidefinite, with . For a positive semidefinite matrix , write for the functional-calculus matrix assigning eigenvalue the value , with value at , and define
Then there exist a natural number , positive integers for , matrices and , positive definite trace-one matrices and , and matrices , satisfying
The kernels of and coincide, and the kernels of and coincide. Define
For every ,
Finally, for every block and every matrix , without a positivity restriction on , one has and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.