Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Question: Suppose that \({E_1}\;,\;{E_2}\;, \ldots ,\;{E_n}\) are \(n\) events with \(p\left( {{E_i}} \right) > 0\) for \(i = 1\;,\;2\;, \ldots ,\;n\). Show that

\(P\left( {{E_1} \cap {E_2} \cap \cdots \cap {E_n}} \right) = P\left( {{E_1}} \right)P\left( {{E_2}\mid {E_1}} \right)P\left( {{E_3}\mid {E_1} \cap {E_2}} \right) \cdots P\left( {{E_n}\mid {E_1} \cap {E_2} \cap \cdots \cap {E_{n - 1}}} \right)\)

Short Answer

Expert verified

Answer

The equation \(P\left( {{E_1} \cap {E_2} \cap \ldots .. \cap {E_n}} \right) = P\left( {{E_1}} \right)P\left( {{E_2}\mid {E_1}} \right)P\left( {{E_3}\mid {E_1} \cap {E_2}} \right) \ldots ..P\left( {{E_n}\mid {E_1} \cap {E_2} \cap \ldots ..{E_{n - 1}}} \right)\) has been proved.

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

Over 22 million students worldwide already upgrade their learning with Vaia!

01

Given data 

The \(n\) events with the probability \(P\left( {{E_i}} \right) > 0\) for \(i = 1\;,\;2\;, \ldots \) are \({E_1}\;,\;{E_2}\;,\;{E_3}\;, \ldots \ldots \ldots {E_n}\).

02

Concept of Conditional probability

The probability of occurrence of any event \({\bf{A}}\) when another event \(B\) in relation to \({\bf{A}}\) has already occurred is known as conditional probability. It is depicted by \({\rm{P}}({\rm{A}}\mid {\rm{B}})\).

03

Calculation for the probability of three events

Consider two events \({E_1},{E_2}\).

With the use of conditional probability, we have \(P\left( {{E_1} \cap {E_2}} \right) = P\left( {{E_1}} \right)P\left( {{E_2}\mid {E_1}} \right)\).

Consider three events \({E_1}\;,\;{E_2}\;,\;{E_3}\) with the use of associative property:

\(P\left( {{E_1} \cap {E_2} \cap {E_3}} \right) = P\left\{ {{E_1} \cap \left( {{E_2} \cap {E_3}} \right)} \right\}\)

If \({E_2} \cap {E_3} = {E_t}\), then it implies,

\(\begin{aligned}{}P\left( {{E_1} \cap {E_2} \cap {E_3}} \right) &= P\left\{ {{E_1} \cap {E_t}} \right\}\\P\left( {{E_1} \cap {E_2} \cap {E_3}} \right) &= P\left( {{E_1}} \right)P\left( {{E_t}\mid {E_1}} \right)\end{aligned}\)

\(P\left( {{E_1} \cap {E_2} \cap {E_3}} \right) = P\left( {{E_1}} \right)P\left( {\left( {{E_2} \cap {E_3}} \right)\mid {E_1}} \right)\) …… (1)

\(P\left( {{E_1} \cap {E_2} \cap {E_3}} \right) = P\left( {{E_2} \cap {E_3}} \right)P\left( {{E_1}/{E_2} \cap {E_3}} \right)\) …… (2)

From equation (1) and (2):

\(P\left( {{E_1} \cap {E_2} \cap {E_3}} \right) = P\left( {{E_3}} \right) \cdot P\left( {{E_2}/{E_3}} \right) \cdot P\left( {{E_1}/{E_1} \cap {E_2}} \right)\)

From equations (1) and (2):

\(P\left( {{E_1} \cap {E_2} \cap {E_3}} \right) = P\left( {{E_1}} \right) \cdot P\left( {{E_2}/{E_1}} \right) \cdot P\left( {\left( {{E_3}} \right)\mid {E_1} \cap {E_2}} \right)\)

04

Calculation for the probability of four events

Consider the four events \({E_1}\;,\;{E_2}\;,\;{E_3}\;,\;{E_4}\).

\(P\left( {{E_1} \cap {E_2} \cap {E_3} \cap {E_4}} \right) = P\left( {{E_1}} \right) \cdot P\left( {{E_2}/{E_1}} \right) \cdot P\left( {\left( {{E_3}} \right)\mid {E_1} \cap {E_2}} \right) \cdot P\left( {\left( {{E_4}/{E_1} \cap {E_2} \cap {E_3}} \right)} \right.\)

Similarly, for \(n\) number of events:

\(P\left( {{E_1} \cap {E_2} \cap \ldots .. \cap {E_n}} \right) = P\left( {{E_1}} \right)P\left( {{E_2}\mid {E_1}} \right)P\left( {{E_3}\mid {E_1} \cap {E_2}} \right) \ldots ..P\left( {{E_n}\mid {E_1} \cap {E_2} \cap \ldots ..{E_{n - 1}}} \right)\)

Hence, proved.

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Question: Devise a Monte Carlo algorithm that determines whether a permutation of the integers 1 through n has already been sorted (that is, it is in increasing order), or instead, is a random permutation. A step of the algorithm should answer “true” if it determines the list is not sorted and “unknown” otherwise. After k steps, the algorithm decides that the integers are sorted if the answer is “unknown” in each step. Show that as the number of steps increases, the probability that the algorithm produces an incorrect answer is extremely small. [Hint: For each step, test whether certain elements are in the correct order. Make sure these tests are independent.]

Question: What is the expected sum of the numbers that appear on two dice, each biased so that a 3 comes up twice as often as each other number?

Question: Suppose that \(E, {F_1},{F_2}\,and {F_3}\)are events from a sample space S and that \({F_1},{F_2}\,and {F_3}\) are pair wise disjoint and their union is S. Find \(p\left( {\frac{{{F_1}}}{E}} \right)\)if \(p\left( {\frac{E}{{{F_1}}}} \right) = \frac{1}{8},p\left( {\frac{E}{{{F_2}}}} \right) = \frac{1}{4},p\left( {\frac{E}{{{F_3}}}} \right) = \frac{1}{6},p\left( {{F_1}} \right) = \frac{1}{4},p\left( {{F_2}} \right) = \frac{1}{4}\) and \(p\left( {{F_3}} \right) = \frac{1}{2}\)

Question: What is the probability that a card selected at random from a standard deck of 52 cards is an ace or a heart?

Question: Let E and F be the events that a family ofnchildren has children of both sexes and has at most one boy, respectively. Are E and F Independent if

role="math" localid="1668598698436" a)n=2b)n=4?c)=5?

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free