# Algebra of sets

The **algebra of sets** defines the 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.

Any set of sets closed under the set-theoretic operations forms a Boolean algebra with the join operator being *union*, the meet operator being *intersection*, and the complement operator being *set complement*.

## Contents

## Fundamentals

The algebra of sets is the set-theoretic analogue of the algebra of numbers. Just as arithmetic addition and multiplication are associative and commutative, so are set union and intersection; just as the arithmetic relation "less than or equal" is reflexive, antisymmetric and transitive, so is the set relation of "subset".

It is the algebra of the set-theoretic operations of union, intersection and complementation, and the relations of equality and inclusion. For a basic introduction to sets see the article on sets, for a fuller account see naive set theory, and for a full rigorous axiomatic treatment see axiomatic set theory.

## The fundamental laws of set algebra

The binary operations of set union () and intersection () satisfy many identities. Several of these identities or "laws" have well established names.

- Commutative laws:
- Associative laws:
- Distributive laws:

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.

Two additional pairs of laws involve the special sets called the empty set Ø and the universal set ; together with the complement operator. The empty set has no members, and the universal set has all possible members (in a particular context).

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—encompass all of set algebra, in the sense that every valid proposition in the algebra of sets can be derived from them.

Note that if the complement laws are weakened to the rule , then this is exactly the algebra of propositional linear logicTemplate:Clarify.

## The principle of duality

{{#invoke:see also|seealso}}
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.

## 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:
- domination laws:
- absorption laws:

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:*

by the identity law of intersection | ||

by the complement law for union | ||

by the distributive law of union over intersection | ||

by the complement law for intersection | ||

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:*

by the identity law for union | ||

by the complement law for intersection | ||

by the distributive law of intersection over union | ||

by the complement law for union | ||

by the identity law for intersection |

Intersection can be expressed in terms of set difference :

## 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:
- double complement or Involution law:
- complement laws for the universal set and the empty set:

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:

## 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:

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:

- existence of joins:

- existence of meets:

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

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

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.

## The algebra of relative complements

The following proposition lists several identities concerning relative complements and set-theoretic differences.

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

## See also

- σ-algebra is an algebra of sets, completed to include countably infinite operations.
- Axiomatic set theory
- Field of sets
- Naive set theory
- Set (mathematics)

## References

- Stoll, Robert R.;
*Set Theory and Logic*, Mineola, N.Y.: Dover Publications (1979) ISBN 0-486-63829-4. "The Algebra of Sets", pp 16—23 - Courant, Richard, Herbert Robbins, Ian Stewart,
*What is mathematics?: An Elementary Approach to Ideas and Methods*, Oxford University Press US, 1996. ISBN 978-0-19-510519-3. "SUPPLEMENT TO CHAPTER II THE ALGEBRA OF SETS"

## External links

bn:সেটের অ্যালজেব্রা fa:جبر مجموعهها nl:Algebra van verzamelingen ja:集合代数 ru:Алгебра множеств uk:Алгебра множин