Quotient Spaces
When can two vectors be treated as "the same" for some construction? This holds even though they are literally different. This question drives an idea that recurs across all of mathematics. Collapse a space by an equivalence relation and study what remains. In linear algebra, the natural source of such an equivalence is a subspace of a vector space . Declare two vectors equivalent if they differ by an element of . The set of equivalence classes, called cosets, turns out to carry its own structure. This is the natural vector space structure — the quotient space . This construction matters because it is the algebraic mechanism behind "modding out" unwanted directions. Suppose represents some redundancy. It could be a kernel of a linear map, a set of relations, or a subspace we wish to ignore. Then is exactly with that redundancy erased. Everything linear about stays intact. The quotient construction is the linear-algebra shadow of a broader pattern. This pattern appears in group theory (quotient groups), ring theory (quotient rings), and topology (quotient spaces). Take a set, and an equivalence relation compatible with the structure. Then inherit the structure on the classes. The big picture is that is not merely an abstract bookkeeping device. It is canonically isomorphic to the image of any linear map out of . That map's kernel must be exactly . This is the content of the First Isomorphism Theorem for vector spaces. It is built directly on the quotient construction. Quotients also give a coordinate-free way to talk about " modulo ." This works without choosing a complement. This becomes essential once one studies dual spaces, exact sequences, and tensor products. This article builds the quotient space from scratch. We define cosets and verify the equivalence relation they induce. We define addition and scalar multiplication on cosets. We prove these operations are well-defined and satisfy the vector space axioms. We construct the natural projection map . We establish its universal property. We close by previewing how relates to and . This holds in the finite-dimensional case, a fact developed fully elsewhere.
- A coset of a subspace is a set ; cosets partition .
- Two vectors lie in the same coset of exactly when .
- The set of all cosets, denoted , becomes a vector space under and .
- These operations are well-defined precisely because is a subspace (closed under addition and scalar multiplication).
- The map , , is linear, surjective, with .
- Key idea: Quotienting by turns "equal modulo " into genuine equality, while the linear structure survives the collapse.
Where this lives today
Quotient spaces are not a curiosity confined to pure algebra; they are a working tool wherever linear structure needs to be simplified by discarding a chosen subspace.
- Linear algebra itself: the First Isomorphism Theorem for vector spaces states that for any linear map , the induced map from the Corollary above is an isomorphism — this is how ranks, images, and kernels are unified conceptually.
- Functional analysis: quotients of Banach or Hilbert spaces by closed subspaces are essential in defining spaces like , and quotient norms make itself a normed space.
- Algebraic topology and homological algebra: homology and cohomology groups are literally defined as quotients of vector spaces (or modules) — cycles modulo boundaries.
- Representation theory: quotient representations of a group action on arise whenever is an invariant subspace, letting one study representations by induction on dimension.
- Coding theory: in the theory of linear codes, quotient spaces (for a linear code ) organize cosets used in syndrome decoding, directly exploiting that cosets partition the ambient space.
- Physics (gauge theories): physical states are often defined as equivalence classes of field configurations modulo gauge transformations, a quotient-space idea (in an appropriately generalized, often nonlinear, setting) whose linear shadow is exactly the vector-space quotient here.
- Statistics: in linear regression, the residual space is naturally described via a quotient of the response space by the column space of the design matrix, connecting directly to orthogonal projections and least squares.
Ask the tutor: How does the dimension formula get proved in full, and how does it feed into the First Isomorphism Theorem for linear maps?
Let be a vector space over a field , and let be a subspace of . For , the coset of containing is the set
The quotient set is the set of all cosets of :
Define addition and scalar multiplication on by
for and . When these operations are shown to be well-defined (independent of the representatives chosen for their cosets), equipped with them is called the quotient space of by . The canonical (natural) projection is the map
Intuition
Think of as a set of directions you have decided not to care about. Two vectors and should be considered "the same" if the only way they differ is by moving along — that is, if . This is exactly the relation , and its equivalence classes are precisely the cosets . Geometrically, if and is a line through the origin, each coset is a line parallel to (or itself, when ). These parallel lines tile the plane without overlapping — they partition . The quotient space treats each entire line as a single point. Adding two cosets means: pick any point on each line, add the points, and take the parallel line through the sum; the well-definedness claim is that it does not matter which points you picked. A second useful picture: if you choose a complement with (via Direct Sums of Subspaces), then every coset contains exactly one vector of , and the map sending a coset to that unique representative gives a vector space isomorphism . This shows "looks like" a complement of — but crucially, is defined without ever choosing one.
Let be a vector space over a field , and let be a subspace of . Then: 1. The relation is an equivalence relation on , and its equivalence classes are exactly the cosets ; in particular the cosets partition . 2. The operations
are well-defined on : they do not depend on the choice of representative for each coset. 3. Equipped with these operations, is a vector space over , with zero element and additive inverse . 4. The map , , is linear and surjective, and
We prove each part in turn, using only the definition of subspace (nonempty, closed under addition and scalar multiplication) and the vector space axioms for .
(1) Equivalence relation and cosets as classes. Reflexive: since is a subspace, so . Symmetric: If , then . Since is closed under scalar multiplication, , so . Transitive: If and , then and . Since is closed under addition, , so . Thus is an equivalence relation, and equivalence relations always partition their underlying set into disjoint equivalence classes whose union is the whole set. It remains to identify the class of with the coset . The equivalence class of is . If , write for some ; then . Conversely if for some , then , so . Hence exactly, proving cosets are the equivalence classes. Since equivalence classes partition , so do cosets: every vector lies in exactly one coset, and two cosets are either identical or disjoint.
(2) Well-definedness of the operations. Suppose and . We must show
By part (1), means , i.e. ; call this . Likewise for some . Then
using closure of under addition. By part (1) again, this means . So addition of cosets is well-defined. For scalar multiplication, suppose , so for some . For ,
using closure of under scalar multiplication. Hence , so scalar multiplication of a coset by is well-defined. Note precisely where subspace hypotheses were used: closure under addition made coset addition well-defined; closure under scalar multiplication made scalar multiplication well-defined. (This is exactly where the Counterexample below will fail if is not a subspace.)
(3) Vector space axioms for . We verify the axioms directly, each reducing to the corresponding axiom in via the well-defined operations from part (2).
- Additive associativity: , using associativity in .
- Additive commutativity: , using commutativity in .
- Additive identity: The coset satisfies for all , so is the zero vector of .
- Additive inverses: For , the coset satisfies , the zero of . So .
- Scalar multiplication distributes over vector addition: , using distributivity in .
- Scalar multiplication distributes over scalar addition: .
- Scalar multiplication is compatible with field multiplication: .
- Unit scalar: .
Every axiom for has been reduced to, and verified by, the corresponding axiom holding in . Hence is a vector space over .
(4) The projection is linear, surjective, with kernel . Linearity: For and ,
directly by the definitions of the operations on from part (2). This is exactly the definition of a linear map. Surjectivity: Every element of has the form for some (this is how was defined as a set), and . So every element of is hit. Kernel: By definition, . Since (identified in part (3)), we have
Now if and only if : indeed if , then for every , (closure) and every element of is with , so ; conversely if then . Hence , as claimed. This completes the proof of all four parts.
∎Let be vector spaces over , a subspace, and a linear map with . Then there is a unique linear map such that , namely
Moreover is injective if and only if .
Well-definedness of . Suppose , so . Then , so . Hence does not depend on the representative , and is a well-defined function . Linearity of . For and ,
using linearity of . So is linear. Factorization. For : . So . Uniqueness. If is linear with , then for every , . So . Injectivity criterion. Suppose . If , then , so , so . Since is linear and , is injective (a linear map is injective iff its kernel is trivial, which follows from linearity: ). Conversely if , pick ; then (since ) yet , so is not injective.
∎Worked examples
Example 1 — A concrete subspace of with asymmetric data. Let and let , a plane through the origin (indeed a subspace since it is the kernel of the linear functional ). Take and . We first check whether and lie in the same coset:
Test membership in : . So , and : these are genuinely different cosets. Now compute the sum of cosets using the definition:
Check: , confirming , consistent with the sum being a nontrivial coset. To double check well-definedness concretely, replace by another representative of the same coset. Since — let's find directly: take ; check , so . Then is another representative of . Also pick (check: ✓.) so represents . Recompute the sum with the new representatives:
The theorem asserts . Check by subtracting:
and test membership: . Indeed , confirming the two representatives give the same coset — well-definedness holds as guaranteed by the theorem. Finally, exhibit the quotient concretely. Since is a 2-dimensional plane (a hyperplane) in , and is a linear functional vanishing exactly on , the map
is well-defined (it factors the functional through exactly as in the Universal Property Corollary, since ) and is a linear isomorphism . This exhibits , foreshadowing Dimension of Quotient Spaces.
Example 2 — A quotient of a polynomial space by a non-obvious subspace. Let , real polynomials of degree at most , a 4-dimensional space with basis . Let
This is a subspace: it's the kernel of the linear map , , and kernels of linear maps are always subspaces (this follows directly from linearity: if then ). We compute . Write . Then
The conditions are two independent linear equations in — independent because, e.g., setting and produces different, non-proportional solutions for (specifically vs. after solving), so the map has rank . Hence by rank-nullity. A concrete basis for : try . Check: , , . Good, . Try . Check: ; , . Good, . Since are linearly independent (different degrees, 2 and 3) and , is a basis of : indeed , the multiples of of degree . Now consider two specific polynomials and . Are and the same coset? Compute
Test membership in by checking and :
Since this already fails, , so — distinct cosets. By the Corollary (Universal Property), the map has exactly, so it factors as an injective linear map , . Since and is injective between equal finite dimensions, is a linear isomorphism. Concretely,
These differ (as they must, since the cosets are distinct), giving a fully computed isomorphism carrying and .
The well-definedness of coset addition (Theorem, part 2) used both closure properties of . Drop the requirement that be a subspace — take instead an arbitrary subset — and the operations on "cosets" stop being well-defined. Let and let , a two-point subset that is not a subspace (it is not closed under addition: ; also not closed under scalar multiplication: ). Define "cosets" for , and attempt to define addition of cosets by , mimicking the quotient construction. Take and its alternate representative ; both lie in the same coset since , so as sets, (indeed — wait, check directly: . This is already different from ! This is the failure in its sharpest form: even the "coset" of is not equal to the "coset" of , even though was supposed to be an alternate representative "in" the coset of (since ). The relation " and give the same coset" fails to even be well-behaved, because is not closed under addition: the proof of transitivity in part (1) of the Theorem used , which requires closure under addition, and that fails here (). Concretely take fixed. Using representative : . Using representative (same coset as by the definition , since ): . These two computed "sums" — versus — are different sets, even though and were interchangeable representatives. The addition rule gives two different answers depending on which representative was used: it is not well-defined. This is precisely the failure that the subspace hypothesis (closure under and scalar multiplication) was designed to prevent in the proof of part (2) of the Theorem.
Scope, edge cases & common traps
| Situation | What happens | Why |
|---|---|---|
| naturally, via | Every coset is a singleton ; is a bijection since | |
| , the zero vector space | Every vector is in one coset, namely itself, which is the zero of | |
| infinite-dimensional, finite-dimensional | is still infinite-dimensional in general | Quotienting by a "small" subspace does not reduce dimension much; see the foreshadowed dimension formula for the precise finite-dim statement |
| Consequence of the Rank–Nullity theorem applied to , since and is surjective — developed fully in Dimension of Quotient Spaces | ||
| Choosing a complement with | via | Existence of complements (from Direct Sums of Subspaces) gives a concrete model of , but itself needs no such choice |
| Forgetting must be a subspace | Coset "addition" becomes ill-defined | See the Counterexample: closure under and scalar multiplication in is exactly what makes the operations respect representatives |
The mathematician behind it
Origins · 1 minEmmy Noether and how this was discovered
Emmy Noether did not invent quotient vector spaces as an isolated gadget; she was the driving force behind recognizing quotient constructions — quotient groups, quotient rings, quotient modules, and their linear-algebraic special case — as instances of one unifying algebraic pattern. Working in Göttingen in the 1920s, she reoriented algebra away from computation with explicit formulas and toward structural reasoning about homomorphisms, kernels, and the objects they naturally produce. The quotient space construction in this article, and the universal property tying to any linear map killing , is a direct descendant of her structural viewpoint, later systematized by her students and collaborators (van der Waerden's influential textbook Moderne Algebra is built on her lectures) and still the lingua franca of algebra, representation theory, and homological methods across mathematics and physics.
What exactly is an element of : a vector, or a set of vectors?
An element of is a set — specifically a coset , which is a subset of containing possibly infinitely many vectors of . It is common, and usually harmless, to say "let be a vector in ," treating the coset as a single point of the new vector space . This is legitimate because really is a vector space in its own right (per the Theorem), so its elements deserve to be called vectors — they just happen to be represented as sets of vectors of . The key discipline is to always check that any construction using a representative is independent of which representative was chosen, exactly as done in the well-definedness proof.
Why do we need to be a subspace rather than, say, a subgroup of only?
If is only being treated as an abelian group under addition, a subgroup suffices to define the quotient group , and the coset addition is well-defined by the same argument as part (2) of the Theorem restricted to additive closure. However, to get a vector space structure — meaning scalar multiplication also descends to — we additionally need closed under scalar multiplication by every , which is exactly the subspace condition. Without it, as the Counterexample-adjacent reasoning shows, would not be well-defined: different representatives of the same coset could scale to different cosets.
Is always injective?
No, and in fact is injective if and only if . Since (part 4 of the Theorem), and a linear map is injective exactly when its kernel is trivial, is injective precisely when . If , any nonzero satisfies , so collapses and (and indeed all of ) to the single point of . This collapsing is the entire purpose of the construction: is designed to identify vectors differing by an element of .
How does choosing a complement of relate to ?
If for some subspace (guaranteed to exist when is finite-dimensional, by extending a basis of , per Direct Sums of Subspaces), then the restriction of to , namely , is a linear isomorphism. Injectivity holds because (a defining property of direct sums), so . Surjectivity holds because every coset has for unique , and . So — but this isomorphism depends on the choice of , whereas itself is defined with no such choice, which is its main conceptual advantage.
Does the quotient construction work for infinite-dimensional vector spaces?
Yes — nothing in the definition of coset, in the well-definedness proof, or in the vector space axiom verification used finite-dimensionality anywhere. The Theorem as proved holds for arbitrary vector spaces over an arbitrary field , subject only to being a subspace. Infinite-dimensional examples are common and important: e.g., in functional analysis, might be a space of sequences or functions and a subspace of "negligible" elements (such as sequences converging to , or functions vanishing outside a bounded set), with used to construct new spaces with desired properties.
How does relate to the rank–nullity theorem?
Applying rank–nullity to the projection when is finite-dimensional gives . Since (Theorem, part 4) and is surjective so , this becomes , i.e. . This is the precise finite-dimensional dimension formula, whose full statement and further consequences (e.g. relating it to the First Isomorphism Theorem) are developed in Dimension of Quotient Spaces.
Can two different subspaces produce isomorphic quotient spaces ?
Yes, easily, once dimension is the only invariant being matched: in a finite-dimensional , any two subspaces of the same dimension yield quotient spaces of the same dimension , hence isomorphic quotient spaces as abstract vector spaces (any two finite-dimensional vector spaces of equal dimension over the same field are isomorphic, via Coordinates Relative to a Basis). However, such an isomorphism is generally not compatible with the two projections simultaneously — it exists only after forgetting the specific subspaces involved, so it does not mean and play the same structural role in .