Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck pass
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 n≥1, let S0 be a nonzero finite-dimensional Hermitian module for the negative-sign complex Clifford algebra, with skew-Hermitian generators c(ej) satisfying c(ξ)2=−∣ξ∣2I. On Rn with its Euclidean metric, let D=∑j=1nc(ej)∂j,Dom⁡(D)=H1(Rn;S0)⊂L2(Rn;S0). Then D is closed and densely defined, its range is dense but not all of L2, and therefore it is not Fredholm.

Facts & Assumptions

Given: Countable choice, the Euclidean Clifford module, and the stated H1 domain.

[F1]

The Clifford relation implies c(ξ)∗c(ξ)=∣ξ∣2I and c(ξ) is invertible for ξ≠0 with inverse norm ∣ξ∣−1 (Graded Hermitian Clifford modules and geometric Dirac operators, Universal Clifford algebra of a quadratic space).

[F2]

The Fourier transform extends to a unitary map on L2(Rn); distributional derivatives transform to multiplication by 2πiξj (Plancherel theorem, Distributional derivatives are polynomial Fourier multipliers).

[F3]

H1(Rn;S0) consists of L2 sections whose first distributional derivatives are in L2, componentwise (Integer-order Sobolev spaces and their norms).

[A1]

Countable choice is assumed by the Fourier-transform interface [F2] and the Sobolev-space interface [F3] (The Axiom of Countable Choice (ACω)).

Proof

Given: The domain and operator above.

1.1A1F1F2F3construct

Under the unitary Fourier transform [F2], D is multiplication by 2πic(ξ). By [F1], its maximal multiplier domain is exactly {u∈L2:∣ξ∣u^∈L2}. If u∈H1, [F3] and the distributional derivative identity in [F2] put ∣ξ∣u^ in L2. Conversely, if ∣ξ∣u^∈L2, then each 2πiξju^ is in L2; its inverse Plancherel transform is the distributional derivative ∂ju, by the Fourier differentiation identity and injectivity of the Fourier transform on tempered distributions. Hence u∈H1 by [F3]. A multiplication operator by a measurable finite matrix is closed, since convergence of uk and c(ξ)uk in L2 has an almost-everywhere convergent subsequence and the pointwise multiplication identity passes to the limit. Schwartz sections are dense in L2, so D is densely defined and closed.

2.1F1F2step 1.1

If h is orthogonal to the range, then distributionally D∗h=0. Fourier transformation and [F2] give c(ξ)h^(ξ)=0 almost everywhere. By [F1], c(ξ) is invertible for every ξ≠0, and the singleton {0} has Lebesgue measure zero; hence h^=0 almost everywhere and h=0. Thus the range is dense.

2.2F1F2step 1.1algebra

Fix a unit vector v∈S0 and define g^(ξ)=1{0<∣ξ∣<1}∣ξ∣−(n/2−1)v. Polar coordinates give ∥g^∥22=Cn∫01rn−1−2(n/2−1) dr=Cn∫01r dr<∞, so [F2] gives g∈L2. If g=Du for some u∈H1, then for almost every ξ≠0, [F1] forces ∣u^(ξ)∣=(2π)−1∣ξ∣−1∣g^(ξ)∣. Consequently its squared norm near zero is a positive constant times ∫01rn−1−2(n/2) dr=∫01r−1 dr=∞, contradicting u∈L2. Thus g is not in the range, so the dense range is proper and not closed. A Fredholm operator must have closed range, hence D is not Fredholm.

3.1A1F1F2F3step 1.1step 2.2∎

The construction works also for n=1, where g^(ξ)=1{0<∣ξ∣<1}∣ξ∣1/2v and the displayed L2 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