You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
I blogged about how you can get runs of Euler's method by taking free categories:
That was fun to read. Is it true that a [stationary point or cycle] corresponds to a faithful inclusion of into the resulting free category; if not, in what ways can that fail?
Very cool! :) this begs the question: what happens as ? Euler's method converges to the true solution, does the category 'converge' to a category where
It seems reasonable!
On a related note (which might help to answer the above question of mine), one might also construct the category as the 'actor category' of a discretized version of the flow of the vector field defining the ODE on .
Let me explain.
The actor category associated to an action of a monoid on a set is the category whose set of objects is and whose morphisms are elements such that .
If one starts with a nice enough ODE, its flow is a monoidal action of on : it brings a point to the point you get if you let the ODE start at and then 'wait' for units of time. This action can easily be discretized: choose a stepsize , you get an action of on generated by posing , as in your blog post. In fact, we could call these the 'Euler's actions' associated to a given ODE.
Actually, once is chosen, there a lot of possible discretizations, each encoded by a functor between the (sub)category of -actions and the (sub)category of -actions on . I conjecture each corresponds to a numerical integration method with fixed stepsize.
Sorry to be skeptical here, but since the core of Euler's method, i.e. is taken as given, this just amounts to saying you can do iteration via the Free Category construction - which is quite well-known. I came here to find out a categorical construction of that 'core'. That would have been quite fascinating indeed.
It might be more honest to rephrase this as 'Iterative Method as a Free Category', with Euler's Method as an application.
[Mod] Morgan Rogers said:
That was fun to read. Is it true that a [stationary point or cycle] corresponds to a faithful inclusion of into the resulting free category; if not, in what ways can that fail?
Yes that sounds right to me! I'm not sure your very likely to get cycles which line up exactly...but if you did it would look like a copy of .
Matteo Capucci said:
Very cool! :) this begs the question: what happens as ? Euler's method converges to the true solution, does the category 'converge' to a category where
- objects are points of and
- morphisms are 'arcs of solutions' from to ?
It seems reasonable!
On a related note (which might help to answer the above question of mine), one might also construct the category as the 'actor category' of a discretized version of the flow of the vector field defining the ODE on .
Let me explain.
The actor category associated to an action of a monoid on a set is the category whose set of objects is and whose morphisms are elements such that .
If one starts with a nice enough ODE, its flow is a monoidal action of on : it brings a point to the point you get if you let the ODE start at and then 'wait' for units of time. This action can easily be discretized: choose a stepsize , you get an action of on generated by posing , as in your blog post. In fact, we could call these the 'Euler's actions' associated to a given ODE.
Yeah this is a really nice question. If you let h go to 0 you also get a sequence of spans...but that sequence of spans converges to the identity so there's no way that the free category construction could preserve this sort of limit. I'm still thinking about it.
Regarding the action category stuff. Yes that's very interesting it does seem like you get the same category. That's a nice observation that you can really use any integration method you like. I'm not sure that every functor from -actions to -actions is an integration method but regardless there's something interesting going on.
Jacques Carette said:
Sorry to be skeptical here, but since the core of Euler's method, i.e. is taken as given, this just amounts to saying you can do iteration via the Free Category construction - which is quite well-known. I came here to find out a categorical construction of that 'core'. That would have been quite fascinating indeed.
It might be more honest to rephrase this as 'Iterative Method as a Free Category', with Euler's Method as an application.
Yes true. This is not a derivation of Euler's method by any means. Just a representation.
Jade Master said:
Yeah this is a really nice question. If you let h go to 0 you also get a sequence of spans...but that sequence of spans converges to the identity so there's no way that the free category construction could preserve this sort of limit. I'm still thinking about it.
Can you elaborate on this? I'd be interested to know the details
Jade Master said:
Regarding the action category stuff. Yes that's very interesting it does seem like you get the same category. That's a nice observation that you can really use any integration method you like. I'm not sure that every functor from -actions to -actions is an integration method but regardless there's something interesting going on.
Indeed, some are silly/useless integration algorithms. Some even presuppose the solution to be known in advance. So everything gives you something which behaves like one, but calling every one of them an 'integration algorithm' might be unfair, I concede.
Matteo Capucci said:
Jade Master said:
Yeah this is a really nice question. If you let h go to 0 you also get a sequence of spans...but that sequence of spans converges to the identity so there's no way that the free category construction could preserve this sort of limit. I'm still thinking about it.
Can you elaborate on this? I'd be interested to know the details
Jade Master said:
Regarding the action category stuff. Yes that's very interesting it does seem like you get the same category. That's a nice observation that you can really use any integration method you like. I'm not sure that every functor from -actions to -actions is an integration method but regardless there's something interesting going on.
Indeed, some are silly/useless integration algorithms. Some even presuppose the solution to be known in advance. So everything gives you something which behaves like one, but calling every one of them an 'integration algorithm' might be unfair, I concede.
I mean that you can take the span and take a sequence to get a sequence of spans which converge to . On the the other hand the categories converge to the true solution as you noted.
But is the stationary flow so there's no way that F could preserve this limit.
I might be confused about something...
btw I don't mean the categorical limit. Just the standard analysis one.
You could try to tweak the categories a bit so the analysis limit is actually a categorical one though.
Or more likely a colimit.
Mmmh I see
Jade Master said:
You could try to tweak the categories a bit so the analysis limit is actually a categorical one though.
How? :O
Matteo Capucci said:
Jade Master said:
You could try to tweak the categories a bit so the analysis limit is actually a categorical one though.
How? :O
One thing you could do is weaken the definition of morphism in to the following:
A morphism from a span to is a function commuting with the legs up to inequality. That is the inequalities
and
hold for all points .
Then the identity function is a morphism from to whenever
(sorry about the double use of h)
Then I'm pretty sure that taking the colimit of all the from before in this category gives the identity span on
I haven't worked out the details though.
But there's something that's not going to work because F is a left adjoint so it preserves colimits but we know this particular colimit is not preserved.
Maybe I'm wrong about the converging to the true solution actually :thinking:
Please don't get mad at me for saying something incorrect in the above I know there's an error somewhere :grinning:
Yeah I think for the F(A_n) to converge to the true flow, you need the length of the morphisms to go to infinity at the same time.
So yay it preserves this colimit but we're still not doing analysis :/
It's hard to blend analysis and category theory... I have a feeling they both need to be reworked a lot to do this well. I hope that something like Walter Tholen's notion of metagory will be useful someday - that's a "metric approximate category", where you can talk about how close one morphism comes to being the composite of two others.
We may need a whole lot of new notions like this. But I like how Tholen gets to the bottom of things in this realm: we know the nerve of a category is a simplicial set where tetrahedra give associativity; he shows that in a metric approximate category a "tetrahedral inequality" should hold - sort of the next thing after the triangle inequality!
This is the kind of surprising insight that may show up when we blend category theory and analysis.
Jade Master said:
I mean that you can take the span and take a sequence to get a sequence of spans which converge to . On the the other hand the categories converge to the true solution as you noted.
I'm only casually reading this conversation, so I'm probably missing something obvious (or likely, a lot of somethings), but this looks like an abuse of , similar to the abuse of you apologized for later. Is that right, or do the 's in and really refer to the same thing?
Yes, it is a double use of n as well.