2. Let d € Z – {0} and assume that √d & Q (we will eventually prove that this is true if and only if d is not the square of an integer, i.e., if and only if √d Z). In this case, the elements of Z[√d] are called quadratic integers. = a+b√d. (a) Prove that, if z € Z[√d], then there are unique integers a and b such that z = (Hint: Such integers exist by the definition of Z[√d]. Assuming that there are integers a₁, a2, b₁, and b2 such that z = a₁ + b₁√d and z = a₂ + b₂√d, we need to show that a₁ = a2 and b₁ = b₂. Ignoring the first equality, suppose for the sake of a contradiction that b₁ b₂. Use the irrationality of √d to reach a contradiction. How does the desired result follow?) (b) We would like to define a function oa : Z[√d] → Z[√d] by oa(z) = a - b√d, where a, b € Z satisfy z = a +b√d. Why is there a potential issue with trying to define a function using this formula? Explain how (a) resolves this issue, so that the displayed formula does indeed give a well-defined function, which we call conjugation. (Hint: compare with the first problem of Homework 1.) (c) Prove that the function od defined in (b) is bijective.
2. Let d € Z – {0} and assume that √d & Q (we will eventually prove that this is true if and only if d is not the square of an integer, i.e., if and only if √d Z). In this case, the elements of Z[√d] are called quadratic integers. = a+b√d. (a) Prove that, if z € Z[√d], then there are unique integers a and b such that z = (Hint: Such integers exist by the definition of Z[√d]. Assuming that there are integers a₁, a2, b₁, and b2 such that z = a₁ + b₁√d and z = a₂ + b₂√d, we need to show that a₁ = a2 and b₁ = b₂. Ignoring the first equality, suppose for the sake of a contradiction that b₁ b₂. Use the irrationality of √d to reach a contradiction. How does the desired result follow?) (b) We would like to define a function oa : Z[√d] → Z[√d] by oa(z) = a - b√d, where a, b € Z satisfy z = a +b√d. Why is there a potential issue with trying to define a function using this formula? Explain how (a) resolves this issue, so that the displayed formula does indeed give a well-defined function, which we call conjugation. (Hint: compare with the first problem of Homework 1.) (c) Prove that the function od defined in (b) is bijective.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
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…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
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…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,