Sets and Methods of Proof

Sets: union, intersection, complement

A set is a collection of objects, called elements. We write x∈Ex \in E to say that xx belongs to EE, and x∉Ex \notin E 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 A∪BA \cup B gathers all the elements belonging to AA or to BB, in the inclusive sense. The intersection A∩BA \cap B keeps only the common elements, belonging to AA and to BB. The complement of AA in a reference set EE, written E∖AE \setminus A, gathers all the elements of EE that do not belong to AA: it is the set-theoretic translation of negation.

Set operation Corresponding logical connective
A∪BA \cup B or, ∨\vee
A∩BA \cap B and, ∧\wedge
E∖AE \setminus A not, ¬\neg

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:

(A∪B)c=Ac∩Bc(A∩B)c=Ac∪Bc(A \cup B)^c = A^c \cap B^c \qquad (A \cap B)^c = A^c \cup B^c

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 A∩BA \cap B
both circles together, central zone included A∪BA \cup B
circle AA minus the central zone A∖BA \setminus B
everything outside circle AA the complement of AA in EE

Learn to read these regions fluently: they help you visualize a property instantly, even before trying to prove it formally.