next up previous contents index
Next: Manifolds Up: Contents Previous: Contents

Preliminary material

  These notes are being written for the course 22M:203, Fall 1998. Some of the content of the first several chapters is based on materials from my book Elementary Topology, copywrited by Prentice-Hall, 1998.

In fact this first version of these notes is just a hastily constructed pastiche of this material which we will improve on (and expand) during the semester.

It is assumed that the student has had an exposure to topology, including at least basic definitions and a few examples in algebraic topology such as the fundamental group and homology groups.

In the next Chapter we introduce the idea of manifold as a subset of ${ \bf R^n}$.For completness, here are some basic definitions for refenence as well as to establish notations:

Definition 7366

We define n-dimensional space, denoted ${ \bf R^n}$, to be the set of all ordered n-tuples of real numbers, together with a notion of distance, $\delta $. If $p=(x_1, x_2,\ldots,x_n)$ and $q=(y_1, y_2,\ldots, y_n)$ are two points of ${ \bf R^n}$, the distance between these points denoted by $\delta (p,q)$ and defined by $\delta (p,q) = \sqrt{\sum_{i=1}^n (x_i-y_i)^2}$       

Definition 7383

 Let $p \in {\bf R^n}$, and $\epsilon $ be a given number, $\epsilon \gt 0$. Then the open n-dimensional ball in ${ \bf R^n}$ with center p and radius $\epsilon $ is defined to be the set $\{ q \in {\bf R^n} \mid
\delta (p$, $q) < \epsilon \}$. We denote this set by $N_\epsilon (p)$. We also refer to $N_\epsilon (p)$ as an $\epsilon $-neighborhood of p in ${ \bf R^n}$.    

More generally we have

Definition 7396

Let X be a subset of ${ \bf R^n}$ with $p \in X$. Given a number $\epsilon $, with $\epsilon \gt 0$, we define an $\epsilon $-neighborhood of p in X to be the subset of X, $N_\epsilon (p$, $X) = N_\epsilon (p) \cap X$.   

Definition 7407

If $p \in {\bf R^n}$ and $\epsilon $ is a number, $\epsilon \gt 0$, then the closed n-dimensional ball with center p and radius $\epsilon $ is defined to be $\{ q \in {\bf R^n} \mid \delta (p, q)
\leq \epsilon \}$. We denote this set by $ \overline{N}_{\epsilon}(p) $, or sometimes, $B_\epsilon (p)$.   

Definition 7432

Let $a \mbox{ and } b$ be numbers with a < b. The following subsets are all called intervals:

   

Definition 7439

Let $A \subseteq X \subseteq {\bf R^n}$. We say that A is dense in X if every open subset of X contains a point of A.    

Example 7447

 

Let Q denote the rational numbers, and Z denote the irrational numbers. Then Q and Z are dense in ${ \bf R^1}$. $\diamondsuit$

 

Remark 7464

 It is sometimes useful to note that any subset of ${ \bf R^n}$ has a countable dense subset. Let in ${ \bf R^n}$, let $\mathcal G$ be the set of all open neighborhoods, $N_\epsilon (p)$ where $\epsilon $ is a rational number and each of the n coordinates of p is a rational number; $\mathcal G$ will have countably many elements. For each $N_\epsilon (p) \in \mathcal G$, chose one point, call it $x^p_\epsilon$, of $X \cap N_\epsilon (p)$, (if this set is non-empty). Then $\{ x^p_\epsilon \}$ will be a countable subset of X, and one can verify that it is a dense subset of X. $\diamondsuit$

The definition of limit point is not completely standard. Here is what we will use:

Definition 7478

Let $A \subseteq X \subseteq {\bf R^n}$, $x \in X$. We is say that x is a limit point of A in X if every open subset, U, of X which contains x contains a point of $A - \{x\}$. (That is, U contains a point of A other than x.)    

