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.
The Euclidean Dirac operator has nonclosed range at zero
Statement
Assume Countable Choice.
For , let be a nonzero finite-dimensional Hermitian module for the negative-sign complex Clifford algebra, with skew-Hermitian generators satisfying . On with its Euclidean metric, let Then is closed and densely defined, its range is dense but not all of , and therefore it is not Fredholm.
Facts & Assumptions
Given: Countable choice, the Euclidean Clifford module, and the stated domain.
The Clifford relation implies and is invertible for with inverse norm (Graded Hermitian Clifford modules and geometric Dirac operators, Universal Clifford algebra of a quadratic space).
The Fourier transform extends to a unitary map on ; distributional derivatives transform to multiplication by (Plancherel theorem, Distributional derivatives are polynomial Fourier multipliers).
consists of sections whose first distributional derivatives are in , componentwise (Integer-order Sobolev spaces and their norms).
Countable choice is assumed by the Fourier-transform interface [F2] and the Sobolev-space interface [F3] (The Axiom of Countable Choice ()).
Proof
Given: The domain and operator above.
Under the unitary Fourier transform [F2], is multiplication by . By [F1], its maximal multiplier domain is exactly . If , [F3] and the distributional derivative identity in [F2] put in . Conversely, if , then each is in ; its inverse Plancherel transform is the distributional derivative , by the Fourier differentiation identity and injectivity of the Fourier transform on tempered distributions. Hence by [F3]. A multiplication operator by a measurable finite matrix is closed, since convergence of and in has an almost-everywhere convergent subsequence and the pointwise multiplication identity passes to the limit. Schwartz sections are dense in , so is densely defined and closed.
If is orthogonal to the range, then distributionally . Fourier transformation and [F2] give almost everywhere. By [F1], is invertible for every , and the singleton has Lebesgue measure zero; hence almost everywhere and . Thus the range is dense.
Fix a unit vector and define . Polar coordinates give , so [F2] gives . If for some , then for almost every , [F1] forces . Consequently its squared norm near zero is a positive constant times , contradicting . Thus is not in the range, so the dense range is proper and not closed. A Fredholm operator must have closed range, hence is not Fredholm.
The construction works also for , where and the displayed integral is still finite; the logarithmic divergence after division by is unchanged. The zero-frequency set has measure zero, but arbitrarily small nonzero frequencies cause the obstruction. Countable choice is used through the Fourier and Sobolev interfaces [F2]–[F3] and the almost-everywhere subsequence argument in step 1.1.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
37 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
- Konstantin Wernli, Lecture Notes on Spin Geometry (2019) (standard reference, not scraped)
- Liviu I. Nicolaescu, Notes on the Atiyah–Singer Index Theorem, revision 15 November 2013 (standard reference, not scraped)