= Exercise 12. |Diagonal Show that X is Hausdorff if and only if the diagonal A {(2,1); z X) is closed in X X X.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

topology exercice 12

**Exercise 7.** *[Basis and comparable topology]* Let \( X = \mathbb{R} \) and \( K = \left\{ \frac{1}{n}; n \in \mathbb{N} \right\} \). Consider the following collections on \( X \):

\[
\mathcal{B} = \{ [a, b) ; a, b \in \mathbb{R}, a < b \},
\]

\[
\mathcal{B}' = \{ [a, b]; a, b \in \mathbb{R}, a < b \},
\]

and

\[
\mathcal{B}'' = \{ [a, b]; a, b \in \mathbb{R}, a < b \} \cup \{ [a, b] \setminus K ; a, b \in \mathbb{R}, a < b \}.
\]

Knowing that \( \mathcal{B} \) and \( \mathcal{B}' \) are bases for some topology on \( X \), prove that \( \mathcal{B}'' \) is a basis for a topology on \( X \). Furthermore, let \( \tau, \tau', \) and \( \tau'' \) denote the topologies on \( X \) generated by \( \mathcal{B}, \mathcal{B}', \) and \( \mathcal{B}'' \), respectively. Prove that \( \tau'' \) and \( \tau'' \) are finer than \( \tau \), and that \( \tau' \) and \( \tau'' \) are not comparable.

**Exercise 8.** *[Subspaces product topology]* Let \( A \) be a subspace of \( X \) and let \( B \) be a subspace of \( Y \). We equip \( A \) and \( B \) with the subspace topologies. Prove that the product topology on \( A \times B \) is the same as the topology \( A \times B \) inherits as a subspace of \( X \times Y \).

**Exercise 9.** *[Closed product topology]* Let \( X \) and \( Y \) be topological space, \( A, U \) be subsets of \( X \), and \( B \)
Transcribed Image Text:**Exercise 7.** *[Basis and comparable topology]* Let \( X = \mathbb{R} \) and \( K = \left\{ \frac{1}{n}; n \in \mathbb{N} \right\} \). Consider the following collections on \( X \): \[ \mathcal{B} = \{ [a, b) ; a, b \in \mathbb{R}, a < b \}, \] \[ \mathcal{B}' = \{ [a, b]; a, b \in \mathbb{R}, a < b \}, \] and \[ \mathcal{B}'' = \{ [a, b]; a, b \in \mathbb{R}, a < b \} \cup \{ [a, b] \setminus K ; a, b \in \mathbb{R}, a < b \}. \] Knowing that \( \mathcal{B} \) and \( \mathcal{B}' \) are bases for some topology on \( X \), prove that \( \mathcal{B}'' \) is a basis for a topology on \( X \). Furthermore, let \( \tau, \tau', \) and \( \tau'' \) denote the topologies on \( X \) generated by \( \mathcal{B}, \mathcal{B}', \) and \( \mathcal{B}'' \), respectively. Prove that \( \tau'' \) and \( \tau'' \) are finer than \( \tau \), and that \( \tau' \) and \( \tau'' \) are not comparable. **Exercise 8.** *[Subspaces product topology]* Let \( A \) be a subspace of \( X \) and let \( B \) be a subspace of \( Y \). We equip \( A \) and \( B \) with the subspace topologies. Prove that the product topology on \( A \times B \) is the same as the topology \( A \times B \) inherits as a subspace of \( X \times Y \). **Exercise 9.** *[Closed product topology]* Let \( X \) and \( Y \) be topological space, \( A, U \) be subsets of \( X \), and \( B \)
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,