# Difference between revisions of "Principle of Inclusion-Exclusion"

m |
(Undo revision 135750 by Mathpro12345 (talk)) (Tag: Undo) |
||

(49 intermediate revisions by 25 users not shown) | |||

Line 1: | Line 1: | ||

The '''Principle of Inclusion-Exclusion''' (abbreviated PIE) provides an organized method/formula to find the number of [[element]]s in the [[union]] of a given group of [[set]]s, the size of each set, and the size of all possible [[intersection]]s among the sets. | The '''Principle of Inclusion-Exclusion''' (abbreviated PIE) provides an organized method/formula to find the number of [[element]]s in the [[union]] of a given group of [[set]]s, the size of each set, and the size of all possible [[intersection]]s among the sets. | ||

+ | |||

+ | ==Important Note(!)== | ||

+ | An important note when using PIE is to understand how to strategically overcount and undercount, in the end making sure every element is counted once and only once. In particular, memorizing a formula for PIE is a bad idea for problem solving. | ||

== Application == | == Application == | ||

− | |||

Here we will illustrate how PIE is applied with various numbers of sets. | Here we will illustrate how PIE is applied with various numbers of sets. | ||

Line 10: | Line 12: | ||

To find the union, we can add <math>|A_1|</math> and <math>|A_2|</math>. In doing so, we know we have counted everything in <math>|A_1\cup A_2|</math> at least once. However, some things were counted twice. The elements that were counted twice are precisely those in <math> {}A_1\cap A_2 </math>. Thus, we have that: | To find the union, we can add <math>|A_1|</math> and <math>|A_2|</math>. In doing so, we know we have counted everything in <math>|A_1\cup A_2|</math> at least once. However, some things were counted twice. The elements that were counted twice are precisely those in <math> {}A_1\cap A_2 </math>. Thus, we have that: | ||

− | <center><math> |A_1 \cup A_2| = |A_1| + |A_2| - |A_1\cap A_2| | + | <center><math> |A_1 \cup A_2| = |A_1| + |A_2| - |A_1\cap A_2|</math>.</center> |

− | === Three Set | + | === Three Set Examples === |

Assume we are given the sizes of three sets, <math>|A_1|, |A_2|,{}</math> and <math>|A_3|</math>, the size of their pairwise intersections, <math>|A_1\cap A_2|, |A_2\cap A_3|</math>, and <math>|A_3\cap A_1|</math>, and the size their overall intersection, <math>|A_1\cap A_2\cap A_3|</math>. We wish to find the size of their union, <math>|A_1\cup A_2\cup A_3|</math>. | Assume we are given the sizes of three sets, <math>|A_1|, |A_2|,{}</math> and <math>|A_3|</math>, the size of their pairwise intersections, <math>|A_1\cap A_2|, |A_2\cap A_3|</math>, and <math>|A_3\cap A_1|</math>, and the size their overall intersection, <math>|A_1\cap A_2\cap A_3|</math>. We wish to find the size of their union, <math>|A_1\cup A_2\cup A_3|</math>. | ||

− | Just like in the Two Set | + | Just like in the Two Set Examples, we start with the sum of the sizes of the individual sets <math>|A_1|+|A_2|+|A_3|</math>. We have counted the elements which are in exactly one of the original three sets once, but we've obviously counted other things twice, and even other things thrice! To account for the elements that are in two of the three sets, we first subtract out <math>|A_1\cap A_2|+|A_2\cap A_3| + |A_3\cap A_1|</math>. Now we have correctly accounted for them since we counted them twice originally, and just subtracted them out once. However, the elements that are in all three sets were originally counted three times and then subtracted out three times. We have to add back in <math>|A_1\cap A_2\cap A_3|</math>. Putting this all together gives: |

+ | |||

+ | <center><math> |A_1\cup A_2\cup A_3| = |A_1| + |A_2| + |A_3| -|A_1\cap A_2| - |A_2\cap A_3| - |A_3\cap A_1| +|A_1\cap A_2\cap A_3|</math>.</center> | ||

+ | |||

+ | === Four Set Example === | ||

+ | ==== Problem ==== | ||

+ | |||

+ | Six people of different heights are getting in line to buy donuts. Compute the number of ways they can arrange themselves in line such that no three consecutive people are in increasing order of height, from front to back. (2015 ARML I10) | ||

+ | |||

+ | ==== Solution ==== | ||

