Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 189 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 35 tok/s Pro
GPT-5 High 40 tok/s Pro
GPT-4o 103 tok/s Pro
Kimi K2 207 tok/s Pro
GPT OSS 120B 451 tok/s Pro
Claude Sonnet 4.5 38 tok/s Pro
2000 character limit reached

Boolean Restriction Semigroups

Updated 10 November 2025
  • Boolean restriction semigroups are algebraic structures that generalize inverse semigroups and Boolean algebras by encapsulating one-sided partial symmetries through a domain operation.
  • They feature a generalized Boolean algebra of projections and support finite joins of compatible elements, ensuring that multiplication distributes over these joins.
  • Their study links algebra to topology via categorical dualities, providing insights into ample étale categories, noncommutative Stone duality, and operator algebras.

A Boolean restriction semigroup is an algebraic structure that generalizes both inverse semigroups and Boolean algebras, encapsulating the one-sided logic of partial symmetries. Formally, a Boolean restriction semigroup is a restriction semigroup (S,,)(S,\cdot,{}^*) in which the set of projections P(S)={eS:e=e}P(S)=\{e\in S:e^*=e\} forms a generalized Boolean algebra, and which admits finite joins of compatible elements distributing over multiplication. Such semigroups arise as the algebraic counterparts to ample topological categories (étale categories), and have deep connections to noncommutative Stone duality, groupoid theory, and operator algebras.

1. Axiomatic and Structural Foundations

A restriction semigroup (S,,)(S,\cdot,{}^*) is a semigroup equipped with a unary operation (domain operation) ss^* satisfying for all x,ySx,y\in S:

xx  =  x,(R1) xy  =  (yx),(R2) (xy)  =  (xy),(R3) xy  =  y(xy).(R4)\begin{aligned} &x\,x^* \;=\; x, &&(R1)\ &x^*\,y^* \;=\; (y\,x)^*, &&(R2)\ &(x\,y)^* \;=\; (x^*\,y)^*, &&(R3)\ &x^*\,y \;=\; y\,(x\,y)^*. &&(R4) \end{aligned}

The projections P(S)P(S) under multiplication form a commutative semilattice. The natural partial order is st    s=ts    s=ets\le t \iff s=t\,s^*\iff s=e t for some eP(S)e\in P(S). Compatibility of s,tSs,t\in S is defined as st=tss\,t^* = t\,s^*; such elements admit joins sts\vee t.

A Boolean restriction semigroup additionally satisfies:

  • (BR1): If sts\sim t, then sts\vee t exists in SS.
  • (BR2): P(S)P(S) is a generalized Boolean algebra (distributive, complemented, with $0$).
  • (BR3): Multiplication distributes over joins of compatible pairs: (st)u=sutu(s\vee t)u = su \vee tu for all uSu\in S.

If the semigroup is also a monoid and all elements are generated under compatible joins from partial units, the structure is called étale Boolean restriction monoid, which is categorically equivalent to the class of Boolean inverse monoids (Lawson, 12 Apr 2024).

2. Examples and Constructions

2.1 Partial Maps

The semigroup PT(X)\mathrm{PT}(X) of all partial self-maps of a set XX, with f=iddom(f)f^*=\operatorname{id}_{\operatorname{dom}(f)}, forms a Boolean restriction monoid. The projections are identity maps on subsets of XX, yielding a Boolean algebra. Compatible partial maps (agreeing on domain overlap) have their join as union.

2.2 Inverse and Binary-Relation Cases

If SS is an inverse semigroup, s=s1ss^*=s^{-1}s provides the Boolean restriction structure, and all further Boolean structure is classical. In the semigroup of binary relations B(X)\mathcal B(X), one defines operations rr^* and r+r^+, but B(X)\mathcal B(X) is only a restriction semigroup for X1|X|\le1.

2.3 Thompson and Cuntz Monoids

Given the polycyclic inverse monoid PnP_n and its Boolean completion Cn=PnC_n=P_n^\vee (the Cuntz inverse monoid), one constructs Hn=Etale(Cn)H_n=\mathsf{Etale}(C_n) as the étale Boolean right-restriction monoid companion to CnC_n. The group of units of HnH_n recovers Thompson's group Gn,1G_{n,1} (Lawson, 12 Apr 2024).

3. Universal and Categorical Correspondences

3.1 Universal Étale Category

Every restriction semigroup SS with local units has an associated universal étale category C(S)\mathscr{C}(S), the category of germs of the spectral action on the character space of P(S)P(S). Concretely, with X=P(S)^X=\widehat{P(S)} the spectrum (set of nonzero semilattice homomorphisms), the spectral action is defined by partial homeomorphisms βs ⁣:DsDss\beta_s\colon D_{s^*}\to D_{s^*s^*}, and the arrows are germs [s,φ][s,\varphi] for φDs\varphi\in D_{s^*}.

