Bifalgorithm post · Brisk · Chapter 1

How do partitions divide an event into mutually exclusive and exhaustive pieces?

How do partitions divide an event into mutually exclusive and exhaustive pieces? (Brisk · Chapter 1) — "There’s a very useful fact that goes by the grandiose n…

Ideas in this flowchart

  • La Ley de la Probabilidad Total
  • La probabilidad de un evento puede obtenerse dividiéndolo en partes y sumando sus probabilidades.
  • La división debe hacerse mediante una partición.
  • Una partición es un conjunto de subconjuntos mutuamente excluyentes y colectivamente exhaustivos.
  • Un conjunto y su complemento forman una partición de Ω.
  • Para cualesquiera conjuntos A y B, A ∩ B y A ∩ Bᶜ forman una partición de A.
  • A ∩ B contiene los elementos de A que están en B, mientras que A ∩ Bᶜ contiene los que no están en B.
  • La misma idea puede extenderse a más de dos conjuntos.
  • C₁ representa a las personas nacidas en estados del sur, C₂ a las nacidas en estados del oeste y C₃ a quienes no nacieron en ninguna de esas regiones.
  • A ∩ C₁, A ∩ C₂ y A ∩ C₃ forman una partición de A porque cada aficionado pertenece a una sola de esas categorías.
Feed/

How do partitions divide an event into mutually exclusive and exhaustive pieces?

Channel

Brisk

1 page

"There’s a very useful fact that goes by the grandiose name “The Law of Total Probability.” It goes like this. If there’s an event whose probability we’d like to know, we can split it up into pieces and add up their probabilities, as long as we do it in the right way. “The right way” bit is the key, of course. And it has to do with partitions. Recall from section 2.12 that a partition of a set is a mutually exclusive and collectively exhaustive group of subsets. One example is that every set and its complement together form a partition of Ω. By the same token, for any sets A and B, these two sets together form a partition of A: A ∩ B and A ∩ Bᶜ. The first set contains members of A that are also in B, and the second set contains members of A that are not in B. Clearly, every member of A is in one of these two sets, and no member is in both. This works for any two sets A and B: A ∩ B and A ∩ Bᶜ are a partition of A. This idea can be extended to more than two sets. Let C₁ be the set of all people born in southern states, C₂ the set of people born in western states, and C₃ those not born in either region. The following three sets, then, together form another partition of A: A ∩ C₁, A ∩ C₂, and A ∩ C₃. This is because every professional wrestling fan is either born in the south, or born in the west, or neither one."

Flowchart preview
Series cover
👍
0
0 comments0 shares

Sign in to view and post comments.