Show commands: Gap / Magma / Oscar / SageMath

Copy content comment:Construction of abstract group
 
Copy content magma:G := SmallGroup(12, 5);
 
Copy content gap:G := SmallGroup(12, 5);
 
Copy content sage:G = PermutationGroup(['(1,2)', '(3,4)', '(5,7,6)'])
 
Copy content sage_gap:G = libgap.SmallGroup(12, 5)
 
Copy content oscar:G = small_group(12, 5)
 

Group information

Description:$C_2\times C_6$
Order: \(12\)\(\medspace = 2^{2} \cdot 3 \)
Copy content comment:Order of the group
 
Copy content magma:Order(G);
 
Copy content gap:Order(G);
 
Copy content sage:G.order()
 
Copy content sage_gap:G.Order()
 
Copy content oscar:order(G)
 
Exponent: \(6\)\(\medspace = 2 \cdot 3 \)
Copy content comment:Exponent of the group
 
Copy content magma:Exponent(G);
 
Copy content gap:Exponent(G);
 
Copy content sage:G.exponent()
 
Copy content sage_gap:G.Exponent()
 
Copy content oscar:exponent(G)
 
Automorphism group:$D_6$, of order \(12\)\(\medspace = 2^{2} \cdot 3 \)
Copy content comment:Automorphism group
 
Copy content gap:AutomorphismGroup(G);
 
Copy content magma:AutomorphismGroup(G);
 
Copy content sage:libgap(G).AutomorphismGroup()
 
Copy content sage_gap:G.AutomorphismGroup()
 
Copy content oscar:automorphism_group(G)
 
Composition factors:$C_2$ x 2, $C_3$
Copy content comment:Composition factors of the group
 
Copy content magma:CompositionFactors(G);
 
Copy content gap:CompositionSeries(G);
 
Copy content sage:G.composition_series()
 
Copy content sage_gap:G.CompositionSeries()
 
Copy content oscar:composition_series(G)
 
Nilpotency class:$1$
Copy content comment:Nilpotency class of the group
 
Copy content magma:NilpotencyClass(G);
 
Copy content gap:if IsNilpotentGroup(G) then NilpotencyClassOfGroup(G); fi;
 
Copy content sage:libgap(G).NilpotencyClassOfGroup() if G.is_nilpotent() else -1
 
Copy content sage_gap:G.NilpotencyClassOfGroup() if G.IsNilpotentGroup() else -1
 
Copy content oscar:if is_nilpotent(G) nilpotency_class(G) end
 
Derived length:$1$
Copy content comment:Derived length of the group
 
Copy content magma:DerivedLength(G);
 
Copy content gap:DerivedLength(G);
 
Copy content sage:libgap(G).DerivedLength()
 
Copy content sage_gap:G.DerivedLength()
 
Copy content oscar:derived_length(G)
 

This group is abelian (hence nilpotent, solvable, supersolvable, monomial, metabelian, and an A-group), elementary for $p = 2$ (hence hyperelementary), and metacyclic.

Copy content comment:Determine if the group G is abelian
 
Copy content magma:IsAbelian(G);
 
Copy content gap:IsAbelian(G);
 
Copy content sage:G.is_abelian()
 
Copy content sage_gap:G.IsAbelian()
 
Copy content oscar:is_abelian(G)
 
Copy content comment:Determine if the group G is cyclic
 
Copy content magma:IsCyclic(G);
 
Copy content gap:IsCyclic(G);
 
Copy content sage:G.is_cyclic()
 
Copy content sage_gap:G.IsCyclic()
 
Copy content oscar:is_cyclic(G)
 
Copy content comment:Determine if the group G is nilpotent
 
Copy content magma:IsNilpotent(G);
 
Copy content gap:IsNilpotentGroup(G);
 
Copy content sage:G.is_nilpotent()
 
Copy content sage_gap:G.IsNilpotentGroup()
 
Copy content oscar:is_nilpotent(G)
 
Copy content comment:Determine if the group G is solvable
 
