Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Diagonal trace-class operators on ℓ2(N,C)

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let H:=ℓ2(N,C) be the space of square-summable complex families with its pairing, norm and induced metric (Square-summable families on an arbitrary index set and the space ℓ2(I), Real and complex inner-product spaces and their induced length), and for n∈N let un∈H be the family that is 1 at n and 0 elsewhere. Then:

  1. H is a complex Hilbert space (Hilbert space) and (un)n∈N is a complete orthonormal family in H (Orthonormal families, complete orthonormal systems and Hilbert bases).
  2. For every bounded complex sequence c=(cn)n∈N the series Dcx:=∑n∈Ncn⟨x,un⟩un converges in H for every x∈H, and Dc is a bounded linear operator with Dcun=cnun and ∥Dc∥≤sup⁡n∣cn∣ (A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum). For bounded c,c′ and λ∈C, Dc+Dc′=Dc+c′,λDc=Dλc,DcDc′=Dcc′, with D0=0 and D(1)=IH the zero and identity operators of H, and Dc is boundedly invertible if and only if inf⁡n∣cn∣>0; in that case Dc−1=Dc−1.
  3. If in addition ∑n∈N∣cn∣<+∞, then Dc is trace class (Trace class operator) with ∥Dc∥1=∑n∈N∣cn∣ and tr⁡(Dc)=∑n∈Ncn (Trace of a trace class operator), and its nonzero eigenvalues, repeated according to algebraic multiplicity (Algebraic multiplicity of a nonzero compact-operator eigenvalue), are exactly the nonzero scalars of the list (cn)n∈N, each nonzero λ occurring exactly #{n:cn=λ} times.

Facts & Assumptions

Given: AC; the square-summable space H=ℓ2(N,C) with its coordinate vectors un; a bounded complex sequence c, and in the final part a summable one with ∑n∣cn∣<+∞.

[A1]

AC is the axiom of choice, and it implies Dependent Choice and Countable Choice (The Axiom of Choice, AC implies DC implies countable choice).

[A2]

On ℓ2(N,C) the vector operations are pointwise, Q(a):=∑n∣an∣2 is the supremum of the finite subsums and ∥a∥2=Q(a) for a∈H, the pairing is ⟨a,b⟩=∑nanbn‾, linear in the first and conjugate-linear in the second argument with ⟨a,a⟩=∥a∥2; for nonnegative families ∑ncn=∑n∈Fcn+∑n∉Fcn for every finite F; if ∑ncn<+∞ then for every real ε>0 there is a finite F with ∑n∉Fcn<ε; and un is the family that is 1 at n and 0 elsewhere (Square-summable families on an arbitrary index set and the space ℓ2(I)).

[A3]

Cauchy–Schwarz gives ∣⟨x,y⟩∣≤∥x∥ ∥y∥, and squaring is monotone on the nonnegative reals: 0≤u≤v implies u2≤v2 (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs, Squaring is monotone on the nonnegatives).

[A4]

The induced length of an inner-product space is a norm, so it satisfies the triangle inequality and vanishes only at 0; its metric is the metric of convergence used below (The induced length is a norm, Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R, Real and complex inner-product spaces and their induced length).

[A5]

Bessel's inequality: for an orthonormal family (ei)i∈I and every x, ∑i∣⟨x,ei⟩∣2≤∥x∥2, so the coefficient family lies in ℓ2(I,C) (The Bessel inequality for an arbitrary orthonormal family).

[A6]

Summation theorem: for an orthogonal family (xi) with ∑i∥xi∥2<+∞ the finite-subset net ∑i∈Fxi converges to a vector s with ∥s∥2=∑i∥xi∥2; in particular, for an orthonormal family (ei) and a∈ℓ2(I,C) the net ∑i∈Faiei converges to s with ∥s∥2=∑i∣ai∣2 and ⟨s,ej⟩=aj for every j (Square-summable orthogonal families have norm-convergent finite sums).

[A7]

Fourier expansion: in a complete orthonormal family (ei) every x equals the norm limit of the net ∑i∈F⟨x,ei⟩ei, and the coefficients are unique (Fourier expansion in a Hilbert space, Orthonormal families, complete orthonormal systems and Hilbert bases).

[A8]

Orthonormal means ⟨ei,ej⟩=δij; every finite subfamily of an orthonormal family is linearly independent and coefficients in a finite expansion are unique; the span of a family is the set of its finite linear combinations and is a linear subspace, and the family is complete when that span is dense (Orthonormal families, complete orthonormal systems and Hilbert bases, Linear independence: a finite list v:n→V is independent when ∑i<nλivi=0V forces every λi=0F, and a subset S⊆V is independent when every injective finite list into S is independent).

