1 Definition

A quotient set is formed by taking a set and grouping together elements that are regarded as equivalent under a specified equivalence relation. Instead of working with individual elements, one works with the collection of equivalence classes determined by that relation. Each class represents a single “block” of mutually equivalent elements, and together these classes exhaust the original set.

Quotient sets provide a precise language for treating different representatives as standing for the same abstract object. This idea is common throughout mathematics, where it is often useful to ignore distinctions that do not matter for the problem at hand.

1.1 Equivalence relations

An equivalence relation on a set is a relation that is reflexive, symmetric, and transitive. Reflexivity means every element is related to itself. Symmetry means that if one element is related to another, then the reverse is also true. Transitivity means that if one element is related to a second, and the second to a third, then the first is related to the third.

These three properties ensure that the relation behaves like a notion of sameness. Many familiar relations, such as equality and congruence modulo an integer, are examples of equivalence relations.

1.2 Equivalence classes

Given an element in a set with an equivalence relation, its equivalence class is the collection of all elements related to it. Every element belongs to exactly one equivalence class, and two elements lie in the same class precisely when they are equivalent.

Equivalence classes are the basic building blocks of a quotient set. They collect all objects that are indistinguishable with respect to the chosen relation, allowing them to be treated as a single unit.

1.3 Formation of the quotient set

The quotient set is the set whose elements are the equivalence classes of the original set. It is obtained by replacing each element with the class to which it belongs. This construction compresses the original set according to the equivalence relation, producing a new set with fewer, more abstract elements.

Although the elements of a quotient set are subsets of the original set, they are regarded as new objects in their own right. The quotient set therefore records the structure induced by the equivalence relation rather than the original individual elements.

2 Notation and basic properties

Quotient sets are commonly written in a compact form that emphasizes the underlying equivalence relation. Their basic properties follow directly from the way equivalence classes partition the set.

2.1 Standard notation

If an equivalence relation is denoted by a symbol such as ~ on a set X, the quotient set is often written as X/~. The class of an element x is frequently written as [x], [x]~, or x̄, depending on context and tradition.

This notation highlights the fact that the quotient set depends not only on the underlying set, but also on the relation used to identify its elements.

2.2 Partition of a set

A quotient set naturally determines a partition of the original set. The equivalence classes are pairwise disjoint, no class is empty, and their union is the entire set. In this way, every element is assigned to exactly one block of the partition.

The partition viewpoint is useful because it describes the quotient set as a decomposition of the original set into non-overlapping pieces. Each piece corresponds to one abstract element of the quotient.

2.3 Canonical projection

There is a natural map from the original set to its quotient set called the canonical projection. This map sends each element to its equivalence class. It is surjective, since every class has at least one representative.

The canonical projection is central to the theory of quotient constructions. It formalizes the passage from concrete elements to the abstract classes that replace them.

3 Examples

Examples make quotient sets easier to visualize, especially when the equivalence relation has a familiar interpretation. They show how the same construction appears in arithmetic, combinatorics, and geometry.

3.1 Congruence modulo an integer

A standard example comes from integers modulo n. Two integers are equivalent if they differ by a multiple of n. The quotient set consists of the residue classes modulo n, usually represented by 0, 1, 2, and so on up to n - 1.

This quotient set captures cyclic arithmetic. Different integers may represent the same class, but they behave identically with respect to congruence modulo n.

3.2 Quotient set of ordered pairs

A quotient set can be formed from ordered pairs by identifying pairs that satisfy a chosen relation. For example, one may declare two pairs equivalent when they have the same sum, or when they represent the same ratio under an appropriate condition.

Such constructions are often used to create new objects from simpler data. The quotient set records only the feature that matters, while discarding other information.

3.3 Quotient set from geometric identification

In geometry, quotient sets arise when points are identified according to a rule. For instance, points on the boundary of a shape may be paired together to produce a new space after identification. The resulting quotient set describes the collection of equivalence classes of points under that gluing rule.

This process is a basic tool for building geometric objects from simpler pieces. It allows one to impose identifications and study the outcome as a single unified structure.

4 Relation to partitions

Quotient sets and partitions are two closely related ways of expressing the same data. Each equivalence relation gives a partition, and each partition determines an equivalence relation.

4.1 From equivalence relations to partitions

Starting with an equivalence relation, one forms the equivalence classes. These classes automatically partition the set, because each element belongs to exactly one class and no element can lie in two different classes.

This direction is immediate from the defining properties of an equivalence relation. The classes are the visible manifestation of the relation.

4.2 From partitions to equivalence relations

Conversely, any partition of a set determines an equivalence relation. Two elements are declared equivalent when they lie in the same part of the partition. This relation is reflexive, symmetric, and transitive because the parts are disjoint and cover the whole set.

