Difference between revisions of "Sets:Operations"

From Department of Mathematics at UTSA
Jump to navigation Jump to search
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
−
==Definitions==
+
In mathematics, '''the algebra of sets''', not to be confused with the mathematical structure of <em>an</em> 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.
−
The two main set operations that we deal with are union and intersection. The union of two sets <math> A </math> and <math> B </math> is defined as <math> A \cup B = \{x : x\in A </math> or <math> x\in B\} </math>. For example:
 
  
−
* The union of <math> A = \{1, 3, 5, 7, 9\} </math> and <math> B = \{0, 1, 2, 4, 6, 8, 9\} </math> is <math> A \cup B = \{0, 1, 2, 3, 4, 5, 6, 7, 8, 9\} </math>
+
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 <math>\varnothing</math> and the top being the universe set under consideration.
−
* The union of the even integers and odd integers is <math> \Z </math>.
 
−
* The union of the set of rational numbers and the set of irrational numbers is <math> \R </math>.
 
−
* <math> A \cup A = A </math>, and <math> \empty\cup A = A </math>.
 
−
* For sets <math> A </math> and <math> B </math> such that <math> A \subseteq B </math>, <math> A \cup B = B </math>, since all elements of <math> A </math> are already in <math> B </math> if <math> A \subseteq B </math>.
 
  
−
The intersection of <math> A </math> and <math> B </math> is defined as <math> A \cap B = \{x : x\in A </math> and <math> x\in B\} </math>; that is, the intersection of <math> A </math> and <math> B </math> is the set of all elements shared by the two sets. Sets <math> A </math> and <math> B </math> are "disjoint" if <math> A \cap B = \empty </math>.
+
==Fundamentals==
  
−
* The intersection of <math> A = \{1, 3, 5, 7, 9\} </math> and <math> B = \{0, 1, 2, 4, 6, 8, 9\} </math> is <math> A \cap B = \{1, 9\} </math>.
+
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".
−
* The intersection of the even integers and odd integers is the empty set, since no element between these two sets is shared (an integer cannot be both even and odd).
 
−
* <math> A \cap A = A </math>, and <math> \empty\cap A = \empty </math>.
 
−
* For sets <math> A </math> and <math> B </math> such that <math> A \subseteq B </math>, <math> A \cup B = A </math>.
 
  
−
There are a few other common set operations. The set difference of <math> A </math> and <math> B </math> is defined as <math> A\backslash B = \{x : x\in A, x\not\in B\} </math>. We read <math> A\backslash B </math> (also sometimes denoted as <math> A-B </math>) as "<math> A </math> without <math> B </math>". Note that this operation is not commutative; that is, <math> A\backslash B </math> does not equal <math> B\backslash A </math> in most cases. Example: if <math> A = \{1, 2, 3, 4, 5\} </math> and <math> B = \{0, 1, 3, 4, 5, 6\} </math>, then <math> A\backslash B = \{2\} </math> and <math> B\backslash A = \{0, 6\} </math>.
+
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.
  
−
Another set operation is the Cartesian product (or the product of two sets). The Cartesian product of two sets <math> A </math> and <math> B </math> is defined as <math> A\times B = \{(a, b): a\in A </math> and <math> b\in B\} </math>, where <math> (a,b) </math> is an ordered pair. For example, if <math> A = \{1, 2, 3\} </math> and <math> B = \{0, 1\} </math>, then <math> A\times B = \{(1,0), (1,1), (2,0), (2,1), (3,0), (3, 1)\} </math>. The number of elements in the Cartesian product <math> A\times B </math> is the product of the number of elements in set <math> A </math> and set <math> B </math> (for example, if <math> A </math> has 3 elements and <math> B </math> has 2, then <math> A\times B </math> has 6).
+
==The fundamental properties of set algebra==
 +
 
 +
The binary operations of set union (<math>\cup</math>) and intersection (<math>\cap</math>) satisfy many identities. Several of these identities or "laws" have well established names.
 +
 
 +
