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.

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

Depends on

Used by

Dependency tree · two levels

153 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