Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

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

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

112 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