A set is a well-defined collection of distinct objects called elements or members. The objects may be numbers, symbols, geometric points, scientific objects or other mathematical entities. Sets are commonly represented by capital letters such as A, B and C, while their elements are written inside curly braces. For example, A = {1, 2, 3, 4} represents a set containing four elements. The statement 2 ∈ A means that 2 belongs to A, whereas 7 ∉ A means that 7 does not belong to A. Sets can be described by listing their elements or by specifying a property that determines membership. The number of distinct elements in a finite set is called its cardinality. Sets may be empty, finite or infinite. Relationships between sets include equality, subset and proper subset. Operations such as union, intersection, difference and complement produce new sets. Venn diagrams provide visual representations of set relationships and operations. Set theory is fundamental to probability, statistics, logic, algebra, computer science and data organization. A well-defined set must have an unambiguous membership rule: it must be possible to determine whether a particular object belongs to the set.
Sets and Basic Set Notation
Set theory is the mathematical study of collections of distinct objects. Sets provide a common language for describing groups, relationships, classification, mathematical structures and operations across many branches of mathematics.
Set membership: x ∈ A
Non-membership: x ∉ A
Subset: A ⊆ B ⇔ every element of A is also an element of B.
Proper subset: A ⊂ B when A ⊆ B and A ≠ B.
Union: A ∪ B = {x | x ∈ A or x ∈ B}.
Intersection: A ∩ B = {x | x ∈ A and x ∈ B}.
Difference: A − B = {x | x ∈ A and x ∉ B}.
Complement: Aᶜ = U − A, where U is the universal set.
Cardinality of a union: |A ∪ B| = |A| + |B| − |A ∩ B| for finite sets.
Power set cardinality: |P(A)| = 2ⁿ for a finite set A with n elements.
Explanation
Variables
A, B, C: names of sets.
x: an arbitrary object or element.
U: the universal set under consideration.
∈: belongs to or is an element of.
∉: does not belong to.
⊆: is a subset of.
⊂: is a proper subset of.
∪: union of sets.
∩: intersection of sets.
−: set difference.
Aᶜ: complement of A relative to U.
∅: the empty set.
|A|: cardinality of set A.
P(A): the power set of A.
n: the number of elements in a finite set.
Example or application
Let A = {1, 2, 3, 4} and B = {3, 4, 5, 6}. Then 2 ∈ A because 2 is an element of A, and 7 ∉ A because 7 is not an element of A. Their union is A ∪ B = {1, 2, 3, 4, 5, 6}, because it contains every element that belongs to at least one set. Their intersection is A ∩ B = {3, 4}, because these are the elements common to both sets. Their difference is A − B = {1, 2}, because these elements belong to A but not B.
Definition
A set is a well-defined collection of distinct objects, called elements or members. If an object x belongs to a set A, the notation x ∈ A is used; if it does not belong, the notation x ∉ A is used. The cardinality of a finite set A, written |A| or n(A), is the number of its distinct elements.
Purpose
Set theory provides a precise language for grouping and classifying mathematical objects. It allows mathematicians to describe membership, compare collections, identify common elements, combine groups and study relationships between collections. It also supplies foundational concepts used to define number systems, functions, probability spaces and many other mathematical structures.
Importance
Sets are important because they provide a common framework across mathematics and other disciplines. In probability, events are sets of possible outcomes. In statistics, data can be grouped into categories. In computer science, sets help describe collections of records, search results and distinct values. In algebra, sets form the underlying collections on which operations and structures are defined. Understanding set notation also helps learners interpret mathematical definitions, logical statements, functions and relationships between different domains.
Learning Objectives
Define a set and explain what makes a collection well-defined.
Identify elements and use membership notation correctly.
Represent sets using roster notation and set-builder notation.
Distinguish empty, finite and infinite sets.
Understand equal sets, equivalent sets, subsets and proper subsets.
Determine the cardinality of finite sets.
Perform union, intersection, difference and complement operations.
Interpret Venn diagrams and use them to represent set relationships.
Understand universal sets and power sets.
Apply basic set identities and cardinality relationships to simple problems.
Key Concepts
Element: An object belonging to a set.
Roster notation: Representing a set by listing its elements inside braces.
Set-builder notation: Describing a set through a condition that its elements satisfy.
Well-defined set: A collection for which membership can be determined unambiguously.
Empty set: A set containing no elements, represented by ∅ or {}.
Finite set: A set with a limited number of elements.
Infinite set: A set with infinitely many elements.
Universal set: The collection of all objects being considered in a particular discussion.
Equal sets: Sets containing exactly the same elements.
Equivalent sets: Sets having the same cardinality.
Subset: A set whose every element belongs to another set.
Proper subset: A subset that is not equal to the larger set.
Cardinality: The number of distinct elements in a set.
Union: The set of elements belonging to at least one of the given sets.
Intersection: The set of elements common to all the given sets.
Difference: The set of elements belonging to one set but not the other.
Complement: The elements of the universal set that do not belong to a specified set.
Disjoint sets: Sets having no elements in common.
Power set: The set of all subsets of a given set.
Venn diagram: A visual representation of sets and their relationships.
Working Principle
Set theory works by defining a collection through an explicit membership rule. Once the elements are identified, set notation describes membership and relationships. Set operations construct new collections according to logical conditions: union includes elements satisfying at least one membership condition, intersection includes elements satisfying both, and difference includes elements satisfying one condition but not another. Complement is defined relative to a universal set. Cardinality measures the number of distinct elements, while subset relationships compare the membership of entire collections. Venn diagrams translate these logical relationships into visual regions.
Process
To work with a set, first identify the collection and state its membership rule. Represent it using roster notation when listing the elements is practical, or set-builder notation when a rule is clearer. Determine whether the set is empty, finite or infinite. Check membership by comparing an object with the set's defining rule. To compare two sets, examine whether they contain exactly the same elements or whether every element of one belongs to the other. For set operations, identify the relevant membership conditions and list each qualifying element only once. When a universal set is involved, use it to determine complements. Finally, verify the result by checking each element against the definition of the operation.
Applications
Probability represents events as subsets of a sample space and uses union and intersection to describe combined events.
Statistics groups observations into categories and compares overlapping groups.
Computer science uses set structures to store distinct values, filter records and describe collections of data.
Database systems use set-based ideas when combining, intersecting and filtering query results.
Biology uses classification groups to organize organisms according to shared characteristics.
Chemistry uses collections to classify elements, compounds and groups of substances according to specified properties.
Logic uses sets to describe the objects satisfying predicates and mathematical conditions.
Algebra uses sets as the underlying collections for number systems, functions and abstract structures.
Education uses set diagrams to represent relationships among subjects, categories and groups.
Worked Example
Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, A = {2, 4, 6, 8, 10}, and B = {2, 3, 5, 7}. Step 1: Find A ∪ B. Include every element appearing in A or B: A ∪ B = {2, 3, 4, 5, 6, 7, 8, 10}. Step 2: Find A ∩ B. Identify elements common to both sets: A ∩ B = {2}. Step 3: Find A − B. Keep elements in A that are not in B: A − B = {4, 6, 8, 10}. Step 4: Find Aᶜ relative to U. Include elements of U that are not in A: Aᶜ = {1, 3, 5, 7, 9}. Step 5: Find the cardinalities. |A| = 5, |B| = 4 and |A ∩ B| = 1. Therefore, |A ∪ B| = 5 + 4 − 1 = 8. The result agrees with the eight distinct elements listed in the union.
Common Misconceptions
A set contains distinct elements; repeating an element does not create an additional member. For example, {1, 2, 2, 3} = {1, 2, 3}.
The order of elements does not matter in a set. Thus, {a, b, c} = {c, a, b}.
The empty set is not the same as a set containing the empty set: ∅ ≠ {∅}.
An element and a subset are different concepts. For example, 2 ∈ {1, 2, 3}, but {2} ⊆ {1, 2, 3}.
A proper subset must be smaller in the sense that it is not equal to the original set.
The complement of a set depends on the universal set being used.
The union does not mean only the common elements; that is the intersection.
Set difference is order-dependent: A − B is not generally equal to B − A.
Equivalent sets have the same cardinality but do not necessarily contain the same elements.
A collection described by a vague or subjective condition may not be a well-defined set.
Practice Questions
| Question | Answer | Explanation |
|---|---|---|
What is a set, and what is an element? | A set is a well-defined collection of distinct objects, and an element is an individual object belonging to that collection. | For A = {2, 4, 6}, the number 4 is an element of A. |
If A = {1, 2, 3} and B = {3, 4, 5}, find A ∪ B. | {1, 2, 3, 4, 5}. | The union contains every distinct element appearing in either set. |
Using the same sets, find A ∩ B. | {3}. | The intersection contains only the elements common to both sets. |
If U = {1, 2, 3, 4, 5, 6} and A = {2, 4, 6}, find Aᶜ. | {1, 3, 5}. | The complement contains the elements of U that are not in A. |
Is {1, 2} a proper subset of {1, 2, 3}? | Yes. | Every element of the first set belongs to the second, and the two sets are not equal. |
A finite set contains 4 elements. How many subsets does it have? | 16 subsets. | A set with n elements has 2ⁿ subsets. Therefore, 2⁴ = 16. |
If |A| = 12, |B| = 9 and |A ∩ B| = 4, find |A ∪ B|. | 17. | Use |A ∪ B| = |A| + |B| − |A ∩ B| = 12 + 9 − 4 = 17. |
Key Takeaway
A set is a well-defined collection of distinct elements. Membership notation, subsets, cardinality, union, intersection, difference and complement provide a precise language for describing and manipulating collections throughout mathematics and its applications.
Prerequisites
Introduction to Mathematics
Mathematical Language and Notation
Mathematical Symbols and Their Meanings
Mathematical Statements and Expressions
Logic and Logical Thinking in Mathematics
Reference
OpenStax, Contemporary Mathematics, set theory and mathematical foundations.
OpenStax, Discrete Mathematics, sets, relations and functions.
NCTM, Principles and Standards for School Mathematics, representation and mathematical reasoning.
Paul R. Halmos, Naive Set Theory, foundational concepts and notation in set theory.
Related Topics
Mathematical Language and Notation
Mathematical Symbols and Their Meanings
Mathematical Statements and Expressions
Logic and Logical Thinking in Mathematics
Mathematical Definitions, Axioms and Theorems
Mathematical Models and Real-World Applications
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.