Copy content magma:IsSolvable(G);
 
Copy content gap:IsSolvableGroup(G);
 
Copy content sage:G.is_solvable()
 
Copy content sage_gap:G.IsSolvableGroup()
 
Copy content oscar:is_solvable(G)
 
Copy content comment:Determine if the group G is supersolvable
 
Copy content gap:IsSupersolvableGroup(G);
 
Copy content sage:G.is_supersolvable()
 
Copy content sage_gap:G.IsSupersolvableGroup()
 
Copy content oscar:is_supersolvable(G)
 
Copy content comment:Determine if the group G is simple
 
Copy content magma:IsSimple(G);
 
Copy content gap:IsSimpleGroup(G);
 
Copy content sage:G.is_simple()
 
Copy content sage_gap:G.IsSimpleGroup()
 
Copy content oscar:is_simple(G)
 

Group statistics

Copy content comment:Compute statistics for the group G
 
Copy content magma:// Magma code to output the first two rows of the group statistics table element_orders := [Order(g) : g in G]; orders := Set(element_orders); printf "Orders: %o\n", orders; printf "Elements: %o %o\n", [#[x : x in element_orders | x eq n] : n in orders], Order(G); cc_orders := [cc[1] : cc in ConjugacyClasses(G)]; printf "Conjugacy classes: %o %o\n", [#[x : x in cc_orders | x eq n] : n in orders], #cc_orders;
 
Copy content gap:# Gap code to output the first two rows of the group statistics table element_orders := List(Elements(G), g -> Order(g)); orders := Set(element_orders); Print("Orders: ", orders, "\n"); element_counts := List(orders, n -> Length(Filtered(element_orders, x -> x = n))); Print("Elements: ", element_counts, " ", Size(G), "\n"); cc_orders := List(ConjugacyClasses(G), cc -> Order(Representative(cc))); cc_counts := List(orders, n -> Length(Filtered(cc_orders, x -> x = n))); Print("Conjugacy classes: ", cc_counts, " ", Length(ConjugacyClasses(G)), "\n");
 
Copy content sage:# Sage code to output the first two rows of the group statistics table element_orders = [g.order() for g in G] orders = sorted(list(set(element_orders))) print("Orders:", orders) print("Elements:", [element_orders.count(n) for n in orders], G.order()) cc_orders = [cc[0].order() for cc in G.conjugacy_classes()] print("Conjugacy classes:", [cc_orders.count(n) for n in orders], len(cc_orders))
 
Copy content sage_gap:# Sage code (using the GAP interface) to output the first two rows of the group statistics table element_orders = [g.Order() for g in G.Elements()] orders = sorted(list(set(element_orders))) print("Orders:", orders) print("Elements:", [element_orders.count(n) for n in orders], G.Order()) cc_orders = [cc.Representative().Order() for cc in G.ConjugacyClasses()] print("Conjugacy classes:", [cc_orders.count(n) for n in orders], len(cc_orders))
 
Copy content oscar:# Oscar code to output the first two rows of the group statistics table element_orders = [order(g) for g in elements(G)] orders = sort(unique(element_orders)) println("Orders: ", orders) element_counts = [count(==(n), element_orders) for n in orders] println("Elements: ", element_counts, " ", order(G)) ccs = conjugacy_classes(G) cc_orders = [order(representative(cc)) for cc in ccs] cc_counts = [count(==(n), cc_orders) for n in orders] println("Conjugacy classes: ", cc_counts, " ", length(ccs))
 

Order 1 2 3 6
Elements 1 3 2 6 12
Conjugacy classes   1 3 2 6 12
Divisions 1 3 1 3 8
Autjugacy classes 1 1 1 1 4

Copy content comment:Compute statistics about the characters of G
 
Copy content magma:// Outputs [<d_1,c_1>, <d_2,c_2>, ...] where c_i is the number of irr. complex chars. of G with degree d_i CharacterDegrees(G);
 
