Question

In: Statistics and Probability

1. Let A1, A2,..., An be mutually disjoint events. Show that a) IP(A1UA2U...UAn) = IP(A1) +...

1. Let A1, A2,..., An be mutually disjoint events. Show that

a) IP(A1UA2U...UAn) = IP(A1) + IP(A2) + ... + IP(An)

b) There exists at least one i with IP(Ai) less than equals to 1/n

2. Define conditional probability IP(E|F). Derive the Law of total probability and use it to derive Bayes's Formula

Solutions

Expert Solution

We would be looking at each part of the first question here.

Q1) a) The union probability here is computed as:
P(A1 A2 A3 ...... An )  

= Probability that any of the events out of A1, A2, A3, ..... An can happen

As all of these are mutually disjoint events, which is that they cannot happen together. Therefore the probability of having any of the event out of the n events is equal to the sum of probabilities of each of the n events here.

Using additivity law of probability, the intersection probability terms would cancel out as they all are mutually disjoint.

Therefore P(A1 A2 A3 ...... An ) = P(A1) + P(A2) + .... + P(An) is the required expression here.

b) As there are n events, and all of them are mutually disjoint

Therefore none of them can happen together which means that the sum of all those probabilities of events happening individually is equal to the probability of any of the event happening ( as shown in the previous part )

Now as we know that each probability can only have a value less than or equal to 1. Therefore,

P(A1 A2 A3 ...... An ) <= 1

P(A1) + P(A2) + .... + P(An) <= 1

Let us assume that each of the above probability is greater than 1/n

That would mean:

P(A1) + P(A2) + .... + P(An) > 1 because n*(1/n) = 1

Therefore the our assumption was incorrect, and we have to conclude here that there exist some P(Ai ) which is less than or equal to 1/n


Related Solutions

Starting with the expression for Pr[A1 + A2], show that for three events Pr[A1 + A2...
Starting with the expression for Pr[A1 + A2], show that for three events Pr[A1 + A2 + A3] = Pr[A1] + Pr[A2] + Pr[A3] − Pr[A1A2] − Pr[A1A3] − Pr[A2A3] + Pr[A1A2A3]
Let A1, A2 and A3 be events except with respective probabilities 1/6 , 1/5, and 1/4.Let...
Let A1, A2 and A3 be events except with respective probabilities 1/6 , 1/5, and 1/4.Let N be the number of these events that occur. a) Write down a formula for N in terms of indicators. b) Find E(N). In each of the following cases, calculate Var(N): c) A1, A2, A3 are disjoint; d) they are independent; e) A1 is in A2 is in A3.
The prior probabilities for events A1 and A2 are P(A1) = 0.50 and P(A2) = 0.45....
The prior probabilities for events A1 and A2 are P(A1) = 0.50 and P(A2) = 0.45. It is also known that P(A1 ∩ A2) = 0. Suppose P(B | A1) = 0.20 and P(B | A2) = 0.05. If needed, round your answers to three decimal digits. (a) Are A1 and A2 mutually exclusive? - Select your answer -YesNoItem 1 Explain your answer. The input in the box below will not be graded, but may be reviewed and considered by...
Let A = {a1, a2, a3, . . . , an} be a nonempty set of...
Let A = {a1, a2, a3, . . . , an} be a nonempty set of n distinct natural numbers. Prove that there exists a nonempty subset of A for which the sum of its elements is divisible by n.
Let a1 ≥ a2, . . . , an be a sequence of positive integers whose...
Let a1 ≥ a2, . . . , an be a sequence of positive integers whose sum is 2n − 2. Prove that there exists a tree T on n vertices whose vertices have degrees a1, a2, . . . , an. Sketch of solution: Prove that there exist i and j such that ai = 1 and aj ≥ 2. Remove ai, subtract 1 from aj and induct on n.
Let f: X→Y be a map with A1, A2⊂X and B1,B2⊂Y (A) Prove f(A1∪A2)=f(A1)∪f(A2). (B) Prove...
Let f: X→Y be a map with A1, A2⊂X and B1,B2⊂Y (A) Prove f(A1∪A2)=f(A1)∪f(A2). (B) Prove f(A1∩A2)⊂f(A1)∩f(A2). Give an example in which equality fails. (C) Prove f−1(B1∪B2)=f−1(B1)∪f−1(B2), where f−1(B)={x∈X: f(x)∈B}. (D) Prove f−1(B1∩B2)=f−1(B1)∩f−1(B2). (E) Prove f−1(Y∖B1)=X∖f−1(B1). (Abstract Algebra)
Question in graph theory: 1. Let (a1,a2,a3,...an) be a sequence of integers. Given that the sum...
Question in graph theory: 1. Let (a1,a2,a3,...an) be a sequence of integers. Given that the sum of all integers = 2(n-1) Write an algorithm that, starting with a sequence (a1,a2,a3,...an) of positive integers, either constructs a tree with this degree sequence or concludes that none is possible.
P(A1) = 0.2, P(A2) = 0.25 A1 and A2 are independent Find P(A1C ∩ A2) Please...
P(A1) = 0.2, P(A2) = 0.25 A1 and A2 are independent Find P(A1C ∩ A2) Please add a venn diagram if possible Thanks in advance!
Alternating Series Test. Let (an) be a sequence satisfying (i) a1 ≥ a2 ≥ a3 ≥...
Alternating Series Test. Let (an) be a sequence satisfying (i) a1 ≥ a2 ≥ a3 ≥ · · · ≥ an ≥ an+1 ≥ · · · and (ii) (an) → 0. Show that then the alternating series X∞ n=1 (−1)n+1an converges using the following two different approaches. (a) Show that the sequence (sn) of partial sums, sn = a1 − a2 + a3 − · · · ± an is a Cauchy sequence Alternating Series Test. Let (an) be...
Prove: If a1 = b1 mod n and a2 = b2 mod n then (1) a1...
Prove: If a1 = b1 mod n and a2 = b2 mod n then (1) a1 + a2 = b1 + b2 mod n, (2) a1 − a2 = b1 − b2 mod n, and (3) a1a2 = b1b2 mod n.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT