Principle of inclusion-exclusion proof

In summary, the conversation demonstrates that if events A,B, and C are disjoint, then P(A\cupB\cupC) = P(A)+P(B)+P(C)-P(A\capB)-P(A\capC)-P(B\capC)+P(A\capB\capC).
  • #1
mottov2
13
0
There are 3 events A,B and C prove that

P(A[itex]\cup[/itex]B[itex]\cup[/itex]C) = P(A)+P(B)+P(C)-P(A[itex]\cap[/itex]B)-P(A[itex]\cap[/itex]C)-P(B[itex]\cap[/itex]C)+P(A[itex]\cap[/itex]B[itex]\cap[/itex]C)
each event is disjoint so by the additivity rule...

My attempt:
A[itex]\cup[/itex]B[itex]\cup[/itex]C = (A[itex]\cap[/itex]B[itex]\cap[/itex]C)[itex]\cup[/itex](A[itex]\cap[/itex][A[itex]\cap[/itex]B[itex]\cap[/itex]C]c)[itex]\cup[/itex]([B[itex]\cap[/itex]C][itex]\cap[/itex][A[itex]\cap[/itex]B[itex]\cap[/itex]C]c)[itex]\cup[/itex](C[itex]\cap[/itex]Ac[itex]\cap[/itex]([B[itex]\cap[/itex]C][itex]\cap[/itex][A[itex]\cap[/itex]B[itex]\cap[/itex]C]c)c)[itex]\cup[/itex](B[itex]\cap[/itex]Ac[itex]\cap[/itex]([B[itex]\cap[/itex]C][itex]\cap[/itex][A[itex]\cap[/itex]B[itex]\cap[/itex]C]c)c)

each event is disjoint so by the additivity rule...
P(A[itex]\cup[/itex]B[itex]\cup[/itex]C) = P(A[itex]\cap[/itex]B[itex]\cap[/itex]C)+P(A[itex]\cap[/itex][A[itex]\cap[/itex]B[itex]\cap[/itex]C]c)+P([B[itex]\cap[/itex]C][itex]\cap[/itex][A[itex]\cap[/itex]B[itex]\cap[/itex]C]c)+P(C[itex]\cap[/itex]Ac[itex]\cap[/itex]([B[itex]\cap[/itex]C][itex]\cap[/itex][A[itex]\cap[/itex]B[itex]\cap[/itex]C]c)c)+P(B[itex]\cap[/itex]Ac[itex]\cap[/itex]([B[itex]\cap[/itex]C][itex]\cap[/itex][A[itex]\cap[/itex]B[itex]\cap[/itex]C]c)c)

P(A[itex]\cap[/itex](A[itex]\cap[/itex]B[itex]\cap[/itex]C)c) = P(A)-P(A[itex]\cap[/itex]B[itex]\cap[/itex]C)
P((B[itex]\cap[/itex]C)[itex]\cap[/itex](A[itex]\cap[/itex]B[itex]\cap[/itex]C)c) = P(B[itex]\cap[/itex]C)-P(A[itex]\cap[/itex]B[itex]\cap[/itex]C)
P(C[itex]\cap[/itex]Ac[itex]\cap[/itex]([B[itex]\cap[/itex]C][itex]\cap[/itex][A[itex]\cap[/itex]B[itex]\cap[/itex]C]c)c) = P(C[itex]\cap[/itex](A[itex]\cap[/itex]C)c[itex]\cap[/itex]([B[itex]\cap[/itex]C][itex]\cap[/itex][A[itex]\cap[/itex]B[itex]\cap[/itex]C]c)c) = P(C)-P(A[itex]\cap[/itex]C)-P((B[itex]\cap[/itex]C)[itex]\cap[/itex](A[itex]\cap[/itex]B[itex]\cap[/itex]C)c) = P(C)-P(A[itex]\cap[/itex]C)-P(B[itex]\cap[/itex]C)+P(A[itex]\cap[/itex]B[itex]\cap[/itex]C)
P(B[itex]\cap[/itex]Ac[itex]\cap[/itex]([B[itex]\cap[/itex]C][itex]\cap[/itex][A[itex]\cap[/itex]B[itex]\cap[/itex]C]c)c) = P(B[itex]\cap[/itex](A[itex]\cap[/itex]B)c[itex]\cap[/itex]([B[itex]\cap[/itex]C][itex]\cap[/itex][A[itex]\cap[/itex]B[itex]\cap[/itex]C]c)c) = P(B)-P(A[itex]\cap[/itex]B)-P((B[itex]\cap[/itex]C)[itex]\cap[/itex](A[itex]\cap[/itex]B[itex]\cap[/itex]C)c) = P(B)-P(A[itex]\cap[/itex]B)-P(B[itex]\cap[/itex]C)+P(A[itex]\cap[/itex]B[itex]\cap[/itex]C)

