Partitions of Unity
And, finally, one to go up today!
A partition of unity is a useful, though technical, tool that helps us work in local coordinates. This can be a tricky matter when we’re doing things all over our manifold, since it’s almost never the case that the entire manifold fits into a single coordinate patch. A (smooth) partition of unity is a way of breaking the function with the constant value up into a bunch of (smooth) pieces that will be easier to work with.
More specifically, a partition of unity is a collection of nonnegative smooth functions indexed by some set
, subject to two conditions. First: the collection of supports
is a locally finite cover of
, which takes a bit to unpack.
The support of a real-valued (or vector-valued) function is the closure of the set on which it takes nonzero values. In other words, the complement of the support is the largest open set on which
.
To say that a collection of sets is a locally finite cover means that every point is contained in at least one of them, and that
has some neighborhood which intersects only finitely many of them. For instance, the collection of all intervals
centered at integers
is a locally finite cover of
. Every real number is within
of some integer, and around each real number we can draw a small neighborhood that meets at most three of these intervals (why three?).
The other condition is that the sum
That is, if we add up all these functions we get the function with constant value . But we made no restriction on the index set, so how do we know that this sum remotely makes sense? Because we evaluate it at each point
and we know that the supports of form a locally finite cover! That is, there is some neighborhood
of
which intersects at most finitely many of the
. For all of them
doesn’t intersect, we are absolutely certain that
, and so our big sum really only involves at most finitely many terms at each point!
As an example, consider the function defined by
This is a differentiable — though not smooth — function supported on the interval . We can slide this over to define
, getting a differentiable function supported on
. From here, it’s an exercise to verify that this is a partition of unity. We must check that on the interval
we have
.

[...] know what a partition of unity is, but not all partitions of unity are very useful. For instance, the single function defined by [...]
Pingback by Partitions of Unity Subordinate to a Cover « The Unapologetic Mathematician | March 8, 2011 |
John, it would be useful if you could put a second pair of previous/next buttons at the top of the first page too. Thank you.
- Charlie C
I agree, Charlie, but I don’t have control over this theme. I may have to change themes entirely at some point, but so far I’ve kept putting it off.
Not a problem, John. The current layout works just fine.
You know, I had never noticed those “previous/next” buttons before! They’re quite handy, so thanks!
The theme is useful for being able to stretch to accommodate long typeset display equations, but I’ve been becoming dissatisfied with it.
Unfortunately, none of the WP.com-available themes are particularly great for everything I want, and I just don’t have the time to maintain the look/feel/installation myself, either here or on my own host with WP.org; nor do I have the money to pay someone else to do it for me. We can’t all be John Baez, with Jacques Distler at our beck and call.
[...] we come to the heart of our partitions of unity: the bump functions. These are like smooth analogues of characteristic functions. A characteristic [...]
Pingback by Bump Functions, part 1 « The Unapologetic Mathematician | March 12, 2011 |
[...] we’ve asserted: given any open cover of a smooth manifold we can find a countable smooth partition of unity subordinate to [...]
Pingback by Partitions of Unity (proof) « The Unapologetic Mathematician | March 14, 2011 |