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.
A composition series of a left -module is a finite chain whose factors are simple. If such a series exists, the length is its number of factors; thm-jordan-holder-theorem-for-modules proves independence of the chosen series. The zero module has the empty series and length . (Composition series and length of a module).
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
Suppose is a sum of simple submodules and start with . If , some simple is not contained in , so simplicity gives and . Intersecting a fixed -factor composition series of with and deleting repetitions gives a composition series of with at most factors. Since already has the -factor series obtained by adding the one at a time, [L2] gives . Thus after at most finite choices the process reaches , proving that a sum of simples is a finite direct sum without any choice axiom.
Now write a finite direct-sum decomposition and let . Process the finitely many in order, maintaining a sum with : add exactly when . In that case simplicity gives , so the invariant persists. At the end every , whence . This proves that the direct-sum condition implies the complement condition without Zorn.
Conversely, suppose every submodule of the finite-length module has a complement, and induct on a fixed composition-series length. If , let be the penultimate term of such a series. A complement gives with simple. The complement property passes to : for , if , then . The induction hypothesis makes a finite direct sum of simples, hence so is . 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.
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
- Arvind Nair, Algebra I, Lecture 5 (standard reference, not scraped)