Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Finite matrix trace-norm ideal inequalities

Statement

Let H be a complex Hilbert space of finite dimension d≥1. For a matrix X define ∣X∣=(X∗X)1/2 by finite Hermitian functional calculus and define its trace norm by ∥X∥1=Tr⁡∣X∣. This is a complete norm on the finite-dimensional matrix space. Write ∥Y∥:=sup⁡{∥Yv∥:∥v∥≤1} for the operator norm induced by the Hilbert-space norm. For all matrices X,Y,

∥YX∥1≤∥Y∥∥X∥1,∥XY∥1≤∥Y∥∥X∥1,∣Tr⁡X∣≤∥X∥1.

For unitary U, ∥UXU∗∥1=∥X∥1.

Facts & Assumptions

Given: A complex inner-product space H of finite dimension d≥1 and matrices X,Y.

[F1]

Finite matrix spectral and state calculus: every positive Hermitian matrix has a basis-independent orthonormal spectral decomposition and positive square root; the finite trace is basis independent.

Proof

technique · direct

Given: The finite-dimensional Hilbert space and matrices above.

1.1givenF1construct

Diagonalize X∗X by [F1], with nonnegative eigenvalues sj2 and orthonormal eigenvectors vj. For each sj>0 put uj=Xvj/sj; then ⟨ui,uj⟩=δij because ⟨Xvi,Xvj⟩=⟨vi,X∗Xvj⟩. Extending both finite orthonormal families to bases gives the singular-value expansion X=∑sj>0sjRuj,vj, where Ru,vx=⟨x,v⟩u. The only nonzero singular value of Ru,v is ∥u∥∥v∥, so ∥Ru,v∥1=∥u∥∥v∥ and ∥X∥1=∑sj>0sj.

2.1step 1.1F1algebra

The rank-one trace formula is Tr⁡(Ru,v)=⟨u,v⟩, so the expansion in step 1.1 gives ∥X∥1=sup⁡U unitary∣Tr⁡(UX)∣. For the upper bound, if uj,vj are unit vectors, then ∥Uuj−⟨Uuj,vj⟩vj∥2=1−∣⟨Uuj,vj⟩∣2≥0, so ∣⟨Uuj,vj⟩∣≤1. Equality is attained by a unitary mapping each uj to vj, extended from these finite orthonormal families to bases. The supremum formula implies the triangle inequality ∥X+Y∥1≤∥X∥1+∥Y∥1 and homogeneity; positivity and definiteness follow from the singular values.

3.1step 1.1step 2.1algebra

Applying step 1.1 to YX=∑jsjRYuj,vj and using the triangle inequality of step 2.1 gives ∥YX∥1≤∑jsj∥Yuj∥∥vj∥≤∥Y∥∑jsj=∥Y∥∥X∥1. Similarly XY=∑jsjRuj,Y∗vj gives ∥XY∥1≤∥Y∥∥X∥1. The rank-one trace formula and step 1.1 also give ∣Tr⁡X∣≤∑jsj∣⟨uj,vj⟩∣≤∥X∥1.

4.1step 3.1algebra∎

Define the Frobenius norm by ∥X∥F=(∑i,j∣Xij∣2)1/2 in an orthonormal basis. The finite singular-value expansion gives ∥X∥F=(∑jsj2)1/2. Since sj≥0, (∑jsj2)1/2≤∑jsj; also d∑jsj2−(∑jsj)2=∑i<j(si−sj)2≥0. Thus ∥X∥F≤∥X∥1≤d ∥X∥F. A trace-norm Cauchy sequence is therefore Cauchy in each matrix coordinate and converges to a matrix; the second inequality gives convergence in trace norm. This proves completeness. For unitary U, step 3.1 gives ∥UX∥1≤∥X∥1; applying it to U∗ and UX gives the reverse inequality. The same argument on the right proves ∥UXU∗∥1=∥X∥1.

Depends on

Dependency tree · 2 levels

Sources