Iterated binary operation

In mathematics, an iterated binary operation is an extension of a binary operation on a set S to a function on finite sequences of elements of S through repeated application.^[1] Common examples include the extension of the addition operation to the summation operation, and the extension of the multiplication operation to the product operation. Other operations, e.g., the set-theoretic operations union and intersection, are also often iterated, but the iterations are not given separate names. In print, summation and product are represented by special symbols; but other iterated operators often are denoted by larger variants of the symbol for the ordinary binary operator. Thus, the iterations of the four operations mentioned above are denoted

∑ ,   ∏ ,   ⋃ , {\displaystyle \sum ,\ \prod ,\ \bigcup ,} and ⋂ {\displaystyle \bigcap } , respectively.

More generally, iteration of a binary function is generally denoted by a slash: iteration of f {\displaystyle f} over the sequence ( a 1 , a 2 … , a n ) {\displaystyle (a_{1},a_{2}\ldots ,a_{n})} is denoted by f / ( a 1 , a 2 … , a n ) {\displaystyle f/(a_{1},a_{2}\ldots ,a_{n})} , following the notation for reduce in Bird–Meertens formalism.

In general, there is more than one way to extend a binary operation to operate on finite sequences, depending on whether the operator is associative, and whether the operator has identity elements.

Denote by a_j,k, with j ≥ 0 and k ≥ j, the finite sequence of length k − j of elements of S, with members (a_i), for j ≤ i < k. Note that if k = j, the sequence is empty.

For f : S × S → S, define a new function F_l on finite nonempty sequences of elements of S, where F l ( a 0 , k ) = { a 0 , k = 1 f ( F l ( a 0 , k − 1 ) , a k − 1 ) , k > 1. {\displaystyle F_{l}(\mathbf {a} _{0,k})={\begin{cases}a_{0},&k=1\\f(F_{l}(\mathbf {a} _{0,k-1}),a_{k-1}),&k>1.\end{cases}}}

Similarly, define F r ( a 0 , k ) = { a 0 , k = 1 f ( a 0 , F r ( a 1 , k ) ) , k > 1. {\displaystyle F_{r}(\mathbf {a} _{0,k})={\begin{cases}a_{0},&k=1\\f(a_{0},F_{r}(\mathbf {a} _{1,k})),&k>1.\end{cases}}}

If f has a unique left identity e, the definition of F_l can be modified to operate on empty sequences by defining the value of F_l on an empty sequence to be e (the previous base case on sequences of length 1 becomes redundant). Similarly, F_r can be modified to operate on empty sequences if f has a unique right identity.

If f is associative, then F_l equals F_r, and we can simply write F. Moreover, if an identity element e exists, then it is unique (see Monoid).

If f is commutative and associative, then F can operate on any non-empty finite multiset by applying it to an arbitrary enumeration of the multiset. If f moreover has an identity element e, then this is defined to be the value of F on an empty multiset. If f is idempotent, then the above definitions can be extended to finite sets.

If S also is equipped with a metric or more generally with topology that is Hausdorff, so that the concept of a limit of a sequence is defined in S, then an infinite iteration on a countable sequence in S is defined exactly when the corresponding sequence of finite iterations converges. Thus, e.g., if a₀, a₁, a₂, a₃, … is an infinite sequence of real numbers, then the infinite product  ∏ i = 0 ∞ a i {\textstyle \prod _{i=0}^{\infty }a_{i}} is defined, and equal to lim n → ∞ ∏ i = 0 n a i , {\textstyle \lim \limits _{n\to \infty }\prod _{i=0}^{n}a_{i},} if and only if that limit exists.

The general, non-associative binary operation is given by a magma. The act of iterating on a non-associative binary operation may be represented as a binary tree.

Iterated binary operations are used to represent an operation that will be repeated over a set subject to some constraints. Typically the lower bound of a restriction is written under the symbol, and the upper bound over the symbol, though they may also be written as superscripts and subscripts in compact notation. Interpolation is performed over positive integers from the lower to upper bound, to produce the set which will be substituted into the index (below denoted as i ) for the repeated operations.

Common notations include the big sigma (repeated sum) and big pi (repeated product) notations.

∑ i = 0 n − 1 i = 0 + 1 + 2 + ⋯ + ( n − 1 ) {\displaystyle \sum _{i=0}^{n-1}i=0+1+2+\dots +(n-1)} ∏ i = 0 n − 1 i = 0 × 1 × 2 × ⋯ × ( n − 1 ) {\displaystyle \prod _{i=0}^{n-1}i=0\times 1\times 2\times \dots \times (n-1)}

It is possible to specify set membership or other logical constraints in place of explicit indices, in order to implicitly specify which elements of a set shall be used:

∑ x ∈ S x = x 1 + x 2 + x 3 + ⋯ + x n {\displaystyle \sum _{x\in S}x=x_{1}+x_{2}+x_{3}+\dots +x_{n}}

Multiple conditions may be written either joined with a logical and or separately:

∑ ( i ∈ 2 N ) ∧ ( i ≤ n ) i = ∑ i ≤ n i ∈ 2 N i = 0 + 2 + 4 + ⋯ + n {\displaystyle \sum _{(i\in 2\mathbb {N} )\wedge (i\leq n)}i=\sum _{\stackrel {i\in 2\mathbb {N} }{i\leq n}}i=0+2+4+\dots +n}

Less commonly, any binary operator such as exclusive or ( ⊕ {\displaystyle \oplus } ) or set union ( ∪ {\displaystyle \cup } ) may also be used.^[2] For example, if S is a set of logical propositions:

⋀ p ∈ S p = p 1 ∧ p 2 ∧ ⋯ ∧ p N {\displaystyle \bigwedge _{p\in S}p=p_{1}\wedge p_{2}\wedge \dots \wedge p_{N}}

which is true iff all of the elements of S are true.

• Unary operation
• Unary function
• Binary operation
• Binary function
• Ternary operation

• Bulk action
• Parallel prefix operation Archived 2013-06-03 at the Wayback Machine
• Nuprl iterated binary operations