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

Connectedness and components

Prove connectedness is preserved by continuous images and closure.

Loading your saved responses…

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

Try

Removing one point from the real line separates it into two open half-lines. Removing one point from a circle leaves a connected arc-like space. This difference will later rule out a homeomorphism between the circle and an interval.

Connectedness means a space cannot be split into two disjoint nonempty relatively open pieces covering it. It is not a claim that every pair of points can be joined by a path; that stronger property is treated next.

Predict

Predict whether a connected set remains connected after taking its closure. It does. Any separation of the closure would have one side missing the original connected set, but a nonempty relative open in the closure must meet that dense set.

Predict whether connected components must be open. They are always closed, but openness requires additional local connectedness assumptions. In Q with its usual topology, components are singletons and none is open.

Experiment

Compare standard component structures.

SpaceConnected components
ROne component
R without zeroTwo half-lines
Discrete three-point spaceThree singletons
Q with usual subspace topologySingletons

For Q, separate any two distinct rationals using an irrational cut between them. This proves a component cannot contain both.

Understand

A separation of X is a pair of disjoint nonempty opens whose union is X. Equivalently, X has a nonempty proper clopen subset: either side of a separation is also closed because its complement is open. Connectedness means no such separation exists.

A continuous image of a connected space is connected. A separation of the image would pull back to a separation of the source, with nonemptiness supplied by surjectivity onto the image.

A union of connected subsets sharing a common point is connected. In a proposed separation, the common point belongs to one side. Each connected subset must lie entirely on that side, because otherwise its intersections with the two sides would separate it. The other side of the union is then empty.

Define the component of x as the union of all connected subsets containing x. The common-point theorem proves it connected and maximal. Two components that intersect have connected union, so maximality makes them equal. Hence components partition the space.

The closure of a connected set is connected: the original set lies on one side of any proposed separation of the closure, but the other nonempty relatively open side must meet the dense original set. Therefore a component’s closure is connected and maximality forces the component to equal its closure. This proves every component is closed without claiming it is open.

Apply

Prove each connected subset of Q has at most one point. Given two rationals p<q, choose an irrational r between them. The rational points below and above r form disjoint relative opens covering Q, and they separate any subset containing both p and q.

Repair “The components form an open cover.” They form a partition by closed connected sets in every space. They become open under local connectedness, a hypothesis that cannot be inferred from a familiar drawing or from the word component.

Continue

Path connectedness provides a constructive way to prove connectedness but is not equivalent in general. Optional depth: prove that every connected subset of R is an interval, using a missing intermediate point to create a separation. Combine that with compactness to classify nonempty compact connected real subsets as closed intervals, including singleton 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.

How many connected components does R without the points −1,1,3 have?

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

A space is disconnected exactly when it has:

Your response

Prove a continuous image of a connected space is connected.

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 a union of connected subsets with a common point is connected.

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 the closure of a connected subset is connected.

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.

Define the component of x as the union of all connected subsets containing x. Prove components are connected, partition the space and are closed.

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.