TheoremBase

A Countable Uniformly Dense Family of Lipschitz Functions on a Compact Metric Space

Statement

Let (K,d)(K,d) be a metric space with KK nonempty, and let Td\mathcal{T}_d be the collection of subsets of KK that are open in (K,d)(K,d), which is a topology on KK by Metric Open Sets Form a Topology. Assume that KK is compact in (K,Td)(K,\mathcal{T}_d).

Let R\mathbb{R} denote the real numbers, with the addition, multiplication, identities, additive inverses, multiplicative inverses and order of their ordered field structure; for s,t∈Rs,t\in\mathbb{R} write s−ts-t for s+(−t)s+(-t), write s<ts<t to mean that s≤ts\le t and s≠ts\ne t, write s−1s^{-1} for the multiplicative inverse of ss when s≠0s\ne 0, let ∣s∣|s| be the absolute value of ss, and let dRd_{\mathbb{R}} be given by dR(s,t)=∣s−t∣d_{\mathbb{R}}(s,t)=|s-t|, which is a metric on R\mathbb{R} by The Absolute Value Metric on the Real Line.

Then the following hold.

1. (Uniform approximation by Lipschitz functions) For every map f:K→Rf:K\to\mathbb{R} that is continuous on KK as a map from (K,d)(K,d) to (R,dR)(\mathbb{R},d_{\mathbb{R}}), and for every ε∈R\varepsilon\in\mathbb{R} with 0<ε0<\varepsilon, there exists a map g:K→Rg:K\to\mathbb{R} that is Lipschitz as a map from (K,d)(K,d) to (R,dR)(\mathbb{R},d_{\mathbb{R}}) and satisfies

∣f(x)−g(x)∣≤εfor every x∈K.|f(x)-g(x)|\le\varepsilon\qquad\text{for every }x\in K .

2. (A countable uniformly dense family) There exists a countable set G\mathcal{G} whose elements are maps from KK to R\mathbb{R}, such that every g∈Gg\in\mathcal{G} is Lipschitz as a map from (K,d)(K,d) to (R,dR)(\mathbb{R},d_{\mathbb{R}}) and is bounded, and such that for every map f:K→Rf:K\to\mathbb{R} continuous on KK and every ε∈R\varepsilon\in\mathbb{R} with 0<ε0<\varepsilon there exists g∈Gg\in\mathcal{G} with

∣f(x)−g(x)∣≤εfor every x∈K.|f(x)-g(x)|\le\varepsilon\qquad\text{for every }x\in K .

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…