PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: No information on entry rating
[parent] proof of infinite product of sums $1\!+\!a_i$ result without exponentials (Result)

In this entry, we show how the proof presented in the parent entry may be modified so as to avoid use of the exponential function. This modification makes it more elementary by not requiring that one first develop the theory of the exponential function before proving this basic result about infinite products. Note that it is only necessary to redo the part of the result which states that, if the series converges, then the product also converges because the proof of the opposite implication did not involve the exponential function.

We begin with a simple inequality. Suppose that $a$ and $b$ are real numbers such that $0 \le a$ and $0 \le b < 1/2$ . Then we have $2ab \le a$ , hence

$\displaystyle (1 + a) (1 + 2 b)$ $\displaystyle = 1 + 2b + a + 2 a b \cr$ $\displaystyle \le 1 + 2b + a + a \cr$ $\displaystyle = 1 + 2 (a + b) .$    

Now suppose that the series $a_1 + a_2 + a_3 + \cdots$ converges to a value $S$ . Since the convergence of an infinite series or product is not affected by removing a finite number of terms we may, without loss of generality, assume that $S < 1/2$ . Then, since the terms $a_n$ are nonnegative for all $n$ , for each partial sum $s_n$ we will have $0 \le s_n < 1/2$ .

Clearly, $t_1 \le 1 + 2 s_1$ . Suppose that, for some $n$ , we have $t_n \le 1 + 2 s_n$ . Then, using the definitions of $t_n$ and $s_n$ along with the inequality demonstrated above, we conclude that

$\displaystyle t_{n+1}$ $\displaystyle = t_n (1 + a_{n+1}) \cr$ $\displaystyle \le (1 + 2 s_n)(1 + a_{n+1}) \cr$ $\displaystyle \le 1 + 2 (s_n + a_{n+1}) \cr$ $\displaystyle = 1 + 2 s_{n+1}$    

Hence, if $t_n \le 1 + 2 s_n$ , then $t_{n+1} \le 1 + 2 s_{n+1}$ as well. By induction, we conclude that $t_n \le 1 + 2 s_n$ for all $n$ .

Thus, for all $n$ , we have $t_n \le 1 + 2 s_n \le 1 + 2S$ . Substituting this inequality for the inequality $t_n \le e^{s_n} \le e^S$ in the parent entry, the rest of the proof proceeds in exactly the same manner.




"proof of infinite product of sums $1\!+\!a_i$ result without exponentials" is owned by rspuzio. [ full author list (2) ]
(view preamble | get metadata)

View style:


This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: induction, definitions, partial sum, without loss of generality, terms, number, finite, infinite, real numbers, inequality, simple, implication, opposite, product, converges, series, necessary, infinite products, theory, modification, exponential function, parent, proof

This is version 8 of proof of infinite product of sums $1\!+\!a_i$ result without exponentials, born on 2008-12-31, modified 2009-01-02.
Object id is 11425, canonical name is ProofOfFiniteProductOfSums1a_iResultWithoutExponentials.
Accessed 347 times total.

Classification:
AMS MSC26E99 (Real functions :: Miscellaneous topics :: Miscellaneous)
 40A20 (Sequences, series, summability :: Convergence and divergence of infinite limiting processes :: Convergence and divergence of infinite products)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add example | add (any)