STAT 303 Flashcards
define: Sample Space
The sample space of an experiment is the set of all possible outcomes of that experiment.
define: Event
An event A of a sample space S is any subset of outcomes of S. An event A of a sample space S is denoted by A ⊆ S.
define: Mutually Exclusive
A pair of events A and B in a sample space S are called mutually exclusive if A ∩ B = ∅.
define: Discrete sample space
A sample space that is either finite or countably infinite
define: Union of Events A and B
Let S be a sample space and let A, B ⊆ S.
The union of A and B, denoted A∪B, is the event that contains all outcomes that are contained in both A and B; that is,
A ∪ B = {x ∈ S : x ∈ A or x ∈ B} ⊆ S
define: Intersection of Events A and B
Let S be a sample space and let A, B ⊆ S.
The intersection A and B, denoted A ∩ B, is the event that contains all outcome common to both A and B; that is,
A ∩ B = {x ∈ S : x ∈ A and x ∈ B} ⊆ S
define: Complement
Let A ⊆ S be an event in a sample space S. The complement of A, denoted A’, is the event of S that consists of all outcomes in S that are not contained in A. That is,
A’ = {x ∈ S : x ∉ A}
define: Probability
Let S be a sample space. A probability P on S is a set function that assigns each event A ⊆ S a real number value called the probability of A, denoted by P(A), that also satisfies the following three properties:
i) P (S) = 1
ii) P (A) ≥ 0 for all events A ⊆ S
iii) Countable Additivity
define: Pairwise Mutually Exclusive Sqnc of Events
Let Ai ⊆ S be a sequence of events on sample space S, with i ∈ I some index set. Ai is called a pairwise mutually exclusive sequence if Ai ∩ Aj = ∅ whenever i ≠ j. So named because the events are mutually exclusive when taken in pairs.
define: Countable additivity
Let P be a probability on a sample space S, where Ai is a pairwise mutually exclusive sequence of events. Then the probability of the union of Ai is equal to the sum of the probabilities of Ai
define: Classical probability
Let S be a finite sample space. For any event A ⊆ S, let #A denote the number of outcomes contained in A. In particular, let N = #S. Define a set function P on the events of S by,
P(A) = #A / N
for all events A ⊆ S. The set function P defined as such is called classical probability on S.
define: Boole’s Inequality
Let Ai be any sequence of events in a sample space S (with i ∈ I some index set). Then the probability of the union of Ai is ≤ the sum of the probabilities.
What’s another name for Boole’s inequality?
Countable subadditivity.
define: Bonferroni’s Inequality
Let Ai be a finite sequence of events in a sample space S. Then, the probability of the intersections of Ai is ≥ 1 - the sum of P(Ai’)
List the properties of probability
Let P be a probability on a sample space S. Then,
- P (∅) = 0
- Finite Additivity
- Complement law –> P(A’) = 1 - P(A) for all events A ⊆ S
- P (A) ≤ 1 for all events A ⊆ S
- P (A ∪ B) = P (A) + P (B) − P (A ∩ B) for any pair of events A, B ⊆ S
- If A ⊆ B, then P (A) ≤ P (B)