Understanding σ-Fields: Exploring F and G Intersection & Union in Set Theory

  • Thread starter Alexsandro
  • Start date
In summary, the conversation discusses the properties of σ-fields and their intersections and unions. It is shown that the intersection of two σ-fields is also a σ-field, but the union may not necessarily be a σ-field. A counterexample is provided to demonstrate this.
  • #1
Alexsandro
51
0
Can someone help me with this question ?

Let F and G be σ-fields os subsets of S.

(a) Let H = F intersection G be the collection of subsets of S lying in both F and G. Show that H is a σ-field.

(b) Show that F union G, the collection of subsets of S lying in either F or G, is not necessarilt a σ-field.
 
Physics news on Phys.org
  • #2
(a) show that the intersection of two closed sets is a closed set (e.g. "closed under complements").

(b) counterexample: Let f be an element of F and g be an element of G. Suppose f U g is neither in F nor in G, therefore not in H. This means H is not closed under union.

P.S. Let S = {1,2,3}, F = {S, ø, {1}, {2,3}}, G = {S, ø, {2}, {1,3}}. Then F U G = {S, ø, {1}, {2,3}, {2}, {1,3}}. If H = F U G was σ, then it would be closed under union, which implies that {1} U {2} = {1,2} would be a distinct element of H. Since it is not, H is not σ.
 
Last edited:
  • #3


(a) To show that H is a σ-field, we must prove three properties: closure under complement, closure under countable union, and non-emptiness.

Closure under complement: Let A be a subset of S lying in both F and G. Then, A is also a subset of F and G individually. Since F and G are σ-fields, they are closed under complement. Therefore, A' (complement of A) must also be a subset of both F and G, and hence, A' is in H. This proves closure under complement for H.

Closure under countable union: Let {A_n} be a countable collection of subsets of S lying in both F and G. This means that each A_n is also a subset of F and G individually. Since F and G are σ-fields, they are closed under countable union. Therefore, the countable union of A_n, denoted by ∪A_n, must also be a subset of both F and G, and hence, ∪A_n is in H. This proves closure under countable union for H.

Non-emptiness: Since F and G are σ-fields, they both contain the empty set ∅. Therefore, ∅ is also a subset of both F and G, and hence, ∅ is in H. This proves non-emptiness for H.

Hence, we have shown that H is a σ-field, as it satisfies all three properties.

(b) To show that F union G is not necessarily a σ-field, we must find a counterexample where at least one of the three properties is not satisfied.

Let F = {∅, {1}, {2,3}, {1,2,3}}, G = {∅, {1}, {2,3}, {2,4}, {1,2,3,4}}.

F union G = {∅, {1}, {2,3}, {2,4}, {1,2,3}, {1,2,4}, {1,2,3,4}}.

This collection is not closed under complement, as {2,4} is in F union G, but its complement {1,2,3} is not. Therefore, F union G is not a σ-field.
 

FAQ: Understanding σ-Fields: Exploring F and G Intersection & Union in Set Theory

What is a σ-field?

A σ-field, also known as a sigma-field, is a collection of subsets of a given set that satisfies certain properties. These properties include containing the empty set, being closed under complement, and being closed under countable unions. σ-fields are commonly used in probability theory and measure theory.

How is a σ-field different from a regular field?

A regular field is a collection of subsets that satisfies similar properties as a σ-field, but it is not required to be closed under countable unions. This means that a σ-field is a special type of field that has the added property of being closed under countable unions.

What is the importance of a σ-field in probability theory?

A σ-field is important in probability theory because it allows us to define and measure probabilities for events. By defining a σ-field on a sample space, we can determine which events are measurable and assign probabilities to them. This allows us to make predictions and analyze data in a systematic way.

How do you construct a σ-field?

A σ-field can be constructed by starting with a given set and including the empty set, all subsets that are complements of previously included subsets, and all countable unions of previously included subsets. This process will result in a σ-field that satisfies all the necessary properties.

Can a σ-field contain an uncountable number of subsets?

Yes, a σ-field can contain an uncountable number of subsets. As long as the σ-field satisfies the necessary properties, it can contain any number of subsets, including uncountable ones. This is one of the reasons why σ-fields are so useful in probability theory, as they allow us to work with a wide range of possible outcomes and events.

Similar threads

Back
Top