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.

Given Spin and Spin-c structures and their spinor bundles

Definition

Let V→X be an oriented Euclidean real vector bundle of rank n, with oriented frame bundle P_SO(V). Use Spin(n)=Spin_N=1(ℝⁿ,−‖·‖²), the norm-one even subgroup of the negative-square Clifford algebra, and its standard twisted-Clifford homomorphism λ_n:Spin(n)→SO(n). A Spin structure on V is a principal Spin(n)-bundle P with a Spin(n)-equivariant two-fold map λ~:P→PSO(V) covering the identity on X and satisfying λ~(pg)=λ~(p)λn(g). Put Spin⁡c(n)=(Spin⁡(n)×U(1))/⟨(−1,−1)⟩ and define λnc:Spin⁡c(n)→SO(n) by λnc([s,z])=λn(s). A Spinc structure is a principal Spinc(n)-bundle Pc with a Spin⁡c(n)-equivariant map λ~c:Pc→PSO(V) over the identity satisfying λ~c(pg)=λ~c(p)λnc(g). A spinor bundle is the associated bundle for the specified real Clifford representation; a Spinc spinor bundle is Pc×τcS, where the specified complex representation τ of Spin⁡(n) and integer U(1) weight k satisfy τ(−1)(−1)k=IS, and τc([s,z])=zkτ(s). This condition is exactly that (−1,−1) act trivially, so the representation descends to the quotient. For the complex Clifford spinor representation, τ(−1)=−IS and the standard weight is k=1. These are given structures; this definition asserts no existence criterion.

Depends on

Used by

Dependency tree · two levels

19 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