− | < | + | Let <math>A</math> be the event that the first, second, and third people are in ordered height, <math>B</math> be the event that the second, third, and fourth people are in ordered height, <math>C</math> be the event that the third, fourth, and fifth people are in ordered height, and <math>D</math> be the event that the fourth, fifth and sixth people are in ordered height. By a combination of complementary counting and PIE, we have that our answer will be <math>720-|A|-|B|-|C|-|D|+|A\cap B|+|A\cap C|+|A\cap D|+|B\cap C|+|B\cap D|+|C\cap D|-|A\cap B\cap C|-|A\cap B\cap D|-|A\cap C\cap D|-|B\cap C\cap D|+|A\cap B\cap C\cap D|</math>. Now for the daunting task of evaluating all of this. |

+ | For <math>|A|</math>, we just choose <math>3</math> people and there is only one way to put them in order, then <math>3!</math> ways to order the other three guys for <math>3!\binom{6}{3}=120</math>. Same goes for <math>|B|</math>, <math>|C|</math>, and <math>|D|</math>. | ||

+ | |||

+ | Now, for <math>|A\cap B|</math>, that's just putting four guys in order. By the same logic as above, this is <math>2!\binom{6}{4}=30</math>. Again, <math>|A\cap C|</math> would be putting five guys in order, so <math>1!\binom{6}{5}=6</math>. <math>|A\cap D|</math> is just choosing <math>3</math> guys out of <math>6</math>, then <math>3</math> guys out of <math>3</math> for <math>\binom{6}{3}=20</math>. Now, <math>|B\cap C|</math> is just the same as <math>|A\cap B|</math>, so <math>30</math>, <math>|B\cap D|</math> is <math>|A\cap C|</math> so <math>6</math>, and <math>|C\cap D|</math> is <math>|A\cap B|</math> so <math>30</math>. | ||

+ | |||

+ | Moving on to the next set: <math>|A\cap B\cap C|</math> is the same as <math>|A\cap C|</math> which is <math>6</math>, <math>|A\cap B\cap D|</math> is ordering everybody so <math>1</math>, <math>|A\cap C\cap D|</math> is again ordering everybody which is <math>1</math>, and <math>|B\cap C\cap D|</math> is the same as <math>|A\cap B\cap C|</math> so <math>6</math>. | ||

+ | |||

+ | Finally, <math>|A\cap B\cap C\cap D|</math> is ordering everybody so <math>1</math>. | ||

+ | |||

+ | Now, lets substitute everything back in. We get a massive expression of <math>720-120-120-120-120+30+6+20+30+6+30-6-1-1-6+1=\boxed{349}</math>. | ||

=== Five Set Example === | === Five Set Example === | ||

− | Problem | + | ==== Problem ==== |

− | There are five courses at my school. Students take the classes as follows | + | There are five courses at my school. Students take the classes as follows: |

243 take algebra. | 243 take algebra. | ||

323 take language arts. | 323 take language arts. | ||

− | 143 take | + | 143 take social studies. |

241 take biology. | 241 take biology. | ||

300 take history. | 300 take history. | ||

Line 59: | Line 79: | ||

How many people are in my school? | How many people are in my school? | ||

+ | ==== Solution ==== | ||

+ | Let A be the subset of students who take Algebra, L-languages, S-Social Studies, B-biology, H-history, M-the set of all students. We have: | ||

− | + | <math>|M|=|A|+|L|+|S|+|B|+|H|-|A\cap L|-|A\cap S|-|A\cap B|-|A\cap H|-|L\cap S|-|L\cap B|</math> | |

− | |||

− | <math> | + | <math>-|L\cap H|-|S\cap B|-|S\cap H|-|B\cap H|+|A\cap L\cap S|+|A\cap L\cap B|+|A\cap L\cap H|+|A\cap S\cap B|+|A\cap S\cap H|</math> |

− | |||

− | |||

− | <math> | + | <math>+|A\cap B\cap H|+|L\cap S\cap H|+|L\cap S \cap B|+|S\cap B\cap H|+|L \cap B\cap H|-|A\cap L\cap S\cap B|-|A\cap L\cap S\cap H|</math> |

− | |||

− | </math> | ||

− | <math> | + | <math>-|A\cap L\cap B\cap H|-|A\cap S\cap B\cap H|-|L\cap S\cap B\cap H|+|A\cap L\cap S\cap B\cap H|</math> |

− | |||

− | </math> | ||

− | <math> | + | <math>=243+323+143+241+300-213-264-144-121-111-90-80-60-70-60</math> |

− | |||

− | </math> | ||

+ | <math>+50+50+50+50+50+50+50+50+50+50-20-15-15-10-10+5=472</math> | ||

+ | |||

+ | Thus, there are <math> \boxed{472} </math> people in my school. | ||

== Statement == | == Statement == | ||

If <math>(A_i)_{1\leq i\leq n}</math> are finite sets, then: | If <math>(A_i)_{1\leq i\leq n}</math> are finite sets, then: | ||

