Get AI summaries of any video or article — Sign up free
Fixed Points thumbnail

Fixed Points

Vsauce·
6 min read

Based on Vsauce's video on YouTube. If you like this content, support the original creators by watching, liking and subscribing to their content.

TL;DR

Brouwer’s fixed point theorem guarantees at least one unchanged point under continuous deformations of a bounded, hole-free region.

Briefing

A single mathematical idea—Brouwer’s fixed point theorem—keeps resurfacing across wildly different problems, from a rumored “art museum” on the Moon to why you can’t fully mix coffee, why certain digit tricks always land on 9, and even why Earth must have antipodal points sharing the same temperature and pressure. The through-line is that continuous transformations can’t completely avoid returning some point to its original location (or at least to a “matching” state), unless you break continuity by cutting, gluing, or otherwise changing the rules.

The Moon story starts with an alleged Apollo 12 prank: Fred Waldhauer of Bell Laboratories and sculptor Forest Myers reportedly persuaded an engineer to hide a small ceramic tile inside the lunar lander’s gold blankets, with etched artwork on it. After the mission, the tile supposedly remained on the Moon, and a New York Times photo later showed a design that included a “straight line” and recognizable drawings—though a thumb in the image covered part of the work, including Andy Warhol’s initials. Warhol’s contribution is described as a stylized “W” with a line through it to form an “A,” essentially reducing the art to his initials etched into the chip.

From there, the narrative pivots to fixed points in a more formal sense using a map analogy: no matter how a map of North America is rotated, flipped, twisted, or crumpled, there will always be a point that ends up directly above its real-world location. That guarantee comes from Brouwer’s fixed point theorem, which applies to bounded sets of points without holes under continuous transformations. The same constraint shows up in a checkerboard thought experiment: if each pixel starts in its own square and the board is continuously deformed, at least one pixel must remain in its original square. Stirring becomes the everyday version—coffee can’t be completely “mixed” in a way that moves every molecule-like point out of its starting region; at least one point returns to where it began.

Fixed points also appear as attractors. The “add digits, subtract, repeat” procedure for any multi-digit number always ends at 9, and numbers with two or more digits become divisible by 9 immediately. The mechanism isn’t mystical; it follows from base-10 positional notation, where subtracting the digit sum effectively removes one copy of each place-value group, turning the process into a multiple-of-9 funnel.

The theorem’s spirit extends into computation and infinity. The Babylonian method for square roots repeatedly averages a guess with the radicand divided by that guess, steadily converging because the true root lies between the two values. In set theory, the discussion turns to aleph numbers (ℵ), describing a fixed-point-like phenomenon where an aleph indexed by “the number of smaller infinities” can equal the size of that entire cascade. Finally, the Borsuk–Ulam theorem is presented as a related inevitability on spheres: for any continuous assignment of temperature and atmospheric pressure over Earth’s surface, there must exist at least one pair of antipodal points with the same values. Even chaotic weather can’t erase that constraint.

The result is a unifying message: when change is continuous and space has no holes, some correspondence survives—whether it’s a pixel that won’t escape its square, a number that can’t avoid ending at 4 in a letter-count loop, or two points on opposite sides of Earth that must match.

Cornell Notes

Brouwer’s fixed point theorem says continuous transformations of a bounded, hole-free set of points must leave at least one point unchanged (a fixed point). The same inevitability shows up in practical analogies: a crumpled map still has a point that lines up with its real location, and stirring coffee can’t move every “point” out of its original region—some point must return. The discussion then broadens to other fixed-point-like ideas: digit-sum subtraction always funnels numbers to 9 because of base-10 structure, and the Babylonian method for square roots converges because the true root lies between successive bounds. Related theorems like Borsuk–Ulam guarantee matching values at antipodes on a sphere, even under chaotic conditions.

How does Brouwer’s fixed point theorem translate into the “map” and “checkerboard” examples?

The map analogy claims that if a map is continuously deformed—rotated, flipped, twisted, folded, or crumpled—there will always be at least one location that still lands directly above its correct real-world point. The checkerboard version makes the same idea concrete: each pixel starts in its own square, and after any continuous resizing/manipulation, at least one pixel must remain in the square it began in. The only way to avoid that outcome would be to break continuity by cutting, gluing, or otherwise moving parts discontinuously.

