Engineering / Mathematics — Rings and Polynomial Rings
Subrings
Subrings, the subring test, and the distinction between subrings and ideals.
Executive summary
A subring is a subset closed under the ring operations and containing the identity. The test is short because associativity and distributivity are inherited.
Subrings and ideals are different objects and confusing them is a common error: ideals absorb multiplication by the whole ring, subrings need not.
Learning objectives
- Apply the subring test.
- Distinguish subrings from ideals.
- Recognise standard subring examples.
01The subring test
Subring
A subset S ⊆ R containing 1, closed under subtraction and multiplication.
Equivalently, S is itself a ring under the operations of R, with the same identity.
Closure under subtraction rather than addition and negation separately is a compact formulation: it gives the additive subgroup condition in one clause.
| Ring | Subring | Verified by |
|---|---|---|
| Q | Z | Closed under subtraction and multiplication; contains 1 |
| C | R | Same |
| F[X] | F, as constants | Constants are closed and contain 1 |
| Z | 2Z | NOT a subring — does not contain 1 |
02Subrings versus ideals
| Property | Subring | Ideal |
|---|---|---|
| Contains 1 | Yes | Only if the ideal is the whole ring |
| Closed under subtraction | Yes | Yes |
| Closed under internal multiplication | Yes | Yes |
| Absorbs multiplication by R | Not generally | Yes, by definition |
| Supports a quotient ring | No | Yes |
The absorption property is what makes ideals the right notion for forming quotients. Multiplying a coset representative by an arbitrary ring element must stay within the same coset, which requires exactly that the ideal absorb multiplication.
03Why the distinction matters computationally
Quotient constructions — modular arithmetic, polynomial quotient algebras, finite field construction — all proceed by quotienting a ring by an ideal. Attempting the same with a subring does not produce a well-defined ring structure.
Choose an ideal
For example nZ in Z, or the multiples of an irreducible polynomial in F[X].
Form cosets
The residue classes modulo that ideal.
Define operations
Well defined precisely because the ideal absorbs multiplication.
Obtain a ring
Z_n, or the finite field F[X]/(f).
04Frequently asked questions
Do all authors require subrings to contain 1?
No, conventions differ. Requiring it makes subrings and ideals cleanly disjoint notions except for the whole ring, which is why it is adopted here. Under the looser convention 2Z counts as a subring.
Can a subring be an ideal?
Only if it is the entire ring. An ideal containing 1 absorbs multiplication by everything, hence contains every element.
Is the intersection of subrings a subring?
Yes, and the same holds for ideals. This is what makes the subring or ideal generated by a set well defined as the smallest one containing it.
Sources and method
Structural reference: Victor Shoup, A Computational Introduction to Number Theory and Algebra, Version 1, Cambridge University Press, 2005 — book pages 217-220.
This page carries the durable method layer only: definitions, constructions, algorithms, complexity results and selection criteria, authored originally for KEVOS. No text is transcribed or paraphrased from the source, and no numeric tables or benchmark data are reproduced — these are routed to live authoritative sources instead.
Author: Kevin Jogin. Last reviewed 2026-08-07.