Quarter cubic honeycomb: Difference between revisions

Revision as of 08:42, 30 December 2013

In mathematics, Kronecker's lemma (see, e.g., Template:Harvtxt) is a result about the relationship between convergence of infinite sums and convergence of sequences. The lemma is often used in the proofs of theorems concerning sums of independent random variables such as the strong Law of large numbers. The lemma is named after the German mathematician Leopold Kronecker.

The lemma

If $(x_{n})_{n = 1}^{\infty}$ is an infinite sequence of real numbers such that

\sum_{m = 1}^{\infty} x_{m} = s

exists and is finite, then we have for $0 < b_{1} \leq b_{2} \leq b_{3} \leq \dots$ and $b_{n} \to \infty$ that

\lim_{n \to \infty} \frac{1}{b_{n}} \sum_{k = 1}^{n} b_{k} x_{k} = 0 .

Proof

Let $S_{k}$ denote the partial sums of the x's. Using summation by parts,

\frac{1}{b_{n}} \sum_{k = 1}^{n} b_{k} x_{k} = S_{n} - \frac{1}{b_{n}} \sum_{k = 1}^{n - 1} (b_{k + 1} - b_{k}) S_{k}

Pick any ε > 0. Now choose N so that $S_{k}$ is ε-close to s for k > N. This can be done as the sequence $S_{k}$ converges to s. Then the right hand side is:

S_{n} - \frac{1}{b_{n}} \sum_{k = 1}^{N - 1} (b_{k + 1} - b_{k}) S_{k} - \frac{1}{b_{n}} \sum_{k = N}^{n - 1} (b_{k + 1} - b_{k}) S_{k}

= S_{n} - \frac{1}{b_{n}} \sum_{k = 1}^{N - 1} (b_{k + 1} - b_{k}) S_{k} - \frac{1}{b_{n}} \sum_{k = N}^{n - 1} (b_{k + 1} - b_{k}) s - \frac{1}{b_{n}} \sum_{k = N}^{n - 1} (b_{k + 1} - b_{k}) (S_{k} - s)

= S_{n} - \frac{1}{b_{n}} \sum_{k = 1}^{N - 1} (b_{k + 1} - b_{k}) S_{k} - \frac{b_{n} - b_{N}}{b_{n}} s - \frac{1}{b_{n}} \sum_{k = N}^{n - 1} (b_{k + 1} - b_{k}) (S_{k} - s) .

Now, let n go to infinity. The first term goes to s, which cancels with the third term. The second term goes to zero (as the sum is a fixed value). Since the b sequence is increasing, the last term is bounded by $ϵ (b_{n} - b_{N}) / b_{n} \leq ϵ$ .

References

Template:Refbegin

20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.

My blog: http://www.primaboinca.com/view_profile.php?userid=5889534

Template:Refend

Template:Mathanalysis-stub

@@ Line 1: / Line 1: @@
-Hi there. Allow me start by introducing the writer, her name is Sophia Boon but she by no means really favored that title. Ohio is where my house is but my spouse wants us to move. To climb is something she would never give up. Office supervising is exactly where her main income arrives from but she's already  email psychic readings [[http://www.zavodpm.ru/blogs/glennmusserrvji/14565-great-hobby-advice-assist-allow-you-get-going Suggested Web page]] utilized for another one.<br><br>Also visit my weblog -  [http://www.publicpledge.com/blogs/post/7034 psychic phone] online psychic chat ([http://test.jeka-nn.ru/node/129 http://test.jeka-nn.ru/])
+In [[mathematics]], '''Kronecker's lemma''' (see, e.g., {{harvtxt|Shiryaev|1996|loc=Lemma IV.3.2}}) is a result about the relationship between convergence of [[infinite sum]]s and convergence of sequences. The lemma is often used in the proofs of theorems concerning sums of independent random variables such as the strong [[Law of large numbers]]. The lemma is named after the [[Germany|German]] [[mathematician]] [[Leopold Kronecker]].
+== The lemma ==
+If <math>(x_n)_{n=1}^\infty</math> is an infinite sequence of real numbers such that
+:<math>\sum_{m=1}^\infty x_m = s</math>
+exists and is finite, then we have for <math>0<b_1 \leq b_2 \leq b_3 \leq \ldots</math> and <math>b_n \to \infty</math> that
+:<math>\lim_{n \to \infty}\frac1{b_n}\sum_{k=1}^n b_kx_k = 0.</math>
+===Proof===
+Let <math>S_k</math> denote the partial sums of the ''x'''s. Using [[summation by parts]],
+: <math>\frac1{b_n}\sum_{k=1}^n b_k x_k = S_n - \frac1{b_n}\sum_{k=1}^{n-1}(b_{k+1} - b_k)S_k</math>
+Pick any ''ε'' > 0. Now choose ''N'' so that <math>S_k</math> is ''ε''-close to ''s'' for ''k'' > ''N''. This can be done as the sequence <math>S_k</math> converges to ''s''. Then the right hand side is:
+: <math>S_n - \frac1{b_n}\sum_{k=1}^{N-1}(b_{k+1} - b_k)S_k - \frac1{b_n}\sum_{k=N}^{n-1}(b_{k+1} - b_k)S_k</math>
+: <math>= S_n - \frac1{b_n}\sum_{k=1}^{N-1}(b_{k+1} - b_k)S_k - \frac1{b_n}\sum_{k=N}^{n-1}(b_{k+1} - b_k)s - \frac1{b_n}\sum_{k=N}^{n-1}(b_{k+1} - b_k)(S_k - s)</math>
+: <math>= S_n - \frac1{b_n}\sum_{k=1}^{N-1}(b_{k+1} - b_k)S_k - \frac{b_n-b_N}{b_n}s - \frac1{b_n}\sum_{k=N}^{n-1}(b_{k+1} - b_k)(S_k - s).</math>
+Now, let ''n'' go to infinity. The first term goes to ''s'', which cancels with the third term. The second term goes to zero (as the sum is a fixed value). Since the ''b'' sequence is increasing, the last term is bounded by <math>\epsilon (b_n - b_N)/b_n \leq \epsilon</math>.
+==References==
+{{refbegin}}
+* {{cite book
+  | last = Shiryaev | first = Albert N.
+  | title = Probability
+  | year = 1996
+  | edition = 2nd
+  | publisher = Springer
+  | isbn = 0-387-94549-0
+  | ref = CITEREFShiryaev1996
+  }}
+{{refend}}
+[[Category:Mathematical series]]
+[[Category:Lemmas]]
+{{mathanalysis-stub}}

Quarter cubic honeycomb: Difference between revisions

Revision as of 08:42, 30 December 2013

The lemma

Proof

References

Navigation menu

Search