TheoremBase

The predicative formula for metric spaces conjoined with the predicative formula for convergence, read with the space and the metric as variables, expresses convergence; quantifying the limit variable existentially gives convergent sequences, renaming moves both to any positions, and class comprehension with the space, the metric and the point as parameters gives the two classes.

Proof

Throughout, formulas are written with abbreviations as in Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (vi), a formula being predicative when it is so with its abbreviations eliminated, and the given x0,…,xn−1x_{0},\dots,x_{n-1} are the first of distinct set variables x0,x1,…x_{0},x_{1},\dots as in Renaming and Substituting Variables in Predicative Formulas, so that x0,x1,x2,x3x_{0},x_{1},x_{2},x_{3} are distinct also when n<4n<4. The parameters are those of the statement, variables other than x0,x1,…x_{0},x_{1},\dots, at their fixed values as in Conditions Expressed by a Predicative Formula, and Guards (i): N\mathbb{N}, R\mathbb{R}, ≤\le, <<, ++ and 00 are those of the setting of the statement, which are also those of the lemmas applied below. Routine set bookkeeping is used without comment: elements of classes are sets (Classes, Membership, Sets and Proper Classes (i)), and so are maps f:A→Bf:A\to B between sets, which lie in the class BAB^{A} of functions from AA to BB (Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (ii), The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i)), in particular both components of a metric space (Metric Space) and the sequences in a set; and a one-entry tuple ⟨a⟩\langle a\rangle is aa (The Ordered Pair of Two Sets and Nested Tuples (ii)).

The formula for metric spaces. By Kit for def:metric-space (vi) with n=2n=2, i=0i=0 and j=1j=1, there is a predicative formula ρ(x0,x1)\rho(x_{0},x_{1}) in x0,x1x_{0},x_{1}, with parameters among R\mathbb{R}, ++, 00 and ≤\le, that holds, under every assignment of sets to x0x_{0} and x1x_{1}, if and only if x1x_{1} is a map x0×x0→Rx_{0}\times x_{0}\to\mathbb{R} and (x0,x1)(x_{0},x_{1}) is a metric space (Metric Space (vi)). For arbitrary sets, "(X,d)(X,d) is a metric space" includes the standing hypothesis of Metric Space that dd is a map from the Cartesian product X×XX\times X to R\mathbb{R}, so ρ\rho expresses it with X=x0X=x_{0} and d=x1d=x_{1}.

Earlier readings. The helper Predicative Formulas for Convergence and Limits, and Maps Defined by Limits applied below is stated for the readings Metric Space (vi), Sequences (i), Convergent Sequence in a Metric Space (i) and Convergent Sequence in a Metric Space (ii); they agree with the current ones by The Earlier and the New Versions of the Definitions of Metric Spaces, Convergence, Continuity and Compactness Agree (i), The Earlier and the New Versions of the Definitions of Sequences, Limits, Cauchy Sequences, Series and Iterated Operations Agree (i) and The Earlier and the New Versions of the Definitions of Metric Spaces, Convergence, Continuity and Compactness Agree (iii).

The formula for convergence. Apply Predicative Formulas for Convergence and Limits, and Maps Defined by Limits (i) with the set variables x0x_{0} and x1x_{1} as its parameters XX and dd, x2x_{2} as its variable ss, x3x_{3} as its variable zz, and its variables ε\varepsilon, NN and mm, and z′z' any further set variable, distinct from one another, from x0,x1,…x_{0},x_{1},\dots and from the parameters. In its formula take the auxiliary set variables pp, uu, u′u', vv and v′v' of μ\mu from Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (vii) pairwise distinct and distinct from x0,x1,…x_{0},x_{1},\dots, from ε\varepsilon, NN and mm, and from the parameters; with x2x_{2}, N\mathbb{N} and x0x_{0} as its FF, AA and BB, this meets the distinctness hypotheses of that lemma. Let κ(x0,x1,x2,x3)\kappa(x_{0},x_{1},x_{2},x_{3}) be the resulting formula; it is predicative, and its free variables are x0,…,x3x_{0},\dots,x_{3} and the parameters N\mathbb{N}, R\mathbb{R}, ≤\le, << and 00. Let

φ(x0,x1,x2,x3)=ρ(x0,x1)∧κ(x0,x1,x2,x3),\varphi(x_{0},x_{1},x_{2},x_{3})=\rho(x_{0},x_{1})\wedge\kappa(x_{0},x_{1},x_{2},x_{3}),

which is predicative, being a conjunction of predicative formulas (Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (v)). Let sets XX, dd, ss and xx be assigned to x0x_{0}, x1x_{1}, x2x_{2} and x3x_{3}. If (X,d)(X,d) is not a metric space, then ρ\rho fails, so φ\varphi fails, and so does the condition

(X,d) is a metric space,s is a sequence in X,x∈X,s→x in (X,d).(X,d)\text{ is a metric space},\quad s\text{ is a sequence in }X,\quad x\in X,\quad s\to x\text{ in }(X,d).

