ECE 520.

651 Random Signal Analysis

solutions for homework #1
1 Problem 1.8 from Stark and Woods
E: drawing a ball numbered no greater than 5. {1,2,3,4,5}
F: drawing a ball numbered greater than 3 but less than 9. {4,5,6,7,8}
E
c
: drawing a ball numbered greater than 5. {6,7,8,9,10}
F
c
: drawing a ball numbered no greater than 3 or no less than 9. {1,2,3,9,10}
EF: drawing a ball numbered 4 or 5. {4,5}
E F: drawing a ball numbered less than 9. {1,2,3,4,5,6,7,8}
EF
c
: drawing a ball numbered 1, 2 or 3. {1,2,3}
E
c
F
c
: drawing a ball not numbered with 4 and 5. That is, drawing a ball numbered 1, 2, 3,
6, 7, 8, 9 or 10. {1,2,3,6,7,8,9,10}
EF
c
E
c
F: drawing a ball numbered 1, 2, 3, 6, 7 or 8.{1,2,3,6,7,8}
EF E
c
F
c
: drawing a ball numbered 4, 5, 9 or 10. {4,5,9,10}
(E F)
c
: drawing a ball numbered 9 or 10. {9,10}
(EF)
c
: drawing a ball numbered numbered 1, 2, 3, 6, 7, 8, 9 or 10 {1,2,3,6,7,8,9,10} .
2 Problem 1.13 from Stark and Woods
(a) F = {, {cat, dog, goat, pig}, {cat}, {dog}, {goat}, {pig}, {cat, dog}, {cat, goat}, {cat, pig}, {dog, goat},
{dog, pig}, {goat, pig}, {dog, goat, pig}, {cat, goat, pig}, {cat, dog, pig}, {cat, dog, goat}}
P[{}] = 0
P[{cat}] = 0.4
P[{dog}] = 0.5
P[{goat}] = 0.05
P[{pig}] = 0.05
P[{cat, dog}] = 0.9
P[{cat, goat}] = 0.45
P[{cat, pig}] = 0.45
P[{dog, goat}] = 0.55
P[{dog, pig}] = 0.55
P[{goat, pig}] = 0.1
P[{dog, goat, pig}] = 0.6
P[{cat, goat, pig}] = 0.5
P[{cat, dog, pig}] = 0.95
P[{cat, dog, goat}] = 0.95
P[{}] = P[{cat, dog, goat, pig}] = 1
(b) without the info P[{pig}] = 0.05
F = {, {cat, dog, goat, pig}, {cat}, {dog}, {goat, pig}, {cat, dog}, {cat, goat, pig}, {dog, goat, pig}}
P[{}] = 0
P[{cat}] = 0.4
P[{dog}] = 0.5
1
P[{goat, pig}] = 0.1
P[{cat, dog}] = 0.9
P[{cat, goat, pig}] = 0.5
P[{dog, goat, pig}] = 0.6
P[{}] = P[{cat, dog, goat, pig}] = 1
3 Let = (0, 1], and emulate the smallest -eld that contains the collection of subsets G =
{(
1
3
,
1
2
], (
1
2
, 1]}
F = {, , (
1
3
,
1
2
], (
1
2
, 1], (0,
1
3
] (
1
2
, 1], (0,
1
2
], (
1
3
, 1], (0,
1
3
]}
4 Show that if a collection F of subsets of is closed under complementation and countable
unions, it is also closed under countable intersections
F is closed under complementation and countable unions, that is,
A F A
c
F
(i N)A
i
F

i=1
A
i
F
(i N)A
i
F

i=1
A
c
i
F
With De Morgans Law
(i N)A
i
F [

i=1
A
i
]
c
F

i=1
A
i
F
5 Rosss Paradox
This is an open question. Note that these two scenarios are equivalent. At each time t =
1 (
1
2
)
n1
), one ball gets removed and more balls are added in.
An acceptable answer would just states either side of the paradox:
1. itll be empty, since every ball will be removed at some point before time t =1.
2. it wont be empty, since once we remove a ball, we add more balls.
A better answer would point out both of them. A much better answer would states the underly-
ing reason of the paradox the problem is ill-dened, since we are trying to determine the status
of a system at a moment we wont reach at all (t = 1). Though we know the systems status
when approaching the underlying moment. It cannot be generalized to its status at the moment
at all.
2