Show ring has no divisors of zero

  • Thread starter Thread starter samkolb
  • Start date Start date
  • Tags Tags
    Ring Zero
samkolb
Messages
37
Reaction score
0

Homework Statement


Let R be a ring containing two or more elements such that for each nonzero a in R, there exists a unique b in R such that a=aba. Show that R contains no divisors of zero.


Homework Equations


The ring axioms.



The Attempt at a Solution


I assumed that R contains divisors of zero. So assume there exist nonzero a,b in R such that ab=0. Then there exist unique c,d in R such that a=aca and b=bdb.

Consider the expression ca+bd.

If ca+bd=0, then multiplying on the left by a gives a=0 and multiplying on the right by b gives b=0.

So assume ca+bd is not equal to zero. Then there exists unique e in R such that
ca+bd=(ca+bd)e(ca+bd).

Multiplying on the left by a gives a=aebd+aeca=ae(ca+bd).

Substituting this expression for a into a=aca gives
a=aca=ae(ca+bd)ca.

From the uniqueness of c, e(ca+bd)c=c.

This is as far as I've gotten. I don't know if I have made any progress or am just going in circles.
 
Physics news on Phys.org
Suppose a and c are zero divisors. Then ac=0. There is a UNIQUE b such that aba=a. What is a(b+c)a?
 
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