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.

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.

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.

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.

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.

Relationships to Other Abstractions

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

• Catholic Semigroup → Semigroup → Set and Membership

Show alternative paths (3)

Neighborhood in Abstraction Space

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

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

• Orthodox Semigroup — 0.86
• Symmetric inverse semigroup — 0.81
• Symmetric group — 0.78
• Bicyclic semigroup — 0.77
• Biordered set — 0.77

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