Trace it. Derive it. Know it.
Every cluster below maps one schematic path β from first principles to the final equation. Expand a node to follow the full derivation trace.
Conditional Probability P(A|B) & Fundamental Properties
3 concepts Β· CoreHow does prior knowledge that event B has occurred restrict the sample space to update the probability of event A?
The conditional probability of event E given that event F has already occurred is P(E|F) = P(E intersection F) / P(F), with P(F) > 0. Fundamental properties include P(S|F) = 1, P((A union B)|F) = P(A|F) + P(B|F) - P((A intersection B)|F), and P(E'|F) = 1 - P(E|F).
Definition of Conditional Probability: P(A|B) = P(A cap B) / P(B)
For any two events A and B associated with sample space S, the conditional probability of event A given that event B has occurred is P(A|B) = P(A cap B) / P(B), provided P(B) > 0.
Fundamental Properties of Conditional Probability
Property 1: P(S|B) = P(B|B) = 1. Property 2: P((E cup F)|B) = P(E|B) + P(F|B) - P((E cap F)|B). Property 3: Complement rule: P(A'|B) = 1 - P(A|B).
Sample Space Reduction Technique for Discrete Experiments
In discrete experiments with equally likely outcomes, P(A|B) can be calculated directly by counting: P(A|B) = n(A cap B) / n(B), bypassing decimal division of individual probabilities.
Multiplication Theorem on Probability & Criteria for Independent Events
3 concepts Β· CoreHow does the multiplication theorem compute joint probabilities, and what is the rigorous mathematical test for independent events?
The multiplication rule states P(E intersection F) = P(E) P(F|E) = P(F) P(E|F). Events E and F are independent if the occurrence of one does not affect the other: P(E|F) = P(E), yielding the gold standard test P(E intersection F) = P(E) P(F). Pairwise independence does not imply mutual independence for three or more events.
The Multiplication Rule: P(A cap B) = P(A) * P(B|A)
The joint probability that both events A and B occur sequentially is P(A cap B) = P(A) * P(B|A). For three events: P(A cap B cap C) = P(A) * P(B|A) * P(C | (A cap B)).
Mathematical Criterion for Independent Events: P(A cap B) = P(A) * P(B)
Two events A and B are independent if and only if P(A cap B) = P(A) * P(B). If this equality holds, then P(A|B) = P(A) and P(B|A) = P(B).
Independent Events vs Mutually Exclusive Events: Complete Distinction
Mutually exclusive events cannot occur together: A cap B = Phi, so P(A cap B) = 0. Independent events can occur together: P(A cap B) = P(A) * P(B) > 0 (for non-zero probabilities).
Partition of Sample Space & The Law of Total Probability
3 concepts Β· CoreHow does decomposing a sample space into pairwise disjoint exhaustive partitions reconstruct the total probability of an observed event?
A collection of events {E1, E2, ..., En} forms a partition of S if they are pairwise disjoint (Ei intersection Ej = null for i != j), exhaustive (union Ei = S), and each has P(Ei) > 0. The Theorem on Total Probability states that for any event A in S, P(A) = sum_{i=1}^n P(Ei) P(A|Ei).
Mathematical Definition and Criteria for a Partition of Sample Space
A collection of events {E1, E2, ..., En} forms a partition of sample space S if: (1) Ei cap Ej = Phi for all i != j (pairwise disjoint); (2) E1 cup E2 cup ... cup En = S (exhaustive); (3) P(Ei) > 0 for all i.
The Law of Total Probability: P(A) = sum P(Ei) * P(A|Ei)
Let {E1, E2, ..., En} be a partition of S. Then for any event A of S: P(A) = sum_{i=1}^n P(Ei) * P(A|Ei) = P(E1)P(A|E1) + P(E2)P(A|E2) + ... + P(En)P(A|En).
Multi-Stage Tree Diagrams for Probability Synthesis
A probability tree diagram visually maps sequential experiments: primary branches represent partition events P(Ei), and secondary branches emanating from each Ei represent conditional probabilities P(A|Ei).
Bayes' Theorem & Inverse Probability Diagnosis
3 concepts Β· CoreHow does Bayes' theorem invert cause-and-effect conditional probabilities to compute posterior diagnostic probabilities?
Bayes' Theorem inverts cause-and-effect reasoning: given that effect A has been observed, the posterior probability that it arose from cause Ei is P(Ei|A) = [P(Ei) P(A|Ei)] / [sum_{j=1}^n P(Ej) P(A|Ej)]. Prior probabilities P(Ei) are updated to posterior probabilities P(Ei|A) in light of observed evidence.
Bayes' Theorem Mathematical Statement and Formula
Let {E1, E2, ..., En} be a partition of sample space S with P(Ei) > 0. For any event A with P(A) > 0, the posterior probability is P(Ei|A) = [P(Ei) * P(A|Ei)] / [sum_{k=1}^n P(Ek) * P(A|Ek)].
Terminology: Prior Probabilities, Likelihoods, and Posterior Probabilities
Prior probability P(Ei) is the initial probability of hypothesis Ei before evidence is collected. Likelihood P(A|Ei) is the probability of observing evidence A under hypothesis Ei. Posterior probability P(Ei|A) is the updated probability after evidence A is observed.
Diagnostic Tests, False Positives, and Industrial Quality Control
Bayes' theorem resolves the 'base rate fallacy': when a disease or manufacturing defect is very rare, even a small false positive rate can cause the vast majority of positive flags to be false alarms.
Random Variables, Probability Distributions, Expectation (Mean) & Variance
3 concepts Β· CoreHow are real-valued random variables mapped to probability distributions to calculate expected values (mean) and variance?
A random variable X is a real-valued function X: S -> R. Its probability distribution lists pairs (xi, pi) with pi >= 0 and sum pi = 1. The expectation (mean) is mu = E(X) = sum xi pi. The variance is Var(X) = sigma^2 = E(X^2) - [E(X)]^2 = sum xi^2 pi - mu^2, and standard deviation is sigma = +sqrt(Var(X)).
Random Variable Definition and Valid Probability Distribution Table
A random variable X maps sample points to real numbers. A discrete probability distribution lists values x_i alongside probabilities p_i = P(X = x_i). It is valid if and only if: (1) p_i >= 0 for all i; and (2) sum_{i=1}^n p_i = 1.
Mathematical Expectation (Mean): mu = E(X) = sum x_i * p_i
The mean or expectation of a discrete random variable X, denoted mu or E(X), is the weighted average of its possible values: mu = E(X) = sum_{i=1}^n x_i * p_i.
Variance and Standard Deviation: Var(X) = E(X^2) - [E(X)]^2
Variance measures dispersion around the mean: Var(X) = sigma^2 = E[(X - mu)^2] = sum (x_i - mu)^2 * p_i = E(X^2) - [E(X)]^2, where E(X^2) = sum x_i^2 * p_i. Standard deviation is sigma = sqrt(Var(X)).
Bernoulli Trials, Binomial Distribution B(n, p) & Parameter Relationships
3 concepts Β· CoreHow does repeating independent Bernoulli trials generate the Binomial distribution B(n, p) with mean n*p and variance n*p*q?
Bernoulli trials are n independent, repeated trials with exactly two outcomes (success with probability p, failure with q = 1 - p). The number of successes X follows a Binomial distribution B(n, p) with probability mass function P(X = r) = nCr p^r q^(n-r) for r = 0, 1, ..., n. Its mean is mu = np and variance is sigma^2 = npq, with sigma^2 < mu always.
Bernoulli Trials Definition and The Four Essential Criteria
Trials of a random experiment are Bernoulli Trials if and only if: (1) the number of trials n is finite; (2) trials are independent; (3) each trial yields only two outcomes (Success S or Failure F); (4) probability of success p is constant across all trials.
Binomial Probability Formula: P(X = r) = nCr * p^r * q^(n - r)
In n Bernoulli trials with success probability p and failure probability q = 1 - p, the probability of exactly r successes is P(X = r) = nCr * p^r * q^(n - r), where r = 0, 1, 2, ..., n.
Mean (np), Variance (npq), and Cumulative Queries ('At Least', 'At Most')
For X ~ B(n, p): Mean = n*p, Variance = n*p*q (where q = 1 - p). Cumulative queries: 'At least r successes' = P(X >= r) = sum_{k=r}^n P(X = k); 'At most r successes' = P(X <= r) = sum_{k=0}^r P(X = k). Note: P(X >= 1) = 1 - P(X = 0).