Here are some useful subsets of ${ \bf R^n}$

 
Figure 0-1: On the left the Euclidian half-plane, R2+, see Definition 0.10. On the right the open Euclidian half-plane, $\stackrel {\circ}{R^2_+}$, see Definition 0.11. Note that R2+ contains points of the y-axis but $\stackrel {\circ}{R^2_+}$ does not.  
\begin{figure}
\begin{center}
\bigskip {\epsfxsize=2.0in \leavevmode\epsffile{figBChap2.eps}}\end{center}\end{figure}

Definition 7493

We define n-dimensional half space to be:
$R^n_+ = \{(x_1,x_2, \ldots,x_n)\in {\bf R^n} \mid 0 \leq x_1 \})$. (See Figure 0-1).    

Definition 7497

We define open n-dimensional half space to be:
$\stackrel {\circ}{R^n_+} = \{(x_1, x_2, \ldots,x_n)\in {\bf R^n} \mid 0 < x_1 \})$. (See Figure 0-1).    

For certain subsets of ${ \bf R^n}$, generalized cylindrical coordinates may be more convenient. Here we locate points of ${ \bf R^n}$ using polar coordinates in the first two coordinates, Cartesian coordinates for the rest.

Definition 7504

Cylindrical coordinates for $(x_1, x_2, \ldots, x_n) \in { \bf R^n}$ are $(r, \theta, x_3, \ldots, x_n)$ where $r = \sqrt{x_1^2 + x_2^2} \mbox{ and } \theta = \arctan (x_2/x_1) \mbox{ if }x_1 \neq 0 $.      

As with polar coordinates, points have multiple descriptions such as $(1,0,2,3) = (1,2 \pi,2,3)$ and (0,0,2,3) = (0,1,2,3).


 
Figure 0-2: Eight pages in ${ \bf R^3}$, see Example 0.14  
\begin{figure}
\begin{center}
\bigskip {\epsfxsize=2.0in \leavevmode\epsffile{pages.eps}}\end{center}\end{figure}

Definition 7515

 

For an angle, $\alpha$, the subset $H^{n-1}_\alpha$ is defined, using generalized cylindrical coordinates, $H^{n-1}_\alpha = \{ (r, \theta, x_3, \ldots, x_n) \in { \bf R^n} \mid \theta = \alpha\}$. Such a subset is called an (n-1)-dimensional page of ${ \bf R^n}$ .  

Example 7527

Figure 0-2 we indicate eight pages , H20, $H^2_{\pi/4}$, $H^2_{\pi/2}$,$ H^2_{3 \pi/4}$, $H^2_{\pi}$, $H^2_{5 \pi/4}$, $H^2_{3\pi/2}$, and $H^2_{7 \pi/4}$ in ${ \bf R^3}$. Only a square on each page is shown. The term ``page'' comes from the following image--if we take a book and open all the way until the front cover meets the back cover the pages of the book will fan out and look something like Figure 0-2. $\diamondsuit$

 

Definition 7533

We define the n-dimensional sphere to be the subset $S^n = \{\vec{x} \in 
{\bf R}^{n+1} \mid \delta (\vec{x}, \vec{0}) = 1 \}$ where $\vec{0}$ denotes the origin of ${\bf R}^{n+1}$. (See Figure 0-3).    


 
Figure 0-3: On the left is $S^0 \subseteq \bf R^1$. It consists of the two numbers 0 and 1. In the middle is $S^1 \subseteq \bf R^2$. It is the unit circle in the plane. On the right is $S^3 \subseteq \bf R^3$. It is a surface, the unit sphere. See Definition 0.15. 
\begin{figure}
\begin{center}
\bigskip {\epsfxsize=3.0in \leavevmode\epsffile{threeSpheres.eps}}\end{center}\end{figure}

Definition 7545

