Partitions of Unity Tyrone Cutler June 18, 2020 Contents 1 Families of Subsets 1 2 Partitions of Unity 2 2.1 Paracompact Spaces and Partitions of Unity . 6 2.2 Sample Applications for Partitions of Unity . 7 3 An Application To Homotopy Theory 10 4 Milnor's Theorem and the Stacking Lemma 11 1 Families of Subsets Definition 1 A collection S = fSigi2I of subsets Si ⊆ X of a space X, is said to cover S X if i2I Si = X. A cover S is said to be open (closed) if each Si is open (closed). If 0 0 S = fSjgj2J is a second cover, then we say that; 0 0 1) S is a subcover of S if J ⊆ I and Sj = Sj for each j 2 J . 0 0 0 0 2) S is a refinement of S if for each Sj 2 S there exists Si 2 S with Sj ⊆ Si. If I = J , then we say that the refinement S0 of S is precise. 0 0 0 0 3) S is a shrinking of S if J = I and for each Sj 2 S it holds that Sj ⊆ Sj. Note that a subcover is a refinement, and a shrinking is a refinement. A space is compact if and only if every open cover has a finite subcover if and only if every open cover has a finite refinement. Definition 2 A collection of subsets S = fSigi2I of a space X is said to be; 1) discrete if each point x 2 X has a neighbourhood intersecting at most one of the sets in S. 2) locally-finite if each point x 2 X has a neighbourhood intersecting at most finitely many of the sets in S. 1 3) point-finite if each point x 2 X is contained in at most finitely many of the sets in S. Clearly a discrete or finite family of subsets is locally-finite, and a locally-finite family is point- finite. A subfamily of a discrete/locally-finite/point-finite family is itself discrete/locally- finite/point-finite. Lemma 1.1 Let X be a space and S = fSigI a family of subsets Si ⊆ X. Then the following statements hold. S S 1) If S is locally-finite, then I Si = I Si. S 2) If S is locally-finite and each Si is closed, then Si is closed. If each Si is both open S I and closed, then I Si is both open and closed. 3) If S is locally-finite (discrete), then the family fSigI is also locally-finite (discrete). 4) If S is locally-finite and K ⊆ X is compact, then K meets at most finitely many of the sets in S. S S S Proof 1) Clearly I Si ⊆ I Si since each Si ⊆ I Si. To show the reverse inclusion S let x 2 Si and choose a neighbourhood V of x meeting only finitely many of the Si. I S Then given an arbitrary neighbourhood U of x, the set U \ V meets I Si nontrivially by assumption, but by construction meets only finitely many of the Si nontrivially, say Sn S1;:::;Sn. This implies that U meets i=1 Si, and since U was arbitrary we can conclude Sn that x 2 i=1 Si. This now implies that Sn Sn S x 2 i=1 Si = i=1 Si ⊆ I Si: (1.1) Parts 2) and 3) now follow easily. For part 4) we can cover K with a finite number of open sets, each of which meets at most finitely many of the sets in S. 2 Partitions of Unity Given a family ftjgi2J of non-negative real numbers tj 2 [0; 1) we understand their sum to be defined by the equation X X tj = sup tj: (2.1) E⊆J finite j2J j2E If ξ : X ! R is a continuous function we call ξ−1(0) its zero set and ξ−1(R n 0) its cozero set. We call the closure Supp(ξ) = ξ−1(R n 0) (2.2) the support of ξ. 2 Definition 3 Let X be a space. A family fξjgj2J of continuous functions ξj : X ! [0; 1] is said to be a partition of unity if for each x 2 X it holds that X ξj(x) = 1: (2.3) j2J Write −1 Ξ = ξj (0; 1] j2J (2.4) for the associated family of cozero sets. • We say that fξjgJ is point-finite if Ξ is a point finite open covering of X. • We say that fξjgJ is locally-finite if Ξ is a locally finite open covering of X. Definition 4 Let X be a space. Let U = fUigi2I be an open covering of X and fξjgj2J a partition of unity on X. Set −1 Ξ = fξj (0; 1]gj2J : (2.5) • We say that fξjgJ is subordinate to U if Ξ is an open refinement of U. • We say that fξjgJ is a numeration of U if Ξ is a locally-finite shrinking of U. • We say that U is numerable if it has a numeration. P Unraveling the definitions we have the following. The condition J ξj(x) = 1 for each x 2 X implies that ξj(x) = 0 for all but countably many j 2 J . The partition of unity fξjgJ is point-finite if for each x 2 X we have ξj(x) = 0 for all but finitely many j 2 J . It is locally-finite if each x 2 X has a neighbourhood U such that ξjjU = 0 for all but finitely many j 2 J . If fξjgJ is locally-finite, then according to Lemma 1.1, so is the family of −1 supports fξj (0; 1]gJ . If fξjgJ is subordinated to an open cover U = fUigI , then for each −1 j 2 J we have ξ (0; 1] ⊆ Ui for some i 2 I. If fξjgJ is a numeration of U, then I = J , −1 and for each i 2 I we have Supp(ξi) = ξi (0; 1] ⊆ Ui. Before continuing we must make it clear that our definitions above are not completely standard. For starters, many authors require all partitions of unity to be locally-finite. We view this as unnecessarily restrictive, since many of the most natural things to write down often fail to be locally-finite. In particular, the algebraic methods used for constructing partitions of unity very rarely yield locally-finite families. A second difference is that our usage of the word `subordinate' differs from many texts, where it appears in place of our `numerable'. In any case it is the locally finite partitions of unity which one would always prefer to work with if possible. From our perspective we will for the most part be able to sweep all references to partitions of unity under the rug, and work solely with numerable coverings, once we have established their existence. Our viewpoint, then, is that our machinery should be flexible enough to allow for a reasonably 3 general input, and yet from it produce from it the most usable output. The rest of this section is dedicated to assembling this machinery. Any real-valued map π : X ! R determines a non-negative function π+ : X ! [0; 1); x 7! maxfπ(x); 0g: (2.6) P If fπigI are a locally-finite family of maps πi : X ! [0; 1) such that I πi is positive and finite throughout X, then the collection of functions 0 πi(x) πi(x) = P ; i 2 I (2.7) I πj(x) 0 forms a locally-finite partition of unity on X. The continuity of the πi follows from the P assumption of local finiteness, since this implies that locally on X the sum I πj has only finitely many terms. Lemma 2.1 Let fξjgJ be a partition of unity on a space X and > 0. Then each point x 2 X has a neighourhood Ux() ⊆ X such that ξj < throughout Ux() for all but finitely many j 2 J . P Proof For fixed x 2 X there is a finite subset E ⊆ I such that j2E ξj(x) > 1 − . Since E is finite n P o Ux() = y 2 X j2E ξj(y) > 1 − (2.8) is an open set containing x. If ξk(x) ≥ then it must be that k 2 E, since if it is not, then X ξk(x) + ξj(x) > 1 (2.9) j2E which is a contradiction to the fact that the ξj form a partition of unity. Corollary 2.2 If fξjgJ is a partition of unity on a space X, then the function µ : X ! [0; 1]; x 7! sup ξj(x) (2.10) J agrees locally with the maximum over a finite subset E ⊆ J . In particular it is strictly positive and continuous. Proof For x 2 X fix 0 < < µ(x) and let Ux() ⊆ X be as in 2.1. Choose a finite E ⊆ J such that if k 62 E, then ξk < outside of Ux(). Then on Ux() the function µ agrees with the continuous function y 7! maxE ξj(y). Theorem 2.3 Let fσigi2I be a partition of unity on a space X. Then there exists a locally- finite partition of unity fξigi2I on X indexed by the same set such that for each i 2 I it holds that −1 Supp(ξi) ⊆ σi (0; 1]: (2.11) −1 In particular the open covering fσi (0; 1]gI is numerable. 4 Proof Let µ = sup σi be as in 2.2.