An inductive method for $\mathrm{OI}$-modules

Liping Li; Wee Liang Gan

An inductive method for $\mathrm{OI}$-modules

T0 review · 0 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For any nonzero OI-module, regularity is bounded by $2^{2t_0(V)} \operatorname{prd}(V)$.

desk verdict Solid, correct extension of the authors' inductive machinery to OI-modules presented in finite degrees, giving the first explicit (if very large) regularity bound; the key combinatorial Proposition 9 checks out. read the letter →

arxiv 1909.01261 v2 pith:ONMXDD6R submitted 2019-09-03 math.RT math.ACmath.RA

Wee Liang Gan , Liping Li This is my paper · ORCID

classification math.RTmath.ACmath.RA MSC 18A25

keywords OI-modulesCastelnuovo-Mumfordregularityrepresentationstabilityshiftfunctorsemi-inducedmodulesHilbertfunctionscombinatorialcategoriesincreasingmaps

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper develops an inductive method for OI-modules—functors from finite totally ordered sets with strictly increasing maps to $k$-modules—that are presented in finitely many degrees. The engine is a combinatorial proposition (Proposition 9) showing that, after shifting a presentation and projecting to its top-degree part, every relation in the image is generated by pieces cut from relations of degree at most the generation degree $t_0(W)$. From this the authors prove Theorem 1: the shifted quotient $\overline{V} = \Sigma^r V / (\Sigma^r V)_{\prec d}$ embeds into its own shift, giving a torsion-free replacement that supports induction on the generation degree. As the main application, they obtain the first explicit upper bound on Castelnuovo-Mumford regularity of OI-modules: $\operatorname{reg}(V) \le 2^{2t_0(V)} \operatorname{prd}(V)$ for every nonzero $V$. A sympathetic reader would care because the bound is quantitative where only finiteness was known, and the same induction yields a starting point for eventual polynomiality of Hilbert functions and a classification of acyclic modules.

What carries the argument

The load-bearing object is the combinatorial Proposition 9. Given a presentation $F = \bigoplus M(d_j) \to V$ of a module with $d = t_0(V)$ and kernel $W$, one shifts by $r \ge \operatorname{prd}(V)$ and projects $\Sigma^r F$ onto the summand $P$ spanned by the top-degree projectives $M(d)$. The proposition asserts that the image $\widehat{W} = \eta(\Sigma^r W)$ is generated by elements $\widehat{w}_\ell$, one for each relation $w \in W_s$ with $s \le t_0(W)$, obtained by deleting the first $\ell - 1$ entries of the increasing maps appearing in $w$. This generation statement is what forces $\kappa_{\overline{V}} = 0$ in Theorem 1, and it is delicate because OI lacks transitivity: endomorphism groups of objects are trivial, so morphism sets have no symmetry group acting transitively on them. The supporting structure is the shift functor $\Sigma = V \circ \sigma$, where $\sigma$ adds a new minimum element to each ordered set, with kernel $\kappa_V$ and cokernel $\Delta V$ of the natural map $V \to \Sigma V$.

What would settle it

Compute the regularity of a small explicit OI-module, for instance $V_0 = 0$ and $V_n = k$ for $n \ge 1$, with $V(\alpha)$ equal to the identity only when $\alpha(m) = n$ and zero otherwise, which has $t_0(V) = 1$ and $t_1(V) = 2$; Theorem 4 predicts $\operatorname{reg}(V) \le 8$, and a direct homological calculation yielding a larger value would refute the paper's central claim.

Watch

Extended reading notes

Core claim

The central claim is Theorem 4: for any nonzero OI-module $V$, $\operatorname{reg}(V) \le 2^{2t_0(V)} \operatorname{prd}(V)$, where $t_0$ is the generation degree and $\operatorname{prd}$ the presentation degree. The authors establish it by induction on $d = t_0(V)$ using the module $\overline{V} = \Sigma^r V / (\Sigma^r V)_{\prec d}$ with $r \ge \operatorname{prd}(V)$. Theorem 1 says $\kappa_{\overline{V}} = 0$: the natural map $\overline{V} \to \Sigma \overline{V}$ is injective. Because the cokernel $\Delta(\overline{V})$ has generation degree strictly smaller than $d$, and because the submodule $(\Sigma^r V)_{\prec d}$ is itself presented in lower degree, a property that is glueable, $\Sigma$-dominant, and $\Delta$-predominant propagates from the zero module to every module presented in finite degrees (Theorems 2 and 19). Theorem 4 is the quantitative output of this formal induction, with auxiliary functions $C_d(r)$ tracking how many times regularity is amplified at each generation degree.

