Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-22 rests on unproved material
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. Every dependency marked below is recorded with a citation but 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.

Fredholm determinant of a trace-class operator

Definition

proof uses external results not yet established in this library

Assume the Axiom of Choice (The Axiom of Choice). Let H be a complex Hilbert space and let TS1(H) (Trace class operator). Choose a nuclear representation Tx=j1x,ujvj,j1ujvj<, and put M=span{uj,vj:j1} and S=TM. The Fredholm determinant of I+zT is

detH(I+zT):=DS(z),

where DS is the separable determinant recorded in Separable trace-class determinant theorem recorded externally . If H={0}, this definition gives detH(I+zT)=1.

The well-definedness argument below proves that this restriction preserves the trace, trace norm, nonzero singular values, and nonzero generalized-eigenvalue data, and that the resulting determinant is independent of the nuclear representation and separable reducing support.

Well-definedness

Nuclear representations exist by Nuclear series characterizes trace norm. Finite rational-complex linear combinations of the vectors uj,vj form a countable dense subset of M, so M is separable. If xM, every coefficient in the nuclear series vanishes and Tx=0; if xM, every partial sum and hence Tx lies in the closed space M. Thus, using Orthogonal decomposition by a closed subspace,

H=MM,T=S0.

The restriction S is bounded and compact. Indeed, a bounded sequence in M is bounded in H. Since T is compact, its images have a norm-convergent subsequence by Sequential characterization of compact operators; the limit lies in the closed space M. The converse direction of that same characterization makes S:MM compact. Full AC supplies its DC hypothesis. The same nuclear series, now regarded inside M, therefore makes S trace class by Nuclear series characterizes trace norm. The nuclear trace formula in Trace is absolutely convergent and basis independent gives trM(S)=trH(T).

The block identity gives TT=SS0. Hence S0 is a compact positive square root of TT, and uniqueness in Positive square root of a compact positive operator gives T=S0. Therefore S and T have the same nonzero singular values, with multiplicities, and S1=T1.

For every λ0 and r1,

(TλI)r=(SλIM)r(λ)rIM.

Consequently all generalized λ-eigenvectors lie in M, and S and T have identical nonzero eigenvalues, generalized kernels, stabilization indices, and algebraic multiplicities. The external product formula therefore makes DS independent of the chosen nuclear representation and of every separable closed reducing support on whose orthogonal complement T is zero. No arbitrary invariant subspace is asserted to reduce T.

Depends on

Used by

Dependency tree · two levels

67 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