Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools


Set Theory Basics: Terminology and Core Concepts



Key Terms
What Is a Set? The Definition
Notation Used in Set Theory
Cardinality and Types of Sets
Relationships Between Sets
Operations on Sets
Set Theory Basics FAQ



The Vocabulary Every Other Page Builds On


Set theory is the language in which much of modern mathematics is written. This page collects its basic vocabulary in one place: what a set is, how sets are written down, how their size is measured, and the standard relationships and operations between sets. Every topic surveyed here is developed in depth on its own dedicated page within the set theory section.

Key Terms

Set— an unordered collection of unique items
Element— a single member of a set
Empty Set— the set containing no elements
Universal Set— the set of everything under consideration
Subset— a set whose elements all belong to another set
Union— the elements found in either of two sets
Intersection— the elements common to both sets
Cardinality— the number of elements in a set

See All Set Theory Definitions →


What Is a Set? The Definition


    In mathematics, a set is defined as an unordered collection of unique items. This short yet concise definition contains everything needed to understand the essence of the object we call a mathematical set. Let us analyze it in more depth:

  • Unordered — the order of the elements does not matter. Two or more sets containing the same items are identical, no matter how the items are listed.

  • Collection — stands for zero or more items, up to an infinite number of them.

  • Unique — each member of the set is distinct; no two identical items are present.

    • What kinds of items or entities can be members of a mathematical set? Whatever they are, it does not matter. Mathematics is all about abstraction, and in the abstract world things can be of any type — so the famous 'apples and oranges' problem does not apply here. Entities of completely different kinds can live together as parts of the same set.
"A" 1
Diagram 1. Mathematical sets may contain absolutely any type of objects or entities.

Notation Used in Set Theory

Notation

Notation Used in Set Theory

The discipline that lends its marks to all the others starts here: the braces that build sets, the bar that filters them, the membership pair, and the symbol for having nothing. Sets take capital letters (AA, BB, CC) by convention; the full chart of set theory symbols lists every mark with its LaTeX code, and the mathematical keyboard types them directly. The summary table below collects the symbols at a glance.
The containment family ⊆\subseteq, ⊂\subset, ⊇\supseteq, ⊃\supset appears in Relationships Between Sets below and is owned by the subsets page; the operation marks ∩\cap, ∪\cup belong to operations.
{1,2,3}\{1, 2, 3\}
the set containing one, two, three
Enumerative (roster) notation: curly braces list the members outright, and membership is all they claim — order and repetition carry no meaning. Anything can be a member: numbers, letters, words, other sets.
CasesUnlistable tails compress to an ellipsis — {1,2,3,…}\{1, 2, 3, \ldots\} continues the visible pattern; ranges of functions borrow the roster for finite output lists.
Do not confuseThe other braces and brackets. A single brace selects rows in piecewise definitions; square brackets build intervals — {2,7}\{2, 7\} is two numbers, [2,7][2, 7] is infinitely many.
{x∣x>0}\{x \mid x > 0\}
the set of all x such that x is positive
Descriptive (set-builder) notation: four building blocks — a variable, the vertical bar reading "such that", a condition, and the enclosing braces. It names sets too large or too awkward to list.
CasesBoth slots accept words as freely as symbols — {\{prime number ∣\mid prime number >10}> 10\} is legal; domain descriptions run this grammar with the colon variant {x:…}\{x : \ldots\} as an alternative bar.
Do not confuseOther vertical bars. The same stroke means divides in number theory and absolute value when doubled around a quantity — between a variable and its condition, inside braces, it is always "such that".
∈\in · ∉\notin
is an element of; is not an element of
The membership pair: x∈Ax \in A claims xx is a member, and the slash manufactures the denial — y∉By \notin B. The slash-negation pattern is general equipment: ≠\neq, ∉\notin, ⊄\not\subset all deny by striking through.
CasesMembership doubles as a domain declaration across mathematics — the n∈Zn \in \mathbb{Z} of general solutions and the z∈Cz \in \mathbb{C} of complex numbers are this mark at work abroad.
Do not confuseContainment. 1∈A1 \in A but {1}⊆A\{1\} \subseteq A — an element belongs, a set is contained; mixing ∈\in with ⊆\subseteq is the subject's most reliable exam error, and Relationships Between Sets below draws the line.
∅\varnothing
the empty set
The set with no members, written ∅\varnothing or {}\{\} — one object, two spellings. It is a set like any other: a legitimate value, a legitimate member, a legitimate answer.
CasesNesting is not emptiness: {∅}\{\varnothing\} is a one-element set whose single member happens to be empty — ∣∅∣=0|\varnothing| = 0 but ∣{∅}∣=1|\{\varnothing\}| = 1.
Do not confuseThe Greek letter phi. Handwriting collapses ∅\varnothing into ϕ\phi — but the empty-set mark is a struck circle, not a letter; writing "phi" for the empty set is a naming error graders notice.

