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.

Arbitrary-Hilbert Fredholm determinant from a separable reducing support

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let H be any complex Hilbert space and let T:H→H be trace class (Hilbert space, Trace class operator). For a nuclear representation Tx=∑j≥1⟨x,uj⟩vj,∑j≥1∥uj∥ ∥vj∥<∞, put M=span⁡C{uj,vj:j≥1}‾. Then M is separable and reducing for T, and under H=M⊕M⊥ one has T=S⊕0, where S=T∣M is trace class. Let DS be the locally constructed separable determinant of Local separable trace-class determinant construction and define DH(I+zT):=DS(z). This definition is independent of the nuclear representation and, more generally, of any closed separable support N satisfying T(H)⊆N and T∣N⊥=0; such an N reduces T. The result is entire, has value 1 at z=0, and satisfies the locally uniform product DH(I+zT)=∏j(1+zλj(T)), where the nonzero eigenvalues are repeated according to algebraic multiplicity (Algebraic multiplicity of a nonzero compact-operator eigenvalue). If T has finite rank, then for every finite-dimensional E⊆H containing ran⁡T, DH(I+zT)=det⁡E(IE+z(T∣E)), with determinant on the zero-dimensional space equal to 1 (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).

Facts & Assumptions

Given: AC, a complex Hilbert space H, a trace-class operator T, and a nuclear representation as in the statement when one is fixed.

[A1]

AC is the principle that every family of nonempty sets has a choice function. It implies DC and Countable Choice, which are the exact choice strengths used by the Hilbert projection and trace-class/determinant suppliers (The Axiom of Choice, AC implies DC implies countable choice).

[A2]

Under Countable Choice, a trace-class T has a nuclear representation with operator-norm-convergent partial sums and finite sum ∑j∥uj∥∥vj∥; this is the nuclear-series characterization (Nuclear series characterizes trace norm).

[A3]

The inner product is linear in its first argument. For a bounded operator, the Hilbert adjoint satisfies ⟨Tx,y⟩=⟨x,T∗y⟩ and is uniquely determined by this identity (Real and complex inner-product spaces and their induced length, The Hilbert-space adjoint of a bounded operator). Orthogonality to M means ⟨x,m⟩=0 for every m∈M.

[A4]

The operator norm is the unit-ball supremum; scaling a nonzero vector to the unit ball gives ∥Ux∥≤∥U∥∥x∥ for each bounded U (A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[A5]

Every closed subspace N of a Hilbert space has the orthogonal decomposition H=N⊕N⊥ under Countable Choice; its projection PN is bounded with norm at most 1 (Orthogonal decomposition by a closed subspace, The Hilbert orthogonal projection onto a closed subspace, Hilbert projections are linear, self-adjoint and contractive).

[A6]

If R is trace class and A,B are bounded operators with compatible Hilbert-space domains and ranges, then ARB is trace class (Trace class is a two sided Banach operator ideal).

[A7]

The rationals are in bijection with N (Q is countably infinite), and there is a bijection π:N2→N (N×N≈N). Define c0(())=0 and ck+1(a0,…,ak)=π(a0,ck(a1,…,ak)). Then c(a0,…,ak−1)=π(k,ck(a0,…,ak−1)) is injective on all finite sequences: inverse pairing recovers the length and then every entry.

[A8]

The rationals are dense in R (The rationals embed densely in the reals). Each complex number has unique real and imaginary coordinates a+bi and modulus a2+b2 (Real and imaginary parts, complex conjugation, and modulus); hence Q+iQ is dense in C.

[A9]

A space is separable when it has an at most countable dense subset (Separability: the existence of an at most countable dense subset).

[A10]

In this library, countable means at most countable (Finite, countably infinite, countable, uncountable); N×N is bijective with N (N×N≈N). A nonempty set is at most countable exactly when there is a surjection from N onto it (A nonempty set is at most countable iff it is a surjective image of N).

[A11]

Every nonzero spectral value of a compact operator is an eigenvalue with finite-dimensional generalized eigenspace, and malg(λ;T) is the dimension of that stabilized generalized eigenspace (Trace class operator, Riesz schauder spectrum of a compact operator, Algebraic multiplicity of a nonzero compact-operator eigenvalue).

[A12]

On a separable complex Hilbert space, the local determinant construction is entire and has DS(0)=1. For finite-rank F and finite-dimensional F-invariant E containing ran⁡F, it gives DF(z)=det⁡E(IE+z(F∣E)), including det⁡{0}=1 (Local separable trace-class determinant construction).

[A13]

For a trace-class operator on a separable complex Hilbert space, the local determinant equals the locally uniform product of the nonzero eigenvalues, repeated by algebraic multiplicity; the empty product is 1 (Spectral product from traces of powers).

[A14]

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

[A15]

The matrix determinant is given by the finite signed permutation sum (Leibniz formula) (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix).

[A16]

Cauchy--Schwarz gives ∣⟨x,y⟩∣≤∥x∥ ∥y∥ for vectors in a complex inner-product space (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[A17]

The induced inner-product norm satisfies the triangle inequality ∥u+v∥≤∥u∥+∥v∥ (The induced length is a norm).

[A18]

The Hilbert norm is complete, so H is Banach; every absolutely convergent series in a Banach space converges (Hilbert space, Series criterion for Banach spaces).

[A19]

The linear span of a set is exactly its finite linear combinations, including the empty sum (span⁡(S) is exactly the set of linear combinations of finite lists of elements of S, and span⁡(∅)={0V}).

[A20]

In a metric space, x is in the closure of A exactly when every positive-radius ball around x meets A (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space).

[A21]

The induced inner-product norm is homogeneous: ∥λv∥=∣λ∣ ∥v∥ (The induced length is a norm).

Proof

technique · direct
1.1A1A2

By [A1] and the nuclear characterization [A2], a nuclear representation exists. Fix any such representation and let M be the closed complex linear span in the statement. The argument below applies to every representation; this initial choice only constructs one support.

2.1A7A10A19A20step 1.1construct

Let w2j−2=uj and w2j−1=vj. Let Q+iQ denote the Gaussian rationals. The finite sums ∑k<rckwnk with ck∈Q+iQ and nk∈N form a subset D of M. This set is at most countable: fix a bijection η:N→Q from [A7] and a bijection π:N×N→N from [A10]. Encode each tuple (nk,ak,bk)∈N3 by π(nk,π(ak,bk)), where ck=η(ak)+iη(bk). The injective finite-sequence code in [A7] therefore codes every finite list of such tuples by a natural number. Decode each valid sequence code as the corresponding sum and send a natural number that is not a valid code to 0. This defines a surjection N→D; D is nonempty because it contains the empty sum 0. Thus [A10] makes D at most countable.

2.2A2A3A4A5A16A18A19A20A21step 1.1

Write Tnx=∑j≤n⟨x,uj⟩vj for the nuclear partial sums. For each x∈H, Tnx∈M, and Tnx→Tx by [A2]; operator-norm convergence implies pointwise convergence by the bound in [A4]. Since M is closed, Tx∈M. For each y∈H, the series wy:=∑j≥1⟨y,vj⟩uj converges absolutely in H by [A16] and therefore converges in H by [A18], because H is Banach. Its partial sums lie in M, so wy∈M. Conjugate-linearity in the second argument, the adjoint identity [A3], and inner-product continuity from [A16] give ⟨x,wy⟩=lim⁡n∑j≤n⟨x,uj⟩⟨vj,y⟩=lim⁡n⟨Tnx,y⟩=⟨Tx,y⟩. Uniqueness of the adjoint in [A3] yields T∗y=wy, so T∗(H)⊆M. If x∈M⊥, then ⟨x,uj⟩=⟨x,vj⟩=0 for every j, so the nuclear series for both Tx and T∗x vanish. Consequently M and M⊥ are invariant under both T and T∗; therefore M reduces T. The decomposition [A5] now gives T=S⊕0 on H=M⊕M⊥, where S=T∣M.

3.1A8A9A17A19A20A21step 2.1construct

The set D is dense in M. Given x∈M and ε>0, [A20] gives a point y of the span of the listed vectors with ∥x−y∥<ε/2; by [A19], write it as a finite complex linear combination y=∑k<rckwnk. By density of Q in R and the coordinate/modulus formula in [A8], each ck can be approximated by qk∈Q+iQ closely enough that ∑k<r∣ck−qk∣∥wnk∥<ε/2; if a listed vector is zero its summand is already zero. Then d=∑k<rqkwnk∈D and ∥x−d∥≤∥x−y∥+∑k<r∣ck−qk∣∥wnk∥<ε. Consequently D is a countable dense subset of M, so M is separable by [A9]. This also covers an empty sequence, a finite list, and M={0}.

3.2A3A5A6step 2.2

More generally, call a closed separable subspace N⊆H a support for T when T(H)⊆N and T(N⊥)={0}. By [A5], H=N⊕N⊥; hence T=SN⊕0 for SN:=T∣N. The adjoint identity [A3] gives T∗=SN∗⊕0, so N is reducing in the standard sense (invariant under both T and T∗). Let ιN:N↪H be inclusion and PN the projection of [A5]. Then SN=PNTιN: on N, T takes values in N and PN is the identity. The inclusion is bounded with its inherited norm, and [A5] makes PN bounded. Thus [A6] shows that SN is trace class. This applies to the representation support M of step 2.2 and to every support used below.

4.1A9A10A17A20step 3.2givenconstruct

Let N1,N2 be two reducing supports. If either is zero, the closure of their sum is the other support and is separable. Otherwise choose nonempty dense sets Xi⊆Ni by [A9]. They are countable, so by the surjection criterion in [A10] fix surjections si:N→Xi. Using the bijection π from [A10] to reindex pairs, the map (m,n)↦s1(m)+s2(n) has countable image X1+X2={x1+x2:xi∈Xi}. It is dense in N1+N2: for xi∈Ni and any ε>0, choose xi′∈Xi with ∥xi−xi′∥<ε/2, so ∥(x1+x2)−(x1′+x2′)∥<ε. Its closure L:=N1+N2‾ is therefore separable. Also T(H)⊆N1⊆L and L⊥⊆N1⊥, so T(L⊥)={0}. Hence L is a reducing support.

4.2A11step 2.2step 3.2

For any reducing support N, the decomposition H=N⊕N⊥ gives, for every λ≠0 and integer k≥1, (T−λI)k=(SN−λIN)k⊕(−λ)kIN⊥. Since (−λ)k≠0, ker⁡(T−λI)k=ker⁡(SN−λIN)k⊕{0}. Thus T and SN have the same nonzero eigenvalues and the same stabilized generalized eigenspaces and algebraic multiplicities. Both are trace class and therefore compact; their nonzero spectral values are eigenvalues by [A11], and the multiplicity is the dimension of the stabilized kernel.

5.1A13step 3.2step 4.1step 4.2

Let N1,N2 be arbitrary reducing supports and let L=N1+N2‾ from step 4.1. Each of SN1, SN2 and SL is trace class by step 3.2 and acts on a separable Hilbert space. Step 4.2 gives the same nonzero eigenvalue list, including algebraic multiplicity, for all three restrictions. The local product theorem [A13] therefore gives DSN1(z)=DSL(z)=DSN2(z)(z∈C). Taking N1,N2 to be supports arising from any two nuclear representations proves representation independence as well as independence from every separable reducing support.

6.1A12A13step 2.2step 4.2step 5.1

Define DH(I+zT):=DSM(z) using any support M. Step 5.1 makes this well-defined. By [A12], it is entire and equals 1 at z=0. By [A13], DSM(z)=∏j(1+zλj(SM)) locally uniformly. Step 4.2 identifies the nonzero eigenvalues and their algebraic multiplicities with those of T, so this is the asserted locally uniform product for T. If the eigenvalue list is empty, the product is 1; finite lists are finite products, and the formula also holds for H={0} and T=0.

7.1A12step 2.2step 6.1

Suppose T has finite rank and write R=ran⁡T. Then R⊆M by step 2.2, R is finite dimensional, and T(R)⊆R. Apply the finite-rank clause of [A12] to SM and the invariant subspace R⊆M to obtain DH(I+zT)=DSM(z)=det⁡R(IR+z(T∣R)). If R={0}, this is 1=1 by [A12] and the zero-dimensional determinant convention.

8.1A14A15step 7.1construct

Let E⊆H be any finite-dimensional subspace containing R. It is T-invariant because T(E)⊆R⊆E. For R≠{0}, extend a basis of R to a basis of E. Relative to the resulting decomposition E=R⊕F, the matrix of T∣E has block form (AB00), where A is the matrix of T∣R. Thus the matrix of IE+z(T∣E) is (IR+zAzB0IF). In any nonzero term of the Leibniz formula [A15], each of the dim⁡R columns from R must use an R row because the lower-left block is zero. Since there are exactly dim⁡R such rows, they are all occupied, so no F column can use an R row. Each F column must then use its matching identity entry in the IF block, and the remaining permutation sum is the Leibniz determinant of IR+zA. Hence det⁡E(IE+z(T∣E))=det⁡R(IR+z(T∣R)), which with step 7.1 proves the formula for every such E. When R=0, both operators are identities and both determinants are 1. Basis independence of these operator determinants is [A14].

9.1

At z=0, [A12] gives determinant one and the finite-dimensional formula is the determinant of the identity. The empty nonzero-eigenvalue list has empty product one by step 6.1; a zero operator and a zero-dimensional H are included there. A one-dimensional nonzero range is covered by step 7.1, where the finite-dimensional determinant is the corresponding single linear factor. The proof uses AC exactly as [A1] states: it supplies the Countable Choice needed to obtain the nuclear representation and the Hilbert projection, and AC-qualified spectral multiplicities; the explicit countable coding and the later comparison of supports make no further selections. The conclusion is a direct equality, not a biconditional. [A1, A11, A12, step 2.1, step 4.2, step 6.1, step 7.1] \qed

Depends on

Used by

Dependency tree · two levels

191 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