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 nondegenerate regular-trace pairing forces semisimplicity
Statement
Let be a field and a finite-dimensional field specialization from Finite Hecke specialization and its regular-trace determinant. For , let be left multiplication and define . The pairing is nondegenerate if for every implies . If is nondegenerate, then the left regular -module is semisimple, meaning an internal direct sum of simple left submodules (Semisimple modules as direct sums of simple modules). This implication holds over every field; no converse is asserted.
Facts & Assumptions
Given: A field , a finite-dimensional unital -algebra , and the regular-trace pairing .
is a finite-dimensional algebra with regular-trace pairing (Finite Hecke specialization and its regular-trace determinant).
A finite-dimensional module has a maximal proper submodule when nonzero, and iterating gives a finite composition series (Finite matrix and module preliminaries: right inverses, rank invariance, finite length and nilpotent trace).
A submodule of a finite direct sum of simple modules is isomorphic to a direct sum of a subfamily and has a complement (Finite matrix and module preliminaries: right inverses, rank invariance, finite length and nilpotent trace).
A nilpotent endomorphism of a finite-dimensional vector space has trace zero (Finite matrix and module preliminaries: right inverses, rank invariance, finite length and nilpotent trace).
A module is semisimple when it is an internal direct sum of simple submodules (Semisimple modules as direct sums of simple modules).
A simple left module is nonzero and has no proper nonzero submodule (Simple module: a nonzero module with no proper nonzero submodule).
Proof
By [F1], is finite-dimensional and is its regular-trace pairing. Define , intersecting over all simple left -modules as in [F6]. This equals the intersection of all maximal left ideals: if lies in every maximal left ideal and lies in a simple module , the map , , is onto and its kernel is maximal, so ; conversely, if annihilates every simple module then it kills in each simple quotient , so for every maximal left ideal . In particular is a two-sided ideal.
By [F2], choose a finite composition series of the left regular module. Since annihilates each simple factor , for every . Repeating this inclusion gives , and then because .
Starting with , if choose . The equality in step 1.1 gives a maximal left ideal not containing ; then contains and has strictly smaller -dimension than . Thus after at most steps the intersection is . This finite descent selects finitely many maximal left ideals and uses no arbitrary Choice.
For and , the two-sided-ideal property gives ; by step 1.2, . Hence , so [F4] gives for every .
The map sending to is an injective -module homomorphism: its kernel is , and each quotient is simple by [F6]. By [F3] its image is semisimple, so is semisimple.
Nondegeneracy of and step 2.2 imply for every , hence . Therefore is semisimple by step 3.1 and [F5]. No separable-division-algebra trace converse is used.
Depends on
- Algebras over a commutative ring, central structure maps, and algebra homomorphisms
- Finite Hecke specialization and its regular-trace determinant
- Semisimple modules as direct sums of simple modules
- Simple module: a nonzero module with no proper nonzero submodule
- Finite matrix and module preliminaries: right inverses, rank invariance, finite length and nilpotent trace
Used by
Dependency tree · two levels
42 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
- Arun Ram, Lectures in Representation Theory, Lecture 5 (standard reference, not scraped)
- Maarten Solleveld, Affine Hecke Algebras and Their Representations (standard reference, not scraped)