measure theory homework, Assignments of Probability and Statistics

this is a first assignment of probability theory class. here you have exercises on definition of filed, pi-system and lambda system

Typology: Assignments

2022/2023

Uploaded on 10/23/2024

barbie1110
barbie1110 🇺🇸

1 document

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
STA 7466: Probability Theory 1
Assignment 1
Problems to Turn In
Due 2023-09-18 (Monday).
1. Let 𝑓(A)represent the field generated by a class Ain 𝛺. Show that for nonempty A,
𝑓(A)is the class of sets of the form Ò𝑚
𝑖=1Ñ𝑛𝑖
𝑗=1𝐴𝑖 𝑗 , where for each 𝑖and 𝑗either 𝐴𝑖 𝑗 Aor
𝐴𝑐
𝑖 𝑗 A, and where the 𝑚sets Ñ𝑛𝑖
𝑗=1𝐴𝑖 𝑗 ,1𝑖𝑚, are disjoint. The sets in 𝑓(A)can thus
be explicitly presented, which is not in general true of the sets in 𝜎(A).
Hint: Let Cbe the class of all sets of the specified form. Then AC(for any 𝐴C, take
𝑚=1,𝑛1=1, and 𝐴1,1=𝐴), and because 𝑓(C)must be closed under the formation of finite
unions and intersections, it is clear that AC𝑓(A). Thus, it suffices to show that Cis
a field. Because Ais nonempty, there exists at least one set 𝐴Aand thus 𝛺=𝐴𝐴𝑐C.
Next show that that Cis closed under finite intersections and then use this fact to show that
Cis closed under complementation.
2. Show that if 𝐵𝜎(A), then there exists a countable subclass A𝐵of Asuch that 𝐵𝜎(A𝐵).
Hint: Use a good-sets argument.
3. (a) Let Fbe the field consisting of the finite and the co-finite sets in an infinite 𝛺, and
define 𝑃on Fby taking 𝑃(𝐴)to be 0or 1as 𝐴is finite or cofinite. (Note that 𝑃is not
well defined if 𝛺is finite, since then every subset of 𝛺is both finite and cofinite.) Show
that 𝑃is well definied and finitely additive.
(b) Show that this 𝑃is not countably additive if 𝛺is countably infinite.
(c) Show that this 𝑃is countably additive if 𝛺is uncountable.
(d) Now let Fbe the 𝜎-field consisting of the countable and the cocountable sets in an
uncountable 𝛺, and define 𝑃on Fby taking 𝑃(𝐴)to be 0or 1as 𝐴is countable or
cocountable. (Note that 𝑃is not well defined if 𝛺is countable, since then every subset
of 𝛺is both countable and co-countable.) Show that 𝑃is well defined and countably
additive.
4. Prove Proposition 1.3.4 in the course notes. In other words, prove that Lsatisfies the new
𝜆-system postulates:
(𝜆1)𝛺L;
(𝜆2)𝐴Limplies 𝐴𝑐L;
(𝜆3)𝐴1, 𝐴2,· · · Land 𝐴𝑚𝐴𝑛=for all 𝑚𝑛, imply Ò𝑛𝐴𝑛L.
if and only if it satisfies the old 𝜆-system postulates:
(𝜆
1)𝛺L;
(𝜆
2)if 𝐴, 𝐵 Land 𝐴𝐵, then 𝐵𝐴L;
(𝜆
3)if 𝐴1, 𝐴2,· · · Land 𝐴𝑛𝐴, then 𝐴L.
1
pf3

Partial preview of the text

Download measure theory homework and more Assignments Probability and Statistics in PDF only on Docsity!

STA 7466: Probability Theory 1

Assignment 1

Problems to Turn In

Due 2023-09-18 (Monday).

  1. Let 𝑓 (A ) represent the field generated by a class A in 𝛺. Show that for nonempty A , 𝑓 (A ) is the class of sets of the form

Ò𝑚

𝑖= 1

Ñ𝑛𝑖

𝑗= 1 𝐴𝑖 𝑗^ , where for each^ 𝑖^ and^ 𝑗^ either^ 𝐴𝑖 𝑗^ ∈^ A^ or 𝐴𝑐𝑖 𝑗 ∈ A , and where the 𝑚 sets

Ñ𝑛𝑖

𝑗= 1 𝐴𝑖 𝑗^ ,^1 ≤^ 𝑖^ ≤^ 𝑚, are disjoint. The sets in^ 𝑓^ (A^ )^ can thus be explicitly presented, which is not in general true of the sets in 𝜎(A ).

Hint: Let C be the class of all sets of the specified form. Then A ⊂ C (for any 𝐴 ∈ C , take 𝑚 = 1 , 𝑛 1 = 1 , and 𝐴 1 , 1 = 𝐴 ), and because 𝑓 (C ) must be closed under the formation of finite unions and intersections, it is clear that A ⊂ C ⊂ 𝑓 (A ). Thus, it suffices to show that C is a field. Because A is nonempty, there exists at least one set 𝐴 ∈ A and thus 𝛺 = 𝐴 ⊎ 𝐴𝑐^ ∈ C_. Next show that that_ C is closed under finite intersections and then use this fact to show that C is closed under complementation.

  1. Show that if 𝐵 ∈ 𝜎(A ), then there exists a countable subclass A𝐵 of A such that 𝐵 ∈ 𝜎(A𝐵).

