A set equipped with a binary operation such that for any two elements a and b there exist unique x and y satisfying a * x = b and y * a = b. Equivalently, the multiplication table is a Latin square; no identity element is required.

Principle

Divisibility and uniqueness govern the structure: left and right division by any element are always solvable and yield unique solutions, giving a cancellative-like behavior without assuming associativity or identity.

Demonstration

Finite quasigroups appear as Latin squares: take a 3×3 Latin square and interpret rows and columns as left and right factors to obtain a quasigroup operation with unique solvability of a * x = b and y * a = b.

Misapplication

Assuming associativity or existence of a neutral element when only unique solvability is guaranteed; treating every quasigroup as a group leads to invalid conclusions about products or powers.

Consequence

Correct identification leads to combinatorial constructions (Latin squares), loops when an identity is adjoined, and algebraic systems where solving equations a * x = b is always possible and unique.

Reversal

Dropping uniqueness of division yields magmas or groupoids (in the universal algebra sense) where equations may have multiple or no solutions; imposing associativity and an identity collapses the concept to groups.

Boundary

Applies to binary operations on sets satisfying the two-sided Latin property; excludes semigroups, monoids, groups (which add extra structure), and partial operations that do not give unique global solutions.

Semantic Tension

Tension between 'quasigroup' and 'group': both permit division, but a group also enforces associativity and identity; a quasigroup keeps solvability while relaxing those constraints.

Synthesis

A quasigroup is a nonassociative algebraic structure determined by the requirement that left and right division always have unique solutions; it sits between a bare magma and a group, central to combinatorial designs.