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 5 of 28

Closure, interior and boundary

Compute closure and interior from neighborhood definitions.

Loading your saved responses…

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

Try

For A=(0,1] in the usual real line, the interior is (0,1), the closure is [0,1], and the boundary consists of zero and one. At zero, every neighborhood touches A but zero is absent from A. At one, every neighborhood touches both A and its complement even though one belongs to A.

Membership and boundary status are therefore separate questions. A boundary point need not be outside the set, and a set need not be open or closed.

Predict

Predict the closure and interior of Q in R. Every real interval meets Q, so its closure is all of R. Every interval also contains an irrational, so Q has empty interior. Its boundary is therefore the whole real line.

This example warns against treating boundary as a thin curve in a picture. Topological boundaries can be as large as the whole space.

Experiment

Compute the three operations in the usual real line.

SetInteriorClosureBoundary
(0,1](0,1)[0,1]0 and 1
QEmptyRR
RRREmpty

The ambient space matters. In the subspace [0,1], the whole set [0,1] has empty boundary, although its boundary in R has two points.

Understand

The interior of A is the union of all open sets contained in A. The closure of A is the intersection of all closed sets containing A. These definitions give the largest open subset and smallest closed superset respectively.

A point x lies in the closure precisely when every open neighborhood of x meets A. Indeed, a neighborhood missing A has a closed complement containing A but excluding x. Conversely, a closed superset excluding x supplies just such a neighborhood by complementation. This argument works in every topology and requires no sequences.

The boundary is closure(A) minus interior(A), equivalently closure(A) intersected with closure(X without A). To prove the equivalence, x is not interior to A exactly when every neighborhood meets its complement. Thus a boundary point is one whose every neighborhood meets both sides.

Closure is monotone, contains A, and is idempotent because closure(A) is already closed. It preserves finite unions: closure(A)∪closure(B) is a closed superset of A∪B, while monotonicity gives the reverse containment. Infinite unions are different. The closed singletons 1/n have a union omitting zero, but its closure contains zero.

For A⊆Y⊆X, closure within Y equals Y intersected with closure within X. A relative neighborhood Y∩U meets A exactly when U does, using A⊆Y. This proves the formula directly and avoids guessing from a drawing.

Apply

In the three-point chain topology, compute the closure of the singleton containing b. The closed supersets force the pair b,c. Explain through neighborhoods why c enters the closure even though it is a different point.

Repair “A set is closed if it contains the limits of all its sequences” as a universal topological claim. It is valid in metric spaces and more generally first-countable spaces, but may fail in arbitrary spaces. We will prove the correct scope and replace sequences by nets later.

Continue

Use the neighborhood criterion whenever an algebraic closure calculation becomes opaque. The next lesson uses it to characterize continuity through f(closure A)⊆closure(f(A)). Optional depth: derive interior(A)=X without closure(X without A), carefully keeping all complements relative to the same ambient space.

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.

In X={a,b,c} with topology ∅,{a},{a,b},X, how many points are in the closure of {b}?

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

The boundary of Q in usual R is:

Your response

Prove x belongs to the closure of A exactly when every open neighborhood of x meets A.

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 closure(A∪B)=closure(A)∪closure(B).

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.

Give an infinite family for which closure does not commute with union.

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.

For A⊆Y⊆X, prove closure_Y(A)=Y∩closure_X(A).

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.