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

Partition of Unity

Graduate Depth 82 in the knowledge graph ☐ I know this ☆ Set as goal
45topics build on this
437prerequisites beneath it
See this on the map →
Smooth ManifoldsCompactness in Hausdorff Spaces+1 more→→Integration on ManifoldsRiemannian Metrics
partition-of-unity bump-functions paracompactness localization

Core Idea

A partition of unity is a collection of smooth non-negative functions {ρα} on a manifold that sum to 1 everywhere, each supported in a single coordinate chart. Partitions of unity allow you to patch together local constructions — metrics, forms, connections — into global objects. Their existence on smooth manifolds (guaranteed by paracompactness and the existence of smooth bump functions) is what makes the passage from local to global possible throughout differential geometry.

Explainer

Many constructions in differential geometry start locally — in a single coordinate chart, it is easy to define a metric, a connection, or a volume form using the coordinate structure of ℝⁿ. The challenge is patching these local constructions into a coherent global object. Partitions of unity are the glue that makes this possible. They are collections of smooth functions that decompose the manifold into weighted pieces, each living inside a single chart.

A smooth bump function is the fundamental building block: a smooth non-negative function that equals 1 on a compact set K and vanishes outside a slightly larger open set. Such functions exist in the smooth category because C∞ functions can be "flat" (all derivatives zero) at a point without being identically zero. The standard construction uses the function e-1/x for x > 0 and 0 for x ≤ 0, which is smooth but not analytic. Starting from bump functions, you construct a partition of unity subordinate to any open cover by taking bump functions for each chart and normalizing by dividing by their sum.

The construction of a Riemannian metric on any smooth manifold illustrates the power of the technique. Each chart provides a local metric (the pullback of the Euclidean metric on ℝⁿ). These local metrics may disagree on overlaps, but the partition-of-unity average g = Σ ρα gα produces a globally defined metric. This works because the set of positive-definite inner products is convex: any positive combination of inner products is again an inner product. The same technique constructs connections, embeddings into Euclidean space (the Nash embedding theorem uses partitions of unity), and many other global geometric objects.

Not every structure can be patched with partitions of unity. The technique works for structures defined by convex conditions (metrics, connections) but fails for structures defined by non-convex conditions. Symplectic forms, for instance, cannot be averaged — a convex combination of symplectic forms need not be symplectic. Complex structures similarly resist partition-of-unity arguments. This is why some geometric structures (Riemannian metrics) always exist on smooth manifolds while others (symplectic forms, complex structures) impose genuine topological constraints. Understanding which constructions survive the local-to-global passage — and which do not — is one of the organizing themes of differential geometry.

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 → De Morgan's Laws → Negation of Quantified Statements → Proof by Contradiction → Topological Spaces: Definition and Examples → Open Sets in Topological Spaces → Neighborhoods and Open Sets → Open Sets in Topological Spaces → Basis for a Topology → Neighborhoods and Local Properties → Limit Points and Convergence → Separation Axioms: T₀, T₁, and T₂ (Hausdorff) → Hausdorff Spaces → Introduction to Topological Manifolds → Smooth Manifolds → Partition of Unity

Longest path: 83 steps · 437 total prerequisite topics

Prerequisites (3)

Leads To (2)