## You are here

HomeMoufang loop

## Primary tabs

# Moufang loop

Proposition: Let $Q$ be a nonempty quasigroup.

I) The following conditions are equivalent.

$\displaystyle(x(yz))x$ | $\displaystyle=$ | $\displaystyle(xy)(zx)\qquad\text{for all }x,y,z\in Q$ | (1) | ||

$\displaystyle((xy)z)y$ | $\displaystyle=$ | $\displaystyle x(y(zy))\qquad\text{for all }x,y,z\in Q$ | (2) | ||

$\displaystyle(xz)(yx)$ | $\displaystyle=$ | $\displaystyle x((zy)x)\qquad\text{for all }x,y,z\in Q$ | (3) | ||

$\displaystyle((yz)y)x$ | $\displaystyle=$ | $\displaystyle y(z(yx))\qquad\text{for all }x,y,z\in Q$ | (4) |

II) If $Q$ satisfies those conditions, then $Q$ has an identity element (i.e., $Q$ is a loop).

For a proof, we refer the reader to the two references. Kunen in [1] shows that that any of the four conditions implies the existence of an identity element. And Bol and Bruck [2] show that the four conditions are equivalent for loops.

Definition: A nonempty quasigroup satisfying the conditions (1)–(4) is called a Moufang quasigroup or, equivalently, a Moufang loop (after Ruth Moufang, 1905–1977).

The 16-element set of unit octonions over $\mathbb{Z}$ is an example of a nonassociative Moufang loop. Other examples appear in projective geometry, coding theory, and elsewhere.

References

[1] Kenneth Kunen, Moufang Quasigroups, J. Algebra 83 (1996) 231–234. (A preprint in PostScript format is available from Kunen’s website: Moufang Quasigroups.)

[2] R. H. Bruck, A Survey of Binary Systems, Springer-Verlag, 1958.

## Mathematics Subject Classification

20N05*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

new question: Prove a formula is part of the Gentzen System by LadyAnne

Mar 30

new question: A problem about Euler's totient function by mbhatia

new problem: Problem: Show that phi(a^n-1), (where phi is the Euler totient function), is divisible by n for any natural number n and any natural number a >1. by mbhatia

new problem: MSC browser just displays "No articles found. Up to ." by jaimeglz

Mar 26

new correction: Misspelled name by DavidSteinsaltz

Mar 21

new correction: underline-typo by Filipe

Mar 19

new correction: cocycle pro cocyle by pahio

Mar 7

new image: plot W(t) = P(waiting time <= t) (2nd attempt) by robert_dodier

new image: expected waiting time by robert_dodier

new image: plot W(t) = P(waiting time <= t) by robert_dodier