:Commutative property:
 +
::*<math>A \cup B = B \cup A</math>
 +
::*<math>A \cap B = B \cap A</math>
 +
:Associative property:
 +
::*<math>(A \cup B) \cup C = A \cup (B \cup C)</math>
 +
::*<math>(A \cap B) \cap C = A \cap (B \cap C)</math>
 +
:Distributive property:
 +
::*<math>A \cup (B \cap C) = (A \cup B) \cap (A \cup C)</math>
 +
::*<math>A \cap (B \cup C) = (A \cap B) \cup (A \cap C)</math>
 +
 
 +
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 <math>U</math>; together with the complement operator (<math>A^C</math> denotes the complement of <math>A</math>. This can also be written as <math>A'</math>, read as A prime).  The empty set has no members, and the universe set has all possible members (in a particular context).
 +
 
 +
:Identity :
 +
::*<math>A \cup \varnothing = A</math>
 +
::*<math>A \cap U = A</math>
 +
:Complement :
 +
::*<math>A \cup A^C = U</math>
 +
::*<math>A \cap A^C = \varnothing</math>
 +
 
 +
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&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 <math> (A^C)^C = A </math>, then this is exactly the algebra of propositional linear logic.
 +
 
 +
==The principle of duality==
 +
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 universe set '''U''', the following identities hold:
 +
:idempotent laws:
 +
::*<math>A \cup A = A</math>
 +
::*<math>A \cap A = A</math>
 +
:domination laws:
 +
::*<math>A \cup U = U</math>
 +
::*<math>A \cap \varnothing = \varnothing</math>
 +
:absorption laws:
 +
::*<math>A \cup (A \cap B) = A</math>
 +
::*<math>A \cap (A \cup B) = A</math>
 +
 
 +
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:''
 +
{|
 +
|-
 +
|<math>A \cup A</math>
 +
|<math>=(A \cup A) \cap U</math>
 +
|by the identity law of intersection
 +
|-
 +
|
 +
|<math>=(A \cup A) \cap (A \cup A^C)</math>
 +
|by the complement law for union
 +
|-
 +
|
 +
|<math>=A \cup (A \cap A^C)</math>
 +
|by the distributive law of union over intersection
 +
|-
 +
|
 +
|<math>=A \cup \varnothing</math>
 +
|by the complement law for intersection
 +
|-
 +
|
 +
|<math>=A</math>
 +
|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:''
 +
{|
 +
|-
 +
|<math>A \cap A</math>
 +
|<math>=(A \cap A) \cup \varnothing</math>
 +
|by the identity law for union
 +
|-
 +
|
 +
|<math>=(A \cap A) \cup (A \cap A^C)</math>
 +
|by the complement law for intersection
 +
|-
 +
|
 +
|<math>=A \cap (A \cup A^C)</math>
 +
|by the distributive law of intersection over union
 +
|-
 +
|
 +
|<math>=A \cap U</math>
 +
|by the complement law for union
 +
|-
 +
|
 +
|<math>=A</math>
 +
|by the identity law for intersection
 +
|}
 +
 
 +
Intersection can be expressed in terms of set difference :
 +
 
 +
<math>A \cap B = A \setminus (A \setminus B) </math>
 +
 
 +
== 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:
 +
::*<math>(A \cup B)^C = A^C \cap B^C</math>
 +
::*<math>(A \cap B)^C = A^C \cup B^C</math>
 +
:double complement or involution law:
 +
::*<math>{(A^{C})}^{C} = A</math>
 +
:complement laws for the universe set and the empty set:
 +
::*<math>\varnothing^C = U</math>
 +
::*<math>U^C = \varnothing</math>
 +
 
 +
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 <math>A \cup B = U</math>, and <math>A \cap B = \varnothing</math>, then <math>B = A^C</math>
 +
 
 +
==The 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:
 +
::*<math>A \subseteq A</math>
 +
 
 +
:antisymmetry:
 +
::*<math>A \subseteq B</math> and <math>B \subseteq A</math> if and only if <math>A = B</math>
 +
 
 +
:transitivity:
 +
::*If <math>A \subseteq B</math> and <math>B \subseteq C</math>, then <math>A \subseteq C</math>
 +
 
 +
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:
 +
::*<math> \varnothing \subseteq A \subseteq S</math>
 +
 
 +
:existence of joins:
 +
::*<math>A \subseteq A \cup B</math>
 +
::*If <math>A \subseteq C</math> and <math>B \subseteq C</math>, then <math>A \cup B \subseteq C</math>
 +
 
 +
:existence of meets:
 +
::*<math>A \cap B \subseteq A</math>
 +
::*If <math>C \subseteq A</math> and <math>C \subseteq B</math>, then <math>C \subseteq A \cap B</math>
 +
 
 +
The following proposition says that the statement <math>A \subseteq B</math> is equivalent to various other statements involving unions, intersections and complements.
 +
 
 +
'''PROPOSITION 8''': For any two sets ''A'' and ''B'', the following are equivalent:
 +
:*<math>A \subseteq B</math>
 +
:*<math>A \cap B = A</math>
 +
:*<math>A \cup B = B</math>
 +
:*<math>A \setminus B = \varnothing</math>
 +
:*<math>B^C \subseteq A^C</math>
 +
 
 +
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:
 +
 
 +
:*<math>C \setminus (A \cap B) = (C \setminus A) \cup (C \setminus B)</math>
 +
:*<math>C \setminus (A \cup B) = (C \setminus A) \cap (C \setminus B)</math>
 +
:*<math>C \setminus (B \setminus A) = (A \cap C)\cup(C \setminus B)</math>
 +
:*<math>(B \setminus A) \cap C = (B \cap C) \setminus A = B \cap (C \setminus A)</math>
 +
:*<math>(B \setminus A) \cup C = (B \cup C) \setminus (A \setminus C)</math>
 +
:*<math>(B \setminus A) \setminus C = B \setminus (A \cup C)</math>
 +
:*<math>A \setminus A = \varnothing</math>
 +
:*<math>\varnothing \setminus A = \varnothing</math>
 +
:*<math>A \setminus \varnothing = A</math>
 +
:*<math>B \setminus A = A^C \cap B</math>
 +
:*<math>(B \setminus A)^C = A \cup B^C</math>
 +
:*<math>U \setminus A = A^C</math>
 +
:*<math>A \setminus U = \varnothing</math>
  
 
==Resources==
 
==Resources==
 
* [https://link-springer-com.libweb.lib.utsa.edu/content/pdf/10.1007%2F978-1-4419-7127-2.pdf Course Textbook], pages 101-115
 
* [https://link-springer-com.libweb.lib.utsa.edu/content/pdf/10.1007%2F978-1-4419-7127-2.pdf Course Textbook], pages 101-115
 +
 +
== Licensing ==
 +
Content obtained and/or adapted from:
 +
* [https://en.wikipedia.org/wiki/Algebra_of_sets Algebra of sets, Wikipedia] under a CC BY-SA license

Latest revision as of 20:27, 4 February 2022

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.

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

Commutative property:
Associative property:
Distributive property:

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 ; together with the complement operator ( denotes the complement of . This can also be written as , read as A prime). The empty set has no members, and the universe set has all possible members (in a particular context).

Identity :
Complement :

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 , then this is exactly the algebra of propositional linear logic.

The principle of duality

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 universe 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 above. 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 universe 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:

uniqueness of complements:
  • If , and , then

The 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:
antisymmetry:
  • and if and only if
transitivity:
  • If and , then

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:
  • If and , then
existence of meets:
  • If and , then

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:

Resources

Licensing

Content obtained and/or adapted from:

Retrieved from "https://mathresearch.utsa.edu/wiki/index.php?title=Sets:Operations&oldid=4651"