Half-isomorphisms of automorphic loops
Abstract
Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes groups and commutative Moufang loops. A half-isomorphism f : G K between multiplicative systems G and K is a bijection from G onto K such that f(ab)∈\f(a)f(b), f(b)f(a)\ for any a,b∈ G. A half-isomorphism is trivial when it is either an isomorphism or an anti-isomorphism. Consider the class of automorphic loops such that the equation x·(x· y) = (y· x)· x is equivalent to x· y = y· x. Here we show that this class of loops includes automorphic loops of odd order and uniquely 2-divisible. Furthermore, we prove that every half-isomorphism between loops in that class is trivial.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.