Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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.

Graded Hermitian Clifford modules and geometric Dirac operators

Definition

Let (M,g) be a smooth Riemannian manifold of even dimension 2m, and let V=V+⊕V− be a finite-rank smooth complex vector bundle with a Hermitian metric linear in its first variable. Write ClC(T∗M,−g) for the complex Clifford bundle generated by cotangent vectors with relation ξη+ηξ=−2g−1(ξ,η). A graded Hermitian Clifford action is a smooth real-linear map c:T∗M→End⁡C(V) such that c(ξ)∗=−c(ξ), c(ξ)V±⊆V∓, and c(ξ)c(η)+c(η)c(ξ)=−2g−1(ξ,η)I. It extends complex-linearly to the complex Clifford bundle.

A graded Hermitian Clifford connection is a unitary connection ∇V preserving V± and satisfying ∇XV(c(ξ)v)=c(∇XLCξ)v+c(ξ)∇XVv for smooth X,ξ,v, where ∇LC is the Levi–Civita connection. In a local orthonormal coframe (ei) define DVv=∑ic(ei)∇eiVv. The operator is odd, so its chiral part is DV+:C∞(V+)→C∞(V−). Under Countable Choice (The Axiom of Countable Choice (ACω)), the formula's frame independence, formal symmetry on closed M, and global bundle well-definedness are proved in The geometric Dirac operator is globally well defined and formally symmetric ↗. A domain and index are assigned only under the compact hypotheses of later items.

Depends on

Used by

Dependency tree · two levels

27 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