
Group Theory




Maple 17 introduces a new package for working with groups, especially finite groups represented as groups of permutations.
>


>


 (1) 

Permutations


Permutations are created by using the Perm constructor. Arithmetic with permutations is effected by noncommutative multiplication (.) and exponentiation (^), with a permutation understood as conjugation, or otherwise, a power.
>


 (1.1) 
>


 (1.2) 
>


 (1.3) 
>


 (1.4) 
>


 (1.5) 
>


 (1.6) 


Permutation Groups


A focus for this release has been permutation groups: groups generated by a finite set of permutations on a finite set, which is taken to be the set {1,2,...,n}, for some positive integer n. In addition to abstract grouptheoretic properties and computations applicable to any (finite) group, a selection of computations specific to permutation groups is included.
>


 (2.1) 
>


 (2.2) 
>


 (2.3) 
>


 (2.4) 
>


 (2.5) 
>


 (2.6) 
>


 (2.7) 
>


 (2.8) 
>


 (2.9) 
>


 (2.10) 
>


>


 (2.11) 
>


 (2.12) 
>


 (2.13) 


CayleyTable Groups


A group may be defined by its Cayley table, the operation table of the group. Cayley tables are specified as integer arrays or matrices.
>


 (3.1) 
>


 (3.2) 
>


 (3.3) 


Finitely Presented Groups


You can define a group by specifying a set of generators and defining relations.
For example, here is a definition of the alternating group of degree 5:
>


 (4.1) 
We can verify the order of the group directly.
>


 (4.2) 
To check simplicity, we first convert the finitely presented group to a permutation group, and then use the IsSimple command.
>


 (4.3) 


Symbolic Groups


Symbolic groups are used to represent groups that depend on zero or more "parameters" (usually integers). They are used, for example, to represent some of the larger sporadic finite simple groups (such as the Monster and the HaradaNorton simple group) that are too large to support practical computation with group elements. Additionally, some constructors can take symbolic expressions for parameters and return a symbolic representation of the constructed group.
>


 (5.1) 
>


 (5.2) 
>


 (5.3) 
>


 (5.4) 
>


 (5.5) 
>


 (5.6) 


Group Constructors


Many groups can be created directly and conveniently by using purposebuilt constructors provided by the GroupTheory package:
>


 (6.1) 
>


 (6.2) 
>


 (6.3) 
>


 (6.4) 
>


 (6.5) 


Visualizations


It is useful to be able to visualize a group by examining its subgroup lattice graphically:
>


>


>


>




Group Properties


Support for testing a variety of group properties is included in the GroupTheory package.
>


 (8.1) 
>


 (8.2) 
>


 (8.3) 
>


 (8.4) 
>


 (8.5) 


Interesting Subgroups


A number of standard subgroups can be constructed with the GroupTheory package.
>


 (9.1) 
>


 (9.2) 
>


 (9.3) 
>


 (9.4) 
>


 (9.5) 
>


 (9.6) 
>


 (9.7) 
>


 (9.8) 
>


 (9.9) 


Isomorphism Testing and Group Identification


The GroupTheory package includes an isomorphism test for finite groups given by their Cayley tables. Operation of the command is extended to other finite groups by computing their Cayley tables, which is done automatically. The package also includes a database of all the finite groups of order not exceeding 200. Together, this allows any finite group with at most 200 elements to be identified unambiguously in a standard way.
We can verify the commutativity, up to isomorphism, of the direct product construction by using the AreIsomorphic command.
>


 (10.1) 
>


 (10.2) 
>


 (10.3) 
>


 (10.4) 


Download Help Document
Was this information helpful?