Load-bearing premise

The proof rests on a single combinatorial generation statement: every element of the submodule $\widehat{W}$ produced by shifting a presentation is generated by the pieces $\widehat{w}_\ell$ indexed by relations $w$ of degree at most $t_0(W)$; if that statement failed, the induction step that makes the shifted quotient torsion-free would break, and the regularity bound would not follow.

Editorial extensions

If this is right

Every nonzero OI-module has finite Castelnuovo-Mumford regularity bounded by $2^{2t_0(V)} \operatorname{prd}(V)$, so all higher homological degrees $t_i(V)$ are simultaneously controlled by the first two invariants.
The category of OI-modules presented in finite degrees is abelian, so kernels and cokernels of maps between such modules remain in the category and homological algebra can be done without Noetherian assumptions on the coefficient ring.
A finitely generated OI-module over a field has Hilbert function $\dim_k V_n$ equal to a rational polynomial of degree at most $t_0(V)$ for all $n \ge 2^{2t_0(V)} \operatorname{prd}(V)$, giving an explicit bound on where polynomial growth begins.
Every OI-module presented in finite degrees is filtration stable: finitely many modules of generation degree at most $t_0(V)$ exist such that every large shift $\Sigma^n V$ has a filtration whose successive quotients lie among them, with the family size at most $2^{t_0(V)+1} - 1$.
An OI-module presented in finite degrees is semi-induced exactly when its OI-homology vanishes in degree 1 (equivalently, in any single positive degree), extending the FI-module acyclicity criterion.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The double-exponential form of the bound is an artifact of the proof, which uses $\operatorname{reg}(\overline{V})$ to control $t_2(V)$; a direct bound on $t_2$ in terms of $\operatorname{prd}(V)$, matching what exists for FI- and VI-modules, would likely lower Theorem 4 to a much smaller function.
Because the method never invokes Noetherianity of the coefficient ring, it should transfer to other categories with trivial automorphism groups and non-transitive morphism sets, provided one can prove the analogue of Proposition 9.
The explicit bound on polynomial growth of Hilbert functions makes it possible, in principle, to compute stable ranges for concrete families of homology groups once a presentation of the associated OI-module is known, a step the paper does not carry out.
The identification of OI with the increasing monoid and the semisimplicial category is ring-independent, so the same regularity and Hilbert-polynomial bounds apply there; Theorem 4 also settles, in explicit form, the conjecture that regularity is controlled by finitely many $t_i$.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

First thing you should know: this is the paper that finally gives an explicit upper bound for Castelnuovo–Mumford regularity of OI-modules presented in finite degrees, reg(V) ≤ 2^{2 t0(V)} prd(V), and a matching threshold for eventual polynomiality of Hilbert functions. The main new tool is Proposition 9, a combinatorial generation statement about the image of the kernel under a projection onto the top-degree projective summand. It is the engine that makes the induction go through, and it is the right thing to check.

The paper does what it claims. The proof of Proposition 9 is delicate—OI lacks the transitivity that FI and VI have—and I checked the downward induction on ℓ and the factorization γ(h)=β(h+ℓ-1)-r; both work. Theorem 4 follows from a straightforward induction on t0(V) with an auxiliary function C_d(r). The bound is derived, not fitted; the only external inputs are two self-cited lemmas from the authors' earlier published papers [7,8], which is fair when the citations are the actual machinery. The extension from finitely generated modules over Noetherian rings to all modules presented in finite degrees is real, and Corollary 16 (the category is abelian) is a useful byproduct. The paper is also honest about what it does not do: the bound is enormous, and the authors note they use reg(V) to bound t2(V), which amplifies the final number. That is a limitation in impact, not in correctness.

Soft spots are minor and mostly cosmetic. There are a few typographical slips—missing bars on \bar V in the proof of Theorem 15, and one place where the double-exponential bound is written as 2^{2d} r instead of 2^{2^d} r. The stress-test caught neither as load-bearing, and neither is. The eventual-polynomiality theorem is essentially a corollary of the same induction, so it adds less than it appears. You will need [7,8] on the table to verify Lemma 8 and Proposition 23, but those are published and independent. No formalization, no code, but that is normal for this area.

If you work on representation stability or combinatorial categories, you should read this. It is not a paradigm shift—the authors themselves frame it as an extension of their own inductive machinery—but it is the first quantitative handle on OI-regularity and it will be cited. I would send it to a serious referee; the central claim holds up. Accept with minor revisions.

Referee Report

0 major / 5 minor

