Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17
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.

Equivalent module-theoretic characterizations of semisimple rings

Statement

Assuming the Axiom of Choice, for a unital ring R the following are equivalent: RR is semisimple; every left R-module is semisimple; every short exact sequence of left R-modules splits; and every left R-module is projective. See A semisimple ring as a ring whose left regular module is semisimple.

Facts & Assumptions

Given: The hypotheses and objects in the Statement.

[L1]

A unital ring R is semisimple when its left regular module RR is semisimple. This is a left-module definition and uses no Jacobson radical. For the zero ring, the regular module is zero and hence semisimple; the Wedderburn-Artin theorem below is stated for nonzero rings. (A semisimple ring as a ring whose left regular module is semisimple).

[L2]

Assuming the Axiom of Choice, every submodule and every quotient of a semisimple module is semisimple. (Under Choice, submodules and quotients of semisimple modules are semisimple).

[L3]

For every left R-module M, the free module R(M) on its underlying set admits a canonical surjection εM:R(M)M, determined by εM(em)=m. Consequently MR(M)/kerεM. (Every module is a quotient of a free module).

[L4]

In a short exact sequence 0AiBpC0, a section of p is a homomorphism s:CB with ps=idC, and a retraction of i is a homomorphism r:BA with ri=idA. (Split short exact sequences, sections, and retractions).

[L5]

For a short exact sequence 0AiBpC0, the following are equivalent: 1. p has a section s:CB; 2. i has a retraction r:BA; 3. there is an isomorphism Φ:ACB with Φ(a,0)=i(a) and p(Φ(a,c))=c. (The splitting lemma for short exact sequences of modules).

[L6]

A left R-module P is projective if it has the lifting property for epimorphisms: whenever q:EM is a surjective module homomorphism and f:PM is a module homomorphism, there exists a module homomorphism f~:PE such that qf~=f (def-module-homomorphism-kernel-image-and-cokernel, def-injection-surjection-bijection). (Projective modules and the lifting property).

[L7]

For a left R-module P, assertions 1 to 3 below are equivalent without choice. Under the Axiom of Choice, they are also equivalent to assertion 4: 1. P is projective; 2. every short exact sequence 0KEP0 splits; 3. HomR(P,) takes every short exact sequence to a short exact sequence; 4. P is a direct summand of a free module. (Equivalent characterizations of projective modules).

[L8]

Assuming the Axiom of Choice, a module is semisimple if and only if every submodule has a complementary submodule. (Equivalent characterizations of semisimple modules).

Proof

technique · direct
1.1

If RR is semisimple, every free left module, being a direct sum of copies of R, is semisimple; every module is a quotient of a free module, so every left module is semisimple.

L1L2L3L4L5L6L7L8givenalgebra
2.1

If every left module is semisimple, [L8] gives every submodule a complement, and the splitting lemma makes every short exact sequence split. Conversely, if every short exact sequence splits, the projective criterion makes every module projective; if every module is projective, each quotient map splits, so [L8] makes every module semisimple.

L5L7L8step 1.1givenalgebra
3.1

Applying the universal module condition to the left regular module recovers the first condition, and every clause is left-handed as asserted. This proves the stated claim.

step 2.1givenalgebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 46 results over 11 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources