TheoremBase

For n ≥ 1, n_ℝ is the iterated sum of a fixed constant function e with value 1 over [n], which the predicative formula for iterated operations expresses; the case n = 0 is a disjunct. The function then comes from the scheme for functions given by expressions.

Proof

Throughout, N0=N∪{0}\mathbb{N}_{0}=\mathbb{N}\cup\{0\} with 0∉N0\notin\mathbb{N} (The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion (ii)), and nR∈Rn_{\mathbb{R}}\in\mathbb{R} for every n∈N0n\in\mathbb{N}_{0}: 0R0_{\mathbb{R}} is the zero of R\mathbb{R}, and for n∈Nn\in\mathbb{N} the sum nRn_{\mathbb{R}} is the value at nn of a map from [n][n] to R\mathbb{R} (The Image of a Natural Number in a Commutative Ring (i), Iterated Operations: Finite Sums and Finite Products (i)).

The constant function ee. By Maps and Relations Given by Formulas (i), applied to the sets N0\mathbb{N}_{0} and R\mathbb{R} and the constant expression 11, there is a function e:N0→Re:\mathbb{N}_{0}\to\mathbb{R} with e(k)=1e(k)=1 for every k∈N0k\in\mathbb{N}_{0}. Let n∈Nn\in\mathbb{N}. Then [n]⊆N0[n]\subseteq\mathbb{N}_{0}, and the restriction e∣[n]e|_{[n]} is the constant function k↦1k\mapsto1 on [n][n], so by Iterated Operations: Finite Sums and Finite Products (ii) and The Image of a Natural Number in a Commutative Ring (i)

nR=∑k=1n1=∑k=1nek.n_{\mathbb{R}}=\sum_{k=1}^{n}1=\sum_{k=1}^{n}e_{k}.

Proof of (i). Let cc, oo and zz be class parameters standing for ee, the element 00 of N0\mathbb{N}_{0} and the zero 00 of R\mathbb{R}, distinct from the class variables of the formula it\mathrm{it} below. Let it(w,n,a)\mathrm{it}(w,n,a) be the predicative formula of Iterated Operations Are Given by a Predicative Formula (i) for distinct set variables ww, nn and aa, with R\mathbb{R}, the addition of R\mathbb{R}, N\mathbb{N}, and the order and the addition of N0\mathbb{N}_{0} assigned to its class variables, and let it(xi,xj,c)\mathrm{it}(x_{i},x_{j},c) be obtained from it by renaming ww, nn and aa to xix_{i}, xjx_{j} and cc. Moving the formula to these positions is a renaming of variables, so 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 (i) it is predicative and, as cc stands for the set ee, it holds exactly when it(w,n,a)\mathrm{it}(w,n,a) holds with the values of xix_{i} and xjx_{j} and the set ee assigned to ww, nn and aa. Let ψ\psi be

xj∈N0∧((xj=o∧xi=z)∨(xj∈N∧it(xi,xj,c))).x_{j}\in\mathbb{N}_{0}\wedge\bigl((x_{j}=o\wedge x_{i}=z)\vee(x_{j}\in\mathbb{N}\wedge\mathrm{it}(x_{i},x_{j},c))\bigr).

It is built by connectives from atomic formulas and the predicative formula it\mathrm{it}, so it is predicative, and its free variables are xix_{i}, xjx_{j} and parameters. Let sets be assigned to x0,…,xN−1x_{0},\dots,x_{N-1}. If xj∉N0x_{j}\notin\mathbb{N}_{0}, then ψ\psi and the condition both fail. If xj=0x_{j}=0, then xj∉Nx_{j}\notin\mathbb{N}, so ψ\psi holds if and only if xi=0x_{i}=0 in R\mathbb{R}, that is, xi=0Rx_{i}=0_{\mathbb{R}} by The Image of a Natural Number in a Commutative Ring (i). If xj∈Nx_{j}\in\mathbb{N}, then xj≠0x_{j}\neq0, and ee is a function from a set containing [xj][x_{j}] to R\mathbb{R}, so ψ\psi holds if and only if xi=∑k=1xjekx_{i}=\sum_{k=1}^{x_{j}}e_{k} by Iterated Operations Are Given by a Predicative Formula (i), that is, xi=(xj)Rx_{i}=(x_{j})_{\mathbb{R}} by the display above. Hence ψ\psi expresses the condition.

Proof of (ii). By (i), for every n∈N0n\in\mathbb{N}_{0} the set nRn_{\mathbb{R}} is the only set xix_{i} satisfying ψ\psi with nn assigned to xjx_{j}. So nRn_{\mathbb{R}} is a defined set symbol with argument nn, given by ψ\psi and used properly wherever n∈N0n\in\mathbb{N}_{0}. As nR∈Rn_{\mathbb{R}}\in\mathbb{R} for every n∈N0n\in\mathbb{N}_{0}, Maps and Relations Given by Formulas (i), applied to the sets N0\mathbb{N}_{0} and R\mathbb{R} and the expression nRn_{\mathbb{R}}, gives exactly one function ι:N0→R\iota:\mathbb{N}_{0}\to\mathbb{R} with ι(n)=nR\iota(n)=n_{\mathbb{R}} for every n∈N0n\in\mathbb{N}_{0}.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…