Summary. The paper introduces an inductive method for studying OI-modules, i.e., representations of the category of finite totally ordered sets and strictly increasing maps, that are presented in finite degrees. The central result, Theorem 4, asserts that every nonzero OI-module V satisfies reg(V) ≤ 2^{2^{t0(V)}} prd(V), where t0(V) is the generation degree and prd(V) is the presentation degree; this is the first explicit upper bound of this kind for OI-modules. The proof combines a key combinatorial proposition (Proposition 9) identifying generators of the image of the kernel under the projection to the top-degree projective summand, a theorem on the vanishing of the kernel of the natural map for the truncated shift (Theorem 1), and an induction on t0(V) using the Δ construction and auxiliary estimates (Lemma 14). The paper also derives effective eventual polynomiality of Hilbert functions (Theorem 5), filtration stability (Theorem 3), and structural results on semi-induced modules and projective dimension.

Significance. If correct, the regularity bound is a substantial contribution to representation stability: it controls all higher homological degrees t_i(V) simultaneously and works for arbitrary coefficient rings and for modules presented in finite degrees, going beyond the finitely generated/Noetherian setting of earlier work. The proof is detailed and I found no load-bearing gap: the downward induction in Proposition 9 and the factorization γ(h)=β(h+ℓ−1)−r are valid, and the induction in Theorem 15 is sound once the notation is corrected. The potential concern about Proposition 9 does not land on close reading. The paper also provides a flexible inductive framework (Theorem 19) and explicit bounds for Hilbert-function stabilization, with clear statements of open questions. The main limitations are the acknowledged possible non-optimality of the double-exponential bound and some presentational issues in the typesetting of the induction step.

minor comments (5)

[Section 4.2, Theorem 15] The proof as printed applies the induction hypothesis to ∆V, but the intended module is ∆\bar V, where \bar V = Σ^rV/(Σ^rV)_{\prec d}; as written, the step appears to invoke the induction hypothesis on the wrong module. The necessary bound prd(\bar V) ≤ r follows from the short exact sequence 0 → (Σ^rV)_{\prec d} → Σ^rV → \bar V → 0 together with t0((Σ^rV)_{\prec d}) ≤ d−1 and t1(Σ^rV) ≤ r, so the argument is sound after restoring the missing bars.
[Throughout] The displayed bound in Theorem 4 and in Lemma 14 should be typeset as 2^{2^{t0(V)}} and 2^{2^d}r; the current text shows ambiguous expressions such as '22t0(V)' and '22d', which can be misread as 2^{2t0(V)} or 2^{2d}.
[Abstract and Section 1.2] The abstract calls the morphisms of OI 'order-preserving injective maps' while Section 1.2 defines them as strictly increasing maps; these are equivalent for totally ordered finite sets, but the wording should be made consistent to avoid confusion.
[Section 4.4] The proof of Theorem 20 refers to the proof of 'Theorem 2' when the statement is restated as Theorem 19; the cross-reference should be updated for consistency.
[Section 4.5] There are typographical errors in the first sentence of Section 4.5 ('ﬁntely ge nerated') and elsewhere in the abstract ('an d'); a careful proofread is needed.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity identified; the regularity bound is derived from a proved combinatorial proposition and independent prior lemmas, not fitted or self-referential.

full rationale

The paper's central claim, Theorem 4, is derived rather than assumed. The key combinatorial engine, Proposition 9, is proved in full within the paper and does not invoke the target bound. The inductive proof of Theorem 15 applies the induction hypothesis to the genuinely smaller module ΔV, whose generation and presentation degrees have been reduced via Lemma 13, so the induction is not circular. Lemma 8, imported from the authors' prior work [7], is a parameter-free general inequality relating reg(V) to reg(ΣV) and reg(ΔV); its assumptions do not include the target regularity bound, and it is used only to propagate bounds, not to define them. Lemma 14's double-exponential estimate for the auxiliary functions C_d(r) is a self-contained combinatorial calculation. The final bound reg(V) ≤ 2^{2^{t0(V)}} prd(V) is therefore a genuine consequence of the paper's own arguments and previously established independent results. No fitted parameters are renamed as predictions, no quantity is defined in terms of itself, and no load-bearing premise reduces to a self-citation chain. The self-citations to [7] and [8] supply real, independent evidence and do not constitute circularity.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

No fitted numbers or ad hoc entities. The central bound is derived. The paper depends on two cited results from the authors' own prior work (Lemma 8 from [7] and Proposition 23 from [8]), which are treated here as black boxes.

assumptions (3)

