TheoremBase

The convergence formula quantifies over sets only and its values are used properly, so it is predicative and unwinds to convergence in the metric space; uniqueness of limits makes the limit a defined set symbol, which then substitutes into formulas, agrees with the real limit on the real line, and defines maps.

Proof

Each result cited is universally quantified over the data in its own statement.

Clause converges. Predicativity. Write μ(s,N,X)\mu(s,\mathbb{N},X) out as the formula μ(F,A,B)\mu(F,A,B) of 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 with ss, N\mathbb{N} and XX put for FF, AA and BB; its quantifiers are over set variables only. The remaining quantifiers ∀ε\forall\varepsilon, ∃N\exists N and ∀m\forall m of κ\kappa are over set variables. The abbreviations written in κ\kappa are the ordered pair, the values s(m)s(m) and d(s(m),z)=d((s(m),z))d(s(m),z)=d((s(m),z)) of Sets and Maps: Ordinary Notation §maps, which are defined set symbols by Functions, Values of a Function, and Functions from One Class to Another §value, and the relation notation N≤mN\le m, 0<ε0<\varepsilon and d(s(m),z)<εd(s(m),z)<\varepsilon, which stands for membership of an ordered pair in the parameter ≤\le or << by Relations, Domain, Range, Inverse and Composition §relation; no class abstraction is written in κ\kappa. So no quantifier of κ\kappa is applied to a class variable, and κ\kappa is predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols §closure.

Meaning. Let ss and zz be sets. By 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, μ(s,N,X)\mu(s,\mathbb{N},X) holds if and only if ss is a map s:N→Xs:\mathbb{N}\to X, that is, by Sequences §sequence, a sequence in XX. If ss is not a sequence in XX or z∉Xz\notin X, then κ(s,z)\kappa(s,z) fails by its first two conjuncts, and so does the right-hand side of the claim. Let now ss be a sequence in XX and z∈Xz\in X. By Metric Space, dd is a map d:X×X→Rd:X\times X\to\mathbb{R}. For m∈Nm\in\mathbb{N}, the value s(m)s(m) is used properly, since dom⁡s=N\operatorname{dom}s=\mathbb{N} by Functions, Values of a Function, and Functions from One Class to Another §map; s(m)∈Xs(m)\in X by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol §graph; hence (s(m),z)∈X×X=dom⁡d(s(m),z)\in X\times X=\operatorname{dom}d by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set §membership and Functions, Values of a Function, and Functions from One Class to Another §map, so d((s(m),z))d((s(m),z)) is used properly as well, and d(s(m),z)∈Rd(s(m),z)\in\mathbb{R} by Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol §graph. These places of use lie under the left conjuncts μ(s,N,X)∧z∈X\mu(s,\mathbb{N},X)\wedge z\in X and the antecedent m∈N∧N≤mm\in\mathbb{N}\wedge N\le m, as Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations §defined-set-symbols requires. By Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols §elimination, applied in turn to the values s(m)s(m) and d(s(m),z)d(s(m),z), each used properly there, and by Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity §pair-membership for the ordered pairs, the part d(s(m),z)<εd(s(m),z)<\varepsilon holds if and only if the real number d(s(m),z)d(s(m),z) is less than ε\varepsilon in R\mathbb{R}. So the third conjunct of κ(s,z)\kappa(s,z) states that for every ε∈R\varepsilon\in\mathbb{R} with ε>0\varepsilon>0 there is N∈NN\in\mathbb{N} with d(s(m),z)<εd(s(m),z)<\varepsilon for every m∈Nm\in\mathbb{N} with m≥Nm\ge N, where for N,m∈NN,m\in\mathbb{N} the order of R\mathbb{R} agrees with that 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. By Convergent Sequence in a Metric Space §converges, this is the statement that ss converges to zz in (X,d)(X,d).

Clause convergent. The formula γ(s)\gamma(s), that is ∃z κ(s,z)\exists z\,\kappa(s,z), is built from κ\kappa by a quantifier over the set variable zz; as no quantifier of κ\kappa is applied to a class variable, neither is any quantifier of γ\gamma, and γ\gamma is predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols §closure. By the clause converges, for every set ss it holds if and only if ss is a sequence in XX and ss converges in (X,d)(X,d) to some z∈Xz\in X, which by Convergent Sequence in a Metric Space §convergent is the statement that ss is convergent in (X,d)(X,d).

Clause limit-symbol. Predicativity. κ\kappa is predicative by the clause converges. The formula κ(s,z′)\kappa(s,z') is κ(s,z)\kappa(s,z) with the set variable z′z', which does not occur in κ\kappa, put for zz, so it has the same quantifiers as κ\kappa; and υ(s)\upsilon(s) and γ′(s)\gamma'(s) are built from κ(s,z)\kappa(s,z), κ(s,z′)\kappa(s,z'), γ(s)\gamma(s) and the formula z=z′z=z' by connectives and quantifiers over the set variables zz and z′z'. As no quantifier of κ\kappa is applied to a class variable, neither is any quantifier of γ′(s)\gamma'(s), and γ′(s)\gamma'(s) is predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols §closure.

