Applied Categorical Structures最新文献

It is often useful to be able to deal with locales in terms of presentations of their underlying frames, or equivalently, the geometric theories which they classify. Given a presentation for a locale, presentations for its sublocales can be obtained by simply appending additional relations, but the case of quotient locales is more subtle. We provide simple procedures for obtaining presentations of open quotients, proper quotients or general triquotients from presentations of the parent locale. The results are proved with the help of the suplattice, preframe and dcpo coverage theorems and applied to obtain presentations of the circle from ones for (mathbb {R}) and [0, 1].

We study the Yoneda lemma for arbitrary simplicial spaces. We do that by introducing left fibrations of simplicial spaces and studying their associated model structure, the covariant model structure. In particular, we prove a recognition principle for covariant equivalences over an arbitrary simplicial space and invariance of the covariant model structure with respect to complete Segal space equivalences.

Let R be a commutative ring. We introduce the notion of support of a object in an R-linear triangulated category. As an application, we study the non-existence of Bridgeland stability condition on R-linear triangulated categories.

By de Vries duality, the category (textsf {KHaus}) of compact Hausdorff spaces is dually equivalent to the category (textsf {DeV}) of de Vries algebras. There is a similar duality for (textsf {KHaus}), where de Vries algebras are replaced by proximity Baer-Specker algebras. The functor associating with each compact Hausdorff space a proximity Baer-Specker algebra is described by generalizing the notion of a boolean power of a totally ordered domain to that of a de Vries power. It follows that (textsf {DeV}) is equivalent to the category (text {textsf{PBSp}}) of proximity Baer-Specker algebras. The equivalence is obtained by passing through (textsf {KHaus}), and hence is not choice-free. In this paper we give a direct algebraic proof of this equivalence, which is choice-independent. To do so, we give an alternate choice-free description of de Vries powers of a totally ordered domain.

We study how tensor categories can be presented in terms of rigid monoidal categories and Grothendieck topologies and show that such presentations lead to strong universal properties. As the main tool in this study, we define a notion on preadditive categories which plays a role similar to (a generalisation of) the notion of a Grothendieck pretopology on an unenriched category. Each such additive pretopology defines an additive Grothendieck topology and suffices to define the sheaf category. This new notion also allows us to study the noetherian and subcanonical nature of additive topologies, to describe easily the join of a family of additive topologies and to identify useful universal properties of the sheaf category.

We consider profunctors between posets and introduce their graph and ascent. The profunctors (text {Pro}(P,Q)) form themselves a poset, and we consider a partition (mathcal {I}sqcup mathcal {F}) of this into a down-set (mathcal {I}) and up-set (mathcal {F}), called a cut. To elements of (mathcal {F}) we associate their graphs, and to elements of (mathcal {I}) we associate their ascents. Our basic results is that this, suitably refined, preserves being a cut: We get a cut in the Boolean lattice of subsets of the underlying set of (Q times P). Cuts in finite Booleans lattices correspond precisely to finite simplicial complexes. We apply this in commutative algebra where these give classes of Alexander dual square-free monomial ideals giving the full and natural generalized setting of isotonian ideals and letterplace ideals for posets. We study (text {Pro}({mathbb N}, {mathbb N})). Such profunctors identify as order preserving maps (f: {mathbb N}rightarrow {mathbb N}cup {infty }). For our applications when P and Q are infinite, we also introduce a topology on (text {Pro}(P,Q)), in particular on profunctors (text {Pro}({mathbb N},{mathbb N})).

It has been proven by Schupp and Bergman that the inner automorphisms of groups can be characterized purely categorically as those group automorphisms that can be coherently extended along any outgoing homomorphism. One is thus motivated to define a notion of (categorical) inner automorphism in an arbitrary category, as an automorphism that can be coherently extended along any outgoing morphism, and the theory of such automorphisms forms part of the theory of covariant isotropy. In this paper, we prove that the categorical inner automorphisms in any category (textsf{Group}^mathcal {J}) of presheaves of groups can be characterized in terms of conjugation-theoretic inner automorphisms of the component groups, together with a natural automorphism of the identity functor on the index category (mathcal {J}). In fact, we deduce such a characterization from a much more general result characterizing the categorical inner automorphisms in any category (mathbb {T}textsf{mod}^mathcal {J}) of presheaves of (mathbb {T})-models for a suitable first-order theory (mathbb {T}).

Categorical probability has recently seen significant advances through the formalism of Markov categories, within which several classical theorems have been proven in entirely abstract categorical terms. Closely related to Markov categories are gs-monoidal categories, also known as CD categories. These omit a condition that implements the normalization of probability. Extending work of Corradini and Gadducci, we construct free gs-monoidal and free Markov categories generated by a collection of morphisms of arbitrary arity and coarity. For free gs-monoidal categories, this comes in the form of an explicit combinatorial description of their morphisms as structured cospans of labeled hypergraphs. These can be thought of as a formalization of gs-monoidal string diagrams ((=)term graphs) as a combinatorial data structure. We formulate the appropriate 2-categorical universal property based on ideas of Walters and prove that our categories satisfy it. We expect our free categories to be relevant for computer implementations and we also argue that they can be used as statistical causal models generalizing Bayesian networks.

We introduce the notion of a distributive law between a relative monad and a monad. We call this a relative distributive law and define it in any 2-category (mathcal {K}). In order to do that, we introduce the 2-category of relative monads in a 2-category (mathcal {K}) with relative monad morphisms and relative monad transformations as 1- and 2-cells, respectively. We relate our definition to the 2-category of monads in (mathcal {K}) defined by Street. Using this perspective, we prove two Beck-type theorems regarding relative distributive laws. We also describe what does it mean to have Eilenberg–Moore and Kleisli objects in this context and give examples in the 2-category of locally small categories.