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.

✓ 4 results · all verified · 3 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 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Fredholm Determinants and the Lidskii Trace Formula: Examples

1 · Prerequisites

2 · Summary

These examples test the local determinant and trace results on concrete operators. The finite-rank example works on an arbitrary Hilbert space and reduces the determinant to an ordinary finite-dimensional determinant. For F(x)=⟨x,v⟩u, the one-dimensional restriction gives DH(I+zF)=1+z⟨u,v⟩ under the library's linear-first convention.

The diagonal example uses Te0=0 and Ten=2−nen for n≥1 on ℓ2(N,C). Its trace norm and trace are 1, its determinant is ∏n≥1(1+z2−n), and its zeros are exactly −2n, each simple. The Volterra example proves that V2 is a nonzero quasinilpotent trace-class operator with trace zero and determinant identically 1.

The counterexample at the start records the reason the trace decomposition uses an invariant quotient: an invariant subspace of an operator need not reduce it. Together, the examples distinguish finite-rank determinant calculations, spectral products with infinitely many factors, and trace cancellation for a nonzero operator.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

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

An invariant subspace need not reduce an operator

Statement

On C2 with its standard inner product, let T have matrix T=(1100) in the standard orthonormal basis e1,e2, and let M=span⁡{e1}. Using the convention that M reduces T when both M and M⊥ are T-invariant, M is invariant but does not reduce T: its orthogonal complement M⊥=span⁡{e2} is not T-invariant. If Q is the orthogonal projection onto M⊥, then QTQ=0 even though Te2=e1≠0.

Facts & Assumptions

Given: The standard orthonormal basis e1,e2 of C2, the displayed linear operator T, and M=span⁡{e1}.

[A1]

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

[A2]

A vector is in S⊥ exactly when it is orthogonal to every vector of S (Orthogonality and the orthogonal complement).

[A3]

For a finite-dimensional inner-product space and subspace W, the orthogonal projection PWx is the unique W-component of x in V=W⊕W⊥ (The orthogonal projection PWv is the W-component in V=W⊕W⊥).

Proof

technique · direct

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

1.1algebra

Matrix multiplication gives Te1=e1 and Te2=e1, so for all a,b∈C, T(ae1+be2)=(a+b)e1.

1.2A2A3

For x=ae1+be2, be2∈M⊥ and ae1∈(M⊥)⊥, so the orthogonal decomposition in [A3] gives Qx=PM⊥x=be2.

2.1A1A2step 1.1

Every m=ae1∈M satisfies Tm=ae1∈M, so T(M)⊆M and M is invariant by [A1]. Since e2∈M⊥ but Te2=e1∉M⊥, we also have T(M⊥)⊈M⊥ by [A2] and step 1.1.

3.1step 1.1step 1.2step 2.1∎

For every x=ae1+be2, step 1.2 and step 1.1 give QTQx=QT(be2)=Q(be1)=0, while step 1.1 gives Te2=e1≠0. Thus the orthogonal compression vanishes although T has a nonzero block from M⊥ into M; combining this with step 2.1 proves the stated counterexample.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-09-30Open item page →

The square of the Volterra operator has zero trace

Example

Assume the Axiom of Choice (The Axiom of Choice). Let H=L2([0,1];C) with its usual integral pairing, linear in the first argument (L2 with the integral pairing is a Hilbert space), and set Vf(x)=∫0xf(t) dt(0≤x≤1). Then V is Hilbert–Schmidt; V2 is trace class and quasinilpotent; and tr⁡(V2)=0,DV2(z)=1(z∈C), where DV2 is the locally constructed determinant.

Facts & Assumptions

Given: AC, the complex Hilbert space H=L2([0,1];C), and the Volterra operator V above.

[A1]

AC means that every family of nonempty sets has a choice function (The Axiom of Choice); it implies DC and hence Countable Choice (AC implies DC implies countable choice).

[A2]

Complex L2 consists of almost-everywhere classes of measurable complex functions; for f=u+iv, ∣f∣2=u2+v2 and ∣u∣,∣v∣≤∣f∣ (Complex Lp classes and Euclidean test-function conventions, The space Lp(μ) as the quotient by null functions, Real and imaginary parts, complex conjugation, and modulus). Under Countable Choice, this space with the integral pairing is a complex Hilbert space (L2 with the integral pairing is a Hilbert space, Hilbert space).

[A3]

