Compactness and Connectedness
Two properties that continuous maps preserve, which is why proofs lean on them so heavily. Compactness turns any open cover into a finite one, and connectedness rules out splitting a space in two.
What a learner can do afterwards
- Prove that the continuous image of a compact space is compact
- Use connectedness to prove an intermediate value statement
- Explain why closed and bounded describes compactness in Euclidean space but not in general
1 · Read
A space is compact when every open cover has a finite subcover. Continuous maps preserve it: the image of a compact space is compact. To prove it you pull an open cover of the image back to the domain, extract finitely many there, and push them forward.
The extreme value theorem is compactness in action. A continuous image of a closed interval is compact, hence closed and bounded, so a maximum is attained. For 5 minus x squared on the interval from -2 to 2, the peak sits at x = 0 with value 5, beating the endpoint value 1.
A space is connected when it cannot be split in two, and continuous images of connected sets stay connected. The intermediate value theorem follows: a continuous f with f of 0 = -2 and f of 3 = 7 must cross zero somewhere inside the open interval from 0 to 3. Existence comes before computation.
Closed and bounded means compact only in Euclidean space, not in general. The closed unit ball in infinite dimensions is closed and bounded but fails to be compact. Whenever a proof leans on finiteness, check which theorem really supplies it.
Compactness and connectedness pass through continuous maps, giving maxima on closed intervals and zeros between opposite signs.
More to read
2.4 Continuity
Continuity preserves the properties that make existence theorems work. Compact sets stay compact and connected sets stay connected under continuous maps. The extreme value theorem is compactness in action: a continuous image of [a, b] is compact, hence closed and bounded, so max and min are attained.
4.3 Maxima and Minima
Maxima and minima locate peaks and valleys, and closed intervals guarantee they exist. Critical points and endpoints are the only candidates for smooth functions. The extreme value theorem behind the search is pure compactness: continuous images of [a, b] attain their bounds.
Intermediate value theorem review
The intermediate value theorem turns connectedness into sign hunting: a continuous function cannot jump over zero. Each bisection step halves an interval that still brackets the root. Connectedness guarantees existence first, and the bisection steps then compute the root. Reviewing the theorem statement carefully shows how little it assumes.
2 · Watch
به انگلیسیTake it off screen
Where it sits
Optional connections
This opens up
18 questions wait behind this lesson, each with its answer explained. Every answer feeds the sky: stars light as they are learned, and dim when it is time to come back.