Skip to content
DraconiticResearch
Search Sources API
193,349 studies31 sourcesUpdated 29 min ago
PreprintarXiv licencearXiv

Initial Subcategories via Free Presentations of the Constant Functor

Abstract

Let π’ž be a small category. We characterize the full initial subcategories of π’ž as precisely those whose representables give a free presentation of the constant functor Ξ”π’žπ•‚:π’žβ†’Vect. Such a presentation yields a formula for the limit of any functor π’ž β†’ Vect as the kernel of a morphism between products of evaluations. When the linearized endomorphism ring of every object is local, we show that a minimal free presentation, whenever one exists, determines the unique minimal full initial subcategory, up to equivalence. Bass's characterization of perfect rings gives a sufficient condition for the existence of such presentations. In particular, every finite category with no nonidentity endomorphisms, such as a finite poset, contains a unique minimal initial full subcategory. In the poset case, our results recover the minimal initial subposet constructed in [BDL27] and [DL26]. When π’ž is the free category on a finite quiver, we give an explicit construction of its minimal initial full subcategories, show that every such subcategory arises from this construction, and provide algorithms with time-complexity bounds.

Related

  1. Dimension-free weak (1,1) estimates for Riesz transforms with constant drift
    Suman Mukherjee
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  2. The Waldschmidt constant of square-free principal Borel ideals
    Ajay Kumar, Rajiv Kumar, Paramhans Kushwaha
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  3. A Reynolds-Semi-Robust, Globally Divergence-Free E-HDG/IMEX-SAV Method for Variational Initial-State Data Assimilation of the Navier-Stokes Equations
    Ya Min, Xian Zhang, Xiaoping Xie
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  4. Initial condition recovery in nonlinear damped viscous photoacoustic tomography using a convolutional neural network-guided gradient-free optimization framework
    Madhu Gupta, Anwesa Dey, Prapti Tala +1
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  5. A Dimension-Free Bound on the PoincarΓ© Constant of Isotropic Log-Concave Measures
    Krishnakumar Balasubramanian, Shiva Kasiviswanathan
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsGeometry & topologyarXiv
BibTeX
@misc{brustle2026initial,
  title = {{Initial Subcategories via Free Presentations of the Constant Functor}},
  author = {Thomas BrΓΌstle and Justin Desrochers and Samuel Leblanc},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.41068},
  eprint = {2610.41068},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.41068},
}
RIS
TY  - UNPB
TI  - Initial Subcategories via Free Presentations of the Constant Functor
AU  - Thomas BrΓΌstle
AU  - Justin Desrochers
AU  - Samuel Leblanc
PY  - 2026
DA  - 2026/10/29
PB  - arXiv
DO  - 10.48550/arxiv.2610.41068
UR  - https://arxiv.org/abs/2610.41068
AB  - Let π’ž be a small category. We characterize the full initial subcategories of π’ž as precisely those whose representables give a free presentation of the constant functor Ξ”_π’žπ•‚:π’žβ†’Vect. Such a presentation yields a formula for the limit of any functor π’ž β†’ Vect as the kernel of a morphism between products of evaluations. When the linearized endomorphism ring of every object is local, we show that a minimal free presentation, whenever one exists, determines the unique minimal full initial subcategory, up to equivalence. Bass's characterization of perfect rings gives a sufficient condition for the existence of such presentations. In particular, every finite category with no nonidentity endomorphisms, such as a finite poset, contains a unique minimal initial full subcategory. In the poset case, our results recover the minimal initial subposet constructed in [BDL27] and [DL26]. When π’ž is the free category on a finite quiver, we give an explicit construction of its minimal initial full subcategories, show that every such subcategory arises from this construction, and provide algorithms with time-complexity bounds.
ER  -