Copy content gap:# Outputs [[d_1,c_1], [d_2,c_2], ...] where c_i is the number of irr. complex chars. of G with degree d_i CharacterDegrees(G);
 
Copy content sage:# Outputs [[d_1,c_1], [d_2,c_2], ...] where c_i is the number of irr. complex chars. of G with degree d_i character_degrees = [c[0] for c in G.character_table()] [[n, character_degrees.count(n)] for n in set(character_degrees)]
 
Copy content sage_gap:# Outputs [[d_1,c_1], [d_2,c_2], ...] where c_i is the number of irr. complex chars. of G with degree d_i G.CharacterDegrees()
 
Copy content oscar:# Outputs an MSet containing the absolutely irreducible degrees of G and their multiplicities. character_degrees(G)
 

Dimension 1 2
Irr. complex chars.   12 0 12
Irr. rational chars. 4 4 8

Minimal presentations

Permutation degree:$7$
Transitive degree:$12$
Rank: $2$
Inequivalent generating pairs: $4$

Minimal degrees of faithful linear representations

Over $\mathbb{C}$ Over $\mathbb{R}$ Over $\mathbb{Q}$
Irreducible none none none
Arbitrary 2 3 3

Constructions

Show commands: Gap / Magma / Oscar / SageMath


Presentation:Abelian group $\langle a, b \mid a^{2}=b^{6}=1 \rangle$ Copy content Toggle raw display
Copy content comment:Define the group with the given generators and relations
 
Copy content magma:G := PCGroup([3, -2, -2, -3, 16]); a,b := Explode([G.1, G.2]); AssignNames(~G, ["a", "b", "b2"]);
 
Copy content gap:G := PcGroupCode(273,12); a := G.1; b := G.2;
 
Copy content sage:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(273,12)'); a = G.1; b = G.2;
 
Copy content sage_gap:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(273,12)'); a = G.1; b = G.2;
 
Permutation group: $\langle(1,2), (3,4), (5,7,6)\rangle$ Copy content Toggle raw display
Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 7 | (1,2), (3,4), (5,7,6) >;
 
Copy content gap:G := Group( (1,2), (3,4), (5,7,6) );
 
Copy content sage:G = PermutationGroup(['(1,2)', '(3,4)', '(5,7,6)'])
 
Copy content sage_gap:G = gap.new('Group( (1,2), (3,4), (5,7,6) )')
 
Copy content oscar:G = @permutation_group(7, (1,2), (3,4), (5,7,6))
 
Matrix group:$\left\langle \left(\begin{array}{rrr} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & -1 \end{array}\right), \left(\begin{array}{rrr} 0 & -1 & 0 \\ 1 & 1 & 0 \\ 0 & 0 & 1 \end{array}\right) \right\rangle \subseteq \GL_{3}(\Z)$
Copy content comment:Define the group as a matrix group with coefficients in Z
 
Copy content magma:G := MatrixGroup< 3, Integers() | [[1, 0, 0, 0, 1, 0, 0, 0, -1], [0, -1, 0, 1, 1, 0, 0, 0, 1]] >;
 
Copy content gap:G := Group([[[1, 0, 0], [0, 1, 0], [0, 0, -1]], [[0, -1, 0], [1, 1, 0], [0, 0, 1]]]);
 
Copy content sage:MS = MatrixSpace(Integers(), 3, 3) G = MatrixGroup([MS([[1, 0, 0], [0, 1, 0], [0, 0, -1]]), MS([[0, -1, 0], [1, 1, 0], [0, 0, 1]])])
 
Copy content sage_gap:G = gap.new('Group([[[1, 0, 0], [0, 1, 0], [0, 0, -1]], [[0, -1, 0], [1, 1, 0], [0, 0, 1]]])')
 
Copy content oscar:G = matrix_group([matrix(ZZ, [[1, 0, 0], [0, 1, 0], [0, 0, -1]]), matrix(ZZ, [[0, -1, 0], [1, 1, 0], [0, 0, 1]])])
 
