Directory

Encyclopedia

NodeWorks
                              ENCYCLOPEDIA

Link Checker

Home
Encyclopedia : F : FR : FRO :

Frobenius group

 

Frobenius group

In mathematics, a Frobenius group is a transitive permutation group on a finite set, such that no non-trivial element
fixes more than one point and some non-trivial element fixes a point.
They are named after F. G. Frobenius.

Examples

  • The smallest example is the symmetric group on 3 points, with 6 elements. The Frobenius kernel (defined below) K has order 3, and the complement (also defined below) H has order 2.

    • For every finite field Fq with q (>2) elements, the group of invertible affine transformations , with its natural action on Fq is a Frobenius group. The preceding example corresponds to the case F3, the field with three elements.

    • More generally, the group of upper 2 × 2 invertible triangular matrices of determinant 1 over any finite field of order at least 3 is a Frobenius group. The Frobenius kernel is the subgroup of strictly upper triangular matrices (with diagonal elements equal to 1), and the complement is the subgroup of diagonal matrices.

    • The dihedral group of order 2n with n odd is a Frobenius group with complement of order 2. More generally if K is any abelian group of odd order and H has order 2 and acts on K by inversion, then the semidirect product K.H is a Frobenius group.

    • Many further examples can be generated by the following constructions. If we replace the Frobenius kernel of a Frobenius group by a non-trivial subgroup we get another Frobenius group. If we have two Frobenius groups K1.H and K2.H then (K1 × K2).H is also a Frobenius group.

    • If K is the extraspecial group of order 73 with exponent 7, and H is the cyclic group of order 3, then there is a Frobenius group G that is an extension K.H of H by K. This gives an example of a Frobenius group with non-abelian kernel.

    • If H is the group SL2(F5) of order 120, it acts fix point-freely on a 2-dimensional vector space K over the field with 11 elements. The extension K.H is the smallest example of a non-solvable Frobenius group.

    • The subgroup of a Zassenhaus group fixing a point is a Frobenius group.

      Structure


      The subgroup H of a Frobenius group G fixing a point of the set X is called the Frobenius complement. The identity element together with all elements not in any conjugate of H form a normal subgroup called the Frobenius kernel K. (This is a theorem due to Frobenius.) The Frobenius group G is the semidirect product of K and H.

    Both the Frobenius kernel and the Frobenius complement have very restricted structures. J. G. Thompson proved that the Frobenius kernel K is a nilpotent group. If H has even order then K is abelian. The Frobenius complement H has the property that every subgroup whose order is the product of 2 primes is cyclic; this implies that its Sylow subgroups are cyclic or generalized quaternion groups. Any group such that all Sylow subgroups are cyclic is metacyclic: this means it is the extension of two cyclic groups. If a Frobenius complement H has a generalized quaternion subgroup then Zassenhaus showed that it
    has a normal subgroup of index 1 or 2 that is the product of SL2(5) and a metacyclic group of order coprime to 30.

    The Frobenius kernel K is uniquely determined by G as it is the Fitting subgroup, and the Frobenius complement is uniquely determined up to conjugacy by the Schur-Zassenhaus theorem. In particular a finite group G is a Frobenius group in at most one way.

    Representation theory


    The irreducible complex representations of a Frobenius group G can be read off from those of H and K. There are two types of irreducible representations of G:
  • Any irreducible representation R of H gives an irreducible representation of G using the quotient map from G to H (that is, as a restricted representation). These give the irreducible representations of G with K in their kernel.
  • If S is any non-trivial irreducible representation of K, then the corresponding induced representation of G is also irreducible. These give the irreducible representations of G with K not in their kernel.


  • NodeWorks boosts web surfing!
    Page Returned in 3.862 seconds - HTML Compressed 69.9%

    This article is from Wikipedia. All text is available
    under the terms of the GNU Free Documentation License.
     GNU Free Documentation License
    © 2008 Chamas Enterprises Inc.