Integration, IV, p. 145
Bourbaki marks this one as harder than the rest.
Let X be a nonempty compact space, H a linear subspace of C(X;R) containing the constants and separating the points of X. The relation λ≺μ defined by H (Exer. 2) is then an equivalence relation, and the points H-extremal in the sense of Exer. 3 are identical to the points H-extremal in the sense of No. 3. Let F be a closed subset of X containing ChH(X); for every x∈X, denote by MxF the set of positive measures μ on X, of total mass 1, such that εx≺μ and Supp(μ)⊂F; in order that εx∈MxF, it is necessary and sufficient that x∈F; the relation x∈ChH(X) is equivalent to MxF={εx}. For every bounded numerical function f defined on F and for every x∈X, set
HxF(f)=f≤h∣F, h∈Hinfh(x),HxF(f)=−HxF(−f)=f≥h∣F, h∈Hsuph(x), which are finite numbers.
a) Show that the mapping f↦HxF(f) of C(F;R) into R is increasing, positively homogeneous and convex. If h∈H, then HxF(h)=h(x).
b) For every x∈X, every measure μ∈MxF and every function f∈C(F;R), HxF(f)≤∫fdμ≤HxF(f). Conversely if, for a function f0∈C(F;R), γ is a real number such that HxF(f0)≤γ≤HxF(f0), then there exists a measure μ∈MxF such that γ=∫f0dμ.
c) Show that for a function g∈C(X;R), the following conditions are equivalent: α For every x∈X and every measure μ∈MxF, one has g(x)=∫gdμ. β For every x∈X, HxF(g∣F)=HxF(g∣F)=g(x). γ For every ε>0 there exist two finite sequences (hi′),(hj′′) of functions in H such that, setting h′=sup(hi′), h′′=inf(hj′′), one has h′≤g≤h′′ and h′′−h′≤ε. (To see that β implies γ), argue as in GT, X, §4, No. 1, Prop. 2.)
When a function g∈C(X;R) has the preceding equivalent properties, it is said to be H-harmonic; the set Hc of H-harmonic functions is a closed linear subspace of C(X;R) containing H; it is independent of the closed set F⊃ChH(X) under consideration. One has (Hc)c=Hc, and the equivalence relation in M+(X) defined by Hc is identical to the relation λ≺μ defined by H; consequently ChHc(X)=ChH(X). The mapping g↦g∣F is a strictly increasing isometry of Hc onto its image in C(F;R) (which is therefore a closed subspace of C(F;R)).
d) Take for X the interval [0,1] of R, and for H the vector space of restrictions to X of the polynomials of second degree over R. Show that Hc is distinct from the closure H of H in C(X;R).
e) Show that in order that ChH(X)=X, it is necessary and sufficient that Hc=C(X;R) (to prove that the condition is necessary, use b).
f) Show that if H is lattice-ordered (in other words, is a Riesz space), then Hc=H. Give an example where H is not lattice-ordered and Hc=H.
g) Let EH be the smallest closed subset of C(X;R) containing H such that the lower envelope inf(u,v) of any two functions of EH belongs to EH. Show that the following properties are equivalent: α f∈EH; β for every x∈X and every measure μ∈MxX, ∫fdμ≤f(x); γ HxX(f)=f(x) for every x∈X; δ for every ε>0, there exists a finite sequence (hi) of functions in H such that f≤inf(hi)≤f+ε. (To see that β implies γ), make use of b.) Deduce from this that EH is a pointed convex cone, and that EH∩(−EH)=Hc. Show that every function in EH attains its infimum in X at at least one point of ChH(X).