Ring homomorphisms; quotient rings

At a Glance

Why This Chapter Matters

All three UPSC ring homomorphism questions are 15-mark proofs, making this the single highest-yield ring theory topic by total marks. They share a common engine: exhibit an evaluation homomorphism, identify its kernel as the target ideal, apply FIT to get the quotient ring, then classify it as a field (maximal ideal) or integral domain (prime ideal) or neither. Once you have this pipeline in muscle memory, all three archetypes — and any future variant — are solved with the same four-step argument.

Minimum Theory

Ring homomorphism. A map ϕ:R→R′\phi:R\to R' is a ring homomorphism if ϕ(a+b)=ϕ(a)+ϕ(b)\phi(a+b)=\phi(a)+\phi(b) and ϕ(ab)=ϕ(a)ϕ(b)\phi(ab)=\phi(a)\phi(b) for all a,b∈Ra,b\in R. Many definitions also require ϕ(1R)=1R′\phi(1_R)=1_{R'} (unital); UPSC questions sometimes ask you to prove this from surjectivity.

Ideal and quotient ring. A subset I⊆RI\subseteq R is an ideal if (I,+)(I,+) is a subgroup of (R,+)(R,+) and rI⊆IrI\subseteq I, Ir⊆IIr\subseteq I for all r∈Rr\in R. The quotient ring R/I={r+I:r∈R}R/I=\{r+I:r\in R\} is a ring under (r+I)+(s+I)=(r+s)+I(r+I)+(s+I)=(r+s)+I and (r+I)(s+I)=rs+I(r+I)(s+I)=rs+I.

Key characterizations (commutative ring with unity). (i) II is maximal   ⟺  R/I\iff R/I is a field. (ii) II is prime   ⟺  R/I\iff R/I is an integral domain.

FIT for rings. If ϕ:R→R′\phi:R\to R' is a surjective ring homomorphism, then R/ker⁡ϕ≅R′R/\ker\phi\cong R'.

Ring homomorphism \phi:R\to R'; kernel/ideal; quotient R/\ker\phi\cong\operatorname{Im}\phi

Question Archetypes

ArchetypeRecognition
ring-hom-propertyProve a structural property (e.g. ϕ(1R)=1R′\phi(1_R)=1_{R'}) using surjectivity + homomorphism law
maximal-ideal-quotientShow an ideal MM is maximal by identifying R/M≅R/M\cong a field via evaluation homomorphism
prime-maximal-via-homUse evaluation homomorphism to classify an ideal as prime but not maximal (R/IR/I is a domain, not a field)

ring-hom-property (1 question(s); 2015)

Recognition Cues — “Prove ϕ(1)\phi(1) is the unit element of R′R'”; or “prove a surjective ring homomorphism preserves [property]”; the word onto or surjective always appears — it is the load-bearing hypothesis.

Solution Template

  1. Let r′∈R′r'\in R' be arbitrary.
  2. By surjectivity, choose r∈Rr\in R with ϕ(r)=r′\phi(r)=r'.
  3. Compute ϕ(1)⋅r′=ϕ(1)⋅ϕ(r)=ϕ(1⋅r)=ϕ(r)=r′\phi(1)\cdot r' = \phi(1)\cdot\phi(r) = \phi(1\cdot r) = \phi(r) = r'.
  4. Compute r′⋅ϕ(1)=ϕ(r)⋅ϕ(1)=ϕ(r⋅1)=ϕ(r)=r′r'\cdot\phi(1) = \phi(r)\cdot\phi(1) = \phi(r\cdot 1) = \phi(r) = r'.
  5. Since ϕ(1)⋅r′=r′=r′⋅ϕ(1)\phi(1)\cdot r'=r'=r'\cdot\phi(1) for all r′∈R′r'\in R', ϕ(1)=1R′\phi(1)=1_{R'}.

Worked Example

2015 Paper 2, 2015-P2-Q2a (15 marks)

If RR is a ring with unit element 11 and ϕ\phi is a homomorphism of RR onto R′R', prove that ϕ(1)\phi(1) is the unit element of R′R'.

Let r′∈R′r'\in R' be arbitrary. By surjectivity, choose r∈Rr\in R with ϕ(r)=r′\phi(r)=r'. Then:

ϕ(1)⋅r′=ϕ(1)⋅ϕ(r)=ϕ(1⋅r)=ϕ(r)=r′.\phi(1)\cdot r' = \phi(1)\cdot\phi(r) = \phi(1\cdot r) = \phi(r) = r'.

r′⋅ϕ(1)=ϕ(r)⋅ϕ(1)=ϕ(r⋅1)=ϕ(r)=r′.r'\cdot\phi(1) = \phi(r)\cdot\phi(1) = \phi(r\cdot 1) = \phi(r) = r'.

Since ϕ(1)\phi(1) acts as a two-sided identity on every element of R′R', and identities are unique, ϕ(1)=1R′\phi(1)=1_{R'}.

