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 modules over an algebra with an invertible odd element
Statement
Let be a -graded unital associative algebra over a field, and suppose it contains an invertible homogeneous element . For left modules, the rule gives a bijection between isomorphism classes of graded-simple -modules (with even isomorphisms) and isomorphism classes of simple -modules. An inverse sends a left -module to the induced graded module .
Facts & Assumptions
Given: A graded unital algebra , an invertible odd element , and a left -module or graded left -module .
The multiplication satisfies , and a graded module satisfies (Graded algebras, graded modules, and the graded tensor product).
A graded-simple module is nonzero and has no proper nonzero graded submodule; even isomorphisms preserve both parity components (Graded algebras, graded modules, and the graded tensor product).
Every balanced map from a right module and a left module induces a unique homomorphism from their tensor product (Universal property of the tensor product for balanced maps into abelian groups).
Proof
Write with . From , the odd component and even component must be and , respectively. Since is invertible, and . Consequently : inclusion follows from [F1], and for , gives .
For any graded left -module , multiplication by maps bijectively onto : it maps into by [F1], and its inverse maps into . Thus every homogeneous component of is generated from by the -action.
Define by . The multiplication map is balanced over , so [F3] makes well defined; associativity makes it -linear. Its even part is an isomorphism with inverse , by the balancing relation. By step 1.1, the map , , is an isomorphism: its inverse is , which is well defined because and respects balancing. Under this identification, the odd part of is , bijective by step 2.1. Hence is a graded -module isomorphism.
If is a graded submodule, then by invertibility of and the grading. Conversely, for any -submodule , the subspace is graded and is stable under : for , , so ; for , step 1.1 writes with , whence and because . Thus it is an -submodule. By the definition of graded-simple in [F2], has a proper nonzero graded submodule exactly when has a proper nonzero -submodule.
For any left -module , the induced module splits as : the map is well defined by balancing and has inverse given by addition. This is a grading because left multiplication respects the parity of , while the balancing relations use only even elements. Its degree-zero part is isomorphic to by , with inverse . If is simple, step 3.2 makes the induced module graded-simple. Conversely, step 3.1 identifies any graded with the module induced from , and step 3.2 says is graded-simple exactly when is simple. Restriction to degree zero and induction are therefore inverse on isomorphism classes: even -isomorphisms restrict to -isomorphisms, and -isomorphisms induce even -isomorphisms.
Depends on
Used by
Dependency tree · two levels
8 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
- M. F. Atiyah, R. Bott, and A. Shapiro, Clifford Modules, Part I, §5, Proposition 5.1 (standard reference, not scraped)
- Konstantin Wernli, Lecture Notes on Spin Geometry, §1.5 (standard reference, not scraped)