The standard n-ball ( sometimes called the unit n-ball) in ${ \bf R^n}$ is the set $D^n = \{ \vec{x} \in { \bf R^n} \mid \delta (\vec{x}, \vec{0}) \leq 1 \} $. (See Figure 0-4).    


 
Figure 0-4: On the left is $D^0 \subseteq \bf R^0$. It is a single point. In the middle-left is $D^1 \subseteq \bf R^1$. It is the interval [-1, 1] in the line. On the middle-right is $D^2 \subseteq \bf R^2$. It is a disk whose edge is the unit circle. On the right is $D^3 \subseteq \bf R^3$. It is solid ball consisting of all points on the unit sphere and also those inside it, see Definition 0.16. Unfortunately there is no simple graphical method to distinguish a drawing of S2, as in Figure 0-3, from a drawing of D3.  
\begin{figure}
\begin{center}
\bigskip {\epsfxsize=3.0in \leavevmode\epsffile{fourBalls.eps}}\end{center}\end{figure}

Remark 7571

   

So, S1 is the unit circle in the plane; S2 is the standard unit sphere in space. Also, S0 consists of two points-the numbers -1 and 1 of ${ \bf R^1}$, (see Figure 0-3).

Also, D1 is the closed interval [-1, 1] in ${ \bf R^1}$, D2 is the unit disk in the plane, D3 the unit ball in ${ \bf R^3}$, see Figure 0-4 and, for any n, $S^n \subseteq D^{n+1}$. $\diamondsuit$ 

Definition 7582

The standard n-simplex in ${\bf R}^{n+1}$, denoted $\Delta ^n$, is defined by $\Delta ^n = \{(x_1, x_2, \ldots,x_{n+1})\in {\bf R}^{n+1} \mid$ $ x_1+ \cdots + x_{n+1} = 1$ with $0 \leq x_i$ for all i, $1 \leq i \leq n+1$ $\}$.   


 
Figure 0-5: On the left, the standard 1-simplex, $\Delta^1$, a subset of ${ \bf R^2}$. On the right, the standard 2-simplex, $\Delta^2$, a subset of ${ \bf R^3}$. See Definition 0.18  
\begin{figure}
% latex2html id marker 526
\begin{center}
\bigskip {\epsfxsize=2.0in \leavevmode\epsffile{simplexes.eps}}\end{center}\end{figure}

Example 7607

standard 1-simplex in the plane is a line segment with endpoints (1,0) and (0,1). It is the portion of the line with equation x1 + x2 = 1 which lies in the first quadrant of the plane where $0 \leq x_1$ and $0 \leq x_2$. The standard 2-simplex in space is a (two-dimensional) triangle with vertices (1, 0, 0), (0, 1, 0) and (0, 0, 1), since it is the portion of the plane x1 + x2 + x3 = 1 contained in the first octant of three-dimensional space, (see Figure 0-5).

$\diamondsuit$       


 
Figure 0-6: Figure for stereographic projection of a 2-sphere mapping minus the ``south pole'', homeomorphically, to the x-y-coordinate plane, see Proposition 0.20.  
\begin{figure}
\begin{center}
\bigskip {\epsfxsize=2.0in \leavevmode\epsffile{stereo.eps}}\end{center}\end{figure}

Here is an important example of a homeomorphism see Figure 0-6.

Proposition 7634

Let Sn be the standard sphere in ${\bf R}^{n+1}$ and let $P \in S^n$ be the point $P = (0, 0, \ldots , 0, -1)$. Then $S^n -\{P\}$ is homeomorphic to ${ \bf R^n}$.

In fact this homeomorphism can be described as follows: let $x \in S^n -\{P\}$ and let lx be the line in ${\bf R}^{n+1}$ containing x and P. Identify ${ \bf R^n}$ as a coordinate hyperplane of ${\bf R}^{n+1}$ as its image, under the standard inclusion map. Then h(x) is defined to be the intersection of the line lx and the hyperplane ${ \bf R^n}$. The map h is called stereographic projection.

        

Proof: Suppose $x \in S^n$, $x = (x_1, x_2, \ldots , x_n, x_{n+1} )$.In vector notation we can write lx as $l_x = \vec{P} + t (\vec{x} -\vec{P})$. In term of coordinates this is:

\begin{displaymath}
(t x_1, t x_2, \ldots, t x_n, -1 + t ( x_{n+1} +1) ).\end{displaymath}

The intersection we want is the point on lx, where the last coordinate is zero. This happens if $t = \frac{1}{ x_{n+1} +1}$.