<center><math> \left|\bigcup_{i=1}^n A_i\right|=\sum_{i=1}^n\left|A_i\right| | <center><math> \left|\bigcup_{i=1}^n A_i\right|=\sum_{i=1}^n\left|A_i\right| | ||

− | -\sum_{i < j}\left|A_i\cap A_j\right| +\sum_{i<j<k}\left|A_i\cap A_j\cap A_k\right|-\cdots\ +(-1)^n \left|A_1\cap\cdots\cap A_n\right|{}. </math></ | + | -\sum_{i < j}\left|A_i\cap A_j\right| +\sum_{i<j<k}\left|A_i\cap A_j\cap A_k\right|-\cdots\ +(-1)^{n-1} \left|A_1\cap\cdots\cap A_n\right|{}</math>.</center> |

− | == | + | |

− | Sometimes it is also useful to know that, if you take into account only the first <math>m\le n</math> sums on the right, then you will get an overestimate if <math>m</math> is odd and an underestimate if <math>m</math> is even. | + | == Proof == |

+ | We prove that each element is counted once. | ||

+ | |||

+ | Say that some element <math>X</math> is in <math>k</math> sets. Without loss of generality, these sets are <math>A_1,A_2,\dots,A_k.</math> | ||

+ | |||

+ | We proceed by induction. This is obvious for <math>k=1.</math> | ||

+ | |||

+ | If this is true for <math>k,</math> we prove this is true for <math>k+1.</math> For every set of sets not containing <math>A_{k+1}</math> with size <math>i,</math> there is a set of sets containing <math>A_{k+1}</math> with size <math>i+1.</math> In PIE, the sum of how many times these sets are counted is <math>0.</math> There is also one additional set of sets <math>\{A_{k+1}\},</math> so <math>X</math> is counted exactly once. | ||

+ | |||

+ | == Remarks == | ||

+ | Sometimes it is also useful to know that, if you take into account only the first <math>m\le n</math> sums on the right, then you will get an overestimate if <math>m</math> is [[odd integer | odd]] and an underestimate if <math>m</math> is [[even integer | even]]. | ||

So, | So, | ||

− | <math> \left|\bigcup_{i=1}^n A_i\right|\le \sum_{i=1}^n\left|A_i\right|</math>, | + | <math>\left|\bigcup_{i=1}^n A_i\right|\le \sum_{i=1}^n\left|A_i\right|</math>, |

− | <math> \left|\bigcup_{i=1}^n A_i\right|\ge \sum_{i=1}^n\left|A_i\right| | + | <math>\left|\bigcup_{i=1}^n A_i\right|\ge \sum_{i=1}^n\left|A_i\right|-\sum_{i < j}\left|A_i\cap A_j\right|</math>, |

− | -\sum_{i < j}\left|A_i\cap A_j\right| | ||

− | <math> \left|\bigcup_{i=1}^n A_i\right|\le \sum_{i=1}^n\left|A_i\right| | + | <math>\left|\bigcup_{i=1}^n A_i\right|\le \sum_{i=1}^n\left|A_i\right|-\sum_{i < j}\left|A_i\cap A_j\right| +\sum_{i<j<k}\left|A_i\cap A_j\cap A_k\right|</math>, |

− | -\sum_{i < j}\left|A_i\cap A_j\right| +\sum_{i<j<k}\left|A_i\cap A_j\cap A_k\right| </math>, | ||

and so on. | and so on. | ||

== Examples == | == Examples == | ||

+ | 2002 AIME I Problems/Problem 1 | ||

+ | http://artofproblemsolving.com/wiki/index.php?title=2002_AIME_I_Problems/Problem_1#Problem | ||

+ | |||

+ | 2011 AMC 8 Problems/Problem 6 | ||

+ | https://artofproblemsolving.com/wiki/index.php?title=2011_AMC_8_Problems/Problem_6 | ||

− | + | 2017 AMC 10B Problems/Problem 13 | |

− | + | https://artofproblemsolving.com/wiki/index.php?title=2017_AMC_10B_Problems/Problem_13 | |

− | + | 2005 AMC 12A Problems/Problem 18 | |

+ | https://artofproblemsolving.com/wiki/index.php/2005_AMC_12A_Problems/Problem_18 | ||

== See also == | == See also == | ||

− | |||

* [[Combinatorics]] | * [[Combinatorics]] | ||

* [[Overcounting]] | * [[Overcounting]] | ||

+ | |||

+ | [[Category:Combinatorics]] |

## Latest revision as of 19:46, 26 October 2020

The **Principle of Inclusion-Exclusion** (abbreviated PIE) provides an organized method/formula to find the number of elements in the union of a given group of sets, the size of each set, and the size of all possible intersections among the sets.

