# Sample space

In probability theory, the sample space (also called sample description space[1] or possibility space[2]) of an experiment or random trial is the set of all possible outcomes or results of that experiment.[3] A sample space is usually denoted using set notation, and the possible ordered outcomes, or sample points,[4] are listed as elements in the set. It is common to refer to a sample space by the labels S, Ω, or U (for "universal set"). The elements of a sample space may be numbers, words, letters, or symbols. They can also be finite, countably infinite, or uncountably infinite.[5]

A subset of the sample space is an event, denoted by ${\displaystyle E}$. If the outcome of an experiment is included in ${\displaystyle E}$, then event ${\displaystyle E}$ has occurred.[6]

For example, if the experiment is tossing a single coin, the sample space is the set ${\displaystyle \{H,T\}}$, where the outcome ${\displaystyle H}$ means that the coin was heads and the outcome ${\displaystyle T}$ means that the coin was tails.[7] The possible events are ${\displaystyle E=\{H\}}$ and ${\displaystyle E=\{T\}}$.[8] For tossing two coins, the sample space is ${\displaystyle \{HH,HT,TH,TT\}}$, where the outcome is ${\displaystyle HH}$ if both coins are heads, ${\displaystyle HT}$ if the first coin is heads and the second is tails, ${\displaystyle TH}$ if the first coin is tails and the second is heads, and ${\displaystyle TT}$ if both coins are tails.[8]

For tossing a single six-sided die, where the result of interest is the number of pips facing up, the sample space is ${\displaystyle \{1,2,3,4,5,6\}}$.[9]

A well-defined, non-empty sample space ${\displaystyle S}$ is one of three components in a probabilistic model (a probability space). The other two basic elements are: a well-defined set of possible events (an event space), which is typically the power set of ${\displaystyle S}$ if ${\displaystyle S}$ is discrete or a σ-algebra on ${\displaystyle S}$ if it is continuous, and a probability assigned to each event (a probability measure function).[10]

A visual representation of a finite sample space and events. The red oval is the event that a number is odd, and the blue oval is the event that a number is prime.

A sample space can be represented visually by a rectangle, with the outcomes of the sample space denoted by points within the rectangle. The events may be represented by ovals, where the points enclosed within the oval make up the event.[11]

## Conditions of a sample space

A set ${\displaystyle \Omega }$ with outcomes ${\displaystyle s_{1},s_{2},\ldots ,s_{n}}$ (i.e. ${\displaystyle \Omega =\{s_{1},s_{2},\ldots ,s_{n}\}}$) must meet some conditions in order to be a sample space:[12]

• The outcomes must be mutually exclusive, i.e. if ${\displaystyle s_{j}}$ occurs, then no other ${\displaystyle s_{i}}$ will take place, ${\displaystyle \forall i,j=1,2,\ldots ,n\quad i\neq j}$.[5]
• The outcomes must be collectively exhaustive, i.e. on every experiment (or random trial) there will always take place some outcome ${\displaystyle s_{i}\in \Omega }$ for ${\displaystyle i\in \{1,2,\ldots ,n\}}$.[5]
• The sample space (${\displaystyle \Omega }$) must have the right granularity depending on what the experimenter is interested in. Irrelevant information must be removed from the sample space and the right abstraction must be chosen.

For instance, in the trial of tossing a coin, one possible sample space is ${\displaystyle \Omega _{1}=\{H,T\}}$, where ${\displaystyle H}$ is the outcome where the coin lands heads and ${\displaystyle T}$ is for tails. Another possible sample space could be ${\displaystyle \Omega _{2}=\{(H,R),(H,NR),(T,R),(T,NR)\}}$. Here, ${\displaystyle R}$ denotes a rainy day and ${\displaystyle NR}$ is a day where it is not raining. For most experiments, ${\displaystyle \Omega _{1}}$ would be a better choice than ${\displaystyle \Omega _{2}}$, as an experimenter likely do not care about how the weather affects the coin toss.

## Multiple sample spaces

For many experiments, there may be more than one plausible sample space available, depending on what result is of interest to the experimenter. For example, when drawing a card from a standard deck of fifty-two playing cards, one possibility for the sample space could be the various ranks (Ace through King), while another could be the suits (clubs, diamonds, hearts, or spades).[3][13] A more complete description of outcomes, however, could specify both the denomination and the suit, and a sample space describing each individual card can be constructed as the Cartesian product of the two sample spaces noted above (this space would contain fifty-two equally likely outcomes). Still other sample spaces are possible, such as right-side up or upside down, if some cards have been flipped when shuffling.

## Equally likely outcomes

Flipping a coin leads to a sample space composed of two outcomes that are almost equally likely.
Up or down? Flipping a brass tack leads to a sample space composed of two outcomes that are not equally likely.

Some treatments of probability assume that the various outcomes of an experiment are always defined so as to be equally likely.[14] For any sample space with ${\displaystyle N}$ equally likely outcomes, each outcome is assigned the probability ${\displaystyle {\frac {1}{N}}}$.[15] However, there are experiments that are not easily described by a sample space of equally likely outcomes—for example, if one were to toss a thumb tack many times and observe whether it landed with its point upward or downward, there is no physical symmetry to suggest that the two outcomes should be equally likely.[16]

