词条 | Element (mathematics) |
释义 |
In mathematics, an element, or member, of a set is any one of the distinct objects that make up that set. SetsWriting means that the elements of the set {{mvar|A}} are the numbers 1, 2, 3 and 4. Sets of elements of {{mvar|A}}, for example , are subsets of {{mvar|A}}. Sets can themselves be elements. For example, consider the set . The elements of {{mvar|B}} are not 1, 2, 3, and 4. Rather, there are only three elements of {{mvar|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|red}}, {{green|green}} and {{blue|blue}}. Notation and terminologyThe relation "is an element of", also called set membership, is denoted by the symbol "". Writing means that "x is an element of A". 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, however some authors use them to mean instead "x is a subset of A".[1] Logician George Boolos strongly urged that "contains" be used for membership only and "includes" for the subset relation only.[2] For the relation ∈ , the converse relation ∈T may be written meaning "A contains 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 1889 in his work {{lang|la|Arithmetices principia, nova methodo exposita|italic=yes}}. Here he wrote on page X: {{lang|la|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 b; … The symbol itself is a stylized lowercase Greek letter epsilon ("ϵ"), the first letter of the word {{wikt-lang|grc|ἐστί}}, which means "is". {{charmap|2208 |name1=Element of |ref1char1=\\in |ref2char1=\\[Element] |2209 |name2=Not an element of |ref1char2=\otin |ref2char2=\\[NotElement] |220b |name3=Contains as member |ref1char3=\i |ref2char3=\\[ReverseElement] |220c |name4=Does not contain as member |ref1char4=\ot\i |ref2char4=\\[NotReverseElement] |namedref1=LaTeX |namedref2=Wolfram Mathematica }} Complement and converseEvery relation R : U → V is subject to two involutions: complementation R → and conversion RT: V → U. The relation ∈ has for its domain a universal set U, and has the power set P(U) for its codomain or range. The complementary relation expresses the opposite of ∈. An element x ∈ U may have x ∉ A, in which case x ∈ U \\ A, the complement of A in U. The converse relation swaps the domain and range with ∈. For any A in P(U), is true when x ∈ A. Cardinality of sets{{main|Cardinality}}The number of elements in a particular set is a property known as cardinality; informally, this is the size of a set. In the above examples the cardinality of the set A is 4, while the cardinality of either of the sets B and C is 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, …}. ExamplesUsing the sets defined above, namely A = {1, 2, 3, 4 }, B = {1, 2, {3, 4}} and C = {red, green, blue}:
References1. ^{{cite book |author = Eric Schechter |title= Handbook of Analysis and Its Foundations |publisher= Academic Press |year= 1997|isbn= 0-12-622760-8 }} p. 12 2. ^{{cite speech |title=24.243 Classical Set Theory (lecture) |author=George Boolos |date=February 4, 1992 |location=Massachusetts Institute of Technology }} Further reading
External links
1 : Basic concepts in set theory |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。