Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-22
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.

Lidskii trace formula for trace-class operators

Statement

Assume the Axiom of Choice. Let H be any complex Hilbert space, including H={0}, and let T∈S1(H). List all nonzero eigenvalues (λj(T)) with their finite algebraic multiplicities, where the multiplicity of λ≠0 is the dimension of the stabilized generalized kernel ⋃r≥1ker⁡(T−λI)r. Then ∑j∣λj(T)∣≤∥T∥1,tr⁡H(T)=∑jλj(T). The list is finite or countable and may be empty. No normality, self-adjointness, positivity, or separability of H is assumed.

Facts & Assumptions

Given: The Axiom of Choice, a complex Hilbert space H, and a trace-class operator T.

[F1]

The determinant definition preserves the nonzero generalized-eigenvalue data under separable-support reduction (Fredholm determinant of a trace-class operator).

[F2]

The determinant properties give absolute eigenvalue summability, DT(z)=∏j(1+zλj(T)) locally uniformly, and DT′(0)=tr⁡H(T) (Fredholm determinant properties for trace-class operators).

Proof

technique · direct
1.1F1F2givenalgebra

By [F1] and [F2], the eigenvalue list has the stated algebraic multiplicities and L:=∑j∣λj(T)∣≤∥T∥1. For a finite initial product PN(z)=∏j≤N(1+zλj), expansion and the ordered-tuple bound for elementary symmetric sums give ∣PN(z)−1−z∑j≤Nλj∣≤∑k=2N(∣z∣L)k/k!≤(∣z∣L)2e∣z∣L/2. Indeed, every unordered product of k distinct absolute eigenvalues occurs k! times among the ordered k-tuples contributing to Lk.

2.1F2step 1.1algebra∎

Let N→∞. The local product convergence and absolute convergence of ∑jλj from [F2] preserve the bound in step 1.1, so lim⁡z→0(DT(z)−1)/z=∑jλj(T). The left side is DT′(0)=tr⁡H(T) by [F2]. The same argument applies to finite and empty lists, with the empty sum equal to 0 and the empty product equal to 1.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

29 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