TheoremBase

Splitting an Operation over the Segment [m+n] into [m] and a Shifted Copy of [n]

For an associative and commutative operation and a map a on [m+n], the operation over [m+n] equals the operation over [m] combined with the operation over [n] of j to a(m+j); the same holds for the operations from 1 in either reading.

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let ∗\ast be an associative and commutative binary operation on a set XX, let m,n∈Nm,n\in\mathbb{N}, with ++ as in Arithmetic and Order of the Natural Numbers and segments [p][p] as in Intervals of Natural Numbers §segment; here [m+n][m+n] is defined since m+n∈Nm+n\in\mathbb{N}, and [m]⊆[m+n][m]\subseteq[m+n], by Splitting the Segment [m+n] into [m] and a Shifted Copy of [n] §sum. Let a:[m+n]→Xa:[m+n]\to X, k↦akk\mapsto a_{k}, be a map. As m+j∈[m+n]m+j\in[m+n] for every j∈[n]j\in[n] by Splitting the Segment [m+n] into [m] and a Shifted Copy of [n] §shift, there is a map b:[n]→Xb:[n]\to X with b(j)=am+jb(j)=a_{m+j}, and the operation over [n][n] of j↦am+jj\mapsto a_{m+j} is that of bb. Operations over the finite sets [m+n][m+n], [m][m] and [n][n] are 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 §subsets; in particular ∗k∈[m]ak\mathop{\ast}\limits_{k\in[m]}a_{k} is the operation over [m][m] of the restriction a∣[m]a|_{[m]}.

The operation over [m+n][m+n] splits as

∗k∈[m+n]ak=(∗k∈[m]ak)∗(∗j∈[n]am+j).\mathop{\ast}\limits_{k\in[m+n]}a_{k}=\Big(\mathop{\ast}\limits_{k\in[m]}a_{k}\Big)\ast\Big(\mathop{\ast}\limits_{j\in[n]}a_{m+j}\Big).

The operations from 11 split in the same way:

∗k=1m+nak=(∗k=1mak)∗(∗j=1nam+j),\mathop{\ast}\limits_{k=1}^{m+n}a_{k}=\Big(\mathop{\ast}\limits_{k=1}^{m}a_{k}\Big)\ast\Big(\mathop{\ast}\limits_{j=1}^{n}a_{m+j}\Big),

where each of the three operations from 11 may be read, independently of the other two, either as in Sums and Products over a Finite Set and over an Interval §intervals or as in Iterated Operations: Finite Sums and Finite Products §iterated and Iterated Operations: Finite Sums and Finite Products §restriction; in every reading each of them equals the corresponding operation over [m+n][m+n], [m][m] or [n][n] in the clause split.

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…