Related papers: Yoneda lemma

Yoneda'e Lemma is about the canonical isomorphism of all the natural transformations from a given representable covariant (contravariant, reps.) functor (from a locally small category to the category of sets) to a covariant (contravariant,…

We prove the Yoneda lemma inside an elementary higher topos, generalizing the Yonda lemma for spaces.

We present a version of enriched Yoneda lemma for conventional (not infinity-) categories. We require the base monoidal category to have colimits, but do not require it to be closed or symmetric monoidal.

We show that the Yoneda embedding extends to an $(\infty,2)$-natural transformation. Furthermore, as such, it is uniquely determined by its value at the trivial $\infty$-category. We also study the naturality of the Yoneda lemma in its…

We continue the study of enriched infinity categories, using a definition equivalent to that of Gepner and Haugseng. In our approach enriched infinity categories are associative monoids in an especially designed monoidal category of…

Categorical supermaps generalise higher-order quantum operations from finite-dimensional quantum theory to arbitrary circuit theories. In this paper, we establish the Yoneda lemma for categorical supermaps, which states that whenever a…

Everyone knows that if you have a bivariant homology theory satisfying a base change formula, you get an representation of a category of correspondences. For theories in which the covariant and contravariant transfer maps are in mutual…

We state a Yoneda-type lemma which leads to various functor categories being compact closed.

Combinatorial categories satisfy a stronger form of Yoneda Lemma, namely, the isomorphism type of an object can be recovered by counting the number of homomorphisms from all other objects into it. In this work, we show that this property…

This is the first of a series of papers on enriched infinity categories, seeking to reduce enriched higher category theory to the higher algebra of presentable infinity categories, which is better understood and can be approached via…

We construct set-valued right Kan-extensions via a relative Yoneda Lemma.

The study of abstraction and composition - the focus of category theory - naturally leads to sophisticated diagrams which can encode complex algebraic semantics. Consequently, these diagrams facilitate a clearer visual comprehension of…

We show that, for a right exact functor from an abelian category to abelian groups, Yoneda's isomorphism commutes with homology and, hence, with functor derivation. Then we extend this result to semiabelian domains. An interpretation in…

For a monoidal $\infty$-category $\mathcal{M}$ with colimits, we study colimits of $\mathcal{M}$-functors $\mathcal{A}\to\mathcal{B}$ where $\mathcal{B}$ is left-tensored over $\mathcal{M}$ and $\mathcal{A}$ is an $\mathcal{M}$-enriched…

Let A be a connected graded noncommutative monomial algebra. We associate to A a finite graph \Gamma(A) called the CPS graph of A. Finiteness properties of the Yoneda algebra Ext_A(k,k) including Noetherianity, finite GK dimension, and…

We study the Yoneda lemma for arbitrary simplicial spaces. We do that by introducing left fibrations of simplicial spaces and and studying its associated model structure, the covariant model structure. In particular, we prove a recognition…

We make Hinich's $\infty$-categorical enriched Yoneda embedding natural. To do so, we exhibit it as the unit of a partial adjunction between the functor taking enriched presheaves and Heine's functor taking a tensored category to an…

We prove an extension of the Regularity Lemma with vertex and edge weights which can be applied for a large class of graphs. The applications involve random graphs and a weighted version of the Erd\H{o}s-Stone theorem. We also provide means…

Goda showed that the twisted Alexander polynomial can be recovered from the zeta function of a matrix-weighted graph. Motivated by this, we study transformations of weighted graphs that preserve this zeta function, introducing a notion of…

Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower…