Inverse property loop: Difference between revisions

Revision as of 16:11, 9 March 2010

This article defines a property that can be evaluated for a loop.
View other properties of loops

A loop $(L, *)$ is termed an inverse property loop or inverse loop or IP-loop if it satisfies the following equivalent conditions:

Existence of left and right inverses: There exists a bijective map $λ : L \to L$ such that $λ (a) * (a * b) = b \forall a, b \in L$ .
Existence of two-sided inverses: There exists a bijective map $- 1 : L \to L$ such that $a^{- 1} * (a * b) = (b * a) * a^{- 1} = b$ for all $a, b \in L$ .

Note that for a quasigroup, the existence of both left and right inverses does not guarantee the existence of two-sided inverses.

Property	Meaning	Proof of implication	Proof of strictness (reverse implication failure)	Intermediate notions
Group				\|FULL LIST, MORE INFO
Automorphic inverse property loop				\|FULL LIST, MORE INFO
Moufang loop				\|FULL LIST, MORE INFO

Property	Meaning	Proof of implication	Proof of strictness (reverse implication failure)	Intermediate notions
Left-inverse property loop
Right-inverse property loop

@@ Line 1: / Line 1: @@
-{{algebra loop property}}
+{{loop property}}
 ==Definition==
-An [[algebra loop]] <math>(L,*)</math> is termed an '''inverse property loop''' or '''inverse loop''' or '''IP-loop''' if it satisfies the following equivalent conditions:
+A [[loop]] <math>(L,*)</math> is termed an '''inverse property loop''' or '''inverse loop''' or '''IP-loop''' if it satisfies the following equivalent conditions:
 # '''Existence of left and right inverses''': There exists a bijective map <math>\lambda:L \to L</math> such that <math>\lambda(a) * (a * b) = b \ \forall \ a, b \in L</math>.