Editing Algebra of sets

{{short description|Identities and relationships involving sets}}
{{about|algebraic properties of set operations in general|a boolean algebra of sets|Field of sets}}
{{more footnotes needed|date=April 2023}}
<!-------------------
Before changing the first sentence: 
The terminology "an algebra of sets" is much more well known than "the algebra of sets" (as described on this article's talk page). As a rule, a reader should be able to figure out just by reading the first sentence of the lead whether or not they are at the right article. So readers should be clearly informed that this article is not about "an algebra of sets".
See [[MOS:LEADSENTENCE]] and [[Wikipedia:Summary style]]
------------------->
In [[mathematics]], '''the algebra of sets''', not to be confused with the [[mathematical structure]] of [[Field of sets|''an'' algebra of sets]], defines the properties and laws of [[Set (mathematics)|sets]], the set-theoretic [[operation (mathematics)|operations]] of [[union (set theory)|union]], [[intersection (set theory)|intersection]], and [[complement (set theory)|complementation]] and the [[binary relation|relations]] of set [[equality (mathematics)|equality]] and set [[subset|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 (structure)|Boolean algebra]] with the join operator being ''union'', the meet operator being ''intersection'', the complement operator being ''set complement'', the bottom being {{tmath|1= \varnothing }} and the top being the [[universe (mathematics)|universe]] set under consideration.

== Fundamentals ==

The algebra of sets is the set-theoretic analogue of the algebra of numbers. Just as arithmetic [[addition]] and [[multiplication]] are [[associativity|associative]] and [[commutativity|commutative]], so are set union and intersection; just as the arithmetic relation "less than or equal" is [[Reflexive relation|reflexive]], [[Antisymmetric relation|antisymmetric]] and [[transitive relation|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 [[Set (mathematics)|sets]], for a fuller account see [[naive set theory]], and for a full rigorous [[axiom]]atic treatment see [[axiomatic set theory]].

== Fundamental properties of set algebra ==
<!-- This section is linked from [[Subset]] -->

The [[binary operation]]s of set [[Union (set theory)|union]] ({{tmath|1= \cup }}) and [[intersection (set theory)|intersection]] ({{tmath|1= \cap }}) satisfy many [[identity (mathematics)|identities]]. Several of these identities or "laws" have well established names.{{refn|Many mathematicians<ref>{{cite book | author=Paul R. Halmos | title=Naive Set Theory | location=Princeton | publisher=Nostrand | year=1968 }} Here: Sect.4</ref> assume all set operation to be of equal [[operator priority|priority]], and make full use of parentheses. So does this article.}}
: [[Commutative property]]:
:* {{tmath|1= A \cup B = B \cup A }}
:* {{tmath|1= A \cap B = B \cap A }}
: [[Associative property]]:
:* {{tmath|1= (A \cup B) \cup C = A \cup (B \cup C) }}
:* {{tmath|1= (A \cap B) \cap C = A \cap (B \cap C) }}
: [[Distributive property]]:
:* {{tmath|1= A \cup (B \cap C) = (A \cup B) \cap (A \cup C) }}
:* {{tmath|1= 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]] {{tmath|1= \varnothing }} and the [[universe (mathematics)|universe set]] {{tmath|1= \boldsymbol{U} }}; together with the [[complement (set theory)|complement]] operator ({{tmath|1= A^\complement }} denotes the complement of {{tmath|1= A }}. This can also be written as {{tmath|1= A' }}, read as "A prime").  The empty set has no members, and the universe set has all possible members (in a particular context).
: Identity:
:* {{tmath|1= A \cup \varnothing = A }}
:* {{tmath|1= A \cap \boldsymbol{U} = A }}
: Complement:
:* {{tmath|1= A \cup A^\complement = \boldsymbol{U} }}
:* {{tmath|1= A \cap A^\complement = \varnothing }}

The identity expressions (together with the commutative expressions) say that, just like 0 and 1 for addition and  multiplication, {{tmath|1= \varnothing }} and {{tmath|1= \boldsymbol{U} }} are the [[identity element]]s for union and intersection, respectively.

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

The preceding five pairs of formulae&mdash;the commutative, associative, distributive, identity and complement formulae&mdash;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 {{tmath|1= (A^\complement)^\complement = A }}, then this is exactly the algebra of propositional [[linear logic]]{{clarify|reason=Explain which set operator corresponds to which linear-logic operator. Linear logic seems to have much more operators than a boolean algebra, but the section 'Algebraic semantics' of the 'linear logic' article is still unwritten.|date=August 2013}}.

== Principle of duality ==
<!-- linked from redirect [[Duality principle for sets]] -->
{{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 {{tmath|1= \cup }} and {{tmath|1= \cap }}, while also interchanging {{tmath|1= \varnothing }} and {{tmath|1= \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 {{tmath|1= \boldsymbol{U} }} and {{tmath|1= \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 ==

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

'''PROPOSITION 3''': For any [[subset]]s {{tmath|1= A }} and {{tmath|1= B }} of a universe set {{tmath|1= \boldsymbol{U} }}, the following identities hold:
: [[idempotent]] laws:
:* {{tmath|1= A \cup A = A }}
:* {{tmath|1= A \cap A = A }}
: domination laws:
:* {{tmath|1= A \cup \boldsymbol{U} = \boldsymbol{U} }}
:* {{tmath|1= A \cap \varnothing = \varnothing }}
: [[absorption law]]s:
:* {{tmath|1= A \cup (A \cap B) = A }}
:* {{tmath|1= 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<!--- in proposition 1 and proposition 2--->.  As an illustration, a proof is given below for the idempotent law for union.

''Proof:''
{|
|-
 | {{tmath|1= A \cup A }}
 | {{tmath|1= =(A \cup A) \cap \boldsymbol{U} }}
 | by the identity law of intersection
|-
 |
 | {{tmath|1= =(A \cup A) \cap (A \cup A^\complement) }}
 | by the complement law for union
|-
 |
 | {{tmath|1= =A \cup (A \cap A^\complement) }}
 | by the distributive law of union over intersection
|-
 |
 | {{tmath|1= =A \cup \varnothing }}
 | by the complement law for intersection
|-
 |
 | {{tmath|1= =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:''
{|
|-
 | {{tmath|1= A \cap A }}
 | {{tmath|1= =(A \cap A) \cup \varnothing }}
 | by the identity law for union
|-
 |
 | {{tmath|1= =(A \cap A) \cup (A \cap A^\complement) }}
 | by the complement law for intersection
|-
 |
 | {{tmath|1= =A \cap (A \cup A^\complement) }}
 | by the distributive law of intersection over union
|-
 |
 | {{tmath|1= =A \cap \boldsymbol{U} }}
 | by the complement law for union
|-
 |
 | {{tmath|1= =A }}
 | by the identity law for intersection
|-
|}

Intersection can be expressed in terms of set difference:
: {{tmath|1= A \cap B = A \setminus (A \setminus B) }}

== Some additional laws for complements ==

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

'''PROPOSITION 4''': Let {{tmath|1= A }} and {{tmath|1= B }} be [[subset]]s of a universe {{tmath|1= \boldsymbol{U} }}, then:
: [[De Morgan's laws]]:
:* {{tmath|1= (A \cup B)^\complement = A^\complement \cap B^\complement }}
:* {{tmath|1= (A \cap B)^\complement = A^\complement \cup B^\complement }}
: double complement or [[Involution (mathematics)|involution]] law:
:* {{tmath|1= (A^\complement)^\complement = A }}
: complement laws for the universe set and the empty set:
:* {{tmath|1= \varnothing^\complement = \boldsymbol{U} }}
:* {{tmath|1= \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 {{tmath|1= A }} and {{tmath|1= B }} be subsets of a universe {{tmath|1= \boldsymbol{U} }}, then:
: uniqueness of complements:
:* If {{tmath|1= A \cup B = \boldsymbol{U} }}, and {{tmath|1= A \cap B = \varnothing }}, then {{tmath|1= B = A^\complement }}

== Algebra of inclusion ==

The following proposition says that [[Subset|inclusion]], that is the [[binary relation]] of one set being a subset of another, is a [[partial order]].

'''PROPOSITION 6''': If {{tmath|1= A }}, {{tmath|1= B }} and {{tmath|1= C }} are sets then the following hold:
: [[reflexive relation|reflexivity]]:
:* {{tmath|1= A \subseteq A }}
: [[antisymmetric relation|antisymmetry]]:
:* {{tmath|1= A \subseteq B }} and {{tmath|1= B \subseteq A }} if and only if {{tmath|1= A = B }}
: [[transitive relation|transitivity]]:
:* If {{tmath|1= A \subseteq B }} and {{tmath|1= B \subseteq C }}, then {{tmath|1= A \subseteq C}}

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

'''PROPOSITION 7''': If {{tmath|1= A }}, {{tmath|1= B }} and {{tmath|1= C }} are subsets of a set {{tmath|1= S }} then the following hold:
: existence of a [[greatest element|least element]] and a [[greatest element]]:
:* {{tmath|1= \varnothing \subseteq A \subseteq S }}
: existence of [[lattice (order)|joins]]:
:* {{tmath|1= A \subseteq A \cup B }}
:* If {{tmath|1= A \subseteq C }} and {{tmath|1= B \subseteq C }}, then {{tmath|1= A \cup B \subseteq C }}
: existence of [[lattice (order)|meets]]:
:* {{tmath|1= A \cap B \subseteq A }}
:* If {{tmath|1= C \subseteq A }} and {{tmath|1= C \subseteq B }}, then {{tmath|1= C \subseteq A \cap B }}

The following proposition says that the statement {{tmath|1= A \subseteq B }} is equivalent to various other statements involving unions, intersections and complements.

'''PROPOSITION 8''': For any two sets {{tmath|1= A }} and {{tmath|1= B }}, the following are equivalent:
:* {{tmath|1= A \subseteq B }}
:* {{tmath|1= A \cap B = A }}
:* {{tmath|1= A \cup B = B }}
:* {{tmath|1= A \setminus B = \varnothing }}
:* {{tmath|1= 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 ==

The following proposition lists several identities concerning [[Complement (set theory)|relative complements]] and set-theoretic differences.

'''PROPOSITION 9''': For any universe {{tmath|1= \boldsymbol{U} }} and subsets {{tmath|1= A }}, {{tmath|1= B }} and {{tmath|1= C }} of {{tmath|1= \boldsymbol{U} }}, the following identities hold:
:* {{tmath|1= C \setminus (A \cap B) = (C \setminus A) \cup (C \setminus B) }}
:* {{tmath|1= C \setminus (A \cup B) = (C \setminus A) \cap (C \setminus B) }}
:* {{tmath|1= C \setminus (B \setminus A) = (A \cap C)\cup(C \setminus B) }}
:* {{tmath|1= (B \setminus A) \cap C = (B \cap C) \setminus (A \cap C) = (B \cap C) \setminus A = B \cap (C \setminus A) }}
:* {{tmath|1= (B \setminus A) \cup C = (B \cup C) \setminus (A \setminus C) }}
:* {{tmath|1= (B \setminus A) \setminus C = B \setminus (A \cup C) }}
:* {{tmath|1= A \setminus A = \varnothing }}
:* {{tmath|1= \varnothing \setminus A = \varnothing }}
:* {{tmath|1= A \setminus \varnothing = A }}
:* {{tmath|1= B \setminus A = A^\complement \cap B }}
:* {{tmath|1= (B \setminus A)^\complement = A \cup B^\complement }}
:* {{tmath|1= \boldsymbol{U} \setminus A = A^\complement }}
:* {{tmath|1= A \setminus \boldsymbol{U} = \varnothing }}

== See also ==

* [[σ-algebra]] is an algebra of sets, completed to include countably infinite operations.
* [[Axiomatic set theory]]
* {{slink|Image (mathematics)#Properties}}
* [[Field of sets]]
* [[List of set identities and relations]]
* [[Naive set theory]]
* [[Set (mathematics)]]
* [[Topological space#Definitions|Topological space]] &mdash; a subset of {{tmath|1= \wp(X) }}, the power set of {{tmath|1= X }}, closed with respect to arbitrary union, finite intersection and containing {{tmath|1= \varnothing }} and {{tmath|1= X }}.

== References ==

{{reflist}}
* Stoll, Robert R.; ''Set Theory and Logic'', Mineola, N.Y.: Dover Publications (1979) {{ISBN|0-486-63829-4}}. [https://books.google.com/books?id=3-nrPB7BQKMC&pg=PA16 "The Algebra of Sets", pp 16&mdash;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}}. [https://books.google.com/books?id=UfdossHPlkgC&dq=%22algebra+of+sets%22&pg=PA17-IA8 "SUPPLEMENT TO CHAPTER II THE ALGEBRA OF SETS"].

== External links ==

* [http://www.apronus.com/provenmath/btheorems.htm Operations on Sets at ProvenMath]

{{Set theory}}
{{Mathematical logic}}
{{Authority control}}

[[Category:Basic concepts in set theory]]
[[Category:Operations on sets| ]]