Moufang loop



A Moufang loop is a set with a binary operation that is similar to that of a group, but lacks associativity. Making this precise is a little fiddly.


A Moufang loop is a set QQ with a binary operation :Q×QQ\cdot\colon Q\times Q \to Q with two-sided unit ee such that left and right multiplication, y:QQy\cdot -\colon Q \to Q and x:QQ-\cdot x\colon Q \to Q respectively, are isomorphisms (i.e. it is a unital quasigroup or loop) such that the Moufang identities hold:

  • (uv)(wu)=(u(vw))u)=u((vw)u)(u v)(w u) = (u(v w))u) = u((v w)u)

  • ((uv)u)w=u(v(uw))((u v)u)w = u(v(u w))

  • ((uv)w)v=u(v(wv))((u v)w)v = u(v(w v))

One may consider the weaker analogous structure without unit ee, the Moufang quasigroup, but the Moufang identities, by a result of Kenneth Kunen imply that the quasigroup is a loop.


Every element in a Moufang loop has a multiplicative inverse; a priori there are only left and right inverses, but these coincide by the Moufang identities.

Since right and left multiplication give isomorphisms of the underlying set, one can ‘divide’ by any element of the Moufang loop, on the right or on the left (recall we are not assuming commutativity). Thus one can define a Moufang loop as a set together with a multiplication as above, together with right and left division operations /,\:Q×QQ/, \backslash \colon Q\times Q \to Q, again satisfying the Moufang identities. Thus Moufang loops are algebras for a Lawvere theory, and thus can be defined internal to any category with finite products.

Moufang loops are power-associative, in that any bracketing of a string consisting of copies of the same element multiply to a unique element. In fact, more is true, in that any two elements generate a genuine group; that is, Moufang loops are alternative.


  • Any group is a Moufang loop.

  • The non-zero octonions form a Moufang loop, as does the multiplicatively closed subset of octonions of norm 1 (which form the 7-sphere). The invertible elements in any alternative ring or alternative algebra form a Moufang loop.

  • The basis octonions, 1,e 1,,e 71,e_1,\ldots,e_7 and their additive inverses 1,e 1,,e 7-1,-e_1,\ldots,-e_7 form a finite Moufang loop of order 16 (compare with the case of the quaternions, where the basis elements and their inverses form a group of order 8, the quaternion group Q 8Q_8).

  • There is a finite Moufang loop of order 2 132^{13} which John Conway used to construct the Monster group. This Moufang loop is a central extension by /2\mathbb{Z}/2 of the binary Golay code, an abelian group of order 2 122^{12}, see (Hsu). This is a special case of a code loop, which is a specific sort of Moufang loop.


Related concepts in nnLab: quasigroup, Bol loop, composition algebra, identities of Bol-Moufang type

  • Wikipedia: Moufang loop

  • eom: Moufang loop

  • R. Moufang, Zur Struktur von Alternativkörpern, Math. Ann. 110 (1935) 416–430 (gdz)

  • Tim Hsu, Explicit constructions of code loops as centrally twisted products, Math. Proc. Cambridge Philos. Soc. 128 (2000), no. 2, 223–232 (journal or preprint)

  • Kenneth Kunen, Moufang quasigroups, J. Algebra 183:1 (1996) 231–234 doi
  • E. N. Kuz’min, , Algebra i Logika 10 (1) (1971), pp. 3–22, in Russian pdf, English translation: On a relation between Malcev algebras and analytic Moufang loops, Algebra Logic 10 (1972), pp. 1–14

Last revised on March 8, 2016 at 05:40:18. See the history of this page for a list of all contributions to it.