|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| The '''algebra of sets''' defines the properties and laws of [[Set (mathematics)|sets]], the set-theoretic 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.
| | I enjoy bilingual network marketing, spending time with family and friends and developing relationships via social media. I have been an avid network marketer for the past 5 years and believe that earning an annuity or [http://Www.dict.cc/englisch-deutsch/recurring+income.html recurring income] is the key. This means that you need to invest time, money and effort in a good system in a [http://Www.dict.cc/englisch-deutsch/lucrative+industry.html lucrative industry]. I am certain we have it here. This is best value for money system and tools system I have seen as yet! I will work with you if you want to make it happen for you<br><br>my blog; [https://www.youtube.com/watch?v=kSmFBM6qIO4&list=UUg3DMmhiHy97o2DJARM9TRQ my lead system pro/mlm leads/attraction marketing/mlm network marketing/mlm marketing/mlm lead generation system/ mlm business/my lead system pro network/affiliate marketing/mlm vs affiliate/video email marketing/capture pages/anding pages/mlm landing page/] |
| | |
| 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'', and the complement operator being ''set complement''.
| |
| | |
| ==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]].
| |
| | |
| ==The fundamental laws of set algebra==<!-- This section is linked from [[Subset]] -->
| |
| | |
| The [[binary operation]]s of set [[Union (set theory)|union]] (<math>\cup</math>) and [[intersection (set theory)|intersection]] (<math>\cap</math>) satisfy many [[identity (mathematics)|identities]]. Several of these identities or "laws" have well established names.
| |
| | |
| :[[commutative operation|Commutative]] laws:
| |
| ::*<math>A \cup B = B \cup A\,\!</math>
| |
| ::*<math>A \cap B = B \cap A\,\!</math>
| |
| :[[associativity|Associative]] laws:
| |
| ::*<math>(A \cup B) \cup C = A \cup (B \cup C)\,\!</math>
| |
| ::*<math>(A \cap B) \cap C = A \cap (B \cap C)\,\!</math>
| |
| :[[distributivity|Distributive]] laws:
| |
| ::*<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 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]] <math>U</math>; together with the [[complement (set theory)|complement]] operator. The empty set has no members, and the universal set has all possible members (in a particular context).
| |
| | |
| :Identity laws:
| |
| ::*<math>A \cup \varnothing = A\,\!</math>
| |
| ::*<math>A \cap U = A\,\!</math>
| |
| :Complement laws:
| |
| ::*<math>A \cup A^C = U\,\!</math>
| |
| ::*<math>A \cap A^C = \varnothing\,\!</math>
| |
| | |
| The identity laws (together with the commutative laws) say that, just like 0 and 1 for addition and multiplication, Ø and '''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 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 <math> (A^C)^C = A </math>, 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}}.
| |
| | |
| ==The 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 ∪ 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 [[subset]]s ''A'' and ''B'' of a universal 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 law]]s: | |
| ::*<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 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 (and union):
| |
| | |
| <math>A \cap B\,\! = A \smallsetminus (A \smallsetminus B) = ((A \cup B) \smallsetminus (A \smallsetminus B)) \smallsetminus (B \smallsetminus A)</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 [[subset]]s 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 (mathematics)|Involution]] law:
| |
| ::*<math>{(A^{C})}^{C} = A\,\!</math>
| |
| :complement laws for the universal 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 is a [[partial order]].
| |
| | |
| '''PROPOSITION 6''': If ''A'', ''B'' and ''C'' are sets then the following hold:
| |
| | |
| :[[reflexive relation|reflexivity]]:
| |
| ::*<math>A \subseteq A\,\!</math>
| |
| | |
| :[[antisymmetric relation|antisymmetry]]:
| |
| ::*<math>A \subseteq B\,\!</math> and <math>B \subseteq A\,\!</math> if and only if <math>A = B\,\!</math>
| |
| | |
| :[[transitive relation|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 [[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 ''A'', ''B'' and ''C'' are subsets of a set ''S'' then the following hold:
| |
| | |
| :existence of a [[greatest element|least element]] and a [[greatest element]]:
| |
| ::*<math>\varnothing \subseteq A \subseteq S\,\!</math>
| |
| | |
| :existence of [[lattice (order)|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 [[lattice (order)|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 \smallsetminus 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 [[Complement (set theory)|relative complements]] or set-theoretic difference.
| |
| | |
| '''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>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>
| |
| | |
| ==See also==
| |
| *[[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. [http://books.google.com/books?id=3-nrPB7BQKMC&pg=PA16#v=onepage&q&f=false "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. [http://books.google.com/books?id=UfdossHPlkgC&pg=PA17-IA8&dq=%22algebra+of+sets%22&hl=en&ei=k8-RTdXoF4K2tgfM-p1v&sa=X&oi=book_result&ct=result&resnum=3&ved=0CDYQ6AEwAg#v=onepage&q=%22algebra%20of%20sets%22&f=false "SUPPLEMENT TO CHAPTER II THE ALGEBRA OF SETS"]
| |
| | |
| ==External links==
| |
| *[http://www.apronus.com/provenmath/btheorems.htm Operations on Sets at ProvenMath]
| |
| | |
| [[Category:Basic concepts in set theory]]
| |
| | |
| [[bn:সেটের অ্যালজেব্রা]]
| |
| [[es:Álgebra de conjuntos]]
| |
| [[fa:جبر مجموعهها]]
| |
| [[nl:Algebra van verzamelingen]]
| |
| [[ja:集合代数]]
| |
| [[ru:Алгебра множеств]]
| |
| [[uk:Алгебра множин]]
| |