Probability and Random Processes
Lecture 9
- Extensions to measures
- Product measure
Mikael Skoglund, Probability and random processes 1/16
Cartesian Product
- For a finite number of sets A1, . . . , An
×n
k=1Ak = {(a1, . . . , an) : ak ∈ Ak, k = 1, . . . , n}
- notation An if A1 = · · · = An
- For an arbitrarily indexed collection of sets {At}t∈T
×t∈T At = {functions f from T to ∪t∈T At : f(t) ∈ At, t ∈ T}
- At = A for all t ∈ T, then AT = { all functions from T to A }
- For a finite T the two definitions are equivalent (why?)
Mikael Skoglund, Probability and random processes 2/16