1. Sets and Elements
2. Symbols for Sets and their Elements
3. Sets Defined by Lists of Elements
4. Sets Defined by Properties of Elements
5. Equality of Sets
6. Union of Sets
7. Commutative Law for Unions
8. Associative Law for Unions
9. Intersection of Sets
10. Commutative Law for Intersections
11. Associative Law for Intersections
12. Distributive Law: Union over Intersection
13. Distributive Law: Intersection over Union
14. Universal Set
15. Empty Set
16. Complement
17. Complement of a Complement
18. Union of a set and its Complement
19. Intersection of a Set and its Complement
20. Complement of a Union
21. Complement of an Intersection
a is in A.
For example we may let A stand for the set of days of the week, and we may let a = Sunday, b = Monday, c = Tuesday, etc. Then a is in A means Sunday is a day of the week, b is in A means Monday is a day of the week, etc.
A = {red, yellow, green}.
A = {x: P(x)}.
For example, let x stand for a person, and let P(x) = x is an artist. Then {x: P(x)} is the set of all artists.
If the same set is defined by different incomplete statements, then the incomplete statements must have the same meaning. For example, let x stand for a day of the week. Then we have
{Saturday, Sunday} = {x: x is at the weekend} = {x: x is the day after Friday or the day before Monday}.
For example, let A = {a, b, c, d} and let B = {c, d, e}. Then A + B = {a, b, c, d, e}. Notice that the elements c and d are in A as well as B, but they are written only once in the list for A + B.
The union of two sets is defined in symbols as follows:
A + B = {x: x is in A or x is in B}.
{a, b, c} + {c, d} = {a, b, c, d}
and
{c, d} + {a, b, c} = {a, b, c, d}.
This may also be seen in the definitions
A + B = {x: x is in A or x is in B}
and
B + A = {x: x is in B or x is in A}
because, by the commutative law for the logical OR, x is in A or x is in B has the same meaning as x is in B or x is in A.
This fact is called the commutative law for the union of sets. It is summarized in symbols as follows:
A + B = B + A.
(A + B) + C = {x: (x is in A or x is in B) or x is in C}.
By the associative law for the logical OR, this is equal to:
{x: x is in A or (x is in B or x is in C)} = A + (B + C).
Therefore we have the associative law for unions, which is summarized as follows:
(A + B) + C = A + (B + C).As a result of this law we may omit the brackets and write:
A + B + C.
For example, let A be the set of all African people, let B be the set of all Asian people, and let C be the set of all European people. Then the union A + B + C is the set of all the people in Africa, Asia, and Europe.
For example, let A = {a, b, c, d} and let B = {c, d, e}. Then A . B = {c, d}.
The intersection of two sets is defined in symbols as follows:
A . B = {x: x is in A and x is in B}.
{a, b, c, d} . {c, d, e} = {c, d}
and
{c, d, e} . {a, b, c, d} = {c, d}.
This may also be seen in the definitions
A . B = {x: x is in A and x is in B}
and
B . A = {x: x is in B and x is in A}
because, by the commutative law for the logical AND, x is in A and x is in B has the same meaning as x is in B and x is in A.
This fact is called the commutative law for the intersection of two sets. It is summarized in symbols as follows:
A . B = B . A.
(A . B) . C = {x: (x is in A and x is in B) and x is in C}.
By the associative law for the logical AND, this is equal to
{x: x is in A and (x is in B and x is in C)} = A . (B . C).
Therefore we have the associative law for intersections, which is summarized in symbols as follows:
(A . B) . C = A . (B . C).As a result of this law we may omit the brackets and write
A . B . C.
For example, let A be the set of all African people, let B be the set of all female people, and let C be the set of all children under 10 years old. Then A . B . C is the set of all African girls under 10 years old.
A + (B . C) = {x: x is in A or (x is in B and x is in C)}.
By one of the distributive laws for composite statements, x is in A or (x is in B and x is in C) has the same meaning as (x is in A or x is in B) and (x is in A or x is in C). Therefore
A + (B . C) = {x: (x is in A or x is in B) and (x is in A or x is in C)}.
But
{x: (x is in A or x is in B) and (x is in A or x is in C)} = (A + B) . (A + C).
Therefore
A + (B . C) = (A + B) . (A + C).This is one of the distributive laws for sets.
For example, suppose that applicants for a job must have either a university degree, or five years of work experience and a certificate of English language ability. Let A be the set of people with a degree, let B be the set of people with five years of experience, and let C be the set of people with a certificate of English. Then A + (B . C) is the set of people who may apply for the job. By the distributive law this is the same as (A + B) . (A + C). This shows that the applications may be checked in two separate ways before being accepted. One check makes sure that the applicant belongs to A + B (has a degree or five years of experience). The other check makes sure that the applicant belongs to A + C (has a degree or a certificate of English).
A . (B + C) = {x: x is in A and (x is in B or x is in C)}.
By one of the distributive laws for composite statements, x is in A and (x is in B or x is in C) has the same meaning as (x is in A and x is in B) or (x is in A and x is in C). Therefore
A . (B + C) = {x: (x is in A and x is in B) or (x is in A and x is in C)}.
But
{x: (x is in A and x is in B) or (x is in A and x is in C)} = (A . B) + (A . C).
Therefore
A . (B + C) = (A . B) + (A . C).This is another distributive law for sets.
For example, let A be the set of children from 5 to 12 years old, let B be the set of boys, and let C be the set of girls. Then A . (B + C) means: the set of children who are 5 to 12 years old and either boys or girls. This is the same as the set (A . B) + (A . C), which means: children who are boys 5 to 12 years old or girls 5 to 12 years old.
For example, if the sets being studied consist of men, women, boys, and girls in a population, then the universal set is everyone in the population.
We shall use the letter U to stand for the universal set.
For example, let A be the set of all men, and let B be the set of all women. Then the intersection of these two sets is empty, that is: A . B = O.
A' = {x: x is not in A}.For example, let the universal set be the set of whole numbers from 1 to 10, and let A be the set of all even numbers from 2 to 10. That is:
A = {2, 4, 6, 8, 10}.
Then A' is the set of all odd numbers from 1 to 9:
A' = {1, 3, 5, 7, 9}.
Since not-(x is not in A) has the same meaning as x is in A, it follows that (A')' = {x: x is in A}. But {x: x is in A} = A. Therefore we have the complement law:
(A')' = A.For example, let the universal set be the set of whole numbers from 1 to 10, and let A be the set of even numbers from 2 to 10. Then A' is the set of odd numbers from 1 to 9, and (A')' is the original set A of even numbers from 2 to 10.
For example, let x stand for an animal, let A = {x: x is male}, and let A' = {x: x is female}. Then A + A' = {x: x is male or x is female} = the set of all animals.
We write this law briefly as follows:
A + A' = U.
For example, let A consist of all the unbroken plates in a set of plates, and let A' consist of all the broken plates. Then A . A' is empty because there are no plates that are unbroken and broken at the same time.
We summarize this law in symbols as follows:
A . A' = O.
A + B = {x: x is in A or x is in B},
the complement of the union is given by
(A + B)' = {x: not-(x is in A or x is in B)}
But not-(x is in A or x is in B) has the same meaning as x is not in A and x is not in B, and
{x: x is not in A and x is not in B} = A'.B'.
Therefore, we have the following law for the complement of a union:
(A + B)' = A' . B'.This is one of De Morgan's laws for sets.
For example, let the universal set be the set of all substances. Let A be the set of all solids, such as stone and iron. Let B be the set of all liquids, such as water and oil. Then A + B is the set all substances that are solid or liquid. The complement (A + B)' is the set of all substances that are not solid or liquid, in other words the set A' . B' of all substances that are not solid and not liquid, such as oxygen and nitrogen (which are gases).
A . B = {x: x is in A and x is in B},
the complement of this intersection is given by
(A . B)' = {x: not-(x is in A and x is in B)}.
But not-(x is in A and x is in B) has the same meaning as x is not in A or x is not in B, and
{x: x is not in A or x is not in B} = A' + B'.
Therefore, we have the following law for the complement of an intersection:
(A . B)' = A' + B'.This is another of De Morgan's laws for sets.
For example, let the universal set be the whole numbers from 1 to 10. Let A = {1, 2, 3, 4, 7, 8, 9, 10} and let B = {2, 4, 6, 8, 10}. Then A . B = {2, 4, 8, 10}, and so (A . B)' = {1, 3, 5, 6, 7, 9}. Also A' = {5, 6}, B' = {1, 3, 5, 7, 9} and A' + B' = {1, 3, 5, 6, 7, 9}. Therefore, in this example, (A . B)' = A' + B'.
Backward links: Statements I Statements II Quantifiers I Quantifiers II
Forward links: Sets II Relations I Relations II
By R. H. B. Exell, 1998. King Mongkut's University of Technology Thonburi.
Back to Home Page