Related papers: An Initial Algebra Theorem Without Iteration

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…

In this paper we derive some basic results of circuit theory using `Implicit Linear Algebra' (ILA). This approach has the advantage of simplicity and generality. Implicit linear algebra is outlined in [1]. We denote the space of all vectors…

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…

This paper contributes to the Alpay Algebra by demonstrating that the stable outcome of a self referential process, obtained by iterating a transformation through all ordinal stages, is identical to the unique equilibrium of an unbounded…

For every finitary set functor F we demonstrate that free algebras carry a canonical partial order. In case F is bicontinuous, we prove that the cpo obtained as the conservative completion of the free algebra is the free completely…

The coincidence between initial algebras (IAs) and final coalgebras (FCs) is a phenomenon that underpins various important results in theoretical computer science. In this paper, we identify a general fibrational condition for the IA-FC…

We give a new proof of the fundamental theorem of algebra. It is entirely elementary, focused on using long division to its fullest extent. Further, the method quickly recovers a more general version of the theorem recently obtained by…

We extend two well-known results on primitive ideals in enveloping algebras of semisimple Lie algebras, the `Irreducibility theorem' and `Duflo theorem', to much wider classes of algebras. Our general version of Irreducibility theorem says…

This note is devoted to two classical theorems: the open mapping theorem for analytic functions (OMT) and the fundamental theorem of algebra (FTA). We present a new proof of the first theorem, and then derive the second one by a simple…

Many proofs of the Fundamental Theorem of Algebra, including various proofs based on the theory of analytic functions of a complex variable, are known. To the best of our knowledge, this proof is different from the existing ones.

For every finitary monad $T$ on sets and every endofunctor $F$ on the category of $T$-algebras we introduce the concept of an ffg-Elgot algebra for $F$, that is, an algebra admitting coherent solutions for finite systems of recursive…

We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…

The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…

Many proofs of the fundamental theorem of algebra rely on the fact that the minimum of the modulus of a complex polynomial over the complex plane is attained at some complex number. The proof then follows by arguing the minimum value is…

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…

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…

The elementary affine lambda-calculus was introduced as a polyvalent setting for implicit computational complexity, allowing for characterizations of polynomial time and hyperexponential time predicates. But these results rely on type…

We prove the non-abelian Poincare lemma in higher gauge theory in two different ways. The first method uses a result by Jacobowitz which states solvability conditions for differential equations of a certain type. The second method extends a…

This short note gives a positive answer to an old question in elementary probability theory that arose in Furstenberg's seminal article "Disjointness in Ergodic Theory." As a consequence, Furstenberg's filtering theorem holds without any…

To, say, a proper algebraic or holomorphic space $X/S$, and a coherent sheaf ${\mathcal F}$ on $X$ we identify a functorial ideal, the fitted flatifier, blowing up sequentially in which leads to a flattening of the proper transform of…