ϕ(1) is the unit element of R′.  ■\boxed{\phi(1)\text{ is the unit element of }R'.}\;\blacksquare

Why surjectivity is essential. Without it, ϕ(1)\phi(1) is only an identity for the subring ϕ(R)⊆R′\phi(R)\subseteq R'. Counterexample: ϕ:Z→Z×Z\phi:\mathbb Z\to\mathbb Z\times\mathbb Z, ϕ(n)=(n,0)\phi(n)=(n,0), is a non-surjective homomorphism with ϕ(1)=(1,0)≠(1,1)=1Z×Z\phi(1)=(1,0)\ne(1,1)=1_{\mathbb Z\times\mathbb Z}.

Common Traps

maximal-ideal-quotient (1 question(s); 2013)

Recognition Cues — an ideal defined by a vanishing condition at a point, e.g. M={f∈C[0,1]:f(c)=0}M=\{f\in C[0,1]:f(c)=0\}; asked whether MM is a maximal ideal; the ring is typically a function ring.

Solution Template

  1. Define the evaluation homomorphism ϕ:R→R\phi:R\to\mathbb R (or F\mathbb F) by ϕ(f)=f(c)\phi(f)=f(c).
  2. Show ϕ\phi is a ring homomorphism (additive and multiplicative).
  3. Show ϕ\phi is surjective.
  4. Show ker⁡ϕ=M\ker\phi = M (elements vanishing at cc).
  5. Apply FIT: R/M≅RR/M\cong\mathbb R. Since R\mathbb R is a field, MM is a maximal ideal.

Worked Example

2013 Paper 2, 2013-P2-Q3b (15 marks)

Let RCR^C be the ring of all real-valued continuous functions on [0,1][0,1] under pointwise addition and multiplication. Let M={f∈RC:f(1/2)=0}M=\{f\in R^C : f(1/2)=0\}. Is MM a maximal ideal? Justify.

Step 1 — Evaluation homomorphism. Define ϕ:RC→R\phi:R^C\to\mathbb R by ϕ(f)=f(1/2)\phi(f)=f(1/2).

Additive: ϕ(f+g)=(f+g)(1/2)=f(1/2)+g(1/2)=ϕ(f)+ϕ(g)\phi(f+g)=(f+g)(1/2)=f(1/2)+g(1/2)=\phi(f)+\phi(g). ✓\checkmark

Multiplicative: ϕ(fg)=(fg)(1/2)=f(1/2)g(1/2)=ϕ(f)ϕ(g)\phi(fg)=(fg)(1/2)=f(1/2)g(1/2)=\phi(f)\phi(g). ✓\checkmark

Sends 11 to 11: ϕ(1)=1\phi(1)=1 (constant function). ✓\checkmark

Step 2 — Surjectivity. For any c∈Rc\in\mathbb R, the constant function f≡cf\equiv c satisfies ϕ(f)=c\phi(f)=c. So Im⁡ϕ=R\operatorname{Im}\phi=\mathbb R.

Step 3 — Kernel. ker⁡ϕ={f:f(1/2)=0}=M\ker\phi=\{f:f(1/2)=0\}=M.

Step 4 — FIT. RC/M=RC/ker⁡ϕ≅RR^C/M = R^C/\ker\phi \cong \mathbb R.

Step 5 — Maximality. R\mathbb R is a field. In a commutative ring with unity, MM is maximal   ⟺  RC/M\iff R^C/M is a field. Hence MM is maximal.

M is a maximal ideal of RC, with RC/M≅R.  ■\boxed{M\text{ is a maximal ideal of }R^C,\ \text{with }R^C/M\cong\mathbb R.}\;\blacksquare

Common Traps

prime-maximal-via-hom (1 question(s); 2025)

Recognition Cues — evaluation homomorphism on a polynomial ring (Z[x]\mathbb Z[x], Q[x]\mathbb Q[x]); asked to prove a principal ideal ⟨f⟩\langle f\rangle is prime but not maximal; the quotient is a domain but not a field.

Solution Template

  1. Define the evaluation homomorphism ϕ:R[x]→R\phi:R[x]\to R by ϕ(f)=f(a)\phi(f)=f(a).
  2. Verify it is a (unital) ring homomorphism.
  3. Show ϕ\phi is surjective.
  4. Identify ker⁡ϕ=⟨x−a⟩\ker\phi = \langle x-a\rangle (polynomials with root aa).
  5. FIT: R[x]/⟨x−a⟩≅RR[x]/\langle x-a\rangle\cong R.
  6. If RR is an integral domain but not a field: ⟨x−a⟩\langle x-a\rangle is prime (but not maximal).

Worked Example

2025 Paper 2, 2025-P2-Q4a (15 marks)

Examine whether ϕ:Z[x]→Z\phi:\mathbb Z[x]\to\mathbb Z defined by ϕ(f(x))=f(0)\phi(f(x))=f(0) is a homomorphism. Deduce that ⟨x⟩\langle x\rangle is a prime ideal in Z[x]\mathbb Z[x], but not a maximal ideal.

Step 1 — Homomorphism. For f,g∈Z[x]f,g\in\mathbb Z[x]:

ϕ(f+g)=(f+g)(0)=f(0)+g(0)=ϕ(f)+ϕ(g),\phi(f+g)=(f+g)(0)=f(0)+g(0)=\phi(f)+\phi(g),

ϕ(fg)=(fg)(0)=f(0)g(0)=ϕ(f)ϕ(g),ϕ(1)=1.\phi(fg)=(fg)(0)=f(0)g(0)=\phi(f)\phi(g),\quad\phi(1)=1.

So ϕ\phi is a (unital) ring homomorphism.

Step 2 — Surjectivity. For any n∈Zn\in\mathbb Z, the constant polynomial f(x)=nf(x)=n gives ϕ(f)=n\phi(f)=n. So Im⁡ϕ=Z\operatorname{Im}\phi=\mathbb Z.

Step 3 — Kernel. ker⁡ϕ={f∈Z[x]:f(0)=0}={f:constant term =0}={xg(x):g∈Z[x]}=⟨x⟩\ker\phi=\{f\in\mathbb Z[x]:f(0)=0\}=\{f:\text{constant term }=0\}=\{xg(x):g\in\mathbb Z[x]\}=\langle x\rangle.

Step 4 — FIT. Z[x]/⟨x⟩≅Z\mathbb Z[x]/\langle x\rangle\cong\mathbb Z.

Step 5 — ⟨x⟩\langle x\rangle is prime. Z[x]/⟨x⟩≅Z\mathbb Z[x]/\langle x\rangle\cong\mathbb Z is an integral domain (no zero divisors). Hence ⟨x⟩\langle x\rangle is a prime ideal.

Step 6 — ⟨x⟩\langle x\rangle is not maximal. Z\mathbb Z is not a field (22 has no inverse in Z\mathbb Z). So Z[x]/⟨x⟩≇\mathbb Z[x]/\langle x\rangle\not\cong a field, and ⟨x⟩\langle x\rangle is not maximal. (Witness: ⟨x⟩⊊⟨2,x⟩⊊Z[x]\langle x\rangle\subsetneq\langle 2,x\rangle\subsetneq\mathbb Z[x].)

⟨x⟩ is prime but not maximal in Z[x].  ■\boxed{\langle x\rangle\text{ is prime but not maximal in }\mathbb Z[x].}\;\blacksquare

Common Traps

Marks-Aware Writing

All three questions are 15 marks. The common structure is: homomorphism verified (3 marks), surjectivity (2 marks), kernel identified (3 marks), FIT stated and applied (3 marks), ideal classified (4 marks). For prime/maximal classification, you must state the relevant theorem (“prime   ⟺  \iff domain, maximal   ⟺  \iff field”) and apply it — a bare assertion without the theorem earns at most half marks.

Practice Set

Ready to drill what you just read?

Daily Practice turns these patterns into one adaptive set a day — practised daily until they're automatic, free for everyone.

See Daily Practice →

This chapter is part of the Maths Coverage Map — 14 years, mapped. Get the take-away PDF free.