Alphabeta Math
Pipeline-generated
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-Dimensional Complex Inner-Product Spaces and Matrix Interfaces

1 · Prerequisites

2 · Summary

This page fixes the finite-dimensional complex inner-product conventions used by the quantum-computing track. The root pairing is linear in its first argument; Dirac amplitudes reverse the arguments, and bras and outer products are defined through the root pairing. Coordinate identities are stated for ordered orthonormal bases, including zero-dimensional spaces. For rectangular finite maps, the trace norm sums the singular values on the domain. The page proves its dual formula and norm laws, rank-one and spectral formulas, unitary invariance, the positive-semidefinite trace formula, the trace Holder inequality, and the Hermitian positive-negative decomposition. The arguments use finite-dimensional basis and spectral results only and introduce no choice axiom.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Dirac Notation Conversion

Definition

All complex inner products in this track use the root convention: they are linear in the first argument and conjugate-linear in the second (Real and complex inner-product spaces and their induced length). For vectors x,y in the same space, define the Dirac pairing by

⟨x∣y⟩D:=⟨y,x⟩root.

The ket ∣x⟩ denotes the vector x. The bra ⟨x∣ denotes the linear functional z↦⟨z,x⟩root.

For finite-dimensional complex inner-product spaces H,K, vectors y∈H and x∈K, define the rank-one linear map

∣x⟩⟨y∣:H→K,z↦⟨z,y⟩H,rootx.

Given ordered orthonormal bases of H and K, its coordinate matrix is [x][y]†, where [x] and [y] are the corresponding coordinate columns and M†:=M‾T is the conjugate transpose. The coordinate assertion is established in Dirac Notation Coordinate Identity ↗.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Trace Norm

Definition

Let A:H→K be a linear map (Linear map between vector spaces over the same field) between finite-dimensional complex inner-product spaces. Its singular values are the eigenvalues of ∣A∣:=A∗A:H→H, counted with multiplicity, as defined in The singular values of a linear map as the eigenvalues of the positive square root of T^*T. Define the trace norm, or Schatten-1 norm, by

∥A∥1:=∑j<dim⁡Hsj(A).

The sum includes zero singular values and is 0 when H is the zero space. For this definition, A may be rectangular; the singular values are those of ∣A∣ on the domain H. The spectral trace formula is proved in Trace Norm Spectral Formula ↗.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Dirac Adjoint Amplitude Translation

Statement

Let H,K be finite-dimensional complex inner-product spaces, let T:H→K be linear, and let x∈K, y∈H. With the Dirac conversion Dirac Notation Conversion,

⟨x∣T∣y⟩D:=⟨x∣Ty⟩D=⟨Ty,x⟩K,root=⟨y,T∗x⟩H,root=⟨T∗x∣y⟩D.

Facts & Assumptions

Given: Finite-dimensional complex inner-product spaces H,K, a linear map T:H→K, and vectors x∈K, y∈H.

[F1]

The Dirac pairing reverses the root pairing: ⟨a∣b⟩D=⟨b,a⟩root (Dirac Notation Conversion).

[F2]

The adjoint satisfies ⟨Tv,w⟩K=⟨v,T∗w⟩H (The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V).

[F3]

Every linear map between finite-dimensional inner-product spaces has a unique adjoint (Every linear map between finite-dimensional inner product spaces has a unique adjoint).

Proof

1.1givenF1F3

The adjoint T∗ exists by [F3]. The definition [F1] gives ⟨x∣T∣y⟩D=⟨Ty,x⟩K,root.

2.1F1F2step 1.1∎

Apply [F2] with v=y and w=x, then apply [F1] again. This gives ⟨Ty,x⟩K,root=⟨y,T∗x⟩H,root=⟨T∗x∣y⟩D, proving the stated chain.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Dirac Notation Coordinate Identity

Statement