[A9]

A bounded linear operator satisfies ∥Sx∥≤∥S∥ ∥x∥ with ∥S∥ the unit-ball supremum; a bounded operator on a normed space is continuous on convergent nets (A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[A11]

Algebra of limits: sums, scalar multiples and products of finitely many convergent real sequences converge to the corresponding combinations of the limits; with componentwise convergence in C this gives the same statements for finitely many convergent complex sequences (Algebra of limits: sums, scalar multiples, products and quotients, The complex plane is complete, and convergence is equivalent to convergence of real and imaginary parts).

[A12]

A Hilbert space is a complete inner-product space, hence a Banach space: every Cauchy sequence converges (Hilbert space, Banach space, Complete metric space: every Cauchy sequence converges in the space).

[A13]

A net in a Hausdorff space has at most one limit; and if two nets in a normed space converge, then the net of termwise sums converges to the sum of the limits by the triangle inequality (A topological space is Hausdorff if and only if every net has at most one limit, The induced length is a norm).

[A14]

Bounded finite-rank operators are compact, and a norm limit of compact operators is compact (Bounded finite rank operators are compact, Norm limit of compact operators is compact).

[A15]

Nuclear series: a compact operator is trace class exactly when it has a nuclear representation, and then ∥T∥1 is the infimum of the nuclear sums, attained by the singular-value series (Nuclear series characterizes trace norm, Trace class operator).

[A16]

Trace: for a supplied Hilbert basis E of H the family (⟨Te,e⟩)e∈E is absolutely summable, and tr⁡E(T)=∑e∈E⟨Te,e⟩ agrees with the basis-independent tr⁡(T) (Trace of a trace class operator, Trace is absolutely convergent and basis independent).

[A17]

Algebraic multiplicity: for a compact operator and a nonzero spectral value λ, the generalized eigenspace is the stabilized kernel ker⁡(T−λI)m and malg(λ;T) is its dimension (Algebraic multiplicity of a nonzero compact-operator eigenvalue).

[A18]

Weyl's inequality: for a compact operator on a complex Hilbert space, whose nonzero eigenvalues are listed with algebraic multiplicity and ordered by decreasing modulus, ∑j∣λj∣≤∥T∥1 whenever T is trace class (Weyl product and sum inequalities for compact operators).

[A19]

A finite-dimensional space has a well-defined dimension, the common cardinality of all its bases, and the span of k linearly independent vectors has dimension k (Finite-dimensional vector space, and its dimension dim⁡FV; infinite-dimensional means having no finite basis, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).

Proof

technique · direct

Given: AC; the space H=ℓ2(N,C) with coordinate vectors un; bounded complex sequences c, c′; a scalar λ; and, from step 7.2 on, ∑n∣cn∣<+∞.

1.1A2A8algebra

By [A2] every family in H has pointwise coordinates, and for the coordinate vectors the finite-subset description of the pairing gives ⟨un,um⟩=∑kun(k)um(k)‾=un(n)um(n)‾=δnm, all other terms being 0; in particular ∥un∥=1 and un≠0.

2.1A2A3step 1.1

For x∈H and n∈N the pairing with un picks out the n-th coordinate, ⟨x,un⟩=∑kxkun(k)‾=xn, so by Cauchy–Schwarz and step 1.1 ∣xn∣=∣⟨x,un⟩∣≤∥x∥ ∥un∥=∥x∥.

2.2A2A3A7A8step 1.1algebra

The span of (un) is dense in H: given x∈H and a real ε>0, the finite sum ∑n∣xn∣2=∥x∥2 is finite, so by the small-tail property [A2] there is a finite F with ∑n∉F∣xn∣2<ε2. The vector s:=∑n∈Fxnun lies in the span [A8], and the difference x−s has coordinates 0 on F and xn off F, so the splitting identity gives ∥x−s∥2=∑n∉F∣xn∣2<ε2 and therefore ∥x−s∥<ε by [A3]. Hence (un) is a complete orthonormal family in H.

3.1A2A3A4A10A11A12step 2.1algebra

Let (a(m))m∈N be a Cauchy sequence in H; for every n step 2.1 applied to the differences a(m)−a(p)∈H (pointwise operations, [A2]) gives ∣an(m)−an(p)∣≤∥a(m)−a(p)∥, so each coordinate sequence is Cauchy in C and converges to a scalar an by [A10]. Fix a real ε>0 and M with ∥a(m)−a(p)∥≤ε for all m,p≥M. For a finite F⊆N the sum ∑n∈F∣an(p)−an(M)∣2 tends, as p→∞, to ∑n∈F∣an−an(M)∣2 by [A11] applied to the finitely many coordinates, while every finite subsum of a square sum is at most that square sum [A2], so each value is at most ∥a(p)−a(M)∥2≤ε2; hence ∑n∈F∣an−an(M)∣2≤ε2. Taking the supremum over finite F gives Q(a−a(M))≤ε2<+∞, so a−a(M)∈H with ∥a−a(M)∥≤ε by [A3], and a=a(M)+(a−a(M))∈H; then for every m≥M the triangle inequality [A4] gives ∥a(m)−a∥≤∥a(m)−a(M)∥+∥a(M)−a∥≤2ε. Thus a(m)→a and H is complete, hence a complex Hilbert space.

4.1A2A5A6A9step 3.1step 2.2

Let c be bounded with C:=sup⁡n∣cn∣, and let x∈H. The coefficients bn:=cn⟨x,un⟩ satisfy ∑n∣bn∣2≤C2∑n∣⟨x,un⟩∣2≤C2∥x∥2<+∞ by Bessel [A5], so by the summation theorem [A6] applied to the orthonormal family (un) in the Hilbert space H the net ∑n∈Fbnun converges to a vector Dcx∈H with ∥Dcx∥2=∑n∣bn∣2≤C2∥x∥2. Thus Dc is a well-defined map H→H satisfying ∥Dcx∥≤C∥x∥ for every x.

5.1A2A7A8A13step 4.1

Additivity and homogeneity: for x,y∈H and finite F, additivity of the pairing in its first argument [A2] gives ∑n∈Fcn⟨x+y,un⟩un=∑n∈Fcn⟨x,un⟩un+∑n∈Fcn⟨y,un⟩un; the two nets on the right converge to Dcx and Dcy, so by [A13] the left net converges to Dcx+Dcy, and uniqueness of limits [A13] together with the defining series of step 4.1 gives Dc(x+y)=Dcx+Dcy. The same computation with λx in place of x+y gives Dc(λx)=λDcx, so Dc is linear and therefore bounded with ∥Dc∥≤C by step 4.1. For a coordinate vector the coefficient family of um is supported at m with value cm (unique coefficients, [A8]), so its finite-subset net is eventually constant at cmum and Dcum=cmum; in particular D(1) is the identity of H by the Fourier expansion [A7], the constant sequence 1 being bounded.

6.1A2A6step 4.1step 5.1

Operator identities: fix x∈H and a bounded c′. Applying the coefficient clause of [A6] to the vector Dc′x gives ⟨Dc′x,un⟩=cn′⟨x,un⟩ for every n, so by step 4.1 the coefficient family of Dc′x for the operator Dc is cncn′⟨x,un⟩ and DcDc′x=∑ncncn′⟨x,un⟩un=Dcc′x. Likewise the finite sums for Dc+c′ and for Dc+Dc′ have equal terms, since (cn+cn′)⟨x,un⟩=cn⟨x,un⟩+cn′⟨x,un⟩, so Dc+Dc′=Dc+c′; and Dλcx=λDcx by homogeneity of the coefficients. As x, c and c′ were arbitrary, DcDc′=Dcc′, Dc+Dc′=Dc+c′ and λDc=Dλc.

7.1A2A4A9step 1.1step 5.1step 6.1algebra

Invertibility criterion: suppose inf⁡n∣cn∣>0. Then no cn vanishes, the reciprocal sequence c−1=(cn−1) is bounded with sup⁡n∣cn−1∣=(inf⁡n∣cn∣)−1, and step 6.1 gives Dc−1Dc=Dc−1c=D(1)=I and DcDc−1=I by step 5.1, so Dc is boundedly invertible with inverse Dc−1. Conversely let S be a bounded two-sided inverse of Dc. If ∥S∥=0 then S=0 and I=SDc=0, contradicting u0=Iu0≠0 from step 1.1; hence ∥S∥>0, and for every n the operator bound [A9] gives 1=∥un∥=∥SDcun∥≤∥S∥ ∥cnun∥=∥S∥ ∣cn∣, so ∣cn∣≥∥S∥−1>0 for all n and inf⁡n∣cn∣>0.

7.2A2A8A14A15step 4.1step 6.1

Now assume ∑n∣cn∣<+∞. Put cn(m):=cn for n<m and cn(m):=0 for n≥m, and Rm:=Dc(m), so that Rmx=∑n<mcn⟨x,un⟩un lies in the span of u0,…,um−1 and Rm has finite rank and is compact [A8, A14]. By step 6.1 applied to the bounded sequences c(m) and c−c(m) one has Dc−Rm=Dc−c(m), so step 4.1 bounds ∥Dc−Rm∥≤sup⁡n≥m∣cn∣≤∑n≥m∣cn∣, and this tail tends to 0 by the small-tail property [A2] of the summable family (∣cn∣); therefore Dc is a norm limit of compact operators and is compact. Indexing the same finite-rank sums by the positive integers, Rm=∑j=1m⟨⋅,uj−1⟩ cj−1uj−1 with ∑j≥1∥uj−1∥ ∥cj−1uj−1∥=∑n∣cn∣<+∞, so the nuclear-series characterization [A15] makes Dc trace class with ∥Dc∥1≤∑n∣cn∣.

8.1A2A6A7A8A9A17A19step 5.1step 6.1step 7.2

Eigenvalues and multiplicities: let b be any bounded sequence and let λ∈C. By steps 5.1 and 6.1, Db−λI=Db−λ and (Db−λI)k=D(b−λ)k for every k≥1. For x∈H the norm identity of [A6] applied to the coefficient family ((bn−λ)k⟨x,un⟩)n gives ∥(Db−λI)kx∥2=∑n∣(bn−λ)k⟨x,un⟩∣2, so (Db−λI)kx=0 exactly when ⟨x,un⟩=0 for every n with bn≠λ; by the Fourier expansion [A7] these are exactly the vectors of the closed span of {un:bn=λ}, and conversely every vector of that closed span is killed by D(b−λ)k, because each such un is and bounded operators are continuous [A9]. Now take b=c summable and λ≠0. The index set {n:cn=λ} is finite: it is contained in {n:∣cn∣≥∣λ∣}, and if the latter were infinite the finite subsums of the nonnegative family (∣cn∣) would be unbounded, contradicting ∑n∣cn∣<+∞ [A2]. Hence its closed span is the algebraic span of finitely many orthonormal vectors, of dimension #{n:cn=λ} by [A8] and [A19], and since this kernel is the same for every k≥1 it is the stabilized kernel of [A17], so malg(λ;Dc)=#{n:cn=λ}. These are all the nonzero eigenvalues: if Dcx=λx with x≠0 and λ≠0, then some coefficient ⟨x,un⟩ is nonzero by [A7], and the identity above forces cn=λ.

9.1A2A16A18step 7.2step 8.1

Trace norm and trace: by step 7.2 the operator Dc is compact and trace class with ∥Dc∥1≤∑n∣cn∣, and step 8.1 identifies its nonzero eigenvalues with algebraic multiplicity, so their moduli are the terms ∣cn∣ over the indices with cn≠0. Weyl's inequality [A18] therefore gives ∑n∣cn∣=∑j∣λj∣≤∥Dc∥1, and with step 7.2 ∥Dc∥1=∑n∣cn∣. Since (un) is a supplied Hilbert basis of the Hilbert space H by steps 3.1 and 2.2, the trace theorem [A16] identifies tr⁡(Dc)=tr⁡(un)(Dc)=∑n⟨Dcun,un⟩=∑ncn, the family (cn) being absolutely summable by hypothesis.

10.1A1A2A6A7A14A15A16A17A18step 1.1step 2.2step 3.1step 4.1step 7.1step 7.2step 8.1step 9.1∎

Collecting the parts: claim 1 is steps 3.1 and 2.2, claim 2 is steps 4.1–7.1, and claim 3 is steps 7.2–9.1. The zero sequence c=0 gives D0=0 with ∥D0∥1=0=∑n∣cn∣, tr⁡(D0)=0 and an empty list of nonzero eigenvalues, so the conventions hold there; the finite-support and one-dimensional cases are instances of the general argument, and H≠{0} because u0≠0. AC is consumed only through the declared hypotheses of the cited suppliers: the Countable Choice clause of the summation theorem [A6], of the Fourier expansion [A7] and of the norm-limit clause of [A14], the Countable Choice hypotheses of the nuclear-series characterization [A15] and of the trace theorem [A16], and the AC hypotheses of the algebraic-multiplicity definition [A17] and of Weyl's inequality [A18]; the coordinate family (un) is explicit and the argument selects nothing further. Both directions of the invertibility criterion are proved in step 7.1, and the equality of the trace norm is obtained from the two inequalities of steps 7.2 and 9.1. No interval, endpoint or degenerate parameter occurs in the statement.

Depends on

Used by

Dependency tree · two levels

175 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources