Scribd
Upload
15 views1 page

Class 6

This document is a problem sheet for a General Topology course scheduled for Spring 2025. It includes a list of problems from the book 'Topology' by James Munkres, along with tasks related to generating topologies from specific functions. The due date for the problems is not specified as they are not for submission.

Uploaded by

Anuj Jha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views1 page

Class 6

This document is a problem sheet for a General Topology course scheduled for Spring 2025. It includes a list of problems from the book 'Topology' by James Munkres, along with tasks related to generating topologies from specific functions. The due date for the problems is not specified as they are not for submission.

Uploaded by

Anuj Jha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

GENERAL TOPOLOGY, SPRING 2025

PROBLEM SHEET 6

• Due date : Not for submission.


• Unless stated otherwise, each Rn (for finite n) comes with the standard
topology given by usual Euclidean distance.

1. List of problems
(1) The following problems are from the book “Topology” (Updated second
edition) by James Munkres.
(A) Page 111 : problems 2, 3, 5, 6
(B) Page 112 : problems 9, 13.
(2) For each of the following function give an example of a nontrivial basis, if
possible, of the topology generated by the function.
(A) f : R2 → (R, standard topology), f (x, y) := x − y.
(B) f : R → (R, standard topology), f (x) := x2 .
(C) Let (X, d) be a metric space and x0 be a fixed point in X. Consider
f : X → (R, standard topology) given by f (x) := d(x, x0 ).
(3) Let τ := {∅, A1 , . . . , AN , X} be a topology on a set X with N > 0. Prove
the following. There exists a function
f : X → (R, standard topology)
so that τf = τ if and only if there exists a sub-collection of mutually disjoint
sets, say, {A1 , A2 , . . . , Am } with N = 2m − 2 for some positive integer m,
so that the following holds.
{Am+1 , . . . , AN , X} = all possible unions (of size > 1) in A1 , . . . , Am .
Here τf denotes the topology generated by f on X.

Date: January 27, 2025.


1

You might also like