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.
Fredholm determinant of a finite-rank operator
Example
Assume AC. Let 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 (A bounded linear operator between normed spaces) and every finite-dimensional invariant subspace , the arbitrary-Hilbert local determinant satisfies In particular, for and the rank-at-most-one operator ,
Facts & Assumptions
Given: AC; a complex Hilbert space ; a bounded finite-rank linear operator ; and, for the rank-one calculation, vectors with the library's linear-first inner-product convention.
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).
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).
The given 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).
Cauchy–Schwarz gives , and (Cauchy–Schwarz: , with equality exactly for dependent pairs, The induced length is a norm).
For a trace-class operator on any complex Hilbert space, AC supplies a support-independent determinant . If has finite rank, then for every finite-dimensional containing , and the determinant on the zero space is (Arbitrary-Hilbert Fredholm determinant from a separable reducing support).
For a vector , is the set of scalar multiples of , and if then forces (, which is when , and when contains only as the multiple ). A subset is linearly independent when every injective finite list into it is linearly independent; a basis is an independent spanning set; a finite-dimensional space has a finite basis; and the zero space has dimension zero (Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis).
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 and matrices of linear maps relative to ordered bases).
The determinant of a square matrix is given by the Leibniz formula, so for a one-by-one matrix its determinant is (For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix).
The ordinary determinant of a finite-dimensional operator is its matrix determinant in an ordered basis, equals 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 on the zero space, The determinant of a linear operator is independent of the chosen ordered basis).
Proof
By [A1], AC supplies the Countable Choice hypothesis needed in [A3] and [A5]. The finite-rank in the statement is therefore trace class, so the arbitrary-Hilbert determinant theorem applies.
Fix , put , and define . By [A2], is linear; [A4] gives , so it is bounded. Its range lies in , hence it has rank at most one. Also .
Let be any finite-dimensional subspace containing . For every , , so is -invariant. By [A5], for every . If , this says both sides are because has determinant ; this includes , where the convention is also explicitly in [A5].
If , then , , and is finite-dimensional and contains the range. Step 2.1 gives for all ; this also covers .
Suppose and set . By [A6], is the set of scalar multiples of . The one-element list is independent: its only coefficient relation is , which forces . More generally, an injective finite list into has at most one entry, since any two entries would both equal ; the empty list is independent, so is independent under [A6]. It spans , hence it is a basis and is an ordered basis; thus has dimension one. The range of is contained in , and is invariant because . Relative to , [A7] gives the matrix for and for . By [A8]–[A9], its ordinary determinant is ; step 2.1 therefore yields . If then this is the zero operator and the value is ; if but , then and, for every , . Thus the nonzero rank-one operator is nilpotent and its one-dimensional restriction is zero, so the determinant is again .
At both sides of the finite-rank identity and rank-one formula equal . 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 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
Depends on
- The induced length is a norm
- The Axiom of Choice
- A bounded linear operator between normed spaces
- Coordinate columns $[v]_{\mathcal B}$ and matrices $[T]_{\mathcal B}^{\mathcal C}$ of linear maps relative to ordered bases
- 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
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Hilbert space
- Linear independence: a finite list $v : n \to V$ is independent when $\sum_{i<n} \lambda_i v_i = 0_V$ forces every $\lambda_i = 0_F$, and a subset $S \subseteq V$ is independent when every injective finite list into $S$ is independent
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Real and complex inner-product spaces and their induced length
- Trace class operator
- Arbitrary-Hilbert Fredholm determinant from a separable reducing support
- $\operatorname{span}\{v\} = \{\, \lambda v : \lambda \in F \,\}$, which is $\{0_V\}$ when $v = 0_V$, and when $v \ne 0_V$ contains $0_V$ only as the multiple $0_F v$
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- AC implies DC implies countable choice
- The determinant of a linear operator is independent of the chosen ordered basis
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
90 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)
- Dyatlov–Zworski, Mathematical Theory of Scattering Resonances, Appendix B §§B.5–B.6 (standard reference, not scraped)