Proving the Ideal Property of a Set in a Commutative Ring with Identity

  • Thread starter Thread starter j9mom
  • Start date Start date
  • Tags Tags
    Ring Theorem
j9mom
Messages
31
Reaction score
0

Homework Statement


I need to prove this theorem Let R be a commutative ring with identity and c1,c2,...cn E (element of) R Then the set I={r1c1+r2c2+...+rncn|r1,r2,...,rn E R} is an ideal in R




Homework Equations



Well I do know I need to prove closure under subtraction, closure under multiplication and absorption r E R and a E I show ra E I and ar E I I know because R is commutative I do not have to prove both ways. and I know that just proving absorption will prove multiplication.

The Attempt at a Solution



so, I guess I am just confused on what the set I looks like.

to prove closure under subraction I need to elements from I. What would these two elements look like?
 
Physics news on Phys.org
The set "looks like" exactly what it says: All things of the form r_1c_1+ r_2c_2+ \cdot\cdot\cdot+ r_nc_n where c_1, c_2, \cdot\cdot\cdot, c_n are given (fixed) members of ring R and r_1, r_2, \cdot\cdot\cdot, r_n can be any members of the ring.

So you want to prove:
(1) Closed under addition: If r_1c_1+ r_2c_2+ \cdot\cdot\cdot+ r_nc_n and s_1c_1+ s_2c_2+ \cdot\cdot\cdot+ s_nc_n are members of this set, it their sum also a member? That is can it be written in the same way: find t_1, t_2, \cdot\cdot\cdot, t_n such that the sum of those two is t_1c_1+ t_2c_2+ \cdot\cdot\cdot+ t_nc_n.

(2) "Absorption" of the entire ring: If r_1c_1+ r_2c_2+ \cdot\cdot\cdot+ r_nc_n is in the set, show that r(r_1c_1+ r_2c_2+ \cdot\cdot\cdot+ r_nc_n), for r any member of the ring, is of that same form.

Those are both just as easy as they look.
 
Ok that is easy.

So under addition, because R is a ring then r1+s1 will be in R so the (r1+s1)c1+(r2+s2)c2... is in I

And because R is a Ring and closed under multiplication r*r1, r*r2,... are in R so r*r1c1+r*r2c2+... is in I

So it is a ideal in R

Thanks
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top