Thus we see that

\begin{displaymath}
h((x_1, x_2, \ldots , x_n, x_{n+1} )) = ( \frac{x_1}{ x_{n+1...
 ...\frac{x_2}{ x_{n+1} +1}, \ldots , \frac{x_n}{ x_{n+1} +1}, 0 ) \end{displaymath}

Using this formulation, we can now verify that h is, in fact, a homeomorphism.

width4pt height6pt depth1.5pt

In the next definitions, we use vector notation for ${ \bf R^n}$. If M is an $m \times n$ matrix $M \vec{x}$ is matrix multiplication where we write the m-dimensional vector, $\vec{x}$, as a single column matrix. Also |M| denotes the determinant of a square matrix..

Definition 7663

If M is an $m \times n$ matrix and $\vec{B}$ is an n-dimensional vector, we can define a function $F:R^m \to R^n$ by $F(\vec{x}) = M \vec{x} + \vec{B}$. Such a function is called an affine transformation or affine map. In the case that m=n, and $\vert M\vert \neq 0$, then we say that F is a non-singular affine map.

An affine map with $\vec{B} = \vec{0}$ is called a linear transformation or linear map. A non-singular affine map with $\vec{B} = \vec{0}$ is called a non-singular linear transformation or non-singular linear map          

Remark 7670

   

An affine map $f \colon { \bf R^1} \to { \bf R^1}$ is simply a function of the form f(x) = m x +b; f is non-singular means $m \neq 0$.

  $\diamondsuit$

A critical definition we use here, common in linear algebra, is that of an orthogonal matrix. Here MT denotes the transpose of M, that is if M = [ai j], then MT = [aj i]. 

Definition 7680

    Let M be an $n \times n$ matrix. We say M is an orthogonal matrix if MT = M-1.

Remark 7698

          

We establish a few properties of an orthogonal matrix.

If M is an orthogonal matrix, then M-1 is also orthogonal. If M is orthogonal, then MT = M-1. Take the transpose of both sides of this equation, and we get M = (M-1)T. Since M is the inverse of M-1, this last equation can be written (M-1)-1 = (M-1)T, which verifies that M-1 is orthogonal.

If M is an orthogonal matrix, then the determinant of M is +1 or -1. We have MT M = I. But $\det{M^T} = \det{M}$, so taking the determinant of both sides of the previous equation, and since the determinant of the product is the product of the determinants, we get $\det{M} \det{M} = 1$, thus $\det{M} = \pm 1$. $\diamondsuit$

Definition 7704

An affine map $F:R^n \to R^n$ defined by $F(\vec{x}) = M \vec{x} + \vec{B}$ is called a rigid motion of ${ \bf R^n}$, if M is an orthogonal matrix.

   

Example 7729

         

If $M = \left( ^{ \ \ \cos (\theta)\ \sin (\theta)}_{- \sin (\theta)\ \cos (\theta)} \right)$, $x \in R^2$, function $F(\vec{x}) = M \vec{x}$ corresponds to a counter-clockwise rotation of angle $\theta$ about the origin. The inverse of M corresponds to clockwise rotation of angle $\theta$, with matrix $M^{-1} = \left( ^{ \ \ \cos (-\theta)\ \sin (-\theta)}_{- \sin (-\theta)\ \cos ...
 ...cos (\theta)\ -\sin (\theta)}_{ \sin (\theta)\ \ \ \cos (\theta)} \right) = M^T$. Thus M is orthogonal.

The matrix $ \left( ^{ 1\ ~~0}_{ 0\ -1} \right)$ corresponds to reflection in the x-axis, while $ \left( ^{ -1\ 0}_{~~0\ 1} \right)$ corresponds to reflection in the y-axis.

Next some examples in ${ \bf R^3}$. The matrix

\begin{displaymath}
R_z(\theta) = \left( \begin{array}
{ccc}
 \cos (\theta) & \s...
 ...\theta) & \cos (\theta) & 0 \  0 & 0 & 1
 \end{array} \right) \end{displaymath}

corresponds to a rotation about the z axis of angle $\theta$. Similarly

\begin{displaymath}
R_y(\theta) = \left( \begin{array}
{ccc}
 \cos (\theta) & 0 ...
 ... \  - \sin (\theta) & 0 & \cos (\theta) 
 \end{array} \right) \end{displaymath}

corresponds to a rotation of angle $\theta$ about the y axis.

The matrix

\begin{displaymath}
\left( \begin{array}
{ccc}
 0 & 0 & 1 \  0 & 1 & 0 \  1 & 0 & 0 
 \end{array} \right) \end{displaymath}

``interchanges the x-axis and the z-axis''. $\diamondsuit$ 

In the term ``rigid motion'' ``rigid '' refers to the fact is that distances are preserved as the next proposition shows.

Proposition 7736

   

Suppose we have a rigid motion, F, in ${ \bf R^n}$. If $\vec{x} \mbox{ and } \vec{y}$ are two vectors in ${ \bf R^n}$ then $\delta(\vec{x}, \vec{y} ) = \delta(F(\vec{x}), F(\vec{y})).$ 

Proof: Recall that

\begin{displaymath}
\delta(\vec{x}, \vec{y} ) = \sqrt{(\vec{x} -\vec{y}) \cdot (...
 ...} -\vec{y})} = \sqrt{(\vec{x} -\vec{y})^T (\vec{x} -\vec{y})} ,\end{displaymath}

