The Algebra Of Sets Introduction The Fundamental Laws Of Set

The algebra of sets develops and describes the basic properties and laws of sets, the set-theoretic operations of union, intersection, and complementation and the relations of set equality and set inclusion. It also provides systematic procedures for evaluating expressions, and performing calculations, involving these operations and relations.

1 Introduction

The algebra of sets is the development of the fundamental properties of set operations and set relations. These properties provide insight into the fundamental nature of sets. They also have practical considerations.

Just like expressions and calculations in ordinary arithmetic, expressions and calculations involving sets can be quite complex. It is helpful to have systematic procedures available for manipulating and evaluating such expressions and performing such computations.

In the case of arithmetic, it is elementary algebra that develops the fundamental properties of arithmetic operations and relations.

For example, the operations of addition and multiplication obey familiar laws such as associativity, commutativity and distributivity, while, the "less than or equal" relation satisfies such laws as reflexivity, antisymmetryIn mathematics, a binary relation R over a set X is antisymmetric if it holds for all a and b in X that if a is related to b and b is related to a then a b''. In notation, this is: : Strict inequality is antisymmetric; since a < b and b < a is impossible, and transitivityIn mathematics, a binary relation R over a set X is transitive if it holds for all a b and c in X that if a is related to b and b is related to c then a is related to c''. In notation, this is: : For example, "is greater than" and "is equal to" are transi. These laws provide tools which facilitate computation, as well as describe the fundamental nature of numbers, their operations and relations.

The algebra of sets is the set-theoretic analogue of the algebra of numbers. It is the algebra of the set-theoretic operations of union, intersection and complementation, and the relations of equality and inclusion. These are the topics covered in this article. For a basic introduction to sets see, Set, for a fuller account see Naive set theoryNaive set theory 1 is distinguished from axiomatic set theory by the fact that the former regards sets as collections of objects, called the elements or members of the set, whereas the latter regards sets only as that which satisfies certain axioms. Sets.

2 The fundamental laws of set algebra

The binary operationIn mathematics, a binary operation or binary operator is a calculation involving two input quantities and one kind of a specific operation. It is sometimes called a dyadic operation as well. Examples include the familiar arithmetic operations of addition,s of set union and intersection satisfy many identitiesIn mathematics, an identity is an equality that remains true regardless of the values of any variables that appear within it. Identities for classes of functions Logarithmic identities Exponential identities Trigonometric identities Hyperbolic function id. Several of these identities or "laws" have well established names. Three pairs of laws, are stated, without proofIn mathematics, a proof is a demonstration that, given certain axioms, some statement of interest is necessarily true. Proofs employ logic but usually include some amount of natural language which of course admits some ambiguity. In fact, the vast majorit, in the following proposition.

Notice that the analogy between unions and intersections of sets, and addition and multiplication of numbers, is quite striking. Like addition and multiplication, the operations of union and intersection are commutative and associative, and intersection distributes over unions. However, unlike addition and multiplication, union also distributes over intersection.

The next proposition, states two additional pairs of laws involving three specials sets: the empty set, the universal set and the complement of a set.

PROPOSITION 2: For any subset A of universal set U, the following identities hold:

The identity laws (together with the commutative laws) say that, just like 0 and 1 for addition and multiplication, Ø and U are the identity elements for union and intersection, respectively.

Unlike addition and multiplication, union and intersection do not have inverse elements. However the complement laws give the fundamental properties of the somewhat inverse-like unary operation of set complementation.

The preceding five pairs of laws: the commutative, associative, distributive, identity and complement laws, can be said to encompass all of set algebra, in the sense that every valid proposition in the algebra of sets can be derived from them.

3 The principle of duality

The above propositions display the following interesting pattern. Each of the identities stated above is one of a pair of identities, such that, each can be transformed into the other by interchanging ∪ and ∩, and also Ø and U.

These are examples of an extremely important and powerful property of set algebra, namely, the principle of duality for sets, which asserts that for any true statement about sets, the dual statement obtained by interchanging unions and intersections, interchanging U and Ø and reversing inclusions is also true. A statement is said to be self-dual if it is equal to its own dual.

4 Some additional laws for unions and intersections