Under Countable Choice, finite rational linear combinations of indicators of rational half-open boxes form a countable dense subset of real L2(R) (Rational box-step functions form a countable dense subset of Lp(Rn) for 1≤p<∞). Countable sets are closed under products, and an image of a nonempty countable set is countable by the surjection characterization (Finite, countably infinite, countable, uncountable, A product of two at most countable sets is at most countable, A nonempty set is at most countable iff it is a surjective image of N). A space is separable when it has a countable dense subset (Separability: the existence of an at most countable dense subset).

[A4]

Lebesgue measure of [a,b] is b−a; in particular λ([0,1])=1 and λ([0,x])=x for 0≤x≤1 (Lebesgue measurable sets, the family L(Rn), and the restricted set function λn, A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included). A finite measure space is sigma-finite (Finite, sigma-finite, and semifinite measures). For nonnegative measurable functions the integral is monotone (The nonnegative Lebesgue integral, Monotonicity and nonnegative homogeneity of the nonnegative integral); its integral over a measurable set is the integral after multiplying by that set's indicator (Integral over a measurable subset). A nonnegative simple function integrates as the finite sum of its values times the measures of its level sets (The integral of a nonnegative simple function), and the integral is additive on nonnegative summands (Additivity of the nonnegative Lebesgue integral).

[A5]

The Borel sigma-algebra of R2 is the product of the two one-dimensional Borel sigma-algebras (The Borel sigma-algebra of a topological space, The Borel product of R^m and R^n is the Borel sigma-algebra of R^{m+n}); continuous preimages of Borel sets are Borel and arithmetic operations preserve measurability (A continuous map has Borel preimages of Borel sets, Arithmetic and lattice operations preserve measurability whenever they are defined). For sigma-finite factors the product measure exists, has the rectangle formula, and is sigma-finite (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique); its completion is the completed product measure (The completed product measure). Tonelli evaluates nonnegative product integrals by iterated integrals (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).

[A6]

On the product space of measure 1, a bounded measurable complex function has finite absolute integral: if ∣g∣≤C, monotonicity bounds its integral by that of the constant simple function C, whose integral is C. By definition this makes g an L1 function (The class L1(μ) of integrable functions, The nonnegative Lebesgue integral, The integral of a nonnegative simple function, Monotonicity and nonnegative homogeneity of the nonnegative integral). Fubini then equates its product and iterated integrals (Fubini's theorem for L^1 functions on a sigma-finite product).

[A7]

Under AC, a square-integrable kernel class on a completed sigma-finite product defines a bounded kernel operator with ∥Tk∥≤∥k∥2 and an exact Hilbert–Schmidt norm ∥Tk∥HS=∥k∥2; AC also supplies Hilbert bases (L two kernels give Hilbert–Schmidt operators, Hilbert–Schmidt operator and Hilbert–Schmidt norm, A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[A8]

Under Countable Choice, Hilbert–Schmidt operators are compact (Hilbert–Schmidt operators are compact, Compact linear operator); a composition with a compact operator is compact (Compositions with a compact operator are compact). For Hilbert–Schmidt A,B on spaces with supplied Hilbert bases, if AB is compact then it is trace class and ∥AB∥1≤∥A∥HS∥B∥HS (Trace class iff product of two Hilbert Schmidt operators, Trace class operator).

[A9]

The derivative of xn is nxn−1 for n≥1 (For a natural n≥1 the function x↦xn is differentiable everywhere with derivative ι(n) x n−1; for n=0 it is the constant 1, with derivative 0; for a natural n≥1 the function x↦x−n is differentiable at every x≠0 with derivative −ι(n) x−n−1; consequently every polynomial function is differentiable at every real, with the derivative computed term by term); derivative sums and scalar multiples obey the algebra rules (The derivative f′(c)=lim⁡x→cf(x)−f(c)x−c of f:A→R at a point c∈A that is a limit point of A, and differentiability on a set, Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0), and the chain rule applies to differentiable compositions (The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c)). The factorial satisfies 0!=1 and n!=n(n−1)! for n≥1 (The factorial n! and the falling factorial nk‾, defined by recursion in N, The canonical natural ι(n)=n⋅1F of a field). Continuous functions on compact intervals are Riemann integrable (A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion); Newton–Leibniz evaluates the Riemann integral from a differentiable primitive (The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a)), and a bounded Riemann-integrable function has the same Lebesgue integral under Countable Choice (A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral).

