Probability: Sample Spaces

In statistics, any process of observation is referred to as an experiment. In this case, the experiment is the process of the kids observing the colors of cars as they pass by.
The set of all possible outcomes of an experiment is called the sample space and it is usually denoted by S. Each outcome in a sample space is called an element of the sample space.
An event is a subset of the sample space or which the event occurs.
Two events are said to be mutually exclusive if they have no elements in common.

Similar to set theory, we can form new events by performing operations like unions, intersections and compliments on other events. If A and B are any two subsets of a sample space S, then

A probability is a function that assigns real numbers to events of a sample space. The following are the axioms of probability that apply when the sample space is discrete (finite or countable).

  1. Axiom 1: The probability of an event is a nonnegative real number; that is P(A) ≥ 0 for any subset A of S.
  2. Axiom 2: The probability of the entire sample space is 1; that is P(S) = 1.
  3. Axiom 3: If A1, A2, A3, ... , is a finite or infinite sequence of mutually exclusive events of S, then
    P(A1 ∪ A2 ∪ A3 ∪ ...) = P(A1) + P(A2) + P(A3) + ...

If A and B are any two events in a sample space S and P(A) ≠ 0, the conditional probability of B given A is [br]

P(B | A) =
P(A ∩ B)

P(A)

Two events A and B are independent if and only if P(A ∩ B) = P(A) ∙ P(B).

A group of friends enjoy sitting on the porch and watching the cars that come by as they do their homework. While each student is looking at their work, they will look up from time to time to notice the cars passing by and will make a note of the color of that car. Once they've finished working, they all compare the colors to see how diverse their set is.


Recent Updates

  • 08-10-2017 Floyd-Warshall Shortest Paths
  • 08-01-2017 Degree Centrality of a Graph
  • 06-03-2017 Tarjan's Strongly Connected Components Algorithm
  • 03-20-2017 Longest Common Subsequence
  • 10-27-2016 Independent Set Puzzles
  • 06-28-2016 Lets Learn About XOR Encryption
  • 06-15-2016 Discrete-time Markov Chains
  • 03-01-2016 Topological Sort
  • 01-21-2016 The RSA Algorithm
  • 11-20-2015 How To Take Notes in Math Class
  • 10-28-2015 The Depth-First-Search Algorithm
  • 10-28-2015 The Breadth-First-Search Algorithm
  • 09-23-2015 ID3 Algorithm Decision Trees
  • 07-08-2015 Clique Problem Puzzles
  • 06-25-2015 Unidirectional TSP Puzzles
  • 04-04-2015 Learn About Descriptive Statistics
  • 02-19-2015 Slope Formula
  • 01-15-2015 Interactive Midpoint Formula
  • 12-18-2014 Triangle Sum Puzzle
  • 12-02-2014 The Bridge Crossing Problem