Unitriangular matrix group:UT(3,3): Difference between revisions
| Line 12: | Line 12: | ||
==Families== | ==Families== | ||
* [[Unitriangular matrix group:UT(3,p)]]: For an odd prime <math>p</math>, this is the unique non-abelian group of order <math>p^3</math> and exponent <math>p</math>. It is the group of unipotent upper-triangular <math>3 \times 3</math> matrices over the field of three | * [[Unitriangular matrix group:UT(3,p)]]: For an odd prime <math>p</math>, this is the unique non-abelian group of order <math>p^3</math> and exponent <math>p</math>. It is the group of unipotent upper-triangular <math>3 \times 3</math> matrices over the field of <math>p</math> elements. it can more generally be viewed as a [[unitriangular matrix group of degree three]]. | ||
* [[Burnside group]]s: This group is <math>B(2,3)</math>. In general, the Burnside groups <math>B(m,3)</math> are all finite. | * [[Burnside group]]s: This group is <math>B(2,3)</math>. In general, the Burnside groups <math>B(m,3)</math> are all finite. | ||
Revision as of 21:20, 13 September 2012
This article is about a particular group, i.e., a group unique upto isomorphism. View specific information (such as linear representation theory, subgroup structure) about this group
View a complete list of particular groups (this is a very huge list!)[SHOW MORE]
Definition
This group is defined in the following equivalent ways:
- It is the unique (up to isomorphism) non-abelian group of order and exponent .
- It is the unitriangular matrix group of degree three over the field of three elements.
- It is the inner automorphism group of wreath product of groups of order p for .
- It is the Burnside group : the quotient of the free group of rank two by the subgroup generated by all cubes in the group.
Families
- Unitriangular matrix group:UT(3,p): For an odd prime , this is the unique non-abelian group of order and exponent . It is the group of unipotent upper-triangular matrices over the field of elements. it can more generally be viewed as a unitriangular matrix group of degree three.
- Burnside groups: This group is . In general, the Burnside groups are all finite.
Arithmetic functions
Group properties
| Property | Satisfied | Explanation |
|---|---|---|
| abelian group | No | |
| group of prime power order | Yes | |
| nilpotent group | Yes | prime power order implies nilpotent |
| solvable group | Yes | |
| extraspecial group | Yes | |
| Frattini-in-center group | Yes |
Other associated constructs
| Associated construct | Isomorphism class | Comment |
|---|---|---|
| Lazard Lie ring | upper-triangular nilpotent Lie ring:u(3,3) |
Linear representation theory
Further information: linear representation theory of unitriangular matrix group:UT(3,3)
Summary
| Item | Value |
|---|---|
| degrees of irreducible representations over a splitting field | 1,1,1,1,1,1,1,1,1,3,3 (1 occurs 9 times, 3 occurs 2 times) maximum: 3, lcm: 3, number: 11, sum of squares: 27 |
| Schur index values of irreducible representations | 1,1,1,1,1,1,1,1,1,1,1 |
| smallest field of realization (characteristic zero) | or |
| condition for a field to be a splitting field | characteristic not 3, contains a primitive cube root of unity, i.e., the polynomial splits. For a finite field of size , equivalent to 3 dividing |
| smallest size splitting field | field:F4, i.e., the field with 4 elements |
| orbit structure of irreducible representations under automorphism group | ? |
GAP implementation
Group ID
This finite group has order 27 and has ID 3 among the groups of order 27 in GAP's SmallGroup library. For context, there are groups of order 27. It can thus be defined using GAP's SmallGroup function as:
SmallGroup(27,3)
For instance, we can use the following assignment in GAP to create the group and name it :
gap> G := SmallGroup(27,3);
Conversely, to check whether a given group is in fact the group we want, we can use GAP's IdGroup function:
IdGroup(G) = [27,3]
or just do:
IdGroup(G)
to have GAP output the group ID, that we can then compare to what we want.
Related pages
UT(3,) , UT(4,) , UT(3, p) , UT(4, 2 ) , UT(4, 3 ) , UT(4, p ) .