Probability Spaces

The Sample Space

  • A sample space is a set that contains all possible outcomes of some function
  • A sample space is typically written as Ω\Omega
  • The following is an example of a sample space of a coin toss:
Ω={H,T}\Omega = \text{\textbraceleft}{H,T}\text{\textbraceright}
  • The following is an example of a sample space of a two coin tosses:
Ω={(H,T),(H,H),(T,H),(T,T)}\Omega = \text{\textbraceleft}{(H,T),(H,H),(T,H),(T,T)}\text{\textbraceright}

Algebra

  • An algebra is typically written as
  • Essentially, an algebra is a collection of subsets from Ω\Omega that satisfies all of the following:

    • The null set (i.e. empty set) is contained within our algebra
    \emptyset \in ℑ
    • If A\text{A} \in ℑ, then Ac\text{A}^{c} is also \in ℑ
    A and Ac if AΩ\text{A} \in ℑ \text{ and } \text{A}^{c} \in ℑ \text{ if } \text{A} \subset \Omega
    • If A\text{A} \in ℑ and B\text{B} \in ℑ, then AB\text{A} \cup \text{B} \in ℑ
    AB if A and B\text{A} \cup \text{B} \in ℑ \text{ if } \text{A} \in ℑ \text{ and } \text{B} \in ℑ
  • In other words, an algebra on a set XX is a collection of subsets of XX that satisfy the following:

    1. contains the empty subset \emptyset and the set XX
    2. is closed under complement

      • This means if A\text{A} \in ℑ, then Ac\text{A}^{c} \in ℑ for all A\text{A} \in ℑ
    3. is closed under finite unions

      • This means for all A1,A2,...,AkA_{1},A_{2},...,A_{k} in , then A1A2...AkA_{1} \cup A_{2} \cup ... \cup A_{k} are within
      • This also means that A1A2...AkA_{1} \cup A_{2} \cup ... \cup A_{k} is a finite collection of elements
      • Specifically, k equals some known number (k<)(k < \infty)
      • In other words, the number of sets within is finite, and the union of all of the finite sets in are also finite

σ\sigma-Algebra

  • Essentially, a σ\sigma-algebra is a collection of subsets from Ω\Omega that satisfies the following:

    • is an algebra
    • A1,A2,...A_{1}, A_{2}, ... \in ℑ implies A1A2...A_{1} \cup A_{2} \cup ... \in ℑ
  • In other words, a σ\sigma-algebra on a set SS is a collection of subsets of satisfying the following properties:

    1. contains the empty subset \emptyset and XX
    2. is closed under complement
    3. is closed under countable unions

      • This means for all A1,A2,...,AkA_{1},A_{2},...,A_{k} in , then A1A2...AkA_{1} \cup A_{2} \cup ... \cup A_{k} are within
      • This also means that A1A2...AkA_{1} \cup A_{2} \cup ... \cup A_{k} is a countable collection of elements
      • Specifically, k is some theoretically countable number
      • In other words, the sets within are countable, and the union of all of the countable sets in are also countable

Examples of Algebras

  • Let the following be true:

    • XX is an infinite set
    • AA is the collection of all subsets of XX which are finite or have finite complement
  • In this scenario, AA would be an algebra of sets, which is not a σ\sigma-algebra
  • The following are examples of σ\sigma-algebras:
={,Ω}ℑ = \text{\textbraceleft}{\emptyset, \Omega}\text{\textbraceright} ={,A,Ac,Ω}ℑ = \text{\textbraceleft}{\emptyset, A, A^{c}, \Omega}\text{\textbraceright} =2Ωℑ = 2^{\Omega}
  • In this situation, 2Ω2^{\Omega} is a collection of all of the subsets of Ω\Omega
  • The following is an example of a collection of sets that is neither an algebra or a σ\sigma-algebra:
{,A,Ω}\text{\textbraceleft}{\emptyset, A, \Omega}\text{\textbraceright}
  • In this situation, this collection of sets would need to contain ACA^{C} for it to be an algebra

The Probability Measure Function

  • A probability measure function is a function that maps events to its corresponding probabilities
  • A probability measure function is denoted as PP

Probability Space (Ω,,P)(\Omega, ℑ, P)

  • A probability space is constructed with a specific kind of experiment in mind
  • One proposes that each time a situation of that kind arises, the set of possible outcomes is the same and the probabilities are also the same
  • A probability space consists of the following:

    • A sample space Ω\Omega that is a set of all possible outcomes
    • A set of events that is a set of events, where each event is a set of any possible outcome
    • A function PP that maps the events to probabilities
  • Once the probability space is established, it is assumed that nature makes its move and selects a single outcome ω\omega from the sample space Ω\Omega
  • All the events in that contain the selected outcome ω\omega (recall that each event is a subset of Ω\Omega) are said to have occurred
  • The selection performed by nature is done in such a way that if the experiment were to be repeated an infinite number of times, the relative frequencies of occurrence of each of the events would coincide with the probabilities prescribed by the function PP

References

Previous

Countability