All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Ambidextrous Cancellation Mission (Posted on 2006-07-20) Difficulty: 3 of 5
A ring is an algebraic system that supports unlimited addition, subtraction, and multiplication, with all the familiar laws (such as the distributive laws a(x+y)=ax+ay and (x+y)b=xb+yb) holding except that there may possibly be a,b pairs for which ab=ba does not hold. The ordinary integers are an example of a ring (where, however, ab=ba does always hold).

A ring has the left-cancellation property if ax=ay implies x=y for all nonzero a and all x and y, and has the right-cancellation property if xb=yb implies x=y for all nonzero b and all x and y.

Your mission should you choose to accept it: Prove that a ring has the left-cancellation property if and only if it has the right-cancellation property.

  Submitted by Richard    
Rating: 4.3333 (3 votes)
Solution: (Hide)
The left-cancellation property by itself implies that if ab=0 then at least one of a,b must be zero, and this then implies the right-cancellation property. Of course, the same holds if left and right are interchanged.

The zero referred to here is 0=x-x, the unique ring element that is the difference of any ring element x from itself. It is easily shown that in any ring a0=0 and 0b=0, for any a,b.

To see that left-cancellation implies ab=0 only if at least one of a,b is zero, just note that if a is not 0, but ab is 0, then ab=0=a0 so that b=0 by left cancellation. Hence it is impossible that ab=0 with both a and b nonzero.

Now if ab=0 only if at least one of a,b is zero then, if b is not zero, xb=yb implies (x-y)b=0 so that x-y=0, or x=y and hence b can be right-cancelled.

The second comment by JLo gives an excellent short proof that uses a little logic manipulation and avoids any detour through "ab=0 only if at least one of a,b is zero."

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re(3): Counter example for MonoidsRichard2006-08-15 20:39:25
re(4): Counter example for MonoidsRichard2006-08-10 19:53:03
re(3): Counter example for Monoids (actually it is valid)Steve Herman2006-08-07 22:44:55
re(3): Counter example for MonoidsRichard2006-08-07 18:07:12
re(2): Counter example for MonoidsJLo2006-08-07 16:43:52
re(2): Counter example for Monoids (actually it is valid)JLo2006-08-07 15:23:54
re: Counter example for Monoids (not valid)Steve Herman2006-08-06 23:55:16
re: Counter example for MonoidsRichard2006-08-06 17:32:47
Some ThoughtsCounter example for MonoidsJLo2006-08-06 13:53:08
re(7): Another possibility? LCPRCP in monoids???JLo2006-08-04 11:12:52
re(6): Another possibility? LCPRCP in monoids???Steve Herman2006-08-03 22:30:25
re(5): Another possibility? LCPRCP in monoids???JLo2006-07-29 12:38:06
re(4): Another possibility? LCPRCP in monoids???Steve Herman2006-07-24 08:49:54
re(3): Another possibility? LCPRCP in monoids???JLo2006-07-21 14:50:38
re(2): Another possibility? LCPRCP in groups???Steve Herman2006-07-21 08:22:06
Some Thoughtsre: Another possibility? LCPRCP in groups???JLo2006-07-21 07:46:33
re: Another possibility?Steve Herman2006-07-20 23:09:36
Another possibility?e.g.2006-07-20 18:53:49
SolutionSolutionJLo2006-07-20 16:30:52
Hints/TipsHintJLo2006-07-20 16:24:23
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information