TheoremBase

Finite Sums of Reals: Congruence, the Product Map (x,y) ↦ f(x)h(y), and the Sequence of Diagonal Sums

A finite sum depends only on the values of the summand on the index set; the map (x,y) to f(x)h(y) on a Cartesian product exists; and the sums of aia_i bjb_j over the pairs in [n]x[n] with i+j=n+1 form a sequence of real numbers.

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, finite sums in R\mathbb{R} are as in Sums and Products over a Finite Set and over an Interval (iii) and Sums and Products over a Finite Set and over an Interval (v), and [n][n] is as in Intervals of Natural Numbers (ii).

Let AA be a finite set, and let f:D→Rf:D\to\mathbb{R} and f′:D′→Rf':D'\to\mathbb{R} be maps on sets DD and D′D' containing AA with f(x)=f′(x)f(x)=f'(x) for every x∈Ax\in A. Then ∑x∈Af(x)=∑x∈Af′(x)\sum_{x\in A}f(x)=\sum_{x\in A}f'(x).

Let AA and BB be sets and let f:A→Rf:A\to\mathbb{R} and h:B→Rh:B\to\mathbb{R} be maps. There is exactly one map m:A×B→Rm:A\times B\to\mathbb{R} with m(x,y)=f(x) h(y)m(x,y)=f(x)\,h(y) for all x∈Ax\in A and y∈By\in B.

Let (ak)(a_{k}) and (bk)(b_{k}) be sequences in R\mathbb{R}. There is a sequence (cn)(c_{n}) in R\mathbb{R} with

cn=∑(i,j)∈[n]×[n], i+j=n+1aibj(n∈N),c_{n}=\sum_{(i,j)\in[n]\times[n],\,i+j=n+1}a_{i}b_{j}\qquad(n\in\mathbb{N}),

the sum being that over the set {(i,j)∈[n]×[n]:i+j=n+1}\{(i,j)\in[n]\times[n]:i+j=n+1\}, which is finite, of the map N×N→R\mathbb{N}\times\mathbb{N}\to\mathbb{R}, (i,j)↦aibj(i,j)\mapsto a_{i}b_{j}, of (ii).

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…