Algebra of sets

Short description: Identities and relationships involving sets

This article is about algebraic properties of set operations in general. For a boolean algebra of sets, see Field of sets.

This article includes a list of general references, but it remains largely unverified because it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (April 2023) (Learn how and when to remove this template message)

|

In mathematics, the algebra of sets, not to be confused with the mathematical structure of an 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, the complement operator being set complement, the bottom being ∅ and the top being the universe set under consideration.

## Contents

* 1 Fundamentals
* 2 Fundamental properties of set algebra
* 3 Principle of duality
* 4 Some additional laws for unions and intersections
* 5 Some additional laws for complements
* 6 Algebra of inclusion
* 7 Algebra of relative complements
* 8 See also
* 9 References
* 10 External links

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

## Fundamental properties of set algebra

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

Commutative property:

* A∪B=B∪A
* A∩B=B∩A

Associative property:

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

Distributive property:

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

The union and intersection of sets may be seen as analogous to the addition and multiplication of numbers. Like addition and multiplication, the operations of union and intersection are commutative and associative, and intersection distributes over union. However, unlike addition and multiplication, union also distributes over intersection.

Two additional pairs of properties involve the special sets called the empty set ∅ and the universe set U; together with the complement operator (A∁ denotes the complement of A. This can also be written as A′, read as "A prime"). The empty set has no members, and the universe set has all possible members (in a particular context).

Identity:

* A∪∅=A
* A∩U=A

Complement:

* A∪A∁=U
* A∩A∁=∅

The identity expressions (together with the commutative expressions) 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 formulae--the commutative, associative, distributive, identity and complement formulae--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 formulae are weakened to the rule (A∁)∁=A, then this is exactly the algebra of propositional linear logic[clarification needed].

## Principle of duality

See also: Duality (order theory)

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 ∩, while also interchanging ∅ 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 universe 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 above. As an illustration, a proof is given below for the idempotent law for union.

Proof:

A∪A | =(A∪A)∩U | by the identity law of intersection

|
|

| =(A∪A)∩(A∪A∁) | by the complement law for union
| =A∪(A∩A∁) | 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∁) | by the complement law for intersection
| =A∩(A∪A∁) | by the distributive law of intersection over union
| =A∩U | by the complement law for union
| =A | by the identity law for intersection

Intersection can be expressed in terms of set difference:

A∩B=A∖(A∖B)

## 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)∁=A∁∩B∁
* (A∩B)∁=A∁∪B∁

double complement or involution law:

* (A∁)∁=A

complement laws for the universe set and the empty set:

* ∅∁=U
* U∁=∅

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∁

## Algebra of inclusion

The following proposition says that inclusion, that is the binary relation of one set being a subset of another, 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∁⊆A∁

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.

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

* 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∩C)=(B∩C)∖A=B∩(C∖A)
* (B∖A)∪C=(B∪C)∖(A∖C)
* (B∖A)∖C=B∖(A∪C)
* A∖A=∅
* ∅∖A=∅
* A∖∅=A
* B∖A=A∁∩B
* (B∖A)∁=A∪B∁
* U∖A=A∁
* A∖U=∅

## See also

* σ-algebra is an algebra of sets, completed to include countably infinite operations.
* Axiomatic set theory
* Image (mathematics) § Properties
* Field of sets
* List of set identities and relations
* Naive set theory
* Set (mathematics)
* Topological space -- a subset of ℘(X), the power set of X, closed with respect to arbitrary union, finite intersection and containing ∅ and X.

## References

1. ↑ Paul R. Halmos (1968). Naive Set Theory. Princeton: Nostrand. Here: Sect.4
2. ↑ Many mathematicians[1] assume all set operation to be of equal priority, and make full use of parentheses. So does this article.

* 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

* Operations on Sets at ProvenMath

* v
* t
* e

Mathematical logic

General|

* Formal language
* Formation rule
* Formal proof
* Formal semantics
* Well-formed formula
* Set
* Element
* Class
* Classical logic
* Axiom
* Rule of inference
* Relation
* Theorem
* Logical consequence
* Type theory
* Symbol
* Syntax
* Theory

Systems|

* Formal system
* Deductive system
* Axiomatic system
* Hilbert style systems
* Natural deduction
* Sequent calculus

Traditional logic|

* Proposition
* Inference
* Argument
* Validity
* Cogency
* Syllogism
* Square of opposition
* Venn diagram

Propositional calculus
and Boolean logic

* Boolean functions
* Propositional calculus
* Propositional formula
* Logical connectives
* Truth tables
* Many-valued logic

Predicate logic|

* First-order
* Quantifiers
* Predicate
* Second-order
* Monadic predicate calculus

Naive set theory|

* Set
* Empty set
* Element
* Enumeration
* Extensionality
* Finite set
* Infinite set
* Subset
* Power set
* Countable set
* Uncountable set
* Recursive set
* Domain
* Codomain
* Image
* Map
* Function
* Relation
* Ordered pair

Set theory|

* Foundations of mathematics
* Zermelo–Fraenkel set theory
* Axiom of choice
* General set theory
* Kripke–Platek set theory
* Von Neumann–Bernays–Gödel set theory
* Morse–Kelley set theory
* Tarski–Grothendieck set theory

Model theory|

* Model
* Interpretation
* Non-standard model
* Finite model theory
* Truth value
* Validity

Proof theory|

* Formal proof
* Deductive system
* Formal system
* Theorem
* Logical consequence
* Rule of inference
* Syntax

Computability
theory|

* Recursion
* Recursive set
* Recursively enumerable set
* Decision problem
* Church–Turing thesis
* Computable function
* Primitive recursive function

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Algebra of sets. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Algebra_of_sets&oldid=4149612"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template