Namespaces
Variants
Actions

Cancellation law

From Encyclopedia of Mathematics
Jump to: navigation, search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

In an algebraic structure $A$ with a binary operation $\cdot$, the left and right cancellation laws respectively hold if for all $x,y,z$ $$ x \cdot y = x \cdot z \Rightarrow y = z \,, $$ $$ x \cdot y = z \cdot y \Rightarrow x = z \ . $$ Such a structure is termed "cancellative".

A group satisfies the cancellation laws; a finite semi-group is a group if and only if it satisfies the cancellation laws. A commutative semi-group embeds in a group if and only if it is cancellative: for non-commutative groups the analogous statement does not hold in general, see Imbedding of semi-groups.

A ring is an integral domain if it is commutative and satisfies the cancellation laws for non-zero elements,

How to Cite This Entry:
Cancellation law. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Cancellation_law&oldid=37349