"표현 가능 함자"의 두 판 사이의 차이

수학노트
둘러보기로 가기 검색하러 가기
(→‎메타데이터: 새 문단)
 
25번째 줄: 25번째 줄:
 
  <references />
 
  <references />
  
−
== 메타데이터 ==
+
==메타데이터==
−
 
 
 
===위키데이터===
 
===위키데이터===
 
* ID :  [https://www.wikidata.org/wiki/Q386320 Q386320]
 
* ID :  [https://www.wikidata.org/wiki/Q386320 Q386320]
 +
===Spacy 패턴 목록===
 +
* [{'LOWER': 'representable'}, {'LEMMA': 'functor'}]

2021년 2월 17일 (수) 01:14 기준 최신판

노트

위키데이터

말뭉치

  1. Let’s use this idea to guide us to finding some simple representable functors.[1]
  2. So we can actually build out applicatives from a representable functor.[1]
  3. convinced you that representable functors are interesting, remember, we were able to build all of this from a simple isomorphism with Hom .[1]
  4. Formally, there’s an isomorphism from any Representable Functor to Reader.[2]
  5. This package provides representable functors for haskell.[3]
  6. Today I want to discuss representable functors and Yondea's lemma which is, for example, used a lot in modern Algebraic Geometry.[4]
  7. We begin with the definition of a representable functor.[4]
  8. In a nutshell, this result says that representable functors are the same as group objects in , and that representable functors are the same as commutative group objects in .[4]
  9. The concept of a representable functor arose first in algebraic geometry (cf.[5]
  10. Representable functors occur in many branches of mathematics besides algebraic geometry.[5]
  11. The theorem (above) characterizing natural transformations from a representable functor to an arbitrary functor is commonly called the Yoneda lemma.[5]
  12. Representable functors are naturally isomorphic to Hom functors and therefore share their properties.[6]
  13. In particular, (covariant) representable functors preserve all limits.[6]
  14. Let’s analyze the definition of the representable functor from this perspective.[7]
  15. In the same vein we can think of representable functors as containers for storing memoized results of function calls (the members of hom-sets in Haskell are just functions).[7]
  16. Finally, notice that a representable functor gives us two different implementations of the same thing — one a function, one a data structure.[7]
  17. We will show that a functor that is a sheaf for the Zariski topology and has an open covering by representable functors is itself representable.[8]
  18. A query discussion on differences between representable functor and representation of a functor is archived here.[9]

소스

  1. ↑ 이동: 1.0 1.1 1.2 Representable Functors
  2. ↑ Laziness with Representable Functors
  3. ↑ ekmett/representable-functors: representable functors
  4. ↑ 이동: 4.0 4.1 4.2 Fun With Representable Functors, or Why I Like Yondea's Lemma.
  5. ↑ 이동: 5.0 5.1 5.2 Encyclopedia of Mathematics
  6. ↑ 이동: 6.0 6.1 Representable functor
  7. ↑ 이동: 7.0 7.1 7.2 Bartosz Milewski's Programming Cafe
  8. ↑ Representable Functors
  9. ↑ representable functor in nLab

메타데이터

위키데이터

Spacy 패턴 목록

  • [{'LOWER': 'representable'}, {'LEMMA': 'functor'}]
원본 주소 "https://wiki.mathnt.net/index.php?title=표현_가능_함자&oldid=51310"