$\left\langle \left(\begin{array}{rr} 1 & 0 \\ 0 & 3 \end{array}\right), \left(\begin{array}{rr} 6 & 0 \\ 0 & 6 \end{array}\right) \right\rangle \subseteq \GL_{2}(\F_{7})$
Copy content comment:Define the group as a matrix group with coefficients in GLFp
 
Copy content magma:G := MatrixGroup< 2, GF(7) | [[1, 0, 0, 3], [6, 0, 0, 6]] >;
 
Copy content gap:G := Group([[[ Z(7)^0, 0*Z(7) ], [ 0*Z(7), Z(7) ]], [[ Z(7)^3, 0*Z(7) ], [ 0*Z(7), Z(7)^3 ]]]);
 
Copy content sage:MS = MatrixSpace(GF(7), 2, 2) G = MatrixGroup([MS([[1, 0], [0, 3]]), MS([[6, 0], [0, 6]])])
 
Copy content sage_gap:G = gap.new('Group([[[ Z(7)^0, 0*Z(7) ], [ 0*Z(7), Z(7) ]], [[ Z(7)^3, 0*Z(7) ], [ 0*Z(7), Z(7)^3 ]]])')
 
Copy content oscar:G = matrix_group([matrix(GF(7), [[1, 0], [0, 3]]), matrix(GF(7), [[6, 0], [0, 6]])])
 
Transitive group: 12T2 more information
Copy content magma:G := TransitiveGroup(12, 2);
 
Copy content gap:G := TransitiveGroup(12, 2);
 
Copy content sage:G = TransitiveGroup(12, 2)
 
Copy content sage_gap:G = libgap.TransitiveGroup(12, 2)
 
Copy content oscar:G = transitive_group(12, 2)
 
Direct product: $C_2$ ${}^2$ $\, \times\, $ $C_3$
Semidirect product: not isomorphic to a non-trivial semidirect product
Trans. wreath product: not isomorphic to a non-trivial transitive wreath product
Aut. group: $\Aut(C_{21})$ $\Aut(C_{28})$ $\Aut(C_{36})$ $\Aut(C_{42})$

Elements of the group are displayed as words in the presentation generators from the presentation above.

Homology

Primary decomposition: $C_{2}^{2} \times C_{3}$
Copy content comment:The primary decomposition of the group
 
Copy content magma:PrimaryInvariants(G);
 
Copy content gap:AbelianInvariants(G);
 
Copy content sage_gap:G.AbelianInvariants()
 
Copy content oscar:abelian_invariants(G)
 
Schur multiplier: $C_{2}$
Copy content comment:The Schur multiplier of the group
 
Copy content gap:AbelianInvariantsMultiplier(G);
 
Copy content sage:G.homology(2)
 
Copy content sage_gap:G.AbelianInvariantsMultiplier()
 
Commutator length: $0$
Copy content comment:The commutator length of the group
 
Copy content gap:CommutatorLength(G);
 
Copy content sage_gap:G.CommutatorLength()
 

Subgroups

Copy content comment:List of subgroups of the group
 
Copy content magma:Subgroups(G);
 
Copy content gap:AllSubgroups(G);
 
Copy content sage:G.subgroups()
 
Copy content sage_gap:G.AllSubgroups()
 
Copy content oscar:subgroups(G)
 

There are 10 subgroups, all normal (4 characteristic).

Characteristic subgroups are shown in this color. Normal (but not characteristic) subgroups are shown in this color.

Special subgroups

Center: $Z \simeq$ $C_2\times C_6$ $G/Z \simeq$ $C_1$
Copy content comment:Center of the group
 
Copy content magma:Center(G);
 
Copy content gap:Center(G);
 
Copy content sage:G.center()
 
Copy content sage_gap:G.Center()
 
Copy content oscar:center(G)
 
Commutator: $G' \simeq$ $C_1$ $G/G' \simeq$ $C_2\times C_6$
Copy content comment:Commutator subgroup of the group G
 