Let H,K be finite-dimensional complex inner-product spaces with ordered orthonormal bases E=(ej)j<n and F=(fi)i<m. Let T:H→K be linear (Linear map between vector spaces over the same field), and write Tij for the (i,j) entry of its matrix in these bases. Then, for every z∈H,

Tz=∑j<n∑i<mTij⟨z,ej⟩H,rootfi,T=∑j<n∑i<mTij∣fi⟩⟨ej∣.

For x∈K and y∈H, the rank-one map ∣x⟩⟨y∣ has coordinate matrix [x]F[y]E†, where M†=M‾T. Its amplitude satisfies ⟨x∣T∣y⟩D=⟨Ty,x⟩K,root. All sums are empty when an index dimension is zero, and the identities include those cases.

Facts & Assumptions

Given: The spaces, ordered orthonormal bases, linear map, and vectors in the Statement.

[F1]

For an orthonormal basis (ej)j<n, z=∑j<n⟨z,ej⟩ej; the corresponding inner-product coordinate formula and empty-basis case also hold (Bessel's inequality for a finite orthonormal list and Parseval's identity for an orthonormal basis).

[F2]

The j-th matrix column of a linear map is the coordinate column of the image of the j-th basis vector (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases).

[F3]

∣x⟩⟨y∣ acts on z by z↦⟨z,y⟩rootx, and ⟨x∣y⟩D=⟨y,x⟩root (Dirac Notation Conversion).

[F4]
[F5]

Transposition interchanges matrix rows and columns (The transpose AT of a matrix).

[F6]

Complex conjugation is the usual scalar involution (Real and imaginary parts, complex conjugation, and modulus).

[F7]

The root inner product is conjugate-symmetric (Real and complex inner-product spaces and their induced length).

Proof

1.1givenF1F2algebra

By [F1], z=∑j<n⟨z,ej⟩ej. Applying T and using linearity, then expanding each Tej by [F2], gives Tz=∑j<n∑i<mTij⟨z,ej⟩fi.

1.2F1F2F3F4F5F6F7algebra

Write xi=⟨x,fi⟩ and yj=⟨y,ej⟩, the coordinates from [F1]–[F2]. The image of ej under ∣x⟩⟨y∣ is ⟨ej,y⟩x=yj‾x by [F1] and [F7]. Its i-th coordinate is therefore xiyj‾. By [F4]–[F6], these are exactly the entries of [x]F[y]E†.

1.3F3given

The amplitude identity is the defining Dirac conversion [F3].

2.1F3step 1.1

By [F3], the operator sum in the Statement sends every z to the right-hand side of step 1.1. It therefore agrees with T on every vector.

3.1givenstep 1.1step 2.1step 1.2step 1.3algebra∎

If n=0, then H=0, T=0, and y=0; if m=0, then K=0, T=0, and x=0. In either case the displayed sums and rank-one map are zero, and the amplitude identity is 0=0. Thus all formulas include zero dimensions.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Trace Norm Duality And Norm Properties

Statement

Let A:H→K be a linear map (Linear map between vector spaces over the same field) between finite-dimensional complex inner-product spaces. Then

∥A∥1=max⁡{ ∣tr⁡H(B∗A)∣:B:H→K linear and ∥B∥≤1 }.

Consequently, on the vector space of linear maps H→K, the trace norm is nonnegative, absolutely homogeneous, definite, and satisfies the triangle inequality.

Facts & Assumptions

Given: Finite-dimensional complex inner-product spaces H,K and linear maps A,D:H→K; where quantified, B:H→K is also a map H→K.

[F1]

The trace norm is the sum of the singular values, including zeros (Trace Norm).

[F3]

The adjoint is characterized by ⟨Tv,w⟩=⟨v,T∗w⟩, and finite-dimensional adjoints exist uniquely (The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V, Every linear map between finite-dimensional inner product spaces has a unique adjoint).

[F4]

In an ordered basis, the trace of an endomorphism is the sum of its diagonal entries; it is basis-independent and is 0 on the zero space (The basis-independent trace of an endomorphism of a finite-dimensional vector space).

