Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Finite Otto congruence quotients are cancellative

Abstract

Finite semigroups with an Otto congruence have cancellative quotients.

Definition 1.1 (Otto conjugacy).

Formalization. D5/S3/FiniteGroups/FiniteOttoCongruence.Otto (✓ std3).

Citation. Trevor Jack (2026). Answering Five Open Problems Involving Semigroup Conjugacy. DOI: 10.1007/s00233-026-10614-w. URL: https://arxiv.org/abs/2411.16284.

Commentary.

Jack, Section 2, p. 2: “∀a, b ∈ S (a ∼o b ⇔ ag = gb and bh = ha for some g, h ∈ S).” Otto(a,b) uses two witnesses from S itself; no identity element is adjoined. S is an arbitrary semigroup, with no nonemptiness assumption.

Definition 1.2 (Compatibility with multiplication).

Formalization. D5/S3/FiniteGroups/FiniteOttoCongruence.OttoIsCongruence (✓ std3).

Citation. Trevor Jack (2026). Answering Five Open Problems Involving Semigroup Conjugacy. DOI: 10.1007/s00233-026-10614-w. URL: https://arxiv.org/abs/2411.16284.

Commentary.

Otto conjugacy is an equivalence relation for every semigroup. Its being a congruence means that multiplication respects two pairs of related elements. This is the congruence condition in Jack’s Section 9, Problem 9.4, p. 14.

Definition 1.3 (Cancellation of classes).

Formalization. D5/S3/FiniteGroups/FiniteOttoCongruence.QuotientCancelative (✓ std3).

Citation. Trevor Jack (2026). Answering Five Open Problems Involving Semigroup Conjugacy. DOI: 10.1007/s00233-026-10614-w. URL: https://arxiv.org/abs/2411.16284.

Commentary.

The first conjunct is left cancellation and the second is right cancellation, expressed on representatives. When Otto conjugacy is a congruence, these are exactly the two cancellation laws of the quotient semigroup. The spelling cancelative follows Jack’s Section 9, Problem 9.4, p. 14.

Definition 1.4 (The negative answer to Problem 9.4).

Formalization. D5/S3/FiniteGroups/FiniteOttoCongruence.claim (✓ std3).

Citation. Trevor Jack (2026). Answering Five Open Problems Involving Semigroup Conjugacy. DOI: 10.1007/s00233-026-10614-w. URL: https://arxiv.org/abs/2411.16284.

Commentary.

Jack, Section 9, Problem 9.4, p. 14: “Is there a finite semigroup for which ∼o is a congruence and S/∼o is not cancelative?” The proposition gives the negative answer: for every finite semigroup S, multiplication compatibility of Otto conjugacy implies both cancellation laws on classes. Type denotes the small carrier universe; Finite imposes no chosen enumeration. Empty carriers satisfy the statement vacuously.

Theorem 1.5 (Every finite Otto congruence quotient is cancellative).

Proof. Machine-checked in Lean as D5/S3/FiniteGroups/FiniteOttoCongruence.result (✓ std3). ∎

Resolves. Problems/jack-2024-finite-otto-congruence (proved) by D5/S3/FiniteGroups/FiniteOttoCongruence.result.

Source. Repository-derived.

Acknowledgement. Trevor Jack (2026). Answering Five Open Problems Involving Semigroup Conjugacy. DOI: 10.1007/s00233-026-10614-w. URL: https://arxiv.org/abs/2411.16284.

Commentary.

Every element of a finite semigroup has an idempotent positive power. All idempotents are Otto-conjugate, using the products ef and fe as witnesses. If an idempotent power of a is a to the n, then a is Otto-conjugate to a to the n plus one. Multiplication compatibility therefore makes the common idempotent class a two-sided identity. The preceding positive power supplies an inverse class, proving left cancellation. The relation between ab and ba, witnessed by a and b, transfers this to right cancellation.

References