[A10]

The bounded-operator space B(H) is Banach (The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators, If (Y) is Banach then (\mathcal B(X,Y)) is Banach); operator norms are submultiplicative (Composition satisfies |ST|\le|S|,|T|), and an absolutely convergent series in a Banach space converges (Series criterion for Banach spaces). The scalar exponential factorial series converges at every real argument (The exponential series converges absolutely for every real argument). The spectrum is the complement of the bounded resolvent set (Spectrum and resolvent of a bounded operator).

[A11]

If H is separable complex Hilbert and Q is trace class with σ(Q)⊆{0}, then the local quasinilpotent lemma gives tr⁡(Q)=0 and DQ≡1 (A quasinilpotent trace-class operator has zero trace).

[A12]

AC implies Countable Choice by [A1]. By [A2], H is a complex Hilbert space, and since 1∈H has norm 1 by [A4], it is nonzero. Thus B(H) is Banach by If (Y) is Banach then (\mathcal B(X,Y)) is Banach. Its identity has norm 1, composition is associative and satisfies ∥ST∥≤∥S∥∥T∥ by Composition satisfies |ST|\le|S|,|T|, and the nonzero identity makes this a nonzero unital complex Banach algebra (Unital Banach algebra). Its algebra spectrum agrees with the operator spectrum by their definitions (Spectrum and resolvent set in a Banach algebra, Spectrum and resolvent of a bounded operator), and it is nonempty by Spectrum is nonempty compact and norm bounded.

Verification

technique · direct

Source qualification: Teschl, Topics in Real and Functional Analysis, §6.1, equations (6.23)–(6.26), printed pp. 167–168, treats a Volterra operator on C([0,1]) and leaves its power estimate as Problem 6.7. That passage is comparison only; it does not prove this L2 claim. The proof below derives the L2 kernel estimate and uses the local trace-class, determinant and spectrum results cited in [A7]–[A12].

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

1.1A2A3A4

Build a countable dense subset of H by pairing restricted rational-box steps. [A2, A3, A4] Let S be the countable dense family of real rational-box steps in L2(R) from [A3]. For f∈H, choose a measurable representative f=u+iv. By [A2], both real components belong to real L2([0,1]). Extend each by zero to R. For a Borel set B⊆R, the extension's inverse image is (u−1(B)∩[0,1]), together with R∖[0,1] exactly when 0∈B; these sets are Lebesgue measurable, so the extension is measurable. Its norm agrees with the norm on [0,1] by the integral-over-a-set definition [A4]. Restriction from R to [0,1] is contractive by [A4]. Thus, for any ε>0, choose s,t∈S with each component's restriction error less than ε/2. The set D:={(s+it)∣[0,1]:s,t∈S} is countable by [A3], and its members are bounded step functions. The identity ∣a+ib∣2=a2+b2 and additivity in [A2] give ∥f−(s+it)∣[0,1]∥22=∥u−s∣[0,1]∥22+∥v−t∣[0,1]∥22<ε2. Hence D is dense and H is separable.

1.2A4A5A7A9

Compute the triangle area and identify its indicator kernel with V. [A4, A5, A7, A9] Put Δ:={(x,t)∈[0,1]2:0≤t≤x≤1}. It is closed in R2, hence Borel and product-measurable by [A5]. The two restricted Lebesgue factors are finite, so their product measure ρ exists by [A4, A5], and the rectangle formula gives ρ([0,1]2)=1. Tonelli and [A4] give ρ(Δ)=∫01λ([0,x]) dx=∫01x dx=12. For the last equality, x↦x is continuous, the primitive x2/2 has derivative x by [A9], Newton–Leibniz evaluates the Riemann integral, and [A9] identifies it with the Lebesgue integral. Thus k1=1Δ is in L2(ρ‾) with ∥k1∥22=1/2. The kernel theorem [A7] identifies V=Tk1 and gives ∥V∥HS=∥k1∥2=1/2.

1.3A1A7A8

Prove V2 is trace class. [A1, A7, A8] By [A7], AC supplies a Hilbert basis E of H and V is Hilbert–Schmidt relative to it. By [A1], AC supplies Countable Choice for [A8]; hence [A8] makes V compact and then V2=V∘V compact. Apply the Hilbert–Schmidt product theorem [A8] with both factors V and the same basis E. It follows that V2 is trace class and ∥V2∥1≤∥V∥HS2=12.

