Lemma A.6: Surjective *-homomorphism mu: pure p maps to pure or zero; Tr A≥Tr mu(A) for positive A; mu*(mu(p))=p or mu(p)=0, mu(mu*(mu(p)))=m
ProvedQAlgorithms.Papers.Independent.Renew46.P43.surjectiveHomomorphismLet be a surjective unital star homomorphism of finite intrinsic C*-algebras, and let be its trace adjoint. In the display are pure states on the respective algebras and . In addition to the displayed claims, every positive-coefficient orthogonal pure diagonalization of pushes forward term by term to one of , and every such diagonalization of pulls back term by term to one of .
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
/-- Lemma A.6, PDF pp.66-67: all five assertions for a surjective star homomorphism,
including both directions of the diagonalization correspondence. -/
theorem surjectiveHomomorphism {A B : IntrinsicSystem} (F : Hom A B)
(hsurj : ∀ T, InBlocks B.block T → ∃ U, InBlocks A.block U ∧ F.map U = T) :
(∀ p, A.IsPureState p → B.IsPureState (F.map p) ∨ F.map p = 0) ∧
(∀ T, InBlocks A.block T → T.PosSemidef → T.trace.re ≥ (F.map T).trace.re) ∧
(∀ p q, A.IsPureState p → B.IsPureState q →
(intrinsicRestriction A F.map (F.map p) = p ∨ F.map p = 0) ∧
F.map (intrinsicRestriction A F.map (F.map p)) = F.map p ∧ F.map (intrinsicRestriction A F.map q) = q) ∧
(∀ (rho : Matrix (Fin B.dim) (Fin B.dim) ℂ), B.IsState rho →
∀ (m : ℕ) (p : Fin m → ℝ) (P : Fin m → Matrix (Fin A.dim) (Fin A.dim) ℂ),
Diagonalization A (intrinsicRestriction A F.map rho) p P →
Diagonalization B rho p (fun i => F.map (P i))) ∧
(∀ (rho : Matrix (Fin B.dim) (Fin B.dim) ℂ), B.IsState rho →
∀ (m : ℕ) (p : Fin m → ℝ) (P : Fin m → Matrix (Fin B.dim) (Fin B.dim) ℂ),
Diagonalization B rho p P →
Diagonalization A (intrinsicRestriction A F.map rho) p (fun i => intrinsicRestriction A F.map (P i))) := 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 and be systems with positive integer dimensions and block labels and . Call a matrix block diagonal when its -entry vanishes whenever the corresponding block labels differ. A state is a positive semidefinite, block diagonal matrix of trace ; a pure state is a block diagonal matrix for a vector of norm . Let be a complex linear map from matrices to matrices that preserves the identity and block diagonality, preserves products and adjoints of block diagonal matrices, and has the following positivity property: for every integer , applying to each matrix block of a positive semidefinite matrix indexed by produces a positive semidefinite matrix whenever the input entries vanish between different -block labels. Assume that every block diagonal -matrix is for some block diagonal -matrix . Define the restriction on -matrices by
where is the matrix unit. Then: every pure -state has either a pure -state or zero; every positive semidefinite block diagonal -matrix satisfies ; and for every pure -state and every pure -state ,
Moreover, for every -state , every , every real coefficient family , and every family of -matrices, if all , all are pure -states, for , and , then all are pure -states, are pairwise orthogonal in the same product sense, and . Conversely, for every such and every family of pure -states with positive coefficients, for , and , all are pure -states, are pairwise orthogonal, and . These decomposition statements quantify over as well; their hypotheses then cannot hold because has trace .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.