↑

Properties

Label 6T2
6T2 1 3 1->3 4 1->4 2 2->3 2->4 5 3->5 6 4->6 5->1 5->6 6->2
Degree $6$
Order $6$
Cyclic no
Abelian no
Solvable yes
Primitive no
$p$-group no
Group: $S_3$

Related objects

Downloads

Learn more

Show commands: Magma / Oscar / SageMath

Copy content comment:Define the Galois group
 
Copy content magma:G := TransitiveGroup(6, 2);
 
Copy content sage:G = TransitiveGroup(6, 2)
 
Copy content oscar:G = transitive_group(6, 2)
 

Group invariants

Abstract group:  $S_3$
Copy content comment:Abstract group ID
 
Copy content magma:IdentifyGroup(G);
 
Copy content sage:G.id()
 
Order:  $6=2 \cdot 3$
Copy content comment:Order
 
Copy content magma:Order(G);
 
Copy content sage:G.order()
 
Copy content oscar:order(G)
 
Cyclic:  no
Copy content comment:Determine if group is cyclic
 
Copy content magma:IsCyclic(G);
 
Copy content sage:G.is_cyclic()
 
Copy content oscar:is_cyclic(G)
 
Abelian:  no
Copy content comment:Determine if group is abelian
 
Copy content magma:IsAbelian(G);
 
Copy content sage:G.is_abelian()
 
Copy content oscar:is_abelian(G)
 
Solvable:  yes
Copy content comment:Determine if group is solvable
 
Copy content magma:IsSolvable(G);
 
Copy content sage:G.is_solvable()
 
Copy content oscar:is_solvable(G)
 
Nilpotency class:   not nilpotent
Copy content comment:Nilpotency class
 
Copy content magma:NilpotencyClass(G);
 
Copy content sage:libgap(G).NilpotencyClassOfGroup() if G.is_nilpotent() else -1
 
Copy content oscar:if is_nilpotent(G) nilpotency_class(G) end
 

Group action invariants

Degree $n$:  $6$
Copy content comment:Degree
 
Copy content magma:t, n := TransitiveGroupIdentification(G); n;
 
Copy content sage:G.degree()
 
Copy content oscar:degree(G)
 
Transitive number $t$:  $2$
Copy content comment:Transitive number
 
Copy content magma:t, n := TransitiveGroupIdentification(G); t;
 
Copy content sage:G.transitive_number()
 
Copy content oscar:transitive_group_identification(G)[2]
 
CHM label:   $D_{6}(6) = [3]2$
Parity:  $-1$
Copy content comment:Parity
 
Copy content magma:IsEven(G);
 
Copy content sage:all(g.SignPerm() == 1 for g in libgap(G).GeneratorsOfGroup())
 
Copy content oscar:is_even(G)
 
Primitive:  no
Copy content comment:Determine if group is primitive
 
Copy content magma:IsPrimitive(G);
 
Copy content sage:G.is_primitive()
 
Copy content oscar:is_primitive(G)
 
$\card{\Aut(F/K)}$:  $6$
Copy content comment:Order of the centralizer of G in S_n
 
Copy content magma:Order(Centralizer(SymmetricGroup(n), G));
 
Copy content sage:SymmetricGroup(6).centralizer(G).order()
 
Copy content oscar:order(centralizer(symmetric_group(6), G)[1])
 
Generators:  $(1,3,5)(2,4,6)$, $(1,4)(2,3)(5,6)$
Copy content comment:Generators
 
Copy content magma:Generators(G);
 
Copy content sage:G.gens()
 
Copy content oscar:gens(G)
 

Low degree resolvents

$\card{(G/N)}$Galois groups for stem field(s)
$2$:  $C_2$

Resolvents shown for degrees $\leq 47$

Subfields

Degree 2: $C_2$

Degree 3: $S_3$

Low degree siblings

3T2

Siblings are shown with degree $\leq 47$

A number field with this Galois group has no arithmetically equivalent fields.

Conjugacy classes

LabelCycle TypeSizeOrderIndexRepresentative
1A $1^{6}$ $1$ $1$ $0$ $()$
2A $2^{3}$ $3$ $2$ $3$ $(1,2)(3,6)(4,5)$
3A $3^{2}$ $2$ $3$ $4$ $(1,3,5)(2,4,6)$

Malle's constant $a(G)$:     $1/3$

Copy content comment:Conjugacy classes
 
Copy content magma:ConjugacyClasses(G);
 
Copy content sage:G.conjugacy_classes()
 
Copy content oscar:conjugacy_classes(G)
 

Character table

