On finitary properties for fiber products of free semigroups and monoids

Ashley Clayton

arxiv: 1907.01378 · v1 · pith:RRPPUUUDnew · submitted 2019-07-02 · 🧮 math.GR · math.CO

On finitary properties for fiber products of free semigroups and monoids

Ashley Clayton This is my paper

Pith reviewed 2026-05-25 10:28 UTC · model grok-4.3

classification 🧮 math.GR math.CO

keywords fiber productsfree monoidsfree semigroupsfinite generationfinite presentabilitysemigroup quotientsindecomposable elements

0 comments

The pith

Fiber products of two free monoids over finite quotients are finitely generated exactly when the quotients meet a stated condition, and all such products are finitely presented.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper determines necessary and sufficient conditions for finite generation and finite presentability of fiber products formed from free monoids and free semigroups. For two free monoids over finite fiber quotients, finite generation holds precisely when the quotients satisfy a particular condition on their structure, and every such product is finitely presented. Fiber products of free semigroups over finite quotients are never finitely generated. When the quotients are infinite, finite generation of the semigroup fiber product requires the quotient to be infinite yet finitely generated, idempotent-free, and J-trivial. Automata are built that accept the indecomposable elements of these fiber products, yielding a further necessary and sufficient condition for finite generation.

Core claim

A fiber product of two free monoids over a finite fiber quotient is finitely generated if and only if a stated condition on the finite fiber quotients holds, and all such products are finitely presented; fiber products of free semigroups over finite quotients are never finitely generated.

What carries the argument

The fiber product of two free monoids or semigroups over a common quotient homomorphism, together with the condition that determines when the resulting set of pairs is finitely generated as a monoid or semigroup.

If this is right

Fiber products of free monoids over finite quotients are finitely presented whenever they are finitely generated.
Fiber products of free semigroups over any finite quotient fail to be finitely generated.
When the common quotient is infinite, finite generation of a free-semigroup fiber product requires the quotient to be finitely generated, idempotent-free and J-trivial.
Automata exist that recognize the indecomposable elements of any such fiber product and decide finite generation under the derived condition.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The sharp contrast between the monoid and semigroup cases suggests that unit elements play an essential role in allowing finite generation to occur.
The automata construction supplies an algorithmic route to checking finite generation for concrete choices of quotients.
Results of this type may extend to fiber products formed inside other varieties of semigroups or monoids beyond the free ones.

Load-bearing premise

The maps from the free monoids or semigroups to the fiber quotients are surjective homomorphisms and the fiber product is formed in the standard way as the set of pairs with equal images under those maps.

What would settle it

An explicit pair of finite quotients that meet the stated condition yet produce a fiber product that is not finitely generated, or a finite quotient whose corresponding semigroup fiber product is finitely generated.

read the original abstract

We consider necessary and sufficient conditions for finite generation and finite presentability for fiber products of free semigroups and free monoids. We give a necessary and sufficient condition on finite fiber quotients for a fiber product of two free monoids to be finitely generated, and show that all such fiber products are also finitely presented. By way of contrast, we show that fiber products of free semigroups over finite fiber quotients are never finitely generated. We then consider fiber products of free semigroups over infinite semigroups, and show that for such a fiber product to be finitely generated, the quotient must be infinite but finitely generated, idempotent-free, and $\mathcal{J}$-trivial. Finally, we construct automata accepting the indecomposable elements of the fiber product of two free monoids/semigroups over free monoid/semigroup fibers, and give a necessary and sufficient condition for such a product to be finitely generated.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives necessary and sufficient conditions on finite quotients for finite generation of free monoid fiber products, proves finite presentability in those cases, and shows free semigroup versions over finite quotients are never finitely generated.

read the letter

The main things to know are that the paper establishes necessary and sufficient conditions on the finite quotient for a fiber product of two free monoids to be finitely generated, shows those products are finitely presented, and proves that fiber products of free semigroups over finite quotients are never finitely generated. It also gives conditions involving infinite quotients and builds automata to accept the indecomposable elements. What comes across as new is the precise necessary and sufficient condition on the finite fiber quotients for the monoid case along with the automata construction that yields a condition for finite generation. These elements are not present in the prior literature cited. The paper does a good job distinguishing the behavior of semigroups from monoids in this fiber product setting. It organizes the finiteness results for this family of constructions in a direct way. The soft spot is that the abstract presents the theorems with clear structure but does not include the proof details or any explicit checks against small examples. This means the actual soundness cannot be confirmed from the text alone, though nothing in the stated claims suggests circularity or inconsistency with standard definitions of fiber products and surjective homomorphisms. This work is aimed at researchers in semigroup theory who focus on finite generation and presentation questions. A reader already comfortable with concepts like Green's relations and fiber products in algebraic structures will find the most direct value here. The paper shows clear thinking on its own terms with honest engagement on the algebraic conditions. It deserves a serious referee. I recommend sending it for peer review.

Referee Report

0 major / 2 minor

Summary. The manuscript studies finitary properties of fiber products in the categories of semigroups and monoids. It states a necessary and sufficient condition on finite fiber quotients for a fiber product of two free monoids to be finitely generated, proves that all such products are finitely presented, shows that fiber products of free semigroups over finite quotients are never finitely generated, gives conditions (infinite, finitely generated, idempotent-free, and J-trivial) under which a fiber product of free semigroups over an infinite quotient is finitely generated, and constructs automata accepting the indecomposable elements of fiber products of free monoids/semigroups over free monoid/semigroup fibers together with a necessary and sufficient condition for finite generation of such products.

Significance. If the stated conditions and proofs hold, the results clarify the boundary between finite and infinite generation for fiber products of free structures, highlighting a sharp distinction between the semigroup and monoid cases. The automata construction supplies an explicit combinatorial tool for recognizing indecomposables, which strengthens the contribution to combinatorial semigroup theory.

minor comments (2)

[Abstract] The abstract refers to 'a stated condition' on finite fiber quotients without naming the condition; a brief explicit statement of the condition in the abstract would improve readability.
[§2] Notation for the fiber quotients and the surjective homomorphisms could be introduced once in §2 and used consistently thereafter to avoid repeated redefinition.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript, their summary of our results, and their recommendation to accept.

Circularity Check

0 steps flagged

No significant circularity; direct algebraic proofs

full rationale

The paper states necessary-and-sufficient conditions on finite fiber quotients for finite generation and presentability of monoid fiber products, and non-generation for semigroup cases, via direct proofs using the standard categorical definition of fiber product and surjective homomorphisms. No equations reduce claimed results to fitted parameters, self-definitions, or self-citation chains; automata constructions for indecomposables and conditions on infinite quotients are derived from first principles without renaming known results or importing uniqueness via author citations. The derivation chain is self-contained against external algebraic benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper rests on the standard axioms of semigroup and monoid theory (associativity, identity element for monoids) and the categorical definition of fiber product; no free parameters or invented entities are introduced.

axioms (2)

standard math Semigroups are associative binary operations; monoids additionally possess an identity element.
Invoked throughout the statements about free objects and quotients.
domain assumption Fiber product is formed by pullback along two surjective homomorphisms to a common quotient.
Central to all generation and presentation claims.

pith-pipeline@v0.9.0 · 5682 in / 1352 out tokens · 26898 ms · 2026-05-25T10:28:42.840137+00:00 · methodology

On finitary properties for fiber products of free semigroups and monoids

Core claim

What carries the argument

If this is right

Where Pith is reading between the lines

Load-bearing premise

What would settle it

discussion (0)