KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesSquags and SloopsEngineering · Engineering MathematicsLesson 18/883← PrevNext →
GuidePublished 12 Aug 2026Updated 13 Aug 20267 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AISquags and Sloops

KEVOS knowledge first · trusted web sources when needed

Selected Topics and Applications

Squags and Sloops

The two varieties of algebras associated with Steiner triple systems — one idempotent, one with a distinguished element — and the relationship between them.

Category Engineering / MathematicsSource III.1Pages 111-113Reading 2 minReviewed 2026-08-07

Learning objectives

  • Define squags and sloops by their identities
  • Describe the correspondence between the two varieties
  • Explain why the choice of type matters
On this page
  1. The two varieties
  2. The correspondence
  3. Congruences and simplicity
  4. The type-choice lesson again

The two varieties

Definition — Squag (Steiner quasigroup)

An algebra ⟨S, ·⟩ of type ⟨2⟩ satisfying idempotence x·x ≈ x, commutativity, and the Steiner law x·(x·y) ≈ y.

Definition — Sloop (Steiner loop)

An algebra ⟨S, ·, 1⟩ of type ⟨2, 0⟩ satisfying commutativity, x·1 ≈ x, x·x ≈ 1, and x·(x·y) ≈ y.

The two varieties compared
SquagSloop
Type⟨2⟩⟨2, 0⟩
x · xx1
Order of the algebra≡ 1 or 3 (mod 6)≡ 2 or 4 (mod 6)
Corresponds toSteiner triple system on n pointsSteiner triple system on n − 1 points, plus the identity
IdempotentYesNo

The correspondence

The two varieties encode the same combinatorial data with different conventions.

Squag on <em>n</em> pointsCorresponds to an STS on n points
Adjoin a new element 1Define x·x = 1 and x·1 = x
ResultA sloop on n + 1 points
ReverseDelete 1 from a sloop to recover the squag
Why keep both

The sloop presentation has an identity element, which makes it a genuine loop and connects to group theory. The squag presentation is idempotent, which makes every element a one-element subalgebra and simplifies the subalgebra lattice. Different questions are easier in different presentations.

Congruences and simplicity

The two varieties have different congruence behaviour, which is the main practical consequence of the type difference.

  • In a sloop, congruences are determined by the class of the identity element 1, since sloops are congruence-permutable loops. The situation resembles group theory.
  • In a squag, there is no distinguished element and congruences carry more information. Every element is a subalgebra, so Sub(A) has all singletons as atoms.
  • Both varieties are congruence-permutable, since both are quasigroup-like and admit Mal'cev terms.
Simple Steiner systems

Many Steiner triple systems give simple algebras, meaning they admit no non-trivial quotient system. The projective and affine systems — the Fano plane among them — are the classical examples of systems with rich subsystem structure but few congruences.

The type-choice lesson again

Squags and sloops repeat a pattern already seen with groups, monoids and quasigroups: the same underlying mathematics admits several types, and the choice determines what the algebraic machinery sees.

Type choices and their consequences
ChoiceConsequence
Include a constant (sloop)Subalgebras must contain it; congruences reduce to one class
Omit the constant (squag)Singletons are subalgebras; congruence structure is richer
Include division operationsThe class becomes a variety rather than a quasivariety

None of these choices is more correct than another. What matters is stating which one is in force, since theorems about subalgebras and congruences are sensitive to it.

Frequently asked questions

Are squags associative?

No, and they cannot be. An associative idempotent commutative quasigroup would be trivial. Non-associativity is essential to the Steiner structure.

Which variety do combinatorialists prefer?

Usually neither explicitly — they work with the systems directly. The algebraic presentations are the tool that lets universal-algebraic methods be applied, which is the point of Chapter III.

Related pages

  • Steiner Triple Systems as Algebras
  • Quasigroups, Loops and Latin Squares

Source. S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, The Millennium Edition — a corrected re-typesetting of Springer-Verlag Graduate Texts in Mathematics 78 (1981). Section III.1, book pages 111-113.

This page is an original exposition prepared for the KEVOS® knowledge library. It restates and reorganises mathematical results; it is not a reproduction of the source text.

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 Squags and Sloops. 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 Squags and Sloops as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—varieties, squags, sloops, algebras, associated—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

  1. Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
  2. Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
  3. Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
  4. Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
  5. 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.

StageRecordQuality check
InputObjects, domain, notation, assumptionsEvery symbol is defined
MethodPermitted operation or cited result at each stepAll hypotheses hold
OutputExact result and representationCorrect type, domain and form
VerificationSubstitution, invariant or alternative derivationIndependent agreement
Boundary testZero, identity, degenerate or failed hypothesisScope 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 Squags and Sloops?

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 varieties 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.

Continue learning

Numbers, Fractions, and DecimalsGuide · Engineering MathematicsThe 12 PrinciplesGuide · Engineering MathematicsReading Paths: the Short Course and the Research TrackGuide · Engineering MathematicsPartial Orders, Posets and BoundsGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®