Ordered Linear Spaces II
Since I was a little slow posting things at the end of last week due to the conference, I’ll continue my discussion of ordered linear spaces with this observation: because each ordered linear space is a vector space with extra structure, the category inherits a lot from the category of vector spaces.
For one thing, given a pair of vector spaces and , we can take their direct sum . Now if each of them has an identified cone of positive vectors, we can set up a cone on the direct sum by insisting that the structural maps , , , and are positive. Let’s write these as logical statements and see what they imply:
- If then .
- If then .
- If then .
- If then .
The projections tell us that if a pair is positive in , then each of its components is positive in its respective vector space. On the other hand, the injctions tell us that if each component of a pair is positive, then each of their images in must be positive, and so the sum of the images — the pair itself — must be positive. That is, a pair is positive if and only if each of its components is positive. This uniquely specifies the cone on the direct sum so as to make it a biproduct in .
This category is also monoidal closed. There are various natural monoidal structures we could use, so we’ll start with the exponential this time. Now, in we have an exponential — is the vector space of all -linear maps from to . Is there a natural cone in this vector space? Indeed there is! It’s just the cone of all positive maps! That is, if and only if implies .
So what’s the tensor product? Well, we start with the vector space tensor product and try to find a cone. This should give an adjunction . So let’s read this as another logical statement. A linear map is positive (and thus in ) if
Expanding this condition on , we get that is positive if
But is the usual closure adjunction in the category of vector spaces, turning a function-valued function of one variable into a vector-valued function of two variables. And we want every positive map from to to correspond to exactly one in just this way. Thus the cone on that makes the tensor product for into a left adjoint to the exponential is that of all finite sums of tensor pairs of positive elements. That is, if with all the and positive in their respective cones. As an exercise, verify that this tensor product is also symmetric.
The monoidal identity has the base field as its underlying vector space. For its cone, take the positive ray. It’s straightforward to check that . As usual, we use the tensor identity to represent the “underlying set” functor. That is, we define the underlying set of a cone by . Such a positive map is a linear map from to that picks out a positive point , and there is exactly one such map for each positive point in . That is, the underlying set is exactly the set of points in the positive cone of . As a check, note that this means the underlying set of is the set .
As if that weren’t enough, has duals! Indeed, we have a cone in the dual vector space defined by if and only if for all . Or in other words, . We just need natural maps and to make this really a categorical dual. The first of these is evaluation — . The second one picks out an identified element in . How can we do this?
Well, in a vector space we can pick a basis of and get a dual basis of defined so that is if and otherwise. Then we can sum up . It’s well-known (though I haven’t shown it yet) that this sum doesn’t depend on which basis we picked! That is, it’s just a property of the vector space .
Now if has a cone, we know we can find a positive basis. And then it turns out the dual basis will be positive in the dual cone. Putting these together, it turns out that the above element is always in the positive cone of , even if we didn’t start by picking a positive basis! All we need is the fact that this sum can be written as a sum of positive tensor pairs.
From here, it’s an easy calculation to verify that and satisfy the two required equations, making the dual of .
[UPDATE]: Okay, that last bit doesn’t seem to work. The dual basis is not in general positive. That was a fact that I quoted from my conversation with Howard, so I think he made a mistake there. It’s my own fault for not verifying it, but now I’ve found an example where it fails. I’m working on finding an example where it fails for all positive bases. As it stands, does not in general have duals.
Them’s the breaks when you’re working on the edge of what you know.