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.
Matrix rings over division rings are semisimple
Statement
Let be a division ring and . On the set of arrays over , use entrywise addition and the product
These operations make a ring , and this ring is semisimple. More precisely, its left regular module is the direct sum of the simple column ideals for . See A semisimple ring as a ring whose left regular module is semisimple.
Facts & Assumptions
Given: The hypotheses and objects in the Statement.
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).
A division ring is a ring with in which every nonzero element has a two-sided multiplicative inverse. (Division ring: a ring with in which every nonzero element is a unit).
A ring has an abelian-group addition, an associative multiplication with identity, and both distributive laws; multiplication need not be commutative. (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides).
Finite sums in a commutative monoid are independent of the chosen enumeration, and the empty sum is . (A finite sum in a commutative monoid indexed by an arbitrary finite set).
A left -module is simple if and its only submodules are and . Equivalently, has no proper nonzero submodule. (Simple module: a nonzero module with no proper nonzero submodule).
Proof
Entrywise addition makes the arrays an abelian group. Associativity of multiplication follows by expanding both and and reassociating the finite double sum; the two distributive laws follow entrywise from those of . The matrix is a two-sided identity. Thus the displayed operations make the unital ring without any commutativity assumption on .
Let . Every matrix has the unique decomposition , and because the two sides have disjoint possible nonzero columns. Hence
Sending a matrix in to its -th column identifies that left ideal with under left matrix multiplication. If , choose with . For any , the matrix whose only possibly nonzero column is column , with entry , sends to . Thus every nonzero submodule of is all of , so each column ideal is simple.
The decomposition in step 2.1 is therefore a finite direct sum of simple left modules, so [L1] makes semisimple. For it is the single simple column ideal, and the hypothesis excludes an empty decomposition.
Depends on
- A semisimple ring as a ring whose left regular module is semisimple
- Division ring: a ring with $1 \ne 0$ in which every nonzero element is a unit
- Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides
- A finite sum in a commutative monoid indexed by an arbitrary finite set
- Simple module: a nonzero module with no proper nonzero submodule
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 53 results over 15 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
- William Crawley-Boevey, Noncommutative Algebra, Chapter 1 Sections 1.1-1.9 (standard reference, not scraped)