TheoremBase

Kit for def:complete-metric-space

Completeness of a metric space, with the space and the metric as variables, is expressed by a predicative formula at any variable positions; for a fixed set, the metrics making it a complete metric space form a class.

Statement

In the setting of Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity, let n≥1n\ge1 be a metatheoretic number, let x0,…,xn−1x_{0},\dots,x_{n-1} be distinct set variables, and let i,j<ni,j<n, not necessarily distinct. A condition on x0,…,xn−1x_{0},\dots,x_{n-1} is predicative if it is expressed by a predicative formula, with x0,…,xn−1x_{0},\dots,x_{n-1} in place of the set variables listed in Conditions Expressed by a Predicative Formula, and Guards (i) and no displayed variables; N\mathbb{N}, R\mathbb{R}, the order ≤\le, the strict order <<, the addition ++ and the element 00 of R\mathbb{R} are parameters. Metric spaces and metrics are as in Metric Space (vi) and Metric Space (i), and complete metric spaces as in Complete Metric Space (i). In the first clause X=xiX=x_{i} and d=xjd=x_{j}.

Complete metric spaces. The condition "Γ\Gamma, and (X,d)(X,d) is complete" on x0,…,xn−1x_{0},\dots,x_{n-1}, where Γ\Gamma is "dd is a map from the Cartesian product X×XX\times X to R\mathbb{R}, and (X,d)(X,d) is a metric space", is predicative.

The class of complete metrics. For every set XX there is a class SS such that, for every class dd, d∈Sd\in S if and only if dd is a map from X×XX\times X to R\mathbb{R} that is a metric on XX and (X,d)(X,d) is complete.

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…