Copy content magma:CommutatorSubgroup(G);
 
Copy content gap:DerivedSubgroup(G);
 
Copy content sage:G.commutator()
 
Copy content sage_gap:G.DerivedSubgroup()
 
Copy content oscar:derived_subgroup(G)
 
Frattini: $\Phi \simeq$ $C_1$ $G/\Phi \simeq$ $C_2\times C_6$
Copy content comment:Frattini subgroup of the group G
 
Copy content magma:FrattiniSubgroup(G);
 
Copy content gap:FrattiniSubgroup(G);
 
Copy content sage:G.frattini_subgroup()
 
Copy content sage_gap:G.FrattiniSubgroup()
 
Copy content oscar:frattini_subgroup(G)
 
Fitting: $\operatorname{Fit} \simeq$ $C_2\times C_6$ $G/\operatorname{Fit} \simeq$ $C_1$
Copy content comment:Fitting subgroup of the group G
 
Copy content magma:FittingSubgroup(G);
 
Copy content gap:FittingSubgroup(G);
 
Copy content sage:G.fitting_subgroup()
 
Copy content sage_gap:G.FittingSubgroup()
 
Copy content oscar:fitting_subgroup(G)
 
Radical: $R \simeq$ $C_2\times C_6$ $G/R \simeq$ $C_1$
Copy content comment:Radical of the group G
 
Copy content magma:Radical(G);
 
Copy content gap:SolvableRadical(G);
 
Copy content sage_gap:G.SolvableRadical()
 
Copy content oscar:solvable_radical(G)
 
Socle: $\operatorname{soc} \simeq$ $C_2\times C_6$ $G/\operatorname{soc} \simeq$ $C_1$
Copy content comment:Socle of the group G
 
Copy content magma:Socle(G);
 
Copy content gap:Socle(G);
 
Copy content sage:G.socle()
 
Copy content sage_gap:G.Socle()
 
Copy content oscar:socle(G)
 
2-Sylow subgroup: $P_{ 2 } \simeq$ $C_2^2$
3-Sylow subgroup: $P_{ 3 } \simeq$ $C_3$

Subgroup diagram and profile

For the default diagram, subgroups are sorted vertically by the number of prime divisors (counted with multiplicity) in their orders.
To see subgroups sorted vertically by order instead, check this box.
Sorry, your browser does not support the subgroup diagram.

Subgroup information

Click on a subgroup in the diagram to see information about it.
See a full page version of the diagram
See a full page version of the diagram
See a full page version of the diagram
See a full page version of the diagram

Series

Derived series $C_2\times C_6$ $\rhd$ $C_1$
Copy content comment:Derived series of the group G
 
Copy content magma:DerivedSeries(G);
 
Copy content gap:DerivedSeriesOfGroup(G);
 
Copy content sage:G.derived_series()
 
Copy content sage_gap:G.DerivedSeriesOfGroup()
 
Copy content oscar:derived_series(G)
 
Chief series $C_2\times C_6$ $\rhd$ $C_6$ $\rhd$ $C_3$ $\rhd$ $C_1$
Copy content comment:Chief series of the group G
 
Copy content magma:ChiefSeries(G);
 
Copy content gap:ChiefSeries(G);
 
Copy content sage:libgap(G).ChiefSeries()
 
Copy content sage_gap:G.ChiefSeries()
 
Copy content oscar:chief_series(G)
 
Lower central series $C_2\times C_6$ $\rhd$ $C_1$
Copy content comment:The lower central series of the group G
 
Copy content magma:LowerCentralSeries(G);
 
Copy content gap:LowerCentralSeriesOfGroup(G);
 
Copy content sage:G.lower_central_series()
 
Copy content sage_gap:G.LowerCentralSeriesOfGroup()
 
Copy content oscar:lower_central_series(G)
 
Upper central series $C_1$ $\lhd$ $C_2\times C_6$
Copy content comment:The upper central series of the group G
 
Copy content magma:UpperCentralSeries(G);
 
