Papers
Topics
Authors
Recent
Search
2000 character limit reached

Contracting Self-Similar Inverse Semigroups

Updated 10 July 2026
  • Contracting self-similar inverse semigroups are inverse semigroups of partial symmetries whose restrictions stabilize via finite nuclei or semi-nuclei.
  • They extend classical self-similar group theory to partial actions on topological Markov chains and substitution tiling spaces, revealing new dynamical structures.
  • This framework unifies aspects of symbolic dynamics, substitution tilings, and groupoid C*-algebra theory, offering tools for analyzing complexity and simplicity.

Contracting self-similar inverse semigroups are inverse semigroups of partial symmetries for which restrictions along sufficiently long words eventually lie in a finite controlling set, called a nucleus or, in the partial setting, a semi-nucleus. They are formulated most naturally for partial local homeomorphisms on one-sided topological Markov chains and for inverse semigroups of compact open bisections in étale groupoids. The framework extends the classical theory of contracting self-similar groups to genuinely partial actions, and in substitution tiling theory it yields a semigroup-level reconstruction of the Anderson–Putnam complex, the limit solenoid, and the translational hull (Nekrashevych, 5 Sep 2025, Walton et al., 2021).

1. Algebraic and dynamical framework

An inverse semigroup SS is a semigroup in which every element has a unique inverse satisfying the Wagner–Preston axioms: for every s∈Ss\in S there exists a unique s−1∈Ss^{-1}\in S such that

ss−1s=sands−1ss−1=s−1.s s^{-1} s = s \quad\text{and}\quad s^{-1} s s^{-1} = s^{-1}.

Its idempotents form a semilattice

E(S)={e∈S:e2=e},E(S)=\{e\in S:e^2=e\},

and the natural partial order is

s≤t  ⟺  s=te for some e∈E(S),equivalentlys=ss−1t.s\le t \iff s=t e \text{ for some } e\in E(S), \quad\text{equivalently}\quad s=s s^{-1} t.

This order encodes restriction of partial symmetries, while idempotents encode domains and ranges (Nekrashevych, 5 Sep 2025).

A standard self-similar setting starts with a finite alphabet XX, a one-sided topological Markov chain F⊂XωF\subset X^\omega, and the local inverse maps Sx(w)=xwS_x(w)=xw on cylinders. A set AA of local homeomorphisms between clopen subsets of s∈Ss\in S0 is self-similar if for every s∈Ss\in S1 and s∈Ss\in S2,

s∈Ss\in S3

for pairwise distinct s∈Ss\in S4 and s∈Ss\in S5, with the sections s∈Ss\in S6 defined by

s∈Ss\in S7

whenever s∈Ss\in S8 contains s∈Ss\in S9. Equivalently, for all s−1∈Ss^{-1}\in S0 and s−1∈Ss^{-1}\in S1, s−1∈Ss^{-1}\in S2 is either empty or belongs to s−1∈Ss^{-1}\in S3 (Nekrashevych, 5 Sep 2025).

For inverse semigroups acting by partial maps on a topological Markov chain, self-similarity is expressed by a partial restriction rule. If s−1∈Ss^{-1}\in S4 acts on s−1∈Ss^{-1}\in S5 and s−1∈Ss^{-1}\in S6, then for every s−1∈Ss^{-1}\in S7 there exist letters s−1∈Ss^{-1}\in S8 and elements s−1∈Ss^{-1}\in S9 with disjoint domains such that

ss−1s=sands−1ss−1=s−1.s s^{-1} s = s \quad\text{and}\quad s^{-1} s s^{-1} = s^{-1}.0

and for ss−1s=sands−1ss−1=s−1.s s^{-1} s = s \quad\text{and}\quad s^{-1} s s^{-1} = s^{-1}.1,

ss−1s=sands−1ss−1=s−1.s s^{-1} s = s \quad\text{and}\quad s^{-1} s s^{-1} = s^{-1}.2

