Alphabeta Math
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.

✓ 16 results · all verified · 14 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Fredholm Determinants and the Lidskii Trace Formula

1 · Prerequisites

2 · Summary

This page builds a local Fredholm determinant theory for trace-class operators on complex Hilbert spaces. The construction begins on separable spaces with exterior powers and their induced operators; singular-value estimates and finite-rank compressions supply the trace-norm control needed for the determinant series. The resulting determinant is entire, normalized at zero, and has trace-norm continuity, growth, and multiplicativity properties.

The analytic results identify its logarithmic derivative and prove that its zeros occur exactly at the noninvertibility parameters, with order equal to the algebraic multiplicity of the corresponding nonzero eigenvalue. Algebraic multiplicity is defined through the stabilized generalized eigenspace of a compact operator. For the trace formula, a trace-class quasinilpotent operator has trace zero, and the generalized-eigenspace decomposition computes the trace through the nonzero eigenvalues. This decomposition uses invariant subspaces and quotient/compression arguments; invariance alone does not make a subspace reducing.

The trace-power and logarithmic-derivative argument gives the spectral product for the local determinant. A final support theorem extends the determinant to arbitrary complex Hilbert spaces by restricting to a separable reducing support, and proves that the value is independent of the chosen support. AC is stated where the nuclear representation, Hilbert projection, or spectral multiplicity inputs require it; the rank-one example separately records the library's linear-first inner-product convention.

The published determinant definition, its arbitrary-space properties, and Lidskii's trace formula now follow these local lemmas on this page. The definition uses the support construction; the properties transfer the local separable estimates and identities through common supports; and the trace formula differentiates the locally uniform product at zero.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

Algebraic multiplicity of a nonzero compact-operator eigenvalue

Definition

Assume the Axiom of Choice (The Axiom of Choice). Let T be a compact operator on a complex Hilbert space H, and let λ≠0 belong to its spectrum. Riesz–Schauder stabilization supplies an integer m0 for which the kernels of (I−T/λ)m are constant for m≥m0. Define the generalized eigenspace and algebraic multiplicity by

Gλ(T):=ker⁡(T−λI)m0,malg(λ;T):=dim⁡Gλ(T).

The value is independent of the choice of stabilized exponent. If Pλ is the Riesz spectral projection of T at λ, then Gλ(T)=ran⁡Pλ; in particular the algebraic multiplicity is the finite rank of that projection.

Facts & Assumptions

Given: AC; a complex Hilbert space H; a compact T:H→H; and λ≠0 in σ(T).

[A1]

For compact T, each nonzero spectral value is an eigenvalue with finite-dimensional generalized eigenspace (Riesz schauder spectrum of a compact operator).

[A2]

For every ε>0, only finitely many spectral values of a compact operator have modulus at least ε (Riesz schauder spectrum of a compact operator).

[A3]

If A=I−K with K compact on a Banach space and DC holds, the kernels of Am stabilize at a finite index (Riesz Schauder ascent and descent stabilize).

[A4]

For the isolated spectral set E={λ}, the Riesz spectral projection is defined as Pλ=χE(T) (Riesz spectral projection).

[A5]

The Riesz projection is idempotent, commutes with T, and splits H into its closed invariant range and kernel (Riesz spectral projection properties).

[A6]

If nonzero, the restriction spectra on ran⁡Pλ and ker⁡Pλ are respectively {λ} and σ(T)∖{λ} (Riesz spectral projection properties).

[A7]

A subspace W is T-invariant when T(W)⊆W (Invariant subspaces, restrictions, and induced quotient operators).

[A8]

A compact operator on an infinite-dimensional Banach space has 0 in its spectrum (Riesz schauder spectrum of a compact operator).

[A9]

