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 have some thoughts on this that are very hard to state precisely so my apologies if this doesn't make sense.
The composition in the category (sets with relations), (Natural numbers representing dimensions with linear maps) and (Categories with profunctors- I don't know much about co/ends, but I wanted to mention this) all behave alike, as some kind of "Summing (by "sum", I mean , , and , respectively) over the middle index".
Now another category where composition behave like this would be the Fukaya category of some symplectic manifold, where the convolution product is give by this type of formula.
I was told that with the homological mirror symmetry in mind, this could be some kind of geometric incarnation of the fact that we have a bi(2?)-category (Rings, bimodules and bimodule homs) on the algebraic side, how can I make sense of this?
Also, it doesn't really parse for me to think of matrices as "generalized maps between numbers", but it makes sense to think of bimodules as generalized ring maps, or relations as generalized set maps. What is the correct way to think about this? And in general, how can I produce the notion of "generalized maps"?
I'd have to look into your mirror symmetry question, but regarding the last paragraph, matrices are generalized maps between finite sets, just as relations are. Specifically, a relation generalizes a function in that each element of may be mapped to no element, or several elements, of ; similarly, an -indexed matrix sends each element of to a linear combination of elements of
Continuing on @Kevin Carlson's comment, there is the following analogy
If I am not mistaken, the first two are examples of Kleisli maps, respectively for the powerset monad, and the monad associated with the free-forgetful adjunction between finite sets and (finite dim) vector spaces. The last one seems similar, but goes a level higher, and would probably need 2-categorical treatment.
I would change "is like" to "is", where I'm using "is" in the category theorist's sense.
There's a move in the symplectic world (and elsewhere) to look beyond functions (here, symplectomorphisms) to something more span-like (correspondences), as in the [[Weinstein symplectic category]]:
Then some [[span]]-like composition follows, like your summing over the middle index:
Peva Blanchard said:
Continuing on Kevin Carlson's comment, there is the following analogy
- a relation is like a function
- a matrix is a like a function
- a profunctor is like a functor
There is something beautiful about this presentation: it suggests thinking of elimination procedures (Gaussian elimination, in the matrix case) as manipulating maps in a way that resembles "homotopies of paths".
In homotopy theory one studies maps like . If I write this as with , the point is usually not to interpret elements of as being sent to elements of via some relational correspondence. Rather, indexes higher-order data: its elements parametrize "transitions" between two points of .
With that lens, Gaussian elimination feels like passing through homotopies. Concretely, given an abstract morphism , one can compare and . In linear algebra, this is row subtraction: replacing (say) the row for by the difference . In homotopy theory, the analogous move is to compare two 1-paths via a 2-path between them.
The key difference is that in homotopy theory the "2-dimensional" structure is kept explicit, whereas elimination flattens that higher-order structure back down to level 1 in order to reduce the matrix.
David Corfield said:
Then some [[span]]-like composition follows, like your summing over the middle index:
And of course, the homotopy viewpoint leads us back to the span-like viewpoint.
Homotopies, once abstracted, give graph-like structures, which are nothing more than spans over the same objects. A span such as is precisely the kind of object that records sources and targets
Thanks a lot! All of these responses are really insightful.
Reading through no post again and I realized how poorly it was written. Let me rephrase the algebra vs geometry part: Forget about homological mirror symmetry, the "algebra is dual to geometry" philosophy has many incarnations, e.g., Boolean rings vs Stone spaces, unital commutative C*-algebras vs compact Hausdorff spaces, or finitely generated reduced k-algebras vs affine k-varieties.
Now naively algebraic things behave like sets and functions. So while we think about generalizing the notion of functions, how does this manifest on the geometry side? One such example is the convolution product in Boore-Moore homology. Chriss&Ginzberg's "Representation Theory and Complex Geometry", section 2.7 explains precisely how the convolution product is a homology version of how things in compose. Now this story is more on the geometry side rather than the alegrba side, so I want to say something like in the dual case this is like the 2-category , but this is very imprecise and just a vague idea.
Also I should mention I was totally unaware of this kind of viewpoint of generalized maps until reading through some recent very interesting discussions of profunctors and linear algebra in the Zulip channel, which connected some dots for me, since @John Baez described the 2-category around a year ago, thanks!