where ss−1s=sands−1ss−1=s−1.s s^{-1} s = s \quad\text{and}\quad s^{-1} s s^{-1} = s^{-1}.3 is determined by ss−1s=sands−1ss−1=s−1.s s^{-1} s = s \quad\text{and}\quad s^{-1} s s^{-1} = s^{-1}.4. This is the inverse-semigroup analogue of the classical restriction identity ss−1s=sands−1ss−1=s−1.s s^{-1} s = s \quad\text{and}\quad s^{-1} s s^{-1} = s^{-1}.5, but with partial domains and a domain partition rather than a single globally defined restriction (Walton et al., 2021).

2. Contracting behavior, nuclei, and local contraction

In the groupoid-based formulation, contraction is a finite-state property of restrictions. Let ss−1s=sands−1ss−1=s−1.s s^{-1} s = s \quad\text{and}\quad s^{-1} s s^{-1} = s^{-1}.6 be a shift-invariant étale groupoid over a subshift of finite type ss−1s=sands−1ss−1=s−1.s s^{-1} s = s \quad\text{and}\quad s^{-1} s s^{-1} = s^{-1}.7, with shift functor

ss−1s=sands−1ss−1=s−1.s s^{-1} s = s \quad\text{and}\quad s^{-1} s s^{-1} = s^{-1}.8

The following are equivalent: there exists a compact ss−1s=sands−1ss−1=s−1.s s^{-1} s = s \quad\text{and}\quad s^{-1} s s^{-1} = s^{-1}.9 such that every E(S)={e∈S:e2=e},E(S)=\{e\in S:e^2=e\},0 enters E(S)={e∈S:e2=e},E(S)=\{e\in S:e^2=e\},1 under some iterate of E(S)={e∈S:e2=e},E(S)=\{e\in S:e^2=e\},2; there exists a compact open E(S)={e∈S:e2=e},E(S)=\{e\in S:e^2=e\},3 with E(S)={e∈S:e2=e},E(S)=\{e\in S:e^2=e\},4 and the same property; and there exists a finite set E(S)={e∈S:e2=e},E(S)=\{e\in S:e^2=e\},5 of compact open E(S)={e∈S:e2=e},E(S)=\{e\in S:e^2=e\},6-bisections such that for every compact open bisection E(S)={e∈S:e2=e},E(S)=\{e\in S:e^2=e\},7 and all E(S)={e∈S:e2=e},E(S)=\{e\in S:e^2=e\},8, for E(S)={e∈S:e2=e},E(S)=\{e\in S:e^2=e\},9 large enough, the restriction s≤t  ⟺  s=te for some e∈E(S),equivalentlys=ss−1t.s\le t \iff s=t e \text{ for some } e\in E(S), \quad\text{equivalently}\quad s=s s^{-1} t.0 belongs to s≤t  ⟺  s=te for some e∈E(S),equivalentlys=ss−1t.s\le t \iff s=t e \text{ for some } e\in E(S), \quad\text{equivalently}\quad s=s s^{-1} t.1, including the empty map. The unique smallest such set is the nucleus, and it is stable under sections (Nekrashevych, 5 Sep 2025).

For self-similar inverse semigroups acting on a topological Markov chain, the semigroup adaptation is: s≤t  ⟺  s=te for some e∈E(S),equivalentlys=ss−1t.s\le t \iff s=t e \text{ for some } e\in E(S), \quad\text{equivalently}\quad s=s s^{-1} t.2 is contracting if there exists a finite set s≤t  ⟺  s=te for some e∈E(S),equivalentlys=ss−1t.s\le t \iff s=t e \text{ for some } e\in E(S), \quad\text{equivalently}\quad s=s s^{-1} t.3 such that for every s≤t  ⟺  s=te for some e∈E(S),equivalentlys=ss−1t.s\le t \iff s=t e \text{ for some } e\in E(S), \quad\text{equivalently}\quad s=s s^{-1} t.4 there exists s≤t  ⟺  s=te for some e∈E(S),equivalentlys=ss−1t.s\le t \iff s=t e \text{ for some } e\in E(S), \quad\text{equivalently}\quad s=s s^{-1} t.5 with the property that for any word s≤t  ⟺  s=te for some e∈E(S),equivalentlys=ss−1t.s\le t \iff s=t e \text{ for some } e\in E(S), \quad\text{equivalently}\quad s=s s^{-1} t.6 of length s≤t  ⟺  s=te for some e∈E(S),equivalentlys=ss−1t.s\le t \iff s=t e \text{ for some } e\in E(S), \quad\text{equivalently}\quad s=s s^{-1} t.7 and any s≤t  ⟺  s=te for some e∈E(S),equivalentlys=ss−1t.s\le t \iff s=t e \text{ for some } e\in E(S), \quad\text{equivalently}\quad s=s s^{-1} t.8 with s≤t  ⟺  s=te for some e∈E(S),equivalentlys=ss−1t.s\le t \iff s=t e \text{ for some } e\in E(S), \quad\text{equivalently}\quad s=s s^{-1} t.9, there are XX0 and XX1 satisfying

