Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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.

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.1A1A4A15step 1.1step 4.1step 5.1step 6.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.

Depends on

Used by

Dependency tree · two levels

130 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