Integral Domains, Fields, and Field of Fractions

⚡ Key Takeaways

One-line statement: An integral domain is a commutative ring with unity and no zero divisors; a field is a commutative ring in which every nonzero element has a multiplicative inverse; and the field of fractions is the smallest field that contains a given integral domain. Key result in words: Every integral domain embeds into a field — its field of fractions — constructed exactly the way the rationals Q\mathbb{Q} are built from the integers Z\mathbb{Z}. Where it applies: Number theory, algebraic geometry, polynomial algebra, and the foundations of fractions and rational functions. Who/when: Crystallized in the late 19th and early 20th centuries through Dedekind, Kronecker, Steinitz, and Noether.

💡 The Core Insight

The absence of zero divisors is precisely the condition needed to cancel in a ring: if ab=acab = ac and a≠0a \neq 0, then b=cb = c. Cancellation is exactly what makes fractions behave consistently. The field of fractions formalizes the slogan "wherever you can cancel, you can divide" by manufacturing the missing inverses as equivalence classes of pairs (a,b)(a,b) written ab\tfrac{a}{b}.

Formal Statement

DefinitionCommutative Ring with Unity

A commutative ring with unity is a set RR equipped with two operations ++ and ⋅\cdot satisfying:

  • (R,+)(R,+) is an abelian group with identity 00;
  • ⋅\cdot is associative and commutative;
  • there exists 1∈R1 \in R with 1⋅a=a1 \cdot a = a for all aa;
  • distributivity: a(b+c)=ab+aca(b+c) = ab + ac.
1
a⋅(b+c)=a⋅b+a⋅c∀ a,b,c∈R\quad a \cdot (b + c) = a\cdot b + a \cdot c \qquad \forall\, a,b,c \in R

Derivation hint: This is an axiom, not a theorem; it links the additive and multiplicative structures and forces 0⋅a=00 \cdot a = 0 (set b=c=0b=c=0 and cancel additively).

DefinitionZero Divisor and Integral Domain

A nonzero element a∈Ra \in R is a zero divisor if there exists a nonzero b∈Rb \in R with ab=0ab = 0. An integral domain is a commutative ring with unity, with 1≠01 \neq 0, having no zero divisors:

2
ab=0  ⟹  a=0  or  b=0\quad ab = 0 \;\Longrightarrow\; a = 0 \ \text{ or }\ b = 0

Derivation hint: This is the defining property; equivalently, the set R∖{0}R \setminus \{0\} is closed under multiplication. The cancellation law follows directly:

3
a≠0  and  ab=ac  ⟹  b=c\quad a \neq 0 \ \text{ and }\ ab = ac \;\Longrightarrow\; b = c

Derivation hint: Rewrite ab=acab = ac as a(b−c)=0a(b-c)=0; since a≠0a\neq 0 and there are no zero divisors, b−c=0b-c=0.

DefinitionField

A field FF is a commutative ring with unity, 1≠01 \neq 0, in which every nonzero element is a unit (has a multiplicative inverse):

4
∀ a∈F, a≠0  ⟹  ∃ a−1∈F  with  a⋅a−1=1\quad \forall\, a \in F,\ a \neq 0 \;\Longrightarrow\; \exists\, a^{-1} \in F \ \text{ with }\ a\cdot a^{-1} = 1

Derivation hint: Equivalently, (F∖{0},⋅)(F\setminus\{0\}, \cdot) is an abelian group; this is the strongest among ring structures considered here. Symbols: FF is the field; a−1a^{-1} is the unique inverse of aa; uniqueness follows because if ab=ac=1ab=ac=1 then b=b(ac)=(ba)c=cb = b(ac) = (ba)c = c.

TheoremEvery Field Is an Integral Domain

Every field is an integral domain. The converse fails for infinite rings but holds for finite ones: every finite integral domain is a field.

Proof

Part 1 — field ⇒\Rightarrow integral domain. 1. Let FF be a field and suppose ab=0ab = 0 with a≠0a \neq 0. 2. Multiply by a−1a^{-1}: a−1(ab)=a−1⋅0=0a^{-1}(ab) = a^{-1}\cdot 0 = 0. 3. By associativity (a−1a)b=b=0(a^{-1}a)b = b = 0. Hence a=0a=0 or b=0b=0, so FF has no zero divisors. □\square