1A 2A 3A
Size 1 3 2
2 P 1A 1A 3A
3 P 1A 2A 1A
Type
6.1.1a R 1 1 1
6.1.1b R 1 −1 1
6.1.2a R 2 0 −1

Copy content comment:Character table
 
Copy content magma:CharacterTable(G);
 
Copy content sage:G.character_table()
 
Copy content oscar:character_table(G)
 

Indecomposable integral representations

Complete list of indecomposable integral representations:

Name Dim $(1,3,5)(2,4,6) \mapsto $ $(1,2)(3,6)(4,5) \mapsto $
Triv $1$ $\left(\begin{array}{r}1\end{array}\right)$ $\left(\begin{array}{r}1\end{array}\right)$
Sign $1$ $\left(\begin{array}{r}1\end{array}\right)$ $\left(\begin{array}{r}-1\end{array}\right)$
$L$ $2$ $\left(\begin{array}{rr}1 & 0\\0 & 1\end{array}\right)$ $\left(\begin{array}{rr}0 & 1\\1 & 0\end{array}\right)$
$A$ $2$ $\left(\begin{array}{rr}0 & 1\\-1 & -1\end{array}\right)$ $\left(\begin{array}{rr}1 & 0\\-1 & -1\end{array}\right)$
$A'$ $2$ $\left(\begin{array}{rr}0 & 1\\-1 & -1\end{array}\right)$ $\left(\begin{array}{rr}-1 & 0\\1 & 1\end{array}\right)$
$(A,\textrm{Sign})$ $3$ $\left(\begin{array}{rrr}0 & 1 & 0\\-1 & -1 & 0\\1 & 0 & 1\end{array}\right)$ $\left(\begin{array}{rrr}1 & 0 & 0\\-1 & -1 & 0\\-1 & 0 & -1\end{array}\right)$
$(A',\textrm{Triv})$ $3$ $\left(\begin{array}{rrr}0 & 1 & 0\\-1 & -1 & 0\\1 & 0 & 1\end{array}\right)$ $\left(\begin{array}{rrr}-1 & 0 & 0\\1 & 1 & 0\\1 & 0 & 1\end{array}\right)$
$(A,L)$ $4$ $\left(\begin{array}{rrrr}0 & 1 & 0 & 0\\-1 & -1 & 0 & 0\\-1 & 0 & 1 & 0\\1 & 0 & 0 & 1\end{array}\right)$ $\left(\begin{array}{rrrr}1 & 0 & 0 & 0\\-1 & -1 & 0 & 0\\1 & 0 & 0 & 1\\-1 & 0 & 1 & 0\end{array}\right)$
$(A',L)$ $4$ $\left(\begin{array}{rrrr}0 & 1 & 0 & 0\\-1 & -1 & 0 & 0\\1 & 0 & 1 & 0\\1 & 0 & 0 & 1\end{array}\right)$ $\left(\begin{array}{rrrr}-1 & 0 & 0 & 0\\1 & 1 & 0 & 0\\1 & 0 & 0 & 1\\1 & 0 & 1 & 0\end{array}\right)$
$(A+A',L)$ $6$ $\left(\begin{array}{rrrrrr}0 & 0 & 1 & 0 & 0 & 0\\0 & 0 & 0 & 1 & 0 & 0\\0 & 0 & 0 & 0 & 1 & 0\\0 & 0 & 0 & 0 & 0 & 1\\1 & 0 & 0 & 0 & 0 & 0\\0 & 1 & 0 & 0 & 0 & 0\end{array}\right)$ $\left(\begin{array}{rrrrrr}0 & 0 & 0 & 1 & 0 & 0\\0 & 0 & 1 & 0 & 0 & 0\\0 & 1 & 0 & 0 & 0 & 0\\1 & 0 & 0 & 0 & 0 & 0\\0 & 0 & 0 & 0 & 0 & 1\\0 & 0 & 0 & 0 & 1 & 0\end{array}\right)$
The decomposition of an arbitrary integral representation as a direct sum of indecomposables is not unique, in general. It is unique up to the following isomorphisms:
Triv $\oplus$ $(A',L)$ $\cong$ $L$ $\oplus$ $(A',\textrm{Triv})$
Sign $\oplus$ $(A,L)$ $\cong$ $L$ $\oplus$ $(A,\textrm{Sign})$
Triv $\oplus$ $(A+A',L)$ $\cong$ $(A,L)$ $\oplus$ $(A',L)$

Regular extensions

$f_{ 1 } =$ $x^{6} - t x^{4} + \left(2 t + 45\right) x^{2} + \left(-t + 18\right)$ Copy content Toggle raw display