Problem Set Solutions - Probability and Random Processes - Fall 2001 | EECS 501, Assignments of Electrical and Electronics Engineering

Material Type: Assignment; Class: Prb&Rand Proc; Subject: Electrical Engineering And Computer Science; University: University of Michigan - Ann Arbor; Term: Fall 2001;

Typology: Assignments

Pre 2010

Uploaded on 09/02/2009

koofers-user-6zu
koofers-user-6zu 🇺🇸

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
EECS 501 SOLUTIONS TO PROBLEM SET #1 Fall 2001
1. Let bi, i = 1 . . . 6 denote the ith ball in the urn, and
bibjdenote that the ith THEN jth balls are taken (note that order matters).
1a. without replacement: has (6)(6 1) = 30 elements, which are:
= {b1b2, b1b3, b1b4, b1b5, b1b6, b2b1, b2b3, b2b4, b2b5, b2b6. . . b5b6}.
1b. with replacement: has (6)(6) = 36 elements, which are:
= {b1b1, b1b2, b1b3, b1b4, b1b5, b1b6, b2b1, b2b2, b2b3, b2b4. . . b6b6}.
2. Let H=height of man in inches and W=height of woman in inches.
2a. = {(H, W ) : H > 0and W > 0}= (R+)2.(b): E={(H , W ) : 0 < H < W }.
3a. A =Aand A = P r [A] = P r[A ] = P r[A] + P r[]P r[] = 0.
3b. (EF )(E F 0) = Eand (EF )(E F 0) = P r[E] = P r[EF ] + P r [EF 0].
3c. EE0= and EE0= P r[E] + P r [E0] = P r[Ω] = 1 P r[E] = 1 P r [E0].
4. (EF 0)(F E 0) = EFand (EF 0)(F E 0) = P r[EF] = P r[EF 0] + P r [F E0].
5. #3bP r[E F 0] = P r[E]P r[EF ] and P r [F E0] = P r[F]P r[F E ].
#4 P r[EF] = P r[E] + P r [F]2P r[EF ] QED. Note P r[E F ] = P r[F E].
6. See overleaf.
7. Let B=
n=1An=
n=1(0,1/n). x BxAn0< x < 1/n for all n.
But for any x > 0,N s.t. 1/N < x x /ANx /B. Hence B=.
8. Let Z={integers}and Pn={polynomials of degree nwith integer coefficients}.
Pnis 1-1 with Zn+1 since a0+a1z+...+anznPn(a0, a1. . . an) Z n+1 .
A={algebraic irrationals}1-1 with a subset of
n=1Pn, since every
A A is the root of a polynomial with integer coefficients (some duplication).
n=1Pn=countable union of countable sets=countable A at most countable.
{21/n, n = 2,3. . .}⊂A→Aat least countably infinite A is countably infinite.
pf2

Partial preview of the text

Download Problem Set Solutions - Probability and Random Processes - Fall 2001 | EECS 501 and more Assignments Electrical and Electronics Engineering in PDF only on Docsity!

EECS 501 SOLUTIONS TO PROBLEM SET #1 Fall 2001

  1. Let bi, i = 1... 6 denote the ith^ ball in the urn, and bibj denote that the ith^ THEN jth^ balls are taken (note that order matters). 1a. without replacement: Ω has (6)(6 − 1) = 30 elements, which are: Ω = {b 1 b 2 , b 1 b 3 , b 1 b 4 , b 1 b 5 , b 1 b 6 , b 2 b 1 , b 2 b 3 , b 2 b 4 , b 2 b 5 , b 2 b 6... b 5 b 6 }. 1b. with replacement: Ω has (6)(6) = 36 elements, which are: Ω = {b 1 b 1 , b 1 b 2 , b 1 b 3 , b 1 b 4 , b 1 b 5 , b 1 b 6 , b 2 b 1 , b 2 b 2 , b 2 b 3 , b 2 b 4... b 6 b 6 }.
  2. Let H=height of man in inches and W=height of woman in inches. 2a. Ω = {(H, W ) : H > 0 and W > 0 } = (R+)^2. (b): E = {(H, W ) : 0 < H < W }.

