Set
26691
225896243
2008-07-15T22:24:09Z
Trovatore
310173
I think the point of "considered as a whole" was not about unifying principles, but about saying that a set is an individual, distinguishing set theory from [[mereology]]. Is this wording better?
{{this|mathematical sets}}
:''This article gives an introduction to what mathematicians call "intuitive" or "naive" set theory; for a more detailed account see [[Naive set theory]]. For a rigorous modern [[axiom]]atic treatment of sets, see [[Axiomatic set theory]].''
A '''set''' is a collection of distinct objects, considered as an object in its own right. Sets are one of the most fundamental [[concept]]s in [[mathematics]]. The study of the structure of sets, [[set theory]], is rich and ongoing. Although it was invented at the end of the 19th century, set theory is now a ubiquitous part of mathematics, and can be used as a foundation from which nearly all of mathematics can be derived. In [[mathematics education]], elementary topics such as [[Venn diagram]]s taught at a young age, while more advanced concepts are taught as part of a university degree.
In [[philosophy]], sets are ordinarily considered to be [[abstract object]]s <ref>Rosen, Gideon, "Abstract Objects", The Stanford Encyclopedia of Philosophy (Spring 2006 Edition), Edward N. Zalta (ed.), [http://plato.stanford.edu/archives/spr2006/entries/abstract-objects]</ref><ref>Partee, Barbara Hall; ter Meulen, Alice G. B.; Mathematical Methods in Linguistics, [http://books.google.com/books?id=qV7TUuaYcUIC&pg=PA7&lpg=PA7&dq=%22set+is+an+abstract%22&source=web&ots=UPMpt1TlEa&sig=b6b4aEJcoN89_dZFrMBPljs8BP4]</ref>
<ref>Brown, James Cooke; Sets and Multiples, [http://www.loglan.org/Articles/sets-and-multiples.html]</ref>
<ref>Goldstein, Laurence; "Representation and geometrical methods of problem solving", Forms of Representation: an Interdisciplinary Theme for Cognitive Science, Donald Peterson, ed.,. Exeter: Intellect Books, 1996. [http://books.google.com/books?id=uHZv4jJItOAC&pg=PA79&lpg=PA79&dq=%22set+is+an+abstract%22&source=web&ots=iaARLqMrUt&sig=It38nuOqApr-3LleBi1cWlr6rv8]</ref>
the physical [[Type-token distinction|tokens]] of which are, for instance; three cups on a table when spoken of together as "''the'' cups", or the chalk lines on a board in the form of the opening and closing curly bracket [[symbol]]s along with any other symbols in between the two bracket symbols. However, proponents of [[mathematical realism]] including [[Penelope Maddy]] have argued that sets are [[concrete objects]].
[[Image:Venn A intersect B.svg|right|thumb|The ''intersection'' of two sets is made up of the objects contained in both sets, shown in a [[Venn diagram]].]]
==Definition==
At the beginning of his ''Beiträge zur Begründung der transfiniten Mengenlehre'', [[Georg Cantor]], the principal creator of set theory, gave the following definition of a set:<ref>Quoted in Dauben, p. 170.</ref>
{{quote|By a "set" we mean any collection ''M'' into a whole of definite, distinct objects ''m'' (which are called the "elements" of ''M'') of our perception [Anschauung] or of our thought.}}
The [[element (mathematics)|element]]s of a set, also called its ''members'', can be anything: numbers, people, letters of the alphabet, other sets, and so on. Sets are conventionally denoted with [[capital letters]]. The statement that sets ''A'' and ''B'' are equal means that they have precisely the same members (i.e., every member of ''A'' is also a member of ''B'' and vice versa).
Unlike a [[multiset]], every element of a set must be unique; no two members may be identical. All set operations preserve the property that each element of the set is unique. The order in which the elements of a set are listed is irrelevant, unlike a [[sequence]] or [[tuple]].
==Describing sets==
There are two ways of describing, or specifying the members of, a set. One way is by [[intensional definition]], using a rule or [[semantic]] description. See this example:
:''A'' is the set whose members are the first four positive [[integer]]s.
:''B'' is the set of colors of the [[Flag of France|French flag]].
The second way is by [[extension (semantics)|extension]], that is, listing each member of the set. An [[extensional definition]] is notated by enclosing the list of members in [[bracket|brace]]s:
:''C'' = {4, 2, 1, 3}
:''D'' = {blue, white, red}
The order in which the elements of a set are listed in an extensional definition is irrelevant, as are any repetitions in the list. For example,
:{6, 11} = {11, 6} = {11, 11, 6, 11}
are equivalent, because the extensional specification means merely that each of the elements listed is a member of the set.
For sets with many elements, the enumeration of members can be abbreviated. For instance, the set of the first thousand positive whole numbers may be specified extensionally as:
:{1, 2, 3, ..., 1000},
where the [[ellipsis]] ("...") indicates that the list continues in the obvious way. Ellipses may also be used where sets have infinitely many members. Thus the set of positive [[even number]]s can be written as {2, 4, 6, 8, ... }.
The notation with braces may also be used in an intensional specification of a set. In this usage, the braces have the meaning "the set of all ..." So ''E'' = {playing-card suits} is the set whose four members are ♠, ♦, ♥, and ♣. A more general form of this is [[set-builder notation]], through which, for instance, the set ''F'' of the twenty smallest integers that are four less than [[perfect square]]s can be denoted:
:''F'' = { ''n''<sup>2</sup> − 4 ''':''' ''n'' is an integer; and 0 ≤ ''n'' ≤ 19}
In this notation, the [[Colon (punctuation)|colon]] (":") means "such that", and the description can be interpreted as "''F'' is the set of all numbers of the form ''n''<sup>2</sup> − 4, such that ''n'' is a whole number in the range from 0 to 19 inclusive." Sometimes the [[vertical bar]] ("|") is used instead of the colon.
One often has the choice of specifying a set intensionally or extensionally. In the examples above, for instance, ''A'' = ''C'' and ''B'' = ''D''.
==Membership==
{{main|Element (mathematics)}}
If something is or is not an element of a particular set then this is symbolised by ∈ and ∉ respectively. So, with respect to the sets defined above:
:*4 ∈ ''A'' and 285 ∈ ''F'' (since 285 = 17² − 4); but
:*9 ∉ ''F'' and green ∉ ''B''.
==Cardinality==
{{main|Cardinality}}
The cardinality |''S''| of a set ''S'' is "the number of members of ''S''." For example, since the French flag has three colors, |''B''| = 3.
There is a set with no members and zero cardinality, which is called the ''[[empty set]]'' (or the ''null set'') and is denoted by the symbol ø. For example, the set ''A'' of all three-sided squares has zero members (|''A''| = 0), and thus ''A'' = ø. Though, like the [[0 (number)|number zero]], it may seem trivial, the empty set is quite important in mathematics. The existence of this set is one of the fundamental concepts of [[axiomatic set theory]].
Some sets have [[Infinite set|infinite]] cardinality. The set '''N''' of [[natural number]]s, for instance, is infinite. Some infinite cardinalities are greater than others. For instance, the set of [[real number]]s has greater cardinality than the set of natural numbers. However, it can be shown that the cardinality of (which is to say, the number of points on) a [[straight line]] is the same as the cardinality of any [[line segment|segment]] of that line, of an entire [[plane (mathematics)|plane]], and indeed of any [[Euclidean space]].
==Subsets==
{{main|Subset}}
If every member of set ''A'' is also a member of set ''B'', then ''A'' is said to be a ''subset'' of ''B'', written <math>A \subseteq B</math> (also pronounced ''A is contained in B''). Equivalently, we can write <math>B \supseteq A</math>, read as ''B is a superset of A'', ''B includes A'', or ''B contains A''. The [[relation (mathematics)|relationship]] between sets established by <math>\subseteq</math> is called ''inclusion'' or ''containment''.
If ''A'' is a subset of, but not equal to, ''B'', then ''A'' is called a ''proper subset'' of ''B'', written <math>A \subsetneq B</math> (''A is a proper subset of B'') or <math>B \supsetneq A</math> (''B is proper superset of A'').
Note that the expressions <math>A\subset B</math> and <math>A\supset B</math> are used differently by different authors; some authors use them to mean the same as <math>A\subseteq B</math> (respectively <math>A\supseteq B</math>), whereas other use them to mean the same as <math>A\subsetneq B</math> (respectively <math>A\supsetneq B</math>).
<div style="float:right;margin:1em;">[[Image:Venn A subset B.svg|150px|center|A is a subset of B]]<center><small> ''A'' is a '''subset''' of ''B''</small></center></div>
Example:
:*The set of all men is a [[Subset|proper subset]] of the set of all people.
:*<math>\{1,3\} \subsetneq \{1,2,3,4\}</math>
:*<math>\{1, 2, 3, 4\} \subseteq \{1,2,3,4\}.</math>
The empty set is a subset of every set and every set is a subset of itself:
:*<math>\emptyset \subseteq A</math>
:*<math>A \subseteq A.</math>
An obvious but very handy identity, which can often be used to show that two seemingly different sets are equivalent:
:*''A'' = ''B'' [[if and only if]] ''A'' ⊆ ''B'' and ''B'' ⊆ ''A''
===Power set===
{{main|Power set}}
The power set of a set ''S'' can be defined as the set of all subsets of ''S''. This includes the subsets formed from the members of ''S'' and the empty set. If a finite set ''S'' has cardinality ''n'' then the power set of ''S'' has cardinality 2<sup>''n''</sup>. The power set can be written as 2<sup>''S''</sup>.
If ''S'' is an infinite (either [[countable]] or [[uncountable]]) set then the power set of ''S'' is always uncountable. Moreover, if ''S'' is a set, then there is never a [[bijection]] from ''S'' onto ''2<sup>S</sup>''. In other words, the power set of ''S'' is always strictly "bigger" than ''S''.
As an example, the power set 2<sup>{1, 2, 3}</sup> of {1, 2, 3} is equal to the set {{1, 2, 3}, {1, 2}, {1, 3}, {2, 3}, {1}, {2}, {3}, ø}. The cardinality of the original set is 3, and the cardinality of the power set is 2<sup>3</sup>, or 8. This relationship is one of the reasons for the terminology ''power set''. Similarly, its notation is an example of a [[combinatorics#set sizes motivate a naming convention|general convention]] providing notations for sets based on their cardinalities.
==Special sets==
There are some sets which hold great mathematical importance and are referred to with such regularity that they have acquired special names and notational conventions to identify them. One of these is the empty set. Many of these sets are represented using [[Blackboard bold]] typeface. Special sets of numbers include:
*<math>\mathbb{P}</math>, denoting the set of all [[prime number|primes]].
*<math>\mathbb{N}</math>, denoting the set of all [[natural number]]s. That is to say, <math>\mathbb{N}</math> = {1, 2, 3, ...}.
*<math>\mathbb{W}</math>, denoting the set of all [[whole number]]s. That is to say, <math>\mathbb{W}</math> = {0, 1, 2, 3, ...}.
*<math>\mathbb{Z}</math>, denoting the set of all [[integer]]s (whether positive, negative or zero). So <math>\mathbb{Z}</math> = {..., -2, -1, 0, 1, 2, ...}.
*<math>\mathbb{Q}</math>, denoting the set of all [[rational number]]s (that is, the set of all [[proper fraction|proper]] and [[improper fraction]]s). So, <math>\mathbb{Q} = \left\{ \begin{matrix}\frac{a}{b} \end{matrix}: a,b \in \mathbb{Z}, b \neq 0\right\}</math>. For example, <math>\begin{matrix} \frac{1}{4} \end{matrix} \in \mathbb{Q}</math> and <math>\begin{matrix}\frac{11}{6} \end{matrix} \in \mathbb{Q}</math>. All integers are in this set since every integer ''a'' can be expressed as the fraction <math>\begin{matrix} \frac{a}{1} \end{matrix}</math>.
*<math>\mathbb{R}</math>, denoting the set of all [[real number]]s. This set includes all rational numbers, together with all [[irrational number|irrational]] numbers (that is, numbers which cannot be rewritten as fractions, such as <math>\pi,</math> <math>e,</math> and √2).
*<math>\mathbb{C}</math>, denoting the set of all [[complex number]]s.
Each of these sets of numbers has an infinite number of elements, and <math>\mathbb{P} \subsetneq \mathbb{N} \subsetneq \mathbb{W} \subsetneq \mathbb{Z} \subsetneq \mathbb{Q} \subsetneq \mathbb{R} \subsetneq \mathbb{C}</math>. The primes are used less frequently than the others outside of [[number theory]] and related fields.
==Basic operations==
===Unions===
{{main|Union (set theory)}}
There are ways to construct new sets from existing ones.
Two sets can be "added" together. The ''union'' of ''A'' and ''B'', denoted by ''A'' ∪ ''B'', is the set of all things which are members of either ''A'' or ''B''.
<div style="float:right;margin:1em;">[[Image:Venn0111.svg|150px|center|A union B]]<center><small> The '''union''' of ''A'' and ''B''</small></center></div>
Examples:
:*{1, 2} ∪ {red, white} = {1, 2, red, white}
:*{1, 2, green} ∪ {red, white, green} = {1, 2, red, white, green}
:*{1, 2} ∪ {1, 2} = {1, 2}.
Some basic properties of unions are:
:*''A'' ∪ ''B'' = ''B'' ∪ ''A''
:*''A'' ∪ (''B'' ∪ ''C'') = (''A'' ∪ ''B'') ∪ ''C''
:*''A'' ⊆ (''A'' ∪ ''B'')
:*''A'' ∪ ''A'' = ''A''
:*''A'' ∪ ø = ''A''
:*''A'' ⊆ ''B'' [[if and only if]] ''A'' ∪ ''B'' = ''B''.
===Intersections===
{{main|Intersection (set theory)}}
A new set can also be constructed by determining which members two sets have "in common". The ''intersection'' of ''A'' and ''B'', denoted by ''A'' ∩ ''B'', is the set of all things which are members of both ''A'' and ''B''. If ''A'' ∩ ''B'' = ø, then ''A'' and ''B'' are said to be ''disjoint''.
<div style="float:right;margin:1em;">[[Image:Venn0001.svg|150px|center|A intersect B]]<center><small>The '''intersection''' of ''A'' and ''B''</small></center></div>
Examples:
:*{1, 2} ∩ {red, white} = ø
:*{1, 2, green} ∩ {red, white, green} = {green}
:*{1, 2} ∩ {1, 2} = {1, 2}.
Some basic properties of intersections:
:*''A'' ∩ ''B'' = ''B'' ∩ ''A''
:*''A'' ∩ (''B'' ∩ ''C'') = (''A'' ∩ ''B'') ∩ ''C''
:*''A'' ∩ ''B'' ⊆ ''A''
:*''A'' ∩ ''A'' = ''A''
:*''A'' ∩ ø = ø
:*''A'' ⊆ ''B'' [[if and only if]] ''A'' ∩ ''B'' = ''A''.
===Complements===
{{main|Complement (set theory)}}
Two sets can also be "subtracted". The ''relative complement'' of ''A'' in ''B'' (also called the ''set theoretic difference'' of ''B'' and ''A''), denoted by ''B'' \ ''A'', (or ''B'' − ''A'') is the set of all elements which are members of ''B'', but not members of ''A''. Note that it is valid to "subtract" members of a set that are not in the set, such as removing ''green'' from {1,2,3}; doing so has no effect.
In certain settings all sets under discussion are considered to be subsets of a given [[universe (mathematics)|universal set]] ''U''. In such cases, ''U'' \ ''A'', is called the ''absolute complement'' or simply ''complement'' of ''A'', and is denoted by ''A''′.
<div style="float:right;margin:1em;">[[Image:Venn0100.svg|150px|center|B minus A]]<center><small>The '''relative complement'''<br>of ''A'' in ''B''</small></center>
[[Image:Venn1100.svg|150px|center|A complement]]<center><small>The '''complement''' of ''A'' in ''U''</small></center></div>
Examples:
:*{1, 2} \ {red, white} = {1, 2}
:*{1, 2, green} \ {red, white, green} = {1, 2}
:*{1, 2} \ {1, 2} = ∅
:*If ''U'' is the set of integers, ''E'' is the set of even integers, and ''O'' is the set of odd integers, then the complement of ''E'' in ''U'' is ''O'', or equivalently, ''E''′ = ''O''.
Some basic properties of complements:
:*''A'' ∪ ''A′'' = ''U''
:*''A'' ∩ ''A′'' = ∅
:*(''A′ '')′ = ''A''
:*''A'' \ ''A'' = ∅
:*''U′ '' = ∅ and ∅′ = ''U''
:*''A'' \ ''B'' = ''A'' ∩ ''B′''.
===Cartesian product===
{{Main|Cartesian product}}
A new set can be constructed by associating every element of one set with every element of another set. The ''Cartesian product'' of two sets ''A'' and ''B'', denoted by ''A'' × ''B'' is the set of all [[ordered pairs]] (''a'', ''b'') such that ''a'' is a member of ''A'' and ''b'' is a member of ''B''.
Examples:
*{1, 2} × {red, white} = {(1,red), (1,white), (2,red), (2,white)}
*{1, 2, green} × {red, white, green} = {(1,red), (1,white), (1,green), (2,red), (2,white), (2,green), (green,red), (green,white), (green,green)}
*{1, 2} × {1, 2} = {(1,1), (1,2), (2,1), (2,2)}
Some basic properties of cartesian products:
*''A'' × ∅ = ∅ × ''A'' = ∅
*''A'' × (''B'' ∪ ''C'') = (''A'' × ''B'') ∪ (''A'' × ''C'')
*(''A'' ∪ ''B'') × ''C'' = (''A'' × ''C'') ∪ (''B'' × ''C'')
Let ''A'' and ''B'' be finite sets;
*|''A'' × ''B''| = |''B'' × ''A''| = |''A''| × |''B''|
<!-- Expand, please. -->
==Applications==
Set theory is seen as the foundation from which virtually all of mathematics can be derived. For example, [[Algebraic structure|structures]] in [[abstract algebra]], such as [[Group (mathematics)|groups]], [[Field (mathematics)|fields]] and [[Ring (mathematics)|rings]], are sets closed under one or more operations.
One of the main applications of naive set theory is constructing [[Relation (mathematics)|relations]]. A relation from a [[domain (mathematics)|domain]] ''A'' to a [[codomain]] ''B'' is nothing but a subset of ''A'' × ''B''. Given this concept, we are quick to see that the set ''F'' of all ordered pairs (''x'', ''x''<sup>2</sup>), where ''x'' is real, is quite familiar. It has a domain set <math>\mathbb{R}</math> and a codomain set that is also <math>\mathbb{R}</math>, because the set of all squares is subset of the set of all reals. If placed in functional notation, this relation becomes ''f''(''x'') = ''x''<sup>2</sup>. The reason these two are equivalent is for any given value, ''y'' that the function is defined for, its corresponding ordered pair, (''y'', ''y''<sup>2</sup>) is a member of the set ''F''.
<!-- Expand -->
==Axiomatic set theory==
{{main|Axiomatic set theory}}
Although initially the [[naive set theory]], which defines a set merely as ''any'' ''well-defined'' collection, was well accepted, it soon ran into several obstacles. It was found that this definition spawned [[:Category:Paradoxes of naive set theory|several paradoxes]], most notably:
*[[Russell's paradox]] - It shows that the "set of all sets which ''do not contain themselves''," i.e. the "set" <math>\left \{ x: x\mbox{ is a set and }x\notin x \right \}</math> does not exist.
*[[Cantor's paradox]] - It shows that "the set of all sets" cannot exist.
The reason is that the phrase ''well-defined'' is not very well-defined. It was important to free set theory of these paradoxes because nearly all of mathematics was being redefined in terms of set theory. In an attempt to avoid these paradoxes, set theory was axiomatized based on [[first-order logic]], and thus the '''[[axiomatic set theory]]''' was born.
For most purposes however, the [[naive set theory]] is still useful.
==See also==
<div style="-moz-column-count:4; column-count:4;">
* [[Alternative set theory]]
* [[Axiomatic set theory]]
* [[Class (set theory)]]
* [[Dense set]]
* [[Family (mathematics)]]
* [[Fuzzy set]]
* [[Mathematical structure]]
* [[Multiset]]
* [[Naive set theory]]
* [[Rough set]]
* [[Russell's paradox]]
* [[Scientific classification]]
* [[Taxonomy]]
* [[Tuple]]
</div>
==Notes==
<!--<nowiki>
See http://en.wikipedia.org/wiki/Wikipedia:Footnotes for an explanation of how to generate footnotes using the <ref> and </ref> tags, and the template below.
</nowiki>-->
{{reflist|2}}
==References==
*Dauben, Joseph W., ''Georg Cantor: His Mathematics and Philosophy of the Infinite'', Boston: [[Harvard University Press]] (1979) ISBN 978-0-691-02447-9.
*[[Paul Halmos|Halmos, Paul R.]], ''Naive Set Theory'', Princeton, N.J.: Van Nostrand (1960) ISBN 0-387-90092-6.
*Stoll, Robert R., ''Set Theory and Logic'', Mineola, N.Y.: [[Dover Publications]] (1979) ISBN 0-486-63829-4.
==External links==
{{Commons|Set theory|Set}}
* [http://www.c2.com/cgi/wiki?SetTheory C2 Wiki - Examples of set operations using English operators.] Dead Link
* [http://plainmath.net/index.php?page=sets Set of Sets articles on Plainmath.net]- A series of articles on all aspects of sets
{{portalpar|Logic}}
{{Logic}}
[[Category:Set theory| ]]
{{Link FA|lmo}}
[[ar:مجموعة (رياضيات)]]
[[bn:সেট]]
[[be:Мноства]]
[[be-x-old:Мноства]]
[[bs:Skup]]
[[bg:Множество]]
[[ca:Conjunt]]
[[cs:Množina]]
[[da:Mængde]]
[[de:Menge (Mathematik)]]
[[et:Hulk]]
[[el:Σύνολο]]
[[es:Conjunto]]
[[eo:Aro (matematiko)]]
[[eu:Multzo]]
[[fa:مجموعه (ریاضی)]]
[[fr:Ensemble]]
[[gd:Àlach]]
[[gl:Conxunto]]
[[zh-classical:集]]
[[ko:집합]]
[[hr:Skup]]
[[io:Ensemblo]]
[[id:Himpunan]]
[[ia:Ensemble]]
[[is:Mengi]]
[[it:Insieme]]
[[he:קבוצה (מתמטיקה)]]
[[kn:ಗಣ]]
[[ka:სიმრავლე]]
[[la:Copia]]
[[lv:Kopa]]
[[lt:Aibė]]
[[lmo:Cungjuunt]]
[[hu:Halmaz]]
[[mk:Множество]]
[[mn:Олонлог]]
[[nl:Verzameling (wiskunde)]]
[[ja:集合]]
[[no:Mengde]]
[[nn:Mengd]]
[[nov:Ensemble]]
[[oc:Ensemble]]
[[pl:Zbiór]]
[[pt:Conjunto]]
[[ro:Mulţime]]
[[qu:Tantachisqa]]
[[ru:Множество]]
[[sq:Bashkësitë]]
[[scn:Nzemi]]
[[simple:Set]]
[[sk:Množina]]
[[sl:Množica]]
[[sr:Скуп]]
[[sh:Skup]]
[[sv:Mängd]]
[[ta:கணம் (கணிதம்)]]
[[th:เซต]]
[[vi:Tập hợp]]
[[tr:Küme]]
[[uk:Множина]]
[[ur:مجموعہ]]
[[fiu-vro:Hulk]]
[[yi:סכום (מאטעמאטיק)]]
[[zh-yue:集合]]
[[zh:集合]]