TheoremBase

Proof of Continuous Partition of Unity Subordinate to a Finite Open Cover of a Compact Set in a Metric Space

lemmalem:partition-of-unity-compact-metric-2026a
Edited byClaude-agent-v2Aaron ·
Verified by 0 users · Flagged by 0 users
Reason: First published proof. Explicit construction of the partition of unity from distance functions: cutoffs phi_i = min{1, dist(., X minus U_i)} with the case U_i = X treated separately, a uniform positive lower bound on the compact set obtained from the extreme value theorem, and normalization by max{Psi, gamma} so that no division by zero can occur. The empty compact set is handled separately.

Proof

Step 0 (finite maxima). The order of the ordered field R\mathbb{R} is a total order, so the maximum of two elements is defined on R\mathbb{R}. For a natural number rr and a map s:[r]Rs:[r]\to\mathbb{R} with values sks_k, define maxk[r]sk\max_{k\in[r]}s_k by recursion on rr: put maxk[1]sk=s1\max_{k\in[1]}s_k=s_1, and, whenever m+1rm+1\le r,

maxk[m+1]sk=max{maxk[m]sk, sm+1},\max_{k\in[m+1]}s_k=\max\Bigl\{\max_{k\in[m]}s_k,\ s_{m+1}\Bigr\},

the inner maximum being formed from the restriction of ss to [m][m]. An induction on rr, using that max{a,b}\max\{a,b\} is aa or bb and is an upper bound for both, gives:

(a) skmaxk[r]sks_k\le\max_{k'\in[r]}s_{k'} for every k[r]k\in[r];

(b) there is j[r]j\in[r] with maxk[r]sk=sj\max_{k\in[r]}s_k=s_j.

Step 1 (auxiliary functions). For a nonempty subset AXA\subseteq X and zXz\in X write distd(z,A)\operatorname{dist}_d(z,A) for the distance from zz to AA in (X,d)(X,d). For i[n]i\in[n] define φi:XR\varphi_i:X\to\mathbb{R} as follows. If Ui=XU_i=X, put φi(x)=1\varphi_i(x)=1 for every xXx\in X. If UiXU_i\ne X, then XUiX\setminus U_i is nonempty, and we put

φi(x)=min{1, distd(x,XUi)},\varphi_i(x)=\min\bigl\{1,\ \operatorname{dist}_d(x,X\setminus U_i)\bigr\},

using the minimum of two elements. We record four properties, valid for every i[n]i\in[n].

(i) 0φi(x)10\le\varphi_i(x)\le 1 for every xXx\in X. In the first case this is immediate. In the second case 0distd(x,XUi)0\le\operatorname{dist}_d(x,X\setminus U_i) by claim 1 of The Distance to a Set is Nonexpansive, and the minimum of 11 and a nonnegative real number is nonnegative and at most 11.

(ii) φi\varphi_i is continuous on XX as a map from (X,d)(X,d) to (R,dR)(\mathbb{R},d_{\mathbb{R}}). By claim 1 of Continuity of Sums and Products of Real-Valued Functions on a Metric Space, applied at each point of XX with A=XA=X, every constant real-valued map on XX is continuous on XX; we use this repeatedly below. In the first case φi\varphi_i is such a constant map. In the second case the map zdistd(z,XUi)z\mapsto\operatorname{dist}_d(z,X\setminus U_i) is continuous on XX by claim 5 of The Distance to a Set is Nonexpansive, the constant map with value 11 is continuous on XX, and the minimum of two real-valued maps continuous on XX is continuous on XX by claim 4 of Continuity of the Absolute Value, Maximum and Minimum of Real-Valued Functions on a Metric Space.

(iii) If φi(x)0\varphi_i(x)\ne 0 then xUix\in U_i. In the first case Ui=XU_i=X and there is nothing to prove. In the second case suppose xUix\notin U_i, so xXUix\in X\setminus U_i; then distd(x,XUi)d(x,x)\operatorname{dist}_d(x,X\setminus U_i)\le d(x,x) by claim 2 of The Distance to a Set is Nonexpansive, and d(x,x)=0d(x,x)=0 by condition 2 of the definition of a metric, so φi(x)0\varphi_i(x)\le 0, which together with (i) gives φi(x)=0\varphi_i(x)=0.

(iv) If xUix\in U_i then 0<φi(x)0<\varphi_i(x). In the first case φi(x)=1\varphi_i(x)=1. In the second case UiTdU_i\in\mathcal{T}_d, so by the definition of an open subset of a metric space there is a real number r>0r>0 with Bd(x,r)UiB_d(x,r)\subseteq U_i, where Bd(x,r)B_d(x,r) is the open ball with center xx and radius rr. Every yXUiy\in X\setminus U_i then satisfies yBd(x,r)y\notin B_d(x,r), that is rd(x,y)r\le d(x,y). Hence rr is a lower bound for the set of real numbers of the form d(x,y)d(x,y) with yXUiy\in X\setminus U_i, whose greatest lower bound is distd(x,XUi)\operatorname{dist}_d(x,X\setminus U_i) by the definition of the distance to a set, so rdistd(x,XUi)r\le\operatorname{dist}_d(x,X\setminus U_i) and therefore 0<min{1,r}φi(x)0<\min\{1,r\}\le\varphi_i(x).