Set Notation Summary

Concept Symbol/Notation Explanation
Enumerative Set Notation {1, 2, 3}, {a, b, c} Lists all elements of a set within curly braces.
Enumerative Set with Ellipsis {1, 2, 3, ...}, {a, b, c, d, ...} Lists some elements and uses '...' to indicate continuation, useful for large or infinite sets.
Descriptive Set Notation {x | x is a positive even number} Defines a set by specifying a condition that elements must satisfy.
Empty Set ∅, {} Represents a set with no elements.
Belongs to ∈ 'x ∈ A' means 'x' is an element of set 'A'.
Does not belong to ∉ 'y ∉ B' means 'y' is not an element of set 'B'.
Subset ⊆ 'A ⊆ B' means 'A' is a subset of 'B', meaning all elements of 'A' are in 'B'.
Proper Subset ⊂ 'A ⊂ B' means 'A' is a proper subset of 'B', meaning 'A' is a subset of 'B' but not equal to 'B'.
Superset ⊇ 'B ⊇ A' means 'B' is a superset of 'A', meaning all elements of 'A' are in 'B'.
Proper Superset ⊃ 'B ⊃ A' means 'B' is a proper superset of 'A', meaning 'B' contains all elements of 'A' but is not equal to 'A'.

Cardinality and Types of Sets


    The cardinality of a mathematical set is simply its size — the number of elements in the set. Cardinality is most often denoted by the symbol |A| or card(A), where A is the set; symbols like #A, n(A), or ‖A‖ may be used as well.

    If A = {1, 2, 3}, then the cardinality of A is |A| = 3, because there are three elements in the set. If B = {1, 'apple', 3.14, True}, then |B| = 4, because there are four elements in this set.

    Based on cardinality, mathematical sets are classified into groups:

  • Finite sets — sets having a well-defined number of elements that may be expressed by a natural number. Examples: A = {1, 2, 3, 4, 5}, B = {1, 'apple', 3.14, True}. A set may contain millions of objects, but as long as it can be counted even theoretically, the set is finite.

  • Infinite sets — sets whose elements cannot be exhausted by counting. Examples: A = {x | x is a positive even number} — it is impossible to count all positive even numbers; B = {1, 2, 3, ...}.

  • Empty set — a special case of a finite set having no elements. Notations used for the empty set: E = { } or E = ∅.

  • Universal set — a set that contains all the objects or elements under consideration within a specific context or domain of discourse. It is typically denoted U or ξ. The universal set may be finite — if it represents the days of the week, then U = {Monday, Tuesday, Wednesday, ..., Sunday}, a finite set of 7 elements. It may also be infinite — if it represents all natural numbers, then U = {1, 2, 3, ...}; if it represents all real numbers, then U = ℝ, an infinite set with an uncountable number of elements.

    • Interestingly, despite being conceptually opposite, the universal set and the empty set share fundamental commonalities in set theory. Both are extremes in the hierarchy of sets — the universal set containing everything and the empty set containing nothing. Yet they are complementary and serve as identity elements in key set operations.

    Understanding the universal set and the empty set has immense importance for mastering other ideas in set theory, such as operations on sets, relations, and more. This section only measures size by counting — the story of comparing infinite sizes continues on the dedicated cardinality page.

Cardinality and Types of Sets Summary

