A module is meant to be a linear world: we can add elements, multiply them by scalars from a ring, and study maps that respect both operations. But linear worlds often contain redundant directions. A system of equations may identify two solutions if they differ by a homogeneous solution; a homomorphism may forget exactly the elements in its kernel; a representation may have a stable subspace that we want to collapse. The quotient module is the construction that turns such identifications into a new module rather than an informal rule.

The guiding question is this: if $N$ is a submodule of an $R$-module $M$, can we treat all elements of $N$ as zero while keeping the remaining module structure intact? The answer is yes, and the quotient module $M/N$ is the most efficient object that does exactly that.

[example: Collapsing Even Integers] Let $R=\mathbb{Z}$, let $M=\mathbb{Z}$ as a $\mathbb{Z}$-module, and let $N=2\mathbb{Z}$. For integers $a,b\in\mathbb{Z}$, the cosets $a+2\mathbb{Z}$ and $b+2\mathbb{Z}$ are equal exactly when $a-b\in 2\mathbb{Z}$, so the quotient identifies precisely the integers with the same parity. Every integer is either even or odd. If $m$ is even, then $m=2q$ for some $q\in\mathbb{Z}$, so $m\in 2\mathbb{Z}$ and \begin{align*} m+2\mathbb{Z}=0+2\mathbb{Z}. \end{align*} If $m$ is odd, then $m=2q+1$ for some $q\in\mathbb{Z}$, so $m-1=2q\in 2\mathbb{Z}$ and \begin{align*} m+2\mathbb{Z}=1+2\mathbb{Z}. \end{align*} Thus the only cosets are $0+2\mathbb{Z}$ and $1+2\mathbb{Z}$. Addition is computed by adding representatives and then passing to the resulting coset: \begin{align*} (1+2\mathbb{Z})+(1+2\mathbb{Z})=(1+1)+2\mathbb{Z}. \end{align*} Since $1+1=2$ and $2-0=2\in 2\mathbb{Z}$, this becomes \begin{align*} 2+2\mathbb{Z}=0+2\mathbb{Z}. \end{align*} Scalar multiplication is computed in the same way: \begin{align*} n(1+2\mathbb{Z})=n\cdot 1+2\mathbb{Z}=n+2\mathbb{Z}. \end{align*} Therefore $n(1+2\mathbb{Z})=0+2\mathbb{Z}$ when $n$ is even, and $n(1+2\mathbb{Z})=1+2\mathbb{Z}$ when $n$ is odd. The quotient module $\mathbb{Z}/2\mathbb{Z}$ keeps exactly the parity of an integer and forgets everything divisible by $2$. [/example]

This example is small, but it shows the essential feature: the quotient does not choose preferred representatives. It makes the entire submodule invisible and remembers only cosets. The construction is useful exactly because all computations are invariant under changing representatives by elements of the submodule.

## Definition

The parent concept is a [module](/page/Module): an [abelian group](/page/Abelian%20Group) equipped with scalar multiplication by a ring. A quotient module asks for one extra ingredient, a submodule $N \subset M$, because only submodules are stable enough to be collapsed without breaking addition and scalar multiplication. The definition answers the practical question of how to turn the instruction "treat every element of $N$ as zero" into an actual module.

[definition: Quotient Module] Let $R$ be a ring, let $M$ be a left $R$-module, and let $N \subset M$ be an $R$-submodule. The quotient module $M/N$ is the set of additive cosets \begin{align*} M/N = \{m + N : m \in M\}, \end{align*} with addition map $+: (M/N)\times(M/N)\to M/N$ defined by \begin{align*} (m + N) + (m' + N) = (m + m') + N, \end{align*} and scalar multiplication map $R\times(M/N)\to M/N$ defined by \begin{align*} r(m + N) = rm + N, \end{align*} for all $m,m' \in M$ and $r \in R$. [/definition]

The definition is deliberately short because all the work is hidden in the word submodule. If $N$ were only a subset, addition or scalar multiplication could depend on the chosen representative. The condition $N \subset M$ as a submodule is precisely what makes the two displayed operations meaningful.