Part 2 — finite integral domain ⇒\Rightarrow field. 1. Let DD be a finite integral domain and a∈Da \in D, a≠0a \neq 0. 2. Consider the multiplication map μa:D→D\mu_a : D \to D, μa(x)=ax\mu_a(x) = ax. 3. μa\mu_a is injective: if ax=ayax = ay, cancellation [3] gives x=yx = y. 4. An injective map from a finite set to itself is surjective. 5. Hence there exists xx with ax=1ax = 1, so aa is invertible. Therefore DD is a field. □\square

5
∣D∣<∞  and D integral domain  ⟹  D is a field\quad |D| < \infty \ \text{ and } D \text{ integral domain} \;\Longrightarrow\; D \text{ is a field}

Derivation hint: The pigeonhole principle turns injectivity into surjectivity on a finite set, manufacturing the inverse.

∎

Why It Holds — The Field of Fractions Construction

DefinitionField of Fractions

Let DD be an integral domain. On the set D×(D∖{0})D \times (D\setminus\{0\}) define the relation

6
(a,b)∼(c,d)  ⟺  ad=bc\quad (a,b) \sim (c,d) \;\Longleftrightarrow\; ad = bc

Derivation hint: This mimics "cross-multiplication" ab=cd  ⟺  ad=bc\tfrac{a}{b} = \tfrac{c}{d} \iff ad = bc; transitivity is where the no-zero-divisor hypothesis is essential. Write the equivalence class of (a,b)(a,b) as ab\tfrac{a}{b}. The field of fractions Frac⁡(D)\operatorname{Frac}(D) is the set of classes with operations

7
ab+cd=ad+bcbd,ab⋅cd=acbd\quad \frac{a}{b} + \frac{c}{d} = \frac{ad + bc}{bd}, \qquad \frac{a}{b}\cdot\frac{c}{d} = \frac{ac}{bd}

Derivation hint: bd≠0bd \neq 0 because b,d≠0b,d \neq 0 and DD has no zero divisors — this is exactly where the domain hypothesis guarantees the operations land in valid fractions.

Proof

∼\sim is an equivalence relation (transitivity uses cancellation). 1. Reflexive: (a,b)∼(a,b)(a,b)\sim(a,b) since ab=baab = ba. 2. Symmetric: ad=bc⇒cb=daad = bc \Rightarrow cb = da. 3. Transitive: suppose (a,b)∼(c,d)(a,b)\sim(c,d) and (c,d)∼(e,f)(c,d)\sim(e,f), i.e. ad=bcad = bc and cf=decf = de. 4. Then adf=bcf=b(de)=(be)dadf = bcf = b(de) = (be)d, so (af−be)d=0(af - be)d = 0. 5. Since d≠0d \neq 0 and DD is a domain, af=beaf = be, hence (a,b)∼(e,f)(a,b)\sim(e,f). □\square

The operations are well defined and yield a field. 6. Independence of representatives follows by similar manipulations using [2]. 7. Additive identity is 01\tfrac{0}{1}, multiplicative identity 11\tfrac{1}{1}. 8. The inverse of a nonzero ab\tfrac{a}{b} (so a≠0a\neq 0) is ba\tfrac{b}{a}, since ab⋅ba=abab=11\tfrac{a}{b}\cdot\tfrac{b}{a} = \tfrac{ab}{ab} = \tfrac{1}{1}.

DD embeds in Frac⁡(D)\operatorname{Frac}(D). 9. The map ι:D→Frac⁡(D)\iota : D \to \operatorname{Frac}(D), ι(a)=a1\iota(a) = \tfrac{a}{1} is an injective ring homomorphism. □\square

∎
TheoremUniversal Property of the Field of Fractions

Frac⁡(D)\operatorname{Frac}(D) is the smallest field containing DD: for any field FF and any injective ring homomorphism φ:D→F\varphi : D \to F, there is a unique homomorphism Φ:Frac⁡(D)→F\Phi : \operatorname{Frac}(D) \to F extending φ\varphi.

8
Φ ⁣(ab)=φ(a) φ(b)−1\quad \Phi\!\left(\frac{a}{b}\right) = \varphi(a)\,\varphi(b)^{-1}

Derivation hint: φ(b)≠0\varphi(b) \neq 0 in FF because φ\varphi is injective and b≠0b \neq 0, so the inverse exists in the field FF; uniqueness forces this formula.

mathematician · Richard Dedekind | 1831–1916

Dedekind reshaped algebra by treating number systems as abstract structures rather than collections of formulas. His introduction of ideals (1871) and his rigorous construction of the real numbers via Dedekind cuts pushed mathematics toward set-theoretic foundations. The modern definition of a field — Körper in German, a term he coined — and the systematic study of fields of algebraic numbers grew directly from his work on the factorization theory of Algebraic Number Theory. The field-of-fractions construction is the categorical distillation of his insistence that one should always work in the smallest natural domain where division is possible.

Building Intuition

🧠 Intuition

Think of an integral domain as a number system where multiplication never collapses two nonzero things into zero — the multiplicative structure is "honest." That honesty is exactly cancellation: you can divide out a common nonzero factor without ambiguity, even though you may not yet have inverses. A field goes one step further and hands you every inverse. The field of fractions is the act of "completing" a domain by inventing those inverses as formal fractions, but it works only because the domain has no zero divisors — otherwise a0\tfrac{a}{0}-type pathologies would creep in and cross-multiplication would lose transitivity. The mental picture: Z\mathbb{Z} is a rigid lattice of points; Q=Frac⁡(Z)\mathbb{Q} = \operatorname{Frac}(\mathbb{Z}) fills in all the rational gaps to make a structure closed under division.

Figure
The hierarchy of ring structures and the fraction-field functor
Rings → Domains → Fields Commutative rings with unity Integral domains (no zero divisors) Fields ℚ, ℝ, ℂ, 𝔽_p ℤ, k[x] ℤ/6ℤ Frac(·): domain ↦ field

Worked Examples

ExampleField of fractions of the Gaussian integers

Given: Z[i]={a+bi:a,b∈Z}\mathbb{Z}[i] = \{a + bi : a,b \in \mathbb{Z}\}, the Gaussian integers, an integral domain.

Goal: Identify Frac⁡(Z[i])\operatorname{Frac}(\mathbb{Z}[i]).

Steps: 1. A general fraction is a+bic+di\dfrac{a+bi}{c+di} with c+di≠0c+di \neq 0. 2. Rationalize by multiplying numerator and denominator by the conjugate c−dic - di:

9
a+bic+di=(a+bi)(c−di)c2+d2=ac+bdc2+d2+bc−adc2+d2 i\quad \frac{a+bi}{c+di} = \frac{(a+bi)(c-di)}{c^2 + d^2} = \frac{ac+bd}{c^2+d^2} + \frac{bc-ad}{c^2+d^2}\,i

Derivation hint: c2+d2=∣c+di∣2≠0c^2 + d^2 = |c+di|^2 \neq 0 is a positive integer, so each coordinate is a genuine rational number. 3. Both coordinates lie in Q\mathbb{Q}, and conversely every p+qip + qi with p,q∈Qp,q \in \mathbb{Q} arises this way.

Answer: Frac⁡(Z[i])=Q(i)={p+qi:p,q∈Q}\boxed{\operatorname{Frac}(\mathbb{Z}[i]) = \mathbb{Q}(i) = \{p + qi : p,q \in \mathbb{Q}\}}, the Gaussian rationals.

ExampleField of fractions of a polynomial ring

Given: k[x]k[x], polynomials in one variable over a field kk (an integral domain since kk has no zero divisors and leading coefficients multiply).

Goal: Compute Frac⁡(k[x])\operatorname{Frac}(k[x]) and a sample operation.

Steps: 1. By definition Frac⁡(k[x])={p(x)q(x):p,q∈k[x], q≠0}\operatorname{Frac}(k[x]) = \left\{ \dfrac{p(x)}{q(x)} : p,q \in k[x],\ q \neq 0 \right\}, the field of rational functions k(x)k(x). 2. Sample addition with k=Qk = \mathbb{Q}, 1x+xx+1\dfrac{1}{x} + \dfrac{x}{x+1}:

10
1x+xx+1=1⋅(x+1)+x⋅xx(x+1)=x2+x+1x2+x\quad \frac{1}{x} + \frac{x}{x+1} = \frac{1\cdot(x+1) + x\cdot x}{x(x+1)} = \frac{x^2 + x + 1}{x^2 + x}

Derivation hint: Apply rule [7] with b=xb = x, d=x+1d = x+1; the denominator x(x+1)≠0x(x+1)\neq 0 as a polynomial. 3. The numerator x2+x+1x^2+x+1 and denominator x2+xx^2+x share no common factor, so the fraction is in lowest terms.

Answer: Frac⁡(k[x])=k(x),and 1x+xx+1=x2+x+1x2+x\boxed{\operatorname{Frac}(k[x]) = k(x), \quad \text{and } \tfrac{1}{x}+\tfrac{x}{x+1} = \tfrac{x^2+x+1}{x^2+x}}.