The set of compact slices C(S)aC(S)^{a} forms a Boolean restriction semigroup, and SS embeds into C(S)aC(S)^a via s(s,Ds)s\mapsto (s,D_{s^*}) (Kudryavtseva, 5 Nov 2025).

3.2 Equivalences of Categories

A central result is the equivalence:

{Boolean restriction semigroups}{ample categories}\left\{ \text{Boolean restriction semigroups} \right\} \simeq \left\{ \text{ample categories} \right\}

where slices in the category correspond to elements of the semigroup, and conversely, from a preBoolean restriction semigroup with local units, one constructs its germ category, forming an ample category with structure matching the semigroup (Kudryavtseva, 29 Oct 2024).

This equivalence extends to:

  • Boolean range semigroups \simeq strongly ample categories (open range map),
  • Étale Boolean range semigroups \simeq biample (two-sided étale) categories,
  • Boolean birestriction semigroups \simeq biample categories,
  • Boolean inverse semigroups \simeq ample groupoids.

4. Boolean Restriction Semigroups and Inverse Theory

Boolean restriction semigroups generalize the theory of inverse semigroups, providing a precise algebraic framework for partial symmetries beyond the invertible case. The connection is made via the submonoid of partial units:

Inv(S)={aSb:  ba=a, ab=b}\mathsf{Inv}(S) = \{\, a\in S \mid \exists b:\; b\,a=a^*,\ a\,b=b^*\,\}

This set is an inverse submonoid with the same idempotent structure as SS. Étale Boolean right-restriction monoids are generated by finite (left-)compatible joins of their partial units, and there is a categorical equivalence:

EtaleRestBoolInv\mathbf{EtaleRest} \simeq \mathbf{BoolInv}

where the functor SInv(S)S \mapsto \mathsf{Inv}(S) is an equivalence of categories (Lawson, 12 Apr 2024).

5. Topological, Algebraic, and Duality Aspects

The core of the theory relates Boolean restriction semigroups to ample topological categories (étale categories), where slices correspond to elements, and arrows correspond to partial symmetries in the operator-theoretic or dynamical picture. The convolution algebras of compact slices generalize Steinberg algebras:

(χUχV)(x)=yz=xχU(y)χV(z)=χUV(x)(\chi_{U}*\chi_{V})(x) = \sum_{y z = x} \chi_U(y)\chi_V(z) = \chi_{U\cdot V}(x)

with an induced isomorphism K[S]KC(S)K[S] \cong K C(S) for any commutative ring KK (Kudryavtseva, 5 Nov 2025).

Noncommutative Stone duality provides the topological content: étale Boolean right-restriction monoids are dual to étale groupoids with Stone spaces of identities. Under this duality, partial units correspond to compact-open bisections, and general elements to compact-open local right-bisections.

Determining when a Boolean restriction semigroup admits a cosupport (+^+) so as to be a Boolean range semigroup is characterized by openness of the range map in the germ category; uniqueness is established by algebraic axiomatization (Kudryavtseva, 29 Oct 2024).

6. Examples and Applications

Construction Boolean Restriction Semigroup (BRS) Example Companion Structures
Partial maps on set XX PT(X)\mathrm{PT}(X) I(X)\mathsf{I}(X) (inverse)
Clopen homeomorphisms of XX S(X)\mathsf{S}(X) (local homeos) Icp(X)\mathsf{I}^{cp}(X)
Polycyclic/Cuntz/Thompson Hn=Etale(Cn)H_n=\mathsf{Etale}(C_n) CnC_n, Gn,1G_{n,1}

Concrete operator-algebraic and dynamical applications arise via the paper of the convolution algebras of the associated germ categories, extending the actions considered in groupoid C*-algebras and Steinberg algebras. The Boolean restriction structure permits the modeling of systems with partial symmetries that are not involutive, as in certain non-self-adjoint operator algebras.

7. Synthesis and Theoretical Significance

A Boolean restriction semigroup $(S,\,^*,\cdot)$ is a natural one-sided generalization and completion of Boolean inverse monoids, with algebraic structure precisely reflecting the partial logic of locally defined transformations and Boolean logic on the projections. All such semigroups arise from — and are equivalent to — ample topological categories, providing a powerful algebraic-topological duality which subsumes and broadens the scope of inverse semigroup/groupoid duality. This framework organizes the algebraic logic of partial maps, symmetries, and Boolean data, and interfaces directly with the structure of zero-dimensional spaces, operator algebras, and the categorical geometry of groupoids (Kudryavtseva, 5 Nov 2025, Lawson, 12 Apr 2024, Kudryavtseva, 29 Oct 2024).

Forward Email Streamline Icon: https://streamlinehq.com

Follow Topic

Get notified by email when new papers are published related to Boolean Restriction Semigroup.