Misplaced Pages

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 (${\displaystyle A=\{1,2,3,4\}}$), one could say that "3 is an element of A", expressed notationally as ${\displaystyle 3\in A}$.

Sets

Writing ${\displaystyle A=\{1,2,3,4\}}$ means that the elements of the set A are the numbers 1, 2, 3 and 4. Sets of elements of A, for example ${\displaystyle \{1,2\}}$, are subsets of A.

Sets can themselves be elements. For example, consider the set ${\displaystyle B=\{1,2,\{3,4\}\}}$. 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 ${\displaystyle \{3,4\}}$.

The elements of a set can be anything. For example the elements of the set ${\displaystyle C=\{\mathrm {\color {Red}red} ,\mathrm {12} ,B\}}$ are the color red, the number 12, and the set B.

In logical terms, ${\displaystyle (x\in y)\leftrightarrow \forall x:x\in {\mathfrak {D}}y}$.

Notation and terminology

The relation "is an element of", also called set membership, is denoted by the symbol "∈". Writing

${\displaystyle x\in A}$

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, although some authors use them to mean instead "x is a subset of A". Logician George Boolos strongly urged that "contains" be used for membership only, and "includes" for the subset relation only.

For the relation ∈ , the converse relation ∈ may be written

${\displaystyle A\ni x}$

meaning "A contains or includes x".

The negation of set membership is denoted by the symbol "∉". Writing

${\displaystyle x\notin A}$

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. 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".

Examples

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:

• 2 ∈ A
• 5 ∉ A

• {3, 4} ∈ B
• 3 ∉ B
• 4 ∉ B
• yellow ∉ C

Cardinality of sets

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 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, ...}.

Formal relation

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 ${\displaystyle \in }$ is a subset of U × P(U). The converse relation ${\displaystyle \ni }$ is a subset of P(U) × U.

See also

• Identity element
• Singleton (mathematics)

References

1. Weisstein, Eric W. "Element". mathworld.wolfram.com. Retrieved 2020-08-10.
2. Eric Schechter (1997). Handbook of Analysis and Its Foundations. Academic Press. ISBN 0-12-622760-8. p. 12
3. George Boolos (February 4, 1992). 24.243 Classical Set Theory (lecture) (Speech). Massachusetts Institute of Technology.
4. ^ Kennedy, H. C. (July 1973). "What Russell learned from Peano". Notre Dame Journal of Formal Logic. 14 (3). Duke University Press: 367–372. doi:10.1305/ndjfl/1093891001. MR 0319684.
5. "Sets - Elements | Brilliant Math & Science Wiki". brilliant.org. Retrieved 2020-08-10.

Further reading

