← Back

note / modern mathematics

Session 02 — Why Quotient by a Polynomial?

Why Quotient by a Polynomial?

Central Question

Why does imposing the relation p(x)=0p(x)=0 create a root, and when does it create a field?

Why This Matters

Quotients turn algebraic equations into construction rules. Irreducibility explains why this construction sometimes gives a field and sometimes does not.

Mathematical Notes

What the quotient actually says

For a field FF and a nonconstant polynomial pF[x]p\in F[x], identify ff and gg when pp divides fgf-g. In A=F[x]/(p)A=F[x]/(p), let α=[x]\alpha=[x]. Then

p(α)=[p(x)]=0.p(\alpha)=[p(x)]=0.

Here [x][x] is a whole equivalence class of polynomials. It becomes a root because the arithmetic has been changed so that multiples of pp are zero. Constants embed into AA, since a nonzero constant is never divisible by a nonconstant polynomial.

Polynomial division gives a unique representative of degree less than degp\deg p for every class. Consequently, AA has basis 1,α,,αn11,\alpha,\ldots,\alpha^{n-1} over FF, where n=degpn=\deg p, whether or not AA is a field.

Proof mechanism. If pp is irreducible and [f]0[f]\ne0, then gcd(f,p)=1\gcd(f,p)=1. Bézout gives uf+vp=1uf+vp=1, so [u][f]=1[u][f]=1. Conversely, a nontrivial factorization p=abp=ab produces nonzero classes [a],[b][a],[b] with [a][b]=0[a][b]=0, which cannot happen in a field.

Three different outcomes

  • Q[x]/(x22)\mathbb Q[x]/(x^2-2) is a field: the polynomial is irreducible.
  • Q[x]/(x21)Q×Q\mathbb Q[x]/(x^2-1)\cong\mathbb Q\times\mathbb Q by [f](f(1),f(1))[f]\mapsto(f(1),f(-1)). Two distinct roots create two components, not a field.
  • Q[x]/(x2)\mathbb Q[x]/(x^2) contains a nonzero element ε=[x]\varepsilon=[x] satisfying ε2=0\varepsilon^2=0. Repeated factors can create nilpotents.

For example, in the first quotient (1+α)(α1)=1(1+\alpha)(\alpha-1)=1. In the second, (α1)(α+1)=0(\alpha-1)(\alpha+1)=0 even though neither factor is zero.

Why this construction is canonical

If BB is a commutative FF-algebra containing β\beta with p(β)=0p(\beta)=0, evaluation factors uniquely through AA:

F[x]/(p)B,[f]f(β).F[x]/(p)\longrightarrow B,\qquad[f]\longmapsto f(\beta).

Any arithmetic interpretation of the imposed relation must use this map. When pp is irreducible and BB is a field, it identifies AA with F(β)F(\beta).

Learning Prompt

I understand quotient rings, but I want to deeply understand why F[x]/(p(x))F[x]/(p(x)) effectively creates a root of p(x)p(x). Explain what the element [x][x] actually is and why p([x])=0p([x])=0. Compare irreducible and reducible p(x)p(x), and show why irreducibility gives a field.

Ideas

Examples

Questions

Connections

One Thing That Surprised Me

Further Rabbit Holes

Sources

Ian Stewart, Galois Theory, fifth edition, CRC Press, §5.3; §§17.1–17.2. Publisher and edition details.