XX2

Equivalently,

XX3

In this partial setting one often works with a finite semi-nucleus XX4, meaning that every element of XX5 restricts in one step to elements of XX6 on appropriate clopen pieces (Walton et al., 2021).

A related but distinct notion is local contractiveness of the standard action on the tight spectrum. For a tree-like inverse semigroup XX7 such that all tight filters are ultrafilters, Boava and Exel proved that local contractiveness is equivalent to the idempotent criterion

XX8

with

XX9

where F⊂XωF\subset X^\omega0 means F⊂XωF\subset X^\omega1 and there exists F⊂XωF\subset X^\omega2 with F⊂XωF\subset X^\omega3. In the self-similar cylinder semilattice over F⊂XωF\subset X^\omega4, this becomes the requirement that on every nonempty cylinder one can find a subcylinder that is mapped strictly inside itself (Boava et al., 2014). This criterion is closer in spirit to contraction in actions, but it addresses local contractiveness of the tight action rather than the finite-state nucleus property.

3. Limit spaces and asymptotic equivalence

The limit-space theory for contracting self-similar inverse semigroups extends the classical limit space of a self-similar group to partial actions. One starts from the left-infinite path space F⊂XωF\subset X^\omega5 of a topological Markov chain. For F⊂XωF\subset X^\omega6 and F⊂XωF\subset X^\omega7 in F⊂XωF\subset X^\omega8, asymptotic equivalence in the semigroup sense is defined by requiring the existence of an infinite tail F⊂XωF\subset X^\omega9 and a finite set Sx(w)=xwS_x(w)=xw0 such that for all Sx(w)=xwS_x(w)=xw1,

Sx(w)=xwS_x(w)=xw2

has initial segment Sx(w)=xwS_x(w)=xw3. In the contracting case, this can be strengthened so that all Sx(w)=xwS_x(w)=xw4 lie in a finite semi-nucleus Sx(w)=xwS_x(w)=xw5, and the right tail can be written uniformly as Sx(w)=xwS_x(w)=xw6 with Sx(w)=xwS_x(w)=xw7 independent of Sx(w)=xwS_x(w)=xw8. The limit space is then

Sx(w)=xwS_x(w)=xw9

where AA0 is the transitive closure of the asymptotic equivalence relation, and the left shift induces a map AA1 (Walton et al., 2021).

The inverse limit

AA2

is the limit solenoid. In the general groupoid-based framework, contracting groupoids arising from hyperbolic systems admit nuclei whose bi-infinite path equivalence classes produce a solenoid with shift dynamics; in the principal case, the contracting groupoid is equivalent to the stable equivalence groupoid of a hyperbolic system (Nekrashevych, 5 Sep 2025). In the substitution-tiling case, this abstract solenoidal construction becomes concrete: AA3 is identified with the Anderson–Putnam complex and AA4 with the translational tiling hull (Walton et al., 2021).

4. Substitution tilings and the canonical inverse-semigroup example

A central family of examples is provided by Kellendonk’s tiling semigroup for a finite local complexity substitution tiling. Fix an FLC, recognisable substitution on a finite prototile set AA5 that forces the border, possibly after collaring. A doubly pointed patch is a triple AA6 consisting of a finite patch AA7 with distinguished tiles AA8, considered up to translation. The set AA9 of all such triples, together with s∈Ss\in S00, becomes an inverse semigroup under