The following proposition states six more important laws of set algebra, involving unions and intersections.

PROPOSITION 3: For any subsets A and B of a universal set U, the following identities hold:

idempotent laws:

A ∪A = A
A ∩A = A

domination laws:

A ∪U = U
A ∩Ø = Ø

absorption laws:

A ∪(A ∩B) = A
A ∩(A ∪B) = A

As noted above each of the laws stated in proposition 3, can be derived from the five fundamental pairs of laws stated in proposition 1 and proposition 2. As an illustration, a proof is given below for the idempotent law for union.

Proof:

A ∪A	= (A ∪A) ∩U	by the identity law for intersection
	= (A ∪A) ∩(A ∪A^C)	by the complement law for union
	= A ∪(A ∩A^C)	by the distributive law of union over intersection
	= A ∪Ø	by the complement law for intersection
	= A	by the identity law for union

The following proof illustrates that the dual of the above proof is the proof of the dual of the idempotent law for union, namely the idempotent law for intersection.

Proof:

A ∩A	= (A ∩A) ∪Ø	by the identity law for union
	= (A∩A) ∪(A ∩A^C)	by the complement law for intersection
	= A ∩(A ∪A^C)	by the distributive law of intersection over union
	= A ∩U	by the complement law for union
	= A	by the identity law for intersection

5 Some additional laws for complements

The following proposition states five more important laws of set algebra, involving complements.

PROPOSITION 4: Let A and B be subsets of a universe U, then:

De Morgan's laws:

(A ∪B)^C = A^C ∩B^C
(A ∩B)^C = A^C ∪B^C

double complement or Involution law:

A^CC = A

complement laws for the universal set and the empty set:

Ø^C = U
U^C = Ø

Notice that the double complement law is self-dual.

The next proposition, which is also self-dual, says that the complement of a set is the only set that satisfies the complement laws. In other words, complementation is characterized by the complement laws.

PROPOSITION 5: Let A and B be subsets of a universe U, then:

uniqueness of complements:

If A ∪B = U, and A ∩B = Ø then B = A^C.

6 The algebra of inclusion

The following proposition says that inclusion is a partial order.

PROPOSITION 6: If A, B and C are sets then the following hold:

reflexivity:

A ⊆ A

antisymmetry:

A ⊆ B and B ⊆ A if and only if A = B

transitivity:

If A ⊆ B and B ⊆ C then A ⊆ C

The following proposition says that for any set S the power set of S ordered by inclusion is a bounded lattice, and hence together with the distributive and complement laws above, show that it is a Boolean algebra.

PROPOSITION 7: If A, B and C are subsets of a set S then the following hold:

existence of a least element and a greatest element:

Ø ⊆ A ⊆ S

existence of joins:

A ⊆ A ∪B
If A ⊆ C and B ⊆ C then A ∪B ⊆ C

existence of meets:

A ∩B ⊆ A
If C ⊆ A and C ⊆ B then C ⊆ A ∩B

The following proposition says that, the statement "A ⊆ B ", is equivalent to various other statements involving unions, intersections and complements.

PROPOSITION 8: For any two sets A and B, the following are equivalent:

A ⊆ B
A ∩B = A
A ∪B = B
A − B = Ø
B^C ⊆ A^C

The above proposition shows that the relation of set inclusion can be characterized by either of the operations of set union or set intersection, which means that the notion of set inclusion is axiomatically superfluous.

7 The algebra of relative complements

The following proposition, lists several identities concerning relative complements or set-theoretic difference.

PROPOSITION 9: For any universe U and subsets A, B, and C of U, the following identities hold:

C − (A ∩B) = (C − A) ∪(C − B)
C − (A ∪B) = (C − A) ∩(C − B)
C − (B − A) = (A ∩C) ∪(C − B)
(B − A) ∩C = (B ∩C) − A = B ∩(C − A)
(B − A) ∪C = (B ∪C) − (A − C)
A − A = Ø
Ø − A = Ø
A − Ø = A
B − A = A^C ∩B
(B − A)^C = A ∪B^C
U − A = A^C
A − U = Ø

8 Further reading

<Hide>

Home > The algebra of sets