2.1A4A5A7step 1.2

Bound the kernel operators Tkn. [A4, A5, A7, step 1.2] For each integer n≥1, define kn(x,t):=(x−t)n−1(n−1)!1Δ(x,t). Each kn is product-measurable by [A5]. Since ∣x−t∣≤1 on Δ, [A4] gives ∥kn∥22≤ρ(Δ)((n−1)!)2=12((n−1)!)2≤1((n−1)!)2, using ρ(Δ)=1/2 from step 1.2. The kernel theorem [A7] therefore defines a bounded operator Tkn with ∥Tkn∥≤1/(n−1)!.

3.1A2A3A5A6A7A9step 1.1step 2.1algebra

Prove the power-kernel identity and factorial norm estimate by induction. [A2, A3, A5, A6, A7, A9, step 1.1, step 2.1, algebra] We prove Vnd=Tknd for every d∈D. At n=1 this is the definition of V. Suppose the identity holds for n. Choose a bounded Borel step representative of d, since its rational half-open boxes are Borel. For each fixed x∈[0,1], the integrand on [0,1]2 (s,t)⟼1{0≤t≤s≤x}(s−t)n−1d(t) is product-measurable by [A5] and bounded; the product space has finite measure. It is therefore in L1 by [A6], so Fubini changes the order of integration. If t=x the inner integral is zero. If t<x, [A9], applied to the primitive (s−t)n/n!, gives ∫tx(r−t)n−1(n−1)! dr=(x−t)nn!. Indeed r↦r−t has derivative 1: the identity has derivative 1 by the n=1 power case, while the constant −t has zero difference quotient. The chain rule differentiates the shifted power, and the factorial recursion cancels its factor n. Consequently Vn+1d(x)=∫0x(x−t)nn!d(t) dt for almost every x. This proves the induction. Both Vn and Tkn are bounded; since D is dense by step 1.1, equality on D extends to all H. Thus ∥Vn∥=∥Tkn∥≤1(n−1)!(n≥1).

4.1A2A10step 3.1algebra

Exclude every nonzero scalar from σ(V2). [A2, A10, step 3.1, algebra] Fix λ≠0 and put RN:=∑m=0Nλ−m−1(V2)m. For m≥1, step 3.1 gives ∥λ−m−1(V2)m∥≤∣λ∣−m−1(2m−1)!≤∣λ∣−m−1m!, because (2m−1)!≥m!. The scalar majorant is summable by the exponential-series fact [A10]. Since B(H) is Banach [A10], its series criterion gives an operator-norm limit Rλ=lim⁡NRN. Finite telescoping gives on both sides (λI−V2)RN=RN(λI−V2)=I−λ−N−1V2N+2. The remainder tends to zero by step 3.1 and the vanishing terms of the convergent scalar majorant. Submultiplicativity [A10] lets the products pass to the operator-norm limit, so Rλ is a bounded two-sided inverse of λI−V2. Therefore every nonzero λ lies in the resolvent set [A10], and σ(V2)⊆{0}.

5.1A1A2A4A11A12step 1.1step 1.3step 3.1step 4.1algebra∎

Prove quasinilpotence, the trace and determinant conclusions, and the nonzero witness. [A1, A2, A4, A11, A12, step 1.1, step 1.3, step 3.1, step 4.1, algebra] By [A2], H is a complex Hilbert space; it is separable by step 1.1 and V2 is trace class by step 1.3. Step 4.1 puts its spectrum inside {0}, while [A12] makes the spectrum nonempty; hence σ(V2)={0} and V2 is quasinilpotent. The local quasinilpotent lemma [A11] applies, yielding tr⁡(V2)=0,DV2(z)=1(z∈C). This particular operator is not zero: 1∈H, ∥1∥2=1 by [A4], and the same Newton–Leibniz calculation gives V1(x)=x and V21(x)=x2/2, which is positive on [1/2,1] of positive measure [A4]. The formula includes the degenerate endpoint x=0 because that integral is zero; the closed triangle convention retains both endpoints, and no boundary point is discarded in Tonelli or Fubini. The base case n=1 is step 3.1. AC is the exact declared assumption [A1]: it supplies the Hilbert basis used in step 1.3 and supplies Countable Choice for the stated auxiliary results; the separability approximation selects only two approximants for a single tolerance. There is no one-dimensional branch: the intervals In=(2−n,2−(n−1)), indexed by integers n≥1, lie in [0,1], are pairwise disjoint and have measure 2−n>0 by [A4]; if a finite linear combination of their indicator classes is zero, restricting to each In forces its coefficient to vanish. Thus H is infinite-dimensional. The assertion is a conjunction, not an iff, so neither iff direction applies.

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

