• Keine Ergebnisse gefunden

Prove that E(X

N/A
N/A
Protected

Academic year: 2022

Aktie "Prove that E(X"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

TU Darmstadt Fachbereich Mathematik

Wilhelm Stannat

WS 2007/08 31.11.07

Probability Theory 4. Aufgabenblatt Gruppen¨ubungen Aufgabe G11:

LetX be a rondom variable on (Ω,A, P) with values inN. Prove that E(X) =

X n=1

P[X≥n].

Aufgabe G12:

Let (Ω,A, P) be a probability space andX be a random variable. Prove that (a) E(|X|) = 0⇒X= 0 P-a.s.

(b) E(|X|)<∞ ⇒ |X|<∞ P-a.s.

Aufgabe G13:

Let (Ω,A, P) be a probability space. Prove that for f, g∈ L1(Ω,A, P):

(a) f < g P-a.s. ⇐⇒R

Af dP <R

Ag dP ∀A∈ AwithP(A)>0.

(b) f ≤g P-a.s. ⇐⇒R

Af dP R

Ag dP ∀A∈ A.

Aufgabe G14:

LetX1, X2, . . .be a sequence of random variables withE[Xi] =mandV ar(Xi) = σ2. Suppose there exists a functionronNwith|Cov(Xi, Xj)| ≤r(|i−j|). Find properties forr which still imply the Weak Law of Large Numbers

n→∞lim P

·¯¯

¯¯X1+X2+. . .+Xn

n −m

¯¯

¯¯> ²

¸

= 0 ∀² >0.

1

(2)

Haus¨ubungen Aufgabe H10:

Prove the following generalization of Lebesgue’s theorem. Let (Xn),(Yn) be positive random variables on a probability space (Ω,A, P) withXn ≤Yn for all n∈ N. Show that if limn→∞Xn =X, limn→∞Yn =Y and limn→∞E(Yn) = E(Y)<∞it follows that limn→∞E(Xn) =E(X).

Aufgabe H11:

For x [0,1] let x = P

n=1dn(x)

2n denote its binary expansion. A number x is called normal if the sequence of the relativ frequencies of 1 in its binary expansion converges to 12, i.e.

n→∞lim 1 n

Xn

i=1

di(x) = 1 2.

Use the Strong Law of Large Numbers to prove that the setNof normal numbers in [0,1] has Lebesgue measure 1.

Aufgabe H12:

Prove the following Weak Law of Large Numbers:

If 0 < a1 a2 . . . % ∞ and (Xn)n∈N are pairwise uncorrelated with P

k=1

V ar(Xk)

a2k <∞, then

n→∞lim 1 an

Xn

k=1

(Xk−E(Xk)) = 0 in probability.

2

Referenzen

ÄHNLICHE DOKUMENTE

(Counting of lattice points.) You can use for example Apostol, Introduction to analytic number theory, Theorem 3.3.. (NOT for crosses, and not to be handed in.) Deadline for

Let Φ PA be the axiom system of Peano arithmetic and let Cons Φ PA be the formula that expresses the consistency of Φ PA (as defined in

Mathematische Grundlagen der Informatik RWTH

Mathematische Grundlagen der Informatik RWTH

Mathematische Grundlagen der Informatik RWTH

Throughout, R denotes a ring, and, unless otherwise stated, all rings are assumed to be associative rings with 1, and modules are assumed to be left

Furthermore, all KG- modules considered are assumed to be left modules and free of finite rank over K.. Proceed in the

Deduce from Remark 35.12 of the Lecture Notes that column orthogonality relations for the Brauer characters take the form Π tr Φ =