Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 A=A0⊕A1 be a Z/2-graded unital associative algebra over a field, and suppose it contains an invertible homogeneous element u∈A1. For left modules, the rule M↦M0 gives a bijection between isomorphism classes of graded-simple A-modules (with even isomorphisms) and isomorphism classes of simple A0-modules. An inverse sends a left A0-module N to the induced graded module A⊗A0N.

Facts & Assumptions

Given: A graded unital algebra A=A0⊕A1, an invertible odd element u, and a left A0-module N or graded left A-module M.

[F1]

The multiplication satisfies AiAj⊆Ai+j(mod2), and a graded module satisfies AiMj⊆Mi+j(mod2) (Graded algebras, graded modules, and the graded tensor product).

[F2]

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).

[F3]

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

technique · induction and submodule correspondence
1.1givenF1constructalgebra

Write u−1=x0+x1 with xi∈Ai. From 1=uu−1=ux0+ux1, the odd component ux0 and even component ux1 must be 0 and 1, respectively. Since u is invertible, x0=0 and u−1=x1∈A1. Consequently A1=uA0: inclusion follows from [F1], and for a∈A1, u−1a∈A0 gives a=u(u−1a).

2.1givenF1step 1.1algebra

For any graded left A-module M, multiplication by u maps M0 bijectively onto M1: it maps into M1 by [F1], and its inverse u−1 maps M1 into M0. Thus every homogeneous component of M is generated from M0 by the A-action.

3.1givenF1F3step 1.1step 2.1construct

Define μ:A⊗A0M0→M by μ(a⊗m)=am. The multiplication map is balanced over A0, so [F3] makes μ well defined; associativity makes it A-linear. Its even part A0⊗A0M0→M0 is an isomorphism with inverse m↦1⊗m, by the balancing relation. By step 1.1, the map M0→A1⊗A0M0, m↦u⊗m, is an isomorphism: its inverse is a1⊗m↦(u−1a1)m, which is well defined because u−1a1∈A0 and respects balancing. Under this identification, the odd part of μ is m↦um, bijective by step 2.1. Hence μ is a graded A-module isomorphism.

3.2givenF1F2step 1.1step 2.1algebra

If L⊆M is a graded submodule, then L1=uL0 by invertibility of u and the grading. Conversely, for any A0-submodule N⊆M0, the subspace N⊕uN is graded and is stable under A: for a∈A0, u−1au∈A0, so a(un)=u(u−1au)n∈uN; for b∈A1, step 1.1 writes b=ua0 with a0∈A0, whence bN⊆uN and b(uN)⊆N because ua0u∈A0. Thus it is an A-submodule. By the definition of graded-simple in [F2], M has a proper nonzero graded submodule exactly when M0 has a proper nonzero A0-submodule.

4.1F2F3step 3.1step 3.2algebra∎

For any left A0-module N, the induced module A⊗A0N splits as A0⊗A0N⊕A1⊗A0N: the map (a0+a1)⊗n↦(a0⊗n,a1⊗n) is well defined by balancing and has inverse given by addition. This is a grading because left multiplication respects the parity of A, while the balancing relations use only even elements. Its degree-zero part is isomorphic to N by a0⊗n↦a0n, with inverse n↦1⊗n. If N is simple, step 3.2 makes the induced module graded-simple. Conversely, step 3.1 identifies any graded M with the module induced from M0, and step 3.2 says M is graded-simple exactly when M0 is simple. Restriction to degree zero and induction are therefore inverse on isomorphism classes: even A-isomorphisms restrict to A0-isomorphisms, and A0-isomorphisms induce even A-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