Diagram (category theory)

In , a branch of mathematics, a diagram is the categorical analogue of an indexed family in set theory. The primary difference is that in the categorical setting one has morphisms that also need indexing. An indexed family of sets is a collection of sets, indexed by a fixed set; equivalently, a function from a fixed index set to the class of sets. A diagram is a collection of objects and morphisms, indexed by a fixed category; equivalently, a functor from a fixed index category to some category. The universal functor of a diagram is the diagonal functor; its right adjoint is the of the diagram and its left adjoint is the colimit. The natural transformation from the diagonal functor to some arbitrary diagram is called a . Formally, a diagram of type J in a C is a (covariant) functor The category J is called the index category or the scheme of the diagram D; the functor is sometimes called a J-shaped diagram. The actual objects and morphisms in J are largely irrelevant; only the way in which they are interrelated matters. The diagram D is thought of as indexing a collection of objects and morphisms in C patterned on J. Although, technically, there is no difference between an individual diagram and a functor or between a scheme and a category, the change in terminology reflects a change in perspective, just as in the set theoretic case: one fixes the index category, and allows the functor (and, secondarily, the target category) to vary. One is most often interested in the case where the scheme J is a or even finite category. A diagram is said to be small or finite whenever J is. A morphism of diagrams of type J in a category C is a natural transformation between functors. One can then interpret the category of diagrams of type J in C as the CJ, and a diagram is then an object in this category. Given any object A in C, one has the constant diagram, which is the diagram that maps all objects in J to A, and all morphisms of J to the identity morphism on A.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (6)

Related people (3)

Related units (4)

Related concepts (17)

Related courses (2)

Related lectures (32)

Span (category theory)

In , a span, roof or correspondence is a generalization of the notion of relation between two of a . When the category has all (and satisfies a small number of other conditions), spans can be considered as morphisms in a . The notion of a span is due to Nobuo Yoneda (1954) and Jean Bénabou (1967). A span is a of type i.e., a diagram of the form . That is, let Λ be the category (-1 ← 0 → +1). Then a span in a category C is a functor S : Λ → C.

Diagonal functor

In , a branch of mathematics, the diagonal functor is given by , which maps as well as morphisms. This functor can be employed to give a succinct alternate description of the product of objects within the : a product is a universal arrow from to . The arrow comprises the projection maps. More generally, given a , one may construct the , the objects of which are called . For each object in , there is a constant diagram that maps every object in to and every morphism in to .

Pushout (category theory)

In , a branch of mathematics, a pushout (also called a fibered coproduct or fibered sum or cocartesian square or amalgamated sum) is the colimit of a consisting of two morphisms f : Z → X and g : Z → Y with a common domain. The pushout consists of an P along with two morphisms X → P and Y → P that complete a commutative square with the two given morphisms f and g. In fact, the defining universal property of the pushout (given below) essentially says that the pushout is the "most general" way to complete this commutative square.

Structuring Wikipedia Articles with Section Recommendations

Robert West, Tiziano Piccardi, Michele Catasta

Sections are the building blocks of Wikipedia articles. They enhance readability and can be used as a structured entry point for creating and expanding articles. Structuring a new or already existing Wikipedia article with sections is a hard task for human ...

ASSOC COMPUTING MACHINERY2018

Combinatorial presentation of multidimensional persistent homology

Martina Scolamiero

A multifiltration is a functor indexed by Nr that maps any morphism to a monomorphism. The goal of this paper is to describe in an explicit and combinatorial way the natural Nr-graded R[x(1),...x(r)]-module structure on the homology of a multifiltration of ...

Elsevier2017

Left-induced model structures and diagram categories

Kathryn Hess Bellwald, Varvara Karpova, Magdalena Kedziorek

We prove existence results à la Jeff Smith for left-induced model category structures, of which the injective model structure on a diagram category is an important example. We further develop the notions of fibrant generation and Postnikov presentation fro ...

2015

MATH-436: Homotopical algebra

This course will provide an introduction to model category theory, which is an abstract framework for generalizing homotopy theory beyond topological spaces and continuous maps. We will study numerous

MATH-506: Topology IV.b - cohomology rings

Singular cohomology is defined by dualizing the singular chain complex for spaces. We will study its basic properties, see how it acquires a multiplicative structure and becomes a graded commutative a

Explores the construction of the free action functor and its equivariance.

Explores the extension property of spaces and the recognition principle for cofibrations.

Covers triangular identities, natural transformations, commutative diagrams, and adjunction notation in group and category theory.