

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Assignment; Class: Prb&Rand Proc; Subject: Electrical Engineering And Computer Science; University: University of Michigan - Ann Arbor; Term: Fall 2001;
Typology: Assignments
1 / 2
This page cannot be seen from the preview
Don't miss anything!


EECS 501 SOLUTIONS TO PROBLEM SET #1 Fall 2001
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′].
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.