The distance bound for loops with nonequivalent associator
Let and be Moufang loops on the same set of order , and define their distance by
Suppose that and have nonequivalent associators. Distance-bound conjecture. Their distance satisfies
This conjecture asks for the minimum distance between Moufang loops with nonequivalent associator; the source gives no evidence of a proof or disproof.
References
- Aleš Drápal and Petr Vojtěchovský, “Moufang loops that share associator and three quarters of their multiplication tables”, arXiv:math/0701710 (2007).
Progress summary
A reader-submitted construction claims the conjectured lower bound fails at order , but no independent source has checked it.
The distance-bound conjecture, posed by Drápal and Vojtěchovský as Conjecture , asserts that Moufang loops of order with nonequivalent associators differ in at least table entries. The published source presents it as an open future problem.
Known results
- Drápal and Vojtěchovský: the bound is stated as Conjecture ; no proof or disproof is reported.
November 7, 2026 counterexample claim
A submitted proof argues that and a cubic code loop on have nonequivalent associators and distance , whereas , so the unrestricted conjecture fails. This claim is unverified.
Current status (as of November 2026): The conjecture remains open in the verified literature; a reader-submitted order- counterexample claim is unverified.
Sources
Solutions 1
A quarter-table change from a group to a classical Moufang loop of order 16See full solution
Result and scope. F_2^4 and the cubic code loop on F_2^3 x F_2 are Moufang loops with common identity, associators with images of size 1 and 2 (inequivalent under pointed, unpointed and independent bijective readings), and table distance 64 < 3*16^2/8 = 96; refutes Drapal-Vojtechovsky Conjecture 11.2 in its stated unrestricted scope.
Complete proof: A quarter-table change from a group to a classical Moufang loop of order 16 · PDF.
The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.
This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.