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.

See The Solution Submitted by Richard    
Rating: 4.3333 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Counter example for Monoids | Comment 13 of 20 |
(In reply to Counter example for Monoids by JLo)

You and Steve Herman have posted some interesting stuff on monoids.  Thanks to both of you for paying some attention to the general subject of this problem. Getting back specifically to rings again, however, I have been wondering if there are any non-commutative cancellation rings that are not subrings of a division ring. Here, I would not necessarily require the ring to have a unity element, but one that does would be more interesting perhaps. That is, I usually include what some call rngs among what I call rings.
  Posted by Richard on 2006-08-06 17:32:47

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (16)
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