3-transposition group


In mathematical group theory, a 3-transposition group is a group generated by a conjugacy class of involutions, called the 3-transpositions, such that the product of any two involutions from the conjugacy class has order at most 3.
They were first studied by who discovered the three Fischer groups as examples of 3-transposition groups.

History

first studied 3-transposition groups in the special case when the product of any two distinct 3-transpositions has order 3. He showed that a finite group with this property is solvable, and has a 3-group of index 2. used these groups to construct examples of non-abelian CH-quasigroups and to describe the structure of commutative Moufang loops of exponent 3.

Fischer's theorem

Suppose that G is a group that is generated by a conjugacy class D of 3-transpositions and such that the 2 and 3 cores O2 and O3 are both contained in the center Z of G. Then proved that up to isomorphism G/Z is one of the following groups and D is the image of the given conjugacy class:
The missing cases with n small above either do not satisfy the condition about 2 and 3 cores or have exceptional isomorphisms to other groups on the list.

Important examples

The group Sn has order n! and for n>1 has a subgroup An of index 2 that is simple if n>4.
The symmetric group Sn is a 3-transposition group for all n>1. The 3-transpositions are the elements that exchange two points, and leaving each of the remaining points fixed. These elements are the transpositions of Sn.
The symplectic group Sp2n has order
It is a 3-transposition group for all n≥1. It is simple if n>2, while for n=1 it is S3, and for n=2 it is S6 with a simple subgroup of index 2, namely A6. The 3-transpositions are of the form x↦x+v for non-zero v.
The special unitary group SUn has order
The projective special unitary group PSUn is the quotient of the special unitary group SUn by the subgroup M of all the scalar linear transformations in SUn. The subgroup M is the center of SUn. Also, M has order gcd.
The group PSUn is simple if n>3, while for n=2 it is S3 and for n=3 it has the structure 32:Q8.
Both SUn and PSUn are 3-transposition groups for n=2 and for all n≥4. The 3-transpositions of SUn for n=2 or n≥4 are of the form x↦x+v for non-zero vectors v of zero norm. The 3-transpositions of PSUn for n=2 or n≥4 are the images of the 3-transpositions of SUn under the natural quotient map from SUn to PSUn=SUn/M.
The orthogonal group O2n± has order
It has an index 2 subgroup, which is simple if n>2.
The group O2nμ is a 3-transposition group for all n>2 and μ=±1. The 3-transpositions are of the form x↦x+v for vectors v such that Q=1, where Q is the underlying quadratic form for the orthogonal group.
The orthogonal groups On± are the automorphism groups of quadratic forms Q over the field of 3 elements such that the discriminant of the bilinear form =Q−Q−Q is ±1. The group Onμ,σ, where μ and σ are signs, is the subgroup of Onμ generated by reflections with respect to vectors v with Q=+1 if σ is +, and is the subgroup of Onμ generated by reflections with respect to vectors v with Q=-1 if σ is −.
For μ=±1 and σ=±1, let POnμ,σ=Onμ,σ/Z, where Z is the group of all scalar linear transformations in Onμ,σ. If n>3, then Z is the center of Onμ,σ.
For μ=±1, let Ωnμ be the derived subgroup of Onμ. Let PΩnμ= Ωnμ/X, where X is the group of all scalar linear transformations in Ωnμ. If n>2, then X is the center of Ωnμ.
If n=2m+1 is odd the two orthogonal groups On± are isomorphic and have order
and On+,+ ≅ On−,−, and On−,+ ≅ On+,−, because the two quadratic forms are scalar multiples of each other, up to linear equivalence.
If n=2m is even the two orthogonal groups On± have orders
and On+,+ ≅ On+,−, and On−,+ ≅ On−,−, because the two classes of transpositions are exchanged by an element of the general orthogonal group that multiplies the quadratic form by a scalar. If n=2m, m>1 and m is even, then the centre of On+,+ ≅ On+,− has order 2, and the centre of On−,+ ≅ On−,− has order 1. If n=2m, m>2 and m is odd, then the centre of On+,+ ≅ On+,− has order 1, and the centre of On−,+ ≅ On−,− has order 2.
If n>3, and μ=±1 and σ=±1, the group Onμ,σ is a 3-transposition group. The 3-transpositions of the group Onμ,σ are of the form x↦x−v/Q=x+/ for vectors v with Q=σ, where Q is the underlying quadratic form of Onμ.
If n>4, and μ=±1 and σ=±1, then Onμ,σ has index 2 in the orthogonal group Onμ. The group Onμ,σ has a subgroup of index 2, namely Ωnμ, which is simple modulo their centers. In other words, PΩnμ is simple.
If n>4 is odd, and = or, then Onμ,+ and POnμ,+ are both isomorphic to SOnμ=Ωnμ:2, where SOnμ is the special orthogonal group of the underlying quadratic form Q. Also, Ωnμ is isomorphic to PΩnμ, and is also non-abelian and simple.
If n>4 is odd, and = or, then Onμ,+ is isomorphic to Ωnμ×2, and Onμ,+ is isomorphic to Ωnμ. Also, Ωnμ is isomorphic to PΩnμ, and is also non-abelian and simple.
If n>5 is even, and μ=±1 and σ=±1, then Onμ,+ has the form Ωnμ:2, and POnμ,+ has the form PΩnμ:2. Also, PΩnμ is non-abelian and simple.
Fi22 has order 217.39.52.7.11.13 = 64561751654400 and is simple.
Fi23 has order 218.313.52.7.11.13.17.23 = 4089470473293004800 and is simple.
Fi24 has order 222.316.52.73.11.13.17.23.29
and has a simple subgroup of index 2, namely Fi24'.

Isomorphisms and solvable cases

There are numerous degenerate cases and isomorphisms between 3-transposition groups of small degree as follows :

Solvable groups

The following groups do not appear in the conclusion of Fisher's theorem as they are solvable.

Isomorphisms

There are several further isomorphisms involving groups in the conclusion of Fischer's theorem as follows. This list also identifies the Weyl groups of ADE Dynkin diagrams, which are all 3-transposition groups except W=22, with groups on Fischer's list.

Proof

The idea of the proof is as follows. Suppose that D is the class of 3-transpositions in G, and d∈D, and let H be the subgroup generated by the set Dd of elements of D commuting with d. Then Dd is a set of 3-transpositions of H, so the 3-transposition groups can be classified by induction on the order by finding all possibilities for G given any 3-transposition group H. For simplicity assume that the derived group of G is perfect
It is fruitful to treat 3-transpositions as vertices of a graph. Join the pairs that do not commute, i. e. have a product of order 3. The graph is connected unless the group has a direct product decomposition. The graphs corresponding to the smallest symmetric groups are familiar graphs. The 3 transpositions of S3 form a triangle. The 6 transpositions of S4 form an octahedron. The 10 transpositions of S5 form the complement of the Petersen graph.
The symmetric group Sn can be generated by n–1 transpositions:,,..., and the graph of this generating set is a straight line. It embodies sufficient relations to define the group Sn.