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.
All the talk about polytopes the last few days has me reminiscing about a fascinating topic that I ran into at the end of my time as an undergrad at Berkeley. It is a modern approach to the development of vector calculus, and I've always thought the approach deserves to be better known. I'd love it if some of these ideas could be worked into a graphical calculus.
I see the topic has already been discussed at the Café, but I think it was before I started lurking.
The context of the work is topological vector spaces, and the main idea is to directly construct a rich vector space of domains which has differentials/differential forms as it's dual. This is in contrast to the usual approach, where we start with some relatively simple class of domains (e.g., intervals), describe integration over those, and obtain a richer (too rich?) collection of domains as the double dual.
The fundamental desideratum is that the boundary map should be continuous, as this will allow us to define the differential via duality, making Stokes' theorem definitional. This is not entirely trivial.
First imagine a domain , which obviously has boundary . As , we expect as well; in particular, for any continuous function , so this is a kind of positive definiteness condition.
What about ?
A priori, we have a few reasonable interpretations of what to do when the endpoints merge in the limit. We could reasonably expect , since as subspaces of . That would cause problems, though, since . Setting is allowed, but boring.
We get around this by introducing orientation. If we set there's no problem: the opposites annihilate when (and only when) the interval has zero length.
We might expect that for disjoint domains and , we should have , but this turns out to be too strong. If , we would have a discontinuity in the norm as .
We introduce context through an interaction between the norm and translations:
If can be decomposed as a vector-separated difference , then . This ensures continuity in the limit as , so the boundary of a small interval tends to zero.
One interesting feature of this approach is that we can weight regions in order to define Dirac deltas directly, rather than recovering them in the double dual. In particular, the limit of the weighted intervals is non-zero, and represents a Dirac delta at 0. Moreover, the boundary of is also non-zero, and represents an infinitesimal dipole: .
Notice that the factor of prevents the cancellation of opposite orientations.
Thanks, I was not aware of this work, it seems super interesting!
Is there a readable introduction? The Café link has messages from J. Harrison herself saying that the linked writeup is obsolete. But going to her publications page or her google scholar page does not enlighten me either.
This paper seems to be the most up-to-date introduction!
Well, it is a paper, I agree. An 'introduction'? Hmm, I'm rather less sure about that...
Well, it's an introduction in the sense that it develops the theory from scratch giving all the definitions. Considering it's quite recent research, I doubt there's anything more “friendly”.
Glad someone liked it. As she discusses in the paper Amar linked, the presentation starting from discrete domains is much easier, but I actually find some of the earlier presentations in terms of polyhedral chains more charming; it's a nice feature of the theory is that you can build it starting from standard geometric objects.
I brought it up here because the intellectual ferment in a parallel thread included diagrammatic definitions for various polyhedral constructions, including the boundary. There everything is written down in terms of posets, but it seems like one could enrich in a related category (posets over ?) to add norms to into the mix. I don't have time to dig into it, but I would love it if someone found a connection.