Though most random phenomena do not have equally likely outcomes, it can be helpful to define a sample space in such a way that outcomes are at least approximately equally likely, since this condition significantly simplifies the computation of probabilities for events within the sample space. If each individual outcome occurs with the same probability, then the probability of any event becomes simply:[17]: 346–347

${\displaystyle \mathrm {P} ({\text{event}})={\frac {\text{number of outcomes in event}}{\text{number of outcomes in sample space}}}}$

For example, if two fair six-sided dice are thrown to generate two uniformly distributed integers, ${\displaystyle D_{1}}$ and ${\displaystyle D_{2}}$, each in the range from 1 to 6, inclusive, the 36 possible ordered pairs of outcomes ${\displaystyle (D_{1},D_{2})}$ constitute a sample space of equally likely events. In this case, the above formula applies, such as calculating the probability of a particular sum of the two rolls in an outcome. The probability of the event that the sum ${\displaystyle D_{1}+D_{2}}$ is five is ${\displaystyle {\frac {4}{36}}}$, since four of the thirty-six equally likely pairs of outcomes sum to five.

If the sample space was the all of the possible sums obtained from rolling two six-sided dice, the above formula can still be applied because the dice rolls are fair, but the number of outcomes in a given event will vary. A sum of two can occur with the outcome ${\displaystyle \{(1,1)\}}$, so the probability is ${\displaystyle {\frac {1}{36}}}$. For a sum of seven, the outcomes in the event are ${\displaystyle \{(1,6),(6,1),(2,4),(4,2),(3,4),(4,3)\}}$, so the probability is ${\displaystyle {\frac {6}{36}}}$.[18]

### Simple random sample

In statistics, inferences are made about characteristics of a population by studying a sample of that population's individuals. In order to arrive at a sample that presents an unbiased estimate of the true characteristics of the population, statisticians often seek to study a simple random sample—that is, a sample in which every individual in the population is equally likely to be included.[17]: 274–275  The result of this is that every possible combination of individuals who could be chosen for the sample has an equal chance to be the sample that is selected (that is, the space of simple random samples of a given size from a given population is composed of equally likely outcomes).[19]

## Infinitely large sample spaces

In an elementary approach to probability, any subset of the sample space is usually called an event.[8] However, this gives rise to problems when the sample space is continuous, so that a more precise definition of an event is necessary. Under this definition only measurable subsets of the sample space, constituting a σ-algebra over the sample space itself, are considered events.

An example of an infinitely large sample space is measuring the lifetime of a light bulb. The corresponding sample space would be [0, ∞).[8]

## References

1. ^ Stark, Henry; Woods, John W. (2002). Probability and Random Processes with Applications to Signal Processing (3rd ed.). Pearson. p. 7. ISBN 9788177583564.
2. ^ Forbes, Catherine; Evans, Merran; Hastings, Nicholas; Peacock, Brian (2011). Statistical Distributions (4th ed.). Wiley. p. 3. ISBN 9780470390634.
3. ^ a b Albert, Jim (1998-01-21). "Listing All Possible Outcomes (The Sample Space)". Bowling Green State University. Retrieved 2013-06-25.
4. ^ Soong, T. T. (2004). Fundamentals of probability and statistics for engineers. Chichester: Wiley. ISBN 0-470-86815-5. OCLC 55135988.
5. ^ a b c "UOR_2.1". web.mit.edu. Retrieved 2019-11-21.
6. ^ Ross, Sheldon. A First Course in Probability (8th Edition) (PDF). Pearson Prentice Hall. p. 23. ISBN 978-0136033134.
7. ^ Dekking, F.M. (Frederik Michel), 1946- (2005). A modern introduction to probability and statistics : understanding why and how. Springer. ISBN 1-85233-896-2. OCLC 783259968.{{cite book}}: CS1 maint: multiple names: authors list (link)
8. ^ a b c d "Sample Space, Events and Probability" (PDF). Mathematics at Illinois.
9. ^ Larsen, R. J.; Marx, M. L. (2001). An Introduction to Mathematical Statistics and Its Applications (3rd ed.). Upper Saddle River, NJ: Prentice Hall. p. 22. ISBN 9780139223037.
10. ^ LaValle, Steven M. (2006). Planning Algorithms (PDF). Cambridge University Press. p. 442.
11. ^ "Sample Spaces, Events, and Their Probabilities". saylordotorg.github.io. Retrieved 2019-11-21.
12. ^ Tsitsiklis, John (Spring 2018). "Sample Spaces". Massachusetts Institute of Technology. Retrieved July 9, 2018.
13. ^ Jones, James (1996). "Stats: Introduction to Probability - Sample Spaces". Richland Community College. Retrieved 2013-11-30.
14. ^ Foerster, Paul A. (2006). Algebra and Trigonometry: Functions and Applications, Teacher's Edition (Classics ed.). Prentice Hall. p. 633. ISBN 0-13-165711-9.
15. ^ "Equally Likely outcomes" (PDF). University of Notre Dame.
16. ^ "Chapter 3: Probability" (PDF). Coconino Community College.
17. ^ a b Yates, Daniel S.; Moore, David S.; Starnes, Daren S. (2003). The Practice of Statistics (2nd ed.). New York: Freeman. ISBN 978-0-7167-4773-4. Archived from the original on 2005-02-09.
18. ^ "Probability: Rolling Two Dice". www.math.hawaii.edu. Retrieved 2021-12-17.
19. ^ "Simple Random Samples". web.ma.utexas.edu. Retrieved 2019-11-21.