Diagonal trace-class Fredholm determinant

Example

Assume the Axiom of Choice (The Axiom of Choice). Let H=ℓ2(N,C), where N includes 0, let (un)n∈N be its coordinate vectors, let d be the bounded sequence d0=0, dn=2−n for n≥1, and let T:=Dd be the corresponding diagonal operator (Diagonal trace-class operators on ℓ2(N,C)); that lemma supplies the bounded operator and gives Tu0=0,Tun=2−nun(n≥1). Then T is trace class (Trace class operator) with ∥T∥1=tr⁡(T)=1. The arbitrary-Hilbert local Fredholm determinant DT(z):=DH(I+zT) from Arbitrary-Hilbert Fredholm determinant from a separable reducing support is DT(z)=∏n≥1(1+z2−n), with convergence locally uniform on C. Its zeros are exactly −2n for n≥1, and each zero is simple.

Facts & Assumptions

Given: AC; the space H=ℓ2(N,C) with its coordinate vectors un; the bounded coefficient sequence d0=0, dn=2−n (n≥1); the diagonal operator T=Dd; and a complex parameter z.

[A1]

AC is the axiom of choice (The Axiom of Choice). It is the declared hypothesis of the three local suppliers used below, and the coefficient sequence d, the coordinate family (un) and the parameter z are explicit, so this example selects nothing.

[A2]

The space H is a complex Hilbert space and (un)n∈N is a complete orthonormal family in it; for every bounded complex sequence c the series Dcx=∑ncn⟨x,un⟩un converges in H, Dc is a bounded linear operator with Dcun=cnun, the identities Dc+Dc′=Dc+c′, λDc=Dλc and DcDc′=Dcc′ hold for bounded c,c′ and λ∈C, one has D0=0 and D(1)=IH, and Dc is boundedly invertible exactly when inf⁡n∣cn∣>0, in which case Dc−1=Dc−1 (Diagonal trace-class operators on ℓ2(N,C)).

[A3]

If in addition ∑n∣cn∣<+∞, then Dc is trace class with ∥Dc∥1=∑n∣cn∣ and tr⁡(Dc)=∑ncn; 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), the value λ≠0 occurring #{n:cn=λ} times (Diagonal trace-class operators on ℓ2(N,C)).

[A4]

H is separable: by [A2] the span of the countable family (un) is dense in H, so H has a countable dense subset (Separability: the existence of an at most countable dense subset).

[A5]

The geometric series starting at index 1 satisfies ∑n=1∞2−n=1 (For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges).

[A7]

For n<m one has 0<2−m<2−n, because 0<1/2<1; hence the values 2−n, n≥1, are pairwise distinct (Monotonicity of x↦xn and of n↦an).

[A8]

The arbitrary-Hilbert determinant of a trace-class operator is obtained from a nuclear representation and a separable reducing support M with T=S⊕0 and S=T∣M; the value DH(I+zT):=DS(z) is independent of the support and of the nuclear representation, is entire, equals 1 at z=0, and satisfies the locally uniform product over the nonzero eigenvalues of T repeated according to algebraic multiplicity (Arbitrary-Hilbert Fredholm determinant from a separable reducing support).

[A9]

For a trace-class operator on a separable complex Hilbert space, the locally constructed determinant vanishes at exactly those z for which I+zT is not boundedly invertible, and the zero at z0=−1/λ has order malg(λ;T) for every nonzero eigenvalue λ (Zeros of the local Fredholm determinant).

[A10]

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

[A11]

Complex modulus is subadditive and ∣1∣=1, so ∣1+w∣≥1−∣w∣ for every w∈C (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive, Real and imaginary parts, complex conjugation, and modulus).

Proof

technique · direct

Given: AC; the space H=ℓ2(N,C) with its coordinate vectors un; the coefficient sequence d0=0, dn=2−n; the diagonal operator T=Dd; and z∈C.

1.1A2A3A5