The formulas in the definition still require a structural check. A coset has many names, and a formula using a representative is legitimate only if every name gives the same result. The obstruction is exactly the ambiguity created by adding elements of $N$, so the quotient construction must show that addition and scalar multiplication ignore that ambiguity. The following result is only about the ordinary module structure on $M/N$: it verifies that these two operations are well-defined and satisfy the module axioms.

[quotetheorem:8502]

This theorem is the reason the notation $M/N$ is not just set-theoretic bookkeeping. It says that the quotient inherits exactly enough linear structure from $M$ to remain inside the same category of modules. It does not by itself prove that extra structure descends. For example, if $M$ carries operators or a [Lie algebra](/page/Lie%20Algebra) action, one must separately check that the relevant submodule is stable under those operations and that the induced operations satisfy the required identities on cosets.

## Quotient Maps and Kernels

Once a quotient exists, we need a canonical map that performs the collapse. This map is the device that lets us compare $M$ with $M/N$, transport homomorphisms through the quotient, and name precisely which elements have disappeared.

[definition: Quotient Map] Let $R$ be a ring, let $M$ be a left $R$-module, and let $N \subset M$ be an $R$-submodule. The quotient map is the $R$-[linear map](/page/Linear%20Map) $\pi: M \to M/N$ defined by \begin{align*} \pi(m) = m+N. \end{align*} [/definition]

The quotient map should erase exactly $N$, not more and not less. Verifying this gives the basic diagnostic for quotient maps and prepares the link with kernels of general homomorphisms.

[quotetheorem:7860]

The quotient module is therefore a controlled way of creating a map with a prescribed kernel. This is the bridge from quotients to homomorphism theorems.

[example: Quotient of a Free Module by One Relation] Let $R$ be a ring, let $a,b\in R$, and let $R^2$ denote the free left $R$-module with standard basis $e_1=(1,0)$ and $e_2=(0,1)$. Let $N=R(a,b)$, meaning the submodule generated by the single vector $(a,b)$: explicitly, $N=\{r(a,b):r\in R\}$. We compute the quotient $R^2/N$ in terms of the images $e_1+N$ and $e_2+N$. For every $(x,y)\in R^2$, \begin{align*} (x,y)=x(1,0)+y(0,1)=xe_1+ye_2. \end{align*} Passing to cosets gives \begin{align*} (x,y)+N=x(e_1+N)+y(e_2+N). \end{align*} Thus $e_1+N$ and $e_2+N$ generate $R^2/N$. The generator of $N$ is \begin{align*} (a,b)=a(1,0)+b(0,1)=ae_1+be_2. \end{align*} Since $(a,b)\in N$, its coset is the zero coset: \begin{align*} (a,b)+N=0+N. \end{align*} Therefore \begin{align*} a(e_1+N)+b(e_2+N)=(ae_1+be_2)+N=(a,b)+N=0+N. \end{align*} Conversely, every element of $N$ has the form $r(a,b)$ for some $r\in R$, and \begin{align*} r(a,b)=r(ae_1+be_2)=(ra)e_1+(rb)e_2. \end{align*} In the quotient, this becomes \begin{align*} r(a,b)+N=r\bigl(a(e_1+N)+b(e_2+N)\bigr)=0+N. \end{align*} So the single relation $a(e_1+N)+b(e_2+N)=0+N$ accounts exactly for the multiples of $(a,b)$ that are collapsed. When $R=\mathbb{Z}$ and $(a,b)=(2,3)$, the submodule is $N=\mathbb{Z}(2,3)$, and the defining relation is \begin{align*} 2(e_1+N)+3(e_2+N)=0+N. \end{align*} Thus $\mathbb{Z}^2/N$ is generated by the two cosets $e_1+N$ and $e_2+N$, with the relation that $2e_1+3e_2$ becomes zero. The quotient turns the chosen generator of the relation submodule into a linear dependence among the images of the free generators. [/example]

## Cosets and Well-Defined Operations

The main danger in quotient constructions is representative dependence. A coset $m+N$ may also be written $(m+n)+N$ for any $n \in N$, so an operation on cosets is legitimate only if changing representatives does not change the answer. The right language for this is congruence: two elements of $M$ should count as the same after quotienting precisely when their difference lies in the part we plan to erase.