Common Misconceptions

⚠️ Common mistake

"Every ring without inverses can be turned into a field of fractions." False. The construction requires no zero divisors. If RR has a zero divisor aa (so ab=0ab=0, b≠0b\neq 0), then in Frac⁡\operatorname{Frac} one would get a1⋅b1=01\tfrac{a}{1}\cdot\tfrac{b}{1} = \tfrac{0}{1} with both factors "nonzero," and worse, the relation [6] fails to be transitive. The correct general tool is localization S−1RS^{-1}R, which only inverts a chosen multiplicatively closed set SS of non-zero-divisors.

⚠️ Common mistake

"1≠01 \neq 0 is a pedantic technicality." It is essential. The zero ring {0}\{0\} satisfies every domain axiom except 1≠01 \neq 0, and we explicitly exclude it; otherwise the statement "fields are domains" and the field-of-fractions construction would degenerate.

Counterexample

The ring Z/6Z\mathbb{Z}/6\mathbb{Z} is not an integral domain: 2⋅3=6≡0(mod6)2 \cdot 3 = 6 \equiv 0 \pmod 6, yet 2≠02 \neq 0 and 3≠03 \neq 0. Hence 22 and 33 are zero divisors, cancellation fails (2⋅1=2=2⋅42\cdot 1 = 2 = 2 \cdot 4 but 1≠41 \neq 4), and there is no field of fractions. By contrast Z/pZ\mathbb{Z}/p\mathbb{Z} for pp prime is a field — a finite integral domain by Theorem [5], with inverses computed via Bézout's identity / Fermat's little theorem.

Connections

connection

Integral domains and fields sit at the heart of abstract algebra. The field-of-fractions functor generalizes to localization in commutative algebra, the local engine of Algebraic Geometry where one studies rings of functions vanishing or not vanishing on subsets. A domain whose every ideal is principal is a Principal Ideal Domain, which is automatically a Unique Factorization Domain; both refine the notion of "domain" by controlling factorization. Fields are the ground objects of Galois Theory and Vector Spaces (a vector space is precisely a module over a field). The construction of Q\mathbb{Q} from Z\mathbb{Z} is the prototype of Quotient Rings versus fraction rings — quotients add relations, fractions add inverses.

Real-World Applications

🔬 Where this appears

Historical Development

⏳ History
- 1830s — Galois: Implicitly works with finite fields ("Galois fields") while studying solvability of equations, foreshadowing field theory.
- 1871 — Dedekind: Introduces ideals and uses the German term Körper (body/field) for the rational/algebraic number domains; lays the abstract groundwork.
- 1881–1882 — Kronecker: Develops domains of rationality (Rationalitäts-Bereiche), an early version of fields generated by adjoining elements.
- 1893 — Weber: Gives an abstract axiomatic definition of a field in his treatise on Galois theory, separating the concept from specific number systems.
- 1899–1903 — Hensel: Introduces pp-adic numbers, new fields built from Z\mathbb{Z}, illustrating the richness of fraction-like completions.
- 1910 — Steinitz: Publishes Algebraische Theorie der Körper, the first systematic abstract theory of fields, including characteristic, transcendence degree, and algebraic closure.
- 1920s — Emmy Noether: Axiomatizes commutative ring theory, integral domains, and ideal theory, framing the modern viewpoint and the universal property of localization.
- 1930 — van der Waerden: Moderne Algebra codifies domains, fields, and fields of fractions as standard undergraduate material, drawing on Noether's and Artin's lectures.
- 1950s — Bourbaki/Grothendieck era: Localization and structure sheaves generalize the field of fractions into the engine of scheme-theoretic algebraic geometry.

Subtleties & Limits

open-problem

The clean field-of-fractions story is special to integral domains. For a general commutative ring RR one inverts only a multiplicatively closed set SS via localization S−1RS^{-1}R; the total quotient ring (inverting all non-zero-divisors) need not be a field. Deep structural questions persist: classifying all subfields between a domain's fraction field and its algebraic closure (the inverse Galois problem over Q\mathbb{Q} remains open — is every finite group a Galois group over Q\mathbb{Q}?); and understanding when a domain is "close to" its fraction field via finiteness conditions (Noetherian, integrally closed). The interplay of valuation theory, where one studies subrings of a field whose fraction field recovers the whole, remains an active and subtle area in arithmetic geometry.

See Also

Quotient Rings · Vector Spaces · Finite Fields · Polynomial Rings · Algebraic Geometry · Characteristic of a Field