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.
A finite-dimensional algebra separates its split simple modules
Statement
Let be a finite-dimensional unital -algebra and a family of pairwise nonisomorphic simple left -modules satisfying . Then is finite, every is finite-dimensional, and the action map is surjective. The empty product is the zero algebra.
Facts & Assumptions
Given: as stated; simple modules are nonzero.
A nonzero map between simple modules is an isomorphism (Schur's lemma for simple modules).
Finite direct sums have componentwise actions; the empty sum is zero (The direct sum of an indexed family of modules).
A basis is an independent spanning set (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).
An independent set has at most as many elements as a finite spanning set (If has a spanning set with elements, then every linearly independent subset of is finite with at most elements; in particular has no linearly independent subset equinumerous with ).
Proof
Every submodule of a finite sum of simple modules has a complement that is a sum of simple modules of the listed types. Here is the induction proving this assertion. For , take complement . Write , with simple, and suppose the assertion proved for . If , then ; a complement of in complements . Otherwise , and projection to identifies with a submodule of . Write by the induction hypothesis. There is an -linear map with . Every equals , uniquely, so . These cases exhaust the possibilities since is a submodule of .
For each member of a finite selection of the , choose . Simplicity gives . Images of a finite basis of span . Scanning that list and retaining a vector precisely when it is outside the previous span gives an independent spanning list , with . Only finitely many selections have been made.
For this finite selection put and . If , step 1.1 supplies a nonzero simple summand of a complement, isomorphic to some , and projection onto it gives a nonzero -linear with . Its restrictions to copies of vanish for by Schur, and on the copies of are scalars . Since , we have . Independence gives for all , so , a contradiction. Therefore .
Given any tuple of -endomorphisms , step 2.1 supplies with . Then for every basis vector, so induces on all of . Thus the action map for every finite selection is surjective. Lifting a vector-space basis of the target gives an independent list in (apply the map to any relation). Consequently , in particular the size of the selection is at most .
If had more than members, finite induction would select distinct indices, contradicting step 3.1. Thus is finite and that step proves the asserted surjectivity. If is empty, the unique map onto zero is surjective; if , no nonzero unital simple module exists and this is the only case.
Remarks
The finite simultaneous-density argument supplies the surjectivity used in Yanqi Lake Theorem 11.2.2 without importing its radical or general density machinery.
Depends on
- Schur's lemma for simple modules
- The direct sum of an indexed family of modules
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- If $V$ has a spanning set with $n$ elements, then every linearly independent subset of $V$ is finite with at most $n$ elements; in particular $V$ has no linearly independent subset equinumerous with $\mathbb{N}$
Used by
Dependency tree · two levels
25 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
- Yanqi Lake Lectures on Algebra I, Theorems 11.1.5 and 11.2.2, pp.128 and 130 (standard reference, not scraped)