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.
Wedderburn–Artin theorem for semisimple rings
Statement
Facts & Assumptions
Given: The hypotheses and objects in the Statement.
For left -modules , endomorphisms of correspond to matrices with , and composition is matrix multiplication using composition in the entries. (Endomorphisms of a finite direct sum are matrices of Hom-groups).
Every finitely generated semisimple module is a finite direct sum of simple modules. (A finitely generated semisimple module is a finite direct sum of simple modules).
A nonzero homomorphism between simple modules is an isomorphism. Consequently the endomorphism ring of a simple module is a division ring. (Schur's lemma for simple modules).
For a division ring and , matrices with product form a semisimple ring whose left regular module is the direct sum of its simple column ideals. (Matrix rings over division rings are semisimple).
The opposite ring has the same addition and identity as and multiplication . (The opposite ring ).
A unital ring is semisimple when its left regular module 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).
Proof
If is semisimple, its cyclic left regular module is a finite direct sum of simple modules. Grouping isomorphic summands gives with pairwise nonisomorphic and positive .
Schur's lemma gives for and makes a division ring. Hence the endomorphism-matrix theorem gives .
Since , taking opposites gives . The opposite is again a division ring, and entrywise transpose is a ring isomorphism because reversing both the matrix product and the entry product gives in the target. Thus with .
Conversely, each is semisimple by its column-ideal decomposition, and a finite product is semisimple because its regular module is the finite direct sum of the factors' regular modules.
The Statement assumes that is nonzero, so the decomposition has at least one factor; no empty-product convention is asserted. This proves the stated claim.
Depends on
- $\operatorname{End}_R({}_R R)\cong R^{\mathrm{op}}$
- Endomorphisms of a finite direct sum are matrices of Hom-groups
- A finitely generated semisimple module is a finite direct sum of simple modules
- Schur's lemma for simple modules
- Matrix rings over division rings are semisimple
- The opposite ring $R^{\mathrm{op}}$
- A semisimple ring as a ring whose left regular module is semisimple
Used by
- Left and right semisimplicity of a ring agree Corollary
- The regular module is a direct sum of the projective covers of the simple modules, with the split-field multiplicities Corollary
- A product of two fields is semisimple with two simple-module types Example
- A projective simple in a symmetric block forces a matrix block Lemma
- Descended orbit idempotents are primitive and their blocks have one simple type Lemma
- Semisimple rings have vanishing positive Tor and Ext Proposition
- Defect zero blocks are simple algebras Theorem
- Galois orbits classify simple modules after splitting base change Theorem
- If k is algebraically closed and char k ∤ |G|, then k[G]≅∏ᵢ₌₁ʳ M_nᵢ(k) Theorem
- Simple modules over a product of matrix rings over division rings Theorem
- Uniqueness of the Wedderburn–Artin factors Theorem
Dependency tree · two levels
18 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
- William Crawley-Boevey, Noncommutative Algebra, Chapter 1 Sections 1.1-1.9 (standard reference, not scraped)