Every nonconstant complex polynomial has a root (Fundamental theorem of algebra by Liouville's theorem); an endomorphism of a finite-dimensional space whose characteristic polynomial splits has a Jordan form (Jordan form over the base field exists exactly when the characteristic polynomial splits).

[A10]

Proof

technique · direct
1.1A1A3A10

With A=I−T/λ, we have T−λI=−λA. The declared AC assumption supplies DC by [A10], so [A3] gives an m0 for which ker⁡(T−λI)m=ker⁡Am is constant for every m≥m0; [A1] makes this stabilized space finite-dimensional.

1.2A2A4construct

Put ε=∣λ∣/2. By [A2] the set Sε={μ∈σ(T):∣μ∣≥ε} is finite. Every spectral point within distance ∣λ∣/2 of λ lies in Sε; because λ∈Sε, choose a smaller positive radius excluding the finitely many other points of Sε. Thus λ is isolated and [A4] defines Pλ.

2.1A4A5A6A7A8step 1.2

Let P=Pλ from [A4]. By [A5] and the meaning of invariant subspace in [A7], H=ran⁡P⊕ker⁡P with both summands closed and T-invariant. The restriction of T to ran⁡P is compact. If this range were infinite-dimensional, [A8] would put 0 in its restriction spectrum, contrary to [A6], which gives that spectrum as {λ} and λ≠0. Hence ran⁡P is finite-dimensional.

3.1A6A9step 2.1

If ran⁡P={0}, then P=0 and [A6] would give σ(T)=σ(T∣ker⁡P)=σ(T)∖{λ}, impossible since λ∈σ(T). Thus the range is nonzero. Its finite-dimensional restriction has spectrum {λ} by [A6]. By [A9], its characteristic polynomial splits over C and it has a Jordan form; all Jordan blocks have eigenvalue λ. Therefore (T−λI)d vanishes on ran⁡P, where d=dim⁡ran⁡P, so ran⁡P⊆Gλ(T).

4.1A5A6step 1.1step 2.1∎

Conversely, take x∈Gλ(T) and write x=Px+(I−P)x using [A5]. Since P commutes with T, the second term lies in ker⁡P and is killed by a power of T−λI. If ker⁡P≠{0}, [A6] says λ is outside the spectrum of T∣ker⁡P, so T−λI is invertible there and the second term is zero. If ker⁡P={0} it is zero directly. Hence x∈ran⁡P, and Gλ(T)=ran⁡P. The rank and dimension are finite by step 2.1, and step 1.1 proves independence of the stabilized exponent.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

Finite-rank orthogonal compressions converge in trace norm

Statement

Assume Countable Choice. Let H be a separable complex Hilbert space, let T∈S1(H) be trace class, and let (Pn)n≥1 be any supplied sequence of finite-rank orthogonal projections on H such that Pn→I strongly. Then ∥PnTPn−T∥1⟶0. The projections need not be increasing. For example, the initial projections onto the first n vectors of a supplied countable orthonormal basis satisfy the hypothesis.

Facts & Assumptions

Given: Countable Choice, separable complex H, trace-class T∈B(H), and the specified finite-rank orthogonal projections Pn.

[A1]

By the trace-class definition, a trace-class operator is compact (Trace class operator).

[A2]

Every finite-rank operator is trace class, and hence each SVD truncation FN is trace class (Trace class operator).

[A3]

Under Countable Choice the singular-value decomposition supplies orthonormal families (ej) and (fj) and the operator-norm convergent expansion Tx=∑jsj⟨x,ej⟩fj; its index set is finite exactly in the finite-rank case (Singular value decomposition for compact operators).

[A4]

If a trace-class operator R has a nuclear representation R=∑j⟨⋅,uj⟩vj converging in operator norm, then ∥R∥1≤∑j∥uj∥ ∥vj∥ (Nuclear series characterizes trace norm).

[A5]

Trace-class operators form a linear space and the trace norm satisfies the triangle inequality (Trace class is a two sided Banach operator ideal).

[A6]

For bounded A,B and trace-class R, ∥ARB∥1≤∥A∥ ∥R∥1 ∥B∥ (Trace class is a two sided Banach operator ideal).

[A7]

Each orthogonal projection Pn is self-adjoint (Hilbert projections are linear, self-adjoint and contractive).

[A8]

Each orthogonal projection satisfies ∥Pnx∥≤∥x∥, hence ∥Pn∥≤1 (Hilbert projections are linear, self-adjoint and contractive).

[A9]

Strong convergence means pointwise norm convergence: ∥Pnx−x∥→0 for every fixed x∈H (Strong and weak operator topologies).

[A10]

Countable Choice supplies the hypotheses of the trace-class, SVD, nuclear-series, ideal, orthogonal-projection, and Fourier-expansion results used below (The Axiom of Countable Choice (ACω)). Its explicit countable basis-selection use here is through the SVD in [A3], which selects bases of its countably many finite-dimensional singular eigenspaces; no orthonormal basis of the ambient H is separately chosen.

[A11]

The trace-class singular-value series converges, so its tails tend to zero (Trace class operator).

[A12]

The complex inner product is linear in its first argument, so for each positive real sj, ⟨x,sjej⟩=sj⟨x,ej⟩ (Real and complex inner-product spaces and their induced length).

[A13]

If (gj)j≥1 is a supplied countable complete orthonormal family, then the initial Fourier sums ∑j=1n⟨x,gj⟩gj converge to each x in norm (Orthonormal families, complete orthonormal systems and Hilbert bases, Fourier expansion in a Hilbert space).

[A14]

The orthogonal projection onto a closed subspace is characterized by PMx∈M and x−PMx∈M⊥ (The Hilbert orthogonal projection onto a closed subspace).

Proof

technique · direct

Given: The data in the statement and facts [A1]–[A14].

1.1A1A2A3A4A5A10A11

By [A1]–[A3] and [A10], write the SVD of T and let J be its positive-singular-value index set. For N≥0 set FN=∑j∈J, j≤Nsj⟨⋅,ej⟩fj, with F0=0. Since FN is trace class by [A2], [A5] makes RN:=T−FN trace class; the SVD gives the operator-norm convergent nuclear tail RN=∑j∈J, j>N⟨⋅,sjej⟩fj, so [A4] gives ∥RN∥1≤∑j>Nsj→0 by [A11]. If T has finite rank r, then RN=0 for N≥r; when T=0 or H={0} the sum is empty and FN=RN=0.

1.2A10A12A13A14

For the stated basis example, let (gj)j≥1 be the supplied complete orthonormal basis and let Pn project onto Mn:=span⁡{g1,…,gn}. The sum sn:=∑j=1n⟨x,gj⟩gj lies in Mn, and orthonormality plus [A12] gives x−sn∈Mn⊥, so [A14] gives sn=Pnx; now [A13] yields Pnx→x.

2.1A4A7A8A9A10A12step 1.1

Fix N and the finite SVD sum FN from step 1.1; by [A12] write it as FN=∑j∈J, j≤N⟨⋅,uj⟩vj, where uj=sjej and vj=fj. Self-adjointness in [A7] gives PnFNPn=∑j⟨⋅,Pnuj⟩Pnvj, so PnFNPn−FN=∑j(⟨⋅,Pnuj⟩(Pnvj−vj)+⟨⋅,Pnuj−uj⟩vj). This finite nuclear representation and [A4] bound its trace norm by ∑j∈J, j≤N(∥Pnuj∥ ∥Pnvj−vj∥+∥Pnuj−uj∥ ∥vj∥), which tends to zero by [A8]–[A9] and finiteness of the sum. Thus ∥PnFNPn−FN∥1→0 for each fixed N, including the empty sum when N=0 or T=0.

3.1A5A6A8A10step 1.1step 2.1

For every n,N, the residual RN from step 1.1 satisfies ∥PnRNPn∥1≤∥Pn∥2∥RN∥1≤∥RN∥1 by [A6] and [A8]. Decomposing PnTPn−T=PnRNPn+(PnFNPn−FN)−RN using step 2.1, and applying [A5]'s trace-norm triangle inequality, yields ∥PnTPn−T∥1≤2∥RN∥1+∥PnFNPn−FN∥1. All terms are trace class by [A5]–[A6].

4.1A3A10step 1.1step 2.1step 3.1∎

Given ε>0, choose N by step 1.1 so that ∥RN∥1<ε/4. For this fixed N, step 2.1 gives an index n0 such that ∥PnFNPn−FN∥1<ε/2 for every n≥n0. Step 3.1 then gives ∥PnTPn−T∥1<ε for every n≥n0, proving the claim. Countable Choice is the stated hypothesis of the trace-class, nuclear-series, ideal, orthogonal-projection, Fourier-expansion, and SVD suppliers in [A10]; the explicit countable basis selection used here is the SVD construction in [A3].

DefinitionDefinition: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

Hilbert exterior powers and induced operators

Definition

Let H be a complex Hilbert space and let n≥0. Set Λ0H:=C. For n≥1, the algebraic n-fold tensor product H⊗algn is the complex vector space generated by symbols x1⊗⋯⊗xn subject to complex linearity in each slot. Equivalently, it is the quotient of the free complex vector space on Hn by the span of the coordinate-wise additivity and scalar-linearity relations. Give it the sesquilinear form determined on elementary tensors by

⟨x1⊗⋯⊗xn,y1⊗⋯⊗yn⟩=∏i=1n⟨xi,yi⟩,

which is well defined because the product is linear in each first-slot vector and conjugate-linear in each second-slot vector. Complete H⊗algn in the induced norm to obtain the Hilbert tensor power H⊗n. Use the action convention Uπ(x1⊗⋯⊗xn)=xπ−1(1)⊗⋯⊗xπ−1(n) for π∈Sn. The Hilbert exterior power ΛnH is the range of the orthogonal projection

An:=1n!∑π∈Snsgn⁡(π)Uπ.

For x1,…,xn∈H, write x1∧⋯∧xn:=n! An(x1⊗⋯⊗xn). Its inner product is

⟨x1∧⋯∧xn,y1∧⋯∧yn⟩=det⁡[⟨xi,yj⟩]i,j=1n.

If T:H→H is bounded, its induced operator ΛnT is the restriction of T⊗n to ΛnH; equivalently (ΛnT)(x1∧⋯∧xn)=Tx1∧⋯∧Txn. Set Λ0T=IC. For every bound C of T, Cn is a bound for ΛnT, and Λn(ST)=ΛnS ΛnT for bounded S,T.

Facts & Assumptions

Given: A complex Hilbert space H (Hilbert space), an integer n≥0, and, when an induced operator is considered, a bounded linear operator T:H→H.

[A1]

The complex inner product is linear in its first argument and conjugate-linear in its second (Real and complex inner-product spaces and their induced length).

[A2]

The determinant of a square matrix is given by its finite signed permutation sum (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix).

[A3]

For bounded T there is C≥0 such that ∥Tx∥≤C∥x∥ for every x (A bounded linear operator between normed spaces).

[A4]

Every finite-dimensional real or complex inner-product space has a finite orthonormal basis, including the empty basis in dimension zero (Every finite-dimensional real or complex inner product space has an orthonormal basis).

[A5]

A supplied orthonormal basis is a complete orthonormal family, so its finite linear span is dense in H (Orthonormal families, complete orthonormal systems and Hilbert bases).

Proof

technique · direct
1.1A1A4construct

Fix n≥1. In any finite tensor sum, all factor vectors lie in a finite-dimensional subspace E⊆H. Choose a finite orthonormal basis (fj) of E by [A4]. Multilinearity expands the sum in the elementary tensors fj1⊗⋯⊗fjn; the product form makes these tensors orthonormal. Their linear independence follows by applying the multilinear coordinate functionals (x1,…,xn)↦∏r=1n⟨xr,fjr⟩, which descend to the quotient and extract their coefficients. Thus the form is positive definite on every finite tensor span. Its completion is the Hilbert tensor power H⊗n.

2.1step 1.1algebra

Each Uπ is unitary and UπUτ=Uπτ. Replacing π by π−1 in the adjoint sum gives An∗=An; grouping the n! pairs with product ρ gives An2=An. Thus An is an orthogonal projection and is bounded with norm at most 1 by the orthogonal decomposition into its range and kernel. Its range is closed. It is exactly the alternating subspace because the signed average is alternating and fixes every alternating tensor.

2.2A3A4step 1.1

Let C be any bound for T from [A3]. After permuting tensor factors, a finite tensor sum can be written ∑j=1mxj⊗yj with (yj) an orthonormal basis of the finite-dimensional span of its remaining-factor tensors. Its squared norm is ∑j∥xj∥2, while applying T in that factor gives squared norm ∑j∥Txj∥2≤C2∑j∥xj∥2. Since factor permutations are unitary, this proves the bound C for applying T in any one slot. Composing over the n slots extends T⊗n to the completion with bound Cn.

3.1A1A2step 2.1

By step 2.1 the normalized wedges are vectors in the alternating range. For pure tensors, self-adjointness and idempotence give ⟨n!Anx,n!Any⟩=n!⟨x,Any⟩. Expanding the signed average yields ∑π∈Snsgn⁡(π)∏i⟨xi,yπ(i)⟩, which is the determinant in [A2]. This proves the stated Gram formula and its positivity from the Hilbert-space norm.

3.2A3step 2.1step 2.2

On elementary tensors T⊗n commutes with every permutation, hence preserves ran⁡An and restricts to a bounded ΛnT with bound Cn. Its action on wedges is the displayed formula. Applying that formula twice proves Λn(ST)=ΛnS ΛnT on a dense span and therefore everywhere. For n=0 the space is C and the induced map is its identity; for n=1, A1=I and Λ1T=T. If T=0 and n≥1, its induced map is zero.

4.1A5step 2.1step 3.1construct∎

If (ej) is a supplied orthonormal basis of H, its finite span is dense by [A5]. Approximate the factors of each elementary tensor by finite linear combinations of the ej. The telescoping tensor identity and ∥x1⊗⋯⊗xn∥=∏r∥xr∥ show that elementary tensors in those finite spans are dense in H⊗n. Since An is bounded, their images are dense in ran⁡An. Applying An to a basis tensor gives zero if indices repeat and otherwise a signed multiple of the wedge with increasing indices. These wedges are orthonormal by step 3.1 and span a dense subspace, so they form an orthonormal basis of ΛnH. If H is finite-dimensional with n>dim⁡H, there are no increasing n-tuples and ΛnH={0}.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

Trace-norm bound for exterior powers of trace-class operators

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a separable complex Hilbert space and let T:H→H be trace class (Trace class operator). For every integer n≥0, the induced operator (ΛnT):ΛnH→ΛnH is trace class. If n≥1 and JT indexes the positive singular values (sj(T))j∈JT with multiplicity, then the positive singular values of ΛnT, with multiplicity, are {∏k=1nsjk(T):(j1,…,jn)∈JTn, j1<⋯<jn}. Consequently, ∥ΛnT∥1=∑j1<⋯<jnsj1(T)⋯sjn(T)≤∥T∥1nn!. For n=0, Λ0T=IC is trace class and tr⁡(Λ0T)=1; its singular-value list is 1 followed by zeros.

Facts & Assumptions

Given: ACω, a separable complex Hilbert space H, a trace-class operator T:H→H, and an integer n≥0.

[A1]

The wedge inner product is the Gram determinant (Hilbert exterior powers and induced operators).

[A2]

The exterior power is the range of the stated orthogonal antisymmetrizing projection (Hilbert exterior powers and induced operators).

[A3]

The wedge is defined by applying that projection to a tensor; the induced operator has the stated wedge action, is bounded, and is functorial (Hilbert exterior powers and induced operators).

[A4]

The SVD of T supplies a finite or countably infinite positive index set JT, positive singular values in nonincreasing order, orthonormal families (ej) and (fj), a Hilbert basis (ej) of (ker⁡T)⊥, the expansion Tx=∑jsj(T)⟨x,ej⟩fj, and a partial isometry U with T=U∣T∣ and U∗U the orthogonal projection onto (ker⁡T)⊥ (Singular value decomposition for compact operators).

[A5]

Under ACω, every at-most-countable family of nonempty sets has a choice function; the SVD is stated under this hypothesis and its proof selects bases from the countable family of finite-dimensional singular eigenspaces (The Axiom of Countable Choice (ACω), Singular value decomposition for compact operators).

[A6]

Trace class means compactness and ∥T∥1=∑jsj(T)<∞; ∥T∥=s1(T) and the singular values tend to zero when the list is infinite (Trace class operator, Absolute value and singular values of a compact operator).

[A7]

Under ACω, a norm limit of compact operators into a Banach space is compact (Norm limit of compact operators is compact).

[A8]

For a compact operator S, its positive singular values with multiplicity are the positive eigenvalues of ∣S∣=(S∗S)1/2 (Absolute value and singular values of a compact operator).

[A9]

A nonnegative family is summable when its finite subsums are bounded, and its sum is the supremum of those finite subsums; the finite power of a countable set and every subset of a countable set are countable (Square-summable families on an arbitrary index set and the space ℓ2(I), Every finite power of an at most countable set is at most countable, Every subset of an at most countable set is at most countable).

[A10]

For a trace-class operator, the basis-free trace equals the scalar sum of any nuclear representation (Trace is absolutely convergent and basis independent).

[A11]

The degree-zero exterior space is Λ0H=C (Hilbert exterior powers and induced operators).

[A12]

A complex Hilbert space is a complete inner-product space and hence a Banach space for its induced norm (Hilbert space).

[A13]

For a complete orthonormal family (ei)i∈I in a Hilbert space, Countable Choice and Parseval's theorem give ∑i∈I∣⟨x,ei⟩∣2=∥x∥2 for every x (Parseval equivalences for an orthonormal family).

[A14]

A bounded finite-rank operator whose range has a finite ordered basis is compact (Bounded finite rank operators are compact).

[A15]

The positive square root of a compact positive operator is unique, and positivity means its quadratic form is nonnegative (Positive square root of a compact positive operator, Self-adjoint, positive, unitary and normal operators).

[A16]

The Hilbert adjoint is characterized uniquely by ⟨Sx,y⟩=⟨x,S∗y⟩; in particular IC∗=IC by this identity and uniqueness (The Hilbert-space adjoint of a bounded operator, Hilbert-adjoint identities).

Choice accounting: The exact hypothesis is ACω. It supplies the countably many SVD eigenspace-basis choices [A4, A5] and is an explicit hypothesis of Parseval [A13]; the trace-class/singular-value definitions are stated under it [A6]; the adjoint and positive-square-root suppliers assume it [A15, A16]; the norm-limit compactness theorem uses it [A7]; and the basis-free trace theorem used in degree zero assumes it [A10]. No basis of all of H is selected: the proof uses only the SVD basis of (ker⁡T)⊥. Separability is retained from the assigned claim, though these arguments do not otherwise require it.

Proof

technique · direct

Given: The data in the statement, the positive singular-value index set JT, the SVD families (ej) and (fj), and P:=U∗U from [A4].

1.1A3A6A8A10A11A14A15A16

If n=0, [A11] gives Λ0H=C and [A3] gives Λ0T=IC. Its range has the one-element ordered orthonormal basis (1), so it is compact by [A14]. [A16] gives IC∗=IC; the identity is positive and its positive square root is itself, so [A15] gives ∣IC∣=IC. Thus its only positive singular value is 1, with the remaining sequence entries zero by [A8]. By [A6], IC is trace class and has trace norm 1. Now the rank-one nuclear representation ICx=⟨x,1⟩1 has scalar trace sum ⟨1,1⟩=1, so [A10] gives tr⁡(Λ0T)=1.

1.2A3A4A6

Henceforth let n≥1. If JT=∅, then T=0 by [A4], so ΛnT=0; the singular-value product family is empty and the trace norm and bound are both zero.

1.3A1A4A5

Suppose JT≠∅, put K:=(ker⁡T)⊥, and define In:={(j1,…,jn)∈JTn:j1<⋯<jn}. For each J=(j1<⋯<jn)∈In set ηJ:=ej1∧⋯∧ejn, θJ:=fj1∧⋯∧fjn, and μJ:=∏k=1nsjk(T). The Gram determinant in [A1] makes both families orthonormal.

1.4A6A9

Let F be any finite subset of In and choose N at least every index appearing in F. Expanding (∑j=1Nsj(T))n=∑(i1,…,in)∈{1,…,N}nsi1(T)⋯sin(T) shows it is at least n!∑J∈FμJ, because every increasing tuple in F contributes its n! distinct permutations and all other terms are nonnegative. The left side is at most ∥T∥1n by [A6]. Taking the supremum over finite F in [A9] proves ∑J∈InμJ≤∥T∥1n/n!.

2.1A1A2A3A4A5step 1.3

From the SVD expansion, (ej) is total in K: if x∈K is orthogonal to every ej, then Tx=0, so x∈K∩ker⁡T={0}. Thus finite linear combinations of (ej) are dense in K. Functoriality and T=TP give S:=ΛnT=SΛnP; the Gram identity and self-adjointness of P show ΛnP is self-adjoint, while functoriality and P2=P show it is idempotent. Its range is the closed span M of the ηJ: on dense decomposable wedges, ΛnP gives wedges of vectors in K, and approximating each such vector by finite linear combinations of (ej), then expanding by multilinearity, places that wedge in M. Continuity follows from the antisymmetrizer tensor construction in [A2]. Conversely, every ηJ is fixed by ΛnP. Thus ΛnP is the orthogonal projection onto M and S vanishes on M⊥.

3.1A2A3A4A5A6A7A12A13A14step 2.1

On each basis wedge, SηJ=μJθJ. For each N let SNx:=∑J∈In, jn≤NμJ⟨x,ηJ⟩θJ; this is bounded and finite rank, hence compact by [A14]. By [step 2.1], both S and SN vanish on M⊥, and (ηJ) is a complete orthonormal family in M, its closed span. For x∈M, Parseval [A13] and orthonormality of (θJ) give ∥(S−SN)x∥2=∑J: jn>NμJ2∣⟨x,ηJ⟩∣2≤(sN+1(T)s1(T)n−1)2∥x∥2, because each omitted tuple has largest index greater than N. Decomposing a general vector into M⊕M⊥ therefore gives ∥S−SN∥≤sN+1(T)s1(T)n−1 when JT is infinite. If JT is finite, SN=S for N≥∣JT∣. Therefore SN→S in operator norm and [A7] makes S compact. The target ΛnH is Banach by its Hilbert construction [A2, A12].

4.1A1A3A4A6A7A8A14A15A16step 2.1step 3.1

Define DηJ:=μJηJ on the orthonormal basis of M and set D=0 on M⊥; since 0≤μJ≤s1(T)n=∥T∥n, this diagonal rule extends boundedly. Its finite diagonal truncations DN (retaining only tuples with all indices at most N) have finite rank and are compact by [A14], and converge in norm by the coefficient estimate of [step 3.1] with output vectors ηJ instead of θJ. Thus [A7] makes D compact; its real nonnegative diagonal coefficients make it positive and self-adjoint. By [step 2.1, step 3.1] and the adjoint identity [A16], for x∈ΛnH the expansion of Sx in the θJ gives ⟨Sx,θJ⟩=μJ⟨x,ηJ⟩=⟨x,μJηJ⟩, hence S∗θJ=μJηJ and S∗SηJ=μJ2ηJ=D2ηJ; both operators vanish on M⊥, so S∗S=D2. Uniqueness of the compact positive square root in [A15] yields D=∣S∣ by the definition [A8].

5.1A4A6A8step 4.1

By [step 4.1], the positive eigenvalues of ∣S∣, counted with multiplicity, are exactly the values μJ over J∈In: the ηJ form a basis of its support M and D is diagonal there. By the compact-operator singular-value definition [A8], these are precisely the positive singular values of S=ΛnT; the remaining entries of its singular-value sequence are zero padding.

6.1A4A6A9step 5.1step 1.4∎

The tuple index set In is countable by [A9], and [step 5.1] identifies its nonnegative family, with multiplicities, with the singular values of S. Thus [step 1.4] says their singular-value series converges, so S is trace class by [A6] and its trace norm equals that sum. This proves the equality and factorial bound in the statement. If n exceeds the finite rank of T, In=∅ and S=0; if n=1, the tuples are single indices and the sum is exactly ∥T∥1.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

Weyl product and sum inequalities for compact operators

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let H be a complex Hilbert space and let T:H→H be compact (Hilbert space, Compact linear operator). List the nonzero eigenvalues of T, repeated according to algebraic multiplicity (Algebraic multiplicity of a nonzero compact-operator eigenvalue) and ordered so that ∣λ1(T)∣≥∣λ2(T)∣≥⋯; if this list is finite, pad it with zeros. Let s1(T)≥s2(T)≥⋯ be the zero-padded singular-value sequence (Absolute value and singular values of a compact operator). For every integer N≥0, with an empty product equal to 1 when N=0, ∏j=1N∣λj(T)∣≤∏j=1Nsj(T). If T is trace class (Trace class operator), then ∑j≥1∣λj(T)∣≤∑j≥1sj(T)=∥T∥1.

Facts & Assumptions

Given: AC, a complex Hilbert space H, a compact operator T:H→H, its eigenvalue list with algebraic multiplicity, and its singular-value list.

[A1]

AC is the choice-function axiom and supplies the prescribed-initial-point form of Dependent Choice used in the Riesz–Schauder supplier (The Axiom of Choice, AC supplies the countable and dependent choices used in Banach integration).

[A2]

AC implies Countable Choice, which supplies the narrower hypotheses of the SVD, singular-value, trace-class, and orthogonal-decomposition suppliers (AC supplies the countable and dependent choices used in Banach integration).

[A3]

Every nonzero spectral value of a compact operator is an eigenvalue with finite-dimensional generalized eigenspace, and only finitely many spectral values have modulus at least any fixed ε>0 (Riesz schauder spectrum of a compact operator).

[A4]

For each nonzero eigenvalue λ, its generalized eigenspace is Gλ(T)=ker⁡(T−λI)mλ for a stabilized exponent mλ, is finite-dimensional, and has dimension equal to its algebraic multiplicity (Algebraic multiplicity of a nonzero compact-operator eigenvalue). Thus (T−λI)∣Gλ(T) is nilpotent.

[A5]

Every nilpotent endomorphism of a finite-dimensional vector space has a basis arranged in Jordan strings; each string has an initial invariant segment of every length from zero through its full length by the definition of a Jordan string (Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings, Jordan blocks, Jordan strings, and their endpoints).

[A6]

Under Countable Choice, the singular values of T have a finite or countably infinite positive list (sj)j∈JT, with orthonormal families (ej), (fj), SVD expansion Tx=∑j∈JTsj⟨x,ej⟩fj, and partial isometry U such that T=U∣T∣ and U∗U is the orthogonal projection onto (ker⁡T)⊥; the singular values are nonincreasing and s1(T)=∥T∥ (Singular value decomposition for compact operators, Absolute value and singular values of a compact operator).

[A7]

The exterior space is the alternating range in the Hilbert tensor power; its wedges have Gram-determinant inner product, the induced map obeys (ΛNT)(x1∧⋯∧xN)=Tx1∧⋯∧TxN, is bounded, and is functorial (Hilbert exterior powers and induced operators).

[A8]
[A9]

The operator norm bounds the norm of every image vector: ∥Sx∥≤∥S∥∥x∥ (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[A10]

For trace-class T, the singular-value series converges and its sum is ∥T∥1 (Trace class operator).

[A11]

Every closed subspace of a Hilbert space has an orthogonal complement that gives a direct-sum decomposition (Orthogonal decomposition by a closed subspace).

[A12]

Under Countable Choice, a countable union of at most countable sets is at most countable; in particular this applies to a sequence of finite sets (Countable unions of at most countable sets, assuming ACω).

[A13]

For a complete orthonormal family, Parseval's identity holds and the finite-subset coefficient net converges in norm to each vector (Parseval equivalences for an orthonormal family).

[A14]

A decomposable wedge in a finite-dimensional vector space is nonzero exactly when its factors are linearly independent (In a finite-dimensional vector space, a decomposable wedge is nonzero exactly when its vectors are linearly independent).

[A18]

For every fixed real c, as R→+∞, (R+c)exp⁡(c−R)→0: use the exponential addition and reciprocal laws to write exp⁡(c−R)=exp⁡(c)/exp⁡(R), then bound ∣R+c∣ by 2R for sufficiently large R and apply R/exp⁡(R)→0. The latter is the case m=1, a=1 of the exponential-beats-polynomials theorem (Limits at +∞ and −∞, and infinite limits at a point, The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y), The exponential is positive and satisfies exp⁡(−x)=1/exp⁡(x), The exponential dominates every fixed nonnegative integer power at +∞).

[A19]

For every q>0, exp⁡(log⁡q)=q by the inverse definition of the natural logarithm (The natural logarithm as the inverse of the exponential function).

[A20]

The natural logarithm is strictly increasing and satisfies log⁡(ab)=log⁡a+log⁡b for a,b>0 (Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm).

[A21]

For a nonnegative real series, convergence is equivalent to bounded partial sums, and its sum is the supremum of those partial sums (Series, partial sums, convergence and the sum, divergence, and the tail series, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).

[A22]

Every nonempty finite set of real numbers has a maximum and a minimum (Maximum and minimum of a set, Every nonempty finite set of reals has a maximum and a minimum).

[A23]

For every positive real ε there is m≥1 with 1/m<ε (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

[A24]

A real x is nonzero exactly when ∣x∣>0 (Basic properties of the absolute value).

Choice accounting: The exact statement assumes AC. The Riesz–Schauder and algebraic-multiplicity suppliers are AC-qualified; AC supplies the dependent choice used by the former [A1]. Countable Choice follows from AC by [A2] and is used by the countable-union theorem [A12], Parseval [A13], the SVD, the singular-value and trace-class suppliers, and orthogonal decomposition; SVD uses it to select bases in the countable family of finite-dimensional singular eigenspaces. The Jordan-string choices are finite and local to each prefix. No basis of all of H is selected.

Proof

technique · direct

Given: The data in the statement, and for a fixed finite positive-eigenvalue prefix the stabilized exponents mλ from [A4].

1.1A1A2A3A4A12A22A23A24

By [A1, A3, A4], the nonzero spectral values are eigenvalues of finite algebraic multiplicity, and there are only finitely many above any positive modulus threshold. Every nonzero spectral value lies in the threshold set {λ:∣λ∣≥1/m} for some m≥1 by [A23, A24]. Each threshold set is finite by [A3], so Countable Choice [A2] and [A12] make their union at most countable. Repeating each value according to its finite algebraic multiplicity still gives a countable list by another application of [A12]. If that list is infinite, after choosing any remaining value only finitely many remaining values have at least its modulus; that finite nonempty set has a maximum modulus by [A22], which is then maximal among all remaining values. Finite ties can be ordered arbitrarily. AC permits iterating this selection to obtain a sequence ordered by decreasing modulus. If N=0, both products are the empty product 1. If N≥1 and the zero-padded eigenvalue list has λN(T)=0, its first N-term product is zero and the asserted inequality follows from nonnegativity of singular values. It remains to prove the claim when N≥1 and all of λ1(T),…,λN(T) are nonzero.

1.2A4A5

For each distinct eigenvalue λ among this prefix, let rλ be its number of occurrences. Then rλ≤dim⁡Gλ(T) by [A4]. Apply [A5] to (T−λI)∣Gλ(T) and list the resulting finite Jordan-string lengths as ℓ1,…,ℓq. In that order, take an initial segment of length ki:=min⁡(ℓi,rλ−∑h<ikh) from string i while the residual is positive, and take length zero thereafter. Since ∑iℓi=dim⁡Gλ(T)≥rλ, these lengths sum to rλ. The definition in [A5] makes each selected initial segment invariant under T, so their direct sum Fλ is T-invariant, has dimension rλ, and the restriction of T to it is triangular with diagonal entry λ repeated rλ times.

1.3A2A6A7A11A13A14

Put S:=ΛNT, K:=(ker⁡T)⊥, and P:=U∗U, the orthogonal projection onto K from [A6]. For every increasing N-tuple J=(j1<⋯<jN) in JT, set ηJ:=ej1∧⋯∧ejN, θJ:=fj1∧⋯∧fjN, and μJ:=∏k=1Nsjk(T). By the Gram formula [A7], both wedge families are orthonormal. The ej span K: if their closed span were proper, [A11] would give a nonzero x∈K orthogonal to all ej, while the SVD expansion [A6] would imply Tx=0, contradicting K∩ker⁡T={0}. Since decomposable wedges are dense by the exterior construction, approximating each factor by finite ej-sums and expanding by multilinearity shows that the ηJ span ΛNK. The tensor projection P⊗N is self-adjoint and idempotent and commutes with permutations; its restriction to the alternating range is ΛNP, the orthogonal projection onto M:=span⁡‾{ηJ}. Since T=TP, functoriality [A7] gives S=SΛNP, so S vanishes on M⊥. On each ηJ, SηJ=μJθJ. If there are at least N positive singular values, the family (ηJ) is a complete orthonormal family in M. For x∈M, Parseval and net convergence [A13] give xF:=∑J∈FcJηJ→x over finite subsets F, with cJ=⟨x,ηJ⟩. Orthonormality of both wedge families gives ∥SxF∥2=∑J∈FμJ2∣cJ∣2≤(sup⁡JμJ)2∑J∈F∣cJ∣2=(sup⁡JμJ)2∥xF∥2. Since S is bounded [A7], passing to the norm limit yields ∥Sx∥≤(sup⁡JμJ)∥x∥. The unit vector η(1,…,N) attains sup⁡JμJ=∏j=1Nsj(T), because every increasing tuple has sjk(T)≤sk(T). If there are fewer than N positive singular values, K is finite-dimensional of dimension less than N, so every decomposable N-wedge in K vanishes by [A14]; density gives ΛNK={0} and S=0, the same norm formula holding with sN(T)=0.

2.1A4step 1.2

The spaces Gλ(T) for the finitely many distinct prefix values form a direct sum: if ∑νxν=0 with xν∈Gν(T), fix λ and apply Qλ:=∏ν≠λ(T−νI)mν. It kills every xν for ν≠λ. On Gλ(T) each factor is (λ−ν)I+Nλ, where Nλ=(T−λI)∣Gλ is nilpotent, so that factor is invertible by its finite geometric-series inverse. Thus Qλ∣Gλ is invertible and xλ=0. Consequently EN:=⨁λFλ is a T-invariant N-dimensional subspace.

3.1A7A8A14step 2.1

Choose the concatenated Jordan-segment basis v1,…,vN of EN and put w:=v1∧⋯∧vN. The vectors are linearly independent by their being a basis, so [A14] gives w≠0. If A is the triangular matrix of T∣EN in this basis, multilinearity and alternation [A7] expand (Tv1)∧⋯∧(TvN)=det⁡(A)w. By [A8], det⁡(A)=∏j=1Nλj(T). Hence (ΛNT)w=(∏j=1Nλj(T))w.

4.1A9step 1.1step 3.1step 1.3

In the nonzero-prefix case of step 1.1, step 3.1 gives an eigenvector of S with eigenvalue ∏j=1Nλj(T). The operator-norm bound [A9] and norm identity [step 1.3] yield ∏j=1N∣λj(T)∣≤∥S∥=∏j=1Nsj(T). Together with step 1.1 this proves the product inequality for every N≥0.

5.1A6A20A24step 4.1

Fix N≥1 with λ1(T),…,λN(T) all nonzero. For each k≤N, step 4.1 gives the product inequality for the first k terms. Its left side is positive, hence sk(T)>0. The eigenvalue moduli are positive by [A24], so set xj:=log⁡∣λj(T)∣ and yj:=log⁡sj(T) for j≤N. Both sequences are nonincreasing because modulus, singular values and logarithm preserve the indicated order; taking logarithms in the product inequalities and using the logarithm product law [A20] gives ∑j=1kxj≤∑j=1kyj for every k≤N.

6.1A15A16A17A18A19A22step 5.1algebra

For a nonincreasing real list x1,…,xN and real t, ∑j=1N(xj−t)+=max⁡0≤k≤N(∑j=1kxj−kt), where the k=0 sum is zero: the positive terms form an initial segment, and adding any nonpositive later term cannot increase the prefix sum. This finite maximum exists by [A22]. Applying the identity to the lists in step 5.1 and their prefix-sum inequalities gives ∑j=1N(xj−t)+≤∑j=1N(yj−t)+ for every t∈R. Put c:=min⁡{xN,yN}−1 and b:=max⁡{x1,y1}+1, so c<xj,yj<b for every j, and for R≥0 put aR:=c−R and ϕu(t):=(u−t)+exp⁡(t). By [A15, A16], these functions and their finite sums are continuous and integrable on [aR,b]; since exp⁡(t)>0, the positive-part inequality remains true after multiplication by exp⁡(t). Monotonicity and linearity of the integral [A16] give ∑j∫aRbϕxj(t) dt≤∑j∫aRbϕyj(t) dt. Fix any u among these finitely many xj,yj. On [aR,u], ϕu(t)=(u−t)exp⁡(t), whose primitive is Gu(t):=(u−t+1)exp⁡(t): directly from the derivative definition [A17], (u−t+1)′=−1, and the product rule and (exp⁡)′=exp⁡ give Gu′(t)=(u−t)exp⁡(t). On [u,b], ϕu=0. Applying the fundamental theorem, the zero-integral case and interval additivity [A16, A17] yields ∫aRbϕu(t) dt=exp⁡(u)−(u−aR+1)exp⁡(aR). The error Eu,R:=(u−aR+1)exp⁡(aR)=(R+u−c+1)exp⁡(c−R) is nonnegative and tends to zero: for sufficiently large R, it is at most 2exp⁡(c)R/exp⁡(R), which tends to zero by [A18]. Because there are finitely many xj, for every ε>0 one common sufficiently large R makes ∑jExj,R<ε. The integral inequality then gives ∑jexp⁡(xj)≤∑jexp⁡(yj)+ε, since Eyj,R≥0. As ε was arbitrary, [A19] gives ∑j=1N∣λj(T)∣≤∑j=1Nsj(T).

7.1A10A21step 6.1∎

If the nonzero eigenvalue list is finite with length m>0, step 6.1 at N=m bounds its full absolute sum; for m=0 that sum is zero. If the list is infinite, step 6.1 bounds every eigenvalue partial sum by the corresponding singular-value partial sum, which is at most ∥T∥1 by trace class [A10]. The eigenvalue terms are nonnegative, so [A21] gives convergence of their series and bounds its sum, the supremum of its partial sums, by ∥T∥1. Zero padding changes neither sum, and [A10] identifies the singular-value sum with ∥T∥1. This proves the sum conclusion, including finite-rank and zero operators.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

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.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

Local separable trace-class determinant construction

Statement

Assume Countable Choice. Let K be a separable complex Hilbert space. For a trace-class operator T:K→K, define DT(z):=∑n≥0zntr⁡(ΛnT). This series converges locally uniformly on C, defines an entire function, and satisfies DT(0)=1 and DT′(0)=tr⁡(T). For every bounded finite-rank operator F:K→K and every finite-dimensional F-invariant subspace E with ran⁡F⊆E, DF(z)=det⁡E(IE+z(F∣E))(z∈C). The determinant on the zero-dimensional space is 1.

Facts & Assumptions

Given: Countable Choice, a separable complex Hilbert space K, a trace-class operator T:K→K, a bounded finite-rank operator F:K→K, and a finite-dimensional F-invariant subspace E containing ran⁡F.

[A1]

The exterior construction defines Λ0H=C and Λ0S=IC, gives the Gram determinant as the wedge inner product, realizes ΛnH as the antisymmetrizing-projection range, and makes the induced operator bounded and functorial with its stated wedge action. In degree one its antisymmetrizer is the identity, so Λ1S=S. (Hilbert exterior powers and induced operators)

[A2]

For trace-class S and n≥1, ΛnS is trace class and ∥ΛnS∥1≤∥S∥1n/n!; the degree-zero exterior operator is the identity on C. (Trace-norm bound for exterior powers of trace-class operators)

[A3]

For trace-class S, ∣tr⁡(S)∣≤∥S∥1. (Trace is absolutely convergent and basis independent)

[A4]

The real exponential factorial series ∑n≥0xn/n! converges absolutely for every real x. (The exponential series converges absolutely for every real argument)

[A5]

A complex power series converges absolutely and uniformly on every closed subdisc strictly inside its disc of convergence. (A complex power series converges absolutely and uniformly on every closed subdisc strictly inside its disc of convergence)

[A6]

Inside its disc of convergence a complex power series is holomorphic and its derivative is obtained term by term. (Inside its disc of convergence a complex power series is holomorphic and may be differentiated term by term)

[A8]

Every bounded finite-rank operator is compact, and every finite-rank operator is trace class. (Bounded finite rank operators are compact, Trace class operator)

[A9]

A finite-dimensional normed subspace, including the zero subspace, is closed. (A finite-dimensional normed subspace is closed)

[A10]

An invariant subspace E satisfies F(E)⊆E and the restriction F∣E:E→E is an endomorphism. (Invariant subspaces, restrictions, and induced quotient operators)

[A11]

For a closed subspace E of a Hilbert space, the orthogonal projection PE has PEx∈E and x−PEx∈E⊥; it is the identity on E and zero on E⊥. (The Hilbert orthogonal projection onto a closed subspace)

[A12]

If R is trace class and S is bounded, cyclicity gives tr⁡(RS)=tr⁡(SR). (Cyclicity of the trace)

[A13]

Every finite-dimensional inner-product space, including the zero space with its empty basis, has an orthonormal basis. (Every finite-dimensional real or complex inner product space has an orthonormal basis)

[A14]

The trace of an endomorphism of a finite-dimensional vector space is the matrix trace in any ordered basis, and the matrix trace is the sum of its diagonal entries. (The basis-independent trace of an endomorphism of a finite-dimensional vector space, The trace tr⁡(A) as the sum of the diagonal entries)

[A15]

In an ordered basis B, the matrix of an endomorphism has as its j-th column the coordinates of the image of the j-th basis vector. (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases)

[A16]

In positive dimension, the determinant of a finite-dimensional endomorphism is the determinant of its matrix in an ordered basis; on the zero space it is 1. (The determinant of an endomorphism of a finite-dimensional vector space: its matrix determinant in an ordered basis in positive dimension, and 1 on the zero space)

[A17]

A square matrix determinant is the finite signed permutation sum in the Leibniz formula. (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix)

[A18]

The inner product on a complex Hilbert space is linear in its first argument and conjugate-linear in its second. (Real and complex inner-product spaces and their induced length)

[A19]

A complex Hilbert space is an inner-product space complete in its induced norm. (Hilbert space)

[A20]

A topological space is separable when it has an at most countable dense subset. (Separability: the existence of an at most countable dense subset)

[A21]

Countable Choice is the exact choice assumption declared in the statement. The proof uses its trace-class, trace, cyclicity, and Hilbert-projection suppliers; it selects no basis of the whole space. (The Axiom of Countable Choice (ACω))

[A22]

The radius of a complex power series is the radius of the real power series formed from the absolute values of its coefficients. (Complex series, absolute convergence, complex power series, and radius of convergence)

[A23]

A bounded linear operator has an operator-norm bound ∥Tx∥≤∥T∥ ∥x∥. (A bounded linear operator between normed spaces)

[A24]

The Hilbert orthogonal projection is a bounded linear operator and is self-adjoint and idempotent. (Hilbert projections are linear, self-adjoint and contractive)

[A25]

The trace of a trace-class operator is computed by every nuclear representation Sx=∑j⟨x,uj⟩vj, as tr⁡(S)=∑j⟨vj,uj⟩. (Trace is absolutely convergent and basis independent)

Source audit: Kostenko's Proposition 3.4.3 gives the exterior-power trace-norm estimate and Corollary 3.4.1 states the entire-function conclusion, but its proof refers to Exercise 3.4.3 for the exterior absolute-value identity. That exercise is not used here; [A2] is the previously proved local exterior-power lemma. Van Neerven's Definition 14.34 gives the same series and factorial bound. Lemma 14.38 proves finite-dimensional reduction only when T=PTP for an orthogonal projection P; the present argument allows arbitrary invariant E and proves the reduction by exterior projection and trace cyclicity. Dyatlov–Zworski §B.5.2 gives the finite-rank compression determinant by nonzero eigenvalues; it is contextual support, not a substitute for the coefficient calculation below.

Proof

technique · direct

Given: The data in the statement; write cn:=tr⁡(ΛnT).

1.1A1A2A3A4A20A22

For n=0, Λ0T=IC, so c0=1. For n≥1, [A2] makes ΛnT trace class and [A3] gives ∣cn∣≤∥ΛnT∥1≤∥T∥1n/n!. Hence for each real R≥0, ∑n≥0∣cn∣Rn≤∑n≥0(R∥T∥1)nn!<∞ by [A4]. Since this holds at every radius, the complex power series has radius +∞ by [A22]. The separability hypothesis is the dense-subset condition [A20] and is retained, though this estimate uses only trace-class membership.

1.2A1A9A11A13A18A19A24

The finite-dimensional subspace E is closed by [A9], so [A11] supplies its orthogonal projection PE. It is bounded, linear and self-adjoint by [A24]. Its defining decomposition also gives PE2=PE. Choose an orthonormal basis e0,…,ed−1 of E by [A13], where d=dim⁡E and the list is empty if d=0. For each n≥0, put Hn:=ΛnK, Gn:=ΛnE⊆Hn, and Qn:=ΛnPE. The increasing wedges ei1∧⋯∧ein with i1<⋯<in are orthonormal by the Gram formula [A1]. They span Gn: every algebraic tensor in E⊗n expands in the basis tensors from (ej), and antisymmetrizing sends a repeated-index tensor to zero and every other one to a multiple of an increasing wedge; the algebraic tensors are dense and the projection range is closed. Thus this is a finite orthonormal basis of Gn, empty for n>d; for n=0, G0=C with basis 1. It follows that Gn is closed in Hn by [A9]. By functoriality in [A1], Qn2=Qn. For n=0, [A1] gives Q0=IC and G0=C, so Q0 is the orthogonal projection onto G0. For n≥1, on decomposable wedges the Gram identity and self-adjointness of PE give ⟨Qn(x1∧⋯∧xn),y1∧⋯∧yn⟩=det⁡[⟨PExi,yj⟩]=det⁡[⟨xi,PEyj⟩]=⟨x1∧⋯∧xn,Qn(y1∧⋯∧yn)⟩. Density of decomposable wedges makes Qn self-adjoint. It maps decomposable wedges into Gn and fixes every decomposable wedge in Gn; continuity and density therefore show that its range is exactly Gn. Thus Qn is the orthogonal projection onto Gn.

2.1A10A14A15A23step 1.2

Let d:=dim⁡E and use the basis (ej) chosen in step 1.2. By [A10], A:=F∣E is an endomorphism; for x∈E, [A23] gives ∥Ax∥=∥Fx∥≤∥F∥ ∥x∥, so A is bounded. Write its matrix as (aij), so Aej=∑i<daijei by [A15]. For each 0≤n≤d, the increasing wedges eI:=ei1∧⋯∧ein, with I=(i1<⋯<in), form the orthonormal basis of Gn established in step 1.2. Expanding ΛnA(eI)=Aei1∧⋯∧Aein by multilinearity and antisymmetry shows that its diagonal coefficient at eI is the principal minor det⁡A[I,I]. Thus [A14] yields tr⁡(ΛnA)=∑I⊆{0,…,d−1}, ∣I∣=ndet⁡A[I,I], with the n=0 term equal to 1; for n>d, Gn={0} and the trace is 0. When d=0 this says the sole coefficient is 1 in degree zero and all positive-degree coefficients vanish.

2.2step 1.1A5A6A7

By [A5], the series converges uniformly on every closed disk of finite radius, and so locally uniformly on C. Its infinite radius from step 1.1 and [A6] make its sum holomorphic on all of C; therefore DT is entire by [A7].

2.3step 1.1A1A6

The constant coefficient in step 1.1 gives DT(0)=1. The derivative formula in [A6] gives DT′(0)=c1=tr⁡(Λ1T)=tr⁡(T) by [A1].

3.1A8step 1.1step 2.1step 2.2

Let F be bounded and finite rank. By [A8], it is trace class, so the series defining DF is well-defined and the entire-function conclusion of steps 1.1 and 2.2 applies. Its restriction A:=F∣E is the bounded endomorphism established in step 2.1.

4.1A1A2A8A12step 1.2step 3.1

Since ran⁡F⊆E, the wedge action in [A1] gives ran⁡(ΛnF)⊆Gn, hence QnΛnF=ΛnF. Each ΛnF is trace class by [A2] for n≥1; for n=0 it is the finite-rank identity on C, trace class by [A8]. Cyclicity [A12] therefore gives tr⁡(ΛnF)=tr⁡((ΛnF)Qn).

5.1A14A18A25step 1.2step 4.1

Let ιn:Gn↪Hn be inclusion and let An:=Λn(F∣E). Use the finite orthonormal basis of Gn from step 1.2. Because Qn is its orthogonal projection, Qnx=∑j⟨x,gj⟩gj. On Gn, functoriality gives (ΛnF)ιn=ιnAn, and therefore ((ΛnF)Qn)x=∑j⟨x,gj⟩ ιn(Angj). This is a finite nuclear representation. By [A25] its trace is tr⁡((ΛnF)Qn)=∑j⟨ιn(Angj),gj⟩=tr⁡Gn(An), where the last equality is the finite-dimensional trace formula [A14]. This includes Gn={0}, when both traces are zero. Together with step 4.1, it proves tr⁡(ΛnF)=tr⁡(Λn(F∣E)) for every n≥0.

6.1A16A17step 2.1step 5.1

In the basis (ej), [A16] identifies det⁡E(IE+zA) with the determinant of the matrix (δij+zaij). Expanding its Leibniz formula [A17] and choosing the zA entry in precisely the columns indexed by a subset I forces the permutation to fix every column outside I; the remaining signed sum is z∣I∣det⁡A[I,I]. Grouping by ∣I∣=n and using step 2.1 gives det⁡E(IE+zA)=∑n=0dzntr⁡(ΛnA). By step 5.1, these coefficients equal tr⁡(ΛnF), and they vanish for n>d. Therefore the right side is exactly the series defining DF(z), proving the finite-rank identity for every z∈C. If d=0, step 2.1 makes this identity 1=1. The proof permits any finite-dimensional invariant E containing ran⁡F; it never assumes that E reduces F.

7.1A13A21step 1.1step 2.1step 2.3step 6.1∎

The empty exterior degree and z=0 are covered by steps 1.1 and 2.2. If F=0, then every positive-degree exterior power vanishes and the determinant is 1. A zero-dimensional E is handled in step 6.1. When dim⁡E=1, step 2.1 gives coefficients 1 and tr⁡(F∣E) and all higher coefficients vanish, matching the linear determinant; for every n>d, Gn={0} and the trace coefficient vanishes. Countable Choice is the exact declared assumption [A21]; the only bases chosen locally are finite-dimensional orthonormal bases [A13], and no full AC or DC is used.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

Trace-norm continuity, growth and multiplicativity of the local determinant

Statement

Assume the Axiom of Countable Choice. Let H be a separable complex Hilbert space and let A,B:H→H be trace-class operators. Write DT for the locally constructed determinant of Local separable trace-class determinant construction, and let (sj(T))j≥1 be the zero-padded singular-value sequence. Then:

  1. For every z∈C, ∣DA(z)∣≤∏j≥1(1+∣z∣sj(A))≤e∣z∣∥A∥1. Moreover, DA has minimal exponential type: for every ε>0 there is Cε≥0 such that ∣DA(z)∣≤Cεeε∣z∣(z∈C).
  2. For every z∈C, ∣DA(z)−DB(z)∣≤∣z∣ ∥A−B∥1e1+∣z∣∥A∥1+∣z∣∥B∥1.
  3. A+B+AB is trace class and DA+B+AB(1)=DA(1)DB(1).
  4. If (Fm)m≥1 is any sequence of finite-rank operators with ∥Fm−A∥1→0, then the ordinary determinants det⁡ran⁡Fm(Iran⁡Fm+zFm∣ran⁡Fm) converge locally uniformly to DA(z). Their limit is independent of the approximating sequence.

Facts & Assumptions

Given: Countable Choice, a separable complex Hilbert space H, trace-class A,B, and, when claim 4 is considered, a trace-norm convergent finite-rank sequence (Fm).

[A1]

For trace-class T, the induced exterior powers are trace class and ∥ΛnT∥1=∑j1<⋯<jnsj1(T)⋯sjn(T)≤∥T∥1nn! for n≥1; Λ0T=IC and its trace is 1 (Trace-norm bound for exterior powers of trace-class operators).

[A2]

The trace is linear on trace-class operators and satisfies ∣tr⁡S∣≤∥S∥1 (Trace is absolutely convergent and basis independent).

[A3]

Trace class means ∑j≥1sj(T)<∞ and ∥T∥1=∑j≥1sj(T); its singular-value sequence is zero padded (Trace class operator).

[A6]

The exterior construction realizes ΛnH as the antisymmetric tensor subspace and gives its wedge action; the local determinant is DT(z)=∑n≥0zntr⁡(ΛnT), entire, with DT(0)=1, and for finite-rank F it satisfies DF(z)=det⁡E(IE+zF∣E) for every finite-dimensional invariant E⊇ran⁡F (Hilbert exterior powers and induced operators, Local separable trace-class determinant construction).

[A7]

Trace-class operators form a linear space, their trace norm is a norm, ∥T∥≤∥T∥1, and ∥STU∥1≤∥S∥ ∥T∥1 ∥U∥ for bounded S,U (Trace class is a two sided Banach operator ideal).

[A8]

Every supplied sequence of finite-rank orthogonal projections Pn→I strongly on separable H satisfies ∥PnTPn−T∥1→0 for trace-class T; the initial projections of a supplied countable orthonormal basis are an example (Finite-rank orthogonal compressions converge in trace norm).

[A9]

A separable space has an at-most-countable dense subset (Separability: the existence of an at most countable dense subset, Finite, countably infinite, countable, uncountable). If that subset is nonempty and finite, choose a finite listing and repeat its first member periodically; if it is countably infinite, choose a bijection from N. In either case it has a surjective sequence, with no choice beyond fixing the one listing whose existence is asserted by countability. A dense sequence in a Hilbert space yields a finite or countable orthonormal basis by the specified Gram–Schmidt construction (A Hilbert space with a dense sequence has a finite or countable orthonormal basis).

[A10]

Finite-dimensional subspaces are closed; for a closed subspace its Hilbert orthogonal projection is defined by the orthogonal decomposition (A finite-dimensional normed subspace is closed, The Hilbert orthogonal projection onto a closed subspace). The Fourier sums of a supplied orthonormal basis converge in norm to each vector (Fourier expansion in a Hilbert space).

[A11]

The determinant of a composition of endomorphisms of one finite-dimensional vector space is the product of their determinants, including dimension zero (For endomorphisms S and T of one finite-dimensional vector space, det⁡(ST)=det⁡(S)det⁡(T)).

[A12]

If a function is holomorphic on a disc of radius S, is bounded by M on the concentric circle of radius R<S, then on the centre its derivative is bounded by M/R (Cauchy estimates on a smaller concentric disc).

[A13]

A holomorphic function on an open subset of C is smooth as a map of two real coordinates, with real derivative given by its complex derivative (Holomorphic functions are real analytic and smooth in their two real coordinates). A differentiable map [a,b]→R2 whose derivative norm is at most M satisfies ∥f(b)−f(a)∥2≤M(b−a) (The mean value inequality: if f:[a,b]→Rm is continuous and differentiable on (a,b) with ∥f′∥2≤M, then ∥f(b)−f(a)∥2≤M(b−a)).

[A14]

A complex polynomial is entire (Complex polynomials are entire with the power-rule derivative, and rational functions are holomorphic wherever their denominator is nonzero). If complex-valued functions are bounded by a summable nonnegative majorant, their series converges uniformly (Weierstrass M-test for complex-valued function series); a locally uniformly convergent series of holomorphic functions is holomorphic (A locally uniformly convergent series of holomorphic functions may be differentiated term by term).

[A15]

A polynomial of degree at most n is determined by its values at any n+1 distinct complex numbers; the root bound for polynomials over an integral domain proves uniqueness, and the Lagrange formula then expresses each coefficient as a finite linear combination of those values (A nonzero polynomial of degree n over an integral domain has at most n distinct roots).

[A16]

Countable Choice is the exact declared choice assumption (The Axiom of Countable Choice (ACω)). It is used through the ACω-qualified singular-value definition and exterior trace, trace, ideal, and compression and projection/Fourier suppliers [A1], [A2], [A3], [A7], [A8], and [A10]; the trace-class definition records the concrete countable selections of finite orthonormal bases in singular eigenspaces. The separable-space basis used below is constructed from one dense sequence by the stated Gram–Schmidt process, and the padded enumeration requires no choice by [A9].

Source audit: Kostenko, Trace Ideals with Applications, §3.4.3, Corollary 3.4.1, Theorem 3.4.4 and Corollary 3.4.2 (printed pp. 38–40; PDF pp. 47–49) gives the exterior-product growth, minimal-type, Cauchy continuity and multiplicativity route. The local proof below derives the affine-parameter entire function from its exterior-trace series rather than leaving that dependence implicit. Van Neerven, Functional Analysis, §14.5.a, Lemmas 14.35–14.39 (printed pp. 585–587; PDF pp. 597–599) gives the same bounds and product law; its Lemma 14.37 uses tensor-product trace-norm telescoping, and Lemma 14.38 assumes T=PTP, so neither argument is substituted for the local proof. Dyatlov–Zworski, Appendix B §§B.5.2–B.5.3, Propositions B.27 and B.29 (PDF pp. 509–511) records the continuous finite-rank extension and determinant estimates; that extension construction is contextual only. No source uncertainty remains for this item.

Proof

1.1A1A2A3A4A5A6

Put cn(T):=tr⁡(ΛnT) and en(T,r):=∑j1<⋯<jnsj1(T)⋯sjn(T)rn for n≥1, with e0(T,r)=1. By [A1] and [A2], ∣cn(T)∣rn≤en(T,r) for n≥1, while c0(T)=1. For each finite N, distributive expansion gives ∏j=1N(1+rsj(T))=∑n=0N∑1≤j1<⋯<jn≤Nrnsj1(T)⋯sjn(T). All terms are nonnegative; increasing N exhausts the finite subsets of the singular-value index set, so [A4] identifies the limit of these products with ∑n≥0en(T,r). Since [A3] gives ∑jsj(T)=∥T∥1, [A4] ensures the product exists. This proves ∣DT(z)∣≤∑n≥0∣cn(T)∣rn≤∏j≥1(1+rsj(T)),r=∣z∣. For finite N, [A5] and the exponential addition law give ∏j=1N(1+rsj(T))≤er∑j=1Nsj(T)≤er∥T∥1. Passing to the product limit and using order preservation proves the second bound.

1.2A1A2A6A7A14A15

Suppose z≠0 and A≠B. Since the trace norm is a norm by [A7], ∥A−B∥1>0. Put C=(A+B)/2, G=A−B, and F(t)=DC+tG(z) for t∈C. Trace class is a linear space by [A7], so C+tG is trace class. For each n, the tensor-power definition in [A6] shows that t↦Λn(C+tG) is an operator-valued polynomial of degree at most n: expand (C+tG)⊗n by the tensor factors. For each power tk, its coefficient is the sum over all k-element subsets of factors in which G is used, with C in the other factors. This sum commutes with every permutation of tensor slots and hence preserves the antisymmetric subspace, so its restriction is a bounded coefficient operator on ΛnH. Write the bounded coefficient operators as Qk, and choose distinct t0,…,tn∈C. Define Lj(t):=∏k≠j(t−tk)/(tj−tk). For every m=0,…,n, the scalar polynomials tm and ∑j=0ntjmLj(t) agree at all tk; their difference has degree at most n and n+1 roots, so [A15] makes the difference zero. Multiplying these identities by Qm and summing gives Λn(C+tG)=∑j=0nΛn(C+tjG)Lj(t). Expanding the Lj shows each coefficient operator is a finite linear combination of the values Λn(C+tjG). Those values are trace class by [A1], so all coefficient operators are trace class by [A7]. Hence pn(t):=tr⁡(Λn(C+tG)) is a scalar polynomial. For ∣t∣≤M, [A1], [A2], and [A7] give ∣z∣n∣pn(t)∣≤(∣z∣(∥C∥1+M∥G∥1))nn!. The majorant series converges by the exponential-series supplier [A5]. Each znpn(t) is holomorphic by [A14]; the Weierstrass M-test and holomorphic-series theorem [A14] therefore show that F(t)=∑n≥0znpn(t) is entire in t.

2.1A3A5step 1.1

Fix ε>0. Choose N≥0 so that ∑j>Nsj(T)<ε/2, possible by [A3]. The tail product is at most er∑j>Nsj(T)≤eεr/2 because every finite tail product is bounded by the exponential of the corresponding partial tail sum using [A5]; taking its product limit preserves the inequality by [A4]. If N=0, this already gives ∣DT(z)∣≤eεr with Cε:=1. If N≥1, then for j≤N and r≥0, 1+rsj(T)≤(1+2Nsj(T)ε)(1+εr2N)≤(1+2Nsj(T)ε)eεr/(2N) by [A5]. Multiplying the first N bounds and the tail estimate, and using step 1.1, gives ∣DT(z)∣≤Cεeεr,Cε:=∏j=1N(1+2Nsj(T)ε). This is minimal exponential type, including finite-rank and zero operators.

2.2A6A7A12A13step 1.1step 1.2

Set δ=∣z∣∥A−B∥1>0 and R=1/δ. For t∈[−1/2,1/2] and ∣w−t∣=R, one has ∣w∣≤R+1/2. By step 1.1 and [A7], ∣F(w)∣≤e∣z∣∥C+wG∥1≤e∣z∣∥C∥1+∣z∣(R+1/2)∥G∥1≤e1+∣z∣∥A∥1+∣z∣∥B∥1. For the last inequality, the triangle inequality gives ∥C∥1≤(∥A∥1+∥B∥1)/2 and δ=∣z∣∥A−B∥1≤∣z∣(∥A∥1+∥B∥1); also ∣z∣R∥G∥1=1 and ∣z∣∥G∥1/2=δ/2. Apply [A12] to the radius-R circle about t to get ∣F′(t)∣≤R−1e1+∣z∣∥A∥1+∣z∣∥B∥1=δe1+∣z∣∥A∥1+∣z∣∥B∥1. By [A13] the coordinate map of F on [−1/2,1/2] is differentiable with real derivative norm ∣F′(t)∣. The mean-value inequality in [A13] yields ∣DA(z)−DB(z)∣=∣F(1/2)−F(−1/2)∣≤δe1+∣z∣∥A∥1+∣z∣∥B∥1, since C+G/2=A and C−G/2=B. If z=0, both determinants equal 1 by [A6]; if A=B, their difference is zero. This proves the continuity bound in all cases.

3.1A6A7step 2.2

Let Fm be finite rank and ∥Fm−A∥1→0. With Em=ran⁡Fm, the range is finite dimensional and invariant because Fm(H)⊆Em; [A6] identifies the ordinary determinant on Em with DFm(z). The same identity holds for every other permitted Em, so the finite-dimensional determinant value is independent of that choice. For any compact K⊂C, choose RK with ∣z∣≤RK on K. The trace norms ∥Fm∥1 are bounded by [A7] and convergence, so step 2.2 gives sup⁡z∈K∣DFm(z)−DA(z)∣≤RK∥Fm−A∥1e1+RK(∥Fm∥1+∥A∥1)⟶0. The limit is DA for every such sequence, hence does not depend on the approximation.

3.2A6A7A8A9A10A11step 2.2algebra

If H={0}, all determinants in claim 3 are 1. Otherwise choose an at-most-countable dense subset of H using [A9]; it is nonempty, so [A9] provides a dense sequence. The Gram–Schmidt supplier in [A9] gives an orthonormal basis that is finite or countably infinite. In the finite case set Pn=IH, which is finite rank and converges strongly to IH. In the countably infinite case let Pn be the orthogonal projection, defined by [A10], onto the span of the first n basis vectors; that span is closed by [A10], and the Fourier expansion in [A10] gives Pnx→x. Thus in either case (Pn) is a supplied sequence of finite-rank orthogonal projections converging strongly to IH. Put An=PnAPn and Bn=PnBPn. By [A8], An→A and Bn→B in trace norm. Also, AB is trace class by the ideal property in [A7], so C:=A+B+AB is trace class by linearity. The ideal estimate [A7] gives ∥AnBn−AB∥1≤∥An−A∥1∥Bn∥+∥A∥∥Bn−B∥1⟶0, where ∥Bn∥ is bounded because ∥Bn∥≤∥Bn∥1 and ∥Bn∥1≤∥B∥1+∥Bn−B∥1. Hence Cn:=An+Bn+AnBn→C:=A+B+AB in trace norm. All three compressed operators have range in the finite-dimensional space PnH, which they leave invariant. By [A6] and [A11], DCn(1)=det⁡PnH(I+Cn∣PnH)=det⁡PnH((I+An∣PnH)(I+Bn∣PnH))=DAn(1)DBn(1). Applying step 2.2 at z=1 to An→A, Bn→B, and Cn→C and passing to the limit proves DA+B+AB(1)=DA(1)DB(1).

4.1

If A=0, then DA=1 and its singular-value product is empty or all factors are 1; if z=0, DA(0)=1. When H=C and A=aI, DA(z)=1+za, so the product and exponential bounds reduce to ∣1+za∣≤1+∣z∣∣a∣≤e∣z∣∣a∣, the scalar determinant difference is ∣z∣∣a−b∣, which is at most the stated continuity bound by [A5], and multiplicativity is 1+(a+b+ab)=(1+a)(1+b). For finite-rank A, the product has only finitely many nontrivial factors and the tail in step 2.1 is zero after its rank. The Cauchy argument includes both segment endpoints t=±1/2; the special branches z=0 and A=B avoid a zero Cauchy radius denominator. Countable Choice is the exact declared assumption [A16], used through the named trace-class, trace, ideal, compression, and projection/Fourier suppliers; the orthonormal basis used for compressions is built from one dense sequence by Gram–Schmidt. No equivalence is asserted, so both iff directions are inapplicable. [A1, A3, A5, A6, A7, A8, A9, A10, A11, A12, A13, A16, step 1.1, step 2.1, step 2.2, step 3.2] \qed

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

Logarithmic derivative of the local Fredholm determinant

Statement

Assume the Axiom of Countable Choice. Let H be a separable complex Hilbert space and let T:H→H be trace class. Write DT for the locally constructed determinant of Local separable trace-class determinant construction. For each z∈C for which I+zT has a bounded inverse Rz∈B(H), DT′(z)=DT(z)tr⁡(TRz). Equivalently, Rz=(I+zT)−1 in the displayed formula.

Facts & Assumptions

Given: Countable Choice, a separable complex Hilbert space H, a trace-class operator T:H→H, and, at the point z under consideration, a bounded two-sided inverse Rz of I+zT.

[A1]

Countable Choice, written ACω, is the declared choice assumption (The Axiom of Countable Choice (ACω)).

[A2]

For a trace-class operator U on a separable complex Hilbert space, the local determinant is DU(w)=∑n≥0wntr⁡(ΛnU), is entire, and satisfies DU(0)=1 and DU′(0)=tr⁡(U) (Local separable trace-class determinant construction).

[A3]

Trace-class operators form a linear space; if U is trace class and V is a bounded operator, then UV and VU are trace class (Trace class operator, Trace class is a two sided Banach operator ideal).

[A4]

For n≥1, the tensor definition of exterior powers gives Λn(cU)=cnΛnU for c∈C, while Λ0(cU)=IC (Hilbert exterior powers and induced operators).

[A5]

For trace-class A,B on the same separable complex Hilbert space, DA+B+AB(1)=DA(1)DB(1) (Trace-norm continuity, growth and multiplicativity of the local determinant).

[A6]

Membership Rz∈B(H) means that Rz is a bounded linear operator, as required in the trace-class ideal estimate (A bounded linear operator between normed spaces).

Source audit: Dyatlov–Zworski, Mathematical Theory of Scattering Resonances, Appendix B §B.5.2, Lemma B.26 (PDF p. 509) proves the finite-rank formula for a C1 path At whose ranges lie in one fixed finite-dimensional subspace, assuming I−At remains invertible along the path. Its proof reduces to Jacobi's finite-dimensional determinant formula. The local proof below does not extend that finite-rank statement by assertion: it derives the trace-class identity from the already proved determinant multiplicativity and the derivative at zero. Van Neerven, Functional Analysis, §14.5.a, Definition 14.34 (printed p. 585; PDF p. 597) gives the entire exterior-trace series and its first-order expansion, and Lemma 14.39 (printed p. 587; PDF p. 599) gives multiplicativity. Kostenko, Trace Ideals with Applications, §3.4.3, Corollary 3.4.2 (printed p. 40; PDF p. 49) also gives the product identity. Those passages were read in full; none states the general infinite-dimensional logarithmic-derivative formula as used here. They inform the audit, while the argument below proves the claim locally. No source uncertainty remains.

Proof

technique · direct
1.1A3A6algebra

Fix such a z, write R=Rz, put M:=I+zT, and set S:=TR. Since MT=TM and RM=MR=I, the equality R(MT)R=R(TM)R gives TR=RT, hence MS=MTR=TMR=T. The operator S is trace class by [A3], because T is trace class and R is bounded; therefore the scalar multiples zT and hS are trace class for every h∈C.

1.2A2A4

For every trace-class U and c∈C, [A2] and [A4] give DcU(1)=∑n≥0tr⁡(Λn(cU))=DU(c): the degree-zero term is 1 on both sides and for n≥1 the degree-n term is cntr⁡(ΛnU), including when c=0.

2.1step 1.1algebra

For each h∈C, step 1.1 gives (I+zT)S=T, so I+(z+h)T=(I+zT)(I+hS), because the coefficient of h on the right is S+zTS=(I+zT)S=T.

3.1A5step 1.2step 2.1

Apply [A5] to trace-class zT and hS; by step 2.1, (z+h)T=zT+hS+zhTS, so D(z+h)T(1)=DzT(1)DhS(1) and step 1.2 turns this into DT(z+h)=DT(z)DS(h).

4.1A2step 1.1step 3.1

Subtract DT(z) from step 3.1 and divide by h≠0; as h→0, [A2] gives DT′(z)=DT(z)DS′(0)=DT(z)tr⁡(S), and S=TR=T(I+zT)−1 gives the claimed formula. Taking h=−z in step 3.1 and using DT(0)=1 from [A2] gives 1=DT(z)DS(−z), so DT(z)≠0 and the identity is its ordinary logarithmic-derivative formula as well.

5.1

If T=0, then S=0, DT≡1, and both sides are zero; this also covers H={0}. On H=C with T=tI and 1+zt≠0, DT(z)=1+zt and R=(1+zt)−1I, so both sides equal t. At z=0, R=I and step 4.1 gives DT′(0)=tr⁡(T). The complex derivative exists on the whole plane by [A2], and the difference quotient uses complex h, so there is no one-sided endpoint case. Countable Choice is exactly [A1], inherited through the trace-class, determinant, ideal, and multiplicativity suppliers; this proof makes no additional choices. The claim is not an equivalence, so both iff directions are inapplicable. [A1, A2, A3, A5, A6, step 1.1, step 3.1, step 4.1] \qed

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

Zeros of the local Fredholm determinant

Statement

Assume the Axiom of Choice. Let H be a separable complex Hilbert space and let T:H→H be trace class. For every z∈C, DT(z)=0⟺I+zT is not boundedly invertible, where DT is the locally constructed determinant. For every nonzero eigenvalue λ of T (equivalently, every nonzero spectral value), the zero at z0=−1/λ has order malg(λ;T).

Facts & Assumptions

Given: AC; a separable complex Hilbert space H; a trace-class operator T:H→H; and, for the multiplicity claim, a nonzero eigenvalue λ of T.

[A1]

AC selects from every family of nonempty sets (The Axiom of Choice).

[A2]

A complex Hilbert space is a Banach space in its induced norm (Hilbert space).

[A3]

In the trace-class definition, T∈B(H,K) is assumed compact (Trace class operator).

[A4]

For a compact operator, every nonzero spectral value is an eigenvalue with finite-dimensional generalized eigenspace (Riesz schauder spectrum of a compact operator).

[A5]

For every ε>0, a compact operator has only finitely many spectral values with modulus at least ε (Riesz schauder spectrum of a compact operator).

[A6]

A Riesz projection PE is defined for a clopen spectral subset E⊆σ(T) (Riesz spectral projection).

[A7]

A Riesz projection satisfies P2=P, commutes with T, and gives the closed invariant splitting H=ran⁡P⊕ker⁡P (Riesz spectral projection properties).

[A8]

When the summands are nonzero, the restriction spectra are E on ran⁡P and σ(T)∖E on ker⁡P (Riesz spectral projection properties).

[A9]

For nonzero λ∈σ(T), the algebraic multiplicity is the finite dimension of Gλ(T)=ker⁡(T−λI)m0 for a stabilized exponent, and Gλ(T)=ran⁡Pλ (Algebraic multiplicity of a nonzero compact-operator eigenvalue).

[A10]

The local determinant is the entire exterior-trace series DU(w)=∑n≥0wntr⁡(ΛnU), with DU(0)=1 (Local separable trace-class determinant construction).

[A11]

For bounded finite-rank F and finite-dimensional invariant E with ran⁡F⊆E, DF(w)=det⁡E(IE+w(F∣E)); the determinant on the zero space is 1 (Local separable trace-class determinant construction).

[A12]

Trace-class operators form a linear space and remain trace class under left or right multiplication by bounded operators (Trace class is a two sided Banach operator ideal).

[A13]

For trace-class A,B on the same separable Hilbert space, DA+B+AB(1)=DA(1)DB(1) (Trace-norm continuity, growth and multiplicativity of the local determinant).

[A14]

The exterior action is given on wedges by (ΛnU)(x1∧⋯∧xn)=Ux1∧⋯∧Uxn, and Λ0U=IC; hence Λn(cU)=cnΛnU for n≥1 (Hilbert exterior powers and induced operators).

[A15]

AC implies DC and hence Countable Choice (AC implies DC implies countable choice); this supplies the choice assumptions of [A10]–[A13].

[A16]

Every finite-dimensional nilpotent endomorphism has an ordered basis concatenating Jordan strings (Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings).

[A18]

That determinant is independent of the ordered basis (The determinant of a linear operator is independent of the chosen ordered basis).

[A19]

The determinant of an upper or lower triangular matrix is the product of its diagonal entries (The determinant of a triangular matrix is the product of its diagonal entries).

[A20]

A holomorphic function has a zero of order d<∞ at a exactly when it factors locally as (z−a)dg(z) with g(a)≠0 (The order of a zero is the exponent in its local holomorphic factorization).

Source audit: Kostenko, Trace Ideals with Applications, §3.4.4, Theorem 3.4.6 (printed pp. 40–41; PDF pp. 49–50), proves the same criterion and multiplicity claim. Its proof uses determinant multiplicativity for the invertible case, then a commuting Riesz projection, its finite-dimensional factor, and nonvanishing of the complementary determinant. I read that complete argument. The local proof below reconstructs those steps from the local determinant series, the proved local multiplicativity, and the library's Riesz-projection and algebraic-multiplicity suppliers; the cited theorem is not a proof premise. The projection is generally nonorthogonal, so the proof uses its bounded topological direct sum and does not use an orthogonal compression. No source uncertainty remains.

Proof

technique · direct
1.1A11

If T=0, including when H={0}, choose F=T and E={0} in [A11]. Then DT≡1 and I+zT=I has its identity as bounded inverse for every z; there is no nonzero eigenvalue to consider. Hence assume H≠{0} and T≠0.

1.2A1A2A3A5A6

For the multiplicity claim, let λ≠0 be an eigenvalue of T. By [A2] and [A3], H is a complex Banach space and T is compact, so the Riesz–Schauder suppliers apply. The value λ lies in σ(T). By [A5], S={μ∈σ(T):∣μ∣≥∣λ∣/2} is finite; every spectral point within distance ∣λ∣/2 of λ lies in S. If S∖{λ} is empty, take δ=∣λ∣/4; otherwise take δ positive and less than both ∣λ∣/2 and the finitely many distances ∣λ−μ∣ for μ∈S∖{λ}. Then δ isolates λ, so E={λ} is clopen in σ(T) and [A1, A6] define its Riesz projection P.

1.3A10A14

For every trace-class U and c∈C, [A10] and [A14] give DcU(1)=∑n≥0tr⁡(Λn(cU))=DU(c), because the degree-zero term is 1 on both sides and the degree-n terms agree for each n≥1; this includes c=0.

2.1A11A12A13step 1.3algebra

Let U be trace class and suppose I+wU has bounded inverse R. Set V:=−wUR, which is trace class by [A12]. The right-inverse equation (I+wU)R=I gives wU+V+wUV=wU−wUR−w2U2R=wU−wU(I+wU)R=0. Apply [A13] to wU,V and use D0(1)=1 from [A11] to get 1=DwU(1)DV(1)=DU(w)DV(1) by step 1.3. Thus DU(w)≠0.

2.2A7A9A12step 1.2

Put M=ran⁡P and N=ker⁡P. By [A7], H=M⊕N is a bounded topological direct sum and both summands are T-invariant. By [A9], M=Gλ(T) and d:=dim⁡M=malg(λ;T)<∞; since λ is an eigenvalue, d≥1. The restriction J:=(T∣M)−λIM is nilpotent because M=ker⁡(T−λI)m0 for a stabilized exponent. Both TP and T(I−P) are trace class by [A12].

3.1A13step 1.3step 2.2algebra

Set A=zTP and B=zT(I−P). Since PT=TP, AB=z2TPT(I−P)=z2T2P(I−P)=0, while A+B=zT. Apply [A13] and then step 1.3 to obtain, for every z∈C, DT(z)=DzT(1)=DzTP(1)DzT(I−P)(1)=DTP(z)DT(I−P)(z).

3.2A11A16A17A18A19step 2.2

The operator TP has finite rank and range in M, and M is invariant; since P∣M=IM, [A11] gives DTP(z)=det⁡M(IM+z(T∣M)). A Jordan-string basis from [A16] makes the matrix of the nilpotent J triangular with zero diagonal; hence the matrix of IM+z(T∣M) is triangular with diagonal entries 1+zλ. By [A17] and [A18] its operator determinant is this matrix determinant, and [A19] gives DTP(z)=(1+zλ)d.

3.3A8step 2.1step 2.2

Put z0=−1/λ and Q(z):=DT(I−P)(z). On M, T(I−P) is zero; on N, it is T∣N. If N≠{0}, [A8] excludes λ from σ(T∣N), so IN+z0T∣N=(λIN−T∣N)/λ has a bounded inverse. Its direct-sum inverse with IM is bounded because the projections P and I−P are bounded. If N={0}, the complementary operator is just the identity on M. Thus I+z0T(I−P) is boundedly invertible on H. Since T(I−P) is trace class by step 2.2, step 2.1 yields Q(z0)≠0.

4.1A10A20step 3.1step 3.2step 3.3

By steps 3.1 and 3.2, DT(z)=λd(z−z0)dQ(z). The function Q is entire by [A10], and step 3.3 gives Q(z0)≠0; since λ≠0, λdQ is holomorphic and nonzero at z0. Thus [A20] shows that DT has a zero of order d=malg(λ;T) at z0.

5.1A2A3A4A10step 1.2step 4.1algebra

If z≠0 and I+zT is not boundedly invertible, set λ=−1/z. Then I+zT=z(T−λI), so λ∈σ(T); by [A2] and [A3], T is a compact operator on a complex Banach space, and [A4] makes λ an eigenvalue. Step 4.1 applies and gives DT(z)=0. The case z=0 is invertible and has DT(0)=1 by [A10].

6.1A4step 2.1step 5.1

If I+zT is boundedly invertible, step 2.1 with U=T gives DT(z)≠0; together with step 5.1 this proves both directions of the stated iff. For every nonzero spectral value, [A4] supplies an eigenvalue, so step 4.1 proves the multiplicity claim on the full nonzero spectrum.

7.1

The zero operator and zero Hilbert space are covered by step 1.1; on H=C with T=tI, the determinant is 1+zt, so for t≠0 its zero is simple and malg(t;T)=1, while t=0 has no zero and every I+zT is invertible. An empty nonzero spectrum yields no noninvertible I+zT by step 5.1. There is no interval parameter or one-sided endpoint. The exact assumption is AC [A1]; it is used through the Riesz–Schauder, Riesz-projection, and algebraic-multiplicity suppliers, and AC supplies the ACω required by the local determinant and trace-class suppliers through [A15]. The finite Jordan-string argument makes no additional choice. Both iff directions were proved in step 6.1; the multiplicity assertion is a factorization claim, not an iff. [A1, A4, A15, step 1.1, step 4.1, step 5.1, step 6.1] \qed

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

A quasinilpotent trace-class operator has zero trace

Statement

Assume the Axiom of Choice. Let H be a separable complex Hilbert space and let Q:H→H be trace class with σ(Q)⊆{0}. Then tr⁡(Q)=0andDQ(z)=1(z∈C), where DQ is the locally constructed determinant.

Facts & Assumptions

Given: AC; a separable complex Hilbert space H; and a trace-class operator Q:H→H whose spectrum is contained in {0}.

[A1]

AC selects from every family of nonempty sets (The Axiom of Choice).

[A2]

A complex Hilbert space is a Banach space in its induced norm (Hilbert space).

[A3]

A trace-class operator is a compact bounded operator (Trace class operator).

[A4]

The spectrum is the complement of the resolvent set (Spectrum and resolvent of a bounded operator).

[L1]

A scalar is in the resolvent set exactly when λI−Q is bijective with a bounded inverse (Spectrum and resolvent of a bounded operator).

[A5]

For trace-class T on a separable complex Hilbert space, DT(z)=0⟺I+zT is not boundedly invertible (Zeros of the local Fredholm determinant).

[A6]

The local exterior-trace series defines an entire determinant (Local separable trace-class determinant construction).

[L2]

It satisfies DT(0)=1 and DT′(0)=tr⁡(T) (Local separable trace-class determinant construction).

[A7]

For bounded finite-rank F and finite-dimensional invariant E with ran⁡F⊆E, DF(z)=det⁡E(IE+z(F∣E)), including the zero-dimensional case (Local separable trace-class determinant construction).

[A8]

For every ε>0 there is Cε≥0 such that ∣DT(z)∣≤Cεeε∣z∣(z∈C) (Trace-norm continuity, growth and multiplicativity of the local determinant).

[A10]

For x>0, log⁡x is the unique real y with exp⁡(y)=x (The natural logarithm as the inverse of the exponential function).

[L5]

For positive x,y, log⁡(xy)=log⁡x+log⁡y (Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm).

[L4]

aa‾=∣a∣2 and the modulus is nonnegative (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive); applying this also to a‾ gives ∣a‾∣=∣a∣.

[A14]

AC implies DC and hence Countable Choice (AC implies DC implies countable choice); this supplies the choice assumptions used by the trace-class and determinant inputs.

Source audit: Kostenko, Trace Ideals with Applications, §3.4.4, Theorem 3.4.5 and the proof of Theorem 3.4.7 (printed pp. 40–42; PDF pp. 49–51) were read in full. The displayed proof of the spectral product and trace identity invokes the preceding Hadamard factorization theorem. This item does not use that factorization or the later library lemma on zero-free entire functions: steps 3.1–6.1 give the needed logarithm, disk estimate and Liouville argument locally. The cited source was a comparison, not a premise of this proof.

Proof

technique · direct
1.1A2A3A4L1A5algebra

Let z≠0 and set λ=−1/z. The spectral hypothesis gives λ∉σ(Q); [A2] and [A3] put Q in the bounded-operator spectrum setting. By [A4, L1], λI−Q has a bounded inverse, and I+zQ=−z(λI−Q) is boundedly invertible. The local zero criterion [A5] gives DQ(z)≠0.

2.1A5A6L2step 1.1

At z=0, [L2] gives DQ(0)=1. Thus [A5] and step 1.1 make DQ zero-free on C, while [A6] makes it entire.

4.1A8A10A11A12step 3.1

For every z, [A8] with ε=1 gives ∣f(z)∣≤C1e∣z∣ for some C1≥1, since f(0)=1. The exponential modulus formula [A12] gives eRe⁡h(z)≤C1e∣z∣; [A10, A11] then imply Re⁡h(z)≤A+∣z∣, where A=log⁡C1≥0.

5.1step 4.1construct

We prove the required disk estimate. Fix w≠0 and 0<t<1, let R=∣w∣/t and K=A+R+1. For ∣ζ∣<1, set u=h(Rζ) and G(ζ)=u/(2K−u). The bound from step 4.1 gives Re⁡u≤A+R, so K−Re⁡u≥1 and ∣2K−u∣2−∣u∣2=4K(K−Re⁡u)>0. Thus G is holomorphic, G(0)=0, and ∣G∣<1. The local power series of G shows that G(ζ)/ζ extends holomorphically through zero. On every circle ∣ζ∣=r<1, the maximum-modulus principle bounds this quotient by 1/r; letting r↑1 gives ∣G(ζ)∣≤∣ζ∣ (The sum of a complex power series is analytic throughout its open disc of convergence, Boundary maximum modulus principle on a bounded domain). Since ∣G∣=∣u∣/∣2K−u∣, this implies ∣u∣≤∣ζ∣(2K+∣u∣) and hence ∣u∣≤2K∣ζ∣/(1−∣ζ∣). Take ζ=tw/∣w∣, so Rζ=w and ∣ζ∣=t. Therefore ∣h(w)∣≤2Kt1−t=2t(A+1)+2∣w∣1−t. Letting t↓0 gives ∣h(w)∣≤2∣w∣; it also holds at w=0 because h(0)=0.

6.1L2A6step 3.1step 5.1

The quotient q(z)=h(z)/z extends to an entire function by the local power series of h, with q(0)=h′(0). Step 5.1 gives ∣q(z)∣≤2 for z≠0, so continuity bounds it at zero as well. Liouville's theorem (Liouville's theorem: every bounded entire function is constant) makes q constant, hence h(z)=az with a=h′(0)=f′(0)/f(0)=DQ′(0)/DQ(0). Thus DQ(z)=eaz.

7.1L2step 6.1

By [L2] and DQ(0)=1, the coefficient in step 6.1 is a=DQ′(0)=tr⁡(Q).

7.2L2A8A10A11L5A12A13L4step 6.1algebra

Suppose for contradiction that a≠0, and choose ε=∣a∣/2>0. The bound [A8] has Cε≥1 by evaluation at zero and [L2]. Set t=2(log⁡Cε+1)/∣a∣>0 and zt=ta‾/∣a∣. By [A13, L4], ∣zt∣=t and azt=t∣a∣. Using step 6.1, [A12] and the [A8] bound gives et∣a∣=∣DQ(zt)∣≤Cεeεt. Apply [A10, A11, L5] to take logarithms: t∣a∣≤log⁡Cε+εt, hence t∣a∣/2≤log⁡Cε. But the definition of t makes the left side log⁡Cε+1, a contradiction. Thus a=0.

7.3A1A4L1L2A7A14step 1.1step 6.1

If Q=0, [A7] with E={0} gives DQ≡1, and [L2] then gives tr⁡(Q)=DQ′(0)=0; this includes H={0}. On H=C with Q=qI, the spectral condition forces q=0. Indeed, if q≠0, then Q1=q1 and qI−Q=0 is not invertible, so [A4, L1] give q∈σ(Q). For q=0, [A7] with E=H calculates DQ(z)=1+zq=1, and [L2] gives trace zero. If σ(Q)=∅, step 1.1 still applies for every nonzero z and no spectral enumeration is used. There is no endpoint parameter. The exact assumption is AC [A1]; it supplies ACω through [A14] for the trace-class and determinant inputs. The scalar argument uses no further choice. The claim is an implication, not an equivalence, so both iff directions are inapplicable.

8.1

Step 6.1 with a=0 gives DQ(z)=1 for every z; step 7.1 gives tr⁡(Q)=0. This proves both conclusions. [step 6.1, step 7.1, step 7.2] \qed

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

Trace decomposition through generalized eigenspaces and the invariant quotient

Statement

Assume the Axiom of Choice. Let H be a separable complex Hilbert space and let T:H→H be trace class. Write Λ(T)={λ∈σ(T):λ≠0}, let Gλ(T) be the generalized eigenspace and let malg(λ;T)=dim⁡Gλ(T). Define M:=span⁡{Gλ(T):λ∈Λ(T)}‾,P:=PM,Q:=I−P, where PM is the Hilbert orthogonal projection onto M. Put TM:=T∣M and D:=(QTQ)∣M⊥. Then TM and D are trace class, and D has no nonzero spectral values (the assertion is vacuous if M⊥={0}). With traces taken on their displayed Hilbert spaces, tr⁡H(T)=tr⁡M(TM)+tr⁡M⊥(D),tr⁡M(TM)=∑λ∈Λ(T)malg(λ;T)λ, and the eigenvalue sum is absolutely convergent. The extension QTQ:H→H is quasinilpotent and has trace zero.

Facts & Assumptions

Given: AC; a separable complex Hilbert space H; and a trace-class operator T:H→H.

[A1]

AC selects from every family of nonempty sets (The Axiom of Choice).

[A2]

In ZF, AC⇒DC⇒ACω (AC implies DC implies countable choice).

[A3]

A complex Hilbert space is a Banach space in its induced norm (Hilbert space).

[A4]

A trace-class operator is compact and bounded (Trace class operator).

[A5]

A compact operator on a complex Banach space has finite-dimensional generalized eigenspaces at its nonzero spectral values; every such value is an eigenvalue, and only finitely many spectral values have modulus at least any fixed ε>0 (Riesz schauder spectrum of a compact operator).

[A6]

For each nonzero eigenvalue λ, Gλ(T) is the stabilized kernel of (T−λI)m, is finite dimensional, and malg(λ;T)=dim⁡Gλ(T)=rank⁡Pλ (Algebraic multiplicity of a nonzero compact-operator eigenvalue).

[A7]

For an isolated spectral value, the Riesz projection is a bounded idempotent commuting with T, its range and kernel are closed invariant subspaces giving a direct sum, and the restriction spectra are the two spectral parts (Riesz spectral projection, Riesz spectral projection properties).

[A8]

A subspace W is T-invariant when T(W)⊆W, and this invariance makes Tˉ(v+W):=T(v)+W a well-defined linear operator on H/W with canonical projection π:H→H/W satisfying πT=Tˉπ (Invariant subspaces, restrictions, and induced quotient operators, The quotient vector space V/W and its canonical projection, Invariance makes the induced quotient operator well defined and linear, with πT=Tˉπ).

[A9]

The quotient seminorm is ∥x+W∥=inf⁡w∈W∥x+w∥ and is a norm when W is closed (The quotient seminorm (|x+M|{X/M}=\inf{m\in M}|x+m|=\operatorname{dist}(x,M)), The quotient seminorm is a norm exactly when the subspace is closed).

[A10]

Under AC, if X is Banach and K:X→X is compact, then I−K is injective if and only if it is surjective, and either condition gives a bounded inverse (Fredholm alternative for identity minus compact).

[A11]

A trace-class operator remains trace class after composition on either side with bounded maps between Hilbert spaces (Trace class is a two sided Banach operator ideal).

[A12]

For every supplied Hilbert basis E of a trace-class operator S, its relative trace is tr⁡E(S)=∑e∈E⟨Se,e⟩; the series is absolutely convergent, and the trace theorem identifies it with the basis-independent trace tr⁡(S) (Trace of a trace class operator, Trace is absolutely convergent and basis independent).

[A13]

A closed subspace of a Hilbert space is Hilbert; an orthogonal projection onto a closed subspace gives H=M⊕M⊥, is self-adjoint, and is contractive (Orthogonal decomposition by a closed subspace, The Hilbert orthogonal projection onto a closed subspace, Hilbert projections are linear, self-adjoint and contractive).

[A14]

From a supplied dense sequence in a Hilbert space, Gram--Schmidt gives a finite or countable Hilbert basis (A Hilbert space with a dense sequence has a finite or countable orthonormal basis).

[A15]

For a trace-class compact operator, the eigenvalue sequence repeated by algebraic multiplicity can be listed so that ∑j∣λj(T)∣≤∥T∥1 (Weyl product and sum inequalities for compact operators).

[A16]

Every finite-dimensional nilpotent endomorphism has an ordered basis concatenating Jordan strings (Every finite-dimensional nilpotent endomorphism has a basis of Jordan strings); on a string (v1,…,vm) at λ, (T−λI)v1=0 and (T−λI)vj=vj−1 for j≥2 (Jordan blocks, Jordan strings, and their endpoints).

[A17]

If S is trace class on a separable complex Hilbert space and σ(S)⊆{0}, then tr⁡(S)=0 (A quasinilpotent trace-class operator has zero trace).

[A18]

The complex inner product is linear in its first argument and conjugate-linear in its second (Real and complex inner-product spaces and their induced length).

[A19]

A closed linear subspace of a Banach space is Banach in its induced norm (A closed subspace of a Banach space is Banach).

[A20]

For a bounded operator on a complex Banach space, λ∉σ(T) exactly when λI−T is bijective with bounded inverse (Spectrum and resolvent of a bounded operator).

[A21]

Boundedness of T supplies a constant CT≥0 with ∥Tx∥≤CT∥x∥ for every x∈H (A bounded linear operator between normed spaces).

[A22]

Separability of H supplies a dense sequence in H (Separability: the existence of an at most countable dense subset).

Choice accounting: The exact assumption is AC. It supplies DC for Riesz--Schauder/Fredholm suppliers and ACω for trace, projection and separable-basis suppliers. The Weyl list supplies an enumeration of the nonzero eigenvalue multiset; ACω permits choosing Jordan-string bases for its countably many finite-dimensional generalized eigenspaces. The basis of M⊥ is obtained by projecting a supplied dense sequence of H and applying the choice-free Gram--Schmidt construction. No ambient basis is used without being supplied or constructed.

Source audit: Kostenko's §3.4.4 proof of Theorem 3.4.7 derives the spectral product and trace identity by invoking Theorem 3.4.5, the Hadamard minimal-type product formula. Van Neerven's Theorem 14.33 proof obtains the determinant spectral product from Theorem 14.43, whose proof invokes Lemma 14.42; Proposition 14.22 separately gives the eigenvalue absolute-sum bound and uses finite-dimensional invariant generalized-eigenspace sums. These routes are comparison only. This item proves the trace on M using an adapted orthonormal basis and proves the compressed quotient has no nonzero spectrum using Riesz splitting and the compact Fredholm alternative. Kostenko's Theorem 3.4.7 proof and van Neerven's Proposition 14.22 and Theorem 14.33 arguments were read in full; no source premise is left unverified.

Proof

technique · direct
1.1A3A4algebra

If H={0}, then M=M⊥={0}, all operators and traces in the claim are zero, and the eigenvalue sum is empty; hence assume H≠{0}.

2.1A3A4A6A13step 1.1algebra

Each Gλ(T) is T-invariant because (T−λI)mTx=T(T−λI)mx=0 for x∈Gλ(T); boundedness of T then makes its closed span M invariant. By [A13], P=PM and Q=I−P are bounded orthogonal projections, H=M⊕N with N=M⊥, and both M,N are closed Hilbert subspaces.

3.1A11step 2.1algebra

Let iM:M↪H and iN:N↪H be inclusions. Invariance gives TM=PTiM, while D=QTiN and B:=QTQ on H; by [A11] all three are trace class, and B∣M=0, B∣N=D.

4.1A1A2A6A12A15A16A18step 3.1algebra

Let (λj) be the finite or countable nonzero eigenvalue list from [A15], repeated by algebraic multiplicity. For each distinct λ, choose a Jordan-string basis of Gλ(T) for (T−λI)∣Gλ(T) using [A6, A16]. These generalized eigenspaces are linearly independent: in a finite relation ∑μxμ=0, xμ∈Gμ, applying Rλ=∏μ≠λ(T−μI)mμ kills every other term, while each factor on Gλ is (λ−μ)I+Nλ with Nλ nilpotent and hence invertible by a finite geometric sum; thus xλ=0. Order the distinct eigenvalues by their first occurrence in (λj) and concatenate their string bases. Every finite initial span is T-invariant, and its successive one-dimensional quotient acts by the corresponding eigenvalue. Applying Gram--Schmidt preserves these initial spans, so it gives a Hilbert basis (ej) of M with Tej−λj′ej∈span⁡(e1,…,ej−1), where (λj′) is a reordering of (λj). By [A12], [A18], and [A15], tr⁡M(TM)=∑j⟨Tej,ej⟩=∑jλj′=∑jλj, and the sum is absolutely convergent. The empty and finite lists give the empty and finite bases.

4.2A8A9A13A21step 2.1step 3.1algebra

Let X:=H/M with its quotient norm and let π:H→X be the canonical projection. By [A8, A9], Tˉ(x+M)=Tx+M is well defined. For m∈M, Tx+Tm∈Tx+M, so [A21] gives ∥Tˉ(x+M)∥≤CT∥x+m∥; taking the infimum over m shows that Tˉ is bounded. The map J:N→X, J(n)=n+M, is an isometric isomorphism: every coset has the representative Qx∈N, and ∥n+M∥=inf⁡m∈M∥n−m∥=∥n∥ by orthogonality. For D=QT∣N, JD=TˉJ.

5.1A12A13A14A22step 2.1step 3.1

By [A22] take a dense sequence (hj) in H. Contractivity of P,Q makes (Phj) dense in M and (Qhj) dense in N, so [A14] supplies Hilbert bases EM of M and EN of N; the basis of M may be the adapted one from step 4.1. Their union is a Hilbert basis of H. For e∈EM, Te=TMe; for f∈EN, Tf−Bf=PTf∈M⊥f, and Be=0. Summing the absolutely convergent diagonal series from [A12] over these two disjoint basis parts yields tr⁡H(T)=tr⁡M(TM)+tr⁡H(B) and tr⁡H(B)=tr⁡N(D).

5.2A3A4A8A10A13A19A20step 2.1step 3.1step 4.2algebra

Fix λ≠0 with λ∉σ(T) and set A=λI−T. By [A20], A has a bounded inverse on H. Its restriction to M is injective; A∣M=λ(IM−TM/λ), where TM is compact by [A4, step 3.1], and M is Banach by [A3, A13, A19]. The Fredholm alternative [A10] makes A∣M surjective with bounded inverse. Consequently A−1(M)=M and the induced quotient operator Aˉ=λIX−Tˉ has the bounded inverse induced by A−1.

5.3A3A4A5A6A7A8A9A10A19A20step 2.1step 3.1step 4.2algebra

Fix λ≠0 with λ∈σ(T). By [A5], λ is an eigenvalue; the finiteness of every nonzero spectral annulus isolates it, so [A7] gives the Riesz projection Pλ, with G:=Gλ(T)=ran⁡Pλ and Y:=ker⁡Pλ. Put M0:=M∩Y. For x∈Gμ(T) with μ≠λ, Pλx∈G and (T−μI)mPλx=Pλ(T−μI)mx=0; on G, T−μI=(λ−μ)I+Nλ is invertible, so Pλx=0, while Pλ is the identity on G. Continuity and the definition of M give Pλ(M)⊆G⊆M, hence M=G⊕M0. If Y≠{0}, [A7] gives that AY:=λIY−T∣Y is boundedly invertible; its restriction to M0 is injective. The subspace M0 is closed in M, so [A19] makes it Banach. The restriction T∣M0 is compact because a bounded sequence in M0 has a subsequence whose T-images converge in H, and the limit lies in M0 by closedness. Thus [A10] makes A∣M0=λ(IM0−T∣M0/λ) boundedly invertible and AY−1(M0)=M0. Thus AY and its inverse both preserve M0, so they induce mutually inverse bounded operators on Y/M0. The map Φ:Y/M0→H/M, y+M0↦y+M, is well defined and bounded: changing y by an element of M0 does not change its image, and ∥y+M∥≤∥y+M0∥. It is onto because x+M=(I−Pλ)x+M and (I−Pλ)x∈Y; it is one-to-one because Y∩M=M0. Its inverse is therefore x+M↦(I−Pλ)x+M0. This inverse is well defined since (I−Pλ)M⊆M0, and bounded with norm at most ∥I−Pλ∥: for every m∈M, (I−Pλ)(x+m) represents the same image modulo M0, so taking the infimum over m gives the bound. The map Φ intertwines the induced operators because AYy+M=Ay+M for y∈Y. Hence Aˉ=λIX−Tˉ is boundedly invertible. If Y={0} then Pλ=IH, so G=H⊆M, hence M=H and X={0}, whose unique endomorphism is bijective, giving the same quotient conclusion.

6.1A20step 4.2step 5.2step 5.3algebra

Steps 5.2--5.3 show that λIX−Tˉ is boundedly invertible for every λ≠0. By step 4.2, λIN−D is also boundedly invertible. Since B=0M⊕D on the orthogonal sum H=M⊕N, the operator λIH−B=λIM⊕(λIN−D) has a bounded inverse for every λ≠0. Thus [A20] gives σH(B)⊆{0}; the compression D has no nonzero spectral values whenever N≠{0}.

7.1

Apply [A17] to the trace-class quasinilpotent operator B on the original separable H to get tr⁡H(B)=0. Step 5.1 then gives tr⁡H(T)=tr⁡M(TM), and step 4.1 identifies this with the absolutely convergent eigenvalue sum. If there are no nonzero eigenvalues then M=0, B=T, and the same argument yields the empty sum 0; this includes T=0. If H=C and T=qI, then for q≠0 the sole eigenvalue is q with multiplicity one, M=H, and the two traces are q and 0; for q=0 the eigenvalue list and M are empty/zero and all traces vanish. There is no endpoint parameter, and the statement is not an equivalence, so both iff directions are inapplicable. AC is explicit in [A1] and propagates to ACω through [A2] for the trace, Weyl, projection and basis suppliers. [A1, A2, A17, step 4.1, step 5.1, step 6.1] \qed

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

Spectral product from traces of powers

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let H be a separable complex Hilbert space (Hilbert space) and let T:H→H be trace class (Trace class operator). List its nonzero eigenvalues λj(T), repeated according to algebraic multiplicity (Algebraic multiplicity of a nonzero compact-operator eigenvalue). Then DT(z)=∏j≥1(1+zλj(T))(z∈C), where DT is the locally constructed determinant of Local separable trace-class determinant construction. The product converges locally uniformly; if the nonzero eigenvalue list is empty, the product is one.

Facts & Assumptions

Given: AC, a separable complex Hilbert space H, a trace-class operator T:H→H, and the eigenvalue list supplied by the Weyl inequality below.

[A1]

AC implies Dependent Choice and Countable Choice; the latter supplies the countable-choice hypotheses of the trace-class, determinant and trace constructions (The Axiom of Choice, AC implies DC implies countable choice).

[A2]

A trace-class operator is compact and bounded (A bounded linear operator between normed spaces); composing a trace-class operator with bounded operators preserves trace class and obeys the two-sided trace-norm ideal estimate (Trace class operator, Trace class is a two sided Banach operator ideal).

[A3]

If H≠{0} is a complex Hilbert space (Hilbert space), it is Banach; hence B(H) is Banach by If (Y) is Banach then (\mathcal B(X,Y)) is Banach. Composition is associative and its operator norm is submultiplicative (The operator norm as the least bound and as the unit-sphere or unit-ball supremum, Composition satisfies |ST|\le|S|,|T|). The identity has norm 1 and is nonzero, so this is a nonzero unital complex Banach algebra (Unital Banach algebra).

[A4]

In a unital complex Banach algebra, ∥a∥<1 implies that 1−a is invertible with inverse ∑k≥0ak (Neumann series).

[A5]

The spectrum of T as an operator is the spectrum of the corresponding element of B(H); in a unital complex Banach algebra polynomial spectral mapping gives σ(Tn)={λn:λ∈σ(T)} (Spectrum and resolvent of a bounded operator, Spectrum and resolvent set in a Banach algebra, Polynomial spectral mapping).

[A6]

Under AC, every nonzero spectral value of a compact operator is an eigenvalue with a finite-dimensional generalized eigenspace, and its generalized eigenspace stabilizes; its dimension is its algebraic multiplicity (Riesz schauder spectrum of a compact operator, Algebraic multiplicity of a nonzero compact-operator eigenvalue).

[A7]

A degree-n complex polynomial has n roots counted with multiplicity; polynomial evaluation at an endomorphism preserves sums and products (A complex polynomial of degree n has exactly n roots counted with multiplicity, Polynomial evaluation at an endomorphism: p(T)=∑kakTk).

[A8]

If coprime polynomials f,g satisfy (fg)(S)=0 for an endomorphism S, then its space is the direct sum ker⁡f(S)⊕ker⁡g(S) (If gcd⁡(f,g)=1 and (fg)(T)=0, then V=ker⁡f(T)⊕ker⁡g(T)).

[A9]

Under AC, for every trace-class S on a separable complex Hilbert space, tr⁡(S)=∑μ∈σ(S)∖{0}malg(μ;S)μ, and this eigenvalue sum is absolutely convergent (Trace decomposition through generalized eigenspaces and the invariant quotient).

[A10]

The nonzero eigenvalues of a compact trace-class T, repeated by algebraic multiplicity, can be listed as λj(T) with ∑j≥1∣λj(T)∣≤∥T∥1; a finite list may be padded by zeros (Weyl product and sum inequalities for compact operators).

[A11]

The trace is linear and ∣tr⁡(S)∣≤∥S∥1 for trace-class S (Trace is absolutely convergent and basis independent).

[A12]

For separable complex H, DT is entire; if I+zT is boundedly invertible, then DT′(z)=DT(z)tr⁡ ⁣(T(I+zT)−1) (Local separable trace-class determinant construction, Logarithmic derivative of the local Fredholm determinant).

[A13]

Complex polynomials are entire; a locally uniform limit of holomorphic functions is holomorphic and the derivatives of the approximants converge locally uniformly to the derivative of the limit (Complex polynomials are entire with the power-rule derivative, and rational functions are holomorphic wherever their denominator is nonzero, Locally uniform limits of holomorphic functions are holomorphic and their derivatives converge locally uniformly).

[A14]

The complex quotient rule holds where the denominator is nonzero; a holomorphic function with identically zero derivative on a domain is constant; holomorphic functions on a domain that agree on a set with an interior accumulation point agree throughout the domain (Linearity, product, reciprocal, and quotient rules for complex derivatives, A complex domain is a nonempty connected open subset of C, A holomorphic function with zero derivative on a domain is constant, Identity theorem for holomorphic functions).

[A15]

The exterior construction has degree-zero operator IC and for n≥1 sends the induced operator of the zero map to zero (Hilbert exterior powers and induced operators).

[A16]

For the local determinant, DT(z)=0 if and only if I+zT is not boundedly invertible (Zeros of the local Fredholm determinant).

Source-route audit. Kostenko, §3.4.4, Theorem 3.4.7, obtains the spectral product by combining the determinant zero criterion with Theorem 3.4.5, Hadamard's minimal-type product formula, and Weyl summability. Van Neerven, §14.5.a, Theorem 14.43, obtains the same product from Lemma 14.42, which invokes Hadamard factorization. Dyatlov–Zworski, Appendix B §B.6, states the product and trace formula and begins the determinant proof with its zero set and multiplicities. These complete source passages were read as comparison arguments; none is used as proof here. This item derives the equality from the trace-power identity and the local logarithmic derivatives. No Hadamard-factorization premise is used.

Proof

technique · direct

Given: The data in the statement. Write S:=∑j≥1∣λj(T)∣, which is finite by [A10].

1.1A12A15

If H={0} or T=0, then every positive-degree exterior power of T is zero by [A15], so the determinant series gives DT≡1. There are no nonzero eigenvalues, so the product is empty and equals one. We henceforth assume H≠{0} and T≠0.

1.2A1A2A3A4A5

By [A1], AC supplies the Dependent Choice and Countable Choice assumptions used below. By [A2], T is compact and bounded. The algebra result [A3] applies to the nonzero complex Hilbert space H, so the Neumann series [A4] and polynomial spectral mapping [A5] apply in B(H). The operator spectrum and the algebra spectrum agree by [A5].

1.3A10A13algebra

For each nonzero eigenvalue λ of T, an eigenvector x≠0 satisfies ∣λ∣∥x∥=∥Tx∥≤∥T∥∥x∥. Hence ∣λj(T)∣≤∥T∥ for every j. Let PN(z):=∏j=1N(1+zλj(T)), with P0=1. For ∣z∣≤R and m<N, ∣∏j=m+1N(1+zλj(T))−1∣≤∏j=m+1N(1+R∣λj(T)∣)−1≤eR∑j>m∣λj(T)∣−1. Also ∣Pm(z)∣≤eRS. Since the right-hand tail tends to zero, (PN) is uniformly Cauchy on every closed disk of finite radius. Its limit Φ(z):=lim⁡N→∞PN(z) is locally uniform, and [A13] makes Φ entire. For a finite eigenvalue list, zero padding makes PN eventually constant; for an empty list, every PN is 1.

1.4A3A4A10A16

Since T≠0, ∥T∥>0. Choose r>0 with r∥T∥<1 and rS<1/2 (the second condition is automatic when S=0). For ∣z∣<r, every factor is nonzero, and for every finite N, ∣PN(z)∣≥∏j=1N(1−∣z∣∣λj(T)∣)≥1−∣z∣∑j=1N∣λj(T)∣>1/2. The finite-product inequality follows by induction from ∏j(1−aj)≥1−∑jaj for 0≤aj≤1. Passing to the limit shows ∣Φ(z)∣≥1/2, so Φ has no zeros on this disk. Also ∥zT∥<1, so [A4] makes I+zT invertible; [A16] then gives DT(z)≠0 there.

1.5A2A9

For every integer n≥1, [A2] shows inductively that Tn is trace class and ∥Tn∥1≤∥T∥1∥T∥n−1. In particular, Tn is compact and the trace decomposition [A9] applies to Tn.

1.6A5A6A7A8

Fix n≥1 and μ≠0 in σ(Tn). By [A5], μ=λn for some λ∈σ(T). The roots α of xn−μ are all distinct: if αn=μ≠0, then the derivative nαn−1 is nonzero. By [A7], xn−μ=∏αn=μ(x−α),(Tn−μI)k=∏αn=μ(T−αI)k. The factors (x−α)k are pairwise coprime. Put V:=ker⁡∏αn=μ(T−αI)k. Since its defining polynomial commutes with T, V is T-invariant. On V that product annihilates T∣V. Apply [A8] first to one factor and the product of the rest, then repeat on the remaining product-kernel. A vector in any one factor-kernel is already in V, so this gives ker⁡(Tn−μI)k=⨁αn=μker⁡(T−αI)k. Choose k at least the finitely many stabilization exponents for Tn at μ and for T at the roots α. By [A6], this proves Gμ(Tn)=⨁αn=μGα(T),malg(μ;Tn)=∑αn=μα∈σ(T)malg(α;T). Roots outside σ(T) have zero generalized eigenspace and are omitted. This gives the collision multiplicities for every nonzero eigenvalue of Tn.

2.1A9A10step 1.6algebra

Apply [A9] to Tn and group by the finitely many roots of each μ. The grouping is legitimate because ∑j≥1∣λj(T)∣n≤∥T∥n−1∑j≥1∣λj(T)∣<∞. Using the multiplicity identity established above gives, for every n≥1, tr⁡(Tn)=∑μ∈σ(Tn)∖{0}malg(μ;Tn)μ=∑j≥1λj(T)n. If the nonzero eigenvalue list is empty, both sides are zero by [A9].

3.1A2A4A11A12step 1.4step 2.1

On ∣z∣<r, the Neumann expansion from [A4] and the ideal estimate [A2] give convergence in trace norm: T(I+zT)−1=∑k≥0(−z)kTk+1,∑k≥0∥zkTk+1∥1≤∥T∥1∑k≥0(∣z∣∥T∥)k<∞. Trace linearity and its trace-norm bound [A11] therefore permit taking traces term by term. Dividing the logarithmic-derivative identity [A12] by the nonvanishing determinant established above, and using the trace-power identity already established, yields DT′(z)DT(z)=∑k≥0(−1)kzktr⁡(Tk+1)=∑k≥0(−1)kzk∑j≥1λj(T)k+1.

4.1A10A13step 1.4step 2.1step 3.1algebra

For each finite N, the product rule [A13] gives on ∣z∣<r PN′(z)PN(z)=∑j=1Nλj(T)1+zλj(T). The denominators are bounded below by 1−r∥T∥>0. On each closed disk ∣z∣≤ρ<r, the right side converges uniformly as N→∞, because its tail is bounded by (1−ρ∥T∥)−1∑j>N∣λj(T)∣. By [A13], PN→Φ and PN′→Φ′ locally uniformly. Since Φ has no zeros on ∣z∣<r, taking the limit gives Φ′(z)Φ(z)=∑j≥1λj(T)1+zλj(T). For ∣z∣≤ρ<r, expand each denominator geometrically. The double series is absolutely convergent because ∑j≥1∑k≥0ρk∣λj(T)∣k+1≤S1−ρ∥T∥<∞. Thus it may be rearranged, and the trace-power identity gives Φ′(z)Φ(z)=∑k≥0(−1)kzk∑j≥1λj(T)k+1=∑k≥0(−1)kzktr⁡(Tk+1)=DT′(z)DT(z).

5.1A12A14step 1.3step 1.4step 4.1

The disk U={z:∣z∣<r} is a complex domain. Since Φ is nonzero there, Q:=DT/Φ is holomorphic on U. The quotient rule [A14] and the derivative equality above give Q′=0 on U. Hence [A14] makes Q constant; as DT(0)=Φ(0)=1, Q≡1 on U. Thus DT=Φ on a nonempty open disk. Both functions are entire by [A12] and the locally uniform product construction. The identity theorem [A14] extends their equality to all of C, and the product convergence is locally uniform by construction.

6.1A1A10A12step 1.1step 1.3step 5.1

If there is exactly one nonzero eigenvalue in the list, the finite product is the single factor 1+zλ1(T) and the product and trace-power calculations above still apply. In particular, on a one-dimensional H with T=tI, the local determinant construction reduces to det⁡H(I+zT)=1+zt, which is exactly the product when t≠0, and is the empty product when t=0. The zero operator and zero-dimensional space were handled above; finite lists stabilize in the product construction; no finite-dimensionality or nonzero-eigenvalue assumption is made for the general case. All disks used above have positive radius and every estimate is on a compact disk strictly inside the chosen radius; global equality includes every complex endpoint. AC is the exact assumption [A1], inherited by the spectral and trace suppliers, with no additional choice made. The conclusion is an equality, not an iff statement, so both iff directions are inapplicable.

\qed

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30Open item page →

Arbitrary-Hilbert Fredholm determinant from a separable reducing support

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let H be any complex Hilbert space and let T:H→H be trace class (Hilbert space, Trace class operator). For a nuclear representation Tx=∑j≥1⟨x,uj⟩vj,∑j≥1∥uj∥ ∥vj∥<∞, put M=span⁡C{uj,vj:j≥1}‾. Then M is separable and reducing for T, and under H=M⊕M⊥ one has T=S⊕0, where S=T∣M is trace class. Let DS be the locally constructed separable determinant of Local separable trace-class determinant construction and define DH(I+zT):=DS(z). This definition is independent of the nuclear representation and, more generally, of any closed separable support N satisfying T(H)⊆N and T∣N⊥=0; such an N reduces T. The result is entire, has value 1 at z=0, and satisfies the locally uniform product DH(I+zT)=∏j(1+zλj(T)), where the nonzero eigenvalues are repeated according to algebraic multiplicity (Algebraic multiplicity of a nonzero compact-operator eigenvalue). If T has finite rank, then for every finite-dimensional E⊆H containing ran⁡T, DH(I+zT)=det⁡E(IE+z(T∣E)), with determinant on the zero-dimensional space equal to 1 (The determinant of an endomorphism of a finite-dimensional vector space: its matrix determinant in an ordered basis in positive dimension, and 1 on the zero space).

Facts & Assumptions

Given: AC, a complex Hilbert space H, a trace-class operator T, and a nuclear representation as in the statement when one is fixed.

[A1]

AC is the principle that every family of nonempty sets has a choice function. It implies DC and Countable Choice, which are the exact choice strengths used by the Hilbert projection and trace-class/determinant suppliers (The Axiom of Choice, AC implies DC implies countable choice).

[A2]

Under Countable Choice, a trace-class T has a nuclear representation with operator-norm-convergent partial sums and finite sum ∑j∥uj∥∥vj∥; this is the nuclear-series characterization (Nuclear series characterizes trace norm).

[A3]

The inner product is linear in its first argument. For a bounded operator, the Hilbert adjoint satisfies ⟨Tx,y⟩=⟨x,T∗y⟩ and is uniquely determined by this identity (Real and complex inner-product spaces and their induced length, The Hilbert-space adjoint of a bounded operator). Orthogonality to M means ⟨x,m⟩=0 for every m∈M.

[A4]

The operator norm is the unit-ball supremum; scaling a nonzero vector to the unit ball gives ∥Ux∥≤∥U∥∥x∥ for each bounded U (A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[A5]

Every closed subspace N of a Hilbert space has the orthogonal decomposition H=N⊕N⊥ under Countable Choice; its projection PN is bounded with norm at most 1 (Orthogonal decomposition by a closed subspace, The Hilbert orthogonal projection onto a closed subspace, Hilbert projections are linear, self-adjoint and contractive).

[A6]

If R is trace class and A,B are bounded operators with compatible Hilbert-space domains and ranges, then ARB is trace class (Trace class is a two sided Banach operator ideal).

[A7]

The rationals are in bijection with N (Q is countably infinite), and there is a bijection π:N2→N (N×N≈N). Define c0(())=0 and ck+1(a0,…,ak)=π(a0,ck(a1,…,ak)). Then c(a0,…,ak−1)=π(k,ck(a0,…,ak−1)) is injective on all finite sequences: inverse pairing recovers the length and then every entry.

[A8]

The rationals are dense in R (The rationals embed densely in the reals). Each complex number has unique real and imaginary coordinates a+bi and modulus a2+b2 (Real and imaginary parts, complex conjugation, and modulus); hence Q+iQ is dense in C.

[A9]

A space is separable when it has an at most countable dense subset (Separability: the existence of an at most countable dense subset).

[A10]

In this library, countable means at most countable (Finite, countably infinite, countable, uncountable); N×N is bijective with N (N×N≈N). A nonempty set is at most countable exactly when there is a surjection from N onto it (A nonempty set is at most countable iff it is a surjective image of N).

[A11]

Every nonzero spectral value of a compact operator is an eigenvalue with finite-dimensional generalized eigenspace, and malg(λ;T) is the dimension of that stabilized generalized eigenspace (Trace class operator, Riesz schauder spectrum of a compact operator, Algebraic multiplicity of a nonzero compact-operator eigenvalue).

[A12]

On a separable complex Hilbert space, the local determinant construction is entire and has DS(0)=1. For finite-rank F and finite-dimensional F-invariant E containing ran⁡F, it gives DF(z)=det⁡E(IE+z(F∣E)), including det⁡{0}=1 (Local separable trace-class determinant construction).

[A13]

For a trace-class operator on a separable complex Hilbert space, the local determinant equals the locally uniform product of the nonzero eigenvalues, repeated by algebraic multiplicity; the empty product is 1 (Spectral product from traces of powers).

[A14]

The finite-dimensional operator determinant is the determinant of a matrix in an ordered basis (and is 1 on the zero space); its value is basis-independent (The determinant of an endomorphism of a finite-dimensional vector space: its matrix determinant in an ordered basis in positive dimension, and 1 on the zero space, The determinant of a linear operator is independent of the chosen ordered basis).

[A15]

The matrix determinant is given by the finite signed permutation sum (Leibniz formula) (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix).

[A16]

Cauchy--Schwarz gives ∣⟨x,y⟩∣≤∥x∥ ∥y∥ for vectors in a complex inner-product space (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[A17]

The induced inner-product norm satisfies the triangle inequality ∥u+v∥≤∥u∥+∥v∥ (The induced length is a norm).

[A18]

The Hilbert norm is complete, so H is Banach; every absolutely convergent series in a Banach space converges (Hilbert space, Series criterion for Banach spaces).

[A19]

The linear span of a set is exactly its finite linear combinations, including the empty sum (span⁡(S) is exactly the set of linear combinations of finite lists of elements of S, and span⁡(∅)={0V}).

[A20]

In a metric space, x is in the closure of A exactly when every positive-radius ball around x meets A (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space).

[A21]

The induced inner-product norm is homogeneous: ∥λv∥=∣λ∣ ∥v∥ (The induced length is a norm).

Proof

technique · direct
1.1A1A2

By [A1] and the nuclear characterization [A2], a nuclear representation exists. Fix any such representation and let M be the closed complex linear span in the statement. The argument below applies to every representation; this initial choice only constructs one support.

2.1A7A10A19A20step 1.1construct

Let w2j−2=uj and w2j−1=vj. Let Q+iQ denote the Gaussian rationals. The finite sums ∑k<rckwnk with ck∈Q+iQ and nk∈N form a subset D of M. This set is at most countable: fix a bijection η:N→Q from [A7] and a bijection π:N×N→N from [A10]. Encode each tuple (nk,ak,bk)∈N3 by π(nk,π(ak,bk)), where ck=η(ak)+iη(bk). The injective finite-sequence code in [A7] therefore codes every finite list of such tuples by a natural number. Decode each valid sequence code as the corresponding sum and send a natural number that is not a valid code to 0. This defines a surjection N→D; D is nonempty because it contains the empty sum 0. Thus [A10] makes D at most countable.

2.2A2A3A4A5A16A18A19A20A21step 1.1

Write Tnx=∑j≤n⟨x,uj⟩vj for the nuclear partial sums. For each x∈H, Tnx∈M, and Tnx→Tx by [A2]; operator-norm convergence implies pointwise convergence by the bound in [A4]. Since M is closed, Tx∈M. For each y∈H, the series wy:=∑j≥1⟨y,vj⟩uj converges absolutely in H by [A16] and therefore converges in H by [A18], because H is Banach. Its partial sums lie in M, so wy∈M. Conjugate-linearity in the second argument, the adjoint identity [A3], and inner-product continuity from [A16] give ⟨x,wy⟩=lim⁡n∑j≤n⟨x,uj⟩⟨vj,y⟩=lim⁡n⟨Tnx,y⟩=⟨Tx,y⟩. Uniqueness of the adjoint in [A3] yields T∗y=wy, so T∗(H)⊆M. If x∈M⊥, then ⟨x,uj⟩=⟨x,vj⟩=0 for every j, so the nuclear series for both Tx and T∗x vanish. Consequently M and M⊥ are invariant under both T and T∗; therefore M reduces T. The decomposition [A5] now gives T=S⊕0 on H=M⊕M⊥, where S=T∣M.

3.1A8A9A17A19A20A21step 2.1construct

The set D is dense in M. Given x∈M and ε>0, [A20] gives a point y of the span of the listed vectors with ∥x−y∥<ε/2; by [A19], write it as a finite complex linear combination y=∑k<rckwnk. By density of Q in R and the coordinate/modulus formula in [A8], each ck can be approximated by qk∈Q+iQ closely enough that ∑k<r∣ck−qk∣∥wnk∥<ε/2; if a listed vector is zero its summand is already zero. Then d=∑k<rqkwnk∈D and ∥x−d∥≤∥x−y∥+∑k<r∣ck−qk∣∥wnk∥<ε. Consequently D is a countable dense subset of M, so M is separable by [A9]. This also covers an empty sequence, a finite list, and M={0}.

3.2A3A5A6step 2.2

More generally, call a closed separable subspace N⊆H a support for T when T(H)⊆N and T(N⊥)={0}. By [A5], H=N⊕N⊥; hence T=SN⊕0 for SN:=T∣N. The adjoint identity [A3] gives T∗=SN∗⊕0, so N is reducing in the standard sense (invariant under both T and T∗). Let ιN:N↪H be inclusion and PN the projection of [A5]. Then SN=PNTιN: on N, T takes values in N and PN is the identity. The inclusion is bounded with its inherited norm, and [A5] makes PN bounded. Thus [A6] shows that SN is trace class. This applies to the representation support M of step 2.2 and to every support used below.

4.1A9A10A17A20step 3.2givenconstruct

Let N1,N2 be two reducing supports. If either is zero, the closure of their sum is the other support and is separable. Otherwise choose nonempty dense sets Xi⊆Ni by [A9]. They are countable, so by the surjection criterion in [A10] fix surjections si:N→Xi. Using the bijection π from [A10] to reindex pairs, the map (m,n)↦s1(m)+s2(n) has countable image X1+X2={x1+x2:xi∈Xi}. It is dense in N1+N2: for xi∈Ni and any ε>0, choose xi′∈Xi with ∥xi−xi′∥<ε/2, so ∥(x1+x2)−(x1′+x2′)∥<ε. Its closure L:=N1+N2‾ is therefore separable. Also T(H)⊆N1⊆L and L⊥⊆N1⊥, so T(L⊥)={0}. Hence L is a reducing support.

4.2A11step 2.2step 3.2

For any reducing support N, the decomposition H=N⊕N⊥ gives, for every λ≠0 and integer k≥1, (T−λI)k=(SN−λIN)k⊕(−λ)kIN⊥. Since (−λ)k≠0, ker⁡(T−λI)k=ker⁡(SN−λIN)k⊕{0}. Thus T and SN have the same nonzero eigenvalues and the same stabilized generalized eigenspaces and algebraic multiplicities. Both are trace class and therefore compact; their nonzero spectral values are eigenvalues by [A11], and the multiplicity is the dimension of the stabilized kernel.

5.1A13step 3.2step 4.1step 4.2

Let N1,N2 be arbitrary reducing supports and let L=N1+N2‾ from step 4.1. Each of SN1, SN2 and SL is trace class by step 3.2 and acts on a separable Hilbert space. Step 4.2 gives the same nonzero eigenvalue list, including algebraic multiplicity, for all three restrictions. The local product theorem [A13] therefore gives DSN1(z)=DSL(z)=DSN2(z)(z∈C). Taking N1,N2 to be supports arising from any two nuclear representations proves representation independence as well as independence from every separable reducing support.

6.1A12A13step 2.2step 4.2step 5.1

Define DH(I+zT):=DSM(z) using any support M. Step 5.1 makes this well-defined. By [A12], it is entire and equals 1 at z=0. By [A13], DSM(z)=∏j(1+zλj(SM)) locally uniformly. Step 4.2 identifies the nonzero eigenvalues and their algebraic multiplicities with those of T, so this is the asserted locally uniform product for T. If the eigenvalue list is empty, the product is 1; finite lists are finite products, and the formula also holds for H={0} and T=0.

7.1A12step 2.2step 6.1

Suppose T has finite rank and write R=ran⁡T. Then R⊆M by step 2.2, R is finite dimensional, and T(R)⊆R. Apply the finite-rank clause of [A12] to SM and the invariant subspace R⊆M to obtain DH(I+zT)=DSM(z)=det⁡R(IR+z(T∣R)). If R={0}, this is 1=1 by [A12] and the zero-dimensional determinant convention.

8.1A14A15step 7.1construct

Let E⊆H be any finite-dimensional subspace containing R. It is T-invariant because T(E)⊆R⊆E. For R≠{0}, extend a basis of R to a basis of E. Relative to the resulting decomposition E=R⊕F, the matrix of T∣E has block form (AB00), where A is the matrix of T∣R. Thus the matrix of IE+z(T∣E) is (IR+zAzB0IF). In any nonzero term of the Leibniz formula [A15], each of the dim⁡R columns from R must use an R row because the lower-left block is zero. Since there are exactly dim⁡R such rows, they are all occupied, so no F column can use an R row. Each F column must then use its matching identity entry in the IF block, and the remaining permutation sum is the Leibniz determinant of IR+zA. Hence det⁡E(IE+z(T∣E))=det⁡R(IR+z(T∣R)), which with step 7.1 proves the formula for every such E. When R=0, both operators are identities and both determinants are 1. Basis independence of these operator determinants is [A14].

9.1

At z=0, [A12] gives determinant one and the finite-dimensional formula is the determinant of the identity. The empty nonzero-eigenvalue list has empty product one by step 6.1; a zero operator and a zero-dimensional H are included there. A one-dimensional nonzero range is covered by step 7.1, where the finite-dimensional determinant is the corresponding single linear factor. The proof uses AC exactly as [A1] states: it supplies the Countable Choice needed to obtain the nuclear representation and the Hilbert projection, and AC-qualified spectral multiplicities; the explicit countable coding and the later comparison of supports make no further selections. The conclusion is a direct equality, not a biconditional. [A1, A11, A12, step 2.1, step 4.2, step 6.1, step 7.1] \qed

DefinitionDefinition: AI-adaptedProof: AI-adaptedaudited 2026-09-22Open item page →

Fredholm determinant of a trace-class operator

Definition

Assume the Axiom of Choice (The Axiom of Choice). Let H be a complex Hilbert space and let T∈S1(H) (Trace class operator). Choose a nuclear representation Tx=∑j≥1⟨x,uj⟩vj,∑j≥1∥uj∥ ∥vj∥<∞, and put M=span⁡‾{uj,vj:j≥1} and S=T∣M. The Fredholm determinant of I+zT is

det⁡H(I+zT):=DS(z),

where DS is the locally constructed separable determinant of Local separable trace-class determinant construction, identified across supports by Arbitrary-Hilbert Fredholm determinant from a separable reducing support. If H={0}, this definition gives det⁡H(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 x∈M⊥, every coefficient in the nuclear series vanishes and Tx=0; if x∈M, every partial sum and hence Tx lies in the closed space M. Thus, using Orthogonal decomposition by a closed subspace,

H=M⊕M⊥,T=S⊕0.

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:M→M 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 tr⁡M(S)=tr⁡H(T).

The block identity gives T∗T=S∗S⊕0. Hence ∣S∣⊕0 is a compact positive square root of T∗T, and uniqueness in Positive square root of a compact positive operator gives ∣T∣=∣S∣⊕0. Therefore S and T have the same nonzero singular values, with multiplicities, and ∥S∥1=∥T∥1.

For every λ≠0 and r≥1,

(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 locally proved product formula and support comparison in Arbitrary-Hilbert Fredholm determinant from a separable reducing support therefore make 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.

PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-09-22Open item page →

Fredholm determinant properties for trace-class operators

Statement

Assume the Axiom of Choice. Let H be a complex Hilbert space and T∈S1(H). The function DT(z)=det⁡H(I+zT) is entire and, locally uniformly in z,

DT(z)=∏j(1+zλj(T)),

where all nonzero eigenvalues are listed with their finite algebraic multiplicities, and ∑j∣λj(T)∣≤∥T∥1. It satisfies

DT(0)=1,DT′(0)=tr⁡H(T), ∣DT(z)∣≤∏j(1+∣z∣sj(T))≤e∣z∣∥T∥1,

and for every ε>0 there is Cε such that ∣DT(z)∣≤Cεeε∣z∣. For trace-class A,B, ∣DA(z)−DB(z)∣≤∣z∣∥A−B∥1e1+∣z∣∥A∥1+∣z∣∥B∥1, and

det⁡H(I+A+B+AB)=det⁡H(I+A)det⁡H(I+B).

Moreover DT(z)=0 exactly when I+zT is not boundedly invertible, and the zero at −1/λ has the algebraic multiplicity of λ≠0.

If finite-rank Tn converge to T in trace norm, their ordinary finite-dimensional determinants converge to DT locally uniformly. Where I+zT is invertible,

DT′(z)=DT(z)tr⁡H(T(I+zT)−1).

All assertions include H={0}, finite eigenvalue lists and the empty list.

Facts & Assumptions

Given: The Axiom of Choice, a complex Hilbert space H, and the displayed trace-class operators.

[F1]

The determinant is defined through a separable reducing support; its value is independent of the support, entire and normalized, and equals the locally uniform product over the nonzero eigenvalues with algebraic multiplicity. Finite-rank values are ordinary finite-dimensional determinants (Fredholm determinant of a trace-class operator, Arbitrary-Hilbert Fredholm determinant from a separable reducing support).

[F2]

On a separable complex Hilbert space the local determinant satisfies DS′(0)=tr⁡(S) (Local separable trace-class determinant construction).

[F3]

On a separable complex Hilbert space the eigenvalue absolute sum is at most the trace norm, with algebraic multiplicities (Weyl product and sum inequalities for compact operators).

[F4]

On a separable complex Hilbert space the local determinant satisfies the singular-value product and exponential bounds, minimal exponential type, the displayed trace-norm continuity estimate, multiplicativity at z=1, and locally uniform convergence of finite-rank determinants in trace norm (Trace-norm continuity, growth and multiplicativity of the local determinant).

[F5]

On a separable complex Hilbert space, the local determinant vanishes exactly when I+zS is not boundedly invertible, and its zero at −1/λ has order malg(λ;S) (Zeros of the local Fredholm determinant).

[F6]

On a separable complex Hilbert space, at every invertibility point, DS′(z)=DS(z)tr⁡(S(I+zS)−1) (Logarithmic derivative of the local Fredholm determinant).

[F7]

Trace-class operators form a linear two-sided ideal, their trace norm is a norm, and singular values are the positive eigenvalues of ∣T∣ (Trace class is a two sided Banach operator ideal, Absolute value and singular values of a compact operator).

[F8]

The trace is basis-independent and agrees with every nuclear trace sum (Trace is absolutely convergent and basis independent).

Proof

technique · direct
1.1F1F7F8given

Choose a nuclear support M from [F1] and write H=M⊕M⊥ and T=S⊕0. The nuclear trace formula gives tr⁡H(T)=tr⁡M(S): the same nuclear vectors lie in M, so their scalar inner products are unchanged. The block identity T∗T=S∗S⊕0 and uniqueness of the compact positive square root, as established in Fredholm determinant of a trace-class operator, give ∣T∣=∣S∣⊕0. Thus T and S have the same nonzero singular values, including multiplicity, and ∥T∥1=∥S∥1. For each λ≠0, (T−λI)r=(S−λIM)r⊕(−λ)rIM⊥; hence their nonzero eigenvalues and algebraic multiplicities agree.

2.1F1F2F3F4step 1.1

By [F1], DT=DS is entire, normalized, and has the stated locally uniform spectral product. Applying [F3] to S and step 1.1 gives ∑j∣λj(T)∣≤∥T∥1. Applying [F2] gives DT′(0)=DS′(0)=tr⁡M(S)=tr⁡H(T). The singular-value product, exponential bound and minimal exponential type in [F4] transfer from S using the same singular-value list and trace norm. This also covers finite and empty lists.

2.2F1F5F6F8step 1.1

For each z, I+zT=(IM+zS)⊕IM⊥. It has a bounded inverse exactly when IM+zS does, because the inverse of a block diagonal operator is the block inverse and restriction of a bounded inverse to the reducing summand is bounded. The generalized kernels in step 1.1 preserve algebraic multiplicity. Hence [F5] gives both directions of the stated zero criterion and the exact zero order at −1/λ. If I+zT is invertible, its inverse is (IM+zS)−1⊕IM⊥; consequently T(I+zT)−1=S(IM+zS)−1⊕0. The same nuclear trace formula as step 1.1 equates these traces, so [F6] gives the displayed logarithmic derivative.

2.3F1F4F7step 1.1

For trace-class A,B on H, take nuclear representations for both and let N be the closed span of all their input and output vectors. The finite union of the two countable vector lists has a countable dense set of finite Gaussian-rational combinations; the support proof in [F1] shows N is separable and reduces both operators, with A=AN⊕0 and B=BN⊕0. By [F7], C:=A+B+AB is trace class and C=(AN+BN+ANBN)⊕0; the same N supports A−B. The block singular-value argument of step 1.1 gives ∥A−B∥1=∥AN−BN∥1 and ∥A∥1=∥AN∥1, ∥B∥1=∥BN∥1. Apply the separable continuity estimate and multiplicativity in [F4] on N, and use support independence in [F1] for all three determinants. These are exactly the displayed arbitrary-space formulas, including the same numerical exponential constant.

2.4F1F4step 1.1

Suppose finite-rank Tn→T in trace norm. AC chooses nuclear representations for T and the countable family (Tn); taking the closed span of every input and output vector gives one separable reducing support N for all of them. Their restrictions Sn,S obey ∥Sn−S∥1=∥Tn−T∥1→0 by the block singular-value argument of step 1.1. Apply the locally uniform finite-rank approximation in [F4] on N. By [F1], DSn=DTn and each is the ordinary determinant on any finite-dimensional subspace containing ran⁡Tn; the same support lemma shows independence of that subspace. Therefore those ordinary determinants converge locally uniformly to DS=DT.

3.1F1F2F4F5F6step 2.1step 2.2step 2.4∎

If H={0} or T=0, [F1] gives DT≡1, its derivative and trace are zero, and the product and singular-value lists are empty. For z=0, normalization holds, and the logarithmic-derivative formula follows from step 2.1. A finite-rank operator is covered by [F1] and step 2.4. Full AC supplies the separable-support and AC-qualified spectral suppliers and permits the countable family of nuclear representations in step 2.4; its Countable Choice consequence supplies [F2], [F4] and [F6]. Both directions of the zero criterion were established in step 2.2.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-22Open item page →

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.

5 · Examples, counterexamples and false statements

None yet.

Sources