Definition of an equivalence class: Let ~ be an equivalence relation on a set A. The equivalence class of a ∈ A is the set of all elements x ∈ A such that x ~ a.
Notation: The equivalence class of a is commonly written [a] or [a]_~.
Equal or disjoint property: If two equivalence classes have at least one common element, they must be equal. Otherwise, they are disjoint. This follows from symmetry and transitivity.
Partition: A partition of A is a collection of nonempty subsets of A such that every element of A belongs to exactly one subset. The subsets are pairwise disjoint and their union is A.
Connection: Every equivalence relation on a set produces a partition of that set. Conversely, every partition determines an equivalence relation by declaring two elements equivalent when they belong to the same block.
Quotient set: The set of all equivalence classes is denoted A/~. Its elements are subsets of A rather than individual elements of A.
Importance: Quotient sets allow mathematicians to treat elements that differ in representation but share a chosen property as equivalent.
Equivalence Classes and Partitions
An equivalence class is the collection of all elements related to a particular element by an equivalence relation. Equivalence classes divide a set into nonempty, mutually disjoint subsets whose union is the entire original set. This division is called a partition.
[a] = {x ∈ A : x ~ a}
Explanation
Example or application
A worked example has not yet been added.
Key Properties
Every element belongs to its own equivalence class.
Two equivalence classes are either identical or disjoint.
The union of all equivalence classes is the original set.
Every equivalence class is nonempty.
Equivalence classes form a partition.
Examples
| Name | Set | Relation | Classes | Explanation |
|---|---|---|---|---|
Parity classes | Z | a ~ b when a - b is divisible by 2 |
| The integers are partitioned into exactly two equivalence classes. |
Congruence modulo 3 | Z | a ~ b when 3 divides (a - b) |
| Every integer belongs to one of the three residue classes. |
Applications
Construction of integers modulo n.
Formation of quotient groups and quotient rings.
Classification of objects into mathematically meaningful categories.
Simplifying mathematical structures by identifying equivalent elements.
Common Mistakes
Assuming different representatives always produce different equivalence classes.
Allowing two blocks of a partition to overlap.
Forgetting that every block in a partition must be nonempty.
Confusing an equivalence class with an individual element.
Related Concepts
Equivalence Relations
Partitions
Quotient Sets
Congruence Modulo n
Learning Outcomes
Construct an equivalence class from a relation.
Explain why equivalence classes are equal or disjoint.
Identify a partition of a set.
Connect equivalence relations with quotient sets.
Learning Guide
Core Idea
An equivalence class is the collection of all elements related to a particular element by an equivalence relation. Equivalence classes divide a set into nonempty, mutually disjoint subsets whose union is the entire original set. This division is called a partition.
Worked Example
Name: Parity classes
Set: Z
Relation: a ~ b when a - b is divisible by 2
Classes: Even integers, Odd integers
Explanation: The integers are partitioned into exactly two equivalence classes.
Name: Congruence modulo 3
Set: Z
Relation: a ~ b when 3 divides (a - b)
Classes: [0], [1], [2]
Explanation: Every integer belongs to one of the three residue classes.
How To Study
Write the formal definition and identify every object, operation, and hypothesis.
Work through the supplied example one step at a time; explain why each step is valid.
Check the listed properties and compare the example with at least one common mistake.
Try the self-check questions without looking at the answers, then explain the reasoning aloud or in writing.
Self Check
| Question | Answer |
|---|---|
In your own words, what is equivalence classes and partitions? | An equivalence class is the collection of all elements related to a particular element by an equivalence relation. Equivalence classes divide a set into nonempty, mutually disjoint subsets whose union is the entire original set. This division is called a partition. |
What definition, condition, or property should you check first when solving a problem about equivalence classes and partitions? | Start by checking the relevant defining properties: Every element belongs to its own equivalence class; Two equivalence classes are either identical or disjoint; The union of all equivalence classes is the original set; Every equivalence class is nonempty. Verify every required hypothesis before applying a theorem. |
How is equivalence classes and partitions connected to the wider study of abstract algebra? | It belongs to Foundations and mathematical language. It connects naturally with Equivalence Relations, Partitions, Quotient Sets, Congruence Modulo n. |
Mastery Checklist
I can state the definition of equivalence classes and partitions accurately.
I can identify the assumptions and notation used in a problem.
I can explain at least one example and justify each important step.
I can recognize a common mistake and explain why it is incorrect.
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.
- Standard set-theory and abstract-algebra material; no specific external reference has been independently verified.