Uniqueness. Fix any values of the parameters, and let ss be a set with γ′(s)\gamma'(s). By γ(s)\gamma(s), some set zz satisfies κ(s,z)\kappa(s,z); by υ(s)\upsilon(s), any sets zz and z′z' with κ(s,z)\kappa(s,z) and κ(s,z′)\kappa(s,z') are equal. So exactly one set zz satisfies κ(s,z)\kappa(s,z).

The metric space (X,d)(X,d). Let ss be a set, and let zz and z′z' be sets with κ(s,z)\kappa(s,z) and κ(s,z′)\kappa(s,z'). By the clause converges, ss is a sequence in XX, z,z′∈Xz,z'\in X, and ss converges to zz and to z′z' in (X,d)(X,d); so z=z′z=z' by Uniqueness of Limits in a Metric Space §unique. Hence υ(s)\upsilon(s) holds, and γ′(s)\gamma'(s) holds if and only if γ(s)\gamma(s). Let now γ(s)\gamma(s) hold, so that ss is a convergent sequence in XX by the clause convergent. By The Limit of a Convergent Sequence in a Metric Space §limit and The Limit of a Convergent Sequence in a Metric Space §converges-to-limit, lim⁡m→∞sm\lim_{m\to\infty}s_{m} is a point of XX to which ss converges, so κ(s,lim⁡m→∞sm)\kappa(s,\lim_{m\to\infty}s_{m}) holds by the clause converges, and lim⁡s=lim⁡m→∞sm\lim s=\lim_{m\to\infty}s_{m} is the set zz with κ(s,z)\kappa(s,z).

The defined set symbol. By the above, κ\kappa and γ′\gamma' are predicative and, for all values of the parameters and all sets ss satisfying γ′(s)\gamma'(s), exactly one set zz satisfies κ(s,z)\kappa(s,z); these are the hypotheses of Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols §elimination with k=1k=1, ss for v1v_{1}, κ\kappa for θ\theta and γ′\gamma' for γ\gamma. By Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations §defined-set-symbols, lim⁡s\lim s is then the defined set symbol with argument ss given by the predicative κ\kappa, and it is used properly where γ(s)\gamma(s) holds, since there exactly one set satisfies κ(s,z)\kappa(s,z).

Clause real. By The Distance on the Real Numbers §distance, dRd_{\mathbb{R}} is a map dR:R×R→Rd_{\mathbb{R}}:\mathbb{R}\times\mathbb{R}\to\mathbb{R}, and it is a metric on R\mathbb{R} by The Absolute Value Metric on the Real Numbers §metric; so (R,dR)(\mathbb{R},d_{\mathbb{R}}) is a metric space by Metric Space §metric-space, and the clauses above apply to it. By the clause converges for (R,dR)(\mathbb{R},d_{\mathbb{R}}), κ(s,z)\kappa(s,z) holds if and only if ss is a sequence in R\mathbb{R}, z∈Rz\in\mathbb{R} and ss converges to zz in (R,dR)(\mathbb{R},d_{\mathbb{R}}), and by Convergence, Limits and the Cauchy Condition for Real Sequences Agree with Those in the Real Line as a Metric Space, which is Complete §converges the last condition is equivalent to ss converging to zz in the sense of Convergent Sequences of Real Numbers §converges. Let now κ(s,z)\kappa(s,z) hold. Then γ(s)\gamma(s) holds, so z=lim⁡sz=\lim s by the clause limit-symbol for (R,dR)(\mathbb{R},d_{\mathbb{R}}). Further, ss converges to zz in the sense of Convergent Sequences of Real Numbers §converges, so it is convergent in that sense, and its limit lim⁡n→∞sn\lim_{n\to\infty}s_{n} of The Limit of a Convergent Sequence §limit is z=lim⁡sz=\lim s.

Clause maps. Suppose that t(u)t(u) is a convergent sequence in XX for every u∈au\in a. By the clause limit-symbol, the limit lim⁡s\lim s is a defined set symbol with argument ss, given by the predicative κ\kappa and used properly where γ(s)\gamma(s) holds, that is, by the clause convergent, where ss is a convergent sequence in XX; so in the expression lim⁡t(u)\lim t(u), obtained by putting t(u)t(u) for its argument, every defined set symbol is used properly for every u∈au\in a, and lim⁡t(u)∈X\lim t(u)\in X by The Limit of a Convergent Sequence in a Metric Space §limit. Hence Maps and Relations Given by Formulas §map, applied to the sets aa and XX and this expression, gives exactly one map f:a→Xf:a\to X with f(u)=lim⁡t(u)f(u)=\lim t(u) for every u∈au\in a.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…