where in this last equality we are expressing the dot product using matrix notation.

Write $F(\vec{x}) = M \vec{x} + \vec{B}$. Then,

\begin{displaymath}
(\delta(F(\vec{x}), F(\vec{y})))^2 = \left( F(\vec{x})- F(\vec{y})\right) \cdot \left( F(\vec{x}) - F(\vec{y}) \right) = \end{displaymath}

\begin{displaymath}
((M \vec{x} + \vec{B}) - (M \vec{y} + \vec{B})) \cdot ((M \vec{x} + \vec{B}) - (M \vec{y} + \vec{B})) = \end{displaymath}

\begin{displaymath}
M (\vec{x} - \vec{y} ) \cdot M (\vec{x} - \vec{y} ) =
(M (\vec{x} - \vec{y} ))^T M (\vec{x} - \vec{y} ) = \end{displaymath}

\begin{displaymath}
( (\vec{x} - \vec{y} )^T M^T ) M (\vec{x} - \vec{y} ) = 
 (\vec{x} - \vec{y} )^T (M^T M) (\vec{x} - \vec{y} ) = \end{displaymath}

\begin{displaymath}
(\vec{x} - \vec{y} )^T I (\vec{x} - \vec{y} ) = (\vec{x} - \...
 ...} ) \cdot (\vec{x} - \vec{y} ) =
 (\delta(\vec{x}, \vec{y}))^2.\end{displaymath}

