Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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 algebras, graded modules, and the graded tensor product

Definition

Let k be a field. A Z/2-graded k-vector space is a direct sum A=A0⊕A1; a homogeneous element a∈Ai has parity ∣a∣=i∈{0,1}. A Z/2-graded unital associative k-algebra is such a space with 1∈A0 and AiAj⊆Ai+j(mod2). A graded left module is a module M=M0⊕M1 satisfying AiMj⊆Mi+j(mod2). A graded submodule is an A-submodule N=N0⊕N1; a graded-simple module is nonzero and has no proper nonzero graded submodule. An isomorphism of graded modules preserves both parity components.

For graded algebras A,B, their graded tensor product A⊗^kB has underlying vector space A⊗kB, parity (A⊗^B)r=⨁i+j=rAi⊗kBj, and multiplication

(a⊗b)(a′⊗b′)=(−1)∣b∣∣a′∣(aa′⊗bb′)

for homogeneous factors, extended by the finite sum

∑i,j,r,s∈{0,1}(−1)jr(aiar′⊗bjbs′),a=∑iai, b=∑jbj, a′=∑rar′, b′=∑sbs′.

Each parity projection is linear, so this formula is k-multilinear in the four inputs and therefore defines a multiplication on (A⊗kB)×(A⊗kB) by Finite iterated tensor products represent multilinear maps independently of parenthesization. The unit is 1A⊗1B. For three homogeneous tensors, both associative bracketings contribute the sign exponent ∣b∣∣a′∣+∣b∣∣a′′∣+∣b′∣∣a′′∣, so the multiplication is associative.

Depends on

Used by

Dependency tree · two levels

4 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