Foundations of Probability, Sample Spaces, and Multi-Stage Tree Diagrams

Foundations and Core Concepts of Probability

Probability provides the mathematical framework for quantifying uncertainty and measuring the chance of an occurrence happening. At the core of probability theory lies the concept of a random experiment, which is any procedure that can be repeated infinitely many times and has a well-defined set of possible outcomes. The degree of likelihood that a particular outcome occurs is expressed numerically on a continuous scale ranging from impossible to certain.

A sample space, commonly denoted by the symbol $S$, represents the exhaustive set containing every possible outcome that can result from a given experiment. Determining the sample space is the foundational first step in solving any probabilistic problem, as it defines the universe of all observable possibilities. An event (noted in basic terminology as a guent) represents a specific outcome or a defined collection of outcomes, formally defined as a subset of the sample space. Because an event is a mathematical subset, any event $E$ satisfies the relation $E \subseteq S$.

Sample Space Formulations for Discrete Experiments

When a standard, fair two-sided coin is tossed, the experiment yields exactly two mutually exclusive outcomes: Heads ($H$) or Tails ($T$). The full sample space for this single coin flip experiment is defined explicitly as the set $S = \{H, T\}$. Each outcome in a fair coin flip carries an equal chance of occurring, establishing a symmetric probability distribution across the elements of the set.

In the case of a standard rolled die (often described in discrete contexts as a rolled dee), the possible outcomes correspond to the six distinct faces numbered one through six. The sample space for this experiment is given as $S = \{1, 2, 3, 4, 5, 6\}$. From this complete sample space, several distinct events can be isolated by identifying specific mathematical properties among the outcomes.

The event consisting of all even numbers within the rolled die experiment requires identifying all integers in the sample space divisible by $2$. This produces the subset $\{2, 4, 6\}$. Conversely, the complementary event of identifying odd numbers isolates all integers in the sample space not divisible by $2$, which yields the subset $\{1, 3, 5\}$. Furthermore, defining the event of numbers that can be divided by $3$ (multiples of three within the space) isolates the specific outcomes $\{3, 6\}$. These categorical partitions, along with foundational indexing benchmarks such as item markers like $Bb$ and reference parameters like $5-21$, illustrate how elementary set-theoretic operations establish the baseline for event identification within finite sample spaces.

Sequential Experiments and Tree Diagrams with Replacement

A tree diagram provides a visual and systematic structure for analyzing multi-stage probability problems, explicitly mapping out every possible sequence of outcomes and their associated probabilities across consecutive stages. This diagrammatic method is particularly valuable in multi-step selection problems, such as the experiment where Jony possesses a container or bag (noted as a boy) holding blue sweets and red sweets (identified specifically as $I$ blue sweets and a red sweets in the container).

In this experiment, Jony picks a sweet at random (denoted as Fontorandom), observes its color, replaces it back into the container, and pulls again at random. The operational rule of replacement is a critical parameter. Because the selected sweet is placed back into the container prior to the second draw, the composition of the container is completely restored to its original state. As a result, the outcome of the first draw has no influence on the probabilities of the second draw, rendering the two consecutive draws statistically independent events.

Constructing the tree diagram to represent this scenario requires establishing two primary branches originating from the start node, corresponding to the first pick: one branch for selecting a blue sweet ($B$) and one branch for selecting a red sweet ($R$). From the terminus of each initial branch, two secondary branches emerge to represent the second pick, again dividing into blue ($B$) and red ($R$). This branching structure generates four distinct compound outcomes forming the combined sample space: Blue followed by Blue ($BB$), Blue followed by Red ($BR$), Red followed by Blue ($RB$), and Red followed by Red ($RR$).

To calculate the proper probabilities that Jony possesses for each terminal outcome, the probabilities along each successive branch are multiplied together in accordance with the multiplication rule for independent events. The probability of obtaining two consecutive blue sweets is calculated as $P(BB) = P(B) \times P(B)$, while the probability of drawing two consecutive red sweets is calculated as $P(RR) = P(R) \times P(R)$. The mixed outcomes are similarly evaluated as $P(BR) = P(B) \times P(R)$ and $P(RB) = P(R) \times P(B)$. Because these paths account for all possible trajectories through the two-stage experiment, the sum of the probabilities across all four terminal branches equals exactly $1$, confirming the mathematical completeness and validity of the tree diagram representation.