Notes on Complex Analysis
Export PDFGitHub

§4.4.2 The Group of Meromorphic Automorphisms on ℂ̂

4.4.2 The Group of Meromorphic Automorphisms on ℂ̂

It is generally common to consider a meromorphic function as a function in the form of 𝑓:𝑈→ℂ̂. Let Aut(ℂ̂) denote the group of meromorphic automorphisms on ℂ̂.

To make more profound conclusions on the structure of Aut(ℂ̂), we will introduce certain concepts from group theory.

Definition 4.4.2.1 (Coset).

Let 𝐺 be a group, and let 𝐻≤𝐺 be a subgroup (operation denoted by juxtaposition). Then the left coset of 𝐻 in 𝐺 with respect to 𝑔∈𝐺 is defined as

𝑔𝐻={𝑔ℎ:ℎ∈𝐻}.

The right coset is defined as

𝐻𝑔={ℎ𝑔:ℎ∈𝐻}.
The subgroup 𝐻 is normal iff the left and right cosets are equal. The notation 𝐻⊴𝐺 is used to represent a normal subgroup. Cosets, like groups and sets, are unordered.

Theorem 4.4.2.2.

Let 𝐺 be a group and 𝑁≤𝐺 a subgroup. The set of left cosets

𝐺/𝑁={𝑔𝑁:𝑔∈𝐺}

admits a group structure with operation

(𝑔𝑁)(ℎ𝑁)=(𝑔ℎ)𝑁
if and only if 𝑁 is a normal subgroup of 𝐺 (i.e. 𝑁⊴𝐺).
Proof.

We prove the two implications separately.

  1. If 𝑁⊴𝐺 then 𝐺/𝑁 is a group.

    Assume 𝑁 is normal, 𝑁⊴𝐺, so 𝑔𝑁𝑔−1=𝑁 for every 𝑔∈𝐺 (equivalently 𝑔−1𝑁𝑔=𝑁). Define a product on 𝐺/𝑁 by

    (𝑔𝑁)(ℎ𝑁)=(𝑔ℎ)𝑁.

    We now verify that this product is well-defined: if 𝑔𝑁=𝑔′𝑁 and ℎ𝑁=ℎ′𝑁 then we need (𝑔ℎ)𝑁=(𝑔′ℎ′)𝑁. Since 𝑔𝑁=𝑔′𝑁, there exists 𝑛1∈𝑁 with 𝑔′=𝑔𝑛1, and since ℎ𝑁=ℎ′𝑁 there exists 𝑛2∈𝑁 with ℎ′=ℎ𝑛2. Then

    𝑔′ℎ′=(𝑔𝑛1)(ℎ𝑛2)=𝑔(𝑛1ℎ)𝑛2=𝑔ℎ(ℎ−1𝑛1ℎ)𝑛2.

    Because 𝑁 is normal we have ℎ−1𝑛1ℎ∈𝑁, and 𝑛2∈𝑁, so (ℎ−1𝑛1ℎ)𝑛2∈𝑁. Hence 𝑔′ℎ′∈(𝑔ℎ)𝑁, meaning that (𝑔′ℎ′)𝑁=(𝑔ℎ)𝑁. Thus the product is well-defined.

    Associativity follows from associativity in 𝐺:

    ((𝑔𝑁)(ℎ𝑁))(𝑘𝑁)=(𝑔ℎ𝑘)𝑁=(𝑔𝑁)((ℎ𝑁)(𝑘𝑁)).

    The identity is 𝑒𝑁=𝑁, since (𝑒𝑁)(𝑔𝑁)=(𝑒𝑔)𝑁=𝑔𝑁 and similarly on the other side. The inverse of 𝑔𝑁 is 𝑔−1𝑁, because (𝑔𝑁)(𝑔−1𝑁)=(𝑔𝑔−1)𝑁=𝑁. Thus 𝐺/𝑁 is a group.

  2. If 𝐺/𝑁 can be given a group structure via the coset multiplication, then 𝑁⊴𝐺.

    Fix 𝑔∈𝐺 and 𝑛∈𝑁 arbitrarily. By assumption, we have

    (𝑔𝑁)(𝑛𝑁)(𝑔−1𝑁)=(𝑔𝑛𝑔−1)𝑁.

    Because 𝑛𝑁=𝑒𝑁, we also have

    (𝑔𝑁)(𝑛𝑁)(𝑔−1𝑁)=(𝑔𝑁)(𝑒𝑁)(𝑔−1𝑁)=(𝑔𝑔−1)𝑁=𝑁,

    implying that (𝑔𝑛𝑔−1)𝑁=𝑁, and hence 𝑔𝑛𝑔−1∈𝑁 for any 𝑔∈𝐺, 𝑛∈𝑁. Hence, 𝑔𝑁𝑔−1⊆𝑁. Now replacing 𝑔 with 𝑔−1 and rearranging yields 𝑛∈𝑔𝑁𝑔−1, or that 𝑁⊆𝑔𝑁𝑔−1. Therefore, 𝑁 is normal.

⁠□

Under the normality of 𝑁, the group 𝐺/𝑁 is known as the quotient group of 𝐺 by 𝑁.

Remark.

Every subgroup of an abelian group is normal.

