maths.freeAbstract Algebra › 18. Integral Domains › Fields of Fractions

Fields of Fractions

Every field is also an integral domain; however, there are many integral domains that are not fields. For example, the integers {\mathbb Z} form an integral domain but not a field.

Fields of Fractions

Every field is also an integral domain; however, there are many integral domains that are not fields. For example, the integers \({\mathbb Z}\) form an integral domain but not a field. A question that naturally arises is how we might associate an integral domain with a field. There is a natural way to construct the rationals \({\mathbb Q}\) from the integers: the rationals can be represented as formal quotients of two integers. The rational numbers are certainly a field. In fact, it can be shown that the rationals are the smallest field that contains the integers. Given an integral domain \(D\), our question now becomes how to construct a smallest field \(F\) containing \(D\). We will do this in the same way as we constructed the rationals from the integers.

An element \(p/q \in {\mathbb Q}\) is the quotient of two integers \(p\) and \(q\); however, different pairs of integers can represent the same rational number. For instance, \(1/2 = 2/4 = 3/6\). We know that \[\begin{aligned}\end{aligned}\] if and only if \(ad = bc\). A more formal way of considering this problem is to examine fractions in terms of equivalence relations. We can think of elements in \({\mathbb Q}\) as ordered pairs in \({\mathbb Z} \times {\mathbb Z}\). A quotient \(p/q\) can be written as \((p, q)\). For instance, \((3, 7)\) would represent the fraction \(3/7\). However, there are problems if we consider all possible pairs in \({\mathbb Z} \times {\mathbb Z}\). There is no fraction \(5/0\) corresponding to the pair \((5,0)\). Also, the pairs \((3,6)\) and \((2,4)\) both represent the fraction \(1/2\). The first problem is easily solved if we require the second coordinate to be nonzero. The second problem is solved by considering two pairs \((a, b)\) and \((c, d)\) to be equivalent if \(ad = bc\).

If we use the approach of ordered pairs instead of fractions, then we can study integral domains in general. Let \(D\) be any integral domain and let \[\begin{aligned}\end{aligned}\]. Define a relation on \(S\) by \((a, b) \sim (c, d)\) if \(ad = bc\).

The field \(F_D\) in is called the field of fractions or field of quotients of the integral domain \(D\).

We will leave the proofs of the following corollaries of as exercises.

Condensed — the full section is in Judson, Abstract Algebra: Theory and Applications.

Symbols used here

x \in A,\ A \subseteq B
element of, subset
x belongs to A; every element of A is in B.
\mathbb{N},\ \mathbb{Z},\ \mathbb{Q},\ \mathbb{R},\ \mathbb{C}
number sets
Naturals, integers, rationals, reals, complex numbers.
\blacksquare\ \text{or}\ \square
end of proof (halmos)
Marks the point where the statement has been established.
a \equiv b \pmod n
congruent modulo n
n divides a − b; a and b have the same remainder.
a \mid b,\ \gcd(a,b)
divides, greatest common divisor
b is a multiple of a; the largest number dividing both.
(G, \cdot),\ e,\ g^{-1}
group, identity, inverse
A set with an operation; the do-nothing element; the element that undoes g.
G \cong H,\ G / N
isomorphic, quotient group
Same structure; the group of cosets of a normal subgroup N.
\mathbb{Z}/n\mathbb{Z},\ \mathbb{Z}_n
integers modulo n
The remainders 0…n−1 with clock arithmetic.
\operatorname{Hom}(A, B),\ f \circ g
arrows from A to B, composition
The set of morphisms; do g then f.

Questions people ask

What is a group, in plain words?

A set with one operation that is associative, has an identity, and lets every element be undone. Symmetries of any object form a group — that is where the idea came from.

What is the difference between a ring and a field?

A ring has addition and multiplication that behave like the integers (you cannot always divide); a field is a ring where every non-zero element has a reciprocal, like the rationals or the reals.

स्वतःचा प्रयत्न करा

Parts of this page are adapted from Judson, Abstract Algebra: Theory and Applications (GFDL 1.3). Condensed and re-explained here; errors are ours.

अधिक माहिती Abstract Algebra