Copy content gap:UpperCentralSeriesOfGroup(G);
 
Copy content sage:G.upper_central_series()
 
Copy content sage_gap:G.UpperCentralSeriesOfGroup()
 
Copy content oscar:upper_central_series(G)
 

Supergroups

This group is a maximal subgroup of 180 larger groups in the database.

This group is a maximal quotient of 205 larger groups in the database.

Character theory

Copy content comment:Character table
 
Copy content magma:CharacterTable(G); // Output not guaranteed to exactly match the LMFDB table
 
Copy content gap:CharacterTable(G); # Output not guaranteed to exactly match the LMFDB table
 
Copy content sage:G.character_table() # Output not guaranteed to exactly match the LMFDB table
 
Copy content sage_gap:G.CharacterTable() # Output not guaranteed to exactly match the LMFDB table
 
Copy content oscar:character_table(G) # Output not guaranteed to exactly match the LMFDB table
 

Complex character table

1A 2A 2B 2C 3A1 3A-1 6A1 6A-1 6B1 6B-1 6C1 6C-1
Size 1 1 1 1 1 1 1 1 1 1 1 1
2 P 1A 1A 1A 1A 3A-1 3A1 3A1 3A-1 3A-1 3A1 3A1 3A-1
3 P 1A 2A 2B 2C 1A 1A 2A 2A 2B 2B 2C 2C
Type
12.5.1a R 1 1 1 1 1 1 1 1 1 1 1 1
12.5.1b R 1 −1 −1 1 1 1 −1 −1 −1 −1 1 1
12.5.1c R 1 −1 1 −1 1 1 −1 −1 1 1 −1 −1
12.5.1d R 1 1 −1 −1 1 1 1 1 −1 −1 −1 −1
12.5.1e1 C 1 1 1 1 ζ3−1 ζ3 ζ3 ζ3−1 ζ3−1 ζ3 ζ3 ζ3−1
12.5.1e2 C 1 1 1 1 ζ3 ζ3−1 ζ3−1 ζ3 ζ3 ζ3−1 ζ3−1 ζ3
12.5.1f1 C 1 −1 −1 1 ζ3−1 ζ3 −ζ3 −ζ3−1 −ζ3−1 −ζ3 ζ3 ζ3−1
12.5.1f2 C 1 −1 −1 1 ζ3 ζ3−1 −ζ3−1 −ζ3 −ζ3 −ζ3−1 ζ3−1 ζ3
12.5.1g1 C 1 −1 1 −1 ζ3−1 ζ3 −ζ3 −ζ3−1 ζ3−1 ζ3 −ζ3 −ζ3−1
12.5.1g2 C 1 −1 1 −1 ζ3 ζ3−1 −ζ3−1 −ζ3 ζ3 ζ3−1 −ζ3−1 −ζ3
12.5.1h1 C 1 1 −1 −1 ζ3−1 ζ3 ζ3 ζ3−1 −ζ3−1 −ζ3 −ζ3 −ζ3−1
12.5.1h2 C 1 1 −1 −1 ζ3 ζ3−1 ζ3−1 ζ3 −ζ3 −ζ3−1 −ζ3−1 −ζ3

Rational character table

1A 2A 2B 2C 3A 6A 6B 6C
Size 1 1 1 1 2 2 2 2
2 P 1A 1A 1A 1A 3A 3A 3A 3A
3 P 1A 2A 2B 2C 1A 2A 2B 2C
12.5.1a 1 1 1 1 1 1 1 1
12.5.1b 1 −1 −1 1 1 −1 −1 1
12.5.1c 1 −1 1 −1 1 −1 1 −1
12.5.1d 1 1 −1 −1 1 1 −1 −1
12.5.1e 2 2 2 2 −1 −1 −1 −1
12.5.1f 2 −2 −2 2 −1 1 1 −1
12.5.1g 2 −2 2 −2 −1 1 −1 1
12.5.1h 2 2 −2 −2 −1 −1 1 1