## Contents

## Important Note(!)

An important note when using PIE is to understand how to strategically overcount and undercount, in the end making sure every element is counted once and only once. In particular, memorizing a formula for PIE is a bad idea for problem solving.

## Application

Here we will illustrate how PIE is applied with various numbers of sets.

### Two Set Example

Assume we are given the sizes of two sets, and , and the size of their intersection, . We wish to find the size of their union, .

To find the union, we can add and . In doing so, we know we have counted everything in at least once. However, some things were counted twice. The elements that were counted twice are precisely those in . Thus, we have that:

### Three Set Examples

Assume we are given the sizes of three sets, and , the size of their pairwise intersections, , and , and the size their overall intersection, . We wish to find the size of their union, .

Just like in the Two Set Examples, we start with the sum of the sizes of the individual sets . We have counted the elements which are in exactly one of the original three sets once, but we've obviously counted other things twice, and even other things thrice! To account for the elements that are in two of the three sets, we first subtract out . Now we have correctly accounted for them since we counted them twice originally, and just subtracted them out once. However, the elements that are in all three sets were originally counted three times and then subtracted out three times. We have to add back in . Putting this all together gives:

### Four Set Example

#### Problem

Six people of different heights are getting in line to buy donuts. Compute the number of ways they can arrange themselves in line such that no three consecutive people are in increasing order of height, from front to back. (2015 ARML I10)

#### Solution

Let be the event that the first, second, and third people are in ordered height, be the event that the second, third, and fourth people are in ordered height, be the event that the third, fourth, and fifth people are in ordered height, and be the event that the fourth, fifth and sixth people are in ordered height. By a combination of complementary counting and PIE, we have that our answer will be . Now for the daunting task of evaluating all of this.

For , we just choose people and there is only one way to put them in order, then ways to order the other three guys for . Same goes for , , and .

Now, for , that's just putting four guys in order. By the same logic as above, this is . Again, would be putting five guys in order, so . is just choosing guys out of , then guys out of for . Now, is just the same as , so , is so , and is so .

Moving on to the next set: is the same as which is , is ordering everybody so , is again ordering everybody which is , and is the same as so .

Finally, is ordering everybody so .

Now, lets substitute everything back in. We get a massive expression of .

### Five Set Example

#### Problem

There are five courses at my school. Students take the classes as follows: 243 take algebra. 323 take language arts. 143 take social studies. 241 take biology. 300 take history. 213 take algebra and language arts. 264 take algebra and social studies. 144 take algebra and biology. 121 take algebra and history. 111 take language arts and social studies. 90 take language arts and biology. 80 take language arts and history. 60 take social studies and biology. 70 take social studies and history. 60 take biology and history. 50 take algebra, language arts, and social studies. 50 take algebra, language arts, and biology. 50 take algebra, language arts, and history. 50 take algebra, social studies, and biology. 50 take algebra, social studies, and history. 50 take algebra, biology, and history. 50 take language arts, social studies, and biology. 50 take language arts, social studies, and history. 50 take language arts, biology, and history. 50 take social studies, biology, and history. 20 take algebra, language arts, social studies, and biology. 15 take algebra, language arts, social studies, and history. 15 take algebra, language arts, biology, and history. 10 take algebra, social studies, biology, and history. 10 take language arts, social studies, biology, and history. 5 take all five. None take none.

How many people are in my school?

#### Solution

Let A be the subset of students who take Algebra, L-languages, S-Social Studies, B-biology, H-history, M-the set of all students. We have:

Thus, there are people in my school.

## Statement

If are finite sets, then:

## Proof

We prove that each element is counted once.

Say that some element is in sets. Without loss of generality, these sets are

We proceed by induction. This is obvious for

If this is true for we prove this is true for For every set of sets not containing with size there is a set of sets containing with size In PIE, the sum of how many times these sets are counted is There is also one additional set of sets so is counted exactly once.

## Remarks

Sometimes it is also useful to know that, if you take into account only the first sums on the right, then you will get an overestimate if is odd and an underestimate if is even. So,

,

,

,

and so on.

## Examples

2002 AIME I Problems/Problem 1 http://artofproblemsolving.com/wiki/index.php?title=2002_AIME_I_Problems/Problem_1#Problem

2011 AMC 8 Problems/Problem 6 https://artofproblemsolving.com/wiki/index.php?title=2011_AMC_8_Problems/Problem_6

2017 AMC 10B Problems/Problem 13 https://artofproblemsolving.com/wiki/index.php?title=2017_AMC_10B_Problems/Problem_13

2005 AMC 12A Problems/Problem 18 https://artofproblemsolving.com/wiki/index.php/2005_AMC_12A_Problems/Problem_18