[F5]

The operator norm is 0 on the zero domain and otherwise is defined as the maximum of ∥Cz∥ over unit vectors z (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).

[F6]

Cauchy–Schwarz gives ∣⟨u,v⟩∣≤∥u∥∥v∥ (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[F7]

An orthonormal basis gives finite vector expansions, including the empty basis case (Bessel's inequality for a finite orthonormal list and Parseval's identity for an orthonormal basis).

[F9]

In a fixed ordered basis, a linear map's j-th matrix column is the coordinate column of the image of the j-th basis vector (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases).

[F10]

The root pairing is linear in its first argument and conjugate-symmetric (Real and complex inner-product spaces and their induced length).

Proof

1.1F4F9algebra

Fix an ordered basis of H. For endomorphisms R,S of H and a scalar α, [F9] shows that the diagonal entries of αR+S are αRjj+Sjj: the j-th coordinate column is obtained from (αR+S)ej=αRej+Sej. Summing these entries by [F4] gives tr⁡H(αR+S)=αtr⁡H(R)+tr⁡H(S). Thus trace homogeneity and additivity used below follow from the diagonal-sum definition. The same calculation covers H=0 by empty sums.

1.2F2F5F7algebra

Let C:H→K be any finite-dimensional linear map. If H=0, its operator norm is 0 by [F5]. If H≠0, choose an SVD as in [F2] with positive singular values t1≥⋯≥tq>0 and orthonormal domain vectors u1,…,udim⁡H. If q>0, Bessel's inequality [F7] gives, for every unit vector z, ∥Cz∥2=∑j≤qtj2∣⟨z,uj⟩∣2≤t12, with equality at z=u1. If q=0, the SVD says C=0, so every unit vector attains the value 0. Thus the maximum in [F5] exists for every map used below, including the zero-rank case.

1.3givenF1F2choose

Choose an SVD as in [F2], with r positive singular values. Then ∥A∥1=∑i<rsi by [F1]. If r=0, [F2] gives A=0 and this sum is empty.

1.4F2F3F4F7F10algebra

Write the SVD domain basis as (ej)j<n and its positive singular values as si for i<r. By [F4], [F7], and the fact that the j-th diagonal entry is the ej-coordinate of the image of ej, tr⁡H(B∗A)=∑j<n⟨B∗Aej,ej⟩H=∑i<rsi⟨B∗fi,ei⟩H=∑i<rsi⟨fi,Bei⟩K. For the last equality, [F3] gives ⟨Bei,fi⟩K=⟨ei,B∗fi⟩H, and conjugate symmetry [F10] gives the displayed order. This is a direct endomorphism-trace calculation and uses no cyclic trace identity for maps.

2.1F2F3F7F10step 1.2construct

Suppose r>0 and define B0:H→K by B0z=∑i<r⟨z,ei⟩fi. By [F10], this is linear; it sends ei to fi for i<r and sends the remaining basis vectors to 0. By [F7], ∥B0z∥2=∑i<r∣⟨z,ei⟩∣2≤∥z∥2, with equality at z=e0. The maximum property established in step 1.2 therefore gives ∥B0∥=1. Define Cw=∑i<r⟨w,fi⟩ei. Expanding in the finite orthonormal bases using [F7] verifies ⟨B0z,w⟩K=⟨z,Cw⟩H, so [F3] gives C=B0∗. Hence B0∗Aei=siei for i<r and B0∗Aej=0 for j≥r. If r=0, set B0=0.

2.2F5F6F8step 1.2step 1.3step 1.4algebra

Let B:H→K satisfy ∥B∥≤1. By [F5] and the maximum property established in step 1.2, ∥Bei∥≤1 for every unit vector ei; [F6] then gives ∣⟨fi,Bei⟩∣≤1. Applying [F8] to the sum in step 1.4 yields ∣tr⁡H(B∗A)∣≤∑i<rsi=∥A∥1. The same bound is immediate when r=0.

3.1F1F2F4F7step 1.3step 2.2step 2.1

By [F4], [F7], and step 1.3, tr⁡H(B0∗A)=∑i<rsi=∥A∥1; when r=0, both sides are 0. Together with step 2.2 this proves the stated maximum, including zero-dimensional spaces.

4.1F1F2F8step 1.1step 3.1algebra

For any scalar α, apply the maximum formula to αA. By step 1.1, tr⁡H(B∗(αA))=αtr⁡H(B∗A), so taking absolute values and maxima gives ∥αA∥1=∣α∣∥A∥1. The definition and [F2] give ∥A∥1≥0, with equality exactly when all singular values vanish, which by the SVD is exactly A=0.

5.1F8step 1.1step 3.1algebra∎

For maps A,D:H→K, every contraction B satisfies ∣tr⁡H(B∗(A+D))∣≤∣tr⁡H(B∗A)∣+∣tr⁡H(B∗D)∣≤∥A∥1+∥D∥1 by the additivity from step 1.1, [F8], and step 3.1. Taking the maximum over B proves ∥A+D∥1≤∥A∥1+∥D∥1. Thus the trace norm has all stated norm properties.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Trace Norm Rank One Formula

Statement

Let H,K be finite-dimensional complex inner-product spaces, x∈K, y∈H, and ∣x⟩⟨y∣:H→K the rank-one linear map (Linear map between vector spaces over the same field) from Dirac Notation Conversion. Then

∥∣x⟩⟨y∣∥1=∥x∥ ∥y∥.

Facts & Assumptions

Given: Finite-dimensional complex inner-product spaces H,K and vectors x∈K, y∈H.

[F1]

The rank-one map acts by Az=⟨z,y⟩H,rootx (Dirac Notation Conversion).

[F2]

The root inner product is linear in the first argument, conjugate-linear in the second, and ∥v∥2=⟨v,v⟩ with ∥v∥≥0 (Real and complex inner-product spaces and their induced length).

[F3]

The adjoint is characterized by ⟨Tv,w⟩=⟨v,T∗w⟩, and finite-dimensional adjoints exist uniquely (The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V, Every linear map between finite-dimensional inner product spaces has a unique adjoint).

[F4]

Singular values are the eigenvalues, with multiplicity, of ∣A∣=A∗A (The singular values of a linear map as the eigenvalues of the positive square root of T^*T).

[F6]

The trace norm sums all domain singular values (Trace Norm).

Proof

1.1givenF1F2F6

If x=0 or y=0, [F1] makes A=∣x⟩⟨y∣ the zero map. Then [F6] gives ∥A∥1=0, while [F2] gives ∥x∥∥y∥=0.

1.2F1F2F3algebra

Suppose x,y≠0. For z∈H and w∈K, [F1]–[F2] give ⟨Az,w⟩K=⟨z,y⟩H⟨x,w⟩K=⟨z,⟨w,x⟩Ky⟩H. Thus the adjoint identity [F3] gives A∗w=⟨w,x⟩Ky, and therefore A∗Az=∥x∥2⟨z,y⟩Hy.

2.1F2step 1.2algebra

Let e=y/∥y∥ and put λ=∥x∥2∥y∥2. Step 1.2 gives A∗Ae=λe and A∗Az=0 whenever z⊥e. Every z∈H has the decomposition z=⟨z,e⟩e+(z−⟨z,e⟩e), whose second term is orthogonal to e; the two summands intersect only at 0. Therefore H=span⁡{e}⊕e⊥, and A∗A acts by λ on the first summand and by 0 on the second.

3.1F2F4F5F6step 1.1step 2.1algebra∎

Define R on the direct sum H=span⁡{e}⊕e⊥ by Re=∥x∥∥y∥e and Rz=0 for z⊥e, extending linearly. For z,w∈H, put c=⟨z,e⟩ and d=⟨w,e⟩. Then ⟨Rz,w⟩=∥x∥∥y∥cd‾=⟨z,Rw⟩, so R is self-adjoint; its eigenvalues are ∥x∥∥y∥ on span⁡{e} and 0 on e⊥. These eigenvalues are nonnegative, so [F5] makes R non-negative. It satisfies R2=A∗A by step 2.1. Uniqueness in [F5] gives R=∣A∣=A∗A. Its eigenvalues are ∥x∥∥y∥ once and 0 on e⊥, so [F4] and [F6] give ∥A∥1=∥x∥∥y∥. Together with step 1.1 this proves the formula, including zero vectors and zero-dimensional spaces.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Trace Norm Spectral Formula

Statement

For every linear map A:H→K (Linear map between vector spaces over the same field) between finite-dimensional complex inner-product spaces,

∥A∥1=tr⁡H ⁣(A∗A).

Here A∗A and its non-negative square root are endomorphisms of the domain H; the trace is taken on H.

Facts & Assumptions

Given: Finite-dimensional complex inner-product spaces H,K and a linear map A:H→K.

[F1]

The singular values of A are the eigenvalues of ∣A∣=A∗A, counted with multiplicity (The singular values of a linear map as the eigenvalues of the positive square root of T^*T).

[F3]

The trace of an endomorphism is the sum of its diagonal entries in any ordered basis, and the trace on the zero space is 0 (The basis-independent trace of an endomorphism of a finite-dimensional vector space).

[F4]

The trace norm is the sum of the singular values on the domain, including zeros (Trace Norm).

Proof

1.1givenF1F2F3choose

The operator ∣A∣=A∗A in [F1] is non-negative. By [F2], choose an orthonormal eigenbasis of H; its eigenvalues, with multiplicity, are exactly the singular values of A by [F1]. In that basis [F3] gives tr⁡H(∣A∣)=∑j<dim⁡Hsj(A).

2.1F3F4step 1.1∎

The sum in step 1.1 is ∥A∥1 by [F4]. If H=0, both are the empty sum 0 by [F3]–[F4]. This proves the formula for rectangular maps and all finite dimensions.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Trace Norm Unitary Invariance And Positive Formula

Statement

Let A:H→K be a linear map (Linear map between vector spaces over the same field) between finite-dimensional complex inner-product spaces. If U:K→K and V:H→H are unitary, then ∥UAV∥1=∥A∥1. If P:H→H is non-negative (positive semidefinite), then

∥P∥1=tr⁡H(P).

Here non-negative means self-adjoint with ⟨Pv,v⟩≥0 for all v, as in Non-negative and positive operators.

Facts & Assumptions

Given: The finite-dimensional spaces and maps in the Statement.

[F1]

An SVD writes Az=∑i<rsi⟨z,ei⟩fi, and the trace norm is the sum of those singular values; singular values are the eigenvalues of A∗A and are well-defined (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition, Trace Norm, The singular values of a linear map as the eigenvalues of the positive square root of T^*T, Singular values are well defined because the positive square root of T^*T is unique).

[F4]

Non-negative means self-adjoint with nonnegative quadratic form; such an endomorphism has an orthonormal eigenbasis with nonnegative real eigenvalues (Non-negative and positive operators, A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S).

[F5]

A non-negative endomorphism has a unique non-negative square root (A non-negative operator has a unique non-negative square root).

[F6]

The trace of an endomorphism is the sum of diagonal entries in any basis, and is 0 on the zero space (The basis-independent trace of an endomorphism of a finite-dimensional vector space).

Proof

1.1F1F2F3choosealgebra

Choose an SVD of A as in [F1], with domain basis (ej) and codomain basis (fi). By [F2], (V∗ej) and (Ufi) are orthonormal bases. For every z∈H, [F3] gives UAVz=∑j<rsj⟨Vz,ej⟩Ufj=∑j<rsj⟨z,V∗ej⟩Ufj. This is an SVD of UAV with the same positive singular values, so [F1] gives ∥UAV∥1=∥A∥1.

1.2F1F4F5choosealgebra

Let P be non-negative. By [F4], choose an orthonormal eigenbasis (ej) with Pej=λjej and λj≥0. Since P∗=P, P∗P=P2. The operator P is a non-negative square root of P2, so uniqueness [F5] gives P∗P=P. Its singular values are therefore the λj; by [F1] the trace norm is ∑jλj.

2.1F1F6step 1.2∎

Computing the trace in the same basis by [F6] gives tr⁡H(P)=∑jλj=∥P∥1. If H=0, both sums are empty and equal 0. This proves both assertions.

PropositionStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Trace Holder Inequality

Statement

For finite-dimensional complex inner-product spaces H,K and compatible linear maps A,B:H→K (Linear map between vector spaces over the same field), the composite B∗A is an endomorphism of H and

∣tr⁡H(B∗A)∣≤∥A∥1 ∥B∥.

Facts & Assumptions

Given: The finite-dimensional spaces and maps in the Statement.

[F1]

Trace-norm duality says ∥A∥1=max⁡∥C∥≤1∣tr⁡H(C∗A)∣ (Trace Norm Duality And Norm Properties).

[F2]

The operator norm is 0 when H=0 and otherwise is defined as the maximum of ∥Bv∥ over unit vectors (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).

[F3]
[F4]

The trace is computed by diagonal sums in any ordered basis and vanishes on the zero space (The basis-independent trace of an endomorphism of a finite-dimensional vector space).

[F5]

The root inner product is linear in its first argument, and the induced length satisfies ∥v∥2=⟨v,v⟩ (Real and complex inner-product spaces and their induced length).

[F7]

An SVD expresses B using its positive singular values and orthonormal domain and codomain vectors (Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition).

[F8]

For an orthonormal basis, the sum of the squared coordinate moduli equals the squared vector length, including the empty-basis case (Bessel's inequality for a finite orthonormal list and Parseval's identity for an orthonormal basis).

[F9]

In an ordered basis, the j-th matrix column of an endomorphism is the coordinate column of its image on the j-th basis vector (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases).

Proof

1.1givenF2F3F4F7F8algebra

Put β=∥B∥. If H=0, [F2] defines β=0. If H≠0, choose an SVD of B from [F7], with positive singular values t1≥⋯≥tq>0 and orthonormal domain vectors (uj). If q>0, [F8] gives ∥Bv∥2=∑j≤qtj2∣⟨v,uj⟩∣2≤t12 for every unit vector v, with equality at u1. If q=0, the SVD gives B=0, and every unit vector attains 0. Thus the maximum in [F2] exists in all cases. When β=0, every unit vector has Bv=0; scaling and linearity give B=0 (also when H=0). By [F3], B∗=0, and then B∗A=0, whose trace is 0 by [F4]; both sides of the inequality are 0.

2.1F1F2F5step 1.1algebra

Suppose β>0 and put C=B/β. For every unit vector v, ∥Cv∥2=⟨β−1Bv,β−1Bv⟩=β−2∥Bv∥2, so nonnegativity gives ∥Cv∥=∥Bv∥/β≤1 by [F2]. Applying the argument in step 1.1 with C in place of B shows its defining maximum exists and is at most 1, hence ∥C∥≤1. Trace-norm duality [F1] gives ∣tr⁡H(C∗A)∣≤∥A∥1.

3.1F3F4F6F9step 2.1algebra∎

Since β is a positive real, [F3] gives C∗=β−1B∗. Fix an ordered basis of H. The coordinate column of β−1(B∗A)ej is β−1 times the coordinate column of (B∗A)ej, by uniqueness of coordinates and [F9]; hence their diagonal entries have the same scaling. Summing them by [F4] gives tr⁡H(C∗A)=β−1tr⁡H(B∗A). Thus step 2.1 and modulus homogeneity [F6] yield β−1∣tr⁡H(B∗A)∣≤∥A∥1. Multiplying by β proves the inequality when β>0; step 1.1 proves the β=0 case.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Hermitian Trace Norm Positive Negative Parts

Statement

Let H be a finite-dimensional complex inner-product space and let X:H→H be self-adjoint. There are non-negative endomorphisms X+,X− such that

X=X+−X−,⟨X+u,X−v⟩=0(u,v∈H),

and

∥X∥1=tr⁡(X+)+tr⁡(X−).

If tr⁡(X)=0, then ∥X∥1=2tr⁡(X+)=2tr⁡(X−).

The trace norm is the finite singular-value norm from Trace Norm.

Facts & Assumptions

Given: A finite-dimensional complex inner-product space H and a self-adjoint endomorphism X:H→H.

[F2]

The inner product is linear in its first argument, conjugate-symmetric, and its induced length satisfies ⟨v,v⟩=∥v∥2 (Real and complex inner-product spaces and their induced length).

[F4]

For self-adjoint H, the trace norm is the trace of H∗H (Trace Norm Spectral Formula).

[F5]
[F6]

Every vector expands in a finite orthonormal basis, including the empty basis (Bessel's inequality for a finite orthonormal list and Parseval's identity for an orthonormal basis).

[F7]

A non-negative endomorphism has a unique non-negative square root (A non-negative operator has a unique non-negative square root).

[F8]

The adjoint identity is ⟨Tv,w⟩=⟨v,T∗w⟩ (The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V).

[F9]

A linear map preserves linear combinations (Linear map between vector spaces over the same field).

Proof

1.1givenF1F2F8choose

By [F1], choose an orthonormal eigenbasis (ej)j<n with Xej=λjej. Self-adjointness and conjugate symmetry give λj=⟨Xej,ej⟩=⟨ej,X∗ej⟩=⟨ej,Xej⟩=⟨Xej,ej⟩‾, so every λj is real.

2.1F2F3F6F9step 1.1algebraconstruct

For v∈H, define X+v=∑j<nmax⁡(λj,0)⟨v,ej⟩ej and X−v=∑j<nmax⁡(−λj,0)⟨v,ej⟩ej. These are linear by the first-slot rule [F2] and the finite-sum definition [F9]. Their diagonal entries are real and nonnegative. If v=∑jcjej, then [F2] gives ⟨X+v,v⟩=∑jmax⁡(λj,0)∣cj∣2≥0, and the same calculation applies to X−. Thus [F3] makes both operators non-negative. Every X+u is a linear combination of basis vectors with λj>0, while every X−v is a linear combination of basis vectors with λj<0; these subsets of the orthonormal basis are orthogonal. Thus ⟨X+u,X−v⟩=0 for all u,v. On every ej, (X+−X−)ej=λjej=Xej, hence X=X+−X−.

3.1F3F4F5F7step 1.1step 2.1algebra

In this basis X∗X=X2 has eigenvalues λj2. Define R by Rej=∣λj∣ej. Its diagonal entries are nonnegative, so [F3] makes it non-negative, and R2=X∗X; uniqueness [F7] therefore gives R=X∗X. Thus [F4]–[F5] give ∥X∥1=∑j∣λj∣, tr⁡(X+)=∑λj>0λj, and tr⁡(X−)=∑λj<0(−λj). Their latter two sums add to ∑j∣λj∣, proving the trace-norm identity.

4.1F5step 3.1algebra∎

If tr⁡(X)=0, [F5] gives ∑jλj=0. Hence the sum of positive eigenvalues equals the sum of absolute values of negative eigenvalues. Step 3.1 then yields ∥X∥1=2tr⁡(X+)=2tr⁡(X−). If n=0, all sums are empty and the identities still hold.

5 · Examples, counterexamples and false statements

None yet.

Sources