Sets and Methods of Proof
Sets: union, intersection, complement
A set is a collection of objects, called elements. We write to say that belongs to , and otherwise.
Sets are one of the basic languages of modern mathematics, and they are closely tied to logic: each operation on sets corresponds exactly to a logical connective on membership propositions.
The union gathers all the elements belonging to or to , in the inclusive sense. The intersection keeps only the common elements, belonging to and to . The complement of in a reference set , written , gathers all the elements of that do not belong to : it is the set-theoretic translation of negation.
| Set operation | Corresponding logical connective |
|---|---|
| or, | |
| and, | |
| not, |
These correspondences are not mere decorative analogies: they allow a proof about sets to be translated into a purely logical proof, and vice versa.
Thus, De Morgan's laws state that the complement of a union is the intersection of the complements:
exactly as the negation of an "or" is the "and" of the negations.
Reading a Venn diagram
The Venn diagram is the standard visual tool: two overlapping circles represent two sets, and each region of the diagram corresponds to a specific combination of membership.
| Region of the diagram | Corresponding set |
|---|---|
| the central zone, shared by both circles | |
| both circles together, central zone included | |
| circle minus the central zone | |
| everything outside circle | the complement of in |
Learn to read these regions fluently: they help you visualize a property instantly, even before trying to prove it formally.