3a. A ∪ ∅ = A and A ∩ ∅ = ∅ → P r[A] = P r[A ∪ ∅] = P r[A] + P r[∅] → P r[∅] = 0. 3b. (EF ) ∪ (EF ′) = E and (EF ) ∩ (EF ′) = ∅ → P r[E] = P r[EF ] + P r[EF ′]. 3c. E ∪ E′^ = Ω and E ∩ E′^ = ∅ → P r[E] + P r[E′] = P r[Ω] = 1 → P r[E] = 1 − P r[E′].

  1. (EF ′) ∪ (F E′) = E ⊕ F and (EF ′) ∩ (F E′) = ∅ → P r[E ⊕ F ] = P r[EF ′] + P r[F E′].
  2. #3b → P r[EF ′] = P r[E] − P r[EF ] and P r[F E′] = P r[F ] − P r[F E]. #4 → P r[E ⊕ F ] = P r[E] + P r[F ] − 2 P r[EF ] QED. Note P r[EF ] = P r[F E].
  3. See overleaf.
  4. Let B = ∩∞ n=1An = ∩∞ n=1(0, 1 /n). x ∈ B ⇔ x ∈ An ⇔ 0 < x < 1 /n for all n. But for any x > 0 , ∃N s.t. 1 /N < x → x /∈ AN → x /∈ B. Hence B = ∅.
  5. Let Z = {integers} and Pn = {polynomials of degree n with integer coefficients}. Pn is 1-1 with Zn+1^ since a 0 + a 1 z +... + anzn^ ∈ Pn ↔ (a 0 , a 1... an) ∈ Zn+1. A = {algebraic irrationals} 1-1 with a subset of ∪∞ n=1Pn, since every A ∈ A is the root of a polynomial with integer coefficients (some duplication). ∪∞ n=1Pn=countable union of countable sets=countable→ A at most countable. { 21 /n, n = 2, 3.. .} ⊂ A → A at least countably infinite → A is countably infinite.
  1. Note that there are LK^ different mappings f : { 1 , 2... K} → { 1 , 2... L}. Try interpreting the following results in terms of this result.

6a. Typical member of A is specified by {f (0) = i, f (1) = j} where i, j ∈ Z+. A is 1-1 with (Z+)^2 since {f (0), f (1)} ↔ (i, j). COUNTABLE.

6b. Bn is 1-1 with (Z+)n^ since {f (1)... f (n)} ↔ (i 1 ,... in). COUNTABLE.

6c. C is a countable union of countable sets Bn from #6b, so C is COUNTABLE.

6d. E ⊂ D and D is uncountable from #6e below, so D is UNCOUNTABLE.

6e. Typical member of E is specified by f (1) = 0, f (2) = 1, f (3) = 1, f (4) = 0... E is 1-1 with [0, 1) since {f (1), f (2).. .} ↔ (0.x 1 x 2.. .) ∈ [0, 1) where xi=0,1. Since [0, 1) is uncountable, E is UNCOUNTABLE. (D, E are only uncountables).

6f. F = ∪∞ N =1FN where FN = {f : f (n) = 0 f or n > N } has 2N^ elements. F is a countable union of finite sets FN , so F is COUNTABLE. NOTE: F does not include an “F∞” which would have “2∞” elements.

6g. G = ∪∞ N =1GN where GN = {f : f (n) = 1 f or n > N } = BN from #6b. G is a countable union of countable sets GN , so G is COUNTABLE.

6h. Let Hi,j be the set of functions f (n) that are eventually j for n > i. NOTE: The “eventual constant” must be an integer since f : Z+^ → Z+. H = ∪∞ i=1 ∪∞ j=1 Hi,j. Note that HN, 1 = GN from #6g. H is a countable double union of countable sets, so H is COUNTABLE.

6i. I = {{i, j} : i 6 = j and i, j ∈ Z+} ↔ (Z+)^2 , excluding the diagonal lattice points. Typical members of I:{ 1 , 2 }, { 3 , 5 }, { 4 , 9 }... I is COUNTABLE.

6j. J = ∪∞ n=1Jn where Jn = {{i 1 , i 2... in} : i 1 6 = i 2 6 =... in and i 1... in ∈ Z+}. Note J 2 = I from #6i. Jn ↔ (Z+)n, again excluding diagonal lattice points. J is a countable union of countable sets, so J is COUNTABLE.