Have a personal or library account? Click to login
AIM Loops and the AIM Conjecture Cover
By: Chad E. Brown and  Karol Pąk  
Open Access
|Feb 2020

Abstract

In this article, we prove, using the Mizar [2] formalism, a number of properties that correspond to the AIM Conjecture. In the first section, we define division operations on loops, inner mappings T, L and R, commutators and associators and basic attributes of interest. We also consider subloops and homomorphisms. Particular subloops are the nucleus and center of a loop and kernels of homomorphisms. Then in Section 2, we define a set Mlt Q of multiplicative mappings of Q and cosets (mostly following Albert 1943 for cosets [1]). Next, in Section 3 we define the notion of a normal subloop and construct quotients by normal subloops. In the last section we define the set InnAut of inner mappings of Q, define the notion of an AIM loop and relate this to the conditions on T, L, and R defined by satisfies TT, etc. We prove in Theorem (67) that the nucleus of an AIM loop is normal and finally in Theorem (68) that the AIM Conjecture follows from knowing every AIM loop satisfies aa1, aa2, aa3, Ka, aK1, aK2 and aK3.

The formalization follows M.K. Kinyon, R. Veroff, P. Vojtechovsky [4] (in [3]) as well as Veroff’s Prover9 files.

DOI: https://doi.org/10.2478/forma-2019-0027 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Language: English
Page range: 321 - 335
Accepted on: Aug 29, 2019
Published on: Feb 20, 2020
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year

© 2020 Chad E. Brown, Karol Pąk, published by University of Białystok
This work is licensed under the Creative Commons Attribution-ShareAlike 4.0 License.