Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Modular representation theory
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Decomposition matrix and Cartan matrix== The [[composition series|composition factors]] of the projective indecomposable modules may be calculated as follows: Given the ordinary irreducible and irreducible Brauer characters of a particular finite group, the irreducible [[ordinary character]]s may be decomposed as non-negative integer combinations of the irreducible Brauer characters. The integers involved can be placed in a matrix, with the ordinary irreducible characters assigned rows and the irreducible Brauer characters assigned columns. This is referred to as the ''[[decomposition matrix]]'', and is frequently labelled ''D''. It is customary to place the trivial ordinary and Brauer characters in the first row and column respectively. The product of the transpose of ''D'' with ''D'' itself results in the [[Cartan matrix]], usually denoted ''C''; this is a symmetric matrix such that the entries in its ''j''-th row are the multiplicities of the respective simple modules as composition factors of the ''j''-th projective indecomposable module. The Cartan matrix is non-singular; in fact, its determinant is a power of the characteristic of ''K''. Since a projective indecomposable module in a given block has all its composition factors in that same block, each block has its own Cartan matrix.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)