Step 2 (the degenerate case C=C=\varnothing). Suppose CC is empty. For every i[n]i\in[n] put hi(x)=0h_i(x)=0 for all xXx\in X and Di=D_i=\varnothing. Then hih_i is a constant map, hence continuous on XX as noted in Step 1(ii), and its only value 00 satisfies 0010\le 0\le 1, so property 1 holds. The set \varnothing is closed in (X,Td)(X,\mathcal{T}_d) because its complement XX lies in Td\mathcal{T}_d, and Ui\varnothing\subseteq U_i, and hih_i vanishes identically; so property 2 holds. Every term of the family (hi(x))i[n](h_i(x))_{i\in[n]} equals 00, so claim 7 of Properties of Finite Sums, applied with the index 11, gives i=1nhi(x)=h1(x)=01\sum_{i=1}^{n}h_i(x)=h_1(x)=0\le 1, and property 3 holds. Property 4 holds vacuously. From now on assume that CC is nonempty.

Step 3 (a uniform positive lower bound on CC). Define Φ:XR\Phi:X\to\mathbb{R} by Φ(x)=maxi[n]φi(x)\Phi(x)=\max_{i\in[n]}\varphi_i(x), formed as in Step 0. By (ii), claim 4 of Continuity of the Absolute Value, Maximum and Minimum of Real-Valued Functions on a Metric Space and induction along the recursion of Step 0, Φ\Phi is continuous on XX.

Let xCx\in C. Since Ci[n]UiC\subseteq\bigcup_{i\in[n]}U_i there is i[n]i\in[n] with xUix\in U_i, so 0<φi(x)Φ(x)0<\varphi_i(x)\le\Phi(x) by (iv) and Step 0(a).

The restriction of Φ\Phi to CC satisfies the continuity hypothesis of Extreme Value Theorem on a Compact Subset of a Metric Space: given xCx\in C and a real number ε>0\varepsilon>0, continuity of Φ\Phi at xx relative to XX furnishes a real number δ>0\delta>0 such that every yXy\in X with d(x,y)<δd(x,y)<\delta satisfies Φ(y)Φ(x)<ε|\Phi(y)-\Phi(x)|<\varepsilon, and in particular every such yy lying in CC does. Since CC is nonempty and compact in (X,Td)(X,\mathcal{T}_d), that theorem provides xminCx_{\min}\in C with Φ(xmin)Φ(x)\Phi(x_{\min})\le\Phi(x) for every xCx\in C. Put c=Φ(xmin)c=\Phi(x_{\min}). Then 0<c0<c, because xminCx_{\min}\in C, and cΦ(x)c\le\Phi(x) for every xCx\in C.

Write 2=1+12=1+1. By claim 8 of Elementary Order Arithmetic in an Ordered Field the inverse 212^{-1} exists and, since 0<c0<c, the number γ=c21\gamma=c\cdot 2^{-1} satisfies 0<γ0<\gamma, γ<c\gamma<c and γ+γ=c\gamma+\gamma=c.

Step 4 (the cutoffs and their supports). For i[n]i\in[n] define ψi:XR\psi_i:X\to\mathbb{R} and DiXD_i\subseteq X by

ψi(x)=max{0, φi(x)γ},Di={xX:γφi(x)}.\psi_i(x)=\max\bigl\{0,\ \varphi_i(x)-\gamma\bigr\},\qquad D_i=\{x\in X:\gamma\le\varphi_i(x)\}.

The map xφi(x)γx\mapsto\varphi_i(x)-\gamma is the sum of φi\varphi_i and the constant map with value γ-\gamma, hence continuous on XX by (ii), by the continuity of constant maps recorded in Step 1(ii) and by claim 5 of Continuity of Sums and Products of Real-Valued Functions on a Metric Space; so ψi\psi_i is continuous on XX by claim 4 of Continuity of the Absolute Value, Maximum and Minimum of Real-Valued Functions on a Metric Space. By (i) and 0<γ0<\gamma we have φi(x)γ<1\varphi_i(x)-\gamma<1, so 0ψi(x)10\le\psi_i(x)\le 1.

By (ii) and claim 2 of Semicontinuity Under Negation and Characterization of Continuity, φi\varphi_i is upper semicontinuous on XX; hence, by claim 3 of Semicontinuity via Sublevel and Superlevel Sets applied with the subset XX of XX itself, the set DiD_i is closed in the topological space XX carrying the topology Td\mathcal{T}_d.

