Difference between revisions of "Weierstrass factorization theorem"

From specialfunctionswiki
Jump to: navigation, search
 
(3 intermediate revisions by the same user not shown)
Line 1: Line 1:
−
Define the notation
+
__NOTOC__
−
$$E_n(z)=\left\{ \begin{array}{ll}
+
==Theorem==
−
1-z &; n=0 \\
+
(Weierstrass factorization theorem) Let $f \colon \mathbb{C} \rightarrow \mathbb{C}$ be [[entire]] and let $\{a_n\}$ denote the set of zeros of $f$ repeated according to multiplicity. Suppose that $f$ has a zero at $z=0$ of [[order of zero|order]] $m \geq 0$ (if $0$ is a zero of order $0$ means that $f(0) \neq 0$). Then there exists an entire function $g$ and a sequence of integers $\{p_n\}$ such that
−
(1-z)e^{z+\frac{z^2}{2}+\frac{z^3}{3}+\ldots+\frac{z^n}{n}} &; \mathrm{otherwise} \end{array} \right.$$
+
$$f(z) = z^m e^{g(z)} \displaystyle\prod_{k=1}^{\infty} E_{p_n} \left( \dfrac{z}{a_k} \right),$$
 +
where $E_{p_n}$ denotes a [[Weierstrass elementary factors|Weierstrass elementary factor]].
  
−
<div class="toccolours mw-collapsible mw-collapsed">
+
==Proof==
−
<strong>Theorem:</strong> (Weierstrass factorization theorem) Let $f \colon \mathbb{C} \rightarrow \mathbb{C}$ be an [[entire function]] and let $\{a_n\}$ denote the set of zeros of $f$ repeated according to multiplicity. Suppose that $f$ has a zero at $z=0$ of [[order of zero|order]] $m \geq 0$ (if $0$ is a zero of order $0$, then $f(0) \neq 0$). Then there exists an entire function $g$ and a sequence of integers $\{p_n\}$ such that
 
−
$$f(z) = z^m e^{g(z)} \displaystyle\prod_{k=1}^{\infty} E_{p_n} \left( \dfrac{z}{a_k} \right).$$
 
−
<div class="mw-collapsible-content">
 
−
<strong>Proof:</strong> █
 
−
</div>
 
−
</div>
 
  
 +
==See also==
 +
[[Weierstrass factorization of sine]]<br />
 +
[[Weierstrass factorization of cosine]]<br />
 +
[[Weierstrass factorization of sinh]]<br />
 +
[[Weierstrass factorization of cosh]]<br />
 +
[[Gamma function Weierstrass product]]<br />
  
 +
==References==
  
−
=Examples of Weierstrass factorizations=
+
[[Category:Theorem]]
−
{{:Weierstrass factorization of sine}}
+
[[Category:Unproven]]
−
{{:Weierstrass factorization of cosine}}
 
−
{{:Weierstrass factorization of sinh}}
 
−
{{:Weierstrass factorization of cosh}}
 
−
{{:Gamma function Weierstrass product}}
 

Latest revision as of 19:12, 26 November 2016

Theorem

(Weierstrass factorization theorem) Let $f \colon \mathbb{C} \rightarrow \mathbb{C}$ be entire and let $\{a_n\}$ denote the set of zeros of $f$ repeated according to multiplicity. Suppose that $f$ has a zero at $z=0$ of order $m \geq 0$ (if $0$ is a zero of order $0$ means that $f(0) \neq 0$). Then there exists an entire function $g$ and a sequence of integers $\{p_n\}$ such that $$f(z) = z^m e^{g(z)} \displaystyle\prod_{k=1}^{\infty} E_{p_n} \left( \dfrac{z}{a_k} \right),$$ where $E_{p_n}$ denotes a Weierstrass elementary factor.

Proof

See also

Weierstrass factorization of sine
Weierstrass factorization of cosine
Weierstrass factorization of sinh
Weierstrass factorization of cosh
Gamma function Weierstrass product

References

Retrieved from "http://specialfunctionswiki.org/index.php?title=Weierstrass_factorization_theorem&oldid=7726"