An algorithm for determining the simplicity of a modular group representation (Q1109882)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for determining the simplicity of a modular group representation |
scientific article; zbMATH DE number 4071178
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for determining the simplicity of a modular group representation |
scientific article; zbMATH DE number 4071178 |
Statements
An algorithm for determining the simplicity of a modular group representation (English)
0 references
1988
0 references
Let G be a finite group and \(\kappa\) : \(G\to GL_ n(F)\) a faithful representation of G over a splitting field F, so that the space \(F^ n\) becomes a module over the group algebra FG. Identify each \(g\in G\) with \(\kappa\) (g). Let \(t\leq n\) and let \(N_ t\) be the intersection of the nullspaces of all \(S_{2t}[g_ 1,g_ 2,...,g_{2t}]\), where each \(g_ i\in G\), and \(S_{2t}[X_ 1,X_ 2,...,X_{2t}]\) is the standard polynomial of degree 2t, in the sense of Amitsur and Levitski. Then the socle of \(N_ t\) is the sum of all those simple FG-submodules of \(F^ n\) that have F-dimension at most t. Consequently, \(F^ n\) is FG-simple if and only if \(N_{n-1}=0\).
0 references
simple modules
0 references
polynomial identities
0 references
finite group
0 references
faithful representation
0 references
splitting field
0 references
group algebra
0 references
standard polynomial
0 references
simple FG-submodules
0 references
0.8883251
0 references
0.88699013
0 references
0.8772358
0 references
0.87699926
0 references
0.87600076
0 references
0.8721316
0 references