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've been working on this for a while now (too long!) and have made some progress. I thought it might be a good idea to take stock and summarize what I have so far.
As mentioned above, I now have a pretty good understanding of the first order discrete calculus .
Our algebra is constructed from a set of vertices of a directed graph, i.e. and has basis elements
and unit element
Our -bimodule is constructed from a set of directed edges, i.e. and has basis elements
However, now that I write this, I think there is some restriction on the allowed directed graphs that I've thought about before but hadn't formalized (until now?).
The -bimodule is actually a sub-bimodule of the universal one appearing in , which is the kernel of the multiplication If is a sub-bimodule of which is a sub-bimodule of then obviously
is a sub-bimodule of
If and is a sub-bimodule of , I believe this means that should be a subset of Moreover, since is a sub-bimodule of , then cannot contain elements in the diagonal either.
In other words, I think the directed graph
has to be an "irreflexive binary relation". As a directed graph, this means there can be at most one directed edge connecting any two vertices and there cannot be any loops, i.e. we are dealing with digraphs.
If this is correct, it simplifies things a lot. Intuitively, I suspected I wanted to be working with digraphs, but I couldn't find a justification until realizing the above argument. I still need to think about it, but it seems reasonable at the moment :thinking:
Another MAJOR step was when I discovered a way to extend the first order calculus to higher orders (I think it happened around Dec 21).
I'm not ready to talk about that in detail yet, but it involved constructing tensor products (over ) of with itself, i.e.
and then introducing maps
so that finally my higher order elements are special kernels of these maps resulting in a cochain complex with
with satisfying the graded product rule (on cochains) so I end up with an associative differential graded algebra (with unit).
I had never thought much about spans, but at some point (can find the exact point because it happened on this Zulip), I learned that "tensors over " might secretly imply I am working with spans somehow. In the process, I also learned that directed graphs can be thought of as endomorphisms in with composition of a directed graph (as an endomorphism) with itself times gives a span
where consists of directed paths of length .
I got excited by this. It really felt (and still feels) like I was / am on the right track.
Since then, I've been studying and my article contains a pretty decent "Introduction to for Engineers".
Then on Dec 24, Amar suggested looking at the functor:
This functor provides an alternate way to think about directed graphs because, given a functor
then
is a directed graph. Also , i.e. the directed graph (as an endomorphism) composed with itself times gives directed paths of length .
This all feels good and I feel I'm on the right track, but I also feel my progress is too slow.
On Dec 27, Dan made a helpful comment pointing out that maybe the maps I mentioned above, i.e.
looked like they might involve a natural transformation
Thinking about this led me to realize that given spans and , where is the terminal (one-element) set, if you compose them, you get a span
where is just the usual Cartesian product That is kind of neat :blush:
The point being that given two functors with
and
then (borrowing from Dan's suggestion) a natural transformation involves maps
Now, if only I could move this to algebras and bimodules so that we get the similar looking
or (equivalently)
which is what I want.
That brings me to where I am now. I'm currently trying to understand how to get algebras and bimodules from sets and spans.
John kindly pointed out that starting with a span of sets and hitting it with a functor with , then we don't get a span, we get a cospan so we have a map
In hindsight, this seems obvious, but I'm in unfamiliar waters with this stuff and I tend to panic and forget things I already know in such situations.
I'm still working things out. For example, I think a span should push out to a span , but intuitively, I also think should be equivalent to , but I'm struggling a bit to confirm / reject the idea.
Just a note on acknowledgements. Several people have helped me out (and one great thing about Zulip is that I'll be able to record everyone). Above, I highlighted some important comments from Amar and Dan, but I can't name names without pointing out that I would be nowhere without the help of John Baez. Thank you so much :pray:
Maybe one final note on motivation.
I started out already knowing that I have algebras and bimodules (in fact differential graded algebras) and knowing that these algebras and bimodules are related to directed graphs somehow, but I didn't know the precise relationship.
For example, I know I have an algebra with basis elements described above so that a general element can be expressed as
I also know I have an -bimodule with basis elements described above so that a general element can be expressed as
The left and right actions can be defined on basis elements by
where is the Kronecker delta functions. This is super remiscent of a path algebra. Now, I could just declare I have a product like that, but I'm trying to construct a setting where the actions are natural consequences, e.g. functorial, in nature. I don't feel satisfied just declaring rules for a multiplication without some better justification. That is why I was happy to stumble on spans. The composition of spans gives the exact structure I want, but it is a challenge for me to work out the details.
As usual, any help, questions, comments are more than welcome :pray:
Hi Eric! Nice to see your progress :) In reading I stumbled upon two questions which are maybe sorted out, actually, so I'll just leave them here for future reference:
(Note: I moved our subsequent discussion about this latest update to a new stream here . Thanks again :pray: )