Concept Notation Explanation Examples
Cardinality |A|, card(A) The size or number of elements in a set |A| = 3 for A = {1, 2, 3}, |B| = 4 for B = {1, 'apple', 3.14, True}
Finite Sets Regular Set Notation (enumerative or descriptive) Sets with a countable number of elements {Monday, ..., Sunday}, {A, ..., Z}
Infinite Sets Regular Set Notation (enumerative or descriptive) Sets with an uncountable number of elements {x | x is a positive even number}, {1, 2, 3, ...}
Empty Set ∅ or {} A set containing no elements ∅, {}
Universal Set U or ξ Set containing all objects within a specific context U = {Monday, ..., Sunday} for days of the week, U = {A, ..., Z} for English alphabet

Relationships Between Sets


    Basic Set Membership

  • Belongs to (∈) — an object belongs to a set if it is an element of the set. Notation: x ∈ A means that x is an element of set A. Example: if A = {1, 2, 3}, then 1 ∈ A but 4 ∉ A.

  • Does not belong to (∉) — notation: y ∉ B means that y is not an element of set B. Example: if B = {5, 6, 7}, then 4 ∉ B.
A 1 B C 3 D 1 ∈ A B ∈ A C ∈ A 3 ∉ A D ∉ A
Diagram 2. Set membership.

    Equality and Inequality of Sets

  • Equality (=) — two sets are equal if they contain exactly the same elements. Example: A = {1, 2, 3} and B = {3, 1, 2}; A = B.

  • Inequality (≠) — two sets are unequal if there is at least one element that is different between the sets. Example: A = {1, 2, 3} and C = {4, 5, 6}; A ≠ C.

    • Subsets

  • Basic subsets — a set is a subset of another set if every element of this set is also an element of the including set. Example: A = {1, 2} is a subset of B = {1, 2, 3, 4}.

  • Proper subsets — a proper subset of a set is a subset that is not equal to the original set, containing fewer elements. Example: A = {1, 2} is a proper subset of B.

    • Supersets

  • Basic supersets — a superset includes every element of another set. Example: A = {1, 2, 3, 4} is a superset of B = {1, 2} and of C = {1, 2, 3, 4}.

  • Proper supersets — a proper superset contains all elements of the subset plus additional elements. Example: A is a proper superset of B, but not a proper superset of C.
U B A
Diagram 3. Set A is a subset of set B, and set B is a superset of set A.

Disjoint Sets

Two sets are disjoint if they have no common elements. Example: A = {1, 2, 3} and C = {4, 5, 6} are disjoint.
U A B
Diagram 4. Disjoint sets have no common area on a Venn diagram.

Complement

The complement of set A with respect to a universal set U includes all elements that are in U but not in A. Example: U = {1, 2, 3, 4, 5}; A = {1, 2, 3}; then AcA^c = {4, 5}.

This section starts by establishing the fundamental notion of set membership, which is crucial for understanding all subsequent relations and operations between sets. That foundation is then expanded with the various types of set relations, each illustrated with a clear example. The full treatment of these relations lives on the relationships between sets page.

Relationships Between Sets Summary

Concept Notation Explanation Examples
Equality of Sets = Two sets are equal if they contain exactly the same elements. A = {1, 2, 3}, B = {3, 1, 2}; A = B
Inequality of Sets ≠ Two sets are unequal if at least one element is different between the sets. A = {1, 2, 3}, C = {4, 5, 6}; A ≠ C
Basic Subsets ⊆ A subset is a set where every element of the subset is also an element of another set. A = {1, 2}, B = {1, 2, 3, 4}; A ⊆ B
Proper Subsets ⊂ A proper subset of a set is not equal to the original set, containing fewer elements. A = {1, 2}, B = {1, 2, 3, 4}; A ⊂ B
Basic Supersets ⊇ A superset includes every element of another set. A = {1, 2, 3, 4}, B = {1, 2}; A ⊇ B
Proper Supersets ⊃ A proper superset contains all elements of the subset plus additional elements. A = {1, 2, 3, 4}, B = {1, 2}; A ⊃ B
Disjoint Sets N/A Two sets are disjoint if they have no elements in common. A = {1, 2, 3}, C = {4, 5, 6}; A and C are disjoint
Complement Ac The set of all elements not in the given set, relative to a universal set. U = {1, 2, 3, 4, 5}, A = {1, 2, 3}; Ac = {4, 5}

