1.3 Equality, Identity, and Equivalence

Mathematics depends on precise notions of sameness. The symbol = appears simple, but it carries different meanings depending on context. This section separates three levels: equality, identity, and equivalence.

Equality is the strictest notion. Two objects are equal if they are the same object in the underlying system.

a = b

In set theory, equality is extensional. Two sets are equal when they have exactly the same elements.

A = B  if and only if  ∀x (x ∈ A ↔ x ∈ B)

This definition ignores how the sets are described. The sets {1,2,3} and {3,2,1} are equal because membership matches.

Equality behaves predictably:

Substitution is critical. If a = b, then any statement about a remains true when a is replaced by b.

Identity is more subtle. It asks whether two objects should be regarded as the same within a structure. Identity may depend on how objects are constructed or labeled.

For example, consider ordered pairs:

(1,2) ≠ (2,1)

The elements match as a set {1,2}, but the order matters. Identity includes structure beyond membership.

In algebra, identity often refers to the neutral element of an operation:

a + 0 = a
a * 1 = a

Here, 0 and 1 are identity elements for addition and multiplication. This is a different use of the word “identity.” Context determines meaning.

In type-theoretic settings, identity may require a proof or witness. Two objects may be equal in value but not identical in construction. This distinction appears in formal verification and proof assistants.

Equivalence is a controlled weakening of equality. Two objects are equivalent if they share a property of interest, even if they are not equal.

An equivalence relation is a relation ~ that satisfies:

Equivalence partitions a set into classes. Each class contains objects considered the same under the chosen relation.

Examples appear across mathematics.

Equivalence reduces complexity. Instead of studying all objects individually, we study classes of objects that behave the same under a given criterion.

Isomorphism is a central example. Two structures are isomorphic when there exists a bijective map that preserves structure.

f(a ⋆ b) = f(a) ⋆ f(b)

This equation expresses preservation of an operation ⋆. The exact form depends on the structure. In groups, ⋆ is the group operation. In vector spaces, it includes addition and scalar multiplication. In graphs, it preserves adjacency.

Isomorphic objects are treated as the same for structural purposes. This idea allows classification results. For example, all finite-dimensional vector spaces over a field are determined up to isomorphism by their dimension.

Equality, identity, and equivalence form a hierarchy.

Confusion arises when these levels are mixed. For example, writing A = B when only an isomorphism exists hides important structure. In careful writing, one distinguishes:

A = B        (exact equality)
A ≅ B        (isomorphism)
A ~ B        (equivalence)

Each symbol signals a different claim.

In practice, mathematicians often blur these distinctions once the context is clear. After proving two structures are isomorphic, they may be treated as interchangeable. This simplifies reasoning but assumes that structure-preserving maps have already been established.

A precise approach follows a pattern:

This pattern appears in many fields. In group theory, groups are classified up to isomorphism. In topology, spaces are classified up to homeomorphism. In linear algebra, matrices are classified up to similarity.

Choosing the right notion of sameness is a design decision. Too strict, and the theory becomes rigid. Too weak, and distinctions disappear. The appropriate level depends on the problem.

Mathematics progresses by replacing raw equality with structured equivalence where possible. This shift reveals deeper invariants and reduces complexity.