Skip to content

Catholic Semigroup

A semigroup whose inverse-set map separates elements: no two distinct elements have exactly the same set of semigroup inverses.

Version
v3 · 2026-09-06 · History
Domain-specific #
1441
Origin domain
mathematics
Subdomain
semigroup theory
Aliases
Catholic semigroup in semigroup theory

Core Idea

For an element (a) of a semigroup (S), define its set of semigroup inverses by

\[ V(a)=\{x\in S:axa=a\text{ and }xax=x\}. \]

A catholic semigroup is one in which the map \(a\mapsto V(a)\) separates elements: (V(a)=V(b)) implies (a=b). Equivalently, distinct elements never have precisely the same inverse set.[1]

This is a distinguishability condition, not the demand that each element have a unique inverse. Empty inverse sets count as equal, so at most one element can be nonregular. The class therefore sharply connects inverse behavior, regularity, and faithful internal action.

The recognition invariant is associative multiplication + semigroup inverse sets + injectivity of the inverse-set assignment.

Structural Signature

  • A set with one associative binary operation.
  • Semigroup inverse equations (axa=a) and (xax=x).
  • An inverse set (V(a)) for every element.
  • Equality of inverse sets permitted only for equal elements.
  • At most one element with an empty inverse set.
  • Regular catholic semigroups as the central case.
  • Left and right reductivity in the regular case.
  • Faithful representations by inner translations.
  • Partial-transformation semigroups as examples.
  • Full transformation semigroups generally as counterexamples.
  • Interaction with orthodox and inverse semigroups.

What It Is Not

“Catholic” is a historical technical label and carries no religious or universal-scope claim. Catholicity is not regularity: the definition allows at most one nonregular element. It is not orthodoxy, which asks that the idempotents of a regular semigroup form a subsemigroup.[2]

It is also not the inverse-semigroup condition. An inverse semigroup gives each element one inverse; a catholic semigroup only requires different elements to have different inverse sets.

Scope of Application

The identity belongs to structural semigroup theory, especially regular semigroups, transformation representations, inverse relations, and reductivity. Schein introduced the class to study how much of an element is recoverable from its inverse behavior.[1]

Its most useful role is discriminating nearby classes: regular catholic plus orthodox is equivalent to inverse-semigroup structure, while catholicity and orthodoxy separately encode different restrictions.[3]

Clarity

Define the inverse equations and (V(a)) before using the name. State whether the semigroup is assumed regular. Distinguish “has an inverse” from “has a unique inverse,” and distinguish equality of inverse sets from intersection of inverse sets.

Manages Complexity

The inverse-set map compresses a collection of algebraic equations into a signature for each element. Catholicity certifies that this signature is identifying. This lets inverse behavior support faithful representation and class comparison without adding identity elements or group axioms.

Abstract Reasoning

  1. Verify closure and associativity.
  2. Compute or characterize (V(a)) for each element class.
  3. Check whether two distinct elements share the same inverse set.
  4. Note that two nonregular elements would both have empty inverse sets.
  5. If regularity holds, test left and right reductivity.
  6. Compare idempotent closure to determine orthodoxy separately.
  7. Use the joint catholic-and-orthodox condition only under regularity.
  8. Analyze embeddings or transformation representations when direct enumeration is impractical.

Knowledge Transfer

The portable pattern is identify an object by the complete set of partners that satisfy a reciprocal constraint. It transfers to relational signatures, neighborhood separation, observability, and extensional identification. The proposed immediate parent is Semigroup.

Examples

Partial transformations. The semigroup of all partial transformations on a set is catholic, giving an embedding environment for arbitrary semigroups.[1]

Full transformations. The full transformation semigroup on a nonsingleton set is not catholic; distinct transformations can fail inverse-set separation.

Inverse semigroup. Unique inverse assignment automatically separates elements and satisfies the regular catholic–orthodox conjunction.[4]

Structural Tensions

  • Existence of inverses versus distinguishability by inverse sets.
  • Multiple inverses versus unique identity recovery.
  • Catholicity versus orthodoxy.
  • Abstract multiplication versus transformation representation.
  • Local reciprocal equations versus global reductivity.
  • Rare terminology versus precise class boundary.

Structural–Framed Character

Signature injectivity, reciprocal compatibility, distinguishability, and faithful action are structural. Associative multiplication, semigroup inverses, idempotents, and transformations provide the constitutive algebraic frame.

Structural Core vs. Domain Accent

The portable core is extensional identification by partner sets. The domain accent is identification of semigroup elements by all solutions to the two inverse equations.

Semigroup is the proposed immediate parent. Inversion, Equivalence, Identifiability, Faithful Representation, and Embedding are related. Orthodox Semigroup is a nearby but non-covering accepted identity.

The prospective queue contains one strict edge to prime:semigroup. No live DAG mutation is authorized.

Relationships to Other Abstractions

Local relationship map for Catholic SemigroupParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Catholic SemigroupDOMAINPrime abstraction: Semigroup — is a kind ofSemigroupPRIME

Current abstraction Catholic Semigroup Domain-specific

Parents (1) — more general patterns this builds on

  • Catholic Semigroup is a kind of Semigroup Prime

    Semigroup is the proposed immediate parent.

Hierarchy paths (4) — routes to 4 parentless roots

Neighborhood in Abstraction Space

Catholic Semigroup sits in a sparse region of the domain-specific corpus (90th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08

Not to Be Confused With

  • Orthodox semigroup.
  • Regular semigroup.
  • Inverse semigroup.
  • Group.
  • Unique inverse property without associativity.
  • A religious classification.

References

[1] Boris M. Schein, “Catholic Semigroups,” Proceedings of the Conference on Semigroups in Honor of Alfred H. Clifford (Tulane University, 1979), 207–214, MR 81f:20086. registry ↩a ↩b ↩c

[2] John M. Howie, Fundamentals of Semigroup Theory (Oxford University Press, 1995), chapters on regular and inverse semigroups. registry ↩

[3] Mario Petrich, Inverse Semigroups (Wiley, 1984), structural treatment of regular, orthodox, and inverse semigroups. registry ↩

[4] A. H. Clifford and G. B. Preston, The Algebraic Theory of Semigroups, Volume I (American Mathematical Society, 1961), chapters on regular semigroups and inverses. registry ↩