TheoremBase

Iterated Operations and Operations over Finite Sets Take Values in the Underlying Set

An iterated operation along [n], an iterated operation over a finite set, and in particular a finite sum or product in a commutative ring, lies in the underlying set.

Statement

In the setting of Commutative Rings, Fields and Ordered Fields: Standard Notation, let ∗\ast be a binary operation on a set XX, and let [n][n] be as in Intervals of Natural Numbers §segment for n∈Nn\in\mathbb{N}.

For every n∈Nn\in\mathbb{N} and every map a:[n]→Xa:[n]\to X, k↦akk\mapsto a_{k}, the iterated operation ∗k=1nak\mathop{\ast}\limits_{k=1}^{n}a_{k} lies in XX.

Let ∗\ast be associative and commutative, let AA be a finite set and f:A→Xf:A\to X a map, and let A≠∅A\neq\emptyset or let ∗\ast have a neutral element ee. Then the iterated operation ∗x∈Af(x)\mathop{\ast}\limits_{x\in A}f(x) over AA, as in 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, lies in XX.

In the clauses finite-sums and segment-sums, let RR, with ++, ⋅\cdot, 00 and 11, be a commutative ring; finite sums and products of elements of RR are as in Commutative Rings, Fields and Ordered Fields: Standard Notation §rings, and along [n][n] as in Iterated Operations: Finite Sums and Finite Products §sums.

For every finite set AA and every map f:A→Rf:A\to R, ∑x∈Af(x)∈R\sum_{x\in A}f(x)\in R and ∏x∈Af(x)∈R\prod_{x\in A}f(x)\in R.

For every n∈Nn\in\mathbb{N} and every map a:[n]→Ra:[n]\to R, ∑k=1nak∈R\sum_{k=1}^{n}a_{k}\in R and ∏k=1nak∈R\prod_{k=1}^{n}a_{k}\in R.

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…