Lemma 3.9
ProvedQAlgorithms.Papers.Independent.Support50.P12.lemma_3_9Let 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 Schwarz, put , and set . Then
The set is a complex vector space closed under multiplication. This is a one-sided domain; no closure under adjoints is asserted.
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.9, PDF p.14: ONE-sided XX* multiplicative domain; no star closure is asserted. -/
theorem lemma_3_9 [Nonempty I] [Nonempty J] (A : Alg I) (B : Alg J)
(Phi : MatrixMap I J) (hc : AlgebraExtension A B Phi) (hp : AlgebraSchwarzMap A Phi) :
let c := (snorm A Phi).toReal
let D := {X : Mat I | X ∈ A ∧ Phi X * Phi (Xᴴ) = (c : ℂ) • Phi (X * Xᴴ)}
(∀ X ∈ A, X ∈ D ↔ ∀ Z ∈ A, Phi X * Phi Z = (c : ℂ) • Phi (X * Z)) ∧
(0 : Mat I) ∈ D ∧
(∀ X ∈ D, ∀ Y ∈ D, X + Y ∈ D) ∧
(∀ a : ℂ, ∀ X ∈ D, a • X ∈ D) ∧
(∀ X ∈ D, ∀ Y ∈ D, X * Y ∈ D) := 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. Assume that sends every matrix into , its adjoint
sends every matrix into , and there exists a real such that is positive on positive semidefinite elements of and for all . Define as the infimum of over all such bounds, let be its real conversion, and put
Then, for every ,
Moreover , for every , for every complex and , and for every . Here is positive semidefinite order, , and real conversion assigns the value .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.