TheoremBase

Maps Given by Iterated Operations: Partial Iterates, Images of Natural Numbers, Powers and Operations over a Finite Set

The partial iterates of a sequence, the images of the natural numbers with zero in a commutative ring, the powers of an element, and the iterated operation over a finite set of a map with an extra argument are each the values of exactly one map.

Statement

In the setting of The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion, let maps and their values be as in Sets and Maps: Ordinary Notation §maps, and binary operations as in Binary Operations on a Set §notation.

Let ∗\ast be a binary operation on a set XX and let a:N→Xa:\mathbb{N}\to X, k↦akk\mapsto a_{k}. There is exactly one map s:N→Xs:\mathbb{N}\to X with s(n)=∗k=1naks(n)=\mathop{\ast}\limits_{k=1}^{n}a_{k} for every n∈Nn\in\mathbb{N}, the iterated operation being as in Iterated Operations: Finite Sums and Finite Products §restriction.

Let RR, with ++, ⋅\cdot, 00 and 11, be a commutative ring, and for n∈N0n\in\mathbb{N}_{0} let nRn_{R} be the image of nn in RR. There is exactly one map ν:N0→R\nu:\mathbb{N}_{0}\to R with ν(n)=nR\nu(n)=n_{R} for every n∈N0n\in\mathbb{N}_{0}.

Let ⋅\cdot be a binary operation on a set XX that has a neutral element, let x∈Xx\in X, and for n∈N0n\in\mathbb{N}_{0} let xnx^{n} be as in Powers with Exponents in the Natural Numbers with Zero §power and Powers with Exponents in the Natural Numbers with Zero §zero. There is exactly one map p:N0→Xp:\mathbb{N}_{0}\to X with p(n)=xnp(n)=x^{n} for every n∈N0n\in\mathbb{N}_{0}.

Let RR, with ++, ⋅\cdot, 00 and 11, be a commutative ring and let x∈Rx\in R. Then 11 is a neutral element of ⋅\cdot, so xnx^{n} is defined for n∈N0n\in\mathbb{N}_{0}, for the multiplication ⋅\cdot, by Powers with Exponents in the Natural Numbers with Zero §power and Powers with Exponents in the Natural Numbers with Zero §zero; x0=1x^{0}=1, and there is exactly one map p:N0→Rp:\mathbb{N}_{0}\to R with p(n)=xnp(n)=x^{n} for every n∈N0n\in\mathbb{N}_{0}.

Let ∗\ast be an associative and commutative binary operation on a set XX, let AA be a set and BB a finite set such that B≠∅B\neq\emptyset or ∗\ast has a neutral element, and let f:A×B→Xf:A\times B\to X. For x∈Ax\in A let fxf_{x} be the map B→XB\to X, y↦f(x,y)y\mapsto f(x,y), of Sets and Maps: Ordinary Notation §maps, and let ∗y∈Bfx(y)\mathop{\ast}\limits_{y\in B}f_{x}(y) be the iterated operation over BB of Sums and Products over a Finite Set and over an Interval §operation and Sums and Products over a Finite Set and over an Interval §empty. There is exactly one map h:A→Xh:A\to X with h(x)=∗y∈Bfx(y)h(x)=\mathop{\ast}\limits_{y\in B}f_{x}(y) for every x∈Ax\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…