Questions on Basic Axioms for Calculating Probabilities

  • Context: MHB 
  • Thread starter Thread starter nacho-man
  • Start date Start date
  • Tags Tags
    Axioms
Click For Summary

Discussion Overview

The discussion revolves around the interpretation of a problem related to calculating probabilities using axioms, specifically focusing on expressing a set as a union of countably many disjoint sets. The scope includes theoretical aspects of probability and mathematical reasoning.

Discussion Character

  • Technical explanation
  • Mathematical reasoning
  • Debate/contested

Main Points Raised

  • Some participants express confusion regarding the hint that suggests expressing a set $A$ as a union of countably many disjoint sets, despite the definition of the sets $A_n$ indicating they are not disjoint.
  • Participants note that if $A_n \subset A_{n+1}$, then the union of the first $N$ sets equals $A_N$, which implies that the sets $A_n$ are not disjoint.
  • One participant proposes defining new sets $B_n = A_n \setminus \bigcup_{k=1}^{n-1} A_k$ to create mutually disjoint sets, suggesting that this approach allows the application of the axiom of σ-additivity.
  • Another participant reiterates their confusion about the requirement to express $A$ as a union of disjoint sets, questioning the rationale behind it.

Areas of Agreement / Disagreement

Participants generally express confusion and disagreement regarding the hint's suggestion to express $A$ as a union of disjoint sets, with no consensus on the reasoning behind this requirement.

Contextual Notes

There are limitations in understanding the implications of the hint and the definitions of the sets involved, as well as the application of σ-additivity in this context. The discussion does not resolve these uncertainties.

nacho-man
Messages
166
Reaction score
0
Please refer to the attached image.

for problem 1a)
i can see how this makes intuitive sense, however the hint confuses me.

When we are told that $A_n \subset A_{n+1}$ why would the hint say to attempt to express $A$ as as a union of countably many disjoint sets, when it is defined not to be disjoint in the question?

$P(A) = P(A_1) + ... + P(A_n)$ as $n$ approaches $\infty$
 

Attachments

  • Untitled.jpg
    Untitled.jpg
    27.8 KB · Views: 108
Physics news on Phys.org
nacho said:
Please refer to the attached image.

for problem 1a)
i can see how this makes intuitive sense, however the hint confuses me.

When we are told that $A_n \subset A_{n+1}$ why would the hint say to attempt to express $A$ as as a union of countably many disjoint sets, when it is defined not to be disjoint in the question?

$P(A) = P(A_1) + ... + P(A_n)$ as $n$ approaches $\infty$
If $A_n \subset A_{n+1}$ then $\cup_{n=1}^{N} A_{n} = A_{N}$ and that means that the sets $A_{n}$ aren't disjoint...

Kind regards

$\chi$ $\sigma$
 
yes, but the question says to "Express $A$ as a union of countably many disjoint sets".

i don't understand why though.
 
nacho said:
yes, but the question says to "Express $A$ as a union of countably many disjoint sets".

i don't understand why though.

I also don't understand (Emo) ...

Kind regards

$\chi$ $\sigma$
 
nacho said:
When we are told that $A_n \subset A_{n+1}$ why would the hint say to attempt to express $A$ as as a union of countably many disjoint sets, when it is defined not to be disjoint in the question?
The hint says so because for disjoint sets you can apply the axiom of σ-additivity. Yes,$A_n$ are not disjoint, so you have to define sets that are. Consider $B_n=A_n\setminus\bigcup_{k=1}^{n-1}A_k$. Then $B_n$ are mutually disjoint, $A_n=\bigcup_{k=1}^{n}B_k$ and $\bigcup_{n=1}^\infty A_n=\bigcup_{n=1}^\infty B_n$. Using these properties and σ-additivity, complete the following equality.

\[
P(A)=P(\bigcup_{n=1}^\infty A_n)= \dots=\lim_{n\to\infty}\sum_{k=1}^n P(B_k) =\dots=\lim_{n\to\infty}P(A_n)
\]
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
5K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 11 ·
Replies
11
Views
3K