Ideals, Quotient Rings, and Homomorphisms
Ring homomorphisms have kernels that absorb multiplication; such subsets are ideals, and every ideal is the kernel of the projection onto a quotient ring. The quotient construction yields the ring isomorphism theorems and classifies ideals by their quotients: R/I is a field exactly when I is maximal, an integral domain exactly when I is prime.
╌╌╌╌
For groups, a homomorphism has a normal-subgroup kernel, and every normal subgroup is a kernel; quotienting by it produces a new group. Rings add one operation, and the same correspondence holds. A ring homomorphism has a kernel, the kernel is closed under multiplication by every element of the ring, and that closure property defines the substructure — an ideal — by which a ring may be quotiented.
Ring homomorphisms and their kernels
Both operations must be respected. The additive-scaling map on is a group homomorphism but a ring homomorphism only for , since while . Checking both laws is not optional.1
The kernel behaves differently from the image.
The absorption clause is what distinguishes a kernel. If then , so , and symmetrically for .1 The kernel is not merely closed under its own multiplication; it absorbs multiplication by the entire ring. A subring with that absorption property is an ideal.
Ideals
To verify is an ideal, check that it is nonempty, closed under subtraction, and closed under multiplication by every element of (not just by elements of ). The absorption condition is strictly stronger than being a subring: is a subring of but not an ideal, because .
The last clause of the image/kernel proposition says that every kernel is an ideal. The converse also holds, and it comes from the quotient construction.
The quotient ring
Because is a subgroup of the abelian group , the additive cosets already form a quotient group. The question is whether coset multiplication is well defined. It is well defined exactly when is an ideal, and then the distributive laws pass to the cosets.
Writing , addition and multiplication in are just and : compute with any representatives and reduce.1 The construction closes the loop between ideals and homomorphisms.
For the ideals coincide with the subgroups , and the quotient is — the construction that named modular arithmetic. In , quotienting by the ideal of polynomials with no constant or linear term collapses each polynomial to its degree- part, and there , so the quotient acquires zero divisors the base ring lacked.1
The remaining isomorphism theorems
The higher isomorphism theorems transfer verbatim from the group versions: prove the additive-group statement, then check the bijection respects multiplication.
The correspondence theorem is the one used most in practice. The ideals of are the images of the ideals of that contain , namely the for .
Generated ideals
Given a subset , the ideal generated by , written , is the smallest ideal containing — equivalently the intersection of all ideals that contain . In a commutative ring with it is the set of finite sums with and . An ideal generated by a single element is principal; one generated by a finite set is finitely generated.2
- In , every ideal is principal: , and where . Divisibility becomes containment, , so the ideal lattice mirrors the divisor lattice.
- In , the ideal of polynomials with even constant term is not principal. If , then forces or ; a unit would make the ideal all of , and fails to divide . Whether ideals are principal turns out to be a deep structural property, studied under principal ideal domains.
Containing a unit is the same as being everything.
If is a unit with inverse , then , so for all .2 The second part is why fields have a trivial ideal structure, and it forces every nonzero homomorphism out of a field to be injective: the kernel is a proper ideal, hence .
Maximal and prime ideals
Two classes of proper ideal are singled out by their quotients. They generalize,
respectively, as large as possible
and prime number
from the integers.
Existence is guaranteed in any ring with identity: every proper ideal is contained in a maximal ideal, proved by applying Zorn's lemma to the poset of proper ideals containing it, whose chains have their union as an upper bound.2 The value of both definitions is that each translates into a property of the quotient ring.
The maximal case is the correspondence theorem plus the field iff only trivial ideals
proposition: is maximal iff has no ideals but and itself, iff
is a field. The prime case is a direct translation: in
means , and no zero divisors
is what the prime condition asks.
Because every field is a domain, maximal implies prime.23
The integers show that the converse fails. In the prime ideals are the for prime together with the zero ideal ; only the are maximal. So is prime but not maximal, matching being a domain but not a field. In the chain shows is prime — the quotient is a domain — but not maximal.2
| Ideal | Quotient | Class of quotient | Example in |
|---|---|---|---|
| trivial | — | ||
| prime, not maximal | integral domain, not a field | domain | |
| maximal | field | field |
This is how fields are built: quotient a familiar ring by a maximal ideal. Every finite field arises as for a suitable maximal , the route taken in field theory.
Sums, products, and reduction as a tool
Two ideals combine into new ideals. The sum is the smallest ideal containing both; the product is the set of finite sums of products with , . Always . In , and , so ideal sum is gcd and ideal product is the product of the integers.1 These operations underlie the Chinese Remainder Theorem.
Reduction modulo an ideal also serves as a proof technique. Because is a homomorphism, any polynomial relation among ring elements survives reduction. To show has no nonzero integer solution with coprime, reduce mod : squares are or there, and checking the few combinations forces all even, contradicting coprimality.1
- 1if is empty then return false
- 2for each do
- 3if then return falsesubgroup under subtraction
- 4for each and each do
- 5if or then return falseabsorption
- 6return true
The absorption loop ranges over the whole ring , not over : that is what separates an ideal from a mere subring, and what makes a ring.
Footnotes
- Dummit & Foote, Abstract Algebra, §7.3 — Ring Homomorphisms and Quotient Rings: homomorphisms and kernels, ideals as kernels, the quotient ring, the four isomorphism theorems, sums and products of ideals, and reduction modulo as a Diophantine tool. ↩ ↩2 ↩3 ↩4 ↩5 ↩6
- Dummit & Foote, Abstract Algebra, §7.4 — Properties of Ideals: generated and principal ideals, not principal, the unit/field criterion, existence of maximal ideals via Zorn's lemma, and the quotient characterizations of maximal and prime ideals. ↩ ↩2 ↩3 ↩4 ↩5
- Judson, Abstract Algebra: Theory and Applications, §16.3–16.4 — Ring Homomorphisms and Ideals; Maximal and Prime Ideals: the factor ring, the isomorphism theorems, and a field iff maximal, a domain iff prime. ↩
╌╌ END ╌╌