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: Low Entry average rating: No information on entry rating
[parent] proof of convergence condition of infinite product (Proof)
Proof. Let $p_n=\prod_{i=1}^n u_i$ . We have to study the convergence of the sequence $\{p_n\}$ . The sequence $\{p_n\}$ converges to a not null limit iff $\{\log p_n\}$ ($\log$ is restricted to its principal branch) converges to a finite limit. By the Cauchy criterion, this happens iff for every $\epsilon^{\prime}>0$ there exist $N$ such that $\abs{\log p_{n+k} - \log p_n} < \epsilon^{\prime}$ for all $n>N$ and all $k=1,2,\ldots$ , i.e, iff $$\abs{\log \frac{p_{n+k}}{p_n}} = \abs{\log u_{n+1}u_{n+2}\cdots u_{n+k}} < \epsilon^{\prime};$$ as $\log(z)$ is an injective function and continuous at $z=1$ and $\log(1)=0$ this will happen iff for every $\epsilon>0$ $$\abs{u_{n+1}u_{n+2}\cdots u_{n+k}-1} < \epsilon$$ for $n$ greater than $N$ and $k=1,2,\ldots$ $ \qedsymbol$




"proof of convergence condition of infinite product" is owned by fernsanz.
(view preamble | get metadata)

View style:


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

Cross-references: continuous at, injective function, finite, principal branch, iff, limit, null, converges, sequence

This is version 2 of proof of convergence condition of infinite product, born on 2007-07-05, modified 2007-07-05.
Object id is 9738, canonical name is ProofOfConvergenceConditionOfInfiniteProduct.
Accessed 705 times total.

Classification:
AMS MSC30E20 (Functions of a complex variable :: Miscellaneous topics of analysis in the complex domain :: Integration, integrals of Cauchy type, integral representations of analytic functions)

Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

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