Let D be an integral domain. Then there exists a field F (called the field of quotients of D) that contains a subring isomorphic to D. PROOF Let S = {(a, b) | a, b E D, b ± 0}. We define an equivalence rela- tion on S by (a, b) = (c, d) if ad = bc. Now, let F be the set of equivalence classes of S under the relation = and denote the equivalence class that contains (x, y) by xly. We define addition and multiplication on F by alb + cld = (ad + bc)/(bd) and alb - cld = (ac)(bd). (Notice that here we need the fact that D is an integral domain to ensure that multiplication is closed; that is, bd + 0 whenever b + 0 and d + 0.) Since there are many representations of any particular element of F (just as in the rationals, we have 1/2 = 3/6 = 4/8), we must show that these two operations are well-defined. To do this, suppose that alb = a'lb' and cld = c'ld', so that ab' = a'b and cd' = c'd. It then follows that (ad + bc)b'd' = adb'd' + bcb'd' = (ab')dd' + (cd')bb' = (a'b)dd' + (c'd)bb' = a'd'bd + b'c'bd = (a'd' + b'c')bd. Thus, by definition, we have (ad + bc)/(bd) = (a'd' + b'c')/(b'd'), and, therefore, addition is well-defined. We leave the verification that multiplication is well-defined as an exercise (Exercise 55). That F is a field is straightforward. Let 1 denote the unity of D. Then 0/1 is the additive identity of F. The additive inverse of alb is - alb; the multipli- cative inverse of a nonzero element alb is bla. The remaining field prop- erties can be checked easily.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question

Show that the mapping Φ : D --> F in the proof of Theorem is a
ring homomorphism.

Let D be an integral domain. Then there exists a field F (called the
field of quotients of D) that contains a subring isomorphic to D.
PROOF Let S = {(a, b) | a, b E D, b ± 0}. We define an equivalence rela-
tion on S by (a, b) = (c, d) if ad = bc. Now, let F be the set of equivalence
classes of S under the relation = and denote the equivalence class that
contains (x, y) by xly. We define addition and multiplication on F by
alb + cld = (ad + bc)/(bd)
and
alb - cld = (ac)(bd).
(Notice that here we need the fact that D is an integral domain to ensure
that multiplication is closed; that is, bd + 0 whenever b + 0 and d + 0.)
Since there are many representations of any particular element of F
(just as in the rationals, we have 1/2 = 3/6 = 4/8), we must show that
these two operations are well-defined. To do this, suppose that alb = a'lb'
and cld = c'ld', so that ab' = a'b and cd' = c'd. It then follows that
(ad + bc)b'd' = adb'd' + bcb'd' = (ab')dd' + (cd')bb'
= (a'b)dd' + (c'd)bb' = a'd'bd + b'c'bd
= (a'd' + b'c')bd.
Thus, by definition, we have
(ad + bc)/(bd) = (a'd' + b'c')/(b'd'),
and, therefore, addition is well-defined. We leave the verification that
multiplication is well-defined as an exercise (Exercise 55). That F is a
field is straightforward. Let 1 denote the unity of D. Then 0/1 is the
additive identity of F. The additive inverse of alb is - alb; the multipli-
cative inverse of a nonzero element alb is bla. The remaining field prop-
erties can be checked easily.
Transcribed Image Text:Let D be an integral domain. Then there exists a field F (called the field of quotients of D) that contains a subring isomorphic to D. PROOF Let S = {(a, b) | a, b E D, b ± 0}. We define an equivalence rela- tion on S by (a, b) = (c, d) if ad = bc. Now, let F be the set of equivalence classes of S under the relation = and denote the equivalence class that contains (x, y) by xly. We define addition and multiplication on F by alb + cld = (ad + bc)/(bd) and alb - cld = (ac)(bd). (Notice that here we need the fact that D is an integral domain to ensure that multiplication is closed; that is, bd + 0 whenever b + 0 and d + 0.) Since there are many representations of any particular element of F (just as in the rationals, we have 1/2 = 3/6 = 4/8), we must show that these two operations are well-defined. To do this, suppose that alb = a'lb' and cld = c'ld', so that ab' = a'b and cd' = c'd. It then follows that (ad + bc)b'd' = adb'd' + bcb'd' = (ab')dd' + (cd')bb' = (a'b)dd' + (c'd)bb' = a'd'bd + b'c'bd = (a'd' + b'c')bd. Thus, by definition, we have (ad + bc)/(bd) = (a'd' + b'c')/(b'd'), and, therefore, addition is well-defined. We leave the verification that multiplication is well-defined as an exercise (Exercise 55). That F is a field is straightforward. Let 1 denote the unity of D. Then 0/1 is the additive identity of F. The additive inverse of alb is - alb; the multipli- cative inverse of a nonzero element alb is bla. The remaining field prop- erties can be checked easily.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Groups
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,