In mathematics, an element (or member) of a set is any one of the distinct objects that belong to that set. For example, given a set called A containing the first four positive integers (), one could say that "3 is an element of A", expressed notationally as .
Writing means that the elements of the set A are the numbers 1, 2, 3 and 4. Sets of elements of A, for example , are subsets of A.
Sets can themselves be elements. For example, consider the set . The elements of B are not 1, 2, 3, and 4. Rather, there are only three elements of B, namely the numbers 1 and 2, and the set .
The elements of a set can be anything. For example, is the set whose elements are the colors red, green and blue.
In logical terms, (x ∈ y) ↔ (∀x[Px = y] : x ∈ 𝔇y).[ clarification needed ]
The relation "is an element of", also called set membership, is denoted by the symbol "∈". Writing
means that "x is an element of A". [1] Equivalent expressions are "x is a member of A", "x belongs to A", "x is in A" and "x lies in A". The expressions "A includes x" and "A contains x" are also used to mean set membership, although some authors use them to mean instead "x is a subset of A". [2] Logician George Boolos strongly urged that "contains" be used for membership only, and "includes" for the subset relation only. [3]
For the relation ∈ , the converse relation ∈T may be written
meaning "A contains or includes x".
The negation of set membership is denoted by the symbol "∉". Writing
means that "x is not an element of A".
The symbol ∈ was first used by Giuseppe Peano, in his 1889 work Arithmetices principia, nova methodo exposita . [4] Here he wrote on page X:
Signum ∈ significat est. Ita a ∈ b legitur a est quoddam b; …
which means
The symbol ∈ means is. So a ∈ b is read as a is a certain b; …
The symbol itself is a stylized lowercase Greek letter epsilon ("ϵ"), the first letter of the word ἐστί , which means "is". [4]
Preview | ∈ | ∉ | ∋ | ∌ | ||||
---|---|---|---|---|---|---|---|---|
Unicode name | ELEMENT OF | NOT AN ELEMENT OF | CONTAINS AS MEMBER | DOES NOT CONTAIN AS MEMBER | ||||
Encodings | decimal | hex | dec | hex | dec | hex | dec | hex |
Unicode | 8712 | U+2208 | 8713 | U+2209 | 8715 | U+220B | 8716 | U+220C |
UTF-8 | 226 136 136 | E2 88 88 | 226 136 137 | E2 88 89 | 226 136 139 | E2 88 8B | 226 136 140 | E2 88 8C |
Numeric character reference | ∈ | ∈ | ∉ | ∉ | ∋ | ∋ | ∌ | ∌ |
Named character reference | ∈, ∈, ∈, ∈ | ∉, ∉, ∉ | ∋, ∋, ∋, ∋ | ∌, ∌, ∌ | ||||
LaTeX | \in | \notin | \ni | \not\ni or \notni | ||||
Wolfram Mathematica | \[Element] | \[NotElement] | \[ReverseElement] | \[NotReverseElement] |
Using the sets defined above, namely A = {1, 2, 3, 4}, B = {1, 2, {3, 4}} and C = {red, green, blue}, the following statements are true:
The number of elements in a particular set is a property known as cardinality; informally, this is the size of a set. [5] In the above examples, the cardinality of the set A is 4, while the cardinality of set B and set C are both 3. An infinite set is a set with an infinite number of elements, while a finite set is a set with a finite number of elements. The above examples are examples of finite sets. An example of an infinite set is the set of positive integers {1, 2, 3, 4, ...}.
As a relation, set membership must have a domain and a range. Conventionally the domain is called the universe denoted U. The range is the set of subsets of U called the power set of U and denoted P(U). Thus the relation is a subset of U× P(U). The converse relation is a subset of P(U) ×U.
In mathematics, the axiom of regularity is an axiom of Zermelo–Fraenkel set theory that states that every non-empty set A contains an element that is disjoint from A. In first-order logic, the axiom reads:
Naive set theory is any of several theories of sets used in the discussion of the foundations of mathematics. Unlike axiomatic set theories, which are defined using formal logic, naive set theory is defined informally, in natural language. It describes the aspects of mathematical sets familiar in discrete mathematics, and suffices for the everyday use of set theory concepts in contemporary mathematics.
In mathematics, the empty set or void set is the unique set having no elements; its size or cardinality is zero. Some axiomatic set theories ensure that the empty set exists by including an axiom of empty set, while in other theories, its existence can be deduced. Many possible properties of sets are vacuously true for the empty set.
In mathematics, particularly set theory, a finite set is a set that has a finite number of elements. Informally, a finite set is a set which one could in principle count and finish counting. For example,
In mathematics, a group is a set with an operation that associates an element of the set to every pair of elements of the set and satisfies the following constraints: the operation is associative, it has an identity element, and every element of the set has an inverse element.
In abstract algebra, a branch of mathematics, a monoid is a set equipped with an associative binary operation and an identity element. For example, the nonnegative integers with addition form a monoid, the identity element being 0.
In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0. Some start counting with 0, defining the natural numbers as the non-negative integers0, 1, 2, 3, ..., while others start with 1, defining them as the positive integers1, 2, 3, .... Some authors acknowledge both definitions whenever convenient. Sometimes, the whole numbers are the natural numbers plus zero. In other cases, the whole numbers refer to all of the integers, including negative integers. The counting numbers are another term for the natural numbers, particularly in primary school education, and are ambiguous as well although typically start at 1.
Naive Set Theory is a mathematics textbook by Paul Halmos providing an undergraduate introduction to set theory. Originally published by Van Nostrand in 1960, it was reprinted in the Springer-Verlag Undergraduate Texts in Mathematics series in 1974.
In mathematical logic, the Peano axioms, also known as the Dedekind–Peano axioms or the Peano postulates, are axioms for the natural numbers presented by the 19th-century Italian mathematician Giuseppe Peano. These axioms have been used nearly unchanged in a number of metamathematical investigations, including research into fundamental questions of whether number theory is consistent and complete.
In mathematics, a set is a collection of different things; these things are called elements or members of the set and are typically mathematical objects of any kind: numbers, symbols, points in space, lines, other geometrical shapes, variables, or even other sets. A set may have a finite number of elements or be an infinite set. There is a unique set with no elements, called the empty set; a set with a single element is a singleton.
Zorn's lemma, also known as the Kuratowski–Zorn lemma, is a proposition of set theory. It states that a partially ordered set containing upper bounds for every chain necessarily contains at least one maximal element.
A mathematical symbol is a figure or a combination of figures that is used to represent a mathematical object, an action on mathematical objects, a relation between mathematical objects, or for structuring the other symbols that occur in a formula. As formulas are entirely constituted with symbols of various types, many symbols are needed for expressing all mathematics.
In set theory, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is an axiomatic system that was proposed in the early twentieth century in order to formulate a theory of sets free of paradoxes such as Russell's paradox. Today, Zermelo–Fraenkel set theory, with the historically controversial axiom of choice (AC) included, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics. Zermelo–Fraenkel set theory with the axiom of choice included is abbreviated ZFC, where C stands for "choice", and ZF refers to the axioms of Zermelo–Fraenkel set theory with the axiom of choice excluded.
In logic and mathematics, second-order logic is an extension of first-order logic, which itself is an extension of propositional logic. Second-order logic is in turn extended by higher-order logic and type theory.
In set theory, several ways have been proposed to construct the natural numbers. These include the representation via von Neumann ordinals, commonly employed in axiomatic set theory, and a system based on equinumerosity that was proposed by Gottlob Frege and by Bertrand Russell.
Internal set theory (IST) is a mathematical theory of sets developed by Edward Nelson that provides an axiomatic basis for a portion of the nonstandard analysis introduced by Abraham Robinson. Instead of adding new elements to the real numbers, Nelson's approach modifies the axiomatic foundations through syntactic enrichment. Thus, the axioms introduce a new term, "standard", which can be used to make discriminations not possible under the conventional ZFC axioms for sets. Thus, IST is an enrichment of ZFC: all axioms of ZFC are satisfied for all classical predicates, while the new unary predicate "standard" satisfies three additional axioms I, S, and T. In particular, suitable nonstandard elements within the set of real numbers can be shown to have properties that correspond to the properties of infinitesimal and unlimited elements.
Axiomatic constructive set theory is an approach to mathematical constructivism following the program of axiomatic set theory. The same first-order language with "" and "" of classical set theory is usually used, so this is not to be confused with a constructive types approach. On the other hand, some constructive theories are indeed motivated by their interpretability in type theories.
In mathematical logic, a non-standard model of arithmetic is a model of first-order Peano arithmetic that contains non-standard numbers. The term standard model of arithmetic refers to the standard natural numbers 0, 1, 2, …. The elements of any model of Peano arithmetic are linearly ordered and possess an initial segment isomorphic to the standard natural numbers. A non-standard model is one that has additional elements outside this initial segment. The construction of such models is due to Thoralf Skolem (1934).
General set theory (GST) is George Boolos's (1998) name for a fragment of the axiomatic set theory Z. GST is sufficient for all mathematics not requiring infinite sets, and is the weakest known set theory whose theorems include the Peano axioms.