I is an ideal of Z[x].

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

Could you explain how to show 9.2 in detail? I included list of theorems and definitions from the textbook.

**Definition 9.1.** Let \( R \) be a ring. Then a subring \( I \) of \( R \) is said to be an ideal if \( ir, ri \in I \) for all \( i \in I \) and \( r \in R \). We call this the absorption property.

**Theorem 9.1.** Let \( R \) be a ring and \( I \) a subset of \( R \). Then \( I \) is an ideal if and only if

1. \( 0 \in I; \)
2. \( i - j \in I \) for all \( i, j \in I; \) and
3. \( ir, ri \in I \) for all \( i \in I, r \in R. \)

**Example 9.1.** Let \( n \) be any integer. Then \( n\mathbb{Z} \) is an ideal of \( \mathbb{Z} \). Indeed, we already know that it is a subring. But also, if \( nk \in n\mathbb{Z} \), then for any integer \( r, r(nk) = n(rk) \in n\mathbb{Z}. \)

**Example 9.2.** Let \( I \) be the set of all polynomials \( f(x) \in \mathbb{R}[x] \) such that \( f(0) = 0. \) We claim that \( I \) is an ideal in \( \mathbb{R}[x] \). Certainly, \( I \) contains the zero polynomial. Also, if \( f(0) = g(0) = 0 \), then \( (f-g)(0) = f(0) - g(0) = 0 \), hence \( f(x) - g(x) \in I. \) Also, if \( f(0) = 0 \) and \( h(x) \in \mathbb{R}[x], \) then \( h(0)f(0) = h(0)0 = 0. \) Hence, \( h(x)f(x) \in I. \)

**Example 9.3.** Let \( I \) be the set of all polynomials in \( \math
Transcribed Image Text:**Definition 9.1.** Let \( R \) be a ring. Then a subring \( I \) of \( R \) is said to be an ideal if \( ir, ri \in I \) for all \( i \in I \) and \( r \in R \). We call this the absorption property. **Theorem 9.1.** Let \( R \) be a ring and \( I \) a subset of \( R \). Then \( I \) is an ideal if and only if 1. \( 0 \in I; \) 2. \( i - j \in I \) for all \( i, j \in I; \) and 3. \( ir, ri \in I \) for all \( i \in I, r \in R. \) **Example 9.1.** Let \( n \) be any integer. Then \( n\mathbb{Z} \) is an ideal of \( \mathbb{Z} \). Indeed, we already know that it is a subring. But also, if \( nk \in n\mathbb{Z} \), then for any integer \( r, r(nk) = n(rk) \in n\mathbb{Z}. \) **Example 9.2.** Let \( I \) be the set of all polynomials \( f(x) \in \mathbb{R}[x] \) such that \( f(0) = 0. \) We claim that \( I \) is an ideal in \( \mathbb{R}[x] \). Certainly, \( I \) contains the zero polynomial. Also, if \( f(0) = g(0) = 0 \), then \( (f-g)(0) = f(0) - g(0) = 0 \), hence \( f(x) - g(x) \in I. \) Also, if \( f(0) = 0 \) and \( h(x) \in \mathbb{R}[x], \) then \( h(0)f(0) = h(0)0 = 0. \) Hence, \( h(x)f(x) \in I. \) **Example 9.3.** Let \( I \) be the set of all polynomials in \( \math
**9.2.** Let \( I \) be the set of all polynomials in \(\mathbb{Z}[x]\) whose constant term is a multiple of 5. Show that \( I \) is an ideal of \(\mathbb{Z}[x]\).
Transcribed Image Text:**9.2.** Let \( I \) be the set of all polynomials in \(\mathbb{Z}[x]\) whose constant term is a multiple of 5. Show that \( I \) is an ideal of \(\mathbb{Z}[x]\).
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Basics of Inferential Statistics
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.
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,