A Latin square is the multiplication table of a quasigroup. That single observation turns a combinatorial object into an algebra and makes the whole apparatus available.
Engineering · Mathematics11 min readKV-MATH-0228
Learning objectives
Define a quasigroup by the unique-solvability condition and equationally.
Explain why the equational definition requires two division operations.
Translate between a Latin square and a quasigroup in both directions.
Distinguish loops from quasigroups and from groups.
State the congruence properties of the variety of quasigroups.
Recognise isotopy as a coarser equivalence than isomorphism.
01Two definitions of a quasigroup
The classical definition: a set with a binary operation such that for all a and b, each of a·x = b and y·a = b has a unique solution. Equivalently, left and right translations are bijections.
CautionThe classical definition does not give a variety
Unique solvability is an existence-and-uniqueness statement, not an identity. A subalgebra of a quasigroup in type (2) — a subset closed under the product alone — need not be a quasigroup, because solutions may escape the subset. So the class is not closed under S and is not a variety in that type.
The repair is to place the two division operations in the type, making them primitive rather than derived. With type (2, 2, 2) the class becomes equationally definable and every general theorem applies.
02The equational definition
Type (2, 2, 2) with ·, \ (left division), / (right division): x \ (x · y) ≈ y x · (x \ y) ≈ y (y · x) / x ≈ y (y / x) · x ≈ y
Four identities. Each division operation is both a left and right inverse to multiplication in the appropriate slot.
Type choice and its consequences
Type
Class
Variety?
Subalgebras
(2)
quasigroups by unique solvability
No
sub-groupoids, may not be quasigroups
(2, 2, 2)
quasigroups equationally
Yes
subquasigroups
(2, 2, 2, 0)
loops
Yes
subloops, all containing the identity
(2, 1, 0)
groups
Yes
subgroups
This is the clearest illustration in the source of the principle stated in the Core stream: the type is part of the data. The same objects, described in two types, give a variety in one case and not the other.
03Latin squares
A Latin square of order n is an n × n array on n symbols in which each symbol occurs exactly once in each row and each column. The multiplication table of a finite quasigroup is a Latin square, and conversely.
ProcedureTranslating between Latin squares and quasigroups
in: Latin square of order n → out: quasigroup of order n, and back
square → quasigroup:
index rows and columns by the symbol set Q
define a · b := the entry in row a, column b
each row is a permutation ⟹ left translations are bijections
each column is a permutation ⟹ right translations are bijections
define a \ b and a / b as the unique solutions
quasigroup → square:
tabulate the operation; the Latin condition is exactly unique solvability
the correspondence is a bijection between Latin squares on Q
and quasigroup operations on Q
Correctness: the Latin row condition is precisely bijectivity of left translations, and likewise for columns. Caveat: the correspondence is with labelled squares — two Latin squares differing by a relabelling give isomorphic quasigroups, so counting squares and counting quasigroups are different problems.
The bijection means every question about Latin squares is a question about quasigroups. Orthogonality of Latin squares, treated on the next page, becomes a statement about a pair of quasigroup operations on the same set.
04Loops and the road to groups
A loop is a quasigroup with a two-sided identity element, placed in the type as a nullary operation. A group is an associative loop.
Quasigroup
Unique solvability only. No identity, no associativity. The Latin square is arbitrary.
Loop
Add an identity element. The Latin square has a row and column matching the border in order.
Moufang loop, Bol loop and friends
Add weakened associativity laws. Each is equational, so each is a variety, and they form a hierarchy between loops and groups.
Group
Full associativity. The Latin square is a Cayley table, and the whole of group theory becomes available.
Key resultAssociativity is the expensive axiom
Everything below associativity — quasigroups, loops, Moufang loops — is combinatorially abundant, with the number of objects growing very fast in the order. Groups are comparatively rare. Associativity is what collapses the combinatorial explosion, which is why Latin squares are a much larger world than Cayley tables.
05Congruence properties
Quasigroups are congruence-permutable, which is what makes their quotient theory behave like that of groups.
Mal'cev term for quasigroups: p(x, y, z) = (x / (y \ y)) · (y \ z)
Constructed from the two divisions. Verifying p(x,y,y) ≈ x and p(x,x,y) ≈ y is a direct computation with the four defining identities.
Quasigroups in the classification
Property
Holds?
Consequence
Congruence-permutable
Yes
Joins of congruences are single composites.
Congruence-modular
Yes
Commutator theory available.
Congruence-distributive
No
Jónsson's lemma unavailable.
Congruence extension property
Yes
Congruences on subquasigroups extend.
Locally finite
No
Free quasigroups on finitely many generators are infinite.
Permutability means normal subloops do coordinatise congruences in the loop case, recovering something close to the group picture. For quasigroups proper, without an identity, the congruence itself remains the object of study.
06Isotopy: a coarser equivalence
Two quasigroups are isotopic when one can be obtained from the other by relabelling rows, columns and symbols independently. Isotopy is strictly coarser than isomorphism, and it is the natural equivalence for Latin squares.
Isomorphism
One relabelling
A single bijection applied to arguments and values alike. The algebraic notion, preserved by all the universal-algebraic machinery.
Isotopy
Three independent relabellings
Separate bijections for rows, columns and symbols. The combinatorial notion. Every quasigroup is isotopic to a loop, so isotopy classes are coarser than isomorphism classes.
CautionUniversal algebra does not see isotopy
Isotopy is not preserved by the class operators and has no equational characterisation. Results proved algebraically hold up to isomorphism, not up to isotopy, and combinatorial literature counting Latin squares up to isotopy is answering a different question from algebraic literature counting quasigroups up to isomorphism. Compare figures only after checking which equivalence is in use.
Frequently asked
Why does every quasigroup have an isotopic loop?
Pick any element and use its left and right translations to relabel rows and columns. The chosen element becomes an identity in the relabelled table. This principal isotopy construction shows loops are isotopy-representatives of quasigroups, which is why loop theory carries most of the structural content.
Are the four quasigroup identities independent?
Yes — each of the four is needed. Dropping one gives a strictly larger class. This contrasts with the lattice axioms, where idempotency is derivable from the others, and is worth checking rather than assuming when comparing axiom lists across texts.
How many Latin squares are there of a given order?
The counts grow extremely fast and are known only for small orders, having been extended by successive computer searches. They are catalogue data: consult a current combinatorics handbook or the relevant online sequence rather than a printed table, and check whether the figure counts labelled squares, reduced squares, isotopy classes or main classes — the four differ by large factors.
Sources and further reading
S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, Millennium Edition (a corrected re-typesetting of Springer GTM 78, 1981).
G. Grätzer, Universal Algebra, 2nd edition, Springer.
R. McKenzie, G. McNulty and W. Taylor, Algebras, Lattices, Varieties, Volume I.
Original KEVOS® explanatory article. Written from the topic map of the cited works; no text is reproduced from them.
Handbook application: from concept to controlled practice
Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Quasigroups, Loops and Latin Squares. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.
The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.
Treat Quasigroups, Loops and Latin Squares as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—latin, quasigroups, loops, squares, congruence—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.
For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.
A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.
Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.
Step-by-step operating method
Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.
Worked-example protocol
Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.
Stage
Record
Quality check
Input
Objects, domain, notation, assumptions
Every symbol is defined
Method
Permitted operation or cited result at each step
All hypotheses hold
Output
Exact result and representation
Correct type, domain and form
Verification
Substitution, invariant or alternative derivation
Independent agreement
Boundary test
Zero, identity, degenerate or failed hypothesis
Scope is understood
Common failure modes and recovery actions
1. Watch for
Using a theorem without checking every hypothesis.
Recovery: Return to the governing definition or requirement and restate the decision in one sentence.
2. Watch for
Treating a suggestive example as a proof of the general case.
Recovery: Separate evidence from assumption, assign an owner and set a date for validation.
3. Watch for
Changing notation or conventions part-way through an argument.
Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.
4. Watch for
Hiding a division-by-zero, convergence, finiteness or commutativity assumption.
Recovery: Record the consequence, decision and rationale, then update the controlled baseline.
5. Watch for
Reporting a computed result without a residual, substitution or structural check.
Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.
Review checklist
Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?
Questions for deeper application
What is the most important distinction a practitioner must preserve when applying Quasigroups, Loops and Latin Squares?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which assumption about latin would change the result most if it proved false?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What evidence would allow an independent reviewer to reproduce or challenge the conclusion?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which boundary, exception or failure case has not yet been tested?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What must be handed over, monitored or reviewed after the immediate work is complete?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Authoritative references and use notes
The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.
MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.
The Stacks Project — table of contents — The Stacks Project. Used for commutative algebra, homological algebra, modules and derived categories. Accessed 2026-08-13.