Definition 4.4.2.3 (Group Homomorphism).

Let (𝐺,⋅) and (𝐻,∗) be groups. A function 𝜑:𝐺→𝐻 is said to be a group homomorphism if

𝜑(𝑔1⋅𝑔2)=𝜑(𝑔1)∗𝜑(𝑔2)∀𝑔1,𝑔2∈𝐺.

Definition 4.4.2.4 (Group Isomorphism).

A group homomorphism 𝜑:𝐺→𝐻 is called an isomorphism if it is bijective.

If there exists an isomorphism between two groups 𝐺 and 𝐻, they are said to be isomorphic, denoted by 𝐺≅𝐻. The utility of groups allows us to classify them according to their structure: if two groups are isomorphic, they are essentially the same from a group-theoretic perspective. This viewpoint lets us replace complicated groups with simpler, isomorphic ones, and study their properties without loss of generality.

Let us now examine Aut(ℂ̂). Let 𝑓(𝑧)∈Aut(ℂ̂) such that 𝑓(∞)=∞. It follows that 𝑓 maps ℂ to ℂ bijectively and 𝑓∈Aut(ℂ)<Aut(ℂ̂). Therefore, 𝑓(𝑧) has the form 𝑎𝑧+𝑏, where 𝑎∈ℂ∗=ℂ∖{0} and 𝑏∈ℂ are constants.

Let 𝑓(𝑧)∈Aut(ℂ̂) such that 𝑓(∞)≠∞. Then,

𝑔(𝑧)=1𝑓(𝑧)−𝑓(∞)

is in Aut(ℂ̂) and 𝑔(∞)=∞. By the property above, 𝑔(𝑧)=𝑐𝑧+𝑑 for some complex 𝑑 and nonzero 𝑐. Hence,

𝑓(𝑧)=𝑓(∞)(𝑐𝑧+𝑑)+1𝑐𝑧+𝑑.

Let 𝑎=𝑐𝑓(∞) and 𝑏=𝑑𝑓(∞)+1. Then

𝑓(𝑧)=𝑎𝑧+𝑏𝑐𝑧+𝑑.

In this specific construction, 𝑎𝑑−𝑏𝑐=−𝑐≠0. Let the matrix (𝑎𝑏𝑐𝑑) correspond to this transformation, where for any nonzero scalar 𝑘, 𝑘(𝑎𝑏𝑐𝑑) corresponds to (𝑎𝑏𝑐𝑑). Therefore, we can arbitrarily pick 𝑎𝑑−𝑏𝑐 to be 1.

Therefore, there exists a one-to-one correspondence between Aut(ℂ̂) and the group under matrix multiplication of

{(𝑎𝑏𝑐𝑑):det((𝑎𝑏𝑐𝑑))=1}/{±𝐈}.

The quotient group is taken because the matrix (𝑎𝑏𝑐𝑑) corresponds to the same transformation as (−𝑎−𝑏−𝑐−𝑑). This group, denoted by

PSL(2,ℂ)=SL(2,ℂ)/{±𝐈}≅Aut(ℂ̂),

is known as the projective special linear group of order 2, and is isomorphic to the group of Möbius transformations, consisting of all complex linear fractional transformations.

Therefore, any meromorphic automorphism on ℂ̂ is a composition of rotations, dilations, translations, and inversions. We will now state this formally:

Theorem 4.4.2.5 (The Meromorphic Automorphism Group on ℂ̂).

∀𝑓∈Aut(ℂ̂), 𝑓 is a Möbius transformation. In other words, ∃𝑎,𝑏,𝑐,𝑑∈ℂ satisfying 𝑎𝑑−𝑏𝑐≠0 such that

𝑓(𝑧)=𝑎𝑧+𝑏𝑐𝑧+𝑑.
Moreover, every such Möbius transformation is in Aut(ℂ̂).

The group of holomorphic automorphisms on 𝔻, or Aut(𝔻), is also a subgroup of Aut(ℂ̂).

Proposition 4.4.2.6.

Suppose we have two Möbius transformations represented by the matrices (𝑎𝑏𝑐𝑑) and (𝑒𝑓𝑔ℎ). Then their composition is a Möbius transformation represented by (𝑎𝑏𝑐𝑑)(𝑒𝑓𝑔ℎ).
Proof.

From simple substitution, we have

𝑎𝑒𝑧+𝑓𝑔𝑧+ℎ+𝑏𝑐𝑒𝑧+𝑓𝑔𝑧+ℎ+𝑑=𝑎𝑒𝑧+𝑎𝑓+𝑏𝑔𝑧+𝑏ℎ𝑐𝑒𝑧+𝑐𝑓+𝑑𝑔𝑧+𝑑ℎ=(𝑎𝑒+𝑏𝑔)𝑧+(𝑎𝑓+𝑏ℎ)(𝑐𝑒+𝑑𝑔)𝑧+(𝑐𝑓+𝑑ℎ),
which corresponds to the product (𝑎𝑏𝑐𝑑)(𝑒𝑓𝑔ℎ). ⁠□

We have now introduced three of the most important regions in complex analysis: 𝔻, ℂ, and ℂ̂. Their importance will be later explained by the Uniformization Theorem (@ thm:uniformization).