Warning: This page is a collection of notes trying to understand some of Tom Leinster‘s work on the cardinality of a category.
From page 2 of Tom’s paper:
A version of the definition can be given very succinctly. Let be a finite category; totally order its objects as . Let be the matrix whose -entry is the number of arrows from to . Let , assuming that this inverse exists. Then is the sum of the entries of .
This paragraph (and I don’t think I’m the first to say this, but can’t find the post on the nCafe right now) makes me think of as a Gram matrix
Then defining
we’d have
However, we haven’t specified whether we can even add objects of together, so what should we do next?
If we could overcome this barrier, then we could write down a set of dual elements
having the property that
and
It is interesting that the indices switched. There must be an somewhere.
I think we also want to define the product of via
Light Bulb
Note that if we consider to be sets (as a subset of multisets) and if all are disjoint then we do have
For a multiset spanned by , then we have
so that
really is the unit multiset on the space of multisets spanned by .
This makes me think of directed space and the question on the bottom of the page:
Could this be related to Leinster measure?
The following material is separate from that above.
where
The following material is separate from that above.
I think I might be trying to reinvent multiset theory.
Got it!
See inner product of multisets
Given a multiset and a reference multiset , we’d like to decompose into orthogonal components
The coefficient is given by
The cardinality of a multiset satisfies
It is tempting to try to interpret the first equality as a law of cosines. To do so, I suggest that the norm should not be the cardinality, but rather the square root of the cardinality, i.e. using horrible notation, I’m suggesting
so that
Motivated by this, we can define an inner product
which is of the desired form but reduces to
or
Sanity check:
If and are disjoint:
Cosine:
In the discussion below Toby made some very helpful comments and I continued rambling some more, but I think a picture is starting to emerge.
Sanity check:
In order to add two sets and , we can note that
and
so that
and
More generally,
Sanity check:
Scalar multiplication distributes over intersections, i.e.,
How about associativity?
Sanity check:
Here are some thoughts on cardinality.
Consider a vector space freely generated by finite sets and define the cardinality to be
where is a scalar and is the cardinality of .
Now, motivated by
we would like to write down a reasonable definition of .
How about
which implies
Does that make sense? This means, in particular, that
I think we want to use this definition of “+” for finite sets.
Sanity check
Argh!
Nice.
Is “+” associative?
Ouch! How can we define ? Maybe
Therefore,
This is clearly symmetric in ,, and so the sum is associative.
More generally, we have
Let’s also check
So far so good!
Armed with this definition of “+” for finite sets, we want to define an inner product
Doesn't this already define ? How is anything below a definition of , when is already the addition operation in this free vector space? It seems to me that the only thing that you might define is to extend and from individual sets to linear combinations of sets. (And I guess that these sets are all finite subset of some ambient universe, so that makes sense for them.) —Toby
Eric: I dunno. Is it obvious how to define ? If so, please help :)
I guess I was trying to find a “+” that is compatible with “” so that
and I wanted to define in such a way that we can define a nontrivial inner product.
The “problem” (if there is one) is that
leads to
so that
I was hoping to find some inner product giving rise to an “angle”
Toby: Yeah, it's obvious how to define , like this: . (^_^)
Seriously, my point is only that when you talk about defining , you've forgotten that you just defined it. I can see that you want a more interesting definition of .
Perhaps we should start on the angle. If , then we should have , but perhaps should occur when and are disjoint; that's a way in which they can be ‘orthogonal’. (Sanity check: if = and also and are disjoint, then there is no consistent ; but this can happen only when and are empty, in which case there should be no consistent . So that's working out.) So I'm thinking that should be proportional to or . To normalise the latter properly, it should be
This suggests that .
Then gives us
Compared to your earlier
I think that the problems were that you were using an norm when you really need an norm to get a good inner product.
How's that sound?
Eric: Thanks Toby! I’m happy to have you put some thought into this. As you could tell, I was flailing around a bit. I’ll try to absorb what you said and come back with questions/comments.
Eric: Ok! I see. I am not sure. My norm was not put in by hand. In fact, I didn’t even recognize it as an norm. I was simply carrying out a calculation motivated by your first comment (above).
I was thinking that if we want to add two finite sets and , then if they are disjoint we should have
Issues only arise when and intersect. So what I did then is decompose and into three disjoint pieces.
and
There I was using “+” without being 100% clear on what “+” is, but when sets are disjoint, I think it is safe to say “+” is just union.
So then I simply added and as three disjoint pieces resulting in
Then, the norm of disjoint sets is just the sum of their norms, we have
The fact that this is an norm is a bonus and wasn’t put in by hand.
BZZZT! I see! I made a mistake. The norm of the sum of disjoint sets should not be the sum of the norms unless I assume an norm, right? For an norm, it should be
Hmmm! We’re making progress :)
Eric: Oh! Wait wait! I think we do want an norm here. Let’s partition a set into two disjoint sets and so that
Since and are disjoint we have
which is what we want for cardinality. This, to me, says that cardinality of finite sets is an norm on the vector space freely generated by finite sets.
Eric: Ok ok! I’m excited. With the norm, which is the natural norm for finite sets and cardinality, we can define
which due to profound beauty comes out to be
as you thought it should be. Then we have derived
However, we derived this rather than postulating it. Very neat!
Eric: Hah! I can only imagine what it must be like trying to read this :) I’ll come back and try to write something readable once the smoke settles. For now, I am flipping back from to (as you suggested!). It was a valiant guess, but stuff in my previous comment does not work out as I hoped.
Eric: I did some more doodling last night. I think that when you go with the norm, you end up with
I didn’t like that because a natural way to define inner product is
With this, combined with leads to
I couldn’t see how to get a nontrivial angle out of this. That is why I was trying to come up with something where . The best I could come up with was
Only after you pointed it out, did I realize that this was an norm. HOWEVER, if you take this norm and squint your eyes, it almost looks like a law of cosines. By normalizing the last term, we come up with (something like)
which is what you had suggested.
The point is, I don’t think we can postulate the form of . It should come from our definition of inner product.
Ok ok. Maybe that is what you were trying to tell me all along. We want to define our inner product as
Sorry. It will soak in eventually :)
Eric: Another desirable property of an inner product would be that it is bilinear so that
I’m not sure that is the case with
Toby: Isn't it?
You're right, it isn't! Somewhow I thought that it was …
Heck, I thought that I'd checked this stuff, but I guess not!
Fortunately your version with multisets works out fine.