Hint: Use a good-sets argument.

  1. (a) Let F be the field consisting of the finite and the co-finite sets in an infinite 𝛺, and define 𝑃 on F by taking 𝑃( 𝐴) to be 0 or 1 as 𝐴 is finite or cofinite. (Note that 𝑃 is not well defined if 𝛺 is finite, since then every subset of 𝛺 is both finite and cofinite.) Show that 𝑃 is well definied and finitely additive. (b) Show that this 𝑃 is not countably additive if 𝛺 is countably infinite. (c) Show that this 𝑃 is countably additive if 𝛺 is uncountable. (d) Now let F be the 𝜎-field consisting of the countable and the cocountable sets in an uncountable 𝛺, and define 𝑃 on F by taking 𝑃( 𝐴) to be 0 or 1 as 𝐴 is countable or cocountable. (Note that 𝑃 is not well defined if 𝛺 is countable, since then every subset of 𝛺 is both countable and co-countable.) Show that 𝑃 is well defined and countably additive.
  2. Prove Proposition 1.3.4 in the course notes. In other words, prove that L satisfies the new 𝜆-system postulates: ( 𝜆 1 ) 𝛺 ∈ L ; ( 𝜆 2 ) 𝐴 ∈ L implies 𝐴𝑐^ ∈ L ; ( 𝜆 3 ) 𝐴 1 , 𝐴 2 , · · · ∈ L and 𝐴𝑚 ∩ 𝐴𝑛 = ∅ for all 𝑚 ≠ 𝑛, imply

Ò

𝑛 𝐴𝑛^ ∈^ L^.

if and only if it satisfies the old 𝜆-system postulates: ( 𝜆′ 1 ) 𝛺 ∈ L ; ( 𝜆′ 2 ) if 𝐴, 𝐵 ∈ L and 𝐴 ⊂ 𝐵, then 𝐵 − 𝐴 ∈ L ; ( 𝜆′ 3 ) if 𝐴 1 , 𝐴 2 , · · · ∈ L and 𝐴𝑛 ↑ 𝐴, then 𝐴 ∈ L.

Recommended Problems

These will not be collected.

  1. (a) Suppose that 𝛺 ∈ F and that 𝐴, 𝐵 ∈ F implies 𝐴 − 𝐵 = 𝐴 ∩ 𝐵𝑐^ ∈ F. Show that F is a field. (b) Suppose that 𝛺 ∈ F and that F is closed under the formation of complements and finite disjoint unions. Show that F need not be a field.
  2. Let F 1 , F 2 ,... be classes of subsets of 𝛺.

(a) Suppose that F𝑛 are fields satisfying F𝑛 ⊂ F𝑛+ 1. Show that

Ð∞

𝑛= 1 F𝑛^ is a field.

(b) Suppose that F𝑛 are 𝜎-fields satisfying F𝑛 ⊂ F𝑛+ 1. Show by example that

Ð∞

𝑛= 1 F𝑛

need not be a 𝜎-field.

  1. (a) Show that if A consists of the singletons, then 𝑓 (A ) is the field of finite and cofinite sets. (b) Show that 𝑓 (A ) ⊂ 𝜎(A ), that 𝑓 (A ) = 𝜎(A ) if A is finite, and that 𝜎( 𝑓 (A )) = 𝜎(A ). (c) Show that if A is countable, then 𝑓 (A ) is countable. (d) Show for fields F 1 and F 2 that 𝑓 (F 1 ∪ F 2 ) consists of the finite disjoint unions of sets 𝐴 1 ∩ 𝐴 2 with 𝐴𝑖 ∈ F𝑖. Extend.
  2. Let 𝐻 be a set lying outside F , where F is a field [or 𝜎-field]. Show that the field [or 𝜎-field] generated by F ∪ {𝐻} consists of all sets of the form

(𝐻 ∩ 𝐴) ∪ (𝐻𝑐^ ∩ 𝐵), 𝐴, 𝐵 ∈ F. (2.33)

  1. Suppose for each 𝐴 in A that 𝐴𝑐^ is a countable union of elements of A. The class of intervals in ( 0 , 1 ] has this property. Show that 𝜎(A ) coincides with the smallest class over A that is closed under the formation of countable unions and intersections.
  2. (a) Show that if 𝜎(A ) contains every subset of 𝛺, then for each pair 𝜔 and 𝜔′^ of distinct points in 𝛺, there is in A an 𝐴 such that 𝐼𝐴(𝜔) ≠ 𝐼𝐴(𝜔′). (b) Show that the reverse implication holds if 𝛺 is countable. (c) Show by example that the reverse implication need not hold for uncountable 𝛺. Show that a 𝜎-field cannot be countably infinite — its cardinality must be finite or else at least that of the continuum. Show by example that a field can be countably infinite.
  3. A 𝜎-field is countably generated , or separable , if it is generated by some countable class of sets.

(a) Show that the 𝜎-field R of Borel sets in R is countably generated. (b) Show that the 𝜎-field of countable and cocountable sets is countably generated if and only if 𝛺 is countable.

Hint: Let F represent the 𝜎 -field of countable and cocountable sets. Assume that 𝛺 is uncountable and that F = 𝜎({𝐴 1 , 𝐴 2 ,.. .}). Argue that each 𝐴𝑛 can be taken to be