English
Related papers

Related papers: Initial Algebras Unchained -- A Novel Initial Alge…

200 papers

The Initial Algebra Theorem by Trnkov\'a et al.~states, under mild assumptions, that an endofunctor has an initial algebra provided it has a pre-fixed point. The proof crucially depends on transfinitely iterating the functor and in fact…

Logic in Computer Science · Computer Science 2022-02-15 Jiří Adámek , Stefan Milius , Lawrence S. Moss

An old theorem of Ad\'amek constructs initial algebras for sufficiently cocontinuous endofunctors via transfinite iteration over ordinals in classical set theory. We prove a new version that works in constructive logic, using "inflationary"…

Logic · Mathematics 2022-11-04 Andrew M. Pitts , S. C. Steenkamp

We provide a construction of the fixed points of functors which may not be inital algebras or final coalgebras. For an endofunctor F, this fixed point construction may be expressed as a pair of adjoint functors between F-coalgebras and…

Category Theory · Mathematics 2023-03-06 Ezra Schoen , Jade Master , Clemens Kupke

The purpose of this note is to resolve a conjecture in arXiv:2307.00442(4), regarding the initial algebra for the enrichment endofunctor $(-)\mathbf{Cat}$ over general symmetric monoidal $(\infty, 1)$-categories. We prove that Ad\'amek's…

Category Theory · Mathematics 2024-03-25 Zach Goldthorpe

For endofunctors of varieties preserving intersections, a new description of the final coalgebra and the initial algebra is presented: the former consists of all well-pointed coalgebras. These are the pointed coalgebras having no proper…

Logic in Computer Science · Computer Science 2015-07-01 Jiří Adámek , Stefan Milius , Lawrence S Moss , Lurdes Sousa

Fixed points are a recurring theme in computer science and are often constructed as limits of suitably seeded fixed point iterations. We present the algebra of iterative constructions (AIC) -- a purely algebraic approach to reasoning about…

Logic in Computer Science · Computer Science 2026-05-14 Kevin Batz , Benjamin Lucien Kaminski , Lucas Kehrer , Gerwin Klein , Todd Schmid , Henning Urbat

This paper contributes to a theory of the behaviour of "finite-state" systems that is generic in the system type. We propose that such systems are modelled as coalgebras with a finitely generated carrier for an endofunctor on a locally…

Logic in Computer Science · Computer Science 2019-09-09 Stefan Milius , Dirk Pattinson , Thorsten Wißmann

This paper contributes to a theory of the behaviour of "finite-state" systems that is generic in the system type. We propose that such systems are modeled as coalgebras with a finitely generated carrier for an endofunctor on a locally…

Category Theory · Mathematics 2017-10-23 Stefan Milius , Dirk Pattinson , Thorsten Wißmann

This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules, which constitutes the algebraic version of the vector bundles in differential geometry. We adopt the…

Commutative Algebra · Mathematics 2019-05-08 Henri Lombardi , Claude Quitté

Stable basis algebras were introduced by Fountain and Gould and developed in a series of articles. They form a class of universal algebras, extending that of independence algebras. If a stable basis algebra $\mathbb{B}$ of finite rank…

Rings and Algebras · Mathematics 2019-08-28 Wolfram Bentz , Victoria Gould

This paper studies fundamental questions concerning category-theoretic models of induction and recursion. We are concerned with the relationship between well-founded and recursive coalgebras for an endofunctor. For monomorphism preserving…

Logic in Computer Science · Computer Science 2020-02-18 Jiří Adámek , Stefan Milius , Lawrence S. Moss

K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…

Logic in Computer Science · Computer Science 2026-02-20 Henning Urbat , Thorsten Wißmann

The tensor functor called $\alpha$-induction arises from a Frobenius algebra object, or a Q-system, in a braided unitary fusion category. In the operator algebraic language, it gives extensions of endomorphism of $N$ to $M$ arising from a…

Quantum Algebra · Mathematics 2024-08-12 Yasuyuki Kawahigashi

Coalgebras for an endofunctor provide a category-theoretic framework for modeling a wide range of state-based systems of various types. We provide an iterative construction of the reachable part of a given pointed coalgebra that is inspired…

Category Theory · Mathematics 2020-01-15 Thorsten Wißmann , Stefan Milius , Shin-ya Katsumata , Jérémy Dubut

Let $\sigma$ denote an endomorphism of a smooth algebraic group $G$ over the algebraic closure of a finite field, and assume all iterates of $\sigma$ have finitely many fixed points. Steinberg gave a formula for the number of fixed points…

Number Theory · Mathematics 2024-04-22 Jakub Byszewski , Gunther Cornelissen , Marc Houben

The set of natural integers is fundamental for at least two reasons: it is the free induction algebra over the empty set (and at such allows definitions of maps by primitive recursion) and it is the free monoid over a one-element set, the…

Rings and Algebras · Mathematics 2013-05-15 Laurent Poinsot

Every endofunctor of the category of classes is proved to be set-based in the sense of Aczel and Mendler, therefore, it has a final coalgebra. Other basic properties of these endofunctors are proved, e.g. the existence of a free completely…

Logic in Computer Science · Computer Science 2007-05-23 J. Adamek , S. Milius , J. Velebil

The rational fixed point of a set functor is well-known to capture the behaviour of finite coalgebras. In this paper we consider functors on algebraic categories. For them the rational fixed point may no longer be fully abstract, i.e. a…

Logic in Computer Science · Computer Science 2023-06-22 Stefan Milius

Let $G$ be a reductive algebraic group scheme defined over ${\mathbb F}_{p}$ and $k$ be an algebraically closed field of characteristic $p$. There are two associated families of finite group schemes, the $r$-th Frobenius kernels, denoted by…

Group Theory · Mathematics 2026-04-24 Christopher P. Bendel , Daniel K. Nakano , Cornelius Pillen

Inspired by the perspective of Reyes' noncomutative spectral theory, we attempt to develop noncommutative algebraic geometry by introducing ringed coalgebras, which can be thought of as a noncommutative generalization of schemes over a…

Rings and Algebras · Mathematics 2025-06-18 So Nakamura
‹ Prev 1 2 3 10 Next ›