Learn

Learning preferences

Make learning more comfortable. Changes apply immediately.

Enlarges page content, including diagrams and their labels. You can also use your browser’s zoom.

Choose the colours that are easiest for you to distinguish. Applies to lesson diagrams and lab plots. Labels, shapes, hatching and line patterns also distinguish meanings. Source photographs and raw image brightness stay unchanged; mask-only views are available for image overlays.

ExampleComparisonSample link

Saved in this browser on this device. Preferences are separate from progress backups.

Lesson 2 of 28

Bases and generated topologies

Verify the basis covering and local-intersection conditions.

Loading your saved responses…

Try the optional starting-point checks and targeted refreshers. You can continue directly into this lesson.

Try

The usual real topology contains far too many open sets to list, but intervals are enough to describe it. An arbitrary open set is a union of open intervals. Even intervals with rational endpoints suffice, because rational numbers can be chosen on both sides of any point within a given open interval.

A basis is such a stock of local building blocks. It does not need to contain every open set, and it need not be closed under taking unions.

Predict

Predict whether the intersection of two basis members must itself be a basis member. That stronger property is convenient but unnecessary. It is enough that every point in the intersection has a smaller basis member lying inside it.

Predict what happens if a proposed basis misses one point of X entirely. No union of its members can produce a neighborhood of that point, or even the whole space. Covering X is therefore a separate axiom.

Experiment

Compare two bases on the real line.

Basis shapeNeighborhood around xGenerated topology
(a,b)An interval extending both sidesUsual
[a,b)May begin exactly at xLower-limit
SingletonsThe point aloneDiscrete

For the lower-limit basis, identify why the endpoint x is an interior point of [x,x+1) in the generated topology even though it is not an interior point in the usual topology.

Understand

A family B is a basis if it covers X and satisfies local intersection refinement: whenever x belongs to B₁∩B₂, some B₃ contains x and lies in that intersection. Declare U open when it is a union of basis members.

The empty union gives the empty set, and covering gives X. Arbitrary unions of basis unions are still basis unions. For the intersection of two generated opens, take any point x, select a basis member from each open around x, and refine their intersection. The intersection is the union of all such refinements, so is open. Induction handles finite intersections. This proves the generated family is a topology.

The useful local test is therefore: U is open exactly when every x in U has some B in the basis with x∈B⊆U. One does not need to guess the complete union in advance.

To compare bases, the topology generated by B is finer than the topology generated by C precisely when every C member around every point contains a B member around that point. Necessity follows because C members are then B-open. Sufficiency follows because each C member becomes a union of B members. Keep the containment direction straight: smaller local building blocks allow more sets to be open.

Apply

Prove the lower-limit topology is strictly finer than the usual topology. Every usual interval is a union of half-open intervals contained in it, so all usual-open sets remain open. But [0,1) is lower-limit-open and not usual-open, since no ordinary neighborhood of zero fits inside it.

Repair “A basis must include the whole space.” It need only cover the space by its members. The collection of bounded real intervals is a basis even though no single member is the entire real line.

Continue

Bases turn continuity, density and countability questions into local refinement arguments. The next lesson starts with even fewer sets, a subbasis, and generates the required finite intersections automatically. Optional depth: prove rational-endpoint intervals form a countable usual basis, explicitly using rational density rather than just their visual resemblance to ordinary intervals.

Apply · explain · revise

Practice and reasoning

Drafts save locally as you type. Reveal worked solutions when useful; the site remembers that exposure. Automatic matches check the requested answer, while written arguments require review against the rubric.

On {1,2,3}, let B={{1},{2},{3}}. How many distinct unions of basis members are there?

Integers, fractions and finite decimals are accepted. Expressions such as sqrt(2) are not parsed by this checker.

A basis intersection condition says that if x belongs to B₁∩B₂:

Your response

Prove that unions of members of a covering family B satisfying local intersection refinement form a topology.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Prove intervals with rational endpoints form a basis for the usual topology of R.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Show [a,b), a<b, form a basis on R, and that this topology is strictly finer than the usual topology.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Prove B generates a topology finer than that generated by C exactly when each C-neighborhood of a point contains a B-neighborhood of that point.

Structure your argument and preserve revisions

These optional planning fields save locally. Recording your response saves an immutable copy of the argument and these fields. Older records may contain only first/latest responses; missing intermediate revisions are not reconstructed.

Each field allows 2,000 characters. Keep a specific claim, state where it applies, cite the facts you use, and explain what still needs checking. Blank fields are allowed and are not evidence of mastery.

Reflect and continue

Before marking this lesson complete, explain one key idea without the worked solution and identify a condition that matters. Marking complete records participation, not independent mastery.