Probability Diagrams

Branching Structure: Tree diagrams represent multi-stage experiments where each set of branches originating from a single node represents all possible outcomes for that specific stage.

The Multiplication Rule: To find the probability of a specific sequence of events (e.g., Event A followed by Event B), you must multiply the probabilities along the connecting branches from left to right.

The Addition Rule: When multiple distinct paths lead to a desired outcome, the individual probabilities of those paths are added together to find the total probability of the combined event.

Conditional Probability in Trees: In dependent scenarios, the probabilities on the second set of branches are updated to reflect the outcome of the first stage, effectively representing $P(B|A)$.

Intersection and Union: Venn diagrams use overlapping circles to represent the intersection ($A \cap B$), where both events occur, and the union ($A \cup B$), where at least one event occurs.

Mutually Exclusive Events: If two circles in a Venn diagram do not overlap, the events are mutually exclusive, meaning $P(A \cap B) = 0$ and they cannot happen at the same time.

Exhaustive Sets: If the sum of all values inside the circles and the surrounding rectangle equals the total sample size, the diagram represents a complete and exhaustive set of possibilities.

Calculating Conditional Probability: To find $P(A|B)$ using a Venn diagram, you restrict the sample space to only the contents of circle $B$ and determine what fraction of that circle is occupied by the overlap with $A$.

Coordinate Mapping: Two-way tables, or sample space grids, are ideal for experiments involving two independent discrete variables, such as rolling two dice or spinning two wheels.

Outcome Counting: Each cell in the grid represents a unique combined outcome; the probability of a specific event is the number of favorable cells divided by the total number of cells in the grid.

Pattern Recognition: Grids are particularly useful for identifying diagonal patterns, such as finding all combinations that result in a specific sum or difference between two values.

Independence Visualization: Because the rows and columns are determined independently, these tables clearly illustrate how the outcome of one event does not restrict the possibilities of the second.

Sequential vs. Simultaneous: Use Tree Diagrams for sequential events where order matters or probabilities change, and use Venn Diagrams for simultaneous set relationships or logical overlaps.

Discrete vs. Continuous: Two-Way Tables are strictly for discrete outcomes with a limited number of possibilities, whereas Venn diagrams can represent proportions of a continuous population.

The 'Without Replacement' Trap: Always check if an item is replaced after the first stage; if not, the denominator and possibly the numerator of the second branch must be reduced by one.

At Least One Logic: When asked for the probability of 'at least one' event occurring over several trials, it is often faster to calculate $1 - P(\text{none})$ using a single path on a tree diagram.

Venn Overlap Double-Counting: When filling a Venn diagram, always start with the intersection ($A \cap B$) and subtract that value from the totals of $A$ and $B$ to find the 'only A' and 'only B' regions.

Sanity Checks: Ensure that every set of branches in a tree diagram sums to exactly $1$ and that no individual probability in any diagram exceeds $1$ or falls below $0$.