TheoremBase

Properties of Finite Products

Statement

Let KK be a field, with additive identity 00 and multiplicative identity 11. Let N\mathbb{N} be the set of natural numbers with successor map SS as in that definition, ordered by the relations of Order on the Natural Numbers, let n∈Nn\in\mathbb{N}, and let [n][n] be the initial segment determined by nn. Let a:[n]→Ka:[n]\to K and b:[n]→Kb:[n]\to K be maps, with values written aka_{k} and bkb_{k}. All products below are the finite products of that definition.

Two different order relations occur below. In index ranges such as 1≤k≤n1\le k\le n the symbol ≤\le is the order on N\mathbb{N} just cited; in claim 5 it is the order of the ordered field of real numbers. Then the following hold.

1. (Restriction and recursion) If j∈[n]j\in[n] and a′a' denotes the restriction of aa to [j][j], then

∏k=1iak′=∏k=1iakfor every i∈[j].\prod_{k=1}^{i}a'_{k}=\prod_{k=1}^{i}a_{k}\qquad\text{for every }i\in[j].

Moreover

∏k=11ak=a1,∏k=1S(m)ak=(∏k=1mak)aS(m)whenever S(m)∈[n].\prod_{k=1}^{1}a_{k}=a_{1},\qquad \prod_{k=1}^{S(m)}a_{k}=\Bigl(\prod_{k=1}^{m}a_{k}\Bigr)a_{S(m)}\quad\text{whenever }S(m)\in[n].

2. (Multiplicativity)

∏k=1n(akbk)=(∏k=1nak)(∏k=1nbk).\prod_{k=1}^{n}(a_{k}b_{k})=\Bigl(\prod_{k=1}^{n}a_{k}\Bigr)\Bigl(\prod_{k=1}^{n}b_{k}\Bigr).

3. (A single factor different from the unit) Let i∈[n]i\in[n] and suppose that ak=1a_{k}=1 for every k∈[n]k\in[n] with k≠ik\ne i. Then

∏k=1nak=ai.\prod_{k=1}^{n}a_{k}=a_{i}.

4. (Vanishing) ∏k=1nak=0\prod_{k=1}^{n}a_{k}=0 if and only if ai=0a_{i}=0 for some i∈[n]i\in[n].

5. (Nonnegative factors) Suppose KK is the field of real numbers, with the order ≤\le of its ordered field structure, and that 0≤ak0\le a_{k} for every k∈[n]k\in[n]. Then

0≤∏k=1nak;0\le\prod_{k=1}^{n}a_{k};

and if in addition ak≤bka_{k}\le b_{k} for every k∈[n]k\in[n], then

∏k=1nak≤∏k=1nbk.\prod_{k=1}^{n}a_{k}\le\prod_{k=1}^{n}b_{k}.

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…