standard math The functor category OI-Mod is abelian with enough projective objects, and the modules M(m)=kOI([m],-) are projective with t0(M(m))=m.
Used throughout to construct projective presentations and to define the derived functors H^OI_i; standard for functor categories over k-Mod.
domain assumption Lemma 8 from [7]: reg(V) ≤ reg(ΣV)+1, and if κV=0 then reg(V) ≤ reg(ΔV)+1.
This shift inequality is the engine of the induction in Theorem 4; it is quoted from the authors' prior paper rather than proved in this paper.
domain assumption Proposition 23 from [8]: an OI-module presented in finite degrees is semi-induced if and only if H^OI_1(V)=0, if and only if all higher H^OI_i(V)=0.
Used without reproof in Section 4.6 to classify semi-induced modules; cited from the authors' earlier paper.

how reviews work

0 comments

Cite this review

Pith. "Pith review of An inductive method for $\mathrm{OI}$-modules." pith.science (2026). https://pith.science/paper/ONMXDD6R

@misc{pith2026190901261,
  author       = {Pith},
  title        = {Pith review of: An inductive method for $\mathrmOI$-modules},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ONMXDD6R}},
  note         = {Machine review of arXiv:1909.01261}
}

abstract

In this paper we introduce an inductive method to study $\mathrm{OI}$-modules presented in finite degrees, where $\mathrm{OI}$ is a skeleton of the category of finitely totally ordered sets and strictly increasing maps. As an application, we obtain an explicit upper bound for the Castelnuovo-Mumford regularity of $\mathrm{OI}$-modules.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

19 extracted references · 12 canonical work pages

[1]

Homology of FI-mod ules

Church, Thomas; Ellenberg, Jordan S. Homology of FI-mod ules. Geom. Topol. 21 (2017), no. 4, 2373–2418. arXiv:1506.01022v2

arXiv 2017
[2]

FI- modules and stability for representations of symmetric groups

Church, Thomas; Ellenberg, Jordan S.; Farb, Benson. FI- modules and stability for representations of symmetric groups. Duke Math. J. 164 (2015), no. 9, 1833–1910. arXiv:12 04.4533v4

work page 2015
[3]

FI-modules over Noetherian rings

Church, Thomas; Ellenberg, Jordan S.; Farb, Benson; Nag pal, Rohit. FI-modules over Noetherian rings. Geom. Topol. 18 (2014), no. 5, 2951–2984. arXiv:1210.1854v2

arXiv 2014
[4]

Representation theory an d homological stability

Church, Thomas; Farb, Benson. Representation theory an d homological stability. Adv. Math., (2013), 250-314. arXiv:1008.1368v3

arXiv 2013
[5]

Linear and quadratic ranges in representation stability

Church, Thomas; Miller, Jeremy; Nagpal, Rohit; Reinhol d, Jens. Linear and quadratic ranges in representation stability. Adv. Math. 333 (2018), 1-40. arXiv:1706.03845v 1

work page Pith review arXiv 2018
[6]

A long exact sequence for homology of FI-modules

Gan, Wee Liang. A long exact sequence for homology of FI-m odules. New York J. Math. 22 (2016), 1487-1502. arXiv:1602.08873v3. AN INDUCTIVE METHOD FOR OI-MODULES 19

work page Pith review arXiv 2016
[7]

An inductive machinery for representations of categories with shift functors

Gan, Wee Liang; Li, Liping. An inductive machinery for re presentations of categories with shift functors. Trans. Amer. Math. Soc. 371 (2019), 8513-8534. arXiv:1610.09081

work page Pith review arXiv 2019
[8]

Asymptotic behavior of repre sentations of graded categories with inductive functors

Gan, Wee Liang; Li, Liping. Asymptotic behavior of repre sentations of graded categories with inductive functors. J. Pure Appl. Algebra 223 (2019), 188-217. arXiv:1705.0088 2v5

work page arXiv 2019

Show all 19 references

[9]

Bounds on homological invari ants of VI-modules

Gan, Wee Liang; Li, Liping. Bounds on homological invari ants of VI-modules. to appear in Mich. Math. J. arXiv:1710.10233v2

arXiv
[10]

The representat ion theory of the increasing monoid

G¨ unt¨ urk¨ un, Sema; Snowden, Andrew. The representat ion theory of the increasing monoid. Preprint. arXiv:1812.12042v1
[11]

Upper bounds of homological invariants of F IG-modules

Li, Liping. Upper bounds of homological invariants of F IG-modules. Arch. Math. (Basel) 107 (2016), no. 3, 201-211. arXiv:1512.05879v3

2016 arXiv
[12]

Depth and the local cohomology of FI G-modules

