Algebra of sets

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 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 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 ⁠ ∅ {\displaystyle \varnothing } ⁠ and the top being the universe set under consideration.

## Fundamentals

[edit]

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

[edit]

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

Commutative property:

* ⁠ A ∪ B = B ∪ A {\displaystyle A\cup B=B\cup A} ⁠
* ⁠ A ∩ B = B ∩ A {\displaystyle A\cap B=B\cap A} ⁠

Associative property:

* ⁠ ( A ∪ B ) ∪ C = A ∪ ( B ∪ C ) {\displaystyle (A\cup B)\cup C=A\cup (B\cup C)} ⁠
* ⁠ ( A ∩ B ) ∩ C = A ∩ ( B ∩ C ) {\displaystyle (A\cap B)\cap C=A\cap (B\cap C)} ⁠

Distributive property:

* ⁠ A ∪ ( B ∩ C ) = ( A ∪ B ) ∩ ( A ∪ C ) {\displaystyle A\cup (B\cap C)=(A\cup B)\cap (A\cup C)} ⁠
* ⁠ A ∩ ( B ∪ C ) = ( A ∩ B ) ∪ ( A ∩ C ) {\displaystyle A\cap (B\cup C)=(A\cap B)\cup (A\cap 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 ⁠ ∅ {\displaystyle \varnothing } ⁠ and the universe set ⁠ U {\displaystyle {\boldsymbol {U}}} ⁠; together with the complement operator (⁠ A ∁ {\displaystyle A^{\complement }} ⁠ denotes the complement of ⁠ A {\displaystyle A} ⁠. This can also be written as ⁠ A ′ {\displaystyle 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 {\displaystyle A\cup \varnothing =A} ⁠
* ⁠ A ∩ U = A {\displaystyle A\cap {\boldsymbol {U}}=A} ⁠

Complement:

* ⁠ A ∪ A ∁ = U {\displaystyle A\cup A^{\complement }={\boldsymbol {U}}} ⁠
* ⁠ A ∩ A ∁ = ∅ {\displaystyle A\cap A^{\complement }=\varnothing } ⁠

The identity expressions (together with the commutative expressions) say that, just like 0 and 1 for addition and multiplication, ⁠ ∅ {\displaystyle \varnothing } ⁠ and ⁠ U {\displaystyle {\boldsymbol {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 {\displaystyle (A^{\complement })^{\complement }=A} ⁠, then this is exactly the algebra of propositional linear logic[clarification needed].

## Principle of duality

[edit]

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 ⁠ ∪ {\displaystyle \cup } ⁠ and ⁠ ∩ {\displaystyle \cap } ⁠, while also interchanging ⁠ ∅ {\displaystyle \varnothing } ⁠ and ⁠ U {\displaystyle {\boldsymbol {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 {\displaystyle {\boldsymbol {U}}} ⁠ and ⁠ ∅ {\displaystyle \varnothing } ⁠ 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

[edit]

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

PROPOSITION 3: For any subsets ⁠ A {\displaystyle A} ⁠ and ⁠ B {\displaystyle B} ⁠ of a universe set ⁠ U {\displaystyle {\boldsymbol {U}}} ⁠, the following identities hold:

idempotent laws:

* ⁠ A ∪ A = A {\displaystyle A\cup A=A} ⁠
* ⁠ A ∩ A = A {\displaystyle A\cap A=A} ⁠

domination laws:

* ⁠ A ∪ U = U {\displaystyle A\cup {\boldsymbol {U}}={\boldsymbol {U}}} ⁠
* ⁠ A ∩ ∅ = ∅ {\displaystyle A\cap \varnothing =\varnothing } ⁠

absorption laws:

* ⁠ A ∪ ( A ∩ B ) = A {\displaystyle A\cup (A\cap B)=A} ⁠
* ⁠ A ∩ ( A ∪ B ) = A {\displaystyle A\cap (A\cup 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 {\displaystyle A\cup A} ⁠ | ⁠ = ( A ∪ A ) ∩ U {\displaystyle =(A\cup A)\cap {\boldsymbol {U}}} ⁠ | by the identity law of intersection

|
|

| ⁠ = ( A ∪ A ) ∩ ( A ∪ A ∁ ) {\displaystyle =(A\cup A)\cap (A\cup A^{\complement })} ⁠ | by the complement law for union
| ⁠ = A ∪ ( A ∩ A ∁ ) {\displaystyle =A\cup (A\cap A^{\complement })} ⁠ | by the distributive law of union over intersection
| ⁠ = A ∪ ∅ {\displaystyle =A\cup \varnothing } ⁠ | by the complement law for intersection
| ⁠ = A {\displaystyle =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 {\displaystyle A\cap A} ⁠ | ⁠ = ( A ∩ A ) ∪ ∅ {\displaystyle =(A\cap A)\cup \varnothing } ⁠ | by the identity law for union

|
|

| ⁠ = ( A ∩ A ) ∪ ( A ∩ A ∁ ) {\displaystyle =(A\cap A)\cup (A\cap A^{\complement })} ⁠ | by the complement law for intersection
| ⁠ = A ∩ ( A ∪ A ∁ ) {\displaystyle =A\cap (A\cup A^{\complement })} ⁠ | by the distributive law of intersection over union
| ⁠ = A ∩ U {\displaystyle =A\cap {\boldsymbol {U}}} ⁠ | by the complement law for union
| ⁠ = A {\displaystyle =A} ⁠ | by the identity law for intersection

Intersection can be expressed in terms of set difference:

⁠ A ∩ B = A ∖ ( A ∖ B ) {\displaystyle A\cap B=A\setminus (A\setminus B)} ⁠

## Some additional laws for complements

[edit]

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

PROPOSITION 4: Let ⁠ A {\displaystyle A} ⁠ and ⁠ B {\displaystyle B} ⁠ be subsets of a universe ⁠ U {\displaystyle {\boldsymbol {U}}} ⁠, then:

De Morgan's laws:

* ⁠ ( A ∪ B ) ∁ = A ∁ ∩ B ∁ {\displaystyle (A\cup B)^{\complement }=A^{\complement }\cap B^{\complement }} ⁠
* ⁠ ( A ∩ B ) ∁ = A ∁ ∪ B ∁ {\displaystyle (A\cap B)^{\complement }=A^{\complement }\cup B^{\complement }} ⁠

double complement or involution law:

* ⁠ ( A ∁ ) ∁ = A {\displaystyle (A^{\complement })^{\complement }=A} ⁠

complement laws for the universe set and the empty set:

* ⁠ ∅ ∁ = U {\displaystyle \varnothing ^{\complement }={\boldsymbol {U}}} ⁠
* ⁠ U ∁ = ∅ {\displaystyle {\boldsymbol {U}}^{\complement }=\varnothing } ⁠

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 {\displaystyle A} ⁠ and ⁠ B {\displaystyle B} ⁠ be subsets of a universe ⁠ U {\displaystyle {\boldsymbol {U}}} ⁠, then:

uniqueness of complements:

* If ⁠ A ∪ B = U {\displaystyle A\cup B={\boldsymbol {U}}} ⁠, and ⁠ A ∩ B = ∅ {\displaystyle A\cap B=\varnothing } ⁠, then ⁠ B = A ∁ {\displaystyle B=A^{\complement }} ⁠

## Algebra of inclusion

[edit]

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 {\displaystyle A} ⁠, ⁠ B {\displaystyle B} ⁠ and ⁠ C {\displaystyle C} ⁠ are sets then the following hold:

reflexivity:

* ⁠ A ⊆ A {\displaystyle A\subseteq A} ⁠

antisymmetry:

* ⁠ A ⊆ B {\displaystyle A\subseteq B} ⁠ and ⁠ B ⊆ A {\displaystyle B\subseteq A} ⁠ if and only if ⁠ A = B {\displaystyle A=B} ⁠

transitivity:

* If ⁠ A ⊆ B {\displaystyle A\subseteq B} ⁠ and ⁠ B ⊆ C {\displaystyle B\subseteq C} ⁠, then ⁠ A ⊆ C {\displaystyle A\subseteq 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 {\displaystyle A} ⁠, ⁠ B {\displaystyle B} ⁠ and ⁠ C {\displaystyle C} ⁠ are subsets of a set ⁠ S {\displaystyle S} ⁠ then the following hold:

existence of a least element and a greatest element:

* ⁠ ∅ ⊆ A ⊆ S {\displaystyle \varnothing \subseteq A\subseteq S} ⁠

existence of joins:

* ⁠ A ⊆ A ∪ B {\displaystyle A\subseteq A\cup B} ⁠
* If ⁠ A ⊆ C {\displaystyle A\subseteq C} ⁠ and ⁠ B ⊆ C {\displaystyle B\subseteq C} ⁠, then ⁠ A ∪ B ⊆ C {\displaystyle A\cup B\subseteq C} ⁠

existence of meets:

* ⁠ A ∩ B ⊆ A {\displaystyle A\cap B\subseteq A} ⁠
* If ⁠ C ⊆ A {\displaystyle C\subseteq A} ⁠ and ⁠ C ⊆ B {\displaystyle C\subseteq B} ⁠, then ⁠ C ⊆ A ∩ B {\displaystyle C\subseteq A\cap B} ⁠

The following proposition says that the statement ⁠ A ⊆ B {\displaystyle A\subseteq B} ⁠ is equivalent to various other statements involving unions, intersections and complements.

PROPOSITION 8: For any two sets ⁠ A {\displaystyle A} ⁠ and ⁠ B {\displaystyle B} ⁠, the following are equivalent:

* ⁠ A ⊆ B {\displaystyle A\subseteq B} ⁠
* ⁠ A ∩ B = A {\displaystyle A\cap B=A} ⁠
* ⁠ A ∪ B = B {\displaystyle A\cup B=B} ⁠
* ⁠ A ∖ B = ∅ {\displaystyle A\setminus B=\varnothing } ⁠
* ⁠ B ∁ ⊆ A ∁ {\displaystyle B^{\complement }\subseteq A^{\complement }} ⁠

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

[edit]

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

PROPOSITION 9: For any universe ⁠ U {\displaystyle {\boldsymbol {U}}} ⁠ and subsets ⁠ A {\displaystyle A} ⁠, ⁠ B {\displaystyle B} ⁠ and ⁠ C {\displaystyle C} ⁠ of ⁠ U {\displaystyle {\boldsymbol {U}}} ⁠, the following identities hold:

* ⁠ C ∖ ( A ∩ B ) = ( C ∖ A ) ∪ ( C ∖ B ) {\displaystyle C\setminus (A\cap B)=(C\setminus A)\cup (C\setminus B)} ⁠
* ⁠ C ∖ ( A ∪ B ) = ( C ∖ A ) ∩ ( C ∖ B ) {\displaystyle C\setminus (A\cup B)=(C\setminus A)\cap (C\setminus B)} ⁠
* ⁠ C ∖ ( B ∖ A ) = ( A ∩ C ) ∪ ( C ∖ B ) {\displaystyle C\setminus (B\setminus A)=(A\cap C)\cup (C\setminus B)} ⁠
* ⁠ ( B ∖ A ) ∩ C = ( B ∩ C ) ∖ ( A ∩ C ) = ( B ∩ C ) ∖ A = B ∩ ( C ∖ A ) {\displaystyle (B\setminus A)\cap C=(B\cap C)\setminus (A\cap C)=(B\cap C)\setminus A=B\cap (C\setminus A)} ⁠
* ⁠ ( B ∖ A ) ∪ C = ( B ∪ C ) ∖ ( A ∖ C ) {\displaystyle (B\setminus A)\cup C=(B\cup C)\setminus (A\setminus C)} ⁠
* ⁠ ( B ∖ A ) ∖ C = B ∖ ( A ∪ C ) {\displaystyle (B\setminus A)\setminus C=B\setminus (A\cup C)} ⁠
* ⁠ A ∖ A = ∅ {\displaystyle A\setminus A=\varnothing } ⁠
* ⁠ ∅ ∖ A = ∅ {\displaystyle \varnothing \setminus A=\varnothing } ⁠
* ⁠ A ∖ ∅ = A {\displaystyle A\setminus \varnothing =A} ⁠
* ⁠ B ∖ A = A ∁ ∩ B {\displaystyle B\setminus A=A^{\complement }\cap B} ⁠
* ⁠ ( B ∖ A ) ∁ = A ∪ B ∁ {\displaystyle (B\setminus A)^{\complement }=A\cup B^{\complement }} ⁠
* ⁠ U ∖ A = A ∁ {\displaystyle {\boldsymbol {U}}\setminus A=A^{\complement }} ⁠
* ⁠ A ∖ U = ∅ {\displaystyle A\setminus {\boldsymbol {U}}=\varnothing } ⁠

## See also

[edit]

* σ-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 ) {\displaystyle \wp (X)} ⁠, the power set of ⁠ X {\displaystyle X} ⁠, closed with respect to arbitrary union, finite intersection and containing ⁠ ∅ {\displaystyle \varnothing } ⁠ and ⁠ X {\displaystyle X} ⁠.

## References

[edit]

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

[edit]

* Operations on Sets at ProvenMath

* v
* t
* e

Set theory

Overview|

* Set (mathematics)

Axioms|

* Adjunction
* Choice
* countable
* dependent
* global
* Constructibility (V=L)
* Determinacy
* projective
* Extensionality
* Infinity
* Limitation of size
* Pairing
* Power set
* Regularity
* Union
* Martin's axiom

* Axiom schema
* replacement
* specification

Operations|

* Cartesian product
* Complement (i.e. set difference)
* De Morgan's laws
* Disjoint union
* Identities
* Intersection
* Power set
* Symmetric difference
* Union

* Concepts
* Methods

* Almost
* Cardinality
* Cardinal number (large)
* Class
* Constructible universe
* Continuum hypothesis
* Diagonal argument
* Element
* ordered pair
* tuple
* Family
* Forcing
* One-to-one correspondence
* Ordinal number
* Set-builder notation
* Transfinite induction
* Venn diagram

Set types|

* Amorphous
* Countable
* Empty
* Finite (hereditarily)
* Filter
* base
* subbase
* Ultrafilter
* Fuzzy
* Infinite (Dedekind-infinite)
* Recursive
* Singleton
* Subset · Superset
* Transitive
* Uncountable
* Universal

Theories|

* Alternative
* Axiomatic
* Naive
* Cantor's theorem

* Zermelo
* General
* Principia Mathematica
* New Foundations
* Zermelo–Fraenkel
* von Neumann–Bernays–Gödel
* Morse–Kelley
* Kripke–Platek
* Tarski–Grothendieck

* Paradoxes
* Problems

* Russell's paradox
* Suslin's problem
* Burali-Forti paradox

Set theorists|

* Paul Bernays
* Georg Cantor
* Paul Cohen
* Richard Dedekind
* Abraham Fraenkel
* Kurt Gödel
* Thomas Jech
* John von Neumann
* Willard Quine
* Bertrand Russell
* Thoralf Skolem
* Ernst Zermelo

* v
* t
* e

Mathematical logic

General|

* Axiom
* list
* Cardinality
* First-order logic
* Formal proof
* Formal semantics
* Foundations of mathematics
* Information theory
* Lemma
* Logical consequence
* Model
* Theorem
* Theory
* Type theory

Theorems (list)
and paradoxes|

* Gödel's completeness and incompleteness theorems
* Tarski's undefinability
* Banach–Tarski paradox
* Cantor's theorem, paradox and diagonal argument
* Compactness
* Halting problem
* Lindström's
* Löwenheim–Skolem
* Russell's paradox

Logics|

| Traditional|

* Classical logic
* Logical truth
* Tautology
* Proposition
* Inference
* Logical equivalence
* Consistency
* Equiconsistency
* Argument
* Soundness
* Validity
* Syllogism
* Square of opposition
* Venn diagram

|

Propositional|

* Boolean algebra
* Boolean functions
* Logical connectives
* Propositional calculus
* Propositional formula
* Truth tables
* Many-valued logic
* 3
* finite
* ∞

Predicate|

* First-order
* list
* Second-order
* Monadic
* Higher-order
* Fixed-point
* Free
* Quantifiers
* Predicate
* Monadic predicate calculus

Set theory|

* Set
* hereditary
* Class
* (Ur-)Element
* Ordinal number
* Extensionality
* Forcing
* Relation
* equivalence
* partition
* Set operations:
* intersection
* union
* complement
* Cartesian product
* power set
* identities

Types of sets|

* Countable
* Uncountable
* Empty
* Inhabited
* Singleton
* Finite
* Infinite
* Transitive
* Ultrafilter
* Recursive
* Fuzzy
* Universal
* Universe
* constructible
* Grothendieck
* Von Neumann

Maps and cardinality|

* Function/Map
* domain
* codomain
* image
* In/Sur/Bi-jection
* Schröder–Bernstein theorem
* Isomorphism
* Gödel numbering
* Enumeration
* Large cardinal
* inaccessible
* Aleph number
* Operation
* binary

Set theories|

* Zermelo–Fraenkel
* axiom of choice
* continuum hypothesis
* General
* Kripke–Platek
* Morse–Kelley
* Naive
* New Foundations
* Tarski–Grothendieck
* Von Neumann–Bernays–Gödel
* Ackermann
* Constructive

Formal systems (list),
language and syntax|

* Alphabet
* Arity
* Automata
* Axiom schema
* Expression
* ground
* Extension
* by definition
* conservative
* Relation
* Formation rule
* Grammar
* Formula
* atomic
* closed
* ground
* open
* Free/bound variable
* Language
* Metalanguage
* Logical connective
* ¬
* ∨
* ∧
* →
* ↔
* =
* Predicate
* functional
* variable
* propositional variable
* Proof
* Quantifier
* ∃
* !
* ∀
* rank
* Sentence
* atomic
* spectrum
* Signature
* String
* Substitution
* Symbol
* function
* logical/constant
* non-logical
* variable
* Term
* Theory
* list

Example axiomatic
systems (list)|

* of arithmetic:
* Peano
* second-order
* elementary function
* primitive recursive
* Robinson
* Skolem
* of the real numbers
* Tarski's axiomatization
* of Boolean algebras
* canonical
* minimal axioms
* of geometry:
* Euclidean:
* Elements
* Hilbert's
* Tarski's
* non-Euclidean

* Principia Mathematica

Proof theory|

* Formal proof
* Natural deduction
* Logical consequence
* Rule of inference
* Sequent calculus
* Theorem
* Systems
* axiomatic
* deductive
* Hilbert
* list
* Complete theory
* Independence (from ZFC)
* Proof of impossibility
* Ordinal analysis
* Reverse mathematics
* Self-verifying theories

Model theory|

* Interpretation
* function
* of models
* Model
* equivalence
* finite
* saturated
* spectrum
* submodel
* Non-standard model
* of arithmetic
* Diagram
* elementary
* Categorical theory
* Model complete theory
* Satisfiability
* Semantics of logic
* Strength
* Theories of truth
* semantic
* Tarski's
* Kripke's
* T-schema
* Transfer principle
* Truth predicate
* Truth value
* Type
* Ultraproduct
* Validity

Computability theory|

* Church encoding
* Church–Turing thesis
* Computably enumerable
* Computable function
* Computable set
* Decision problem
* decidable
* undecidable
* P
* NP
* P versus NP problem
* Kolmogorov complexity
* Lambda calculus
* Primitive recursive function
* Recursion
* Recursive set
* Turing machine
* Type theory

Related|

* Abstract logic
* Algebraic logic
* Automated theorem proving
* Category theory
* Concrete/Abstract category
* Category of sets
* History of logic
* History of mathematical logic
* timeline
* Logicism
* Mathematical object
* Philosophy of mathematics
* Supertask

Mathematics portal

Authority control databases: National |

* Czech Republic

|

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template