Remark 5.4, affine case 5.4-affine
ProvedQAlgorithms.Papers.Independent.Support50.P12.remark_5_4_affineLet 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.
Assume is substochastic, , and . For every real , let . Then and
Affine preservation is automatic and imposes no reversibility conclusion.
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]
/-- Remark 5.4 (affine case), PDF p.25: affine equality is automatic on a supported
pair, including the displayed trace formula. No reversibility conclusion is imposed. -/
theorem remark_5_4_affine [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J) (Phi : MatrixMap I J)
(hp : Substochastic A B Phi) (X Y : Mat I) (hX : X ∈ A) (hY : Y ∈ A)
(hXp : X.PosSemidef) (hYp : Y.PosSemidef) (htr : tr (Phi Y) = tr Y)
(hs : Supports X Y) (a b : ℝ) :
tr (Phi X) = tr X ∧
div (fun x => b + a * x) (Phi X) (Phi Y) = ((b * tr (Phi Y) + a * tr (Phi X) : ℝ) : EReal) ∧
div (fun x => b + a * x) (Phi X) (Phi Y) = div (fun x => b + a * x) X Y ∧
div (fun x => b + a * x) X Y = ((b * tr Y + a * tr X : ℝ) : EReal) := 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 index types with decidable equality, , unital complex star subalgebras, and complex linear. Write . Assume that maps all ambient matrices into , its Hilbert–Schmidt adjoint maps all ambient matrices into , this adjoint is positive on positive elements of , and for every . Let be positive semidefinite, with and , and let be arbitrary. For , define
Here powers vanish at eigenvalue zero, is the distinct spectrum for a Hermitian matrix and is empty otherwise, is the orthogonal eigenspace projection, division by zero is zero, and the second branch is the total extended real selected limit. Then
with each real expression embedded into the extended real line. Singular, zero, and unnormalized are included, and no signs are imposed on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.