Skip to main content
Statistics LibreTexts

1.4: Problems on Probability Systems

  • Page ID
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \( \newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\)

    ( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\id}{\mathrm{id}}\)

    \( \newcommand{\Span}{\mathrm{span}}\)

    \( \newcommand{\kernel}{\mathrm{null}\,}\)

    \( \newcommand{\range}{\mathrm{range}\,}\)

    \( \newcommand{\RealPart}{\mathrm{Re}}\)

    \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\)

    \( \newcommand{\Argument}{\mathrm{Arg}}\)

    \( \newcommand{\norm}[1]{\| #1 \|}\)

    \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\)

    \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    \( \newcommand{\vectorA}[1]{\vec{#1}}      % arrow\)

    \( \newcommand{\vectorAt}[1]{\vec{\text{#1}}}      % arrow\)

    \( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vectorC}[1]{\textbf{#1}} \)

    \( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

    \( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

    \( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)

    Exercise \(\PageIndex{1}\)

    Let \(\Omega\) consist of the set of positive integers. Consider the subsets

    \(A = \{\omega: \omega \le 12\}\) \(B = \{\omega: \omega < 8\}\) \(C = \{\omega: \omega \text{ is even}\}\)

    \(D = \{\omega: \omega \text{ is a multiple of } 3\}\) \(E = \{\omega: \omega \text{ is a multiple of } 4\}\)

    Describe in terms of \(A, B, C, D, E\) and their complements the following sets:

    a. {1, 3, 5, 7}
    b. {3, 6, 9}
    c. {8, 10}
    d. The even integers greater than 12
    e. The positive integers which are multiples of six.
    f. The integers which are even and no greater than 6 or which are odd and greater than 12.


    \(a = BC^c\)
    \(b= DAE^c\)
    \(c = CAB^cD^c\)
    \(d = CA^c\)
    \(e = CD\)
    \(f = BC \bigvee A^cC^c\)

    Exercise \(\PageIndex{2}\)

    Let \(\Omega\) be the set of integers 0 through 10. Let \(A = \{5, 6, 7, 8\}\), \(B = \) the odd integers in \(\Omega\), and \(C =\) the integers in \(\Omega\) which are even or less than three. Describe the following sets by listing their elements.

    a. \(AB\)
    b. \(AC\)
    c. \(AB^c \cup C\)
    d. \(ABC^c\)
    e. \(A \cup B^c\)
    f. \(A \cup BC^c\)
    g. \(ABC\)
    h. \(A^c BC^c\)


    a. \(AB = {5, 7}\)
    b. \(AC = {6, 8}\)
    c. \(AB^c \cup C = C\)
    d. \(ABC^c = AB\)
    e. \(A \cup B^c = {0, 2, 4, 5, 6, 7, 8, 10}\)
    f. \(ABC = \emptyset\)
    g. \(A^c BC^c = {3, 9}\)

    Exercise \(\PageIndex{3}\)

    Consider fifteen-word messages in English. Let \(A =\) the set of such messages which contain the word “bank” and let \(B =\) the set of messages which contain the word “bank” and the word “credit.” Which event has the greater probability? Why?


    \(B \subset A\) implies \(P(B) \le P(A)\).

    Exercise \(\PageIndex{4}\)

    A group of five persons consists of two men and three women. They are selected one-by-one in a random manner. Let \(E_i\) be the event a man is selected on the \(i\)th selection. Write an expression for the event that both men have been selected by the third selection.


    \(A = E_1 E_2 \bigvee E_1 E_2^c E_3 \bigvee E_1^c E_2 E_3\)

    Exercise \(\PageIndex{5}\)

    Two persons play a game consecutively until one of them is successful or there are ten unsuccessful plays. Let \(E_i\) be the event of a success on the \(i\)th play of the game. Let \(A, B, C\) be the respective events that player one, player two, or neither wins. Write an expression for each of these events in terms of the events \(E_i\), \(1 \le i \le 10\).


    \(A = E_1 \bigvee E_1^c E_2^c E_3 \bigvee E_1^c E_2^c E_3^c E_4^c E_5 \bigvee E_1^c E_2^c E_3^c E_4^c E_5^c E_6^c E_7 \bigvee E_1^c E_2^c E_3^c E_4^c E_5^c E_6^c E_7^c E_8^c E_9\)

    \(B = E_1^c E_2 \bigvee E_1^c E_2^c E_3^c E_4 \bigvee E_1^c E_2^c E_3^c E_4^c E_5^c E_6 \bigvee E_1^c E_2^c E_3^c E_4^c E_5^c E_6^c E_7^c E_8 \bigvee E_1^c E_2^c E_3^c E_4^c E_5^c E_6^c E_7^c E_8^c E_9^c E_{10}\)

    \(C = \bigcap_{i = 1}^{10} E_i^c\)

    Exercise \(\PageIndex{6}\)

    Suppose the game in Exercise 1.4.5 could, in principle, be played an unlimited number of times. Write an expression for the event \(D\) that the game will be terminated with a success in a finite number of times. Write an expression for the event \(F\) that the game will never terminate.


    Let \(F_0 = \Omega\) and \(F_k = \bigcap_{i = 1}^{k} E_i^c\) for \(k \ge 1\). Then

    \(D = \bigvee_{n = 1}^{\infty} F_{n - 1} E_n\) and \(F = D^c = \bigcap_{i = 1}^{\infty} E_i^c\)

    Exercise \(\PageIndex{7}\)

    Find the (classical) probability that among three random digits, with each digit (0 through 9) being equally likely and each triple equally likely:

    a. All three are alike.
    b. No two are alike.
    c. The first digit is 0.
    d. Exactly two are alike.


    Each triple has probability \(1/10^3 = 1/1000\)

    a. Ten triples, all alike: \(P = 10/1000\).
    b. \(10 \times 9 \times 8\) triples all different: \(P = 720/1000\).
    c. 100 triples with first one zero: \(P = 100/1000\)
    d. \(C(3, 2) = 3\) ways to pick two positions alike; 10 ways to pick the common value; 9 ways to pick the other. \(P = 270/1000\).

    Exercise \(\PageIndex{8}\)

    The classical probability model is based on the assumption of equally likely outcomes. Some care must be shown in analysis to be certain that this assumption is good. A well known example is the following. Two coins are tossed. One of three outcomes is observed: Let \(\omega_1\) be the outcome both are “heads,” \(\omega_2\) the outcome that both are “tails,” and \(\omega_3\) be the outcome that they are different. Is it reasonable to suppose these three outcomes are equally likely? What probabilities would you assign?


    \(P(\{\omega_1\}) = P(\{\omega_2\}) = 1/4\), \(P(\{\omega_3\}) = 1/2\)

    Exercise \(\PageIndex{9}\)

    A committee of five is chosen from a group of 20 people. What is the probability that a specified member of the group will be on the committee?


    \(C(20, 5)\) committees; \(C(19, 4)\) have a designated member.

    \(P = \dfrac{19!}{4! 15!} \cdot \dfrac{5! 15!}{20!} = 5/20 = 1/4\)

    Exercise \(\PageIndex{10}\)

    Ten employees of a company drive their cars to the city each day and park randomly in ten spots. What is the (classical) probability that on a given day Jim will be in place three? There are \(n!\) equally likely ways to arrange \(n\) items (order important).


    10! permutations,\(1 \times 9!\) permutations with Jim in place 3. \(P = 9!/10! = 1/10\).

    Exercise \(\PageIndex{11}\)

    An extension of the classical model involves the use of areas. A certain region \(L\) (say of land) is taken as a reference. For any subregion \(A\), define \(P(A) = area(A)/area(L)\). Show that \(P(\cdot)\) is a probability measure on the subregions of \(L\).


    Additivity follows from additivity of areas of disjoint regions.

    Exercise \(\PageIndex{12}\)

    John thinks the probability the Houston Texans will win next Sunday is 0.3 and the probability the Dallas Cowboys will win is 0.7 (they are not playing each other). He thinks the probability both will win is somewhere between—say, 0.5. Is that a reasonable assumption? Justify your answer.


    \(P(AB) = 0.5\) is not reasonable. It must no greater than the minimum of \(P(A) = 0.3\) and \(P(B) = 0.7\).

    Exercise \(\PageIndex{13}\)

    Suppose \(P(A) = 0.5\) and \(P(B) = 0.3\). What is the largest possible value of \(P(AB)\)? Using the maximum value of \(P(AB)\), dertermine \(P(AB^c)\), \(P(A^c B)\), \(P(A^c B^c)\) and \(P(A \cup B)\). Are these values determined uniquely?


    Draw a Venn diagram, or use algebraic expressions \(P(AB^c) = P(A) - P(AB) = 0.2\)

    \(P(A^c B) = P(B) - P(AB) = 0\) \(P(A^c B^c) = P(A^c) - P(A^c B) = 0.5\) \(P(A \cup B) = 0.5\)

    Exercise \(\PageIndex{14}\)

    For each of the following probability “assignments”, fill out the table. Which assignments are not permissible? Explain why, in each case.

    \(P(A)\) \(P(B)\) \(P(AB)\) \(P(A \cup B)\) \(P(AB^c)\) \(P(A^c B)\) \(P(A) + P(B)\)
    0.3 0.7 0.4
    0.2 0.1 0.4
    0.3 0.7 0.2
    0.3 0.5 0
    0.3 0.8 0
    \(P(A)\) \(P(B)\) \(P(AB)\) \(P(A \cup B)\) \(P(AB^c)\) \(P(A^c B)\) \(P(A) + P(B)\)
    0.3 0.7 0.4 0.6 -0.1 0.3 1.0
    0.2 0.1 0.4 -0.1 -0.2 -0.3 0.3
    0.3 0.7 0.2 0.8 0.1 0.5 1.0
    0.3 0.5 0 0.8 0.3 0.5 0.8
    0.3 0.8 0 1.1 0.3 0.8 1.1

    Only the third and fourth assignments are permissible.

    Exercise \(\PageIndex{15}\)

    The class \(\{A, B, C\}\) of events is a partition. Event \(A\) is twice as likely as \(C\) and event \(B\) is as likely as the combination \(A\) or \(C\). Determine the probabilities \(P(A)\), \(P(B)\), \(P(C)\).


    \(P(A) + P(B) + P(C) = 1\), \(P(A) = 2P(C)\), and \(P(B) = P(A) + P(C) = 3P(C)\), which implies

    \(P(C) = 1/6\), \(P(A) = 1/3\), \(P(B) = 1/2\)

    Exercise \(\PageIndex{16}\)

    Determione the probability \(P(A \cup B \cup C)\) in terms of the probabilities of the events \(A, B, C\) and their intersections.


    \(P(A \cup B \cup C) = P(A \cup B) + P(C) - P(AC \cup BC)\)
    \(= P(A) + P(B) - P(AB) + P(C) - P(AC) - P(BC) + P(ABC)\)

    Exercise \(\PageIndex{17}\)

    If occurrence of event \(A\) implies occurrence of \(B\), show that \(P(A^c B) = P(B) - P(A)\).


    \(P(AB) = P(A)\) and \(P(AB) + P(A^c B) = P(B)\) implies \(P(A^c B) = P(B) - P(A)\).

    Exercise \(\PageIndex{18}\)

    Show that \(P(AB) \ge P(A) + P(B) - 1\).


    Follows from \(P(A) + P(B) - P(AB) = P(A \cup B) \le 1\).

    Exercise \(\PageIndex{19}\)

    The set combination \(A \oplus B = AB^c \bigvee A^c B\) is known as the disjunctive union or the symetric difference of \(A\) and \(B\). This is the event that only one of the events \(A\) or \(B\) occurs on a trial. Determine \(P(A \oplus B)\) in terms of \(P(A)\), \(P(B)\), and \(P(AB)\)


    A Venn diagram shows \(P(A \oplus B) = P(AB^c) + P(AB^c) = P(A) + P(B) - 2P(AB)\).

    Exercise \(\PageIndex{20}\)

    Use fundamental properties of probability to show

    a. \(P(AB) \le P(A) \le P(A \cup B) \le P(A) + P(B)\)

    b. \(P(\bigcap_{j = 1}^{\infty} E_j) \le P(E_i) \le P(\bigcup_{j = 1}^{\infty} E_j) \le \sum_{j = 1}^{\infty} P(E_j)\)


    \(AB \subset A \subset A \cup B\) implies \(P(AB) \le P(A) \le P(A \cup B) = P(A) + P(B) - P(AB) \le P(A) + P(B)\). The general case follows similarly, with the last inequality determined by subadditivity.

    Exercise \(\PageIndex{21}\)

    Suppose \(P_1, P_2\) are probability measures and \(c_1, c_2\) are positive numbers such that \(c_1 + c_2 = 1\). Show that the assignment \(P(E) = c_1 P_1(E) + c_2P_2(E)\) to the class of events is a probability measure. Such a combination of probability measures is known as a mixture. Extend this to

    \(P(E) = \sum_{i = 1}^{n} c_i P_i (E)\), where the \(P_i\) are probabilities measures, \(c_i > 0\), and \(\sum_{i = 1}^{n} c_i = 1\)


    Clearly \(P(E) \ge 0\). \(P(\Omega) = c_1 P_1 (\Omega) + c_2 P_2 (\Omega) = 1\).

    \(E = \bigvee_{i = 1}^{\infty} E_i\) implies \(P(E) = c_1 \sum_{i = 1}^{\infty} P_1 (E_i) + c_2 \sum_{i = 1}^{\infty} P_2 (E_i) = \sum_{i =1}^{\infty} P(E_i)\)

    The pattern is the same for the general case, except that the sum of two terms is replaced by the sum of \(n\) terms \(c_i P_i (E)\).

    Exercise \(\PageIndex{22}\)

    Suppose \(\{A_1, A_2, \cdot\cdot\cdot, A_n\}\) is a partition and \(\{c_1, c_2, \cdot\cdot\cdot, c_n\}\) is a class of positive constants. For each event \(E\), let

    \(Q(E) = \sum_{i = 1}^{n} c_i P(EA_i) / \sum_{i = 1}^{n} c_i P(A_i)\)

    Show that \(Q(\cdot)\) us a probability measure.


    Clearly \(Q(E) \ge 0\) and since \(A_i \Omega = A_i\) we have \(Q(\Omega) = 1\). If

    \(E = \bigvee_{k = 1}^{\infty} E_k\), then \(P(EA_i) = \sum_{k = 1}^{\infty} P(E_k A_i)\) \(\forall i\)

    Interchanging the order of summation shows that \(Q\) is countably additive.

    This page titled 1.4: Problems on Probability Systems is shared under a CC BY 3.0 license and was authored, remixed, and/or curated by Paul Pfeiffer via source content that was edited to the style and standards of the LibreTexts platform.