Topological spaces and open sets

Try

On the three-point set X consisting of a, b and c, declare exactly the empty set, the singleton containing a, the pair containing a and b, and X itself to be open. The word open no longer refers to a drawn interval. It records which subsets are permitted as neighborhoods for reasoning about limits and continuity.

Check the declaration rather than accepting the label. The four sets form an inclusion chain. Any union is one of those sets, and any finite intersection is one of them as well.

Predict

Predict whether every subset must be open. The singleton containing b is missing, and that is allowed. A topology need not distinguish all points symmetrically.

Predict what happens if the proposed open sets are only the empty set, the pairs containing a,b and b,c, and the whole set. Their intersection forces the singleton containing b. Without adding it, the declaration fails a topology axiom.

Experiment

Use this finite comparison as a definition check.

Family on a three-point set	Number of opens	Distinguishing feature
Indiscrete	2	Only empty and whole
Chain example	4	Nested neighborhoods
Discrete	8	Every subset open

A finite enumeration can verify this particular space. It cannot replace proofs involving arbitrary infinite unions or supply evidence that every infinite space behaves similarly.

The live tool has its own selected family and subset, independent of the fixed table. Change one proposed open set, inspect the exact axiom failure or valid topology, and explain the resulting neighborhoods. Every space in this tool is finite and therefore compact; it cannot demonstrate noncompactness or the infinite cofinite T₁ counterexample.

Live experiment: build a topology on three points

The underlying set is X={a,b,c}. Choose which subsets count as open, then predict whether the family satisfies the topology axioms. A selected subset A is an object to inspect; it need not be open.

Starting family Nested opens: ∅, {a}, {a,b}, XIndiscrete: only ∅ and XDiscrete: every subsetInvalid: missing a unionInspect subset A ∅{a}{b}{a,b}{c}{a,c}{b,c}{a,b,c}Reset experiment

Proposed open subsets

∅ {a} {b} {a,b} {c} {a,c} {b,c} {a,b,c}

The family passes the topology axioms on this finite set. Pairwise unions suffice here because there are only eight distinct subsets; arbitrary unions reduce to finite unions. That argument does not validate arbitrary unions on an infinite space.

Selected A: {a}

Interior of A: {a}

Closure of A: {a,b,c}

Boundary of A: {b,c}

Interior is the union of open subsets contained in A. Closure is X minus the interior of X∖A. Boundary is closure minus interior. These diagrams show membership, not distance or geometric position.

• The smallest open neighborhood of a is {a}.
• The smallest open neighborhood of b is {a,b}.
• The smallest open neighborhood of c is {a,b,c}.

T₀: yes; T₁: no; Hausdorff: no. T₀ requires an open set distinguishing each pair; T₁ requires both directions; Hausdorff requires disjoint open neighborhoods. On a finite set T₁ implies discrete, since finite unions of closed singletons are closed. This equivalence fails on infinite spaces.

Try A={a} in the indiscrete family, then repair the invalid family. Explain why a point can belong to the closure without belonging to A. Every finite space is compact, so this explorer cannot distinguish compact from noncompact spaces. No geometry or general metrization result is inferred. Settings are temporary.

Understand

A topology τ on a set X is a family of subsets containing the empty set and X, closed under arbitrary unions and finite intersections. The pair (X,τ) is a topological space. The empty union is empty; the empty intersection is X. Declaring only finite intersection closure is deliberate. On the usual real line, the intersection of all intervals (−1/n,1/n), for positive integers n, is the singleton zero, which is not open.

Closed sets are complements of open sets. De Morgan’s laws therefore give arbitrary intersections and finite unions of closed sets. A subset can be both open and closed, or neither; these adjectives are not logical negations of each other for an individual set.

On a fixed underlying set, τ₂ is finer than τ₁ if τ₁ is contained in τ₂. A finer topology supplies more open sets and potentially more stringent convergence requirements. The discrete topology is the finest and the indiscrete topology the coarsest.

The intersection of any nonempty collection of topologies on X is again a topology. Every common open family contains the endpoint sets; a union or finite intersection of common opens belongs to each constituent topology and therefore to their intersection. This construction will define the smallest topology containing prescribed subsets. Their ordinary union, by contrast, need not itself be a topology because sets taken from different families may fail joint closure.

Apply

Repair the invalid finite family in Predict by adding its forced intersection. The result contains exactly five open sets. Check every possible union and intersection, then explain why no smaller topology can contain the two original pairs.

Translate one metric statement into open-set language: instead of saying every point has a sufficiently small ball inside U, say every point has an allowed neighborhood inside U. Topology keeps the local containment mechanism while allowing spaces with no distance formula at all.

Continue

The next lesson compresses large open-set families into bases. Optional depth: on a finite space, the intersection of all neighborhoods of a point is open because only finitely many distinct sets occur. This property is special; importing it into the usual real line would incorrectly make every singleton open.