Engineering / Mathematics — Fields, Series and Factorisation
The Field of Fractions of an Integral Domain
Constructing the field of fractions of an integral domain, its universal property, and the standard examples.
Executive summary
Every integral domain embeds in a smallest field containing it, constructed from formal fractions exactly as the rationals are built from the integers.
The construction requires the absence of zero divisors, which is precisely the integral domain condition.
Learning objectives
- Construct the field of fractions and verify well-definedness.
- State its universal property.
- Identify the standard examples.
01The construction
Field of fractions
For an integral domain R, consider pairs (a, b) with b ≠ 0, under the equivalence (a,b) ~ (c,d) iff ad = bc.
Writing the class of (a,b) as a/b, addition and multiplication are the usual fraction rules, and the result is a field.
Transitivity of the equivalence is where integrality is used. From ad = bc and cf = de one derives adf = bcf = bde, and cancelling d requires d not to be a zero divisor.
The map a ↦ a/1 embeds R into its field of fractions injectively, again because there are no zero divisors.
02Universal property
Universal property
If f: R → K is an injective ring homomorphism into a field, then f extends uniquely to the field of fractions.
This says the field of fractions is the smallest field containing R: any other embedding factors through it. Uniqueness up to isomorphism follows immediately.
| Domain | Field of fractions |
|---|---|
| Z | Q |
| F[X] | F(X), rational functions |
| F[[X]] | F((X)), formal Laurent series |
| Z[i] | Q(i) |
| A field K | K itself |
03Computational relevance
The construction underlies exact computation over the rationals and over rational function fields.
Exact rational arithmetic
Computer algebra systems represent rationals as reduced fraction pairs, which is this construction implemented directly.
Rational function reconstruction
Recovering an element of F(X) from a residue is the polynomial analogue of recovering a rational from a residue modulo n.
Coefficient growth
Arithmetic in a field of fractions causes numerator and denominator growth, which is exactly what the modular method avoids.
04Frequently asked questions
Why must the ring have no zero divisors?
Because inverting a zero divisor forces a collapse: if ab = 0 with both non-zero, then inverting a gives b = 0. The equivalence relation also fails to be transitive without cancellation.
Is the field of fractions unique?
Up to a unique isomorphism fixing R, yes — this is what the universal property guarantees. Different constructions give canonically isomorphic results.
What is localisation?
A generalisation inverting only a chosen multiplicative subset rather than all non-zero elements. It works for rings with zero divisors, at the cost of the map from R no longer being injective.
Sources and method
Structural reference: Victor Shoup, A Computational Introduction to Number Theory and Algebra, Version 1, Cambridge University Press, 2005 — book pages 363-366.
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.