Operations on Sets


    The diagrams accompanying each operation below are Venn diagrams — the standard way to picture how sets combine.

  • Intersection (∩) — the intersection of two sets A and B, denoted A ∩ B, is the set of elements that are common to both A and B. Example: if A = {1, 2, 3, 4} and B = {3, 4, 5, 6}, then A ∩ B = {3, 4}.
A B A∩B
Diagram 5. The intersection of two sets is their common area on a Venn diagram.

  • Union (∪) — the union of two sets A and B, denoted A ∪ B, is the set of elements that are in A, in B, or in both. Example: if A = {1, 2, 3} and B = {4, 5, 3}, then A ∪ B = {1, 2, 3, 4, 5}.
A B A∪B
Diagram 6. The union of two sets is all the area the two circles occupy together.

  • Difference (−) — the difference between two sets A and B, denoted A − B, is the set of elements that are in A but not in B. Example: if A = {1, 2, 3, 4} and B = {3, 4, 5, 6}, then A − B = {1, 2}.
A B A - B
Diagram 7. The difference A − B is the part of A that does not belong to B.

  • Symmetric difference (Δ) — the symmetric difference between two sets A and B, denoted A Δ B, is the set of elements that are in either of the sets A or B but not in their intersection. Example: if A = {1, 2, 3} and B = {3, 4, 5}, then A Δ B = {1, 2, 4, 5}.
A B A Δ B
Diagram 8. The symmetric difference is the area belonging to exactly one of the two sets.

This section demonstrates the fundamental operations on sets with graphical examples to aid in understanding intersection, union, difference, and symmetric difference. The dedicated operations on sets page develops each operation in depth, together with the algebraic laws they obey.

Operations on Sets Summary

Concept Notation Explanation Examples
Intersection A ∩ B The set of elements that are common to both sets A and B. If A = {1, 2, 3, 4} and B = {3, 4, 5, 6}, then A ∩ B = {3, 4}.
Union A ∪ B The set of all elements that are in either set A or set B, or in both. If A = {1, 2, 3} and B = {4, 5, 3}, then A ∪ B = {1, 2, 3, 4, 5}.
Difference A - B The set of elements that are in set A but not in set B. If A = {1, 2, 3, 4} and B = {3, 4, 5, 6}, then A - B = {1, 2}.
Symmetric Difference A Δ B The set of elements that are in either of the sets A or B, but not in both. If A = {1, 2, 3} and B = {3, 4, 5}, then A Δ B = {1, 2, 4, 5}.

Set Theory Basics FAQ

What can be an element of a set?

+
Anything at all. Elements need not share a type or have anything in common, so {1, 'apple', 3.14, true} is a perfectly valid set of four elements. Sets can even contain other sets. The only rules are that elements are distinct and unordered, which is why {1, 2, 2, 3} and {3, 1, 2} name the same set.Read more →

What is the difference between roster and set-builder notation?

+
Roster notation lists the members outright: {2, 4, 6}. Set-builder states a rule instead: {x | x is a positive even number}, read as the set of all x such that x is even. Roster suits small finite sets; set-builder handles sets too large or awkward to write out. Both describe the same kind of object. See all set theory symbols.Read more →

What is the universal set?

+
The universal set U contains every object under consideration in a given context. It is not a fixed collection: for a weekday problem U has seven elements, and for a real-analysis problem U is all of the reals. Complements depend entirely on it, since the complement of A means everything in U outside A.Read more →

Is the empty set the same as a set containing the empty set?

+
No. The empty set has no members and cardinality 0, written as an empty pair of braces. The set {∅} has exactly one member, which happens to be the empty set, so its cardinality is 1. Think of an empty box versus a box holding an empty box. Both are legitimate sets.Read more →

Are {1, 2, 3} and {3, 2, 1, 1} the same set?

+
Yes. Sets are unordered, so rearranging the listing changes nothing, and elements are distinct, so repeating one adds nothing. Both expressions name the same three-element set. This is also why cardinality counts distinct members only: the second listing has four entries written down but still has size 3.