Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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

Depends on

Used by

Dependency tree · two levels

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

Sources