Wolfram Function Repository
Instant-use add-on functions for the Wolfram Language
Function Repository Resource:
Construct direct products of groups
ResourceFunction["GroupDirectProduct"][G1,G2,…,Gn] constructs the direct product of groups G1,G2,…,Gn. |
Construct Klein's 4-group:
| In[1]:= |
| Out[1]= |
Its multiplication table:
| In[2]:= |
| Out[2]= | ![]() |
CyclicGroup[4] also has order 4 but differs from Klein's 4-group:
| In[3]:= |
| Out[3]= | ![]() |
Construct direct products of explicit permutation groups:
| In[4]:= | ![]() |
| Out[4]= |
Find its order:
| In[5]:= |
| Out[5]= |
Easily deal with large groups:
| In[6]:= | ![]() |
| Out[6]= |
This is as expected:
| In[7]:= |
| Out[7]= |
Compute direct products of large named groups:
| In[8]:= |
| Out[8]= |
Construct direct product of more than 2 groups:
| In[9]:= |
| Out[9]= |
Show that CyclicGroup[2] × CyclicGroup[2] × CyclicGroup[2] shares the same structure as that of AbelianGroup[{2,2,2}]:
| In[10]:= |
| Out[10]= | ![]() |
| In[11]:= | ![]() |
| Out[11]= | ![]() |
Index of the subgroup {e}×CyclicGroup[2] inside CyclicGroup[4]×CyclicGroup[2] yields the expected order of the quotient group (CyclicGroup[4]):
| In[12]:= |
| In[13]:= |
| Out[13]= |
Construct the symmetry group of a regular n-gonal prism:
| In[14]:= |
For n=6:
| In[15]:= |
| Out[15]= |
Show that the symmetry group of a disjoint union of two separate complete graphs is the direct product of their respective symmetric groups:
| In[16]:= |
| In[17]:= |
| Out[17]= |
| In[18]:= |
| Out[18]= |
Verify that these are isomorphic to each other:
| In[19]:= |
| Out[19]= |
Order of the direct product equals product of orders of the constituent groups:
| In[20]:= |
| In[21]:= |
| Out[21]= |
Direct product of a single group is nothing but that group itself:
| In[22]:= |
| Out[22]= |
The direct product with the trivial group returns a structure isomorphic to that of the group itself:
| In[23]:= | ![]() |
| Out[23]= |
For some groups, data may not be available in the Wolfram language:
| In[24]:= |
| Out[24]= |
As such, it is not possible to compute direct products of these:
| In[25]:= |
| Out[25]= |
When gcd(m,n)=1 we have that CyclicGroup[mn] is isomorphic to CyclicGroup[m]×CyclicGroup[n]:
| In[26]:= |
| Out[26]= |
However, otherwise this equivalence is not guaranteed:
| In[27]:= |
| Out[27]= |
This work is licensed under a Creative Commons Attribution 4.0 International License