Topology
CSIR NET Mathematical Sciences Unit 2 topology: bases and dense sets, subspace and product topology, separation axioms, connectedness and compactness.
- 5
- Topics
- 105
- Min read
- 01 Topological Spaces, Bases and Dense SetsStart here CSIR NET topology: open and closed sets, closure and interior, basis and subbasis, comparing topologies on R, dense sets, separability and countability.
- 02 Subspace and Product Topology CSIR NET topology: subspace topology, relative closure, hereditary properties, product vs box topology, projections, and which properties survive products.
- 03 Separation Axioms CSIR NET topology: T0, T1, Hausdorff, regular, completely regular and normal spaces, Urysohn lemma, Tietze extension, and the counter-examples between them.
- 04 Connectedness and Path-Connectedness CSIR NET topology: connected and path-connected spaces, components, local connectedness, cut points, and counting components of matrix groups and plane sets.
- 05 Compactness CSIR NET topology: open covers, finite intersection property, Tychonoff, compact Hausdorff spaces, sequential and local compactness, one-point compactification.
- Topology Formula Sheet and Short Notes Revise The whole chapter on one page.
Chapter Overview
Topology is one of the headings of Unit 2 of the CSIR NET Mathematical Sciences syllabus, the unit aimed at mathematics candidates. The official topic list is short: basis and dense sets, subspace and product topology, separation axioms, connectedness and compactness. In practice it rests on a small stock of spaces (the cofinite, cocountable and lower limit topologies, the Sorgenfrey plane, the topologist’s sine curve, the box topology, the matrix groups), and the paper keeps returning to them.
The notes assume a first MSc course in topology (Munkres’ Topology or Simmons’ Introduction to Topology and Modern Analysis) and the metric-space material from Real Analysis. They do not re-teach that course. They collect exact definitions, the theorems with their hypotheses, and the counter-examples that settle Part C options.
What You’ll Learn
By the end of this chapter you will be able to:
- Check whether a family is a basis, compare topologies, and compute closures, interiors and dense sets in the standard topologies on \( \mathbb{R} \)
- Separate first countable, second countable, separable and Lindelöf spaces with one example each
- Work with relative open and closed sets, product and box topologies, and decide which properties pass to subspaces and products
- Place a space on the ladder \( T_0 \) to \( T_4 \), and use Urysohn’s lemma and Tietze’s extension theorem
- Count the components of matrix groups and plane sets, and tell connected from path-connected
- Decide compactness in non-metric topologies, use the compact-to-Hausdorff homeomorphism theorem, and identify one-point compactifications
Prerequisites
- Metric Spaces and Several Variables: open and closed sets, compactness and connectedness in metric spaces
- Real Numbers, Sets and Countability: countable and uncountable sets
- Linear algebra up to determinants, eigenvalues and orthogonal matrices (for the matrix-group examples)
Learning Path
graph TD
A[1. Topological Spaces, Bases and Dense Sets] --> B[2. Subspace and Product Topology]
A --> C[3. Separation Axioms]
B --> C
B --> D[4. Connectedness and Path-Connectedness]
C --> E[5. Compactness]
D --> E
E --> F[Quick Revision]Topics in This Chapter
| Topic | What it covers | Time |
|---|---|---|
| Topological Spaces, Bases and Dense Sets | Topologies, closure and interior, basis and subbasis, comparing topologies, continuity, dense sets, countability axioms | 30 min |
| Subspace and Product Topology | Relative topology, hereditary properties, product vs box topology, projections, productive properties | 30 min |
| Separation Axioms | \( T_0 \) to \( T_4 \), Hausdorff consequences, Urysohn lemma, Tietze extension, counter-examples | 30 min |
| Connectedness and Path-Connectedness | Connected sets, path-connectedness, components, cut points, matrix groups and plane sets | 30 min |
| Compactness | Open covers, FIP, compact Hausdorff spaces, Tychonoff, sequential and local compactness, one-point compactification | 35 min |
| Quick Revision | Every definition, theorem and counter-example on one page | 10 min |
Official syllabus lines and where they are covered
| Official topic line (CSIR NET Mathematical Sciences, Unit 2, Topology) | Covered in |
|---|---|
| Basis, dense sets | Topological Spaces, Bases and Dense Sets |
| Subspace and product topology | Subspace and Product Topology |
| Separation axioms | Separation Axioms (countability axioms are on the first page) |
| Connectedness and compactness | Connectedness and Path-Connectedness and Compactness |
How CSIR NET Asks It
Per the NTA information bulletin for December 2026, the Mathematical Sciences paper (code 704) is marked as follows:
| Part B | Part C | |
|---|---|---|
| Questions given | 40 | 60 |
| Questions to attempt | 25 | 20 |
| Marks per correct answer | 3 | 4.75 |
| Marks per wrong answer | −0.75 | 0 |
| Maximum | 75 | 95 |
NTA publishes no topic-wise weightage, so we make no claim about how many questions come from topology. What the format tells you is how to prepare:
- Part B (single correct) rewards quick recall on a named space: the closure of a set in \( \mathbb{R}_\ell \), the dense subsets of the cocountable topology, the number of components of a matrix group, the one-point compactification of \( \mathbb{N} \).
- Part C (one or more correct) typically fixes one space and lists four properties (separable? Hausdorff? connected? compact?), or lists four spaces and asks which have a property. Each option falls to a theorem or to one standard counter-example. Every topic page ends with a counter-example bank and Level 3 practice in exactly this format, with every option justified.
For the full marking scheme and the other units, see the Mathematical Sciences overview. The metric-space half of this material is in Metric Spaces and Several Variables; read it first if Heine–Borel or total boundedness feels rusty. Found an error? See About for how to report it.
Start Learning
Begin with the first topic: