Generalized Rank via Minimal Subposet

Justin Desrochers; Samuel Leblanc; Thomas Br\"ustle

arxiv: 2510.10837 · v4 · submitted 2025-10-12 · 🧮 math.RT · math.CT

Generalized Rank via Minimal Subposet

Thomas Br\"ustle , Justin Desrochers , Samuel Leblanc This is my paper

Pith reviewed 2026-05-18 07:49 UTC · model grok-4.3

classification 🧮 math.RT math.CT

keywords generalized rankinitial embeddingfinal embeddingsubposetposetinterval modulemodule restrictioncategory representation

0 comments

The pith

An embedding that is both initial and final preserves generalized rank upon restriction of modules.

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

The paper shows that for small connected categories with finite hom-sets, restricting any module to a connected subcategory preserves the generalized rank if the embedding is both initial and final. The converse holds when the category and subcategory are posets with mild constraints and the embedding is full. This connects a categorical embedding property to the preservation of an important invariant in the representation theory of categories. A sympathetic reader cares because it allows reducing computations to minimal substructures while keeping the rank information intact.

Core claim

If the embedding of a connected subcategory is both initial and final, then the restriction of any module preserves the generalized rank, equivalently the multiplicity of the entire interval modules. Conversely, this rank preservation property characterizes such embeddings when both are posets satisfying mild constraints and the embedding is full. For a poset, the minimal full subposet with an initial or final embedding is described. This extends the generalized rank invariant to small categories.

What carries the argument

Initial and final embeddings of connected subcategories into a category, ensuring that module restriction preserves the generalized rank defined by multiplicities of entire interval modules.

If this is right

Generalized rank remains unchanged when restricting to a subcategory with initial and final embedding.
The minimal subposet can be used to compute the rank invariant equivalently.
Rank preservation serves as a characterization of initial and final embeddings for posets.
The approach applies to general small categories beyond just posets.

Where Pith is reading between the lines

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

This might enable more efficient algorithms for computing invariants by focusing on minimal subposets in practice.
Similar ideas could apply to other categorical invariants like those in persistence theory.
One could verify the result through explicit calculations on finite posets like chains or grids.

Load-bearing premise

The characterization in the converse requires the structures to be posets satisfying mild constraints with a full embedding.

What would settle it

Observe a full embedding of posets with the mild constraints where restricting modules preserves generalized rank but the embedding fails to be initial or final.

read the original abstract

Let $\mathcal{C}$ be a small, connected category with finite hom-sets. We show that if the embedding of a connected subcategory $\mathcal{J}$ is both initial and final, then the restriction of any $\mathcal{C}$-module along $\mathcal{J}$ preserves the generalized rank-or equivalently, the multiplicity of the ``entire" interval modules for $\mathcal{C}$ and $\mathcal{J}$. Conversely, we prove that this property characterizes initial and final embeddings when both $\mathcal{C}$ and $\mathcal{J}$ are posets satisfying certain mild constraints and the embedding is full. For $\mathcal{C}$ a poset under these conditions, we describe the minimal full subposet whose embedding is initial or final. This generalizes an observation made by Dey and Lesnick. We also extend a result of Kinser on the generalized rank invariant to small categories.

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

This paper gives a clean if-and-only-if link between initial/final embeddings and generalized rank preservation for modules over small categories, plus the minimal subposet construction for posets.

read the letter