then by substitution...

P(A[itex]\cup[/itex]B[itex]\cup[/itex]C) = P(A[itex]\cap[/itex]B[itex]\cap[/itex]C)+P(A)-P(A[itex]\cap[/itex]B[itex]\cap[/itex]C)+P(B[itex]\cap[/itex]C)-P(A[itex]\cap[/itex]B[itex]\cap[/itex]C)+P(C)-P(A[itex]\cap[/itex]C)-P(B[itex]\cap[/itex]C)+P(A[itex]\cap[/itex]B[itex]\cap[/itex]C)+P(B)-P(A[itex]\cap[/itex]B)-P(B[itex]\cap[/itex]C)+P(A[itex]\cap[/itex]B[itex]\cap[/itex]C)
= P(A)+P(B)+P(C)-P(A[itex]\cap[/itex]C)-P(A[itex]\cap[/itex]B)-P(B[itex]\cap[/itex]C)+P(A[itex]\cap[/itex]B[itex]\cap[/itex]C)

did i do this right? I feel like i may have overcomplicated it..
 
Last edited:
Physics news on Phys.org
  • #2
You haven't explained what laws of probability can be assumed in order to prove the result and you didn't say which laws you used. Putting a 'P' in front of each set in an expression is not "substitution".
 
  • #3
Proof By Induction is a lot more elegant,but you have to be careful of your notation
 

Related to Principle of inclusion-exclusion proof

What is the Principle of Inclusion-Exclusion?

The Principle of Inclusion-Exclusion is a mathematical proof technique used to calculate the size of a set that is a union of multiple sets. It takes into account the overlapping elements between the sets to arrive at an accurate count.

How does the Principle of Inclusion-Exclusion work?

The proof works by subtracting the sum of the individual set sizes from the sum of the sizes of all possible intersections between the sets. This correction factor accounts for the double-counting of elements that appear in more than one set.

What is the formula for the Principle of Inclusion-Exclusion?

The formula is given as: |A ∪ B ∪ C| = |A| + |B| + |C| - |A ∩ B| - |A ∩ C| - |B ∩ C| + |A ∩ B ∩ C|, where A, B, and C are sets.

How is the Principle of Inclusion-Exclusion used in real-life situations?

The proof is used in a variety of fields, such as probability, statistics, and computer science, to calculate the probability of events, estimate the size of populations, and analyze data. It is also used in problem-solving and decision-making processes.

What are some common mistakes to avoid when using the Principle of Inclusion-Exclusion?

One common mistake is forgetting to include the correction factor for all possible intersections. Another mistake is not accounting for elements that may appear in more than three sets. It is also important to ensure that all sets are disjoint, meaning they have no elements in common.

Similar threads

  • Set Theory, Logic, Probability, Statistics
Replies
5
Views
816
  • Set Theory, Logic, Probability, Statistics
Replies
7
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
10
Views
848
  • Set Theory, Logic, Probability, Statistics
Replies
3
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
8
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
8
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
990
Back
Top