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 be any complex Hilbert space and let be trace class (Hilbert space, Trace class operator). For a nuclear representation put Then is separable and reducing for , and under one has , where is trace class. Let be the locally constructed separable determinant of Local separable trace-class determinant construction and define This definition is independent of the nuclear representation and, more generally, of any closed separable support satisfying and ; such an reduces . The result is entire, has value at , and satisfies the locally uniform product where the nonzero eigenvalues are repeated according to algebraic multiplicity (Algebraic multiplicity of a nonzero compact-operator eigenvalue). If has finite rank, then for every finite-dimensional containing , with determinant on the zero-dimensional space equal to (The determinant of an endomorphism of a finite-dimensional vector space: its matrix determinant in an ordered basis in positive dimension, and on the zero space).
Facts & Assumptions
Given: AC, a complex Hilbert space , a trace-class operator , and a nuclear representation as in the statement when one is fixed.
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).
Under Countable Choice, a trace-class has a nuclear representation with operator-norm-convergent partial sums and finite sum ; this is the nuclear-series characterization (Nuclear series characterizes trace norm).
The inner product is linear in its first argument. For a bounded operator, the Hilbert adjoint satisfies 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 means for every .
The operator norm is the unit-ball supremum; scaling a nonzero vector to the unit ball gives for each bounded (A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).
Every closed subspace of a Hilbert space has the orthogonal decomposition under Countable Choice; its projection is bounded with norm at most (Orthogonal decomposition by a closed subspace, The Hilbert orthogonal projection onto a closed subspace, Hilbert projections are linear, self-adjoint and contractive).
If is trace class and are bounded operators with compatible Hilbert-space domains and ranges, then is trace class (Trace class is a two sided Banach operator ideal).
The rationals are in bijection with ( is countably infinite), and there is a bijection (). Define and . Then is injective on all finite sequences: inverse pairing recovers the length and then every entry.
The rationals are dense in (The rationals embed densely in the reals). Each complex number has unique real and imaginary coordinates and modulus (Real and imaginary parts, complex conjugation, and modulus); hence is dense in .
A space is separable when it has an at most countable dense subset (Separability: the existence of an at most countable dense subset).
In this library, countable means at most countable (Finite, countably infinite, countable, uncountable); is bijective with (). A nonempty set is at most countable exactly when there is a surjection from onto it (A nonempty set is at most countable iff it is a surjective image of ).
Every nonzero spectral value of a compact operator is an eigenvalue with finite-dimensional generalized eigenspace, and 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).
On a separable complex Hilbert space, the local determinant construction is entire and has . For finite-rank and finite-dimensional -invariant containing , it gives , including (Local separable trace-class determinant construction).
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 (Spectral product from traces of powers).
The finite-dimensional operator determinant is the determinant of a matrix in an ordered basis (and is 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 on the zero space, The determinant of a linear operator is independent of the chosen ordered basis).
The matrix determinant is given by the finite signed permutation sum (Leibniz formula) (For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix).
Cauchy--Schwarz gives for vectors in a complex inner-product space (Cauchy–Schwarz: , with equality exactly for dependent pairs).
The induced inner-product norm satisfies the triangle inequality (The induced length is a norm).
The Hilbert norm is complete, so is Banach; every absolutely convergent series in a Banach space converges (Hilbert space, Series criterion for Banach spaces).
The linear span of a set is exactly its finite linear combinations, including the empty sum ( is exactly the set of linear combinations of finite lists of elements of , and ).
In a metric space, is in the closure of exactly when every positive-radius ball around meets (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space).
The induced inner-product norm is homogeneous: (The induced length is a norm).
Proof
By [A1] and the nuclear characterization [A2], a nuclear representation exists. Fix any such representation and let be the closed complex linear span in the statement. The argument below applies to every representation; this initial choice only constructs one support.
Let and . Let denote the Gaussian rationals. The finite sums with and form a subset of . This set is at most countable: fix a bijection from [A7] and a bijection from [A10]. Encode each tuple by , where . 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 . This defines a surjection ; is nonempty because it contains the empty sum . Thus [A10] makes at most countable.
Write for the nuclear partial sums. For each , , and by [A2]; operator-norm convergence implies pointwise convergence by the bound in [A4]. Since is closed, . For each , the series converges absolutely in by [A16] and therefore converges in by [A18], because is Banach. Its partial sums lie in , so . Conjugate-linearity in the second argument, the adjoint identity [A3], and inner-product continuity from [A16] give Uniqueness of the adjoint in [A3] yields , so . If , then for every , so the nuclear series for both and vanish. Consequently and are invariant under both and ; therefore reduces . The decomposition [A5] now gives on , where .
The set is dense in . Given and , [A20] gives a point of the span of the listed vectors with ; by [A19], write it as a finite complex linear combination . By density of in and the coordinate/modulus formula in [A8], each can be approximated by closely enough that ; if a listed vector is zero its summand is already zero. Then and Consequently is a countable dense subset of , so is separable by [A9]. This also covers an empty sequence, a finite list, and .
More generally, call a closed separable subspace a support for when and . By [A5], ; hence for . The adjoint identity [A3] gives , so is reducing in the standard sense (invariant under both and ). Let be inclusion and the projection of [A5]. Then : on , takes values in and is the identity. The inclusion is bounded with its inherited norm, and [A5] makes bounded. Thus [A6] shows that is trace class. This applies to the representation support of step 2.2 and to every support used below.
Let 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 by [A9]. They are countable, so by the surjection criterion in [A10] fix surjections . Using the bijection from [A10] to reindex pairs, the map has countable image . It is dense in : for and any , choose with , so . Its closure is therefore separable. Also and , so . Hence is a reducing support.
For any reducing support , the decomposition gives, for every and integer , Since , Thus and 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.
Let be arbitrary reducing supports and let from step 4.1. Each of , and 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 Taking to be supports arising from any two nuclear representations proves representation independence as well as independence from every separable reducing support.
Define using any support . Step 5.1 makes this well-defined. By [A12], it is entire and equals at . By [A13], locally uniformly. Step 4.2 identifies the nonzero eigenvalues and their algebraic multiplicities with those of , so this is the asserted locally uniform product for . If the eigenvalue list is empty, the product is ; finite lists are finite products, and the formula also holds for and .
Suppose has finite rank and write . Then by step 2.2, is finite dimensional, and . Apply the finite-rank clause of [A12] to and the invariant subspace to obtain If , this is by [A12] and the zero-dimensional determinant convention.
Let be any finite-dimensional subspace containing . It is -invariant because . For , extend a basis of to a basis of . Relative to the resulting decomposition , the matrix of has block form where is the matrix of . Thus the matrix of is In any nonzero term of the Leibniz formula [A15], each of the columns from must use an row because the lower-left block is zero. Since there are exactly such rows, they are all occupied, so no column can use an row. Each column must then use its matching identity entry in the block, and the remaining permutation sum is the Leibniz determinant of . Hence which with step 7.1 proves the formula for every such . When , both operators are identities and both determinants are . Basis independence of these operator determinants is [A14].
At , [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 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
- The induced length is a norm
- The Axiom of Choice
- Algebraic multiplicity of a nonzero compact-operator eigenvalue
- A bounded linear operator between normed spaces
- Real and imaginary parts, complex conjugation, and modulus
- Finite, countably infinite, countable, uncountable
- 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
- For $n\ge1$, the determinant over a commutative ring by the Leibniz formula, and $|\det A|$ for a real matrix
- The Hilbert orthogonal projection onto a closed subspace
- The Hilbert-space adjoint of a bounded operator
- Hilbert space
- Interior, closure, boundary, limit point, isolated point and dense subset of a metric space
- The operator norm as the least bound and as the unit-sphere or unit-ball supremum
- Real and complex inner-product spaces and their induced length
- Separability: the existence of an at most countable dense subset
- Trace class operator
- A nonempty set is at most countable iff it is a surjective image of $\mathbb{N}$
- Spectral product from traces of powers
- Nuclear series characterizes trace norm
- Hilbert projections are linear, self-adjoint and contractive
- The rationals embed densely in the reals
- Local separable trace-class determinant construction
- $\operatorname{span}(S)$ is exactly the set of linear combinations of finite lists of elements of $S$, and $\operatorname{span}(\varnothing) = \{0_V\}$
- Series criterion for Banach spaces
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- AC implies DC implies countable choice
- $\mathbb{N} \times \mathbb{N} \approx \mathbb{N}$
- The determinant of a linear operator is independent of the chosen ordered basis
- Orthogonal decomposition by a closed subspace
- $\mathbb{Q}$ is countably infinite
- Riesz schauder spectrum of a compact operator
- Trace class is a two sided Banach operator ideal
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
- Kostenko, Trace Ideals with Applications, §3.4 (standard reference, not scraped)
- van Neerven, Functional Analysis, §14.5.a (standard reference, not scraped)