arxiv: 2604.05744 · v1 · submitted 2026-04-07 · 🧮 math.CT

Recognition: 2 theorem links

· Lean Theorem

On the decomposition of a strong epimorphism into regular epimorphisms

Hayato Nasu, Yuto Kawase

Pith reviewed 2026-05-10 18:32 UTC · model grok-4.3

classification 🧮 math.CT MSC 18A2018C1003C99

keywords strong epimorphismregular epimorphismlocally presentable categorypartial Horn theorygeneralized algebraic theorytransfinite compositedecompositionmonadic functor

0 comments

The pith

In locally presentable categories, every strong epimorphism factors as a transfinite composite of regular epimorphisms whose minimal length is computed by syntactic translations in partial Horn theory or generalized algebraic theory.

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

The paper establishes that strong epimorphisms, which need not be regular, still admit decompositions into transfinite sequences of regular epimorphisms inside any locally presentable category. It supplies two concrete syntactic procedures, one via partial Horn theories and one via generalized algebraic theories, that calculate the smallest number of regular factors required. A reader would care because these methods convert an existence statement about transfinite composites into a finite, syntax-driven computation that applies uniformly across categories. The same framework also treats the parallel problem of factoring an adjoint functor into a transfinite composite of monadic functors.

Core claim

In locally presentable categories, any strong epimorphism can be decomposed into a transfinite composite of regular epimorphisms. The paper supplies two syntactic methods, one based on partial Horn theory and one on generalized algebraic theory, that determine the minimal length of this composite for any given strong epimorphism.

What carries the argument

Syntactic translation of a strong epimorphism into a partial Horn theory or generalized algebraic theory whose models encode the minimal ordinal length of the transfinite composite of regular epimorphisms.

If this is right

The minimal length of the decomposition becomes a syntactic invariant that can be read off without constructing the category or the composite sequence.
The same syntactic approach yields decompositions of an arbitrary adjoint functor into a transfinite composite of monadic functors.
General problems of factoring a morphism into a transfinite composite from any fixed class of morphisms admit similar syntactic treatments.
In any concrete locally presentable category the exact ordinal needed for a given strong epimorphism can be computed directly from its syntactic presentation.

Where Pith is reading between the lines

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

The methods may extend to other factorization systems or to accessible categories beyond the locally presentable setting.
They could supply uniform bounds on decomposition lengths for entire classes of morphisms rather than single instances.
Applications in logic or algebra might now treat the 'regularity defect' of a strong epimorphism as a computable invariant.

Load-bearing premise

The syntactic translations into partial Horn theories and generalized algebraic theories correctly encode the shortest transfinite composite of regular epimorphisms that realizes any given strong epimorphism.

What would settle it

A concrete strong epimorphism in a locally presentable category whose shortest decomposition into regular epimorphisms has length different from the ordinal predicted by either syntactic method.

Figures

Figures reproduced from arXiv: 2604.05744 by Hayato Nasu, Yuto Kawase.

