Throughout, sums, scalar multiples and products of elements of Cc(X) lie in Cc(X), with the support inclusions of Continuous Functions with Compact Support: the Zero Function, Closure under Operations, Vanishing off the Support, Existence of the Maximum Modulus, and Uniform Continuity (ii), and every f∈Cc(X) vanishes off suppf by Continuous Functions with Compact Support: the Zero Function, Closure under Operations, Vanishing off the Support, Existence of the Maximum Modulus, and Uniform Continuity (iii). For an open set V⊆X we write f≺V if f∈Cc(X), 0≤f≤1 and suppf⊆V; thus μ(V)=sup{Λf:f≺V}.
Step 1 (monotonicity of Λ). If f,g∈Cc(X) and f≤g, then g−f∈Cc(X) and g−f≥0, so by linearity and positivity
Λg−Λf=Λ(g−f)≥0.
Also Λ0=Λ(0⋅0)=0⋅Λ0=0.
Step 2 (elementary properties of μ and μ∗). The constant function 0 satisfies 0≺V for every open V, its support being empty by Continuous Functions with Compact Support: the Zero Function, Closure under Operations, Vanishing off the Support, Existence of the Maximum Modulus, and Uniform Continuity (i); so Λ0=0 lies in the set defining μ(V), and μ(V)∈[0,∞]. If V⊆W are open, every f≺V satisfies f≺W, so μ(V)≤μ(W). If f≺∅ then suppf=∅ and f=0; hence μ(∅)=0. Since X is open, the set defining μ∗(E) is a nonempty subset of [0,∞], so μ∗(E)∈[0,∞] for every E⊆X, and μ∗(∅)≤μ(∅)=0. If E⊆F⊆X, every open set containing F contains E, so μ∗(E)≤μ∗(F). Finally, for open V the set V itself is admitted in the infimum defining μ∗(V), and μ(V)≤μ(W) for every open W⊇V; hence μ∗(V)=μ(V), which is the second assertion of (i).
Step 3 (finite subadditivity on open sets). Let n∈N, let V1,…,Vn⊆X be open and V=V1∪⋯∪Vn; we show μ(V)≤∑i=1nμ(Vi). Let g≺V. Its support K=suppg is compact and contained in V, so Thickenings, Neighbourhoods with Compact Closure, Urysohn Functions and Partitions of Unity in a Locally Compact Metric Space (iv) gives h1,…,hn∈Cc(X) with 0≤hi≤1, supphi⊆Vi, ∑ihi≤1 on X and ∑ihi=1 on K. Each product hig satisfies 0≤hig≤1 and supp(hig)⊆supphi⊆Vi, so hig≺Vi; and g=∑i=1nhig, because ∑ihi(x)=1 for x∈K while g(x)=0 for x∈/K. By linearity,
Λg=i=1∑nΛ(hig)≤i=1∑nμ(Vi),
and taking the supremum over g≺V gives the claim.
Step 4 (countable subadditivity). Let (Am)m∈N be a sequence of subsets of X and A=⋃mAm. If ∑mμ∗(Am)=∞ there is nothing to prove, so let every μ∗(Am) be real and the sum finite, and let ε>0. By the definition of μ∗(Am) as an infimum there is, for each m, an open set Vm⊇Am with μ(Vm)<μ∗(Am)+2−mε; we fix such a sequence (Vm) (by countable choice, which follows from the setting's standing hypothesis of dependent choice). The set V=⋃mVm is open and contains A. Let g≺V. The open sets UN=V1∪⋯∪VN (N∈N) increase and their union V contains the compact set suppg, so suppg⊆UN for some N by Compact Subsets of a Metric Space: Covers by Open Sets, Finite Unions and Increasing Covers; Sublevel Sets of the Distance and Closed Balls (iii). Then g≺UN, and by Step 3
Λg≤μ(UN)≤m=1∑Nμ(Vm)≤m=1∑N(μ∗(Am)+2−mε)≤m∈N∑μ∗(Am)+ε.
Taking the supremum over g≺V and using Step 2, μ∗(A)≤μ(V)≤∑mμ∗(Am)+ε; as ε>0 was arbitrary, μ∗(A)≤∑mμ∗(Am). Together with Step 2 this shows that μ∗ is an outer measure on X, completing the proof of (i).
Step 5 (compact sets: the upper bound). Let K⊆X be compact and put I(K)=inf{Λf:f∈Cc(X), f≥1K}. Let f∈Cc(X) with f≥1K, so in particular f≥0, and let 0<α<1. The set Vα={x∈X:f(x)>α} is open, as f is continuous, and contains K. If g≺Vα then αg≤f: for x∈Vα we have αg(x)≤α<f(x), and for x∈/Vα we have x∈/suppg, so αg(x)=0≤f(x). By Step 1, αΛg≤Λf for every g≺Vα, hence
μ∗(K)≤μ(Vα)≤α−1Λf.
As this holds for every α∈(0,1), μ∗(K)≤Λf, and taking the infimum over f gives μ∗(K)≤I(K).
Step 6 (compact sets: the lower bound). Let V⊇K be open. By Thickenings, Neighbourhoods with Compact Closure, Urysohn Functions and Partitions of Unity in a Locally Compact Metric Space (iii) there is f∈Cc(X) with 0≤f≤1, f=1 on K and suppf⊆V. Then f≥1K and f≺V, so I(K)≤Λf≤μ(V); taking the infimum over V gives I(K)≤μ∗(K). Thus μ∗(K)=I(K), and taking V=X shows μ∗(K)≤Λf<∞ for the function f so obtained. This proves (ii).
Step 7 (open sets are μ∗-measurable). Let U⊆X be open. By Carathéodory's Theorem: the Measurable Sets of an Outer Measure Form a σ-Algebra on Which It Is a Measure (i) it suffices to show μ∗(A∩U)+μ∗(A∖U)≤μ∗(A) for every A⊆X, and for this that μ∗(A∩U)+μ∗(A∖U)≤μ(V) for every open V⊇A. This is clear if μ(V)=∞, so let μ(V)<∞ and ε>0. Since μ(V∩U)≤μ(V)<∞, there is f≺V∩U with Λf>μ(V∩U)−ε. Its support D=suppf is compact, hence closed, so V∖D is open with μ(V∖D)≤μ(V)<∞, and there is g≺V∖D with Λg>μ(V∖D)−ε. Now f+g≺V: its support lies in suppf∪suppg⊆V, and 0≤f+g≤1 because f vanishes off D while g vanishes on D. Since A∩U⊆V∩U and A∖U⊆V∖D (as D⊆U), Step 2 gives
μ(V)≥Λf+Λg>μ(V∩U)+μ(V∖D)−2ε≥μ∗(A∩U)+μ∗(A∖U)−2ε.
As ε>0 was arbitrary, the claim follows.
Step 8 (the Borel measure). By Carathéodory's Theorem: the Measurable Sets of an Outer Measure Form a σ-Algebra on Which It Is a Measure (ii) the set M(μ∗) of μ∗-measurable sets is a σ-algebra on X, and by Step 7 it contains every open set; by The σ-Algebra Generated by a Set of Subsets (ii) it therefore contains the σ-algebra B(X) generated by the open sets. By Carathéodory's Theorem: the Measurable Sets of an Outer Measure Form a σ-Algebra on Which It Is a Measure (iv), μ∗∣M(μ∗) is a measure on (X,M(μ∗)). Its restriction μˉ to the sub-σ-algebra B(X) vanishes at ∅ and is countably additive, since a disjoint sequence in B(X) is one in M(μ∗); so μˉ is a Borel measure on X. This proves (iii).
Step 9 (finiteness on compact sets and outer regularity). A compact K⊆X is closed, hence Borel, and μˉ(K)=μ∗(K)<∞ by (ii). For B∈B(X), the definition of μ∗ and (i) give
μˉ(B)=μ∗(B)=inf{μ(V):V⊇B open}=inf{μˉ(V):V⊇B open},
since μˉ(V)=μ∗(V)=μ(V) for open V.
Step 10 (inner regularity of open sets). Let V⊆X be open. Every compact K⊆V has μˉ(K)≤μˉ(V). Conversely let t be a real number with t<μˉ(V)=μ(V), and choose f≺V with Λf>t. Then K=suppf is compact and K⊆V, and f≺W for every open W⊇K, so Λf≤μ(W) for all such W; hence μˉ(K)=μ∗(K)≥Λf>t. Therefore
μˉ(V)=sup{μˉ(K):K⊆V compact},
and with Step 9 this shows that μˉ is a Radon measure, proving (iv).