Set (mathematics)
In mathematics, a set is a collection of different things; the things are called elements or members of the set and are typically mathematical objects: numbers, symbols, points in space, lines, other geometric shapes, variables, functions…
≈ 8 min read
Set (mathematics). encyclopegia.org, snapshot enwiki-001375014203. /a/set-mathematics
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, a set is a collection of different things; the things are called elements or members of the set and are typically mathematical objects: numbers, symbols, points in space, lines, other geometric shapes, variables, functions, or even other sets. Sets cannot be mathematically defined, since they form a primitive notion.
Instead, they are characterized by basic properties (axioms) that sets must have to correspond to intuition about collections. In modern mathematics, since the first half of the 20th century, all mathematical objects are ultimately defined in terms of sets. That is, set theory serves as foundation of mathematics. \{1,2,3,4\}=\{4, 2, 1, 3\} = \{4, 2, 4, 3, 1, 3\}.
When there is a clear pattern for generating all set elements, one can use an ellipsis to abbreviate the notation; for example, \{1,2,3,\ldots,10\} is a shorthand for . Ellipses in roster notation can also be used to describe some infinite sets; for example, the set of all integers can be denoted as \{\ldots, -3, -2, -1, 0, 1, 2, 3, \ldots\} or \{0, 1, -1, 2, -2, 3, -3, \ldots\}. \{x \mid P(x)\} or \{x : P(x)\} denotes the set of all for which is true.
For example, a set can be specified as follows: F = \{n \mid n \text{ is an integer, and } 0 \leq n \leq 19\}. In this notation, the vertical bar "|" is read as "such that", and the whole formula can be read as " is the set of all such that is an integer in the range from 0 to 19 inclusive".
Some logical formulas, such as {{tmath| \color{red}{S \text{ is a set} } }} or {{tmath|\color{red}{S \text{ is a set and } S\not\in S} }} cannot be used in set-builder notation because there is no set for which the elements are characterized by the formula. There are several ways for avoiding the problem.
One may prove that the formula defines a set; this is often almost immediate, but may be very difficult. One may also introduce a larger set that must contain all elements of the specified set, and write the notation as \{x\mid x\in U \text{ and ...}\} or \{x\in U\mid \text{ ...}\}.
One may also define once for all and take the convention that every variable that appears on the left of the vertical bar of the notation represents an element of . This amounts to saying that is implicit in set-builder notation. In this case, is often called the domain of discourse or a universe.
For example, with the convention that a lower case Latin letter may represent a real number and nothing else, the expression \{x\mid x\not\in \Q\} is an abbreviation of \{x\in \R \mid x\not\in \Q\}, which defines the irrational numbers. A \cap B=\{x\mid x\in A \land x\in B\}, where denotes the logical and.
Intersection is associative and commutative; this means that for proceeding a sequence of intersections, one may proceed in any order, without the need of parentheses for specifying the order of operations. If is a nonempty set of sets, its intersection, denoted \bigcap_{A\in \mathcal S} A, is the set whose elements are those elements that belong to all sets in .
That is, \bigcap_{A\in \mathcal S} A =\{x\mid (\forall A\in \mathcal S)\; x\in A\}. Example: If \mathcal S = \{X,Y\} , then \bigcap_{A\in \mathcal S} A = X \cap Y . A \cup B=\{x\mid x\in A \lor x\in B\}, where denotes the logical or. Union is associative and commutative.
If is a set of sets, its union, denoted \bigcup S = \bigcup_{A\in \mathcal S} A, is the set whose elements are those elements that belong to at least one set in . That is, \bigcup_{A\in \mathcal S} A =\{x\mid (\exists A\in \mathcal S)\; x\in A\}.
Example: If \mathcal S = \{X,Y\} , then \bigcup_{A\in \mathcal S} A = X \cup Y . A \setminus B=\{x\mid x\in A \land x\not\in B\}, where denotes the logical and. When the difference is also called the complement of in . When all sets that are considered are subsets of a fixed universal set , the complement is often called the absolute complement of .
The symmetric difference of two sets and , denoted , is the set of those elements that belong to or but not to both: A\,\Delta\,B = (A \setminus B) \cup (B \setminus A). \bigcup_{i\in \mathcal I} A_i=\{x\mid (\exists i\in \mathcal I)\; x\in A_i\} and \bigcap_{i\in \mathcal I} A_i=\{x\mid (\forall i\in \mathcal I)\; x\in A_i\}. The formulas of the above sections are special cases of the formulas for indexed families, where and .
The formulas remain correct, even in the case where for some , since . A\times B = \{(a,b) \mid a\in A \text{ and } b\in B\}. The definition makes sense even if A=B . One can likewise define A \times B \times C as a set of ordered triples (a,b,c) , and likewise for any finite number of sets.
In fact, the number of sets does not have to be finite. Given any indexed family of sets (A_i)_{i \in I} , the product \prod_{i \in I} A_i is the set of all indexed families of elements (a_i)_{i \in I} such that a_i \in A_i for each i \in I . The axiom of choice implies that any product of nonempty sets is nonempty. \mathcal P(\{1,2,3\})=\{\emptyset, \{1\}, \{2\}, \{3\}, \{1,2\}, \{1,3\}, \{2,3\}, \{1,2,3\}\}.
There is a natural one-to-one correspondence (bijection) between the subsets of and the functions from to ; this correspondence associates to each subset the function that takes the value on the subset and elsewhere. Because of this correspondence, the power set of is commonly identified with set exponentiation: \mathcal P(E)=\{0,1\}^E. In this notation, is often abbreviated as , which gives \mathcal P(E)=2^E. In particular, if has elements, then has elements.
A\sqcup B=\{(a,i)\mid (i=1 \land a\in A)\lor (i=2 \land a\in B\}. If is a set with elements, then has elements, while has elements. The disjoint union of two sets is a particular case of the disjoint union of an indexed family of sets, which is defined as \bigsqcup_{i \in \mathcal I}=\{(a,i)\mid i\in \mathcal I \land a\in A_i\}.
The disjoint union is the coproduct in the category of sets. Therefore the notation \coprod_{i \in \mathcal I}=\{(a,i)\mid i\in \mathcal I \land a\in A_i\} is commonly used. \begin{align} \bigsqcup_{i\in \mathcal I} A_i&\to \bigcup_{i\in \mathcal I} A_i\\ (a,i)&\mapsto a , \end{align} which consists in "forgetting" the indices.
This map is always surjective; it is bijective if and only if the are pairwise disjoint, that is, all intersections of two sets of the family are empty. In this case, and are commonly identified, and one says that their union is the disjoint union of the members of the family.
If a set is the disjoint union of a family of subsets, one says also that the family is a partition of the set. |S| This implies that there is no greatest cardinality. \mathfrak c = 2^{\aleph_0}, meaning that the cardinality of the real numbers equals the cardinality of the power set of the natural numbers. In particular, \mathfrak c > \aleph_0.
When published in 18781 by Georg Cantor, this result was so astonishing that it was rejected by mathematicians, and several decades were needed before its common acceptance. It can be shown that is also the cardinality of the entire plane, and of any finite-dimensional Euclidean space.
The continuum hypothesis, a conjecture formulated by Georg Cantor in 1878, states that there is no set with cardinality strictly between and . In 1963, Paul Cohen proved that the continuum hypothesis is independent of the axioms of Zermelo–Fraenkel set theory with the axiom of choice.
This means that if the most widely used set theory is consistent (that is not self-contradictory), then the same is true for both the set theory with the continuum hypothesis added as a further axiom, and the set theory with the negation of the continuum hypothesis added. (m Transfinite induction is the same, replacing natural numbers by the elements of a well-ordered set.
Often, a proof by transfinite induction easier if three cases are proved separately, the two first cases being the same as for usual induction: is true, where denotes the least element of the well-ordered set , where denotes the successor of , that is the least element that is greater than , when is not a successor. Transfinite induction is fundamental for defining ordinal numbers and cardinal numbers.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1375014203 under CC BY-SA 4.0; modifications have been made.
References
- ↩Wikipedia “Set (mathematics)” publication date (×1) · confidence 0.95 revision URL