The main takeaway is that for small connected categories with finite hom-sets, an embedding of a connected subcategory is initial and final precisely when restricting any module along it preserves generalized rank, at least when the objects are posets and the embedding is full. They also describe the smallest full subposet whose embedding has this property. This extends the Dey-Lesnick observation and Kinser's work on the rank invariant to small categories in a direct way. The forward direction follows from the universal properties of initial and final functors on interval decompositions, and the converse uses the stated mild constraints exactly where needed to force the embedding properties from rank preservation. The arguments look direct and avoid circularity or hidden fitting. The paper states the theorems clearly and flags the constraints up front, which is helpful. The minimal-subposet construction is a practical addition for anyone computing ranks on posets. Soft spots are limited. The results stay scoped to connected categories with finite hom-sets, so they do not immediately cover infinite or disconnected cases. The converse requires poset structure and full embeddings, which the authors acknowledge rather than overclaim. Without the full proofs visible here it is hard to check every derivation step, but the stress-test description indicates the logic holds up without extra assumptions. This is aimed at specialists working on representation theory of categories and persistence modules. A reader who needs tools to simplify rank computations or reduce to minimal subposets will find concrete value. It is not broad enough for a general audience. The work shows clear engagement with the literature and the claims are grounded enough to merit referee time. I would send it for peer review.

Referee Report

0 major / 3 minor

Summary. The manuscript proves that for a small connected category C with finite hom-sets, if the embedding of a connected subcategory J is both initial and final, then the restriction of any C-module along J preserves the generalized rank (equivalently, the multiplicity of the entire interval modules for C and J). Conversely, this rank-preservation property characterizes initial and final embeddings when C and J are posets satisfying mild constraints (connectedness, finite hom-sets, fullness of the embedding). For such a poset C the paper constructs the minimal full subposet whose embedding is initial or final, generalizing an observation of Dey and Lesnick, and extends Kinser's result on the generalized rank invariant to small categories.

Significance. If the derivations hold, the work supplies a direct characterization of initial and final embeddings via preservation of generalized rank, obtained from the universal properties of initial and final functors applied to interval decompositions. The explicit invocation of constraints only where needed for the converse, together with the minimal-subposet construction and the extension of Kinser's result, constitute clear contributions to the study of rank invariants for categories and persistence modules.

minor comments (3)

[Abstract] Abstract: the phrase 'certain mild constraints' is left unspecified; briefly listing the three conditions (connectedness, finite hom-sets, and fullness) already used in the converse would improve immediate readability without lengthening the abstract.
The equivalence between generalized-rank preservation and multiplicity of entire interval modules is stated cleanly, but a short reminder of the definition of 'entire' interval modules (or a forward reference to the relevant definition) would help readers who encounter the equivalence before the technical sections.
A single concrete low-dimensional example illustrating the minimal full subposet construction would make the generalization of Dey and Lesnick's observation more tangible for readers.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript, accurate summary of the main results, and recommendation for minor revision. The report correctly identifies the characterization of initial and final embeddings via generalized rank preservation and the construction of minimal full subposets.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper derives the preservation of generalized rank under initial and final embeddings directly from the universal properties of these functors applied to interval decompositions of modules. The converse characterization for posets uses explicit mild constraints (connectedness, finite hom-sets, fullness of embedding) only to ensure rank-preservation forces the embedding to be initial/final, without reducing any quantity to a fitted parameter or self-referential definition. The minimal full subposet construction and extension of Kinser's result follow from the same characterization. All steps are self-contained against the stated definitions and external benchmarks, with no load-bearing self-citations or ansatz smuggling.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on standard definitions of initial and final embeddings in category theory, the notion of generalized rank from Kinser and Dey-Lesnick, and the setup assumptions that C is small, connected, and has finite hom-sets. No free parameters or invented entities appear in the abstract.

axioms (2)

domain assumption C is a small, connected category with finite hom-sets
This is the global setup stated at the start of the abstract for all results.
domain assumption J is a connected subcategory whose embedding is full when C and J are posets
Required for the converse characterization to hold.

pith-pipeline@v0.9.0 · 5670 in / 1367 out tokens · 45458 ms · 2026-05-18T07:49:02.457954+00:00 · methodology

discussion (0)

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

An Algebraic Introduction to Persistence
math.AT 2026-04 unverdicted novelty 2.0

The paper surveys algebraic properties of poset representations and their stability under the interleaving distance in persistence theory.