"요네다 보조정리"의 두 판 사이의 차이
둘러보기로 가기
검색하러 가기
Pythagoras0 (토론 | 기여) (→노트: 새 문단) |
Pythagoras0 (토론 | 기여) |
||
| (같은 사용자의 중간 판 하나는 보이지 않습니다) | |||
| 47번째 줄: | 47번째 줄: | ||
===소스=== | ===소스=== | ||
<references /> | <references /> | ||
| + | |||
| + | ==메타데이터== | ||
| + | ===위키데이터=== | ||
| + | * ID : [https://www.wikidata.org/wiki/Q320577 Q320577] | ||
| + | ===Spacy 패턴 목록=== | ||
| + | * [{'LOWER': 'yoneda'}, {'LEMMA': 'lemma'}] | ||
| + | * [{'LOWER': 'yoneda'}, {'LEMMA': 'embed'}] | ||
2021년 2월 17일 (수) 01:21 기준 최신판
노트
위키데이터
- ID : Q320577
말뭉치
- Almost identically, there’s a contravariant Yoneda Lemma, saying that for every contravariant functor .[1]
- I’ll come back tomorrow to try explaining what the Yoneda Lemma means.[1]
- It turns out to be a fairly direct application of the Yoneda Lemma, arguably the most important result in category theory.[2]
- For a locally small category, the Yoneda embedding is the functor sending an object to the contravariant functor and sending a morphism to the natural transformation given by composition.[3]
- The Yoneda lemma shows that an object in a category is determined up to isomorphism by the presheaf it represents.[3]
- The Yoneda lemma tells us, roughly speaking, that an object is determined by its generalized points.[3]
- The Yoneda lemma in this case says that a downward closed set contains if and only if it contains .[3]
- Before this, I didn’t have any relevant concrete examples to think about the Yoneda Lemma.[4]
- In a series of blog posts, I want to relay the example of affine group schemes and try to explain the Yoneda Lemma with this example.[4]
- I only assume that the reader has heard of the Yoneda Lemma and will briefly recall its statement in the text.[4]
- Conversely, it might also serve to provide some insight into the Yoneda Lemma.[5]
- Firstly, in CAT, the Yoneda embedding y X y_X exists only for locally small X X .[6]
- With this structure we can naturally state the Yoneda lemma in a 2-category.[6]
- So we have used the Yoneda lemma as a definition of the hom-functors A ( a , 1 ) A(a,1) ; the axiom asserts their existence.[6]
- This dual statement is also sometimes known as the Yoneda lemma.[7]
- If you can write that much down, the Yoneda Lemma says that you’ve got a “space” with geometry to work with.[8]
- What it means for a variety to be modular comes from these Galois actions, and none of it would be possible without the Yoneda Lemma shaping how we think about spaces![8]
- Yoneda lemma says that every category can be thought as a full subcategory of generalized algebras over generalized signatures.[9]
- Welcome to our third and final installment on the Yoneda lemma![10]
- The Yoneda lemma gives us surjectivity.[10]
- The Yoneda lemma is sometimes described as a generalization of Cayley's theorem from group theory.[10]
- At those links, you'll notice that there's a third classic corollary of the Yoneda lemma, which we did not cover in this series.[10]
- The Yoneda lemma stands out in this respect as a sweeping statement about categories in general with little or no precedent in other branches of mathematics.[11]
- The Yoneda lemma tells us that a natural transformation between a hom-functor and any other functor F is completely determined by specifying the value of its single component at just one point![11]
- So let’s review the naturality condition between the two functors involved in the Yoneda lemma.[11]
- And here’s where the magic of the Yoneda lemma happens: g can be viewed as a point p' in the set C(a, a) .[11]
- Furthermore, we compare our notion with the notion of category left-tensored over M , and prove a version of Yoneda lemma in this context.[12]
- We apply the Yoneda lemma to the study of correspondences of enriched (for instance, higher) ∞-categories.[12]
- The Yoneda lemma is usually the first serious challenge, because to understand it, you have to be able to juggle several things in your mind at once.[13]
- That, by the way, answers our other question about the dependence on the choice of A in the Yoneda embedding.[13]
- But in practice it’s more convenient to skip the middle man and define natural transformations in the Yoneda lemma as going directly from these morphisms to F(X).[13]
- The Yoneda lemma tells us exactly how to construct such natural transformations.[13]
- Now the Yoneda lemma becomes the following observation.[14]
- The Yoneda lemma has the following direct consequences.[15]
- The assumption of naturality is necessary for the Yoneda lemma to hold.[15]
- The Yoneda lemma is effectively the reason that Isbell conjugation exists.[15]
- The Yoneda embedding essentially states that for every (locally small) category, objects in that category can be represented by presheaves, in a full and faithful manner.[16]
- {C} \to \mathbf {Sets} } the following formulas are all formulations of the Yoneda lemma.[16]
- As stated above, the Yoneda lemma may be considered as a vast generalization of Cayley's theorem from group theory.[16]
- In order to comprehend the Yoneda embedding, the more elaborate categorical notions of representable functors are needed.[17]
- The Yoneda lemma is an abstract result on functors of the type morphisms into a fixed object, which allows the embedding of any category into a category of functors defined on that category.[17]
소스
- ↑ 1.0 1.1 The Unapologetic Mathematician
- ↑ What You Needa Know About Yoneda: Profunctor Optics and the Yoneda Lemma
- ↑ 3.0 3.1 3.2 3.3 The Yoneda lemma I
- ↑ 4.0 4.1 4.2 The Relevance of the Yoneda Lemma and the Importance of Examples – Part 1
- ↑ What you needa know about Yoneda: profunctor optics and the Yoneda lemma (functional pearl)
- ↑ 6.0 6.1 6.2 The n-Category Café
- ↑ Art of Problem Solving
- ↑ 8.0 8.1 The Brilliance of the Yoneda Lemma
- ↑ Can someone explain the Yoneda Lemma to an applied mathematician?
- ↑ 10.0 10.1 10.2 10.3 The Yoneda Lemma
- ↑ 11.0 11.1 11.2 11.3 Bartosz Milewski's Programming Cafe
- ↑ 12.0 12.1 Yoneda lemma for enriched ∞-categories
- ↑ 13.0 13.1 13.2 13.3 Understanding Yoneda
- ↑ “Philosophical” meaning of the Yoneda Lemma
- ↑ 15.0 15.1 15.2 Yoneda lemma in nLab
- ↑ 16.0 16.1 16.2 Yoneda lemma
- ↑ 17.0 17.1 Yoneda Philosophy in Engineering
메타데이터
위키데이터
- ID : Q320577
Spacy 패턴 목록
- [{'LOWER': 'yoneda'}, {'LEMMA': 'lemma'}]
- [{'LOWER': 'yoneda'}, {'LEMMA': 'embed'}]