The sequence d is bounded, since ∣d0∣=0 and ∣dn∣=2−n≤1/2 for n≥1. By [A2] the operator T=Dd is bounded with Tun=dnun for every n, so Tu0=0 and Tun=2−nun for n≥1. By [A5], ∑n∣dn∣=∑n≥12−n=1<+∞ and ∑ndn=1; hence [A3] makes T trace class with ∥T∥1=∑n∣dn∣=1 and tr⁡(T)=∑ndn=1.

1.2A2A3A7

Apply [A3] with c=d. The nonzero eigenvalues of T, repeated according to algebraic multiplicity, are the nonzero scalars of the list (dn), the value λ≠0 occurring #{n:dn=λ} times. The nonzero scalars are the values 2−n with n≥1, and for λ=2−r the index set is {n≥1:2−n=2−r}={r} by [A7]; hence the eigenvalue list with algebraic multiplicities is (2−1,2−2,2−3,… ), each value occurring once. In particular T≠0, because Tu1=2−1u1 and u1≠0 by [A2].

1.3A2A6A7A10A11

The sequence 1+zd is bounded, so [A2] gives D1+zd with D1+zdun=(1+zdn)un, and the operator calculus of [A2] gives I+zT=D(1)+zDd=D1+zd. If z=−2r for some r≥1, then 1+zdr=0, so D1+zdur=0 with ur≠0 and I+zT is not injective, hence not boundedly invertible. Conversely let z≠−2n for every n≥1. For z=0 all coefficients 1+zdn equal 1. For z≠0, [A6] gives N≥1 with ∣z∣2−n≤∣z∣2−N<1/2 for every n≥N by [A7], so [A11] gives ∣1+zdn∣≥1−∣z∣2−n>1/2 there, while the finitely many remaining coefficients 1+zd0=1,1+zd1,…,1+zdN−1 are all nonzero and therefore have a positive minimum by [A10]. Hence inf⁡n∣1+zdn∣>0, and the invertibility criterion of [A2] makes D1+zd=I+zT boundedly invertible, with inverse D(1+zd)−1.

2.1A8step 1.2

By [A8] the arbitrary-Hilbert determinant DT(z)=DH(I+zT) is independent of the support and equals the locally uniform product over the nonzero eigenvalues of T repeated according to algebraic multiplicity; substituting the list of step 1.2 gives DT(z)=∏n≥1(1+z2−n), locally uniformly on C, and DT(0)=1 by [A8].

3.1

By step 1.3 the operator I+zT is boundedly invertible exactly when z∉{−2n:n≥1}. Since H is a separable complex Hilbert space by [A2] and [A4], and since H itself is a closed support with T(H)⊆H and T∣H⊥=0, the support-independence clause of [A8] identifies the arbitrary-Hilbert value DH(I+zT) with the locally constructed separable determinant of T on H; applying [A9] therefore gives DT(z)=0 exactly for z=−2r, r≥1. For such an r the eigenvalue 2−r has algebraic multiplicity malg(2−r;T)=1 by step 1.2, so [A9] makes each zero simple; at z=0, not a zero, step 2.1 gives DT(0)=1. The basis, the coefficient sequence and the parameter are explicit and no interval or endpoint occurs. AC is used exactly through the hypotheses of the suppliers [A2], [A3], [A8] and [A9], which are stated under AC, and the example makes no further choice. Both directions of the zero characterization are proved in steps 1.3 and 3.1. [A1, A2, A4, A8, A9, step 1.2, step 2.1, step 1.3] \qed

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

Fredholm determinant of a finite-rank operator

Example

Assume AC. Let H be any complex Hilbert space, using the library convention that the inner product is linear in its first argument (The Axiom of Choice, Hilbert space, Real and complex inner-product spaces and their induced length). For every bounded finite-rank linear operator F:H→H (A bounded linear operator between normed spaces) and every finite-dimensional invariant subspace E⊇ran⁡F, the arbitrary-Hilbert local determinant satisfies DH(I+zF)=det⁡E(IE+z(F∣E))(z∈C). In particular, for u,v∈H and the rank-at-most-one operator F(x)=⟨x,v⟩u, DH(I+zF)=1+z⟨u,v⟩.

Facts & Assumptions

Given: AC; a complex Hilbert space H; a bounded finite-rank linear operator F; and, for the rank-one calculation, vectors u,v∈H with the library's linear-first inner-product convention.

[A1]

AC implies DC and Countable Choice; these are the exact choice strengths used by the trace-class and arbitrary-Hilbert determinant suppliers (The Axiom of Choice, AC implies DC implies countable choice).

