Probability Fundamentals

Basic probability theory, sample spaces, events, counting rules, and probability rules.
In engineering, we rarely have perfect information. Probability provides a mathematical framework for quantifying uncertainty and making rational decisions when outcomes are unpredictable (e.g., predicting the exact lifespan of a bridge component).

Core Concepts and Set Theory

The foundational terminology and set theory operations used in probability.

Experiment

Any process or action that generates an observation or outcome (e.g., testing the compressive strength of a concrete cylinder).

Sample Space (SS)

The set of all possible, mutually exclusive outcomes of an experiment. For example, when inspecting a welded joint, S={Acceptable,Defective}S = \{\text{Acceptable}, \text{Defective}\}.

Event (EE)

A subset of the sample space; a collection of specific outcomes. An event occurs if the outcome of the experiment is an element of that subset.

Venn Diagrams

A graphical representation of sets and their relationships. The sample space SS is typically represented by a rectangle, and events (subsets of SS) are represented by circles drawn inside the rectangle. They are extremely useful for visualizing intersections, unions, and mutually exclusive events.

Set Operations (Unions, Intersections, Complements)

Operations used to combine and relate different events.
  • Union (ABA \cup B): The event that either AA occurs, or BB occurs, or both occur. Contains all outcomes in AA or BB.
  • Intersection (ABA \cap B): The event that both AA and BB occur simultaneously. Contains all outcomes common to both AA and BB.
  • Complement (AA' or AcA^c): The event that AA does not occur. Contains all outcomes in SS that are not in AA.
  • Mutually Exclusive (Disjoint) Events: Two events that cannot occur simultaneously (AB=A \cap B = \emptyset).

Counting Rules

Techniques for determining the size of the sample space without listing every outcome.
When the sample space is large, counting outcomes manually is impractical. We use counting rules to systematically determine the total number of possible outcomes.

The Multiplication Rule (Fundamental Counting Principle)

If an operation can be performed in n1n_1 ways, and a second operation can be performed in n2n_2 ways, then the two operations can be performed together in n1×n2n_1 \times n_2 ways.

Example: If a building design offers 3 foundation types and 4 framing materials, there are 3×4=123 \times 4 = 12 distinct structural combinations.

Permutations (Order Matters)

An arrangement of objects in a specific order. The number of permutations of nn distinct objects taken rr at a time is:
P(n,r)=n!(nr)! P(n, r) = \frac{n!}{(n - r)!}

Combinations (Order Does Not Matter)

A selection of objects without regard to order. The number of combinations of nn distinct objects taken rr at a time is:
C(n,r)=(nr)=n!r!(nr)! C(n, r) = \binom{n}{r} = \frac{n!}{r!(n - r)!}

Axioms and Rules of Probability

The fundamental mathematical laws that govern probability calculations.

Probability of an Event, P(A)P(A)

A numerical measure of the likelihood that an event will occur, ranging from 0 (impossible) to 1 (certain). If all outcomes in the sample space SS are equally likely:
P(A)=Number of outcomes in ATotal number of outcomes in S P(A) = \frac{\text{Number of outcomes in } A}{\text{Total number of outcomes in } S}

Kolmogorov's Axioms of Probability

The rigorous foundation of probability theory:
  • Axiom 1: For any event AA, P(A)0P(A) \ge 0.
  • Axiom 2: The probability of the entire sample space is 1 (P(S)=1P(S) = 1).
  • Axiom 3: If A1,A2,A3,A_1, A_2, A_3, \dots are mutually exclusive events, then P(A1A2A3)=P(A1)+P(A2)+P(A3)+P(A_1 \cup A_2 \cup A_3 \dots) = P(A_1) + P(A_2) + P(A_3) + \dots

The Addition Rule

Used to calculate the probability of the union of two events.

General Addition Rule

For any two events AA and BB:
P(AB)=P(A)+P(B)P(AB) P(A \cup B) = P(A) + P(B) - P(A \cap B)
We subtract the intersection P(AB)P(A \cap B) so that outcomes common to both AA and BB are not counted twice.

Special Addition Rule (Mutually Exclusive Events)

If AA and BB are mutually exclusive (they cannot both happen, so P(AB)=0P(A \cap B) = 0):
P(AB)=P(A)+P(B) P(A \cup B) = P(A) + P(B)

The Complement Rule

Complement Rule

The probability that an event does not happen is 1 minus the probability that it does happen.
P(A)=1P(A) P(A') = 1 - P(A)
Key Takeaways
  • Sample Space (SS): All possible outcomes of an experiment.
  • Events: Subsets of the sample space, combined using unions, intersections, and complements.
  • Counting Rules: Use Permutations when order matters, and Combinations when order is irrelevant.
  • Probability Bounds: Probability must always fall between 00 and 11.
  • Addition Rule: Used for "A OR B" scenarios (ABA \cup B); subtract the intersection to avoid double-counting unless events are mutually exclusive.