Schreier split epimorphisms between monoids

We explore some properties of Schreier split epimorphisms between monoids, which correspond to monoid actions. In particular, we prove that the split short five lemma holds for monoids, when it is restricted to Schreier split epimorphisms, and that any Schreier reflexive relation is transitive, partially recovering in monoids a classical property of Mal’tsev varieties.     

A Spectral-style Duality for Distributive Posets

In this paper, we present a topological duality for a category of partially ordered sets that satisfy a distributivity condition studied by David and Erné. We call these posets mo-distributive. Our duality extends a duality given by David and Erné because our category of spaces has the same objects as theirs but the class of morphisms that we consider strictly includes their morphisms. As a consequence of our duality, the duality of David and Erné easily follows. Using the dual spaces of the mo-distributive posets we prove the existence of a particular Δ₁-completion for mo-distributive posets that might be different from the canonical extension. This allows us to show that the canonical extension of a distributive meet-semilattice is a completely distributive algebraic lattice.     

Ergodicity and mixing of non-commuting epimorphisms

We study mixing properties of epimorphisms of a compact connectedfinite-dimensional abelian group X. In particular, we show thata set F, with |F| > dim X, of epimorphisms of X is mixingif and only if every subset of F of cardinality (dim X) + 1is mixing. We also construct examples of free non-abelian groupsof automorphisms of tori which are mixing, but not mixing oforder 3, and show that, under some irreducibility assumptions,ergodic groups of automorphisms contain mixing subgroups andfree non-abelian mixing subsemigroups.     

Interval-Valued Rank in Finite Ordered Sets

We consider the concept of rank as a measure of the vertical levels and positions of elements of partially ordered sets (posets). We are motivated by the need for algorithmic measures on large, real-world hierarchically-structured data objects like the semantic hierarchies of ontological databases. These rarely satisfy the strong property of gradedness, which is required for traditional rank functions to exist. Representing such semantic hierarchies as finite, bounded posets, we recognize the duality of ordered structures to motivate rank functions with respect to verticality both from the bottom and from the top. Our rank functions are thus interval-valued, and always exist, even for non-graded posets, providing order homomorphisms to an interval order on the interval-valued ranks. The concept of rank width arises naturally, allowing us to identify the poset region with point-valued width as its longest graded portion (which we call the “spindle”). A standard interval rank function is naturally motivated both in terms of its extremality and on pragmatic grounds. Its properties are examined, including the relationship to traditional grading and rank functions, and methods to assess comparisons of standard interval-valued ranks.     

On fixpoint objects and gluing constructions

This article has two parts: in the first part, we present some general results about fixpoint objects. The minimal categorical structure required to model soundly the equational type theory which combines higher order recursion and computation types (introduced by Crole and Pitts (1992)) is shown to be precisely a let-category possessing a fixpoint object. Functional completeness for such categories is developed. We also prove that categories with fixpoint operators do not necessarily have a fixpoint object.In the second part, we extend Freyd's gluing construction for cartesian closed categories to cartesian closed let-categories, and observe that this extension does not obviously apply to categories possessing fixpoint objects. We solve this problem by giving a new gluing construction for a limited class of categories with fixpoint objects; this is the main result of the paper. We use this category-theoretic construction to prove a type-theoretic conservative extension result.     

A category of association schemes

We define a category of association schemes and investigate its basic properties. We characterize monomorphisms and epimorphisms in our category. The category is not balanced. The category has kernels, cokernels, and epimorphic images. The category is not an exact category, but we consider exact sequences. Finally, we consider a full subcategory of our category and show that it is equivalent to the category of finite groups.     

Fundamental groupoids for simplicial objects in Mal'tsev categories

We show that the category of internal groupoids in an exact Mal'tsev category is reflective, and, moreover, a Birkhoff subcategory of the category of simplicial objects. We then characterize the central extensions of the corresponding Galois structure, and show that regular epimorphisms admit a relative monotone-light factorization system in the sense of Chikhladze. We also draw some comparison with Kan complexes. By comparing the reflections of simplicial objects and reflexive graphs into groupoids, we exhibit a connection with weighted commutators (as defined by Gran, Janelidze and Ursini).     

Separation and Epimorphisms in Quasi-Uniform Spaces

We study some categorical aspects of quasi-uniform spaces (mainly separation and epimorphisms) via closure operators in the sense of Dikranjan, Giuli, and Tholen. In order to exploit better the corresponding properties known for topological spaces we describe the behaviour of closure operators under the lifting along the forgetful functor T from quasi-uniform spaces to topological spaces. By means of appropriate closure operators we compute the epimorphisms of many categories of quasi-uniform spaces defined by means of separation axioms and study the preservation (reflection) of epimorphisms under the functor T.     

Prime, irreducible elements and coatoms in posets

In this paper, some properties of prime elements, pseudoprime elements, irreducible elements and coatoms in posets are investigated. We show that the four kinds of elements are equivalent to each other in finite Boolean posets. Furthermore, we demonstrate that every element of a finite Boolean poset can be represented by one kind of them. The example presented in this paper indicates that this result may not hold in every finite poset, but all the irreducible elements are proved to be contained in each order generating set. Finally, the multiplicative auxiliary relation on posets and the notion of arithmetic poset are introduced, and some properties about them are generalized to posets.     

Comparing material and structural set theories

We study elementary theories of well-pointed toposes and pretoposes, regarded as category-theoretic or “structural” set theories in the spirit of Lawvere's “Elementary Theory of the Category of Sets”. We consider weak intuitionistic and predicative theories of pretoposes, and we also propose category-theoretic versions of stronger axioms such as unbounded separation, replacement, and collection. Finally, we compare all of these theories formally to traditional membership-based or “material” set theories, using a version of the classical construction based on internal well-founded relations.