KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesRelations, Functions and Ordinals: a Working ReferenceEngineering · Engineering MathematicsLesson 44/883← PrevNext →
GuidePublished 12 Aug 2026Updated 13 Aug 20268 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AIRelations, Functions and Ordinals: a Working Reference

KEVOS knowledge first · trusted web sources when needed

Orientation

Relations, Functions and Ordinals: a Working Reference

A working reference for the relational and functional apparatus the subject assumes: n-ary relations, inverses, relational product, injections and surjections, and the ordinal notation used in transfinite constructions.

Category Engineering / MathematicsSource PreliminariesPages 1-4Reading 3 minReviewed 2026-08-07

Learning objectives

  • Compute relational products and inverses
  • Use the relational product to state congruence permutability
  • Apply ordinal indexing in transfinite generation arguments
On this page
  1. Relations
  2. Functions
  3. Kernels — the bridge to congruences
  4. Ordinals and transfinite indexing

Relations

Definition — n-ary relation

An n-ary relation on a set A is a subset of An. When n = 2 it is called a binary relation on A.

Two derived operations on binary relations are used constantly:

  • Inverse. The inverse rˇ of a binary relation r on A is defined by ⟨a, b⟩ ∈ rˇ if and only if ⟨b, a⟩ ∈ r.
  • Relational product. The product r ∘ s holds of ⟨a, b⟩ exactly when there is some c with ⟨a, c⟩ ∈ r and ⟨c, b⟩ ∈ s.
Why the relational product earns its own notation

Congruence permutability — the condition θ ∘ φ = φ ∘ θ for all congruences — is one of the most consequential properties an algebra can have, and it is stated purely in terms of this operation. Groups and rings are congruence-permutable; lattices are not.

Functions

A function f from A to B, written f: A → B, is a subset of A × B such that each a ∈ A pairs with exactly one b ∈ B.

Function properties
PropertyConditionNotation used
Injectivef(a1) = f(a2) implies a1 = a2one-to-one
Surjectivefor every b there is a with f(a) = bonto
Bijectiveboth of the aboveone-to-one and onto
Image of a setα(A) — the direct imageα(A)
Preimageα−1(A) — the inverse imageα−1(A)
Composition order

The source composes functions in the order that makes the relational product natural. When reading proofs that mix function composition with relational products, check the order rather than assuming it.

Kernels — the bridge to congruences

Definition — Kernel of a function

For f: A → B, the kernel ker(f) is the binary relation on A holding of ⟨a1, a2⟩ exactly when f(a1) = f(a2).

The kernel of any function is an equivalence relation. The central observation of the subject — and the content of the first isomorphism theorem — is that the kernel of a homomorphism is not merely an equivalence relation but a congruence, and that every congruence arises this way.

Ordinals and transfinite indexing

Ordinals appear in one recurring pattern: generating a subuniverse or a congruence by iterating a closure step until nothing new appears.

Stage 0Start with the generating set X
Stage α+1Apply all basic operations to what is already present
Limit λTake the union of all earlier stages
TerminationFor finitary operations the process closes at stage ω
Finitary operations close at ω

Because every basic operation takes finitely many arguments, any element produced at a stage beyond ω already had all its arguments present at some finite stage. This is exactly why Sub(A) and Con(A) are algebraic lattices, and it is the single most-used consequence of finitary arity in the whole subject.

Frequently asked questions

Why insist that operations be finitary?

Because finitary arity is what makes the generation process close at stage ω, which in turn makes Sub(A) and Con(A) algebraic lattices. Infinitary algebras exist and are studied, but they lose this property and with it much of the structure theory.

Is the relational product associative?

Yes, for binary relations on a set. It is not commutative in general — and the question of when it commutes for congruences is precisely the permutability condition that Mal'cev conditions characterise.

Related pages

  • Set-Theoretic Preliminaries
  • Notation and Conventions
  • Congruences and the Substitution Property

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 Preliminaries, book pages 1-4.

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 Relations, Functions and Ordinals: a Working Reference. 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 Relations, Functions and Ordinals: a Working Reference as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—relations, functions, ordinals, working, reference—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 Relations, Functions and Ordinals: a Working Reference?

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

  • NIST Digital Library of Mathematical Functions — National Institute of Standards and Technology. Used for mathematical notation, numerical methods, asymptotics and special functions. Accessed 2026-08-13.
  • MIT OpenCourseWare — Number Theory I — Massachusetts Institute of Technology. Used for algebraic and analytic number theory. Accessed 2026-08-13.

Continue learning

NEXT LESSON →Sublattices and Lattice IsomorphismGuide · Engineering MathematicsSubalgebras and Algebra IsomorphismGuide · Engineering MathematicsClass Operators H, S, P and their CompositionGuide · Engineering MathematicsThe Refutation of Euler's ConjectureGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®