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.
You might check out Soichiro Fujii's thesis, mentioned in Willerton's post on the Legendre-Fenchel transform and enriched profunctors, since this thesis defines addition and subtraction for , and it seems their rules are different from ours: they say
while we say
But they are studying convex functions, while we've been studying concave ones, so I'm hoping that our approach is just like theirs upside-down!
They make into a closed symmetric monoidal category where the monoidal structure is addition and the closed structure is subtraction! (We haven't been talking about subtraction.)
John Baez said:
But they are studying convex functions, while we've been studying concave ones, so I'm hoping that our approach is just like theirs upside-down!
I think this is exactly right!!
Great!! I had completely forgotten this business when we reinvented the commutative monoid for based on our application to thermodynamics.
It's interesting that they're making it into closed symmetric monoidal category (with numbers as objects, and a single morphism from to when , which is probably the opposite of what we'd use.)
What's interesting to me is that we can get a closed symmetric monoidal category from an abelian group, taking the group elements as objects and having only identity morphisms. Subtraction in the group gives the closed structure.
is not an abelian group, but they're still getting a closed structure! They must need the non-identity morphisms - coming from the ordering on - to get this to work.
But we also need the ordering on for physics, in order to talk about entropy maximization.
In the Willerton n-cafe post, he starts with the pairing of the dual .
We can generalize this from vector spaces to convex spaces by defining for a convex space to simply be the convex space of convex-linear functions . The rest of the construction of the Legendre transform works for this.
One interesting thing here is that the dual is not cancelative.
One weird thing about this generalization is that when you take your convex space to be a vector space, this new dual doesn't reduce to the usual dual.
Yes, but it almost does
The convex dual of a vector space has as elements linear functionals + constants
And adding a constant to a linear functional doesn't change the maximization behavior
Oh, when you said "convex functions" I thought you meant "convex functions". But now I think you meant "convex-linear functions".
Oh, yeah, that's totally my bad
That is what I meant
Okay, now I'm starting to get it.
I'd still have to check to see if this makes sense.
By the way, for getting some more category theory into the game we should read this paper:
Sorry to come in in the middle of the conversation! If you are using with as a closed monoidal category to think about entropy, then you should check out Lawvere's State Categories, Closed Categories, and the Existence Semi-Continuous Entropy Functions.
Thanks Simon! Lawvere is always relevant!
Never be sorry about joining the conversation, Simon. I was sort of trying to summon you by saying the phrase "Legendre-Fenchel".
@Simon Willerton, what do you think of taking the dual of a convex space to be the space of all convex-linear functions to ?