[A2]

A complex Hilbert space is a complex inner-product space whose pairing is linear in its first argument, conjugate-symmetric, and positive definite (Hilbert space, Real and complex inner-product spaces and their induced length).

[A3]

The given F is a bounded linear operator; every finite-rank operator is compact and therefore trace class (A bounded linear operator between normed spaces, Trace class operator).

[A4]

Cauchy–Schwarz gives ∣⟨x,v⟩∣≤∥x∥ ∥v∥, and ∥λu∥=∣λ∣ ∥u∥ (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs, The induced length is a norm).

[A5]

For a trace-class operator on any complex Hilbert space, AC supplies a support-independent determinant DH. If F has finite rank, then for every finite-dimensional E⊆H containing ran⁡F, DH(I+zF)=det⁡E(IE+z(F∣E)), and the determinant on the zero space is 1 (Arbitrary-Hilbert Fredholm determinant from a separable reducing support).

[A7]

In an ordered basis, the matrix of a linear map has as its columns the coordinate columns of the images of the basis vectors (Coordinate columns [v]B and matrices [T]BC of linear maps relative to ordered bases).

[A8]

The determinant of a square matrix is given by the Leibniz formula, so for a one-by-one matrix [c] its determinant is c (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix).

[A9]

The ordinary determinant of a finite-dimensional operator is its matrix determinant in an ordered basis, equals 1 on the zero space, and 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).

Proof

technique · direct
1.1A1A3A5

By [A1], AC supplies the Countable Choice hypothesis needed in [A3] and [A5]. The finite-rank F in the statement is therefore trace class, so the arbitrary-Hilbert determinant theorem applies.

1.2A2A4algebra

Fix u,v∈H, put α:=⟨u,v⟩, and define F(x):=⟨x,v⟩u. By [A2], F is linear; [A4] gives ∥F(x)∥=∣⟨x,v⟩∣∥u∥≤∥v∥∥u∥∥x∥, so it is bounded. Its range lies in span⁡{u}, hence it has rank at most one. Also F(u)=αu.

2.1A5A8A9step 1.1

Let E be any finite-dimensional subspace containing ran⁡F. For every x∈E, F(x)∈ran⁡F⊆E, so E is F-invariant. By [A5], DH(I+zF)=det⁡E(IE+z(F∣E)) for every z∈C. If F=0, this says both sides are 1 because IE has determinant 1; this includes E={0}, where the convention is also explicitly in [A5].

3.1A5A6step 2.1step 1.2

If u=0, then F=0, α=0, and E={0} is finite-dimensional and contains the range. Step 2.1 gives DH(I+zF)=1=1+zα for all z; this also covers H={0}.

3.2A2A6A7A8A9step 2.1step 1.2

Suppose u≠0 and set E=span⁡{u}. By [A6], E is the set of scalar multiples of u. The one-element list (u) is independent: its only coefficient relation is λu=0, which forces λ=0. More generally, an injective finite list into {u} has at most one entry, since any two entries would both equal u; the empty list is independent, so {u} is independent under [A6]. It spans E, hence it is a basis and (u) is an ordered basis; thus E has dimension one. The range of F is contained in E, and E is invariant because F(u)=αu. Relative to (u), [A7] gives the matrix [α] for F∣E and [1+zα] for IE+z(F∣E). By [A8]–[A9], its ordinary determinant is 1+zα; step 2.1 therefore yields DH(I+zF)=1+z⟨u,v⟩. If v=0 then this is the zero operator and the value is 1; if v≠0 but α=0, then F(v)=⟨v,v⟩u≠0 and, for every x, F2(x)=⟨F(x),v⟩u=⟨x,v⟩⟨u,v⟩u=0. Thus the nonzero rank-one operator is nilpotent and its one-dimensional restriction is zero, so the determinant is again 1.

4.1

At z=0 both sides of the finite-rank identity and rank-one formula equal 1. The zero-rank case, the zero vector and zero Hilbert space, and the nilpotent rank-one case are covered in steps 2.1, 3.1, and 3.2; nonzero α gives the scalar factor 1+zα in step 3.2. There is no interval endpoint parameter. The only assumption is AC [A1]; no choices are made in the finite-dimensional rank-one calculation, and both conclusions are equalities rather than iff claims. [A1, A5, A6, A8, A9, step 2.1, step 3.1, step 3.2] \qed

Sources