Re: Haskell-Cafe Digest, Vol 10, Issue 3

G'day all. Good day to you too.
I don't know what you mean by "more complex". A dot is just a dot, and it has no internal structure that we can get at using category theory alone. Some dots may play specific roles in relation to other dots and arrows, but no dot is any more complex than any other, >really. Well, intuitvively seen, I meant. In some categories, the dot might stand for a functor, and in some other as a simple object.
For a counter-example, think of the dual category Set^{op}. A morphism f : a -> b in that category means that there is a function f^{op} : b -> a
where a and b are sets, however f probably isn't a function at all. Well, what is it then?
In a category which is a partial order, there is a morphism f : a -> b if and only if a <= b. (Or is it a => b? Can never remember.) Here, the morphisms really have no internal structure at all. If the category has a finite number of objects, you can represent the whole thing using a bit matrix, and each morphism can be identified with >a bit set to "true". Preserving internal structure is not much more than
I think the problem here is that you have the idea that a morphism is a process that turns one object into another. In many >(probably most) interesting, practically significant cases, that's true, but it need not be. Well, I think I don't know what a function is, because
I see a function as something where you put something in and you get a result. In this case, you already say, there is a morphism b->a, wel than the following of b to a and return a then is a function? A couple of days ago, I thought of the distinction between a function and a morphism, as in that a function operates on a hole set of objects, a.k.a. domain. And a morphism only on one. Is that the distinction you mean? If all of the above is false, then probably I don't know what a function is. (It looks like the more you are busy with things, the less you seem to know of it). preservation of composition, right? the following of an arrow, represents at least for me a clear mapping of turning one object in to another. Or do you mean things like in logic, that you can see the morphism, as relations (instances of axioms) between logic objects. So the morphism a->b would mean that a implicates b. This way, the arrow is not a process of turning an a into a b. Hmm, that seems logical.
I think it really helps to try to understand category theory mostly as a language for talking about things, and not necessarily "things" in and of themselves. Using this understanding, a morphism is a noun, not a verb. It's a concrete thing describing a relationship between objects, not necessarily an action that you perform on objects. I think you have already answered my question this way. But a confirmation would be nice. It seems I had to read your explanation >1 time.
I don't know if any of this helps or not. Well, it certainly helps.
Then the multiplication issue: Is the following a good summary? A multiplication is just a name for an operation that is defined or not defined for each mathematical construction in terms of to which laws the operation should comply. The laws are then things like communativity and so on. Regards, Ron __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

First, concerning your question about monads and multiplication: a monad on category C is exactly a monoid object in the category [C->C] of endofunctors on C, and natural transformations between them. A monoid in a category is, as you expect, an object X with arrows m:X*X->X and u:1->X satisfying some laws, where * is the monoidal tensor and 1 is its unit. In [C->C], * is functor composition and 1 is the identity functor; so m becomes `join' and u becomes `return'. See the Example at the bottom of page 75 in Chapter 4 of [1]. On Jun 10, 2004, at 4:23 PM, Ron de Bruijn wrote:
For a counter-example, think of the dual category Set^{op}. A morphism f : a -> b in that category means that there is a function f^{op} : b -> a
where a and b are sets, however f probably isn't a function at all. Well, what is it then?
The short answer is: it's the formal dual of a function, and that's all. You will have to get used to this fact about categorical duality, that it's just a formal construction and has no deep meaning in and of itself. The short long answer is: it's an antifunction, or a predicate transformer (I think). What is an antifunction? Well, if you factor a function as a surjection followed by a bijection followed by an injection (as you can always do uniquely in Set using image factorization), then you can understand a function as something which identifies, then renames, then adjoins elements of a set. If you turn this map around, and look at what happens to the elements on their way home, you can see that what happens is some elements get deleted, then renamed and then copied. So a function identifies, renames and adjoins while an antifunction deletes, renames and copies. To formalize this perspective, you can view a(n antiset) as a boolean algebra using the faithful embedding of Set^{op} in Set via the contravariant powerfunctor. The action on arrows turns an antifunction into what I imagine is called a predicate transformer. This is nicely explained in Vaughan Pratt's paper [2] which, BTW, is about the Chu construction which I mentioned in my last post to Jerzy.
Is the following a good summary? A multiplication is just a name for an operation that is defined or not defined for each mathematical construction in terms of to which laws the operation should comply. The laws are then things like communativity and so on.
Multiplication is just a name often used for any operation which is typically but not always associative and has right and left units, and is perhaps also commutative. Addition is exactly the same. If one has two operations which satisfy these properties, then one often distinguishes them by saying one is "addition" and the other is "multiplication". It is all informal convention; the important things are the laws. [1] Andrea Asperti and Giuseppe Longo. Categories, Types and Structures. 1990. Available here: http://www.di.ens.fr/users/longo/download.html [2] Vaughan Pratt. The Stone Gamut: A Coordinatization of Mathematics. In Proc. LICS '95, 1995. http://boole.stanford.edu/pub/gamut.ps.gz Regards, Frank
participants (2)
-
Frank Atanassow
-
Ron de Bruijn