Taking square roots it follows that $ \delta(F(\vec{x}), F(\vec{y}) = \delta(\vec{x}, \vec{y})$. width4pt height6pt depth1.5pt

Here are two standard constructions we will use several times in this book.

Definition 7753

Suppose $X \subseteq { \bf R^n} \subseteq { \bf R^{n+1}}$ and let $p \in {\bf R^n}$ be a point whose last coordinate is non-zero. Then the cone on X from p is the union of all line segments in ${\bf R}^{n+1}$ from p to a point of X.

 

 

Definition 7767

Suppose $X \subseteq { \bf R^n} \subseteq { \bf R^{n+1}}$ and let $p, q \in { \bf R^n}$ be a points with the last coordinate of p is positive the last coordinate of q is negative. Then the suspension of X from p and q is the union of all line segments in ${\bf R}^{n+1}$ from p to a point of X and from q to a point of X.

 

 

Example 7771

we consider $S^1 \subseteq { \bf R^2} \subseteq { \bf R^3}$, then the cone from any point is, geometrically, a cone. $\diamondsuit$

 

If we have $A \subseteq X \subseteq {\bf R^n}$, the concept of closure gives us a way of associating to A a (possibly larger) closed subset of X. The next definition is a way of associating to A a (possibly smaller) open subset of X.

Definition 7792

Suppose $a \in A \subseteq X \subseteq { \bf R^n} $; we say a is an interior point of A in X, if there is an open subset, U, of X with $a \in U \subseteq A$.

The subset of A consisting of all interior points of A is called the interior of A. This is denoted by int(A,X). As with closure, if the set X is understood in context, one often uses the notation int(A).

       

Proposition 7807

     

Suppose $A \subseteq X \subseteq {\bf R^n}$ then

 

Remark 7814

    

Open subsets can be defined in terms of interior points. It follows from Proposition 0.32 that if $ U \subseteq X \subseteq { \bf R^n} $, U is an open subset of X if and only if every point of U is an interior point of U. $\diamondsuit$

Definition 7828

Suppose $a \in A \subseteq X \subseteq { \bf R^n} $; we say a is a boundary point of A in X if $a \in \overline{A} \cap \overline{X - A}$. (Note: the closures are closures in X.)

The set of boundary points of A in X is called the boundary of A in X, denoted Bd(A).

       

Remark 7834

    

If $A \subseteq X \subseteq {\bf R^n}$, then the boundary of A is a closed subset of X, since it is the intersection of closed subsets. $\diamondsuit$

Proposition 7840

    If $A \subseteq X \subseteq {\bf R^n}$, then the interior of A and the boundary of A are disjoint sets, whose union is A. width4pt height6pt depth1.5pt  

Here are a few basic facts relating closure, boundary and interior of a subset to Cartesian products.

Proposition 7848

       

Suppose $A \subseteq X \subseteq {\bf R^n}$ and $B \subseteq Y \subseteq { \bf R^m}$ then

 

Remark 7855

    

If A and B are closed subsets then $A = Cl_X (A) \mbox{ and } B = Cl_Y (B)$ and so the first formula of Proposition 0.37 c) simplifies to the more easily remembered:

\begin{displaymath}
Bd(A \times B) = \big( Bd(A) \times B \big) \cup \big( A \times Bd(B)\big) .\end{displaymath}

and

\begin{displaymath}
\big(Bd(A) \times B \big) \cap \big( A \times Bd(B)\big) = Bd(A) \times Bd(B). \hspace{.2 in}\diamondsuit
 \end{displaymath}

 

 
Figure 0-7: An example of the boundary of the product $D^2 \times I$, see Example 0.39. On the upper left is shown all of $Bd(D^2 \times I)$, the upper right shows $Bd(D^2) \times I$, and at the lower left is shown $D^2 \times Bd(I)$  
\begin{figure}
\begin{center}
\bigskip {\epsfxsize=2.0in \leavevmode\epsffile{cylinder.eps}}\end{center}\end{figure}

Example 7881

   

The formulas of Proposition 0.37 c) would benefit from an example. Suppose A is the closed unit disk in ${ \bf R^2}$ and B is the unit interval in ${ \bf R^1}$. Then Bd(A) is the unit circle and Bd(B) is a two point set consisting of the two numbers 0 and 1.

Since A and B are closed subsets, we may use the simplified formula of Remark 0.38.

$A \times B$ is a cylindrical solid in ${ \bf R^3}$ and $Bd(A \times B)$ is the ``surface of the cylindrical solid'', see Figure 0-7, upper left. Note $Bd(A \times B)$ is the union of the cylindrical surface, $Bd(A) \times B $, which is the ``side of the solid cylinder'', Figure 0-7, upper right, and $ A \times Bd(B)$, the two disks comprising the top and bottom , Figure 0-7, lower left. The intersection $Bd(A) \times B \cap A \times Bd(B)$ consists of two disjoint circles. $\diamondsuit$

 

Definition 7893

Suppose $X \subseteq {\bf R^n}$, $f\colon I \to X$and $g\colon I \to X$ are paths in X with f(1) = g(0). Define a path $f\ \ast \ g$ in X called the concatenation of f and g by

