수반 함자
노트
위키데이터
- ID : Q357858
말뭉치
- In category theory, a monad can be constructed from two adjoint functors.[1]
- With a relation on the morphisms of the category of pointed coalgebras we obtain an adjunction between these two functors.[2]
- Adjoint functor theorems give necessary and sufficient conditions for a functor to admit an adjoint.[3]
- In this paper, we prove general adjoint functor theorems for functors between ∞ ‐categories.[3]
- As an application of this result, we recover Lurie's adjoint functor theorems for presentable ∞ ‐categories.[3]
- I think things like the adjoint functor theorem and Brown reprensentability become very reasonable from this point of view.[4]
- There is also a symmetrical “dual” concept of the receiving universal, and the pair of sending and receiving universals is what is given by a pair of adjoint functors.[5]
- Often in an adjunction, one of the universals is the one of interest and the other seems to be more a rather trivial bit of conceptual bookkeeping so that the two will make an adjunction.[5]
- We are trying to give an elementary introduction to the heteromorphic theory of adjoint functors.[5]
- This standard definition of an adjunction makes no mention of the heteromorphisms.[5]
- the Adjoint Functor Theorems (AFTs) aren't as useful as you might think when you first meet them.[6]
- We can also define the counit of the adjunction.[7]
- An adjunction is a pair of functors that interact in a particularly nice way.[8]
- As we'll see next time, an adjunction consists of a pair of functors that satisfy a nearly identical equation.[8]
- A basic result of category theory is that right adjoint functors preserve all limits that exist in their domain, and, dually, left adjoints preserve all colimits.[9]
- It is easy to check that these would be the unit and counit of an adjunction L ⊣ R L\dashv R .[9]
- In the “if” direction, this is an application of the general adjoint functor theorem: any accessible functor satisfies the solution set condition.[9]
- The left adjoint functor of a given functor is uniquely determined up to isomorphism of functors.[10]
- The statement that a functor has a left adjoint if and only if a), b) and c) above holds, is called the Freyd adjoint functor theorem.[10]
- These maps are called the adjunction maps.[11]
- In mathematics, specifically category theory, adjunction is a relationship that two functors may have.[12]
- Two functors that stand in this relationship are known as adjoint functors, one being the left adjoint and the other the right adjoint.[12]
- The slogan is "Adjoint functors arise everywhere".[12]
- The long list of examples in this article indicates that common mathematical constructions are very often adjoint functors.[12]
- We show that this is equivalent to the abstract definition, in terms of an adjunction in the 2-category Cat, in Prop.[13]
- according to Def. , with adjunction units η c \eta_c and adjunction counits ϵ d \epsilon_d according to Def. .[13]
- that the unit of an adjunction and counit of an adjunction plays a special role.[13]
- Proposition (collection of universal arrows equivalent to adjoint functor) Let R : 𝒟 → 𝒞 R \;\colon\; \mathcal{D} \to \mathcal{C} be a functor.[13]
소스
- ↑ What are the adjoint functor pairs corresponding to common monads in Haskell?
- ↑ Repositório UFMG: Path coalgebra as a right adjoint functor
- ↑ 3.0 3.1 3.2 Journal of the London Mathematical Society
- ↑ What is an intuitive view of adjoints? (version 1: category theory)
- ↑ 5.0 5.1 5.2 5.3 Adjoints and emergence: applications of a new theory of adjoint functors
- ↑ How do I check if a functor has a (left/right) adjoint?
- ↑ Bartosz Milewski's Programming Cafe
- ↑ 8.0 8.1 What is an Adjunction? Part 1 (Motivation)
- ↑ 9.0 9.1 9.2 adjoint functor theorem in nLab
- ↑ 10.0 10.1 Encyclopedia of Mathematics
- ↑ Section 4.24 (0036): Adjoint functors—The Stacks project
- ↑ 12.0 12.1 12.2 12.3 Adjoint functors
- ↑ 13.0 13.1 13.2 13.3 adjoint functor in nLab
메타데이터
위키데이터
- ID : Q357858