Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-22 rests on unproved material (inherited)
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.

Rests on 1 statement not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Separable trace-class determinant theorem recorded externally. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Lidskii trace formula for trace-class operators

Statement

proof uses external results not yet established in this library

Assume the Axiom of Choice. Let H be any complex Hilbert space, including H={0}, and let TS1(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 r1ker(TλI)r. Then jλj(T)T1,trH(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)=trH(T) (Fredholm determinant properties for trace-class operators).

Proof

technique · direct
1.1

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

F1F2givenalgebra
2.1

Let N. The local product convergence and absolute convergence of jλj from [F2] preserve the bound in step 1.1, so limz0(DT(z)1)/z=jλj(T). The left side is DT(0)=trH(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.

F2step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

24 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