How To Know The Limit Set Of A Fuchsian Group On A Boundary Of A Hyperbolic Plane
|
|
|
- Peter Hensley
- 5 years ago
- Views:
Transcription
1 Reading material on the limit set of a Fuchsian group Recommended texts Many books on hyperbolic geometry and Kleinian and Fuchsian groups contain material about limit sets. The presentation given here follows T. Bedford, M. Keane and C. Series, Ergodic Theory, Symbolic Dynamics and Hyperbolic Spaces, O.U.P. 1991, S. Katok, Fuchsian Groups, Chicago University Press, Many attractive pictures of limit sets and constructions related to those in these notes can be found in D. Mumford, C. Series, D. Wright, Indra s Pearls: The Vision of Felix Klein, C.U.P Prerequisites I have tried to keep these notes as independent from the lectures as possible. Due to the nature of the material, this has not always been possible so below there is a list describing at which point we will have covered the necessary background in the lectures for a given section of these notes to be readable. Section Prerequisites 1 3 Lecture 2 4 Lecture 9 (we cover most of this material in lectures 10 and 12) 5 Lecture Lecture Lecture 20 As with the lecture notes, please point out any mathematical or typographical mistakes. 1
2 1 Background Recall that the set of Möbius transformations forms a group Möb(H) under composition. This group has a very rich structure; for example, we shall see how to define a notion of distance on this group (so that we can say how far apart two Möbius transformations are). We shall also study a very important class of subgroups of Möb(H) called Fuchsian groups. The purpose of these notes is to discuss the action of a Fuchsian group on the boundary H in terms of its limit set. These sets are important and often intricate geometrical objects (for example, they are often of a fractal nature). 2 Metric spaces We will use several concepts from metric spaces. In this section we quickly review many of the necessary definitions. For more details, see almost any book on metric spaces (for example W.A. Sutherland, An Introduction to Metric and Topological Spaces, O.U.P., Oxford, 1975). In the course we saw how to define a notion of distance on the upper half-plane H. This distance function satisfies several nice properties (such as the triangle inequality). A metric space just abstracts these properties. Definition. Let X be a set. We say that a function d : X X R is a metric (or distance function) if: (i) for all x, y X, we have d(x, y) 0 and d(x, y) = 0 if and only if x = y; (ii) for all x, y X, we have d(x, y) = d(y, x); (iii) the triangle inequality holds: for all x, y, z X we have d(x, z) d(x, y) + d(y, z). We call the pair (X, d) a metric space. Examples. 1. Take X = R and define d(x, y) = x y. 2. Take X = R 2 and define d((x 1, x 2 ), (y 1, y 2 )) = y 1 x y 2 x Take X = H with d(z, z ) = inf{length H (σ) σ is a piecewise-differentiable path from z to z } 2
3 2.1 Convergence We know how to define convergence of sequences in R: if x n R then we say that x n x if for all ε > 0 there exists N N such that for all n N we have x n x < ε. That is, given any ε > 0 the distance (in R) between x n and x is less than ε provided n is sufficiently large. We can recast this definition in terms of metric spaces. Definition. Let (X, d) be a metric space. Let x n X be a sequence of points in X. We say that x n converges to x X (and write x n x) if for all ε > 0 there exists N N such that for all n N we have d(x n, x) < ε. 2.2 Open and closed sets Let (X, d) be a metric space. Let x X and let ε > 0. The set B ε (x) = {y X d(x, y) < ε} of all points y that are distance at most ε from x is called the open ball of radius ε and centre x. We can think of B ε (x) as being a small neighbourhood around the point x. A subset U X is called open if for all x U there exists ε > 0 such that B ε (x) U, i.e. every point x in U has a small neighbourhood that is also contained in U. One can easily show that open balls B ε (x) are open subsets. (This is not a tautology! Our choice of terminology strongly suggests that an open ball will indeed be an open set; however one does need to check that an open ball is open.) Let x X. An open set U containing x is called a neighbour- Definition. hood of x. The idea is that a neighbourhood of x contains all points that are sufficiently close to x. Recall that a sequence x n X converges to x if x n is arbitrarily close to x for all sufficiently large n. With this in mind, the following should not be a surprising result. Lemma 2.1 Let (X, d) be a metric space. Let x n, x X. Then the following are equivalent: (i) x n x as n ; (ii) if U is a neighbourhood of x then there exists N N such that for all n N we have x n U. Proof. This is a case of unravelling the definitions. 3
4 A set F is said to be closed if its complement X \ F is open. There are other ways of defining closed sets: Proposition 2.2 Let (X, d) be a metric space and let F X. Then the following are equivalent: (i) F is closed (i.e. X \ F is open); (ii) if x n F is a sequence of points in F such that x n x for some x X then x F (i.e. any convergent sequence of points in F has its limit in F ). Let us give some examples. Examples. (i) Take X = R and let I = (a, b) be the interval I = {x R a < x < b}. Then I is an open set. To see this, take x I and let ε = min{x a, b x}. Then B ε (x) = (x ε, x + ε) I (draw a picture). This is why we call (a, b) an open interval. (ii) Take X = R and let I = [a, b] = {x R a x b}. Then I is a closed set as its complement is R \ I = (, a) (b, ), the union of two open sets. (iii) Take X = R and let I = [a, b) = {x R a x < b}. Then I is neither open nor closed. It is not open because no small neighbourhood (a ε, a + ε) of a is not contained in I. It is not closed because the sequence x n = b 1/n lies inside I, but x n b and b is not in I. In practice, sets defined by strict inequalities (<, >) normally give open sets, and sets defined by weak inequalities (, ) normally give closed sets. Consider the usual Euclidean metric on R 2 defined by d R 2((x 1, x 2 ), (y 1, y 2 )) = y 1 x y 2 x 2 2. Let x = (x 1, x 2 ). The open ball B ε (x) around a point x is a Euclidean disc of Euclidean radius ε and centre x. In contrast, if we work in the upper half-plane H with the hyperbolic metric d H then the open ball B ε (z) is a hyperbolic disc centred on z and with hyperbolic radius ε. However, in Exercise 5.4 we will see that a hyperbolic disc is a Euclidean disc (albeit with a different centre and radius). In particular, one can prove: Lemma 2.3 The open sets in H defined using the hyperbolic metric d H are the same as the open sets in the upper half-plane using the Euclidean metric. (For those of you familiar with the terminology: this just says that the topology generated by the hyperbolic metric is the same as the usual Euclidean topology.) 4
5 2.3 Compactness A compact metric spaces is, roughly speaking, one in which sequences of points cannot escape. There are two ways in which a sequence could escape: (i) the sequence could tend to infinity (that is, the set is unbounded ), or (ii) the sequence could tend to a limit that is outside the set, as happens in Example (iii) in 2.2 (that is, the set is not closed ). Let (X, d) be a metric space. We say that X is (sequentially) compact if every sequence x n X has a convergent subsequence, i.e. there exist n j such that x nj x for some x X. Examples. 1. [0, 1] is compact. 2. (0, 1) is not compact (because x n = 1/n does not have a convergent subsequence in (0, 1)). Remark. There are other, equivalent, definitions of compactness, such as compactness in terms of open covers. The characterisation of compactness is terms of the set being closed and bounded is only valid for subsets of R n. In a general metric space, a compact set is always closed and bounded, but the converse is not necessarily true. We will often restrict our attention to the following class of metric spaces. Definition. A metric space is proper if every closed ball B ε (x) = {y X d(x, y) ε} is compact. Subsets of R n, the upper half-plane, the Poincarè disc, Möb(H) are all proper metric spaces. The set of continuous real-valued functions defined on [0, 1] with the metric d(f, g) = sup x [0,1] f(x) g(x) is not a proper metric space. Exercise 2.1 Let (X, d) be a metric space. Let K X be a compact subset and let F K be a closed subset of K. By using Proposition 2.2 show that F is itself compact. 2.4 Continuity Continuity is a key idea in metric spaces. Let (X, d) and (Y, ρ) be metric spaces and let f : X Y. Definition. We say that a function f : X Y is continuous at a X if: for all ε > 0 there exists δ > 0 such that if d(x, a) < δ then ρ(f(x), f(a)) < ε. We say that f is continuous if it is continuous at a X for all a X. 5
6 Thus a function f : X Y is continuous at a if points that are close to a X get mapped by f to points that are close to f(a) Y. A function is continuous if it is continuous at each point. If X and Y are subsets of R (with the usual metric) has its usual meaning: one can draw the graph of f without any breaks or jumps. There are many other ways of characterising continuity. We give some below. First recall that if f : X Y is a function and U Y then the pre-image of Y under f is the set: f 1 (U) = {x X f(x) U. We do not assume that f is invertible here: this definition makes sense for any function f. (For example, if f : R R is given by f(x) = x 2 then f 1 ({b}) = { b, b} if b > 0, f 1 (0) = {0}, and f 1 ({b}) = if b < 0.) Lemma 2.4 Let (X, d) and (Y, ρ) be metric spaces and let f : X Y. Then the following are equivalent: (i) f is continuous; (ii) if x n X is such that x n x for some x X then f(x n ) f(x); (iii) if U Y is any open set then f 1 (U) X is an open set. Note that Lemma 2.4(iii) does not say that if U X is open then f(u) Y is open (this is false in general). Continuity also works well with compactness. The following result says that the continuous image of a compact set is compact: Lemma 2.5 Let (X, d) and (Y, ρ) be metric spaces and let f : X Y be continuous. Let K X be a compact set. Then f(k) = {f(x) x K} Y is compact. Note that this does not say that the pre-image f 1 (L) of a compact subset L Y is a compact subset of X (this is false in general). 2.5 Discreteness Let ε > 0 and x X. We call B ε (x) = {y X d(x, y) < ε} the ε-ball around x, or simply a neighbourhood of x. Definition. Let Y X be a subset of X. We say that a point x Y is isolated in Y if there exists ε > 0 such that B ε (x) Y = {x}, i.e. there are no points of Y (other than x itself) within distance ε of x. Definition. Let Y X be a subset of X. We say that Y is discrete if every element of Y is isolated in Y. 6
7 Examples. 1. Take X = R and let Y = {1/n n = 1, 2, 3,...}. Then Y is discrete (notice that in the definition of discreteness, the value of ε chosen is allowed to depend on the point x Y ). 2. Take X = R and let Y = {1/n n = 1, 2, 3,...} {0}. Then Y is not discrete as the point 0 is not isolated : there are points of the form 1/n arbitrarily close to 0. Exercise 2.2 Let (X, d) be a metric space and let Y X. Show that the following are equivalent: (i) Y is a discrete subset; (ii) if x n Y is a sequence in Y such that x n x Y as n, then there exists N N such that x n = x for all n N. 2.6 Limit points Definition. Let Y X be an arbitrary subset of X. We say that a point x X is a limit point of Y if every neighbourhood of x contains a point y Y such that y x. We let Λ(Y ) denote the set of all limit points of the subset Y. Example. Take X = R and Y = {( 1) n + 1/n n = 1, 2,...}. Then Y has two limit points: 1 and 1. Example. Take X = R and Y = Q. As any real number can be arbitrarily well-approximated by a rational, we see that every real number is a limit point of Y. Example. Let Y be a finite subset of a metric space X. Then there are no limit points. 3 Properly discontinuous group actions Let (X, d) be a metric space. For example, we could have X = R 2 with the usual Euclidean metric, or X = H with the hyperbolic metric. Recall that a map γ : X X is an isometry if d(γ(x), γ(y)) = d(x, y) for all x, y X. Exercise 3.1 Prove that an isometry is continuous. Let Γ be a group of isometries of X and let x X. 7
8 Definition. The orbit of x under Γ is the set Γ(x) = {γ(x) γ Γ} X. That is, the orbit Γ(x) of x under Γ is the set of points one can reach starting at x and applying every possible element of Γ. Definition. The stabiliser of x under Γ is the set Stab Γ (x) = {γ Γ γ(x) = x} Γ. That is, the stabilister Stab Γ (x) of x under Γ is the set of isometries in Γ that leave x fixed. Exercise 3.2 Show that, for each x X, Stab Γ (x) is a subgroup of Γ. Examples. (i) Let X = R 2 with the Euclidean metric. Let Γ = {γ n,m γ n,m (x, y) = (x + n, y + m), (n, m) Z 2 } denote the group of isometries of R 2 given by integer translations. Then the orbit of the origin is Γ(0, 0) = {(n, m) (n, m) Z 2 }, i.e. the integer lattice. The stabiliser of the origin is Stab Γ (0, 0) = {γ 0,0 }, i.e. the only isometry in Γ that fixes the origin is the identity. (ii) Let X = D with the hyperbolic metric d D. Let Γ = {γ θ γ θ (z) = e 2πiθ z, θ [0, 1)} denote the group of rotations around the origin in D. Let z = re iθ D. Then the orbit Γ(z) of z is the (Euclidean) circle in D of radius r. If z 0 then the stabiliser Stab Γ (z) of z contains just the identity transformation. As every transformation in Γ fixes 0, the stabiliser of the origin is Γ: Stab Γ (z) = Γ. (iii) Let X = R 2 with the Euclidean metric. Let Γ = {id, γ 1, γ 2, γ 3 } where id, γ 1, γ 2, γ 3 denote the identity and rotations around the origin through angles 90, 180, 270 degrees, respec tively. Then the orbit of (x, y) R 2 contains either 4 points forming a square (if (x, y) (0, 0)) or is the origin (if (x, y) = (0, 0). If (x, y) (0, 0) then Stab Γ (x, y) = {id}; however, Stab Γ (0, 0) = Γ. (iv) Let X = H with the hyperbolic metric d H. Let Γ = {γ n γ n (z) = z + n, n Z} denote the group of integer translations. Then, for any z H, the orbit of z is Γ(z) = {z + n n Z, the set of integer translations of z. As no translation, other than the identity, fixes any point we have that Stab Γ (z) = {id}. 8
9 Exercise 3.3 Let X = H with the hyperbolic metric d H. Let Γ = Möb(H) be the group of all Möbius transformations. Calculate the orbit of i and the stabiliser of i. In the first, third and fourth examples above we have the following property: the orbit of every point in X is a discrete subset of X, and the stabiliser of every point is finite. Heuristically, this means the following: if x X, then γ(x) is moved a long way from x, except for possibly finitely many γ that leave x fixed. Contrast this with the second example. Here, the orbit of z can contain points other than z that are arbitrarily close to z; moreover, for some points (actually, just the origin) there are infinitely many transformations that fix z. This motivates the following definition. Definition. Let (X, d) be a metric space and let Γ be a group of isometries of X. Then Γ acts properly discontinuously on X if: for all x X and for all non-empty compact subsets K X the set {γ Γ γ(x) K} is finite. Heuristically we think of a compact set containing x as being a small closed set around x. Thus Γ acts properly discontinuously if, given any point x X, all but finitely many isometries in Γ move the point x a long way from where it started. Exercise 3.4 Let X = R 2 equipped with the Euclidean metric d. Let Γ = {γ n,m γ n,m (x, y) = (x + n, y + m), (n, m) Z 2 } denote the subgroup of isometries given by integer translations. Show that Γ acts properly discontinuously on R 2. There are many equivalent ways of defining what it means for a group of isometries to act properly discontinuously. The following will be the most important for our purposes. Lemma 3.1 Let (X, d) be a proper metric space and let Γ be a group of isometries of X. Then the following are equivalent: (i) Γ acts properly discontinuously on X; (ii) for all x X, (a) the orbit Γ(x) is a discrete subset of X, and (b) the stabiliser Stab Γ (x) is a finite subgroup of Γ. Before proving this lemma we need the result contained in the following exercise. 9
10 Exercise 3.5 Let (X, d) be a metric space and suppose that Γ is a group of isometries that acts on X. Let x X. (i) Suppose that the orbit Γ(x) of x is discrete. Show that one can find ε > 0 such that B ε (γ(x)) Γ(x) = {γ(x)} for all γ Γ. (That is, the ε in the definition of discreteness can be chosen to be independent of the point in the orbit.) (ii) Conclude that if Γ(x) is discrete and K is compact that K Γ(x) is finite. Proof of Lemma 3.1. We prove (ii) implies (i). Let x X and let K be a non-empty compact subset of X. As Γ(x) is discrete and K is compact, it follows that Γ(x) K = {x 1,..., x m } is a finite set. For each j {1,..., m} we show that the set Γ j = {γ Γ γ(x) = x j } is finite. As {γ Γ γ(x) K} = m j=1 Γ j, statement (i) will follow. For each j fix a choice of γ j Γ j so that γ j (x) = x j. Let Stab Γ (x) = {g 1,..., g n }. Let γ Γ j. Then γ(x) = x j. Hence γj 1 γ(x) = x so that γj 1 γ Stab Γ (x). Hence γj 1 γ = g i for some 1 i n. Hence γ = γ j g i, and so Γ j is finite. We prove (i) implies (ii). Suppose that Γ acts properly discontinuously on the proper metric space X. Let x X and suppose, for a contradiction, that the orbit Γ(x) is not discrete. Then there exists γ n Γ and a point x X such that γ n (x) x but γ n (x) x for all n and the γ n are all pairwise distinct. Fix a choice of ε > 0 and let K = B ε (x). As X is proper, we have that K is compact. As γ n (x) x as n, there exists N N such that γ n (x) K for all n N. As there are infinitely many such n, this contradicts (i). Suppose that Γ acts properly discontinuously. Let x X and suppose that, for a contradiction, Stab Γ (x) is infinite. Choose γ n Stab Γ (x) to be pairwise distint. Let K = {x}; then K is compact. Note that γ n (x) = x K for all n. This contradicts (i). Here is another equivalent condition for a group of isometries to act properly discontinuously. Proposition 3.2 Let (X, d) be a proper metric space and let Γ be a group of isometries of X. Then the following are equivalent: (i) Γ acts properly discontinuously; 10
11 (ii) each point x X has a neighbourhood U containing x such that γ(u) U for only finitely many γ Γ. Proof. Recall from Lemma 3.1 that a group Γ of isometries acts on X properly discontinuously if and only if the orbit Γ(x) of each point x X is discrete and the stabiliser Stab Γ (x) is finite. We prove (i) implies (ii). Let x X. As the orbit Γ(x) of x is discrete, there exists ε > 0 such that B ε (x) does not contain any points of Γ(x) other than x. Let U B ε/2 (x) be any neighbourhood of x. Suppose that γ(u) U. Let y γ(u) U. Then, as y U, we have that d(x, y) < ε/2. As y γ(u) we have d(y, γ(x)) < ε/2. Hence by the triangle inequality, d(x, γ(x)) d(x, y) + d(y, γ(x)) ε. Hence γ(x) B ε (x). As B ε (x) does not contain any points in Γ(x) other than x, it follows that γ(x) = x, i.e. γ Stab Γ (x). Hence there are only finitely many γ Γ for which γ(u) U. We prove that (ii) implies (i). Let x X and suppose, for a contradiction, that Γ(x) is not discrete. Choose pairwise distinct γ n such that γ n (x) x for some x X but γ n (x) x. Let U be the neighbourhood of x given by (ii). Then there exists N N such that if n N then γ n (x) U. Now if n N then γ n (x) U and γ N (x) U. Hence x γn 1 U γ 1 U. Hence N N (U γ Nγn 1 U) = γ 1 N U γ 1 n U. γ 1 By (ii), there are only finitely many possibilities for γ N γn 1, n N, contradicting the fact that the γ n are pairwise distinct. Let x X and suppose that Stab Γ (x) is infinite. Then there exist infinitely many distinct γ n Γ such that γ n (x) = x. Let U be the neighbourhood of x in (ii). Then x = γ n (x) γ n (U). Hence x γ n (U) U. But there are only finitely many γ n with this property, a contradiction. 4 Fuchsian groups Recall that the collection of Möbius transformations Möb(H) of H forms a group. We shall show how to define a metric on Möb(H) (thus we will be able to say how far apart two Möbius transformations are). We can then use this metric to define an important class of subgroups of H, namely Fuchsian groups. 4.1 A metric on Möb(H) Intuitively, it is clear what we mean for two Möbius transformations to be close: two Möbius transformations are close if the coefficients (a, b; c, d) defining them are close. However, things are not quite so simple because different coefficients (a, b; c, d) can give the same Möbius transformation. 11
12 To see this, notice that if is a Möbius transformation, then γ(z) = az + b cz + d z λaz + λb λcz + λd gives the same Möbius transformation (provided λ 0). Thus, by taking λ = 1/ (ad bc) we can always assume that ad bc = 1. Definition. The Möbius map γ(z) = (az +b)/(cz +d) is said to be written in normalised form (or γ is normalised) if ad bc = 1. However, even if we insist on writing Möbius transformations in normalised form, then there is still some ambiguity: different normalised coefficients can still give the same Möbius transformation. To see this, note that if γ(z) = az + b cz + d is normalised, then so is γ(z) = az b cz d and this gives the same Möbius transformation. This, however, is the only ambiguity. Thus we will say that the (normalised) Möbius maps γ 1 (z) = (a 1 z + b 1 )/(c 1 z+d 1 ) and γ 2 (z) = (a 2 z+b 2 )/(c 2 z+d 2 ) are close if either (a 1, b 1, c 1, d 1 ), (a 2, b 2, c 2, d 2 ) are close or (a 1, b 1, c 1, d 1 ), ( a 2, b 2, c 2, d 2 ) are close. If we wanted to make this precise and in particular have a formula, then we could define a metric on the space Möb(H) of Möbius transformations by setting d Möb (γ 1, γ 2 ) = min{ (a 1, b 1, c 1, d 1 ) (a 2, b 2, c 2, d 2 ), (a 1, b 1, c 1, d 1 ) ( a 2, b 2, c 2, d 2 ) }. (Here is the Euclidean norm in R 4 defined by (a, b, c, d) = a 2 + b 2 + c 2 + d 2.) However, we will never use an explicit metric on Möb(H) and prefer instead to think of Möbius transformations being close if they look close (secure in the knowledge that we could fill in the details using the metric given above if we had to!). 12
13 4.2 Fuchsian groups Definition. A subgroup Γ < Möb(H) of Möbius transformations is called a Fuchsian group if it is discrete subset of Möb(H). Thus if Γ is a Fuchsian group and γ n Γ is such that γ n γ Γ then γ n = γ for all sufficiently large n. Similar definitions continue to hold for the Poincaré disc model D of the hyperbolic plane. A transformation γ : D D of the form γ(z) = αz + β βz + ᾱ where α, β C and α 2 β 2 > 0 is called a Möbius transformation of D. The collection of all such transformations is denoted by Möb(D). There is no loss in assuming that γ Möb(D) is normalised, namely that α 2 β 2 = 1. A metric can be defined in a similar way as above. Let us recall some examples of Fuchsian groups. Examples. 1. The subgroup Γ = {γ n γ n (z) = z + n, n Z} < Möb(H) of all integer translations of H is a Fuchsian group. 2. The subgroup Γ = {γ n γ n (z) = 2 n z, n Z} < Möb(H) is a Fuchsian group. 3. Let θ R. Consider the subgroup Γ = {γ n θ γ θ(z) = e 2πiθ z, n Z} of Möb(D). If θ is rational then this is a finite group, and so a Fuchsian group. If θ is irrational then this group is infinite; one can check that in this case Γ is not a Fuchsian group. 4. The modular group { PSL(2, Z) = z az + b } a, b, c, d Z, ad bc = 1 < Möb(H) cz + d is a Fuchsian group. 5. Let q N. The level-q modular group { z az + b a, b, c, d Z, ad bc = 1, cz + d b, c are divisible by q is a Fuchsian group. } < Möb(H) 6. Let q N. The principle congruence subgroup of level q is the group az + b a, b, c, d Z, ad bc = 1, z cz + d b, c are divisible by q, < Möb(H) a, d 1 mod q is a Fuchsian group. 13
14 4.3 Fuchsian groups and properly discontinuous group actions The goal of this subsection is to prove the following result. Theorem 4.1 Let Γ be a subgroup of Möb(H) (or Möb(D)). Then Γ is a Fuchsian group if and only if Γ acts properly discontinuously on H (or D). For convenience we will work in H. We first need the following lemma. Lemma 4.2 Fix z 0 H and let K H be a non-empty compact set. Then E = {γ Möb(H) γ(z 0 ) K} (i.e. the set of all Möbius transformations that map z 0 into K) is a compact subset of Möb(H). Proof. Let Sl(2, R) denote the group of 2 2 matrices with real coefficients and determinant 1. Recall the map θ : Sl(2, R) Möb(H) given by ( ) a b θ = γ c d A where γ A Möb(H) is the Möbius transformation with coefficient given by the matrix A: γ A (z) = (az + b)/(cz + d). The map θ is continuous. Let {( ) E a b = Sl(2, R) az } 0 + b c d cz 0 + d K. Then θ(e ) = E. If we can prove that E is a compact subset of Sl(2, R) then it follows that E, as the continuous image of a compact set, is a compact subset of Möb(H). ( ) a b Now Sl(2, R) can be regarded as a subset of R 4 (via the map c d (a, b, c, d)). Hence to prove that E is compact it is sufficient to prove that E is closed and bounded. Define ψ : Sl(2, R) H by ( ) a b ψ c d = az 0 + b cz 0 + d. Then ψ is continuous. Moreover, E = ψ 1 (K). As K H is compact, and so closed, it follows that E is closed. As K H is compact, in particular it is bounded. Hence there exists M 1 > 0 such that ( ) az 0 + b a b cz 0 + d M 1 for all E. c d 14
15 Moreover, as K H is compact, it is bounded away from the real axis. Hence there exists M 2 > 0 such that ( ) ( ) az0 + b a b Im M 2 for all E. cz 0 + d c d Now It follows that and Im ( ) az0 + b = cz 0 + d cz 0 + d 1 cz 0 + d 2 Im(z 0). Im z0 M 2 (4.1) az 0 + b M 1 Im z0 M 2. (4.2) Call the constants appearing on the right-hand side of (4.1) and (4.2) C 1 and C 2 respectively, and note that they are independent of a, b, c, d. Let z 0 = x 0 + iy 0. Then from (4.1) we have that (cx 0 + d) 2 + c 2 y 2 0 = cz 0 + d 2 2 C 2 1 from which it follows that c C 1 /y 0 and so is bounded. We also have that cx 0 + d C 1, hence C 1 C 1x 0 y 0 C 1 cx 0 d C 1 cx 0 C 1 + C 1x 0 y 0 so that d is also bounded. From (4.2) it follows that a, b are also bounded. We will also need the following technical property. Proposition 4.3 Let Γ be a subgroup of Möb(H) that acts properly discontinuously on H. Suppose that p H is fixed by some element of Γ. Then there exists a neighbourhood W of p such that no other point of W is fixed by an element of Γ other than the identity. In other words, if p is fixed for some γ Γ, then near p no other point is fixed not just by γ, but by any non-trivial element of Γ. Remark. In particular, it follows from Proposition 4.3 that if Γ acts properly discontinuously then there exists p H such that γ(p) p for all γ Γ \ {id}. In Lecture 14 we use this property to give an algorithm that generates a fundamental domain for a given Fuchsian group. 15
16 Proof of Proposition 4.3. Suppose that γ(p) = p for some p X and γ Γ, γ id. Suppose, for a contradiction, that in any neighbourhood of p there exists a fixed point for some non-trivial transformation in Γ, i.e. there exists a sequence of distinct points p n X and γ n Γ \ {id} such that p n p and γ n (p n ) = p n. Hence γ n is an elliptic Möbius transformation with a fixed point at p n ; hence the γ n are pairwise distinct. Let B 3ε (p) be the closed 3ε-ball centred on p. This set is compact. From the definition of a properly discontinuous group action it follows that {γ Γ γ(p) B 3ε (p)} is finite. Hence only finitely many of the γ n belong to this set. Hence there exists N 1 N such that if n N 1 then d H (γ n (p), p) > 3ε. As p n p, it follows that there exists N 2 N such that if n N 2 then d H (p n, p) < ε. Choose n max{n 1, N 2 }. Then d H (γ n (p), p) d H (γ n (p), γ n (p n )) + d H (γ n (p n ), p) = d H (p, p n ) + d H (p n, p) 2ε (as γ n is an isometry, and γ n (p n ) = p n ), a contradiction. Exercise 4.1 Given an example of a metric space (X, d) and a group Γ of isometries that acts properly discontinuously on X for which the conclusion of Proposition 4.3 fails, i.e. there exists a point p X which is fixed by some nontrivial element of Γ and for which there are points arbitrarily close (but not equal) to p that are also fixed under some non-trivial elements of Γ. (Hint: where did we use the fact that we are working with Möbius transformations in the above proof?) We can now prove Theorem 4.1. Proof of Theorem 4.1. Let Γ be a Fuchsian group. We prove that Γ acts properly discontinuously on H. Let z H and let K H be a non-empty compact set. Then {γ Γ γ(z) K} = {γ Möb(H) γ(z) K} Γ. (4.3) The first set on the right-hand side of (4.3) is compact by Lemma 4.2, and the second set is discrete. Hence {γ Γ γ(z) K} is finite. Hence Γ acts properly discontinuously. Conversely, suppose that Γ acts properly discontinuously but is not discrete. By Proposition 4.3 and the remark following it, there exists p H that is not fixed by any element in Γ other than the identity. As Γ is not discrete, there exists pairwise distinct γ n Γ such that γ n id. Hence γ n (p) p and γ n (p) p. 16
17 Let U be any neighbourhood of p. Then γ n (p) U for sufficiently large n. Clearly γ n (p) γ n (U). Hence there exist infinitely many γ n Γ such that γ n (U) U, contradicting Proposition 3.2. Recall that Lemma 3.1 says that a group acts properly discontinuously if and only if each orbit is discrete and each stabiliser is finite. For Fuchsian groups, we do not need to check that stabiliser of each point is finite (heuristically, this isn t surprising: for γ is in Stab Γ (z) if and only if z is a fixed point of γ, and we know that Möbius transformations have very few fixed points). Proposition 4.4 Let Γ < Möb(H) be a subgroup of the Möbius group. Then the following are equivalent: (i) Γ acts properly discontinuously on H; (ii) for all z H, the orbit Γ(z) H is a discrete subset of H. Proof. We prove (i) implies (ii). If Γ acts properly discontinuously then, by Lemma 3.1, the orbit Γ(z) of every z H is discrete. Conversely, we prove (ii) implies (i). We work in D for convenience. By Lemma 3.1 we need only prove that the stabiliser of each point z 0 D is finite. Let γ Stab Γ (z 0 ). Then γ(z 0 ) = z 0, so that γ has fixed point at z 0 ; hence γ is either elliptic or the identity. Recall that a Möbius transformation is elliptic if and only if it is conjugate to a rotation about 0 D. Thus Stab Γ (z 0 ) is conjugate to S, a subgroup of {γ θ γ θ (z) = e 2πiθ z, θ [0, 1]}. That is, there exists g Möb(D) such that g Stab Γ (z 0 )g 1 = S. Suppose that Stab Γ (z 0 ) is infinite. Then S is infinite and there exist infinitely many distinct θ j [0, 1] for which γ θj S. As [0, 1] is compact, we can choose a convergent subsequence θ jn θ, for some θ [0, 1]. Fix any z 1 D, z 0. Then γ thetajn (z 1 ) γ θ (z 1 ) as n. Let γ n = g 1 γ θjn g Stab Γ (z 0 ). Then γ n (g 1 z 1 ) g 1 z 1, so that the orbit of z 1 is not discrete, a contradiction. Remark. It is important to realise that Proposition 4.4 fails if we consider the orbit of a point z H. For example, take Γ = PSL(2, Z); this is a Fuchsian group. However, it is easy to see that Γ(0), the orbit of the point 0 H, is equal to Q { }, which is not discrete. In particular, we have the following important corollary. 17
18 Corollary 4.5 Let Γ be a Fuchsian group and let z H. Then Γ(z) has no limit points inside H. Thus if Γ(z) has any limit points, then they must lie on the boundary. 5 The limit set of a Fuchsian group For convenience, we will work in the Poincaré disc model of the hyperbolic plane. Let Γ be a Fuchsian group acting on the Poincaré disc D. We will be interested in the orbit Γ(z) of a point z D. We shall view Γ(z) as a subset of D D. Note that D D = {z C z 1}, the closed unit disc in C. We give D D the Euclidean topology: a sequence points z n D D converges to z D D if z n z 0 as n, where denotes the modulus of a complex number. Remark. If we are working in D then d D (z n, z) 0 if and only if z n z 0. However, when we are working with limit sets we are often looking at convergence in D D. As points on D are an infinite distance away from points in D, it does not make sense to consider convergence using the hyperbolic metric D. Definition. Let Γ be a Fuchsian group acting on the Poincaré disc D and let z D. Let Λ(Γ)(z) denote the set of limit points in D D of the orbit Γ(z). Remarks. (i) Let z D. Thus a point ζ D is an element of Λ(Γ)(z) if: there exists γ n Γ such that γ n (z) ζ as n. (ii) By Corollary 4.5, we know that for a Fuchsian group Γ any limit point of Γ(z) lies on the boundary. Thus Λ(Γ)(z) D. It appears from the above definition that the sets Λ(Γ)(z) depend on the choice of point z. This is not the case, as the following result shows. Proposition 5.1 Let Γ be a Fuchsian group and let z 1, z 2 D. Then Λ(Γ)(z 1 ) = Λ(Γ)(z 2 ). Definition. Let Γ be a Fuchsian group acting on the Poincaré disc D. We define the limit set Λ(Γ) of Γ to be the set Λ(Γ)(z) for any z D. 18
19 Proof. One can prove that the following formula holds for two points z 1, z 2 D: sinh d z 1 z 2 2 D(z 1, z 2 ) = (1 z 1 2 )(1 z 2 2 ). (Recall that Proposition 5.1 in the lecture notes gives a formula for cosh d H (z 1, z 2 ) in the upper half-plane. One can prove a similar formula in the Poincaré disc using the same method.) Let γ Γ. As γ is an isometry, it follows that sinh d D(z 1, z 2 ) = sinh d D(γ(z 1 ), γ(z 2 )) = γ(z 1 ) γ(z 2 ) 2 (1 γ(z 1 ) 2 )(1 γ(z 2 ) 2 ). Hence for any γ Γ we have γ(z 1 ) γ(z 2 ) (1 γ(z 1 ) 2 ) 1/2 sinh 1 2 d D(z 1, z 2 ). (5.1) Let ζ Λ(Γ)(z 1 ). We show that ζ Λ(Γ)(z 2 ). As ζ Λ(Γ)(z 1 ), there exists a sequence of group elements γ n Γ such that γ n (z 1 ) ζ as n. Consider (5.1) for γ n : γ n (z 1 ) γ n (z 2 ) (1 γ n (z 1 ) 2 ) 1/2 sinh 1 2 d D(z 1, z 2 ). (5.2) As ζ D, we have that γ n (z 1 ) ζ = 1 as n. It follows from (5.2) that γ n (z 2 ) ζ as n. Hence ζ Λ(Γ)(z 2 ). Thus we have shown that Λ(Γ)(z 1 ) Λ(Γ)(z 2 ). By reversing z 1 and z 2 in the above argument, we see that Λ(Γ)(z 2 ) Λ(Γ)(z 1 ). Hence Λ(Γ)(z 1 ) Λ(Γ)(z 2 ). Remark. There is, of course, a corresponding notion of limit set in the upper half-plane model of the hyperbolic plane. The definition is as above (with D replaced by H), but a small amount of care has to be taken when one defines convergence in H = R { }. Recall the map η : H D that we used in Lecture 6 to transfer results between the upper half-plane and Poincaré disc models of hyperbolic space. Let Γ < Möb(H) be a Fuchsian group and let Λ H (Γ) denote its limit set. Then η(γ) < Möb(D) is a Fuchsian group in the Poincaré disc model with limit set Λ D (η(γ)) = η(λ H (Γ)). Examples. (i) Let us work in the upper half-plane model. Take Γ = {γ n γ n (z) = 2 n z, n Z}. Consider the point i H. Then γ n (i) as n, and γ n (i) 0 as n. It is easy to see that Λ(Γ) = {0, }. 19
20 (ii) Working again in the upper half-plane model, take Γ to be the modular group PSL(2, Z). Then Λ(Γ) = H. We shall see several proofs of this later. Exercise 5.1 In the upper half-plane, take Γ = {γ n γ n (z) = z + n, n Z}. Find Λ(Γ). 6 Properties of the limit set In this section we derive some basic properties of the limit set Λ(Γ) of a Fuchsian group Γ. More specifically, we shall see that Λ(Γ) is a compact Γ-invariant subset of D. 6.1 Conjugate Fuchsian groups Recall that we say that two Möbius transformations γ 1, γ 2 Möb(H) are conjugate if there exists g Möb(H) such that γ 2 = g 1 γ 1 g. Recall that we think of conjugate Möbius transformations as representing the same transformation but with respect to different co-ordinate systems. Definition. Let Γ 1 and Γ 2 be Fuchsian groups. We say that Γ 1 and Γ 2 are conjugate if there exists g Möb(H) such that Γ 2 = g 1 Γ 1 g = {g 1 γ 1 g γ 1 Γ 1 }. Again, we think of conjugacy as a change of co-ordinates. The following result relates the limit sets of conjugate Fuchsian groups. Proposition 6.1 Let Γ 1 be a Fuchsian group and let Γ 2 = g 1 Γ 1 g be a conjugate Fuchsian group. Then Λ(Γ 2 ) = g 1 (Λ(Γ 1 )). Proof. Let ζ Λ(Γ 1 ). Then there exists z D and a sequence γ n Γ 1 such that γ n (z) ζ as n. Notice that γ n = g 1 γ n g Γ 2. (Note: here we re using γ n to denote some element of Γ 2 ; we re not using it to denote the derivative of γ n.) Hence γ n(g 1 z) = g 1 γ n g(g 1 z) = g 1 (γ n (z)) g 1 (ζ) so that g 1 (Λ(Γ 1 )) Λ(Γ 2 ). The reverse inequality follows similarly. 20
21 Remark. It follows from Proposition 6.1 that if Γ 1 and Γ 2 are conjugate Fuchsian groups then their limit sets Λ(Γ 1 ) and Λ(Γ 2 ) have the same cardinality. Moreover, they have the same topological properties. This is because the map ζ g 1 (ζ) : D D is a homeomorphism. When studying the limit set of a Fuchsian group Γ, it will often simplify the analysis if we replace Γ with a conjugate Fuchsian group g 1 Γg. 6.2 Basic topological properties Proposition 6.2 Let Γ be a Fuchsian group. Then the limit set Λ(Γ) of Γ is a closed subset of D. Exercise 6.1 Prove Proposition 6.2: namely, show that if ζ n Λ(Γ) and ζ n ζ D then ζ Λ(Γ). Corollary 6.3 The limit set of a Fuchsian group is compact. Proof. This is immediate from Proposition 6.2: Λ(Γ) is a closed subset of the compact set D and therefore is itself compact. 6.3 The action of Γ on Λ(Γ). Recall that a Möbius transformation γ Möb(D) also acts on the boundary D. Thus if γ Γ then γ(λ(γ)) = {γ(ζ) ζ Λ(Γ)} D. Proposition 6.4 The limit set Λ(Γ) is invariant under Γ, namely γ(λ(γ)) = Λ(Γ). Proof. We have to show that for γ Γ we have γ(λ(γ)) = Λ(Γ). Let ζ Λ(Γ). Then there exist γ n Γ such that γ n (z) ζ. Now γγ n Γ as Γ is a group. Hence γγ n (z) γ(ζ). Hence γ(ζ) Λ(Γ). Thus γ(λ(γ)) Λ(Γ). By replacing γ by γ 1 in the above argument, we can similarly show that Λ(Γ) γ(λ(γ)). Hence γ(λ(γ)) = Λ(Γ). Remark. In fact, one can show that Λ(Γ) is the smallest Γ-invariant subset of D. Namely, if C D is a Γ-invariant subset then C Λ(Γ). 6.4 The cardinality of the limit set We know that if Γ is a Fuchsian group then Λ(Γ) is a compact subset of D. The purpose of this section is to study the cardinality of Λ(Γ). We shall 21
22 show that Λ(Γ) can have either 0, 1, 2 or infinitely many elements. Later on, we shall see that if Λ(Γ) is infinite, then it must in fact be uncountable. We begin with the following result. Recall that if γ is a parabolic or hyperbolic Möbius transformation then γ has either 1 or 2 fixed points in Λ(Γ). We show that if Γ contains a parabolic or hyperbolic element then the fixed points must lie in Λ(Γ). Proposition 6.5 Let Γ be a Fuchsian group. (i) Suppose that γ Γ is a parabolic Möbius transformation. Then the fixed point ζ D of γ is an element of Λ(Γ). (ii) Suppose that γ Γ is a hyperbolic Möbius transformation. Then the two fixed points ζ 1, ζ 2 D of γ are elements of Λ(Γ). Proof. We work in the upper half-plane model H for convenience. We prove (i). Suppose that γ Γ is parabolic. By Proposition 11.3 in the lecture notes, γ is conjugate to a translation z z + b, b 0. That is, there exists g Möb(H) such that g 1 γg(z) = z + b. Then g 1 γ n g(z) = z + bn H as n. Observe that ζ = g( ) is the unique fixed point of γ. Then γ n (g(z)) ζ as n. Hence ζ Λ(Γ). Exercise 6.2 Prove Proposition 6.5(ii). Exercise 6.3 Let p, q Z, q 0. Consider the Möbius transformation γ(z) = (1 + pq)z p2 q 2 z + (1 pq). Show that γ PSL(2, Z). By considering the fixed point(s) of γ, show that Λ(PSL(2, Z)) = H. Proposition 6.6 Let Γ be a Fuchsian group and let Λ(Γ) be its limit set. Then Λ(Γ) has either 0,1,2 or infinitely many elements. 22
23 (i) (ii) Figure 6.1: (i) The set C in the case of 3 points. (ii) The lines show the set of points within distance M of the geodesic; the triangle in the middle illustrates the set C(M). Proof. Suppose that Λ(Γ) is finite but has at least 3 elements. We show that this cannot happen. Let C denote the finite collection of geodesics with end-points in Λ(Γ). As Λ(Γ) is Γ-invariant, it follows that C is also Γ-invariant. Let M > 0 and let C(M) denote the set of points that are within distance M of every geodesic in C: C(M) = {z D sup inf d D(z, x) M}. x L L C Then, as C is Γ-invariant and Γ acts on D by isometries, we see that C(M) is also Γ-invariant. By choosing M sufficiently large, we see that C(M) is not empty (draw a picture!). Choose a point z 0 C(M). As Λ(Γ) has at least three elements, for any ζ C(M) D there exists a geodesic L C which does not have ζ as an endpoint. Let z be a point near ζ. Then as z ζ, we have that d(z, L) = inf x L d D (z, x). Hence z C(M) if z is sufficiently close to ζ. Hence C(M) is a bounded set, and in particular is bounded away from D. As z 0 C(M) and C(M) is Γ-invariant, we must have that the orbit Γ(z 0 ) of z 0 lies in C(M), which is bounded away from D. In particular, the orbit of z 0 cannot have any limit points on the boundary D. But this contradicts the fact that Λ(Γ) = Γ(z 0 ) D has at least three points. We can classify Fuchsian groups by the cardinality of their limit sets as follows: Definition. We say that Γ is elementary if Λ(Γ) has finitely many elements. Otherwise, we say that Γ is non-elementary. 23
24 Exercise 6.4 Check that all three possibilities can occur: namely, write down examples of Fuchsian groups Γ 0, Γ 1, Γ 2, Γ such that Λ(Γ j ) has, respectively, 0, 1, 2, elements. (In a later section we shall classify all Fuchsian groups for which Λ(Γ) is finite.) 7 Some algebraic properties of Fuchsian groups 7.1 Cyclic groups Definition. A group Γ is said to be cyclic if there exists γ Γ such that Γ = {γ n n Z}. We say that γ generates Γ, or equivalently that γ is a generator for Γ. Exercise 7.1 Show that any cyclic group is abelian. Examples. 1. The Fuchsian groups Γ = {γ n (z) = z + n n Z} Γ = {γ n (z) = 2 n z n Z} are cyclic; the first is generated by z z + 1 and the second is generated by z 2z. 2. The Fuchsian group Γ = {γ k (z) = e 2πik/n z k = 0, 1,..., n 1} is a cyclic group. It is generated by z e 2πi/n z. In particular, we see that a cyclic group may be finite. The following easily-proved result says that discrete subgroups of the real line and the circle (both thought of as additive groups) are cyclic. Lemma 7.1 (i) Any non-trivial discrete subgroup of R is an infinite cyclic group. (ii) Any non-trivial discrete subgroup of the unit circle S 1 is a finite cyclic group. Exercise 7.2 Sketch a proof of Lemma 7.1. (Hint: Suppose that Γ < R is a discrete subgroup. Choose an element 0 < y Γ such that no other element of Γ lies between 0 and y (why does such an element exist?). Show that y generates Γ.) 24
25 7.2 Centralisers and applications to abelian Fuchsian groups Definition. Let Γ be a group and let γ Γ. The centraliser C Γ (γ) is the set of all elements in Γ that commute with γ, i.e. C Γ (γ) = {g Γ gγ = γg}. Thus Γ is abelian if and only if C Γ (γ) = Γ for all γ Γ. Let γ Möb(H) be a Möbius transformation. We are interested in calculating the centraliser C Möb(H) (γ) of γ in Möb(H). This will allow us to calculate all abelian Fuchsian groups. Recall that a point z H H is a fixed point of γ Möb(H) if γ(z) = z. Lemma 7.2 Let γ Möb(H) and let γ C Möb(H) (γ). Then z is a fixed point of γ if and only if γ (z) is a fixed point of γ. Remark. Here γ denotes some element of C Möb(H) (γ); it does not denote the derivative of γ. Exercise 7.3 Prove Lemma 7.2 Let γ Möb(H) and let us calculate the centraliser C Möb(H) (γ) of γ in Möb(H). We consider three cases: γ is parabolic, hyperbolic or elliptic. Let γ Möb(H) be a parabolic Möbius transformation. By replacing γ with a conjugate transformation, we may assume that γ has its unique fixed point at and is either the translation γ(z) = z + 1 or γ(z) = z 1 (compare with Proposition 11.3 in the lecture notes). We will consider the case when γ(z) = z + 1; the case when γ(z) = z 1 is exactly the same. Let g C Möb(H) (γ) commute with γ. By Lemma 7.2, g( ) =. Hence g(z) = az + b (see Lecture 10). Now gγ(z) = az + a + b γg(z) = az + b + 1 and comparing coefficients shows that a = 1. Hence the group of all translations. C Möb(H) (γ) = {g(z) = z + b b R}, Exercise 7.4 (i) Consider the hyperbolic transformation γ(z) = kz. Show that C Möb(H) (γ) is the set of all dilations {γ(z) = λz λ > 0}. (ii) Consider the elliptic transformation γ(z) = e 2πiθ z of D. Show that C Möb(D) (γ) is the set of all rotations around 0 D. 25
26 Combining the above exercise with Propositions 12.1 and 12.2, we have the following results. Proposition 7.3 Two Möbius transformations commute if and only if they have the same set of fixed points. Proposition 7.4 (i) The centraliser C Möb(H) (γ) in Möb(H) of a parabolic element γ Γ consists of all parabolic transformations with the same fixed point in H as γ. (ii) The centraliser C Möb(H) (γ) in Möb(H) of an elliptic element γ Γ consists of all elliptic transformations with the same fixed point in H as γ. (i) The centraliser C Möb(H) (γ) in Möb(H) of a hyperbolic element γ Γ consists of all hyperbolic transformations with the same two fixed points in H as γ. The next two results tell us that the only abelian Fuchsian groups are cyclic. Proposition 7.5 Let Γ be a Fuchsian group. Suppose that every element γ Γ \ {Id} has the same set of fixed points. Then Γ is cyclic. Proof. As every non-identity element of Γ has the same set of fixed points, all non-identity elements must be of the same type: they must either be all parabolic, all elliptic or all hyperbolic. Suppose that Γ contains only parabolic elements that fix the same element, together with the identity. Replace Γ with a conjugate subgroup so that the fixed point is. The only transformations that fix have as the unique fixed point are the translations. Hence Γ is a discrete subgroup of the group of translations {z z + b, b R}, which is isomorphic to R. By Lemma 7.1, Γ is cyclic. Suppose that all the non-identity elements of Γ are hyperbolic and have the same set of fixed points. By replacing Γ by a conjugate group, we may assume that the fixed points are 0 and. The only transformations that fix both 0 and are the dilations z kz. Hence Γ is a discrete subgroup of the group of all dilations {z kz k > 0}, i.e. the multiplicative group of positive reals. The multiplicative group of positive reals is isomorphic to the additive group of reals (via the isomorphism x log x). By Lemma 7.1, Γ is cyclic. Working in D, suppose that Γ contains only elliptic elements that fix the same element. Replace Γ with a conjugate subgroup so that the fixed point 26
27 is 0 D. The only transformations that fix only 0 are the rotations. Hence Γ is a discrete subgroup of the group of rotations {z e 2πiθ z, θ [0, 1)}, which is isomorphic to the unit circle. By Lemma 7.1, Γ is cyclic. Proposition 7.6 Let Γ be an abelian Fuchsian group. Then Γ is cyclic. Proof. Let Γ be an abelian Fuchsian group. Then by Proposition 7.3 every element has the same set of fixed points. By Proposition 7.5 it follows that Γ is cyclic. Corollary 7.7 No Fuchsian group is isomorphic to the additive group Z 2 = {(n, m) n, m Z}. Proof. The group Z 2 is abelian but not cyclic. Exercise 7.5 Let Γ be a group and let H < Γ be a subgroup. We define N Γ (H) = {g Γ ghg 1 = H} to be the normaliser of H is Γ. That is, the normaliser of H is the largest subgroup of Γ in which H is a normal subgroup. (i) Check that N Γ (H) is a subgroup of Γ. (ii) Let Γ < Möb(H) be a non-abelian Fuchsian group. Prove that N Möb(H) (Γ) is also a Fuchsian group. (Hint: Suppose not. Consider a sequence of elements of N Möb(H) (Γ) that converges to the identity.) 8 Classifying elementary Fuchsian groups We have seen that if Γ is a Fuchsian group then Λ(Γ) can have either 0, 1, 2 or infinitely many elements. In this section we shall classify precisely those Fuchsian groups which have a finite limit set. 8.1 The case when card Λ(Γ) = 0 Here we analyse the case when Λ(Γ) =. We shall show that this happens if and only if Γ is a cyclic group generated by an elliptic element. We need the following preparatory result. 27
28 Proposition 8.1 Let Γ be a Fuchsian group. Suppose that all elements of Γ, other than the identity, are elliptic. Then all the elliptic transformations have a common fixed point. Proof. Let γ Γ\{Id} be elliptic. Then γ has a unique fixed point z H. To prove the theorem we have to show that every element of Γ has the same fixed point. We work in the Poincaré disc D. Let γ Γ \ {Id}. Then γ has a unique fixed point in D. By replacing Γ with a conjugate group, we can assume that this fixed point occurs at 0. Then γ has matrix ( α 0 ) 0 ᾱ with α = 1. Let g Γ, g γ. We show that g also has a fixed point at 0. Let g have matrix ( a b b ā ) with a, b C, a 2 b 2 = 1. Consider the commutator [γ, g] = γgγ 1 g 1 Γ. A straightforward calculation shows that this has matrix ( α 2 a 2 α 2 b 2 α 2 ab α 2 ) ab ᾱ 2 ā b α 2 ā b α 2 a 2 ᾱ 2 b 2. Recalling that α = 1, the trace of [γ, g] is given by the square of: a 2 α 2 b 2 + a 2 ᾱ 2 b 2. As a 2 b 2 = 1, we see that the trace of [γ, g] is the square of 2 + b 2 ( α ᾱ 2 ) = 2 b 2 (α ᾱ) 2. Recall that α ᾱ = 2i Im(α). Hence, the trace of [γ, g] is the square of b 2 (Im(α)) 2. As Γ does not contain any hyperbolic elements and [γ, g] Γ, we must have that [γ, g] is not hyperbolic. In particular, the trace of [γ, g] is at most 4. Squaring the above quantity, we see that this can only happen if either Im(α) = 0 or b = 0. If Im(α) = 0 then α = ᾱ so that γ is equal to the identity, a contradiction. Hence b = 0, so that g fixes the 0. Hence every element of Γ has the same fixed point. 28
29 Corollary 8.2 Suppose that all elements of Γ, other than the identity, are elliptic. Then the limit set Λ(Γ) is empty. Proof. By Proposition 8.1 we know that there exists a common fixed point z D such that γ(z) = z for all γ Γ. Hence the orbit of z under Γ is equal to {z}. Hence Λ(Γ) =. The converse to Corollary 8.2 is true. Corollary 8.3 Let Γ be a Fuchsian group and suppose that Λ(Γ) =. Then Γ is a cyclic abelian group generated by an elliptic element. Proof. This is merely assembling facts that we have already proved in the correct order! Suppose that Λ(Γ) =. By Proposition 6.5, Γ contains only elliptic elements and the identity. By Proposition 8.1, there exists a common fixed point. By replacing Γ by a conjugate group, we can assume that this fixed point is the origin. Hence each element of Γ is of the form z e 2πiθ z, and so can be viewed as a subgroup of the circle. By Lemma 7.1, it follows that Γ is a finite cyclic group. 8.2 The case when card Λ(Γ) = 1 Here we analyse the case when Λ(Γ) has exactly one element. We shall show that this happens if and only if Γ is an infinite cyclic group generated by a parabolic element. Proposition 8.4 Let Γ be a Fuchsian group and suppose that Λ(Γ) = {ζ}. Then Γ is of the form Γ = {γ n n Z}, for some parabolic γ Γ, i.e. Γ is an infinite cyclic group generated by a parabolic transformation. Proof. Let Γ be a Fuchsian group and suppose that the limit set Λ(Γ) contains only a single element ζ D. By Theorem 6.4 we know that Λ(Γ) is Γ-invariant. Hence if γ Γ then we have that γ(ζ) = ζ. Thus each element of Γ fixes ζ. In particular, this implies that there are no elliptic transformations in Γ. We show that Γ does not contain a hyperbolic element. Recall that a hyperbolic Möbius transformation has two fixed points in D and that these fixed points lie in Λ(Γ). As we are assuming that Λ(Γ) contains only one point, this cannot happen. 29
30 Hence Γ contains only parabolic elements and the identity. By working in the upper half-plane and replacing Γ by a conjugate subgroup, we may assume that Λ(Γ) = { } H. The only parabolic Möbius transformations that have as a fixed point are translations of the form z z + b for some b R. Hence Γ is (conjugate to) a subgroup of {z z + b b R} which is isomorphic to R. By Lemma 7.1, it follows that Γ is a cyclic abelian group generated by a parabolic Möbius transformation. Exercise 8.1 Prove the converse to Proposition 8.4, namely that if Γ is an infinite cyclic group generated by a parabolic element then Λ(Γ) has one element. 8.3 The case when card Λ(Γ) = 2 Finally, suppose that Λ(Γ) has two elements. Indeed, let Λ(Γ) = {ζ 1, ζ 2 }. Recall that Γ acts on Λ(Γ). Hence each element of Γ maps ζ 1 to either ζ 1 or to ζ 2, and similarly ζ 2 is mapped to either ζ 2 or to ζ 1. This observation allows us to classify Fuchsian groups Γ for which the limit set Λ(Γ) contains two elements. Proposition 8.5 Let Γ be a Fuchsian group and suppose that Λ(Γ) has two points. Then either (i) Γ is an infinite cyclic group generated by a hyperbolic transformation, or (ii) Γ is conjugate to a Fuchsian group generated by for some k > 1. z kz, z 1 z Proof. Let Λ(Γ) = {ζ 1, ζ 2 }. There are two cases. Case 1. Suppose that γ(ζ 1 ) = ζ 1 for all γ Γ. Then γ(ζ 2 ) = ζ 2 for all γ Γ. Hence each γ Γ fixes both ζ 1 and ζ 2 ; therefore each element of Γ is hyperbolic. By replacing Γ by a conjugate subgroup, we may assume that ζ 1 = 0, ζ 2 =. A hyperbolic transformation that fixes 0 and is of the form z kz for some k R. Hence Γ is conjugate to a subgroup of the form {z kz k R}, which is isomorphic to R. By Lemma 7.1, it follows that Γ is an infinite cyclic group generated by a hyperbolic element. Case 2. Now suppose that there exists γ Γ such that γ(ζ 1 ) = ζ 2. In this case, each element of Γ either fixes both ζ 1 and ζ 2 or interchanges them. If γ Γ fixes both ζ 1 and ζ 2 then γ is hyperbolic. 30
31 Suppose that γ Γ interchanges ζ 1 and ζ 2. Then ζ 1, ζ 2 are not fixed points of γ. If γ were hyperbolic or parabolic then then γ would have at least one fixed point in D not equal to ζ 1 or ζ 2 and this fixed point would lie in Λ(Γ). This is a contradiction. Hence γ must be elliptic. By working in the upper half-plane model and replacing Γ with a conjugate subgroup, we may assume that ζ 1 = 0 and ζ 2 =. Hence any hyperbolic element γ Γ is of the form z kz and any elliptic element is of the form z 1/z. 9 Non-elementary Fuchsian groups We have seen that a Fuchsian group has either 0, 1, 2 or infinitely many elements in its limit set. In this section we briefly discuss the case where the limit set is infinite. The following result says that in this case the limit set is in fact uncountable. Theorem 9.1 Let Γ be a Fuchsian group. Then Λ(Γ) has either 0,1,2 or uncountably many elements. Proof. Omitted. See Katok s book. Recall that a Fuchsian group Γ is said to be non-elementary if the limit set Λ(Γ) contains infinitely many (equivalently, uncountably many) elements. Exercise 9.1 Suppose that Γ is a non-elementary Fuchsian group. Prove that Γ must contain a hyperbolic element. (Hints: First argue that, apart from the identity, either Γ contains only hyperbolic elements (in which case the statement follows trivially) or that it contains a parabolic element. By replacing Γ by a conjugate subgroup, we can assume that a parabolic element γ 1 has as a fixed point and so has the form z z + b. If γ 2 is another element of Γ, consider τ(γ 2 γ1 n ) for large n.) Before we can discuss the structure of a non-elementary Fuchsian group further, we need the following topological concepts. Definition. Let (X, d) be a metric space. A subset Y X is said to be perfect if it is closed and every point of Y is a limit point of Y. Definition. Let (X, d) be a metric space. A subset Y X is said to be nowhere dense if X \ cly is dense, i.e. the complement of the closure of Y is dense. 31
32 Remarks. (i) If Y is already a closed set, then Y is nowhere dense if and only if the complement X \ Y is dense. (ii) One can often think of nowhere dense sets as sets that are topologically small in the same way that sets of measure zero are measuretheoretically small. (However, the two notions are independent in the sense that there are nowhere dense subsets of [0, 1] that have Lebesgue measure 1.) Examples. (i) Let X = R and take Y = {1/n n N} {0}. Then Λ(Y ) = {0} so that Y is not perfect. (iii) The middle-third Cantor set (the definition of which is given below) is a perfect subset of R. A non-elementary Fuchsian group has uncountably many elements. For example, the modular group has limit set equal to the entire boundary, which is clearly uncountable. The following result says that there are essentially two types of behaviour: either the limit set is the entire boundary, or it is a Cantor set. A Cantor set is defined to be a perfect nowhere dense subset of a metric space. The most well-known example of a Cantor set is the middlethird Cantor set C. The middle third Cantor set is defined by starting with the unit interval [0, 1] and removing the middle third interval leaving the set C 1 = [0, 1/3] [2/3, 1]; these two intervals then have their middle thirds removed, leaving four sub-intervals C 2. Inductively, this is repeated so that C n is obtained from C n 1 by removing the middle thirds of the 2 n intervals comprising C n 1. Then C = n=1 C n. Theorem 9.2 Let Γ be a Fuchsian group and suppose that Λ(Γ) is infinite. Then either (i) Λ(Γ) = D, or (ii) Λ(Γ) is a perfect, nowhere dense subset of D. Proof. Omitted. See Katok s book. 10 Fuchsian groups of the first and second kind Let Γ be a Fuchsian group with limit set Λ(Γ). Then heuristically there are two cases: either Λ(Γ) is big and is equal to D, or else Λ(Γ) is small and has either 0,1,2 elements or is a Cantor set. 32
33 Definition. Let Γ be a Fuchsian group. We say that Γ is a Fuchsian group of the first kind if Λ(Γ) = D. Otherwise we say that Γ is a Fuchsian group of the second kind. Remark. In particular, if Γ is an elementary Fuchsian group then Γ is of the second kind. However, there are many other examples of non-elementary Fuchsian groups that are of the second kind Fuchsian groups of the first kind Recall that a Fuchsian group is said to be of the first kind if its limit set is equal to the whole of the boundary of D. Recall also the notion of a fundamental domain. We say that an open subset F H is a fundamental domain for a Fuchsian group Γ if (i) γ Γ γ(cl(f )) = H, (ii) the images γ(f ) are pairwise disjoint; that is, γ 1 (F ) γ 2 (F ) = if γ 1 γ 2. We saw in Lecture 15 that every Fuchsian group has a fundamental domain. Indeed we gave a method for constructing a fundamental domain, namely the Dirichlet polygon. Also, recall Proposition 14.1 from the lectures; this says that any two fundamental domains have the same hyperbolic area. In this section, we state two theorems that essentially say that a Fuchsian group is of the first kind if and only if a (hence all) fundamental domain has finite area. For the first theorem we need to make an additional technical assumption that the group Γ is geometrically finite; this means that the Dirichlet polygon has finitely many sides. Theorem 10.1 Let Γ be a (geometrically finite) Fuchsian group of the first kind. Then Γ has a fundamental domain of finite hyperbolic area. The converse to this theorem (which does not need the assumption of the group being geometrically finite) gives us another method for calculating limit sets. Theorem 10.2 Let Γ be a Fuchsian group. Suppose that there exists a fundamental domain with finite hyperbolic area. Then Γ is a Fuchsian group of the first kind. Example. Consider the modular group PSL(2, Z). One fundamental domain for this group is the hyperbolic triangle with vertices at, (±1 + i 3)/2. By the Gauss-Bonnet theorem this has finite hyperbolic area π/3 (the internal angles are respectively 0, π/3, π/3). By Theorem 10.2, we see that the limit set Λ(PSL(2, Z)) of the modular group is equal to H. 33
34 10.2 Fuchsian groups of the second kind Recall that a Fuchsian group is said to be of the second kind if it is not of the first kind! This means that the limit set is not equal to the entire boundary H. There are two possibilities: (i) Λ(Γ) is a finite set, that is Γ is an elementary group, or (ii) Λ(Γ) is a Cantor set, namely a perfect, nowhere dense subset of H. We can use a version of Poincaré s theorem to generate examples of Fuchsian groups which have Cantor sets as their limit sets. Recall from Lectures 20 and 21 that Poincaré s theorem has the following form. We have a hyperbolic polygon D equipped with a set of side-pairing transformations and we assume that D has no free edges, i.e. no arcs of H form a side of D. We can then calculate the elliptic cycles and parabolic cycles. Poincaré s theorem says that if each elliptic cycle satisfies the elliptic cycle condition and each parabolic cycle satisfies the parabolic cycle condition then the side-pairing transformations generate a Fuchsian group Γ which has D as a fundamental domain. We will need a version of Poincaré s theorem that generalises the above to the cases where we include the possibilities that (i) the polygon is allowed to have free edges, and (ii) the side-pairing transformations could be arbitrary isometries (and not just Möbius transformations). Before stating this version of Poincaré s theorem, let us digress and discuss the group of all isometries of H. Consider the map γ(z) = z defined on H; this is a reflection in the imaginary axis. It is easy to check from the definition of hyperbolic length that γ is an isometry. However, it is not a Möbius transformation. Note that γ reverses orientation. In general, a reflection in any geodesic is an isometry. One can prove the following facts (see Beardon, for example): (i) The composition of two reflections in two different geodesics is a Möbius transformation. (Indeed, the composition is elliptic, parabolic or hyperbolic if and only if the two geodesics intersect in D, intersect in D, or are disjoint, respectively.) (ii) The group of orientation preserving isometries is precisely the set of Möbius transformations. (iii) The set of orientation reversing isometries is precisely the set given by composition of a reflection in a geodesic with a Möbius transformation (which could be the identity). 34
35 (iv) We let Isom(D) = {all isometries of D} denote the group of all isometries of D. Then Möb(D) is a subgroup of index 2 in Isom(D). Let D be a convex hyperbolic polygon, possibly with free edges. We assume that each side s of D is equipped with a side-pairing transformation γ s. Here we will allow any isometry of H to be a side-pairing transformation; in particular, we allow side-pairing transformations to be orientation reversing (for example, a reflection in a geodesic). We will also require the isometry γ s to act in such a way that, locally, the half-plane bounded by s containing D is mapped by γ s to the half-plane bounded by γ s (s) but opposite D. We assume that each free edge is paired with itself by the identity map. Given a vertex and a side with an end-point at that vertex, we can follow the procedure described in the lectures (see Lecture 18 and Lecture 21) to construct a cycle of vertices and an associated cycle transformation. We say that (i) a vertex v H belongs to an elliptic cycle (which we calculate as in Lecture 18), (ii) a vertex v H belongs to a parabolic cycle if the parabolic cycle constructed in Lecture 21 does not contain a vertex that is the endpoint of a free edge, (iii) a vertex v H belongs to a free cycle if the parabolic cycle constructed in Lecture 21 does contain a vertex that is the end-point of a free edge. If v is a vertex and s is a side with an end-point at v, then we denote the corresponding cycle transformation by γ v,s. This is a composition of orientation preserving isometries (i.e. Möbius transformations) and orientation reversing isometries (i.e. the composition of a Möbius transformation with a reflection in a geodesic). One can easily check that if v is a vertex on either an elliptic or parabolic cycle then γ v,s contains an even number of orientation reversing isometries; hence γ v,s is orientation preserving, i.e. a Möbius transformation. We state the following form of Poincaré s theorem. Theorem 10.3 (Poincaré s theorem in the case of free edges) Let D be a convex hyperbolic polygon, possibly with free edges. Suppose that D is equipped with a collection G of side-pairing hyperbolic isometries, possibly orientation reversing. Suppose that each free edge is paired with itself via the identity. Suppose that (i) each elliptic cycle satisfies the elliptic cycle condition, and 35
36 (ii) each parabolic cycle satisfies the parabolic cycle condition. Then the subgroup G generated by G is a discrete subgroup of Isom(H). 36
37 Remarks. 1. If the side-pairing transformations are Möbius transformations, then D is again a fundamental domain for G. Suppose that some of the side-pairing transformations are orientation reversing isometries. Then the set Γ 0 = G Möb(H) of all orientation preserving transformations in G is a Fuchsian group. We can find a fundamental domain for Γ 0 as follows: Let γ G be any orientation reversing isometry. Then D 0 = D γ(d) is a fundamental domain for Γ Suppose that all vertices lie on the boundary and every vertex is the end-point of a free edge. Then, as every vertex must belong to a free cycle, the side-pairing transformations generate a discrete subgroup Γ of Isom(H). Again, the group Γ 0 = Γ Möb(H) of all orientation preserving elements of Γ is a Fuchsian group. Example. Consider the hyperbolic quadrilateral Q pictured in Figure Let γ 1 be the orientation reversing isometry given by the composition of a s 3 D C Q s 1 s 2 γ 1 γ 2 A B s 4 Figure 10.1: The side [A, D] is paired to itself by a hyperbolic transformation followed by a reflection; as is the side [B, C] hyperbolic transformation with fixed points at A, D D with a reflection 37
38 in the geodesic [A, D]. Then γ 1 pairs the side [A, D] to itself, and maps the half-plane determined by [A, D] that contains Q to the half-plane opposite Q. Thus γ 1 is a side-pairing transformation. Similarly, we take γ 2 to be the composition of a hyperbolic transformation with fixed points at B, C D and a reflection in the geodesic [B, C]; then γ 2 is also a side-pairing transformation that pairs the side [B, C] with itself. The cycle containing the vertex A is given by: ( A s 1 ) ( ) γ 1 A s 1 id ( A s 4 ) ( A s 4 ( A As this contains the free edge s 4, this is a free cycle. Similarly, the vertices B, C, D all belong to free cycles. Hence there are no elliptic cycles and no parabolic cycles. By Poincaré s theorem, γ 1, γ 2 generate a discrete subgroup of Isom(D). Let Γ = γ 1, γ 2 Möb(D) denote the subgroup of Möbius transformations in γ 1, γ 2. Then Γ is a Fuchsian group. By the first remark above, there is a fundamental domain D 0 for Γ that contains Q. As Q has infinite area, we see that D 0 also has infinite area. Hence Γ must be a Fuchsian group of the second kind. Hence Λ(Γ) has either 0, 1, 2 elements or is a Cantor set. Now Γ contains the hyperbolic Möbius transformation γ1 2 ; this has fixed points at A and D. Hence A, D Λ(Γ). Similarly, Γ contains the hyperbolic Möbius transformation γ2 2 which has fixed points at B, C; hence B, C Λ(Γ). Hence Λ(Γ) contains at least four points. Hence Λ(Γ) is a Cantor set. Example. Let s 1 ) ). Here is a specific example related to the above construction. γ 1 (z) = 4z, γ 2 (z) = 7z 6 3z 2. We claim that γ 1, γ 2 generate a Fuchsian group with a Cantor set as its limit set. To see this, first observe that γ 1 has fixed points at 0, and that γ 2 has fixed points at 1, 2. Thus the limit set of the group Γ = γ 1, γ 2 generated by γ 1, γ 2 contains at least 4 points, hence it contains uncountably many points. It remains to check that Γ is a Fuchsian group of the second kind. Define γ 3 (z) = 2z, γ 4 (z) = 3z 2 z and observe that γ 2 3 = γ 1 and γ 2 4 = γ 2. Let σ 1 denote the reflection in the imaginary axis, and let σ 2 denote the reflection in the geodesic [1, 2]. Let γ 5 = σ 1 γ 3, γ 6 = σ 2 γ 4. Then γ 5 and γ 6 satisfy the hypotheses of the 38
39 previous example. Therefore γ 5 and γ 6 generate a discrete subgroup γ 5, γ 6 of Isom(H). It is straightforward to see that γ5 2 = γ 1 and γ6 2 = γ 2. Hence the subgroup Γ = γ 1, γ 2 is a subgroup of γ 5, γ 6. As γ 5, γ 6 is discrete, Γ must be discrete. As Γ consists of Möbius transformations, Γ is a Fuchsian group. Finally, observe that the hyperbolic quadrilateral Q with vertices at 0, 1, 2, and free edges between vertices 0, 1 and 2, has hyperbolic area. Moreover, Q is contained in a fundamental domain D for γ 5, γ 6 Möb(H). Hence D also has infinite hyperbolic area. As Γ is a subgroup of γ 5, γ 6 Möb(H), one can see (see Proposition 14.2 in the lecture notes) that any fundamental domain for Γ must also have infinite area (indeed, Γ has index 2 in γ 5, γ 6 Möb(H)). Hence by Theorem 10.1, Γ is a Fuchsian group of the second kind Further developments There are many other results regarding Fuchsian groups and their limit sets that one can go on to study. For example, if Γ is a Fuchsian group of the second kind with an uncountable limit set Λ(Γ), then it is a Cantor set (namely, a perfect, nowhere dense subset). One can show that in this case Λ(Γ) has an extremely complicated structure; indeed it is a fractal set. Recall that one way of defining a fractal set is as a set with a noninteger dimension (the dimension of a point is 0, the dimension of a line is 1, etc). One way of associating a dimension to this set is via its Hausdorff dimension. One can give an explicit formula for the Hausdorff dimension of the limit set. 39
Metric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
Notes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
Metric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
4. Expanding dynamical systems
4.1. Metric definition. 4. Expanding dynamical systems Definition 4.1. Let X be a compact metric space. A map f : X X is said to be expanding if there exist ɛ > 0 and L > 1 such that d(f(x), f(y)) Ld(x,
CHAPTER 1 BASIC TOPOLOGY
CHAPTER 1 BASIC TOPOLOGY Topology, sometimes referred to as the mathematics of continuity, or rubber sheet geometry, or the theory of abstract topological spaces, is all of these, but, above all, it is
Continued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
Lecture 4 DISCRETE SUBGROUPS OF THE ISOMETRY GROUP OF THE PLANE AND TILINGS
1 Lecture 4 DISCRETE SUBGROUPS OF THE ISOMETRY GROUP OF THE PLANE AND TILINGS This lecture, just as the previous one, deals with a classification of objects, the original interest in which was perhaps
MA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: [email protected] Proof: For any element x of the empty set, x is also an element of every set since
2. Length and distance in hyperbolic geometry
2. Length and distance in hyperbolic geometry 2.1 The upper half-plane There are several different ways of constructing hyperbolic geometry. These different constructions are called models. In this lecture
Mathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
Ideal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
Metric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
ON FIBER DIAMETERS OF CONTINUOUS MAPS
ON FIBER DIAMETERS OF CONTINUOUS MAPS PETER S. LANDWEBER, EMANUEL A. LAZAR, AND NEEL PATEL Abstract. We present a surprisingly short proof that for any continuous map f : R n R m, if n > m, then there
The Ideal Class Group
Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned
How To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
The Banach-Tarski Paradox
University of Oslo MAT2 Project The Banach-Tarski Paradox Author: Fredrik Meyer Supervisor: Nadia S. Larsen Abstract In its weak form, the Banach-Tarski paradox states that for any ball in R, it is possible
Introduction to Topology
Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................
G = G 0 > G 1 > > G k = {e}
Proposition 49. 1. A group G is nilpotent if and only if G appears as an element of its upper central series. 2. If G is nilpotent, then the upper central series and the lower central series have the same
Group Theory. Contents
Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation
TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS
TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS VIPUL NAIK Abstract. In this journey, we are going to explore the so called separation axioms in greater detail. We shall try to understand how these axioms
SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
INTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
Surface bundles over S 1, the Thurston norm, and the Whitehead link
Surface bundles over S 1, the Thurston norm, and the Whitehead link Michael Landry August 16, 2014 The Thurston norm is a powerful tool for studying the ways a 3-manifold can fiber over the circle. In
I. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
Large induced subgraphs with all degrees odd
Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part II: Group Theory
Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN Part II: Group Theory No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Version: 1.1 Release: Jan 2013
Classification and Structure of Periodic Fatou Components
Classification and Structure of Periodic Fatou Components Senior Honors Thesis in Mathematics, Harvard College By Benjamin Dozier Adviser: Sarah Koch 3/19/2012 Abstract For a given rational map f : Ĉ Ĉ,
SOLUTIONS TO ASSIGNMENT 1 MATH 576
SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts
MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao [email protected]
Integer Polynomials June 9, 007 Yufei Zhao [email protected] We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
UNIFORMLY DISCONTINUOUS GROUPS OF ISOMETRIES OF THE PLANE
UNIFORMLY DISCONTINUOUS GROUPS OF ISOMETRIES OF THE PLANE NINA LEUNG Abstract. This paper discusses 2-dimensional locally Euclidean geometries and how these geometries can describe musical chords. Contents
INCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
Mathematical Research Letters 1, 249 255 (1994) MAPPING CLASS GROUPS ARE AUTOMATIC. Lee Mosher
Mathematical Research Letters 1, 249 255 (1994) MAPPING CLASS GROUPS ARE AUTOMATIC Lee Mosher Let S be a compact surface, possibly with the extra structure of an orientation or a finite set of distinguished
9 More on differentiation
Tel Aviv University, 2013 Measure and category 75 9 More on differentiation 9a Finite Taylor expansion............... 75 9b Continuous and nowhere differentiable..... 78 9c Differentiable and nowhere monotone......
Mathematics Review for MS Finance Students
Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
THE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
DECOMPOSING SL 2 (R)
DECOMPOSING SL 2 R KEITH CONRAD Introduction The group SL 2 R is not easy to visualize: it naturally lies in M 2 R, which is 4- dimensional the entries of a variable 2 2 real matrix are 4 free parameters
PSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2
PSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2 Abstract. We prove a Bruckner-Garg type theorem for the fiber structure of a generic map from a continuum X into the unit interval I. We
Estimating the Average Value of a Function
Estimating the Average Value of a Function Problem: Determine the average value of the function f(x) over the interval [a, b]. Strategy: Choose sample points a = x 0 < x 1 < x 2 < < x n 1 < x n = b and
Geometric Transformations
Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted
= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
GROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
FIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.
FIRST YEAR CALCULUS WWLCHENW L c WWWL W L Chen, 1982, 2008. 2006. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It It is is
No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
Mathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)
Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work
Chapter 7. Continuity
Chapter 7 Continuity There are many processes and eects that depends on certain set of variables in such a way that a small change in these variables acts as small change in the process. Changes of this
Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes)
Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes) by Jim Propp (UMass Lowell) March 14, 2010 1 / 29 Completeness Three common
The Open University s repository of research publications and other research outputs
Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:
ORIENTATIONS. Contents
ORIENTATIONS Contents 1. Generators for H n R n, R n p 1 1. Generators for H n R n, R n p We ended last time by constructing explicit generators for H n D n, S n 1 by using an explicit n-simplex which
Chapter 7. Permutation Groups
Chapter 7 Permutation Groups () We started the study of groups by considering planar isometries In the previous chapter, we learnt that finite groups of planar isometries can only be cyclic or dihedral
Chapter 7: Products and quotients
Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products
Understanding Basic Calculus
Understanding Basic Calculus S.K. Chung Dedicated to all the people who have helped me in my life. i Preface This book is a revised and expanded version of the lecture notes for Basic Calculus and other
3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
Lecture 17 : Equivalence and Order Relations DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion
GENERATING SETS KEITH CONRAD
GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors
Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
Elements of Abstract Group Theory
Chapter 2 Elements of Abstract Group Theory Mathematics is a game played according to certain simple rules with meaningless marks on paper. David Hilbert The importance of symmetry in physics, and for
RANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis
RANDOM INTERVAL HOMEOMORPHISMS MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis This is a joint work with Lluís Alsedà Motivation: A talk by Yulij Ilyashenko. Two interval maps, applied
Fixed Point Theorems in Topology and Geometry
Fixed Point Theorems in Topology and Geometry A Senior Thesis Submitted to the Department of Mathematics In Partial Fulfillment of the Requirements for the Departmental Honors Baccalaureate By Morgan Schreffler
ISOMETRIES OF R n KEITH CONRAD
ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x
Numerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number
DEFINITION 5.1.1 A complex number is a matrix of the form. x y. , y x
Chapter 5 COMPLEX NUMBERS 5.1 Constructing the complex numbers One way of introducing the field C of complex numbers is via the arithmetic of matrices. DEFINITION 5.1.1 A complex number is a matrix of
2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
Let H and J be as in the above lemma. The result of the lemma shows that the integral
Let and be as in the above lemma. The result of the lemma shows that the integral ( f(x, y)dy) dx is well defined; we denote it by f(x, y)dydx. By symmetry, also the integral ( f(x, y)dx) dy is well defined;
ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES.
ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES. O. N. KARPENKOV Introduction. A series of properties for ordinary continued fractions possesses multidimensional
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
Solutions to Homework 10
Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x
1 Local Brouwer degree
1 Local Brouwer degree Let D R n be an open set and f : S R n be continuous, D S and c R n. Suppose that the set f 1 (c) D is compact. (1) Then the local Brouwer degree of f at c in the set D is defined.
POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS
POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).
You know from calculus that functions play a fundamental role in mathematics.
CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.
Mathematics for Econometrics, Fourth Edition
Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents
A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries
Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do
Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
Math 181 Handout 16. Rich Schwartz. March 9, 2010
Math 8 Handout 6 Rich Schwartz March 9, 200 The purpose of this handout is to describe continued fractions and their connection to hyperbolic geometry. The Gauss Map Given any x (0, ) we define γ(x) =
Hyperbolic Groups Lecture Notes
Hyperbolic Groups Lecture Notes James Howie Heriot-Watt University, Edinburgh EH14 4AS Scotland [email protected] Introduction This is a revised and slightly expanded set of notes based on a course of
1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
Section 1.1. Introduction to R n
The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to
Applied Algorithm Design Lecture 5
Applied Algorithm Design Lecture 5 Pietro Michiardi Eurecom Pietro Michiardi (Eurecom) Applied Algorithm Design Lecture 5 1 / 86 Approximation Algorithms Pietro Michiardi (Eurecom) Applied Algorithm Design
MEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich
MEASURE AND INTEGRATION Dietmar A. Salamon ETH Zürich 12 May 2016 ii Preface This book is based on notes for the lecture course Measure and Integration held at ETH Zürich in the spring semester 2014. Prerequisites
CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
How To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra
54 CHAPTER 5 Product Measures Given two measure spaces, we may construct a natural measure on their Cartesian product; the prototype is the construction of Lebesgue measure on R 2 as the product of Lebesgue
INTRODUCTION TO TOPOLOGY
INTRODUCTION TO TOPOLOGY ALEX KÜRONYA In preparation January 24, 2010 Contents 1. Basic concepts 1 2. Constructing topologies 13 2.1. Subspace topology 13 2.2. Local properties 18 2.3. Product topology
Graphs without proper subgraphs of minimum degree 3 and short cycles
Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract
Classification of Cartan matrices
Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms
1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
How To Know If A Domain Is Unique In An Octempo (Euclidean) Or Not (Ecl)
Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness
