TheoremBase

Predicative Formulas for Convergence and Limits, and Maps Defined by Limits

Convergence of a sequence in a metric space to a point is expressed by an explicit predicative formula, which makes the limit a defined set symbol that can be substituted into predicative formulas and used to define maps; for the real line the formula agrees with convergence of real sequences.

Statement

In the setting of The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness, with predicative meant for formulas with abbreviations, let (X,d)(X,d) be a metric space. The letters ss, zz, z′z', ε\varepsilon, NN and mm are distinct set variables, and XX, dd, N\mathbb{N}, R\mathbb{R} and the order ≤\le, the strict order << and the element 00 of R\mathbb{R} are parameters. In the formula κ\kappa below, ≤\le, << and 00 are those of R\mathbb{R}; on elements of N\mathbb{N}, ≤\le agrees with the order of N0\mathbb{N}_{0} by The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness §agreement.

The formula κ(s,z)\kappa(s,z) below, μ\mu being as in Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity §map, is predicative; for sets ss and zz it holds if and only if ss is a sequence in XX, z∈Xz\in X and ss converges to zz in (X,d)(X,d):

μ(s,N,X)∧z∈X∧∀ε ((ε∈R∧0<ε)⇒∃N (N∈N∧∀m ((m∈N∧N≤m)⇒d(s(m),z)<ε))).\mu(s,\mathbb{N},X)\wedge z\in X\wedge\forall\varepsilon\,((\varepsilon\in\mathbb{R}\wedge0<\varepsilon)\Rightarrow\exists N\,(N\in\mathbb{N}\wedge\forall m\,((m\in\mathbb{N}\wedge N\le m)\Rightarrow d(s(m),z)<\varepsilon))).

The formula γ(s)\gamma(s), that is ∃z κ(s,z)\exists z\,\kappa(s,z), is predicative and holds if and only if ss is a sequence in XX convergent in (X,d)(X,d).

Let υ(s)\upsilon(s) be the formula ∀z ∀z′ ((κ(s,z)∧κ(s,z′))⇒z=z′)\forall z\,\forall z'\,((\kappa(s,z)\wedge\kappa(s,z'))\Rightarrow z=z'), where κ(s,z′)\kappa(s,z') is κ(s,z)\kappa(s,z) with z′z' put for zz, and let γ′(s)\gamma'(s) be γ(s)∧υ(s)\gamma(s)\wedge\upsilon(s). Then κ(s,z)\kappa(s,z) and γ′(s)\gamma'(s) are predicative, and for all values of the parameters and every set ss satisfying γ′(s)\gamma'(s), exactly one set zz satisfies κ(s,z)\kappa(s,z). As dd is a metric on XX, υ(s)\upsilon(s) holds for every set ss, so that γ′(s)\gamma'(s) holds if and only if γ(s)\gamma(s); and then that set zz is the limit lim⁡s=lim⁡m→∞sm\lim s=\lim_{m\to\infty}s_{m}. So lim⁡s\lim s is a defined set symbol with argument ss given by κ\kappa, used properly where γ(s)\gamma(s) holds, and Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols §elimination applies to it with κ\kappa as its θ\theta and γ′\gamma' as its γ\gamma.

For the distance dRd_{\mathbb{R}} on R\mathbb{R}, (R,dR)(\mathbb{R},d_{\mathbb{R}}) is a metric space, and for it κ(s,z)\kappa(s,z) holds if and only if ss is a sequence in R\mathbb{R} that converges to z∈Rz\in\mathbb{R}; then z=lim⁡sz=\lim s, and lim⁡s=lim⁡n→∞sn\lim s=\lim_{n\to\infty}s_{n} of The Limit of a Convergent Sequence §limit.

For a set aa and an expression t(u)t(u) as in Maps and Relations Given by Formulas §map that is a convergent sequence in XX for every u∈au\in a, exactly one map f:a→Xf:a\to X has f(u)=lim⁡t(u)f(u)=\lim t(u) for every u∈au\in a.

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…