From Polytope Wiki
Jump to navigation Jump to search

A group is a mathematical structure that abstracts the behavior of symmetries acting on an object. It consists of a set with a given binary operation on it satisfying certain axioms.

Groups are extremely useful throughout mathematics, and are central to the theory of polytopes. Lots of research on polytopes has been devoted to studying their most symmetric classes, including regular and uniform polytopes. The ways in which these are symmetric may be described with groups, including symmetry groups and automorphism groups.

Definition[edit | edit source]

A group is a set together with a binary operation (that is, the operation is closed) such that:

  • For any , . (Associativity)
  • There exists such that for any . (Identity element)
  • For any there exists such that . (Inverse elements)

The identity element may alternatively be notated as . If the operation is thought of as some form of addition, the identity element may be notated as , and the inverse of may be notated as .

Examples[edit | edit source]

The following are examples of groups.

  • The integers form a group under addition. The identity element is and any number has an inverse .
  • The symmetries of an equilateral triangle form a group under composition, i.e. applying one symmetry after the other. The composition of any two symmetries gives another symmetry. The identity element is the trivial symmetry (the “do-nothing” symmetry), and every symmetry has an inverse symmetry that reverts it (e.g. 120° clockwise rotation is reverted by 120° counterclockwise rotation). This symmetry group is called A2.
  • The automorphisms of a triangle also form a group under composition. As it turns out, this group has exactly the same structure as A2 – they are isomorphic.

Equivalence between groups[edit | edit source]

Very rarely is exact equality between groups a useful notion. A much more useful notion is that of an isomorphism. Two groups and are said to be isomorphic whenever there exists a bijective function such that

for any .

However, when dealing with symmetry groups, this can be too loose of a notion. For instance, the symmetry group H3 of the icosahedron and the symmetry group A4+ of the pentachoron are isomorphic, yet clearly deserve to be distinguished. We instead classify symmetry groups up to conjugacy. Two symmetry groups and in the same space are said to be conjugate whenever there exists some invertible isometry such that


That is to say, one group is the same as the other "moved around".

Subgroups[edit | edit source]

A subgroup of is any group for . Note that must send pairs of elements of to elements of for this to make sense. By Lagrange's theorem, whenever is finite, the order (number of elements) of must divide that of .

External links[edit | edit source]