liveBook · Manning

Exhaustive event set

As explained in Timeless Algorithms, The Foundational Ideas

Collective exhaustiveness is the property of a set of outcomes that together they cover every possibility in a defined outcome space.

A set of outcomes is collectively exhaustive when it covers every possibility in a defined sample space. For mutually exclusive outcomes Aᵢ, exhaustiveness means their probabilities sum to 1. Mutual exclusivity prevents double-counting; exhaustiveness ensures no possibility is omitted. section 2.3.1

A six-sided die

Rolling a 2 and rolling a 5 are mutually exclusive, but not collectively exhaustive: the other four outcomes remain possible. section 2.3.1

∑i=1nP(Ai)=1

For mutually exclusive outcomes that cover the sample space, the probabilities sum to 1. section 2.3.1

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Defines exhaustiveness, distinguishes it from mutual exclusivity, and states the probability-sum condition.
Examples
Uses rolling a 2 or 5 on a six-sided die to show mutually exclusive but non-exhaustive outcomes.
What it assumes
Assumes events and a sample space; distinguishes exhaustiveness from mutual exclusivity.
What you can do after
Evaluate whether mutually exclusive outcomes cover the sample space by checking whether their probabilities sum to 1.
How it connects
Connects collective exhaustiveness to sample spaces, mutually exclusive events, and the addition rule.

Also explained in

Compare how 2 books explain exhaustive event set →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Timeless Algorithms, The Foundational Ideas. The section links point to the parts of the book it draws on.