Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.20255

Canonical resolved-transport decomposition and reconstruction of local-unit-aligned ordered semigroups

Sándor Jenei
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper develops a canonical decomposition and reconstruction theory for local-unit-aligned ordered semigroups. Two coherentizations of the positive-idempotent skeleton are introduced. The finer one records the closure forced within local-unit blocks, while the multiplication-coherent quotient yields a join-semilattice of canonical blocks. Components are the fibers of these blocks. For comparable blocks $A\le B$, each positive idempotent $q\in B$ defines a transport homomorphism $x\mapsto xq$ from the component over $A$ to that over $B$. Keeping all such maps gives a resolved-transport family, which replaces the single connecting map used in an ordinary direct system. These canonical data reconstruct multiplication without additional assumptions: two elements are transported to their join component, and their product is the least product of corresponding transported images. They also determine every comparison directed from a lower component to a higher one. The full ambient order is recovered under any of three explicit order-recovery conditions. In particular, every totally ordered local-unit-aligned semigroup is completely reconstructed by its resolved-transport data. A complementary result recovers the order from componentwise order duality when a suitable component-preserving anti-automorphism is available. When each component receiving a proper transition has a least positive idempotent, the resolved family collapses to a single least-target map. Under a natural monotonicity condition, these maps form an ordinary direct system and induce a directed lexicographic order. Examples show both why the additional order conditions are needed and why resolved transports cannot in general be replaced by ordinary transition maps.

Explore related subjects

math.GRmath.RA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sándor Jenei. 2026-07-28. Canonical resolved-transport decomposition and reconstruction of local-unit-aligned ordered semigroups. https://arxiv.org/abs/2609.20255

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Hyperfiniteness of boundary actions via tree decompositions

We study conditions for a countable group acting on a connected locally finite hyperbolic graph to induce a hyperfinite orbit equivalence relation on the Gromov boundary of the graph in terms of tree-decompositions of the graph. We prove that for a connected locally finite hyperbolic graph $X$ equipped with an action of a countable group $G$, if $(T, β)$ is a $G$-invariant tree-decomposition of $X$ such that each bag induces a connected subgraph $X_t$ of $X$ for each $t \in V(T)$, each adhesion set is finite and such that there are only finitely many $G$-orbits of edges of $T$, then the orbit equivalence relation of $G$ acting on the Gromov boundary $\partial X$ is hyperfinite provided the orbit equivalence relation of $G$ acting on $\partial T$ is hyperfinite and the orbit equivalence relations of the bag stabilizers acting on $\partial X_t$ are all hyperfinite. We show that the converse also holds if $(T, β)$ satisfies the additional property that each adhesion set distinguishes at least two ends of $X$.

math.GR↗
arXiv2026

Compatible additions on a six-element commutative semigroup: equational bases and subvariety lattices

Let $M$ be the six-element commutative semigroup occurring as the common multiplicative reduct of the semirings $SR_6$ and $TR_6$. The closing paragraph of Shao, Ren, and Gao~\cite{ShaoRenGao2026} asks for the finite-basis and subvariety questions for the four remaining compatible additions on $M$. We answer these questions for the four isomorphism types $R_{01},R_{02},R_{11},R_{12}$. First, we classify all compatible additions on $M$: there are nine labelled additions and six isomorphism types, parametrized by $R_{ij}$ with $0\leq i\leq j\leq 2$. For each of the four new types we give a graph-theoretic criterion for every identity, an explicit infinite basis, and a proof of nonfinite basability. The generated varieties $\V(R_{01})$ and $\V(R_{02})$ have eleven subvarieties each, while $\V(R_{11})$ has sixty-six. The lattice $\Sub(\V(R_{12}))$ is countably infinite. Every identity in this variety reduces to a subset of twenty-five fixed identities together with two monotone path families $γ_n$ and $\gammaD_n$. This yields a canonical signature $(H,p,q)$, complete normal forms, explicit meet and join operations, and a formula for all covers. There are 153 fixed nodes, 43 one-parameter families, and 9 two-parameter families; exactly eighteen subvarieties are finitely based, and the unique limit subvariety is $\V(SR_6)$. The strong nonfinite-basis status of the four finite semirings remains open.

math.GR↗