Why can’t you completely mix coffee and a mug by stirring?

Stirring is treated as a continuous transformation that keeps everything within the same bounded region. Brouwer’s theorem then implies that at least one “point” (idealized as a point-like element) must end up back where it started. Even though real coffee is made of molecules rather than points, the argument holds approximately because molecules are extremely numerous and their motion can be modeled as continuous at human scales.

What makes the “subtract digit sum repeatedly” trick always end at 9?

The behavior comes from base-10 positional notation. A number like 25 means 2×10 + 5×1, so subtracting the sum of digits removes one copy from each place-value group: 10s effectively drop to 9s, 100s drop to 99s, and so on. As a result, the process drives numbers into a structure that is always a multiple of 9, and the repeated iteration funnels multi-digit numbers to the attractor 9.

How does the Babylonian method for square roots use a fixed-point-like idea?

The method starts with a guess for √(radicand). If the guess is too low, radicand/guess is too high; if the guess is too high, radicand/guess is too low. Averaging the two produces a new estimate that lies between them, so the sequence of guesses converges toward the true square root. The number of correct digits roughly doubles each iteration, reflecting rapid convergence.

What does the Borsuk–Ulam theorem guarantee about antipodal points on Earth?

For any continuous assignment of values over a sphere, there must be at least one pair of antipodal points (diametrically opposite locations) where the values match. In the Earth example, temperature and atmospheric pressure are treated as continuous functions over the surface. Swapping two thermometers placed at antipodes forces their readings to cross at least once, implying at least one antipodal pair shares the same temperature and pressure.

What is the “aleph fixed point” claim in the aleph-number discussion?

The aleph numbers ℵ0, ℵ1, ℵ2, … are described as increasing sizes of well-ordered infinities. The text highlights an aleph fixed point where the index equals the number of smaller infinities: the subscript of each ℵ is the count of infinities below it, and the cascade of alephs can be compared to an “endless” self-referential structure. The key takeaway is that some infinite sizes can be equal to the size of the collection of smaller sizes, creating a fixed-point-like equality among infinities.

Review Questions

  1. In what ways do the map deformation and checkerboard deformation rely on continuity and the absence of holes?
  2. Explain, using base-10 positional notation, why subtracting a number’s digit sum repeatedly leads to 9.
  3. How does the Borsuk–Ulam theorem force equality at antipodes even when weather changes unpredictably?

Key Points

  1. 1

    Brouwer’s fixed point theorem guarantees at least one unchanged point under continuous deformations of a bounded, hole-free region.

  2. 2

    A crumpled or rotated map still contains a point that aligns with its real-world location because continuous transformations can’t eliminate all fixed points.

  3. 3

    Stirring coffee can’t fully “mix away” every point from its starting region; continuity implies at least one point must return to its original location.

  4. 4

    The digit-sum subtraction trick always ends at 9 because base-10 place-value structure makes the process funnel numbers into multiples of 9.

  5. 5

    The Babylonian method converges for square roots because each new guess is an average of two bounds that straddle the true root.

  6. 6

    Borsuk–Ulam guarantees at least one antipodal pair on a sphere with matching values (temperature and pressure in the Earth example), even under chaotic variation.

  7. 7

    Fixed-point ideas extend beyond real-world mixing into computation (convergence) and set theory (aleph-number self-referential structure).

Highlights

A continuous deformation can’t eliminate every point-to-original correspondence: at least one pixel must stay in its starting square in the checkerboard experiment.
The “subtract digit sum repeatedly” routine is driven by base-10 positional notation, turning the process into a multiple-of-9 funnel that always lands on 9.
Borsuk–Ulam forces at least one antipodal pair on Earth to share the same temperature and atmospheric pressure, because swapping antipodal measurements makes their readings cross.
The Babylonian square-root algorithm converges quickly because the true root always lies between the current guess and radicand/guess, and averaging keeps tightening the bracket.

Topics

  • Fixed Points
  • Brouwer Theorem
  • Borsuk–Ulam Theorem
  • Digit Sum Trick
  • Babylonian Square Roots

Mentioned