If (X,d)(X,d) is a metric space, then ρ\rho holds, and Predicative Formulas for Convergence and Limits, and Maps Defined by Limits (i), applied to this metric space as the values of its parameters x0x_{0} and x1x_{1} (a statement holds for all values of its parameters satisfying its hypotheses, Conditions Expressed by a Predicative Formula, and Guards (i)), says that κ\kappa holds if and only if ss is a sequence in XX, x∈Xx\in X and ss converges to xx in (X,d)(X,d). In both cases φ\varphi holds if and only if the displayed condition does. So φ\varphi is a predicative formula in x0,…,x3x_{0},\dots,x_{3}, in the sense of Renaming and Substituting Variables in Predicative Formulas, expressing the displayed condition with X,d,s,xX,d,s,x the sets assigned to x0,…,x3x_{0},\dots,x_{3}.

Convergence. By Renaming and Substituting Variables in Predicative Formulas (i), with its number of variables equal to 44 and σ(0)=i\sigma(0)=i, σ(1)=j\sigma(1)=j, σ(2)=k\sigma(2)=k and σ(3)=l\sigma(3)=l, the formula φ(xi,xj,xk,xl)\varphi(x_{i},x_{j},x_{k},x_{l}) is a predicative formula in x0,…,xn−1x_{0},\dots,x_{n-1} that holds, under every assignment of sets to x0,…,xn−1x_{0},\dots,x_{n-1}, exactly when (xi,xj)(x_{i},x_{j}) is a metric space, xkx_{k} is a sequence in xix_{i}, xl∈xix_{l}\in x_{i} and xkx_{k} converges to xlx_{l} in (xi,xj)(x_{i},x_{j}). This proves (i).

Convergent sequences. Let

ψ(x0,x1,x2)=ρ(x0,x1)∧∃x3 κ(x0,x1,x2,x3).\psi(x_{0},x_{1},x_{2})=\rho(x_{0},x_{1})\wedge\exists x_{3}\,\kappa(x_{0},x_{1},x_{2},x_{3}).

With the choice of variables made above, ∃x3 κ\exists x_{3}\,\kappa is the formula γ\gamma of Predicative Formulas for Convergence and Limits, and Maps Defined by Limits (ii), which is predicative; so ψ\psi is predicative, being a conjunction of predicative formulas (Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (v)), and its free variables are x0x_{0}, x1x_{1}, x2x_{2} and parameters. Let sets XX, dd and ss be assigned to x0x_{0}, x1x_{1} and x2x_{2}. If (X,d)(X,d) is not a metric space, then ρ\rho fails, and so does ψ\psi. If (X,d)(X,d) is a metric space, then ρ\rho holds, and Predicative Formulas for Convergence and Limits, and Maps Defined by Limits (ii), applied to this metric space as the values of its parameters, says that ∃x3 κ\exists x_{3}\,\kappa holds if and only if ss is a sequence in XX that is convergent in (X,d)(X,d). In both cases ψ\psi holds if and only if (X,d)(X,d) is a metric space and ss is a sequence in XX that is convergent in (X,d)(X,d). By Renaming and Substituting Variables in Predicative Formulas (i), with its number of variables equal to 33 and σ(0)=i\sigma(0)=i, σ(1)=j\sigma(1)=j and σ(2)=k\sigma(2)=k, the formula ψ(xi,xj,xk)\psi(x_{i},x_{j},x_{k}) is a predicative formula in x0,…,xn−1x_{0},\dots,x_{n-1} that holds exactly when (xi,xj)(x_{i},x_{j}) is a metric space and xkx_{k} is a sequence in xix_{i} that is convergent in (xi,xj)(x_{i},x_{j}). This proves (ii).

The class of sequences converging to a point. For a metric space (X,d)(X,d) and x∈Xx\in X, The Class Comprehension Theorem for Predicative Formulas (i), applied to φ\varphi with its abbreviations eliminated, with x2x_{2} as its single variable and x0x_{0}, x1x_{1}, x3x_{3} and the parameters of the statement as its parameters, x0x_{0}, x1x_{1} and x3x_{3} being assigned XX, dd and xx, gives a class CC such that, for every class aa, a∈Ca\in C if and only if aa is a sequence in XX that converges to xx in (X,d)(X,d). This proves (iii).

The class of convergent sequences. Likewise, for a metric space (X,d)(X,d), The Class Comprehension Theorem for Predicative Formulas (i), applied to ψ\psi with its abbreviations eliminated, with x2x_{2} as its single variable and x0x_{0}, x1x_{1} and the parameters of the statement as its parameters, x0x_{0} and x1x_{1} being assigned XX and dd, gives a class CC such that, for every class aa, a∈Ca\in C if and only if aa is a sequence in XX that is convergent in (X,d)(X,d). This proves (iv).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…