Skip to content

Field of fractions

The smallest field containing an integral domain, constructed from equivalence classes of ratios of its elements with nonzero denominators.

Version
v3 · 2026-09-19 · History
Domain-specific #
1833
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Commutative Algebra → Mathematics
Aliases
Fraction field, Quotient field

Core Idea

Field of fractions is the smallest field containing an integral domain, constructed from equivalence classes of ratios of its elements with nonzero denominators.

The field of fractions Frac(R) of an integral domain R is the field whose elements are equivalence classes of pairs (a,b) with a in R and nonzero b in R, where (a,b)~(c,d) exactly when ad=bc. Addition and multiplication use common-denominator formulas, and R embeds by a↦a/1; the construction is universal among injective homomorphisms from R into fields.

How would you explain it like I'm…

Making Fair-Share Numbers

With whole numbers, you can't always share fairly: 1 cookie for 2 kids doesn't come out even. So we invent fractions, like one-half, built from two whole numbers. We also agree that 1/2 and 2/4 mean the same amount. The field of fractions is the smallest set of numbers you get this way, where sharing (except by zero) always works.

Building Fractions from Whole Numbers

Whole numbers let you add, subtract, and multiply, but not always divide. To fix that, you build fractions: pairs of whole numbers like 3/4, where the bottom number can't be zero. Different-looking fractions count as the same when they cross-multiply equally, so 1/2 = 2/4 because 1×4 = 2×2. Each whole number shows up as itself over 1, like 5 = 5/1. The result is the smallest number system that contains the whole numbers and lets you divide by anything except zero.

Smallest Field Containing a Domain

The field of fractions of an integral domain R is the smallest field that contains R. An integral domain is a commutative ring with no zero-divisors, like the integers. You build it from pairs (a, b) with b ≠ 0, thought of as a/b. Two pairs are declared equal when ad = bc, which is the cross-multiplication rule. Addition and multiplication use the usual common-denominator formulas. Each element a of R is identified with a/1, so R sits inside the new field. For the integers this produces the rationals ℚ. The construction needs R to be an integral domain; with zero-divisors, the cross-multiplication rule breaks down.

 

For an integral domain R, the field of fractions Frac(R) consists of equivalence classes of pairs (a, b) with a ∈ R and b ∈ R∖{0}. The equivalence relation is (a, b) ~ (c, d) exactly when ad = bc. Operations are a/b + c/d = (ad + bc)/bd and (a/b)(c/d) = ac/bd. These are well defined, and bd ≠ 0 precisely because R has no zero-divisors. The map a ↦ a/1 is an injective ring homomorphism R → Frac(R). Every non-zero class a/b with a ≠ 0 has inverse b/a, so Frac(R) is a field. The construction is universal: any injective homomorphism from R into a field factors uniquely through Frac(R), which is the sense in which it is the smallest field containing R. Examples are Frac(ℤ) = ℚ and Frac(k[x]) = k(x).

Scope of Application

The abstraction recurs literally within commutative algebra, algebraic geometry, and number theory wherever an integral domain is embedded in the smallest surrounding field. The following habitats preserve the same recognition machinery; they are not invitations to extend the name metaphorically.

  • Integers. Frac(Z) is Q.
  • Polynomial rings. Frac(k[x]) is the rational-function field k(x).
  • Coordinate rings. an irreducible affine variety has a function field.
  • Unique factorization. divisibility in a domain is compared inside its field.
  • Localization theory. the construction is localization at all nonzero elements.

Clarity

Verify commutativity, identity, and absence of zero divisors; state whether an isomorphic concrete field or the equivalence-class construction is used. Prove operations are well defined and do not confuse the field with a quotient by an ideal.

A practical identification audit begins with the typed roles rather than the title: establish the integral domain, verify the numerator–denominator pairs, then test the remaining conditions and exclusions.

Manages Complexity

The construction freely supplies division while preserving every equation already valid in the domain. The universal property replaces calculations with arbitrary ambient fields by one canonical object up to unique isomorphism.

The compression remains accountable because each simplification has a named failure condition. Disagreement can be localized to a missing role, an invalid assumption, an ambiguous measurement, or a neighboring abstraction instead of being hidden inside an unanalyzed label.

Abstract Reasoning

R1. Confirm that R is an integral domain. R2. Form pairs with nonzero denominator and impose cross-multiplication equivalence. R3. Verify the relation and fraction operations are well defined. R4. Embed R through a/1 and prove injectivity. R5. Use the universal property to compare any other field containing an image of R.

Knowledge Transfer

The construction transfers literally across integral domains and equivalent localization formalisms. Equivalence relation and closure are parents; informal ratios in a system with zero divisors are not automatically a fraction field.

The transfer boundary is explicit: DOMAIN-SPECIFIC PASS / PRIME FAIL: The construction recurs across integral domains and generalizes the embedding of integers into rational numbers. Literal recognition retains the specialist vocabulary and validity conditions of commutative algebra; outside that setting only broader parent operations transfer.

Relationships to Other Abstractions

Local relationship map for Field of fractionsParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Field of fractionsDOMAINPrime abstraction: Closure — is a kind ofClosurePRIMEPrime abstraction: Equivalence Relation — is a kind ofEquivalenceRelationPRIME

Current abstraction Field of fractions Domain-specific

Parents (2) — outgoing typed relations

  • Field of fractions is a kind of Closure Prime

    Closure (prime:closure).

  • Field of fractions is a kind of Equivalence Relation Prime

    Equivalence Relation (prime:equivalence_relation).

Hierarchy paths (2) — routes to 2 parentless roots

  • Field of fractions → is a kind of Closure

Neighborhood in Abstraction Space

Field of fractions sits in a moderately populated region (54th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25