← Graph View All Domains

A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

The Borsuk-Ulam Theorem

Research Depth 111 in the knowledge graph ☐ I know this ☆ Set as goal

1topic build on this

493prerequisites beneath it

See this on the map →

Degree Theory for Maps of Spheres Singular Homology Groups +1 more→→Jordan Curve Theorem (Homological Proof)

Core Idea

The Borsuk-Ulam theorem states that for every continuous map f : Sⁿ -> Rⁿ, there exists a point x in Sⁿ such that f(x) = f(-x): some pair of antipodal points must map to the same value. Equivalently, there is no continuous map Sⁿ -> S^n-1 that commutes with the antipodal map. This theorem has striking consequences: it implies the ham sandwich theorem (any n measurable sets in Rⁿ can be simultaneously bisected by a single hyperplane) and that at any moment, there exist two antipodal points on Earth with identical temperature and pressure.

Explainer

The Borsuk-Ulam theorem is one of the most elegant and applicable results in algebraic topology. The antipodal coincidence version states: for any continuous map f : Sⁿ -> Rⁿ, there exists a point x with f(x) = f(-x). In the n = 2 case, this has the beautiful meteorological interpretation: at any moment, there exist two antipodal points on the Earth's surface with identical temperature and atmospheric pressure (modeling temperature and pressure as continuous functions from S² to R²).

The proof for general n uses the theory of the antipodal action on spheres and projective spaces. The Z/2Z-action on Sⁿ given by x -> -x is free (no fixed points), and the quotient is real projective space RPⁿ = Sⁿ / (x ~ -x). A continuous equivariant map g : Sⁿ -> S^n-1 (satisfying g(-x) = -g(x)) would descend to a continuous map g-bar : RPⁿ -> RP^n-1 on the quotients. The key topological input is about the cohomology (or homology with Z/2Z coefficients) of projective spaces: H^k(RPⁿ; Z/2Z) = Z/2Z for 0 <= k <= n, and the generator alpha in H¹ satisfies alphaⁿ != 0 in Hⁿ. The induced map g-bar^* would have to be an isomorphism on H¹ (by the equivariance condition), hence send alpha to alpha, and therefore send alphaⁿ != 0 to alphaⁿ. But alphaⁿ in H^n(RP^n-1; Z/2Z) = 0 (since RP^n-1 has no cohomology in degree n). Contradiction.

The ham sandwich theorem is the most famous application. Given n measurable sets (or "ingredients") in Rⁿ (think: bread, ham, cheese in R³ for n = 3), there exists a single hyperplane that simultaneously bisects all n sets into equal-volume halves. The proof parametrizes hyperplanes by their normal direction on S^n-1 and uses Borsuk-Ulam to find a direction where all n bisecting offsets agree. This result is used in computational geometry (fair division algorithms) and in measure theory.

Another important consequence is that Sⁿ does not embed in Rⁿ: any continuous map Sⁿ -> Rⁿ must send some pair of antipodal points to the same image, so no such map can be injective. This is a stronger statement than the invariance of dimension (which says Rⁿ is not homeomorphic to R^m for n != m) and provides a clean topological obstruction to "dimensionally reducing" spheres.

The Borsuk-Ulam theorem also has discrete combinatorial analogues. The necklace splitting problem (splitting a necklace with n types of beads fairly between two people using at most n cuts) follows from a discrete version of Borsuk-Ulam. Tucker's lemma (a combinatorial analogue on triangulated spheres) is equivalent to the Borsuk-Ulam theorem and is used in fair division algorithms and computational complexity (the PPAD complexity class). These connections between continuous topology and discrete mathematics demonstrate the unexpected reach of the Borsuk-Ulam theorem beyond its original setting.

Practice Questions 4 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Proof by Cases → Proving by Cases and Exhaustion → Vacuous Truth and Trivial Cases → Proof by Cases (Proof by Exhaustion) → Mathematical Induction → Binary Operations and Algebraic Structures → Group Definition and Examples → Basic Properties of Groups → Group Homomorphisms → Group Isomorphisms → Cayley's Theorem → Cosets and Lagrange's Theorem → Normal Subgroups → Quotient Groups → First Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → First Isomorphism Theorem for Groups → Third Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → Integral Domains → Principal Ideal Domains → Unique Factorization Domains → Polynomial Rings → Field Extensions → Algebraic and Transcendental Elements → Splitting Fields → Finite Fields → Galois Groups → Fundamental Theorem of Galois Theory → Second Isomorphism Theorem for Groups → Direct Products of Groups → Classification of Finite Abelian Groups → Chain Complexes and the Boundary Operator → Exact Sequences in Homological Algebra → The Snake Lemma → Relative Homology and the Long Exact Sequence of a Pair → The Excision Theorem → The Mayer-Vietoris Sequence → Homology of Spheres → Higher Homotopy Groups → The Hurewicz Theorem → Degree Theory for Maps of Spheres → The Borsuk-Ulam Theorem

Longest path: 112 steps · 493 total prerequisite topics

Prerequisites (3)

Degree Theory for Maps of Sphereshard Singular Homology Groupshard Homotopy Exact Sequence of a Fibrationsoft

Leads To (1)

Jordan Curve Theorem (Homological Proof)soft