• Halmos, Paul R. (1974) , Naive Set Theory, Undergraduate Texts in Mathematics (Hardcover ed.), NY: Springer-Verlag, ISBN 0-387-90092-6 - "Naive" means that it is not fully axiomatized, not that it is silly or easy (Halmos's treatment is neither).
• Jech, Thomas (2002), "Set Theory", Stanford Encyclopedia of Philosophy, Metaphysics Research Lab, Stanford University
• Suppes, Patrick (1972) , Axiomatic Set Theory, NY: Dover Publications, Inc., ISBN 0-486-61630-4 - Both the notion of set (a collection of members), membership or element-hood, the axiom of extension, the axiom of separation, and the union axiom (Suppes calls it the sum axiom) are needed for a more thorough understanding of "set element".

v t e Mathematical logic
General	Axiom list Cardinality First-order logic Formal proof Formal semantics Foundations of mathematics Information theory Lemma Logical consequence Model Theorem Theory Type theory
Theorems (list)  and paradoxes	Gödel's completeness and incompleteness theorems Tarski's undefinability Banach–Tarski paradox Cantor's theorem, paradox and diagonal argument Compactness Halting problem Lindström's Löwenheim–Skolem Russell's paradox
Logics	Traditional Classical logic Logical truth Tautology Proposition Inference Logical equivalence Consistency Equiconsistency Argument Soundness Validity Syllogism Square of opposition Venn diagram Propositional Boolean algebra Boolean functions Logical connectives Propositional calculus Propositional formula Truth tables Many-valued logic 3 finite ∞ Predicate First-order list Second-order Monadic Higher-order Fixed-point Free Quantifiers Predicate Monadic predicate calculus
Set theory	Set hereditary Class (Ur-)Element Ordinal number Extensionality Forcing Relation equivalence partition Set operations: intersection union complement Cartesian product power set identities Types of sets Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann Maps and cardinality Function/Map domain codomain image In/Sur/Bi-jection Schröder–Bernstein theorem Isomorphism Gödel numbering Enumeration Large cardinal inaccessible Aleph number Operation binary Set theories Zermelo–Fraenkel axiom of choice continuum hypothesis General Kripke–Platek Morse–Kelley Naive New Foundations Tarski–Grothendieck Von Neumann–Bernays–Gödel Ackermann Constructive
Formal systems (list), language and syntax	Alphabet Arity Automata Axiom schema Expression ground Extension by definition conservative Relation Formation rule Grammar Formula atomic closed ground open Free/bound variable Language Metalanguage Logical connective ¬ ∨ ∧ → ↔ = Predicate functional variable propositional variable Proof Quantifier ∃ ! ∀ rank Sentence atomic spectrum Signature String Substitution Symbol function logical/constant non-logical variable Term Theory list Example axiomatic systems (list) of arithmetic: Peano second-order elementary function primitive recursive Robinson Skolem of the real numbers Tarski's axiomatization of Boolean algebras canonical minimal axioms of geometry: Euclidean: Elements Hilbert's Tarski's non-Euclidean Principia Mathematica
Proof theory	Formal proof Natural deduction Logical consequence Rule of inference Sequent calculus Theorem Systems axiomatic deductive Hilbert list Complete theory Independence (from ZFC) Proof of impossibility Ordinal analysis Reverse mathematics Self-verifying theories
Model theory	Interpretation function of models Model equivalence finite saturated spectrum submodel Non-standard model of arithmetic Diagram elementary Categorical theory Model complete theory Satisfiability Semantics of logic Strength Theories of truth semantic Tarski's Kripke's T-schema Transfer principle Truth predicate Truth value Type Ultraproduct Validity
Computability theory	Church encoding Church–Turing thesis Computably enumerable Computable function Computable set Decision problem decidable undecidable P NP P versus NP problem Kolmogorov complexity Lambda calculus Primitive recursive function Recursion Recursive set Turing machine Type theory
Related	Abstract logic Algebraic logic Automated theorem proving Category theory Concrete/Abstract category Category of sets History of logic History of mathematical logic timeline Logicism Mathematical object Philosophy of mathematics Supertask
Mathematics portal

v t e Set theory
Overview	Set (mathematics)
Axioms	Adjunction Choice countable dependent global Constructibility (V=L) Determinacy projective Extensionality Infinity Limitation of size Pairing Power set Regularity Union Martin's axiom Axiom schema replacement specification
Operations	Cartesian product Complement (i.e. set difference) De Morgan's laws Disjoint union Identities Intersection Power set Symmetric difference Union
Concepts Methods	Almost Cardinality Cardinal number (large) Class Constructible universe Continuum hypothesis Diagonal argument Element ordered pair tuple Family Forcing One-to-one correspondence Ordinal number Set-builder notation Transfinite induction Venn diagram
Set types	Amorphous Countable Empty Finite (hereditarily) Filter base subbase Ultrafilter Fuzzy Infinite (Dedekind-infinite) Recursive Singleton Subset · Superset Transitive Uncountable Universal
Theories	Alternative Axiomatic Naive Cantor's theorem Zermelo General Principia Mathematica New Foundations Zermelo–Fraenkel von Neumann–Bernays–Gödel Morse–Kelley Kripke–Platek Tarski–Grothendieck
Paradoxes Problems	Russell's paradox Suslin's problem Burali-Forti paradox
Set theorists	Paul Bernays Georg Cantor Paul Cohen Richard Dedekind Abraham Fraenkel Kurt Gödel Thomas Jech John von Neumann Willard Quine Bertrand Russell Thoralf Skolem Ernst Zermelo

• Basic concepts in set theory