Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck 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 characterizations of semisimple modules

Statement

Assuming the Axiom of Choice, for a module M the following are equivalent: M is a direct sum of simple submodules; M is the sum of its simple submodules; and every submodule of M has a complementary submodule. See Semisimple modules as direct sums of simple modules.

Facts & Assumptions

Given: The hypotheses and objects in the Statement.

[L1]

A left R-module is semisimple when it is an internal direct sum of simple submodules, allowing the empty direct sum. Hence the zero module is semisimple. (Semisimple modules as direct sums of simple modules).

[L2]

Assuming the Axiom of Choice, every finitely generated nonzero module has a maximal proper submodule. (Under Choice, every finitely generated nonzero module has a maximal proper submodule).

[L3]

Assume the Axiom of Choice (def-axiom-of-choice). Let (P,≤) be a nonempty poset in which every chain has an upper bound. Then P has a maximal element (def-maximal-element). Note the hypothesis asks only for an upper bound, not a least upper bound, and the conclusion asserts only that a maximal element exists, never that a greatest one does. (Zorn's lemma).

[L4]

Let (Mi)i∈I be left R-modules and N a left R-module. For every family of homomorphisms fi:Mi→N, there is a unique homomorphism f:⨁i∈IMi⟶N such that f∘ȷi=fi for every i. It is given by f((mi))=∑i∈supp⁡(m)fi(mi). For I=∅, this is the unique map 0→N. (Universal property of a direct sum of modules).

[L5]

The socle Soc⁡(M) is the sum of all simple submodules of M. (The socle as the sum of all simple submodules).

Proof

technique · direct
1.1L1L2L3L4L5givenalgebra

A direct sum of simple submodules is plainly their sum. Conversely, if M is a sum of simple submodules, Zorn's lemma applied to independent families of them gives a maximal direct sum D; if D≠M, a simple submodule not contained in D meets D trivially, contradicting maximality.

2.1L3step 1.1givenalgebra

Given N≤M and a direct-sum decomposition M=⨁i∈ISi into simples, use Zorn to choose a maximal sum C=⨁j∈JSj with C∩N=0. If some Si were not contained in N+C, simplicity would give Si∩(N+C)=0, so adjoining it would contradict maximality. Hence every Si≤N+C, and therefore M=N⊕C.

3.1L2L5step 2.1givenalgebra∎

Conversely suppose every submodule has a complement. By [L5], choose C with M=Soc⁡(M)⊕C. If C≠0, choose 0≠x∈C. The cyclic module Rx has a maximal proper submodule K by [L2]. Let D complement K in M. Then Rx=K⊕(Rx∩D), and Rx∩D≅Rx/K is a nonzero simple submodule of C, contrary to C∩Soc⁡(M)=0. Hence C=0 and M is a sum of simples. The zero module is the empty sum.

Depends on

Used by

Dependency tree · two levels

16 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