The Möbius group is the group of all Möbius transformations of the Riemann sphere, under function composition. An invertible complex matrix represents , and nonzero scalar multiples represent the same transformation. Rescaling a representative to determinant one gives a surjective group homomorphism with kernel of a group homomorphism . Thus it is also the projective linear group and the quotient .
For ordered triples of distinct points of the Riemann sphere, a unique Möbius transformation sends the first triple to the second. Normalize each triple to using , with the usual limits at infinity, and compose . Any two choices differ by a Möbius transformation fixing those three standard points. Fixing infinity makes it affine; fixing zero and one then makes it the identity. Thus the Möbius group action is sharply three-transitive, a stronger property than mere transitivity on triples.
For two distinct points of the Riemann sphere, conjugate by a Möbius transformation sending them to zero and infinity. A transformation fixing those two points has the form , . Composition multiplies the parameter, so the pointwise stabilizer is isomorphic to the complex multiplicative group. For zero and one, conjugation by gives .
The Möbius transformations preserving a three-point set act faithfully on it: one fixing all three is the identity. Every permutation is realized because a Möbius transformation can send any ordered distinct triple to any other, by composing the two normalizations to . For that normalized set the six maps are , , , , and . Thus its setwise stabilizer is the symmetric group . Normalizing any other three-point set conjugates its stabilizer to this group.
The Möbius transformations generated by with and have exactly the two displayed forms. The relations and reduce every word to , . This is a semidirect product of with a cyclic group of order two acting by multiplicative inversion. It preserves the unordered pair , and only its scaling elements fix zero.
A finite abelian subgroup of the Möbius group is cyclic or isomorphic to . If it contains an element of order greater than two, conjugate that element's two fixed points to . Every commuting map must preserve these points individually: an interchange would conjugate the element to its inverse. All maps are then scalings, forming a cyclic finite subgroup of . If every nonidentity element has order two, choose one with fixed points ; the subgroup acts on this pair with image of size at most two and kernel contained in . Its size is therefore at most four, giving the asserted possibilities.

Ancestors (6)

  1. Projective linear group
  2. Group theory
  3. Algebra
  4. Area of mathematics
  5. Mathematics
  6. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.