magnification 1600
\parskip 10pt
\parindent 0pt
\hoffset -0.3truein
\hsize 7truein

\def\R{{\bf R}}
\def\C{{\bf C}}
\def\x{{\bf x}}
\def\y{{\bf y}}
\def\e{{\bf e}}
\def\i{{\bf i}}
\def\j{{\bf j}}
\def\k{{\bf k}}
\def\ep{\epsilon}
\def\f{\vskip 10pt}
\def\u{\vskip -8pt}

Quiz 2 - ?


\underbar{Section 3}

Define equivalence relation.


A relation $<$ on a set A is called a simple order (or linear order of order relation) if


a is an immediate predecessor of b (or b is an immediate successor of a) if


The dictionary order relation on $A \times B$ is 

$X$ has the least upper bound property if

$X$ has the 
greatest lower bound property if


\underbar{Section 10}

An ordered set $(A, <)$ is well-ordered if

Give an example of a countable well-ordered set.

\underbar{Chapter 2}

Define the following:

Basis

Topology generated by a basis ${\cal B}$

Subbasis


Topology generated by subbasis ${\cal S}$


Standard topology on $\R$

Lower limit topology on $\R$

Discrete topology

Indiscrete topology

co-finite topology  (= finite complement topology)

co-countable topology  (= countable complement topology)

Order topology

Product topology

Subspace topology

\vskip 10pt
\hrule

Quiz 4? - ?


\underbar{Section 3}

Define partition.

How does an equivalence relation determine a partition.

How does a partition determine an equivalence relation.

\end