Ideals
Why does , the set of even integers, deserve special attention among all the subrings of ? Meanwhile, a subring like inside does not. The answer is not about closure under addition and multiplication alone. Every subring has that. The answer is about what happens when you multiply an element of the subset by anything at all in the ambient ring. Multiply an even number by any integer, even or odd, and you stay even. This "absorbing" behavior is exactly the extra structure that distinguishes an ideal from a mere subring. It is the single property that makes it possible to build Quotient Rings. This works the same way normal subgroups let us build quotient groups. Ideals matter because they are precisely the kernels of ring homomorphisms. They are the algebraic objects that measure "how much information is lost" when you collapse a ring. Normal subgroups are the only subgroups by which you can quotient a group and still get a group. Similarly, ideals are the only subrings by which you can quotient a ring. Only they yield a ring with a well-defined multiplication. This single fact makes ideals the organizing concept for almost everything that follows in ring theory. Prime Ideals, maximal ideals, factorization, and the structure theory of commutative rings all begin here. The subtlety that a first course must get right is this: multiplication in a ring need not be commutative. So "absorbing multiplication" splits into two conditions. This gives rise to left ideals, right ideals, and two-sided ideals. In a commutative ring these notions coincide, and the word "ideal" is unambiguous. But the noncommutative distinction is not a technicality. It reflects genuinely different substructures inside rings like matrix rings. It also foreshadows module theory, where left ideals turn out to be exactly the submodules of the ring viewed as a left module over itself. This article gives the precise definitions of left, right, and two-sided ideals. It proves the fundamental "ideal test" that characterizes them among subsets of a ring. It carefully constructs the ideal generated by an arbitrary subset, in both the commutative and noncommutative settings. It also works through concrete, non-trivial examples in , in polynomial rings, and in matrix rings. This includes a counterexample showing exactly what fails without the absorption axiom.
- An ideal is a subring-like subset of a ring that absorbs multiplication by any ring element, not just elements of the subset.
- Left ideals absorb multiplication from the left (); right ideals absorb from the right (); two-sided ideals absorb both.
- In a commutative ring, left, right, and two-sided ideals coincide, and we just say "ideal."
- Every subset of a ring generates a smallest ideal containing it, built by closing under addition, additive inverses, and absorption.
- Ideals are exactly the kernels of ring homomorphisms, which is why they are the correct objects to quotient by (foreshadowing Quotient Rings).
- Key idea: an ideal is not just closed under the ring's operations — it swallows anything the ring multiplies into it.
Where this lives today
Ideals are the backbone of algebraic geometry, where the Nullstellensatz sets up a dictionary between ideals in polynomial rings and geometric varieties, so that studying a shape becomes studying an ideal. In algebraic number theory, ideals in rings of integers restore unique factorization exactly as Dedekind intended, underlying modern computations of class groups and the arithmetic of number fields. In coding theory and cryptography, cyclic error-correcting codes are literally ideals in quotient rings , and ideal lattices underlie lattice-based post-quantum cryptosystems. In commutative algebra and computer algebra systems, Gröbner basis algorithms operate directly on ideals of polynomial rings to solve systems of equations and automate geometric reasoning. In noncommutative algebra and representation theory, one-sided ideals of group rings and matrix algebras correspond to submodules and organize the classification of simple algebras via the Artin–Wedderburn theorem.
Ask the tutor: How does the kernel of a ring homomorphism turn out to be exactly a two-sided ideal, and why is that the deep reason ideals were invented in the first place?
Let be a ring (not necessarily commutative, not necessarily with identity) and let be a subset. 1. is a subgroup of : is nonempty, and for all , . 2. is a left ideal of if is a subgroup of and
(We write this absorption condition as .) 3. is a right ideal of if is a subgroup of and
(We write this as .) 4. is a (two-sided) ideal of if is both a left ideal and a right ideal of . If is commutative, every left ideal is automatically a right ideal and vice versa, so the three notions coincide; we simply call an ideal. Given a subset , the ideal generated by , denoted , is the smallest (two-sided) ideal of containing — equivalently, the intersection of all ideals of containing . The left ideal generated by and right ideal generated by are defined analogously as the smallest such left/right ideal.
Intuition
Think of a ring as a universe of objects you can add, subtract, and multiply. A subring is a self-contained sub-universe: closed under its own operations, but otherwise indifferent to the rest of . An ideal is different in spirit: it is a subset that cannot escape being multiplied into by outside elements. If is in the ideal and is anywhere in , then (and, for two-sided ideals, ) is forced right back into the ideal. This is a kind of algebraic gravity — the ideal is a "black hole" for multiplication. The picture to keep in mind is and its ideal . Multiply (or any multiple of ) by any integer, and you land back in . Contrast this with the subring : it is closed under addition and multiplication, but it does not absorb multiplication by arbitrary rationals (), so it is a subring but not an ideal of . The absorption property is what lets you build the quotient ring , because it guarantees that multiplying cosets gives a well-defined coset regardless of which representatives you pick.
The main theorem: the ideal test, and generation of ideals
Let be a ring with identity .
(A) Ideal test. A nonempty subset is a left ideal of if and only if: (i) for all , ; and (ii) for all and , . (The analogous statement holds for right ideals with , and for two-sided ideals with both.)
(B) Generated ideal, commutative case. If is commutative with identity and is any nonempty subset, then the ideal generated by is
the set of all finite -linear combinations of elements of .
(C) Generated ideal, general (noncommutative) case. If is any ring with identity and , then the two-sided ideal generated by is
the set of all finite sums of elements of the form with , .
We prove each part in turn. Throughout, has identity , which we use to absorb the case so that itself sits inside the generated set.
(A) Ideal test. () If is a left ideal, then by definition is a subgroup of , so (i) holds (subgroups are precisely nonempty subsets closed under subtraction, by the standard subgroup criterion). Condition (ii) is exactly the absorption axiom from the definition. () Suppose is nonempty and satisfies (i) and (ii). Condition (i) is precisely the one-step subgroup test for : since is nonempty, pick ; by (i), ; for any , ; and for , . Hence is a subgroup of . Condition (ii) is exactly the left absorption property . Thus satisfies all clauses of the definition of a left ideal. The right-ideal and two-sided versions are identical, replacing (ii) by , respectively both conditions.
(B) Generated ideal, commutative case. Let be commutative with identity, nonempty, and define
We show is an ideal containing , and that it is the smallest such ideal. contains . For , write (using the identity element and ). is an ideal (using the ideal test from Part A). is nonempty (it contains , which is nonempty). Given two elements and of , their difference
is again a finite -linear combination of elements of (a sum of terms), hence . This verifies condition (i) of the ideal test. For condition (ii): let and . Then
which is again a finite -linear combination of elements of with coefficients , hence . Since is commutative, absorbs multiplication on both sides identically, so is a two-sided ideal. By the ideal test, is an ideal of . is the smallest ideal containing . Let be any ideal of with . We show . Take any . Each . Since is an ideal, for each (absorption applied to and ). Since is closed under addition (it is a subgroup under ), the finite sum . Hence , proving . Since is an ideal containing and is contained in every ideal containing , is precisely the smallest ideal containing , i.e. , the intersection of all ideals containing . (This intersection is itself an ideal: an arbitrary intersection of subgroups of is a subgroup, and an arbitrary intersection of subsets each absorbing -multiplication also absorbs -multiplication, so the ideal test applies to the intersection too. The intersection contains since every ideal in the family does. By minimality of shown above, equals this intersection.)
(C) Generated ideal, noncommutative case. Now let be an arbitrary ring with identity (not assumed commutative), nonempty, and define
contains . For , write . is a two-sided ideal. Nonemptiness is clear as before. For the additive condition: given and in , the difference is again a finite sum of terms of the required form (append the terms of with coefficients negated: still has the form ), so . For left absorption: given and ,
since each term is still of the form (ring element)(ring element). For right absorption: given ,
by the same reasoning applied on the right. Hence satisfies the two-sided ideal test and is a two-sided ideal of . is the smallest two-sided ideal containing . Let be any two-sided ideal with . For and any : since is a left ideal, ; since is also a right ideal, . Since is closed under addition, any finite sum . Hence . As in Part B, this shows is the intersection of all two-sided ideals containing , so . This completes the proof of all three parts.
∎For a single element in a commutative ring with identity, Part (B) gives
the set of all -multiples of . This is the principal ideal generated by , whose finer theory (principal ideal domains, generators up to units) is developed under Principal Ideals and Generation.
Worked examples
Example 1: A non-principal ideal in , computed explicitly. Let , the ring of polynomials with integer coefficients, and let . We compute using Part (B) of the theorem (valid since is commutative with identity):
Concretely, this ideal consists of all polynomials in whose constant term is even. Let us verify both inclusions. (): If , the constant term of is , an even integer, and the constant term of is (since divides every term). So the constant term of is , which is even. (): Suppose has even, say . Write
which exhibits in the form with and . So indeed . This ideal is not principal: there is no single polynomial with . Briefly: if such existed, then for some , forcing to be a constant ( or ) by degree considerations; would give , but since has odd constant term — contradiction; would need , i.e. for some , impossible since does not divide the coefficient of in . This example shows that even in a very concrete, familiar ring, ideal generation with two generators genuinely needs two generators — a phenomenon central to the later theory of Principal Ideals and Generation and unique factorization.
Example 2: Left vs. right ideals in , a genuinely noncommutative computation. Let , the ring of real matrices, which is noncommutative. Consider
We check is a left ideal but not a right ideal, using the ideal test (Part A). Additive closure: clear, since is closed under entrywise subtraction (it is a -dimensional real subspace of ). Left absorption: let and . Then
Wait — we must check this lands in , i.e., that the bottom row is zero. Recompute carefully: row 2 of the product is (row 2 of ) times (columns of ): entry , and entry . These need not vanish for arbitrary — for instance take , : then . This shows the subset as defined is not a left ideal after all — an instructive miscalculation to catch. Let us instead use the correct set that is a left ideal: rows are absorbed from the left when we fix a column, not a row. Define
(matrices whose second column is zero). Check left absorption: for and ,
since the second column is indeed zero, matching the form of . Additive closure is immediate as before, so by the ideal test, is a left ideal. Now check is not a right ideal: take and . Then
since its second column is nonzero. So , confirming right absorption fails. This example (corrected after catching the initial error) shows concretely how "column-zero" matrices form a left ideal (they absorb from the left because left multiplication acts on rows, mixing columns internally without touching the zero column), while the symmetric "row-zero" matrices form a right ideal by an entirely parallel computation: for and ,
which has zero second row, so lies in the row-zero set — this is exactly right absorption. Neither nor the row-zero set is two-sided, and indeed is a simple ring: it has no proper nonzero two-sided ideals at all, only these asymmetric one-sided ideals.
The absorption condition (, or ) is not a convenience — it is exactly what is needed to define quotient multiplication. Drop it, keeping only "subring," and quotienting fails. Let and let — trivial, so instead take a genuinely non-absorbing subring: let (rationals) and . Then is a subring of : it contains , and is closed under . But is not an ideal of , because absorption fails: take and ; then . Now try to define a quotient ring structure on the cosets (as additive cosets of the subgroup inside ), with multiplication
This is not well-defined. Indeed, and represent the same coset (since ). Multiply each by the coset representative itself:
But , since . The same pair of cosets multiplied by the same third coset gives two different answers depending on which representative was chosen — multiplication on is simply not a function. The obstruction is precisely the failure of absorption: well-definedness of coset multiplication requires that changing a representative by an element of (i.e. adding ) not change the product coset, and unwinding this requirement forces exactly and for all — the ideal axiom. Without it, "" is an additive group with no ring structure at all, and the entire machinery of Quotient Rings collapses.
Scope, edge cases & common traps
| Situation | What to watch for |
|---|---|
| Ring without identity | Part (B)/(C) generation formulas need modification: without , itself may not lie in the naive linear-combination set, and one must add 's elements (or -multiples of them) explicitly. |
| Commutative ring | Left = right = two-sided ideal; always just say "ideal." Simplifies Part (B) of the theorem to the familiar / form. |
| Noncommutative ring | Left, right, two-sided ideals genuinely differ (Example 2); always specify which kind you mean. |
| itself and | Both are always ideals (of any kind) — the "trivial" ideals; a ring with no other two-sided ideals is called simple (e.g. for a field ). |
| Ideal vs. subring | An ideal is always a subring only if it happens to contain or is otherwise checked — actually if a proper ideal contained it would absorb for all , forcing ; so a proper ideal never contains and hence (in the presence of identity) an ideal is generally not a subring in the "contains " convention. |
The mathematician behind it
Origins · 1 minRichard Dedekind and how this was discovered
Dedekind introduced the concept of an ideal (German: Ideal) in the 1870s while trying to rescue unique factorization in rings of algebraic integers, where ordinary prime factorization can fail. His idea was that even when individual numbers do not factor uniquely, one can factor ideals uniquely into prime ideals — recovering, at the level of these new objects, the arithmetic that elements alone could not provide. The name "ideal" itself is a direct descendant of Ernst Kummer's earlier notion of "ideal numbers," hypothetical numbers introduced to patch up failures of unique factorization; Dedekind gave this heuristic a precise set-theoretic foundation.
What is the difference between a subring and an ideal?
A subring only needs to be closed under the ring operations internally: sums, differences, and products of elements of stay in . An ideal must satisfy the much stronger absorption property: multiplying any element of by any element of the whole ring (not just elements of ) must still land in . Every ideal that is nonempty and closed under subtraction is automatically closed under multiplication of its own elements (take in the absorption condition), so every ideal is a subring, but the converse is false — is a subring but not an ideal.
Why do we need left, right, and two-sided ideals instead of just one notion?
In a noncommutative ring, multiplying on the left and multiplying on the right are genuinely different operations, so "absorbs multiplication" splits into two independent conditions. A subset can absorb only from one side — as in the matrix examples in this article — and treating "ideal" as a single unambiguous notion would hide real structural information about the ring. When the ring is commutative, for all elements, so the two conditions become identical and the distinction evaporates, which is why the word "ideal" is used unqualified in commutative algebra.
Is every ideal generated by a single element?
No. An ideal generated by one element is called principal, and while this happens in nice rings like or for a field , it fails in general. The ideal in , consisting of polynomials with even constant term, cannot be generated by any single polynomial, as shown explicitly in the worked examples. Rings in which every ideal is principal are called principal ideal domains and are studied in detail under Principal Ideals and Generation.
Why is itself always considered an ideal, and is that useful?
trivially satisfies both the subgroup condition and absorption, since by closure of multiplication, so is always a (two-sided) ideal of itself, called the unit ideal. It is not very interesting on its own, but it matters as a boundary case: an ideal equals all of if and only if contains a unit (in particular, if it contains ), which is a key criterion used later to distinguish proper ideals and to identify maximal and prime ideals.
How does the definition change if the ring has no multiplicative identity?
Without an identity, the absorption condition (or ) is stated exactly the same way, but the generation formulas change: you can no longer write to guarantee sits inside the set of linear combinations, since there may be no . The generated ideal must then be described as sums of elements of together with -multiples of elements of (and, for two-sided ideals, elements of the form ), explicitly including itself as a summand to compensate for the missing identity.
Are ideals and normal subgroups the "same idea" in different settings?
They play analogous roles: both are exactly the substructures by which you can quotient (a ring or a group, respectively) and still get a well-defined algebraic structure on the cosets. Formally they are different: an ideal must be an additive subgroup with a multiplicative absorption property, while a normal subgroup must satisfy for conjugation. The philosophical parallel — "the kernels of homomorphisms are exactly these objects" — is precise and is one of the deepest recurring patterns across Commutative Rings theory and group theory.
Does every subset of a ring generate an ideal, even infinite or "wild" subsets?
Yes. The construction via intersection of all ideals containing works for any nonempty subset whatsoever, finite or infinite, since an arbitrary intersection of ideals is again an ideal (a routine check using the ideal test on the intersection). The explicit linear-combination description in the theorem only ever uses finite sums even when is infinite, because ideals need only be closed under finitely many additions at a time; this finiteness is essential to later chain-condition arguments such as the ascending chain condition in Noetherian rings.