s∈Ss\in S01

when the two pointed patches are compatible and the in/out tiles match after translation, and s∈Ss\in S02 otherwise. The inverse is s∈Ss\in S03, the idempotents are s∈Ss\in S04 and s∈Ss\in S05, and the natural order satisfies

s∈Ss\in S06

as doubly pointed patches with the same in/out tiles. Each s∈Ss\in S07 acts as a partial bijection on the discrete hull s∈Ss\in S08 with domain

s∈Ss\in S09

and range s∈Ss\in S10, and these elements correspond to open bisections in the étale translation groupoid (Walton et al., 2021).

Self-similarity is obtained by passing to the substitution graph s∈Ss\in S11, whose vertices are the prototiles and whose edges are supertile extensions s∈Ss\in S12 with s∈Ss\in S13. The associated topological Markov chain s∈Ss\in S14 consists of right-infinite, left-pointing paths, and there is a canonical homeomorphism s∈Ss\in S15. Under this identification, the partial translations coming from doubly pointed patches satisfy the inverse-semigroup restriction rule described above. For recognisable border-forcing substitutions, the tiling semigroup s∈Ss\in S16 is self-similar. It is also contracting: one may take as a finite semi-nucleus the set of doubly pointed star-patches s∈Ss\in S17, namely patches whose tiles share a common point, with either s∈Ss\in S18 or s∈Ss\in S19 and s∈Ss\in S20 adjacent. The contraction mechanism is geometric: under successive restrictions, the distance s∈Ss\in S21 between the in/out tiles shrinks by at least s∈Ss\in S22 per step, where s∈Ss\in S23 is the inflation scale, and finite local complexity leaves only finitely many configurations below a fixed radius. After enough steps, the restrictions are forced into the finite family of star patches (Walton et al., 2021).

This contracting structure controls the limit space. The map s∈Ss\in S24 is defined by intersecting nested subtile supports determined by successive embeddings; its value is a unique point in the support of the range prototile. The semigroup asymptotic equivalence relation corresponds exactly to the gluing relation in the Anderson–Putnam complex s∈Ss\in S25, and therefore

s∈Ss\in S26

Under this identification, the shift s∈Ss\in S27 on s∈Ss\in S28 coincides with the substitution-induced map on s∈Ss\in S29, and the inverse limit s∈Ss\in S30 is homeomorphic to the translational tiling hull s∈Ss\in S31. In the border-forcing Fibonacci example, collaring produces prototiles s∈Ss\in S32 with substituted images

s∈Ss\in S33

and the generators of the semigroup are doubly pointed patches on single tiles or adjacent two-tile patches. The explicit self-similarity rules close on a finite set after enough restriction steps, and the resulting limit space agrees with the Anderson–Putnam complex for the Fibonacci tiling (Walton et al., 2021).

5. Tight groupoids, Steinberg algebras, and simplicity

The inverse-semigroup viewpoint is inseparable from the groupoid of germs and the tight spectrum. For an inverse semigroup s∈Ss\in S34 of local homeomorphisms of a totally disconnected space s∈Ss\in S35, the groupoid of germs has arrows s∈Ss\in S36, with multiplication

s∈Ss\in S37

and inversion

s∈Ss\in S38

For an abstract inverse semigroup with idempotents s∈Ss\in S39, ultrafilters s∈Ss\in S40 form the tight spectrum, and the tight étale groupoid s∈Ss\in S41 is built from germs s∈Ss\in S42 with s∈Ss\in S43. In the ample case, the ultrafilter space is homeomorphic to the unit space, and the groupoid of germs reconstructs the original étale groupoid from the inverse semigroup of compact open bisections. The corresponding Steinberg algebra s∈Ss\in S44 is the s∈Ss\in S45-linear span of indicators of compact open bisections, with convolution

s∈Ss\in S46

