Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Rank-one operator calculus

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a complex Hilbert space with the pairing linear in the first argument (Hilbert space, Real and complex inner-product spaces and their induced length), and for u,v∈H let

Tu,vx:=⟨x,v⟩u(x∈H).

Then:

(a) Tu,v∈B(H) with ∥Tu,v∥=∥u∥ ∥v∥ (A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum), and the assignment (u,v)↦Tu,v is linear in u and conjugate-linear in v;

(b) Tu,v is trace class (Trace class operator) with ∥Tu,v∥1=∥u∥ ∥v∥ and tr⁡(Tu,v)=⟨u,v⟩;

(c) Tu,v∗=Tv,u (The Hilbert-space adjoint of a bounded operator); Tx,x is a positive bounded operator in the sense of Self-adjoint, positive, unitary and normal operators, with ⟨Tx,xy,y⟩=∣⟨y,x⟩∣2≥0 for every y∈H, and tr⁡(Tx,x)=∥x∥2, ∥Tx,x∥1=∥x∥2;

(d) for bounded B∈B(H), BTu,v=TBu,v and Tu,vB=Tu,B∗v;

(e) for trace-class S, STu,v=TSu,v, Tu,vS=Tu,S∗v and tr⁡(STx,y)=⟨Sx,y⟩=tr⁡(Tx,yS);

(f) the map (u,v)↦Tu,v is continuous H×H→S1(H) for the trace norm, so in particular v↦Tv,v and v↦Tu,v are trace-norm continuous for fixed u.

Scope. Only the rank-one calculus is asserted; no spectral, compactness or ideal statement beyond (b) is claimed, and no physical interpretation is attached.

Facts & Assumptions

Given: A complex Hilbert space H with pairing linear in the first argument; vectors u,v,x,y,w,z∈H; a bounded operator B; a trace-class operator S.

[F1]

A compact operator T is trace class when ∑nsn(T)<∞, with trace norm ∥T∥1=∑nsn(T); then ∥T∥1≥∥T∥, the zero operator is trace class, and every bounded finite-rank operator is compact (Trace class operator, Bounded finite rank operators are compact).

[F2]

T is trace class if and only if it has a nuclear representation Tx=∑j⟨x,uj⟩vj converging in operator norm with ∑j∥uj∥ ∥vj∥<∞; then ∥T∥1=inf⁡∑j∥uj∥ ∥vj∥ over all such representations, the infimum being attained (Nuclear series characterizes trace norm).

[F3]

For every nuclear representation T=∑jTvj,uj of a trace-class operator, the scalar series ∑j⟨vj,uj⟩ converges absolutely to a number tr⁡(T) independent of the representation, the trace is linear in the trace-class variable, and ∣tr⁡(T)∣≤∥T∥1 (Trace is absolutely convergent and basis independent).

[F4]

The Hilbert adjoint is characterised by ⟨Bx,y⟩=⟨x,B∗y⟩ for all x,y and is unique; the pairing is linear in the first argument and conjugate-linear in the second with ⟨x,y⟩=⟨y,x⟩‾, and ∣⟨x,y⟩∣≤∥x∥ ∥y∥ (The Hilbert-space adjoint of a bounded operator, Real and complex inner-product spaces and their induced length, Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors).

[F5]

On the trace-class operators ∥⋅∥1 is a norm, they form a Banach space, and ∥T∥≤∥T∥1 and ∥ATB∥1≤∥A∥ ∥T∥1∥B∥ (Trace class is a two sided Banach operator ideal).

[F6]

The operator norm is ∥B∥=sup⁡∥x∥≤1∥Bx∥ for bounded B; a bounded operator is positive when its quadratic-form values are real and nonnegative (The operator norm as the least bound and as the unit-sphere or unit-ball supremum, A bounded linear operator between normed spaces, Self-adjoint, positive, unitary and normal operators).

Proof

1.1givenF4F6algebra

[Boundedness, norm and linearity] Tu,v is linear and ∥Tu,vx∥=∣⟨x,v⟩∣ ∥u∥≤∥x∥ ∥v∥ ∥u∥ by [F4], so ∥Tu,v∥≤∥u∥ ∥v∥ [F6]; if u≠0 and v≠0, taking x=v/∥v∥ gives Tu,vx=∥v∥u and hence ∥Tu,v∥≥∥u∥ ∥v∥, while for u=0 or v=0 the operator vanishes and both sides are 0. Linearity in u and conjugate-linearity in v are immediate from the definition and the pairing conventions [F4].

2.1step 1.1F1F2F5algebra

[Trace class and trace norm] The range of Tu,v is contained in Cu, so Tu,v has rank at most one, is finite rank, compact [F1]; its one-term nuclear representation is Tu,v=∑jTvj,uj with v1=u, u1=v and the remaining terms zero, so ∑j∥uj∥ ∥vj∥=∥v∥ ∥u∥ and [F2] first establishes trace class and gives ∥Tu,v∥1≤∥u∥ ∥v∥, while ∥Tu,v∥1≥∥Tu,v∥=∥u∥ ∥v∥ by [F5] and step 1.1. Hence ∥Tu,v∥1=∥u∥ ∥v∥.

3.1step 2.1F3algebra

[The trace] Applying [F3] to the one-term nuclear representation of step 2.1 gives tr⁡(Tu,v)=∑j⟨vj,uj⟩=⟨u,v⟩. In particular tr⁡(Tx,x)=⟨x,x⟩=∥x∥2 and, with step 2.1, ∥Tx,x∥1=∥x∥2.

3.2step 1.1step 2.1F4F6algebra

[Adjoint, positivity and one-sided products] For all x,y, ⟨Tu,vx,y⟩=⟨x,v⟩⟨u,y⟩=⟨x,⟨y,u⟩v⟩ by [F4], so Tu,v∗=Tv,u; in particular Tx,x is self-adjoint, and ⟨Tx,xy,y⟩=∣⟨y,x⟩∣2≥0 for every y, so it is positive by [F6]. For bounded B: (BTu,v)x=B(⟨x,v⟩u)=⟨x,v⟩Bu=TBu,vx and (Tu,vB)x=⟨Bx,v⟩u=⟨x,B∗v⟩u=Tu,B∗vx, using the defining property of the adjoint [F4].

3.3step 1.1step 2.1F5algebra

[Trace-norm continuity] By the bilinearity of step 1.1, Tu,v−Tu′,v′=Tu−u′,v+Tu′,v−v′; by [F5] and the estimates of steps 1.1 and 2.1, ∥Tu,v−Tu′,v′∥1≤∥u−u′∥ ∥v∥+∥u′∥ ∥v−v′∥, which tends to 0 whenever (u′,v′)→(u,v) in H×H; hence (u,v)↦Tu,v is continuous into S1(H), and fixing one slot gives the stated continuity. This is (f).

4.1step 3.1step 3.2F3F4algebra∎

[Products with trace-class operators] If S is trace class then (STu,v)x=⟨x,v⟩Su=TSu,vx and (Tu,vS)x=⟨Sx,v⟩u=⟨x,S∗v⟩u=Tu,S∗vx, so STu,v=TSu,v and Tu,vS=Tu,S∗v [F4]; applying step 3.1 to the rank-one operators TSu,v and Tu,S∗v gives tr⁡(STx,y)=⟨Sx,y⟩ and tr⁡(Tx,yS)=⟨x,S∗y⟩=⟨Sx,y⟩. This is (e); (a)-(d) are steps 1.1, 2.1, 3.1 and 3.2, and the scope remark records that nothing beyond the rank-one calculus is asserted.

Depends on

Dependency tree · 2 levels

Sources