Li, Liping; Ramos, Eric. Depth and the local cohomology of FI G-modules. Adv. Math. 329 (2018), 704-741. arXiv:1602.04405v3

2018 arXiv
[13]

Filtrations and homological degr ees of FI-modules

Li, Liping; Yu, Nina. Filtrations and homological degr ees of FI-modules. J. Algebra 472 (2017), 369-398. arXiv:1511.02977v3

2017 arXiv
[14]

Miller, Jeremy; Wilson, Jennifer C. H. FI-hyperhomolo gy and ordered conﬁguration spaces. Proc. Amer. Math. Soc. 148 (2020), no. 3, 993-1002. arXiv:1903.02722

2020 arXiv
[15]

VI-modules in non-describing characte ristic, part I

Nagpal, Rohit. VI-modules in non-describing characte ristic, part I. Algebra Number Theory 13 (2019), no. 9, 2151-2189. arXiv:1709.07591v3

2019 arXiv
[16]

Periodicity in the coh omology of symmetric groups via divided powers

Nagpal, Rohit; Snowden, Andrew. Periodicity in the coh omology of symmetric groups via divided powers. Proc. Lond. Math. Soc. 116 (2018), 1244-1268. arXiv:1705.10028v 2

2018 arXiv
[17]

Stabi lity in the homology of unipotent groups

Putman, Andrew; Sam, Steven V.; Snowden, Andrew. Stabi lity in the homology of unipotent groups. Algebra Number Theory 14 (2020), no. 1, 119-154. arXiv:1711.11080v 4

2020 arXiv
[18]

Homological invariants of FI-modules and FIG-modules

Ramos, Eric. Homological invariants of FI-modules and FIG-modules. J. Algebra 502 (2018), 163-195. arXiv:1511.03964v3

2018 arXiv
[19]

Gr¨ obner methods for r epresentations of combinatorial categories

Sam, Steven V.; Snowden, Andrew. Gr¨ obner methods for r epresentations of combinatorial categories. J. Amer. Math. Soc. 30 (2017), 159203. arXiv:1409.1670v3. Department of Mathematics, University of California, Rive rside, CA 92521, USA E-mail address : wlgan@ucr.edu LCSM (Mi...

2017 arXiv

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.

[1] [1]

Homology of FI-mod ules

Church, Thomas; Ellenberg, Jordan S. Homology of FI-mod ules. Geom. Topol. 21 (2017), no. 4, 2373–2418. arXiv:1506.01022v2

arXiv 2017

[2] [2]

FI- modules and stability for representations of symmetric groups

Church, Thomas; Ellenberg, Jordan S.; Farb, Benson. FI- modules and stability for representations of symmetric groups. Duke Math. J. 164 (2015), no. 9, 1833–1910. arXiv:12 04.4533v4

work page 2015

[3] [3]

FI-modules over Noetherian rings

Church, Thomas; Ellenberg, Jordan S.; Farb, Benson; Nag pal, Rohit. FI-modules over Noetherian rings. Geom. Topol. 18 (2014), no. 5, 2951–2984. arXiv:1210.1854v2

arXiv 2014

[4] [4]

Representation theory an d homological stability

Church, Thomas; Farb, Benson. Representation theory an d homological stability. Adv. Math., (2013), 250-314. arXiv:1008.1368v3

arXiv 2013

[5] [5]

Linear and quadratic ranges in representation stability

Church, Thomas; Miller, Jeremy; Nagpal, Rohit; Reinhol d, Jens. Linear and quadratic ranges in representation stability. Adv. Math. 333 (2018), 1-40. arXiv:1706.03845v 1

work page Pith review arXiv 2018

[6] [6]

A long exact sequence for homology of FI-modules

Gan, Wee Liang. A long exact sequence for homology of FI-m odules. New York J. Math. 22 (2016), 1487-1502. arXiv:1602.08873v3. AN INDUCTIVE METHOD FOR OI-MODULES 19

work page Pith review arXiv 2016

[7] [7]

An inductive machinery for representations of categories with shift functors

Gan, Wee Liang; Li, Liping. An inductive machinery for re presentations of categories with shift functors. Trans. Amer. Math. Soc. 371 (2019), 8513-8534. arXiv:1610.09081

work page Pith review arXiv 2019

[8] [8]

Asymptotic behavior of repre sentations of graded categories with inductive functors

Gan, Wee Liang; Li, Liping. Asymptotic behavior of repre sentations of graded categories with inductive functors. J. Pure Appl. Algebra 223 (2019), 188-217. arXiv:1705.0088 2v5

work page arXiv 2019