In this way, a partition is not merely a collection of subsets but also a rule for identifying elements. It encodes the same information as an equivalence relation.

4.3 One-to-one correspondence

There is a one-to-one correspondence between equivalence relations on a set and partitions of that set. This correspondence is fundamental because it shows that quotient sets can be understood either as families of equivalence classes or as partitions arising from a relation.

The equivalence between these viewpoints makes quotient constructions highly flexible. Depending on the application, one may begin with a relation or with a partition and arrive at the same quotient structure.

5 Quotient sets in algebra

In algebra, quotient sets provide the raw material for quotient structures. Additional operations are then defined on equivalence classes, producing objects such as quotient groups, quotient rings, and quotient modules.

5.1 Quotient groups

A quotient group is formed from a group together with a normal subgroup. Its underlying set consists of cosets, which are equivalence classes under the relation of belonging to the same coset.

5.1.1 Cosets and normal subgroups

Cosets partition the group into equivalence classes. A subgroup must satisfy a compatibility condition, namely normality, so that the quotient construction behaves well under the group operation.

Normality ensures that the choice of representative does not affect the resulting class-level product. Without it, the induced operation may fail to be consistent.

5.1.2 Induced group operation

The group operation on the quotient is defined by multiplying representatives and then passing to the corresponding class. This is possible because the operation is independent of the chosen representatives when the subgroup is normal.

The quotient group thus inherits a valid group structure. It often simplifies the original group by identifying elements that differ only by the subgroup being collapsed.

5.2 Quotient rings

Quotient rings are built from rings by identifying elements that differ by elements of an ideal. The quotient set of equivalence classes becomes a ring once addition and multiplication are defined on classes.

5.2.1 Ideals and ring equivalence

An ideal plays the role that a normal subgroup plays in group theory. Two ring elements are equivalent if their difference lies in the ideal. This relation creates classes that can be treated as single ring elements.

The ideal ensures that the induced arithmetic remains well behaved. It is the correct subset to collapse while preserving ring structure.

5.2.2 Induced ring structure

Operations on the quotient ring are defined by performing the operation on representatives and then taking the corresponding class. Because the ideal absorbs the necessary differences, the result does not depend on the chosen representatives.

This construction is widely used in algebraic number theory and commutative algebra. It produces rings with simpler behavior or with properties tailored to a particular problem.

5.3 Quotient modules

Modules also admit quotient constructions. If a submodule is given, elements are identified when their difference lies in that submodule. The quotient set of classes then becomes a module under naturally induced addition and scalar multiplication.

Quotient modules are a basic tool for analyzing module structure. They provide a way to remove a chosen submodule and study the remainder in a more manageable form.

6 Functions on quotient sets

Maps defined on quotient sets must respect the underlying equivalence relation. This leads to the notion of well-definedness and to the idea of factoring a function through a quotient.

6.1 Well-defined maps

A function on a quotient set is well defined if it assigns the same value to all representatives of a class. Since a quotient element represents many original elements, the definition must not depend on which representative is chosen.

This requirement is essential in every quotient construction. If it fails, the function does not descend from the original set to the quotient.

6.2 Factorization through quotient sets

A map from a set to another object often factors through the quotient set when it is constant on equivalence classes. In that case, the original map can be written as a composition of the canonical projection followed by a map from the quotient.

This factorization expresses the quotient as the correct level of abstraction for the problem. It removes irrelevant distinctions before the target map is applied.

6.3 Universal property

Quotient sets satisfy a universal property: any map from the original set that is constant on equivalence classes uniquely factors through the quotient set. This property characterizes the quotient up to unique bijection.

The universal property explains why quotient sets are so central. They are not only a construction, but also the most efficient and canonical way to encode an equivalence relation.

Quotient sets appear in several branches of mathematics under different names and interpretations. The common theme is the identification of objects according to an equivalence rule.

7.1 Quotient spaces in topology

In topology, a quotient space is obtained from a space by identifying points and then giving the resulting set a topology that makes the projection continuous. The underlying set of the quotient space is a quotient set, but additional structure is present.

This construction is used to build spaces with prescribed features. It is a standard method for turning point identifications into topological objects.

7.2 Orbit spaces under group actions

When a group acts on a set, the orbits form equivalence classes under the relation of being connected by the action of some group element. The set of orbits is therefore a quotient set.

Orbit spaces are important because they describe the set of distinct configurations up to symmetry. They capture the idea that points in the same orbit should be treated as equivalent.

7.3 Collapsing and identification spaces

More generally, quotient constructions can be viewed as collapsing selected parts of a set into single points or single classes. This perspective appears in many areas of mathematics, especially where one wants to impose identifications by hand.

Identification spaces are useful for constructing new objects from old ones. They encode a prescribed pattern of sameness and provide a systematic way to study the result.