0

The next definition is giving in the book the exercise was proposed on.

The definition reads:

Let $a=n(A)$ and $b=n(B)$ where $A$ and $B$ are two disjoint finite sets. Then $a+b=n(A∪B).$

I understand the fact of A and B being disjoint is a must. Yet, what should I do in case A and B have at least an element in common?

I was proposed an exercise in which I am to compute the cardinal of two non-disjoint sets given. But the definition on my mathbook does not cover non-disjoint sets. What am I supposed to do?

Or Shahar
  • 1,766

1 Answers1

2

The reason the formula $|A \cup B| = |A| + |B|$ is only applicable to the case when $A$ and $B$ are disjoint is that it would double-count the elements in the intersection $A \cap B$. Thus, it can be generalized to the case of not necessarily disjoint sets as

$$ |A \cup B| = |A| + |B| - |A \cap B|\tag1. $$

This can be seen by considering the three possible cases for $x \in A \cup B$:

  1. $x \in A$ and $x \notin B$
  2. $x \notin A$ and $x \in B$
  3. $x \in A$ and $x \in B$

and verifying that $x$ is counted exactly once in $(1)$.

This reasoning is called the inclusion-exclusion principle and can be generalized to more than two sets.

Adam Zalcman
  • 3,446