and for complex coefficients one obtains the dense s∈Ss\in S47-algebra underlying the groupoid s∈Ss\in S48-algebras (Nekrashevych, 5 Sep 2025).

Contracting self-similar groupoids have particularly strong structural properties. The nucleus determines a Hausdorff criterion: such a groupoid is Hausdorff if and only if, for some Markov partition of the shift, the associated nucleus consists of pairwise disjoint bisections. Contracting groupoids also have polynomial growth of balls and polynomial complexity of Cayley balls, hence are amenable; if s∈Ss\in S49 is a primitive one-sided SFT and the groupoid is contracting and s∈Ss\in S50-invariant, then it is almost finite. These dynamical finiteness properties feed directly into the analysis of the reduced and full groupoid s∈Ss\in S51-algebras and into the structure of topological full groups (Nekrashevych, 5 Sep 2025).

For self-similar groupoids acting on graph path spaces, the associated inverse semigroup s∈Ss\in S52 is generated by paths, path inverses, groupoid elements, and s∈Ss\in S53, and every nonzero element has a canonical form s∈Ss\in S54. The contracted algebra s∈Ss\in S55 has a tight ideal s∈Ss\in S56, and when s∈Ss\in S57 is congruence-free the singular ideal s∈Ss\in S58 is the unique maximal ideal containing s∈Ss\in S59; thus s∈Ss\in S60 is simple exactly when s∈Ss\in S61. In the contracting case, recurrent subgroups inside the nucleus and synchronized vertices of an associated Schreier graph provide an explicit criterion for deciding simplicity. At the s∈Ss\in S62-level, finite closure of isotropy fibers implies that for the tight groupoid s∈Ss\in S63,

s∈Ss\in S64

This extends to contracting self-similar groupoids the coincidence of Steinberg simplicity and reduced s∈Ss\in S65-simplicity already familiar in several special cases (Aakre, 22 Oct 2025).

A common misconception is that every inverse-semigroup model of self-similarity presently comes with a developed contracting theory. In the finitely aligned self-similar s∈Ss\in S66-graph framework, the 2024 inverse-semigroup approach does not define a contracting property. Instead, it develops conditions such as pseudo-freeness, locally exhausted strongly fixed sets s∈Ss\in S67, s∈Ss\in S68-cofinality, and s∈Ss\in S69-aperiodicity. These govern Hausdorffness of the tight groupoid, minimality, effectiveness, and simplicity of the associated s∈Ss\in S70-algebra. The paper explicitly presents a possible analogue of contraction in terms of the cocycle s∈Ss\in S71, eventual finiteness of restrictions, and a finite set of “nucleus” paths, but it does not undertake that analysis (Larki, 2024).

The currently established substitution-tiling theory also has clear hypotheses and limits. The tiling constructions use finite local complexity, recognisability, and border forcing in an essential way, with collaring invoked when needed to force the border. Primitivity ensures repetitivity and compactness of the hull in the standard substitution setting. The semigroup paper does not claim uniqueness or minimality of the semi-nucleus, and the choice of finite controlling set can depend on adjacency conventions, such as face-sharing versus mere boundary intersection in higher dimensions. The translational case is the one fully developed; extensions to rigid motions are mentioned, but non-FLC tilings, non-border-forcing substitutions, and questions about how contraction interacts with groupoid hyperbolicity or with s∈Ss\in S72-algebra properties such as pure infiniteness are left open (Walton et al., 2021).

Taken together, these developments show that contracting self-similar inverse semigroups occupy a precise intermediate position between inverse-semigroup models of local symmetry and finite-state dynamics on symbolic or tiling structures. Their finite nuclei or semi-nuclei encode the asymptotic stabilization of restrictions; their limit spaces organize geometric identifications such as the Anderson–Putnam complex; and their tight groupoids mediate the passage to Steinberg algebras, s∈Ss\in S73-algebras, and full groups. This suggests a broad unifying role for contraction across symbolic dynamics, substitution tilings, and self-similar groupoid theory, while also making clear that the notion is not yet uniformly developed in all inverse-semigroup models.

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Contracting Self-Similar Inverse Semigroups.