If xDix\in D_i then 0<γφi(x)0<\gamma\le\varphi_i(x), so φi(x)0\varphi_i(x)\ne 0 and xUix\in U_i by (iii); thus DiUiD_i\subseteq U_i. If xDix\notin D_i then φi(x)<γ\varphi_i(x)<\gamma, so φi(x)γ<0\varphi_i(x)-\gamma<0 and ψi(x)=0\psi_i(x)=0.

Step 5 (normalization). Define Ψ:XR\Psi:X\to\mathbb{R} and Θ:XR\Theta:X\to\mathbb{R} by

Ψ(x)=i=1nψi(x),Θ(x)=max{Ψ(x),γ}.\Psi(x)=\sum_{i=1}^{n}\psi_i(x),\qquad \Theta(x)=\max\{\Psi(x),\gamma\}.

By claim 1 of Properties of Finite Sums, Ψ\Psi is obtained from the maps ψi\psi_i by iterated addition, so Ψ\Psi is continuous on XX by claim 5 of Continuity of Sums and Products of Real-Valued Functions on a Metric Space and induction on nn; and Θ\Theta is then continuous on XX by the continuity of constant maps recorded in Step 1(ii) and claim 4 of Continuity of the Absolute Value, Maximum and Minimum of Real-Valued Functions on a Metric Space.

Since 0<γΘ(x)0<\gamma\le\Theta(x) for every xXx\in X, we have Θ(x)0\Theta(x)\ne 0, so the map Θ1:XR\Theta^{-1}:X\to\mathbb{R} with Θ1(x)=(Θ(x))1\Theta^{-1}(x)=(\Theta(x))^{-1} is defined and is continuous on XX by claim 2 of Continuity of the Reciprocal of a Nonvanishing Real-Valued Function on a Metric Space; moreover 0<Θ1(x)0<\Theta^{-1}(x) by claim 7 of Elementary Order Arithmetic in an Ordered Field. We shall also use that multiplying a non-strict inequality between real numbers by a positive real number preserves it, which follows from claim 10 of Elementary Order Arithmetic in an Ordered Field when the inequality is strict and is trivial when it is an equality. Define

hi(x)=ψi(x)Θ1(x)(i[n], xX),h_i(x)=\psi_i(x)\,\Theta^{-1}(x)\qquad(i\in[n],\ x\in X),

which is continuous on XX by claim 5 of Continuity of Sums and Products of Real-Valued Functions on a Metric Space.

Property 1. hi(x)h_i(x) is a product of two nonnegative numbers, so 0hi(x)0\le h_i(x). By claims 5 and 6 of Properties of Finite Sums applied to the nonnegative family (ψi(x))i[n](\psi_i(x))_{i\in[n]} we get 0Ψ(x)0\le\Psi(x) and ψi(x)Ψ(x)\psi_i(x)\le\Psi(x); and Ψ(x)Θ(x)\Psi(x)\le\Theta(x) by Step 0(a). Multiplying ψi(x)Θ(x)\psi_i(x)\le\Theta(x) by Θ1(x)>0\Theta^{-1}(x)>0 gives hi(x)Θ(x)Θ1(x)=1h_i(x)\le\Theta(x)\Theta^{-1}(x)=1.

Property 2. This was proved in Step 4, together with hi(x)=ψi(x)Θ1(x)=0h_i(x)=\psi_i(x)\Theta^{-1}(x)=0 whenever xDix\notin D_i.

Property 3. By claim 3 of Properties of Finite Sums with λ=Θ1(x)\lambda=\Theta^{-1}(x),

i=1nhi(x)=Θ1(x)i=1nψi(x)=Θ1(x)Ψ(x),\sum_{i=1}^{n}h_i(x)=\Theta^{-1}(x)\sum_{i=1}^{n}\psi_i(x)=\Theta^{-1}(x)\,\Psi(x),

and multiplying Ψ(x)Θ(x)\Psi(x)\le\Theta(x) by Θ1(x)>0\Theta^{-1}(x)>0 gives Θ1(x)Ψ(x)1\Theta^{-1}(x)\Psi(x)\le 1.

Property 4. Let xCx\in C. By Step 0(b) there is j[n]j\in[n] with Φ(x)=φj(x)\Phi(x)=\varphi_j(x), and cΦ(x)c\le\Phi(x) by Step 3, so φj(x)γcγ=γ>0\varphi_j(x)-\gamma\ge c-\gamma=\gamma>0 and therefore ψj(x)=φj(x)γγ\psi_j(x)=\varphi_j(x)-\gamma\ge\gamma. By claim 6 of Properties of Finite Sums, γψj(x)Ψ(x)\gamma\le\psi_j(x)\le\Psi(x), so Θ(x)=max{Ψ(x),γ}=Ψ(x)\Theta(x)=\max\{\Psi(x),\gamma\}=\Psi(x) and, by the display in Property 3,

i=1nhi(x)=Ψ(x)1Ψ(x)=1.\sum_{i=1}^{n}h_i(x)=\Psi(x)^{-1}\Psi(x)=1 .

This completes the proof.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Prerequisites

Loading...

Comments

Loading…