\begin{displaymath}
% latex2html id marker 1332
f \ast g (t) = \left\{ \begin{ar...
 ... & \mbox{if $\frac{1}{2} \leq t \leq 1$}
 \end{array} \right. .\end{displaymath}

   

This final example of this Chapter, especially for the irrational angle case, is an interesting, non-trivial one. In a future Chapter, we will re-state the problem with a new perspective, Example 0.44.

Example 7989

      Let C denote the unit circle in the plane, and let $X_\theta $ be the set of points of C corresponding to all multiples of a given angle $\theta$. That is, write $x_\theta = (\sin(\theta), \cos(\theta))$ and let $X_\theta = \{x_{n \theta } \}_{n \in N} $, N the natural numbers.

We first note that $X_\theta $ will be a finite set if and only if $\theta$ is a rational multiple of $2 \pi$. Suppose $\theta$ is a rational multiple of $2 \pi$ and write $\theta = \frac{p}{q} 2 \pi$, where p and q are positive integers, the fraction written in reduced form. Then $X_\theta $ will consist of q points: $X_\theta = \{\theta, 2 \theta, \ldots q \theta \}$. Conversely, if $X_\theta $ is finite, there there must be a p and a q such that $p \theta = q \theta + N 2 \pi$ and $\theta = \frac{N}{p-q} 2 \pi$.

Thus, if $\theta$ is an irrational multiple of $2 \pi$, $X_\theta $ is infinite. We next claim that, in this case, $X_\theta $ is a dense subset of C. We first focus on the special case of x0 = (1,0), and show that x0 is a limit point of $X_\theta $. We show that, for any $\epsilon \gt 0$, there is a point, $x_\alpha$, of $X_\theta $ whose distance from x0 is less than $\epsilon $.

Find an integer N so that $4/N < \epsilon$. Divide C into N subarcs: $A_1, \ldots A_N$ where $A_i = \{ x_\theta \colon 2 \pi (i-1) \leq \theta \leq 2 \pi i \}$. (The reason for using 4/N is to insure that distance between any two points of Ai is less than $\epsilon $. A look at the case $\epsilon =1$ , N=4 will clarify this point. The number 4 is just a continent choice of a number greater than $\pi$.) Since $X_\theta $ is infinite, we can find some k such that Ak contains two points, $p \theta$ and $q \theta$, of $X_\theta $.Consider the subset of $X_\theta $ , $Y_\theta = \{x_{n (p-q) \theta } \}_{n \in N} $. Consecutive points of $Y_\theta$ are a distance less than $\epsilon $ apart, so one point, $x_\alpha$, of $Y_\theta$, must lie in A1, thus $\delta (x_\alpha, x_0) < \epsilon$.

We have shown that x0 is a limit point of $X_\theta $. There are a number of ways to show that any $x_\phi \in X_\theta $ is also a limit point. The simplest is to verify that, given any $\epsilon \gt 0$, $\delta ( x_{\phi +\alpha}, x_\phi) < \epsilon$. $\diamondsuit$

Suppose $X \subseteq {\bf R^n}$, function $f \colon X \rightarrow X$ is continuous. We can derive an infinite set of continuous functions from X to itself, namely $\{f$, $f\circ f$, $f\circ f\circ f$, ...$\}$.

Definition 7978

   

The composition $f\circ f$ is called the second iterate of f; the composition of n copies of f is called the n-th iterate of f, denoted f(n). We identify f(1) with f.  

Definition 7987

  Suppose $X \subseteq {\bf R^n}$, and also have a continuous function $f \colon X \rightarrow X$, $x \in X$. The set of all iterates of x under f is call orbit of x under f.  

 

Example 8003

$f \colon S^1 \to S^1$ be rotation by an angle $\theta$.We can restate the results of Example 0.41 as follows. Suppose $x \in S^1$. If $\theta$ is a rational multiple of $2 \pi$, then the orbit of x under f is a finite subset. If $\theta$ is a irrational multiple of $2 \pi$, the orbit of x is dense in S1. $\diamondsuit$

 


next up previous contents index
Next: Manifolds Up: Contents Previous: Contents
Dennis Roseman
8/27/1998