tag:blogger.com,1999:blog-11295132.post1997209851283909935..comments2017-04-17T12:25:44.891-07:00Comments on A Neighborhood of Infinity: You Could Have Defined Natural TransformationsDan Piponihttps://plus.google.com/107913314994758123748noreply@blogger.comBlogger7125tag:blogger.com,1999:blog-11295132.post-15295180204471395142008-10-08T01:56:00.000-07:002008-10-08T01:56:00.000-07:00This is a really great blog btw :-) And that'...This is a really great blog btw :-) And that's coming on the heels of many great websites I've stumbled upon these past 2 weeks after discovering Haskell.<BR/><BR/>This post really hit me right where I was coming to terms with some thoughts on functors. My brain always tries to map to the functor concept anytime I have a "function" defined on proper classes (groups to groups, say) and/or anytime I have something that seems to be defined naturally (like defining a group using only general group operations).<BR/><BR/>But I couldn't always map this to a functor! This was very discouraging because those two things I actually care about, whereas the functor definition is just abstract stuff. <BR/><BR/>A common problem I had for example is something like the center of a group. It's a map of type group -> group sending a group to it's center. The set builder definition is as "purely" or "naturally" defined as you could hope, but it is *not* a functor: given a morphism of groups there is really only 1 candidate for the induced morphism of centers, but it isn't a map from center to center (it fails to always lie inside the range).<BR/><BR/>The trick I think is that the center is a functor if you only consider surjections to be morphisms. You can see that this is exactly what you need to deal with the "for all" quantifier in the definition of the center. Likewise, I imagine a quotient group construction instead of a subgroup construction would necessitate throwing away the surjections and keeping the inclusions. I still haven't completely wrapped my head around it, but I'm closer. <BR/><BR/>As per the last comment I'm not sure if the notion of functor always maps nicely to "constructive operations" which feels like a stickier notion involving logic and set theory.dosbootnoreply@blogger.comtag:blogger.com,1999:blog-11295132.post-12437272133179601592008-08-21T14:42:00.000-07:002008-08-21T14:42:00.000-07:00So, what is the definition of a natural transforma...So, what is the definition of a natural transformation unfolded in the category Vect of vectorspaces over a fixed field k?<BR/><BR/>I suspect for A to be a natural transformation in Vect it has to be defined in a polymorphic way only using scalar multiplication and vector addition, i.e. everything of the Haskell type (Vec a) => a -> a, with Vec being a suitable typeclass containing zero, add and mult.<BR/><BR/>Am I correct?Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-11295132.post-83848643633865555302008-07-15T07:42:00.000-07:002008-07-15T07:42:00.000-07:00Thanks for the help in my struggles with category ...Thanks for the help in my struggles with category theory . :P .Much appreciated .Dannoreply@blogger.comtag:blogger.com,1999:blog-11295132.post-85500061808177556312008-06-14T07:03:00.000-07:002008-06-14T07:03:00.000-07:00Sean,Yes, well spotted.Sean,<BR/><BR/>Yes, well spotted.sigfpehttp://www.blogger.com/profile/08096190433222340957noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-63728076666936089902008-06-14T04:03:00.000-07:002008-06-14T04:03:00.000-07:00In that first set of functions, is that supposed t...In that first set of functions, is that supposed to be <B>g</B>(x,y) = x?Sean Leatherhttp://www.blogger.com/profile/02951502639017426632noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-71468563763560614802008-05-06T18:11:00.000-07:002008-05-06T18:11:00.000-07:00"But how can we say something like this in the lan..."But how can we say something like this in the language of set theory, say? Set theory doesn't come with a mechanism for making such promises."<BR/><BR/>You can define such "functions" in ZF, although they are not called functions. The powerset (set of subsets) or an ordered pair are basic examples. In Mizar they are called <A HREF="http://mizar.uwb.edu.pl/forum/archive/0805/msg00006.html" REL="nofollow">"functors"</A>.slawekkhttp://slawekk.wordpress.com/noreply@blogger.comtag:blogger.com,1999:blog-11295132.post-49776996454419681142008-05-04T15:32:00.000-07:002008-05-04T15:32:00.000-07:00Indeed, historically natural transformations were ...Indeed, historically natural transformations were defined before functors or categories - 1942 versus 1945. Eilenberg and Mac Lane started with natural transformations in the category of groups, and then took three years to find the appropriate language to describe them elsewhere.Mileshttp://www.blogger.com/profile/07136909835648629963noreply@blogger.com