**Figure 1.** Figure 1: Illustration of the approach via partial Horn logic The second approach, using generalized algebraic theories, focuses on how sorts depend on each other. In the generalized algebraic theory of small categories, the sort of morphisms Mor(x, y) depends on the sort of objects Obj. As in [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗

**Figure 2.** Figure 2: Illustration of the approach via generalized algebraic theory The notion of decomposition number can further be generalized from regular epimorphisms to other classes of morphisms that we think of as one-step collapses of structures. This treatment captures several known concepts, such as strict localizations for categories and monotone quotient maps for topological spaces. A key observation is that a mor… view at source ↗

read the original abstract

Strong epimorphisms and regular epimorphisms are two important classes of morphisms, and they do not coincide in general. Yet, in a locally presentable category, it is known that any strong epimorphism can be decomposed into a transfinite composite of regular epimorphisms. In this paper, we provide two syntactic methods to determine how many regular epimorphisms are needed in such a decomposition, using partial Horn theory and generalized algebraic theory. We start by discussing a general problem of decomposing a morphism into a transfinite composite of morphisms in a given class, which also covers the decomposition of an adjoint functor into monadic functors.

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 two syntactic recipes using partial Horn theories and generalized algebraic theories to compute the length of a strong epimorphism's decomposition into regular epimorphisms, but the claim that these lengths are minimal rests on an asserted rather than derived equivalence.

read the letter

The core contribution is a pair of syntactic constructions that turn a strong epimorphism in a locally presentable category into a partial Horn theory or a generalized algebraic theory whose height is supposed to give the exact number of regular epimorphisms needed for the transfinite composite decomposition. This is new; the existence of some decomposition was already known, but these methods aim to make the ordinal length computable from the presentation of the morphism. The authors also frame a broader question about decomposing any morphism into a transfinite composite from a given class of maps, which covers the monadic decomposition of adjoints as a special case. That framing is clean and could be useful beyond the strong-versus-regular case. The paper does a reasonable job of showing how to build the theory from the epimorphism and how to extract a decomposition of the claimed length from the free algebras. For someone who already works with syntactic presentations of categories, this supplies a concrete handle that avoids chasing the categorical universal properties directly. The main soft spot is whether the syntactic height really equals the smallest possible ordinal. The construction produces a decomposition of that length, but the argument that no shorter one exists in the category is not obviously derived from the presentability rank or the universal property of the free objects. If that step is only asserted, the methods give an upper bound on the length rather than the exact minimal number. The abstract does not contain derivations or examples that would let a reader verify the equivalence, so the central claim needs checking against the full proofs. This is a paper for specialists in categorical algebra who care about locally presentable categories and syntactic methods. A reader who knows the background on strong and regular epimorphisms will see the value in the translations if the minimality holds; otherwise it is mainly an existence result with extra machinery. I would bring it to a reading group for the syntactic angle. I would not cite it until the equivalence is confirmed. It deserves peer review so that referees can examine whether the proofs close the gap between syntactic height and categorical minimal length.

Referee Report

2 major / 2 minor

Summary. The paper shows that in any locally presentable category every strong epimorphism factors as a transfinite composite of regular epimorphisms. It supplies two explicit syntactic constructions—one via partial Horn theories and one via generalized algebraic theories—that associate to a given strong epimorphism a theory whose syntactic height is claimed to equal the smallest ordinal length of such a decomposition. The paper first treats a general problem of decomposing an arbitrary morphism into a transfinite composite of morphisms from a fixed class, with the epimorphism case and the monadic-functor case as applications.

Significance. If the syntactic heights are provably minimal, the constructions would give a concrete, computable invariant for the “regular-epimorphic length” of strong epimorphisms, turning an existence theorem into a practical tool. The explicit translation from categorical data to algebraic syntax is a clear strength and could be useful for concrete calculations in locally presentable categories such as varieties or toposes.

major comments (2)

[Sections describing the partial Horn theory and GAT constructions] The central claim that the syntactic height of the constructed partial Horn theory (or GAT) equals the minimal ordinal α such that the strong epimorphism factors through α many regular epimorphisms is asserted after the construction is given, but no general argument is supplied showing that no shorter transfinite composite exists in the ambient category. The universal property of the free algebras is invoked, yet the proof that the syntactic length is minimal with respect to all possible factorizations is missing.
[General decomposition problem section] The general decomposition framework is introduced, but the reduction of the strong-epimorphism problem to this framework does not contain an explicit verification that the syntactic height is invariant under the choice of presentation or that it is preserved by the forgetful functor from the category of models.

minor comments (2)

[Abstract] The abstract states that the methods “determine how many regular epimorphisms are needed” without indicating whether the count is the minimal ordinal or merely an upper bound; a single clarifying sentence would remove ambiguity.
[Notation and definitions] Notation for the syntactic height (e.g., the ordinal extracted from the theory) is introduced without a dedicated definition or comparison table relating it to the categorical ordinal α.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed report and the identification of points where the arguments for minimality and invariance require further elaboration. We will revise the manuscript accordingly to provide the missing explicit verifications.

read point-by-point responses

Referee: [Sections describing the partial Horn theory and GAT constructions] The central claim that the syntactic height of the constructed partial Horn theory (or GAT) equals the minimal ordinal α such that the strong epimorphism factors through α many regular epimorphisms is asserted after the construction is given, but no general argument is supplied showing that no shorter transfinite composite exists in the ambient category. The universal property of the free algebras is invoked, yet the proof that the syntactic length is minimal with respect to all possible factorizations is missing.

Authors: The construction via partial Horn theories and GATs is designed so that the syntactic height corresponds to the minimal length by the universal property: any factorization through a shorter composite would allow the definition of a model satisfying the relations up to a lower ordinal, which would contradict the freeness of the algebra generated by the presentation. However, we agree that this implication needs to be spelled out more explicitly in the text. We will add a dedicated subsection proving that the syntactic height is indeed minimal by showing that a shorter decomposition would induce an isomorphism or a factorization that violates the generating property of the free object. This will be included in the revised version. revision: yes
Referee: [General decomposition problem section] The general decomposition framework is introduced, but the reduction of the strong-epimorphism problem to this framework does not contain an explicit verification that the syntactic height is invariant under the choice of presentation or that it is preserved by the forgetful functor from the category of models.

Authors: In the general decomposition framework, the syntactic height is defined intrinsically via the theory, and different presentations of the same strong epimorphism yield equivalent theories up to equivalence, preserving the height. Regarding the forgetful functor, since it creates the relevant colimits and the decomposition is lifted from the syntactic level, the height is preserved. We acknowledge the need for an explicit lemma or proposition verifying these facts. In the revision, we will insert a new lemma in the general section establishing the invariance under choice of presentation and the preservation under forgetful functors, with a proof based on the adjunction and the preservation properties of the forgetful functor in locally presentable categories. revision: yes

Circularity Check

0 steps flagged

No significant circularity; syntactic methods built on external existence theorem

full rationale

The paper starts from the known fact that strong epimorphisms decompose into transfinite composites of regular epimorphisms in locally presentable categories and introduces new syntactic translations via partial Horn theories and generalized algebraic theories to compute the required length. No equation or construction in the derivation reduces the claimed minimal ordinal length to a fitted parameter, self-definition, or load-bearing self-citation chain; the translations are presented as independent computational tools whose correctness is asserted on the basis of the prior categorical result rather than derived tautologically from the paper's own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper rests on the known existence of the transfinite decomposition in locally presentable categories and introduces syntactic determination via two logical frameworks; no free parameters or new entities are mentioned.

axioms (1)

domain assumption Any strong epimorphism in a locally presentable category can be decomposed into a transfinite composite of regular epimorphisms.
Explicitly stated as already known in the abstract.

pith-pipeline@v0.9.0 · 5398 in / 1221 out tokens · 59022 ms · 2026-05-10T18:32:50.408793+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

8 extracted references · 8 canonical work pages

[1]

Abstract and concrete categories: the joy of cats

Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge, 2011.doi:10.1017/CBO9780511760754(cit. on p. 43). [AHS06] J. Ad´ amek, H. Herrlich, and G. E. Strecker. “Abstract and concrete categories: the joy of cats”. In:Repr. Theory Appl. Categ.17 (2006). Reprint of the 1990 original [Wiley, New York; MR1051419], pp. 1–507.url:http://www.tac.m...

work page doi:10.1017/cbo9780511760754(cit 2011
[2]

Iterated cotriples

London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge, 1994.doi:10.1017/CBO9780511600579(cit. on p. 46). [AT70] H. Applegate and M. Tierney. “Iterated cotriples”. In:Reports of the Midwest Cate- gory Seminar, IV. Vol. Vol

work page doi:10.1017/cbo9780511600579(cit 1994
[3]

Generalized congruences— epimorphisms in Cat

Lecture Notes in Math. Springer, Berlin-New York, 1970, pp. 56–99.doi:10.1007/BFb0060440(cit. on pp. 4, 14). [BBP99] M. A. Bednarczyk, A. M. Borzyszkowski, and W. Pawlowski. “Generalized congruences— epimorphisms in Cat”. In:Theory Appl. Categ.5 (1999), No. 11, 266–280.url:http: //www.tac.mta.ca/tac/volumes/1999/n11/5-11abs.html(cit. on pp. 2, 7). [B¨ or9...

work page doi:10.1007/bfb0060440(cit 1970
[4]

Combinatorial structure of type dependency

Lecture Notes in Mathematics. Springer-Verlag, Berlin-New York, 1971.doi:10 . 1007 / BFb0059396(cit. on pp. 2, 4, 11, 27). [Gar15] R. Garner. “Combinatorial structure of type dependency”. In:J. Pure Appl. Algebra 219.6 (2015), pp. 1885–1914.doi:10.1016/j.jpaa.2014.07.015(cit. on p. 64). [Gol24] Z. P. Goldthorpe. “Higher categorical structures as universal...

work page doi:10.1016/j.jpaa.2014.07.015(cit 1971
[5]

Pullbacks equivalent to pseudopullbacks

arXiv:1710.10238(cit. on pp. 3, 42). [JS93] A. Joyal and R. Street. “Pullbacks equivalent to pseudopullbacks”. In:Cahiers Topologie G´ eom. Diff´ erentielle Cat´ eg.34.2 (1993), pp. 153–156.url:https : / / www.numdam.org/item/?id=CTGDC_1993__34_2_153_0(cit. on p. 68). [Kaw26] Y. Kawase. “Relativized universal algebra via partial Horn logic”. In:Theory App...

work page doi:10.1017/s1446788700005693(cit 1993
[6]

The tower and regular decomposition

London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge, 2004.doi: 10.1017/CBO9780511525896(cit. on p. 57). [MS82] J. MacDonald and A. Stone. “The tower and regular decomposition”. In:Cahiers Topologie G´ eom. Diff´ erentielle23.2 (1982), pp. 197–213.url:https://www.numdam. org/item/?id=CTGDC_1982__23_2_197_0(cit. on pp. 2, ...

work page doi:10.1017/cbo9780511525896(cit 2004
[7]

Partial horn logic and Cartesian categories

Lecture Notes in Math. Springer, Berlin-New York, 1982, pp. 175–189.doi:10 . 1007 / BFb0066897 (cit. on pp. 2, 4, 10, 11, 14, 58). [PV07] E. Palmgren and S. J. Vickers. “Partial Horn logic and cartesian categories”. In:Ann. Pure Appl. Logic145.3 (2007), pp. 314–353.doi:10.1016/j.apal.2006.10.001 (cit. on pp. 3, 25, 60, 62). [Par22] J. Parker. “Covariant i...

work page doi:10.1016/j.apal.2006.10.001 1982
[8]

The algebra of oriented simplexes

Handb. Log. Comput. Sci. Oxford Univ. Press, New York, 2000, pp. 39–128 (cit. on p. 65). [Rie16] E. Riehl.Category Theory in Context. Aurora Dover Modern Math Originals. Dover Publications, Inc., Mineola, NY, 2016 (cit. on p. 44). [Str87] R. Street. “The algebra of oriented simplexes”. In:J. Pure Appl. Algebra49.3 (1987), pp. 283–335.doi:10.1016/0022-4049...

work page doi:10.1016/0022-4049(87)90137-x(cit 2000