Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 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.

Choice-free semisimple characterizations for finite-length modules

Statement

For a finite-length module, the direct-sum, sum-of-simples, and complement characterizations of semisimplicity are equivalent without any choice principle. See Equivalent characterizations of semisimple modules.

Facts & Assumptions

Given: The hypotheses and objects in the Statement.

[L1]

A composition series of a left R-module M is a finite chain 0=M0<M1<<Mn=M whose factors Mi/Mi1 are simple. If such a series exists, the length R(M) is its number n of factors; thm-jordan-holder-theorem-for-modules proves independence of the chosen series. The zero module has the empty series and length 0. (Composition series and length of a module).

[L2]

Any two composition series of a module have the same length, and their simple factors agree up to permutation and isomorphism. (Jordan–Hölder theorem for modules).

Proof

technique · direct
1.1

Suppose M is a sum of simple submodules and start with D0=0. If DkM, some simple Sk is not contained in Dk, so simplicity gives SkDk=0 and Dk+1=DkSk. Intersecting a fixed n-factor composition series of M with Dk and deleting repetitions gives a composition series of Dk with at most n factors. Since Dk already has the k-factor series obtained by adding the Sj one at a time, [L2] gives kn. Thus after at most n finite choices the process reaches M, proving that a sum of simples is a finite direct sum without any choice axiom.

L1L2givenalgebra
2.1

Now write a finite direct-sum decomposition M=i=1tSi and let NM. Process the finitely many Si in order, maintaining a sum C with CN=0: add Si exactly when Si≰N+C. In that case simplicity gives Si(N+C)=0, so the invariant persists. At the end every SiN+C, whence M=NC. This proves that the direct-sum condition implies the complement condition without Zorn.

step 1.1givenalgebra
3.1

Conversely, suppose every submodule of the finite-length module M has a complement, and induct on a fixed composition-series length. If M0, let A be the penultimate term of such a series. A complement S gives M=AS with SM/A simple. The complement property passes to A: for LA, if M=LD, then A=L(AD). The induction hypothesis makes A a finite direct sum of simples, hence so is M. Together with step 1.1 and the trivial direct-sum-to-sum implication, this proves all three equivalences, including lengths zero and one, without Choice.

L1step 1.1step 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: 29 results over 9 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