Skip to the Main Content

Note:These pages make extensive use of the latest XHTML and CSS Standards. They ought to look great in any standards-compliant modern browser. Unfortunately, they will probably look horrible in older browsers, like Netscape 4.x and IE 4.x. Moreover, many posts use MathML, which is, currently only supported in Mozilla. My best suggestion (and you will thank me when surfing an ever-increasing number of sites on the web which have been crafted to use the new standards) is to upgrade to the latest version of your browser. If that's not possible, consider moving to the Standards-compliant and open-source Mozilla browser.

February 26, 2025

Potential Functions and the Magnitude of Functors 2

Posted by Tom Leinster

Despite the “2” in the title, you can follow this post without having read part 1. The whole point is to sneak up on the metricky, analysisy stuff about potential functions from a categorical angle, by considering constructions that are categorically reasonable in their own right. Let’s go!

Let VV be a monoidal category, which I’ll assume is symmetric, closed, complete or cocomplete as necessary. Take a pair of VV-categories AA and BB, and a VV-functor

F:AB. F: A \to B.

Then we get a new functor

N F:B[A op,V] N_F: B \to [A^{op}, V]

defined by

(N F(b))(a)=B(Fa,b). (N_F(b))(a) = B(F a, b).

This is sometimes called the nerve functor induce by FF, because of the first example in the following list.

Examples   In the first few examples, I’ll take the enriching category VV to be SetSet.

  • Let FF be the inclusion ΔCat\Delta \hookrightarrow Cat, which takes a finite nonempty totally ordered set [n]={0,,n}[n] = \{0, \ldots, n\} and realizes it as a category in the usual way. Then N F:Cat[Δ op,Set]N_F: Cat \to [\Delta^{op}, Set] sends a small category DD to its nerve, which is the simplicial set whose nn-simplices are paths in DD of length nn.

  • Let FF be the functor ΔTop\Delta \to Top that sends [n][n] to the topological nn-simplex Δ n\Delta^n. Then N F:Top[Δ op,Set]N_F: Top \to [\Delta^{op}, Set] sends a topological space XX to its “singular simplicial set”, whose nn-simplices are the continuous maps Δ nX\Delta^n \to X.

  • Let F:ABF: A \hookrightarrow B be an inclusion of partially ordered sets, viewed as categories in the usual way. Then N F:B[A op,Set]N_F : B \to [A^{op}, Set] is given by

    (N F(b))(a)={1 if ba 0 otherwise. (N_F(b))(a) = \begin{cases} 1 &\text{if}   b \leq a \\ 0 &\text{otherwise}. \end{cases}

    For example, let BB be the set \mathbb{Z} of integers, ordered by divisibility. Let AA \subseteq \mathbb{Z} be the set of (positive) primes. Then N FN_F is the functor Set {primes}\mathbb{Z} \to Set^{\{primes\}} that sends nn \in \mathbb{Z} to

    ([p|n]) primes p ([p | n])_{\text{primes}   p}

    where [p|n][p|n] is Iverson notation: it’s 11 if pp divides nn and 00 otherwise.

  • If FF has a right adjoint GG, then N F(b)=A(,Gb):A opVN_F(b) = A(-, G b): A^{op} \to V. In particular, N F(b)N_F(b) is representable for each bBb \in B.

  • Take the inclusion FieldRingField \hookrightarrow Ring, where RingRing is the category of commutative rings. Now take opposites throughout to get F:Field opRing opF: Field^{op} \hookrightarrow Ring^{op}. The resulting nerve functor

    N F:Ring op[Field,Set]N_F: Ring^{op} \to [Field, Set]

    sends a ring RR to Ring(R,)| FieldRing(R, -)|_{Field} (by which I mean the restriction of Ring(R,):RingSetRing(R, -): Ring \to Set to the category of fields). More explicitly,

    N F(R)= pSpec(R)Field(Frac(R/p),). N_F(R) = \sum_{p \in Spec(R)} Field(Frac(R/p), -).

    Here Spec(R)Spec(R) is the set of prime ideals pp of RR, and Frac(R/p)Frac(R/p) is the field of fractions of the integral domain R/pR/p. In particular, N F(b)N_F(b) is a coproduct of representables for each bBb \in B. (In the terminology of Diers, one therefore says that FieldRingField \hookrightarrow Ring is a “right multi-adjoint”. A closely related statement is that it’s a parametric right adjoint. But that’s all just jargon that won’t matter for this post.)

Now let’s consider V=( +,)V = (\mathbb{R}^+, \geq) with its additive monoidal structure, so that VV-categories are generalized metric spaces and VV-functors are the functions ff between metric spaces that are variously called short, distance-decreasing, contractive, or 1-Lipschitz: d(f(a),f(a))d(a,a)d(f(a), f(a')) \leq d(a, a') for all a,aa, a'. I’ll just call them “maps” of metric spaces.

  • Take a map f:ABf: A \to B of metric spaces. The induced map N f:B[A op, +]N_f: B \to [A^{op}, \mathbb{R}^+] is given by

    (N f(b))(a)=d(f(a),b). (N_f(b))(a) = d(f(a), b).

    Unlike in the first post, I’m not going to assume here that our metric spaces are symmetric. so the “op” on the AA matters, and d(a,f(b))d(f(b),a)d(a, f(b)) \neq d(f(b), a) in general.

    We’ll be particularly interested in the case where the VV-functor FF is full and faithful. Most of the examples above have this property. In the metric case, V= +V = \mathbb{R}^+, being full and faithful means being distance-preserving, or in other words, an inclusion of a metric subspace. In that case, it’s normal to drop the ff. So we’d usually then write

    (N f(b))(a)=d(a,b). (N_f(b))(a) = d(a, b).

Next I’ll define the potential function of a VV-functor. For this we need some of the apparatus of magnitude. Roughly speaking, this means we have a notion of the “size” of each object of our base monoidal category VV.

More exactly, we take a field kk and a function ||:ob(V)k|\cdot|: ob(V) \to k, to be thought of as assigning to each object SS of VV its size |S|k{|S|} \in k. And to make everything work, we assume our size function |||\cdot| has reasonable properties:

ST|S|=|T|,|ST|=|S||T|,|I|=1, S \cong T \implies |S| = |T|, \quad |S \otimes T| = |S| \cdot |T|, \quad |I| = 1,

where \otimes is the monoidal product on VV and II is its unit.

The basic definitions are these. A weighting on a finite VV-category AA is a function w A:ob(A)kw_A : ob(A) \to k such that

bA|A(a,b)|w A(b)=1 \sum_{b \in A} |A(a, b)| w_A(b) = 1

for all aAa \in A, and a coweighting w Aw^A on AA is a weighting on A opA^{op}. Although it’s not true that every finite VV-category has a unique weighting, it’s a harmless enough assumption that I’ll make it here. The magnitude of a finite VV-category AA is

|A|= aAw A(a)= aAw A(a)k. |A| = \sum_{a \in A} w_A(a) = \sum_{a \in A} w^A(a) \in k.

It’s a tiny lemma that the total weight aAw A(a)\sum_{a \in A} w_A(a) is equal to the total coweight aAw A(a)\sum_{a \in A} w^A(a), so you can equivalently define the magnitude to be one or the other.

There’s a whole lot to say about why this is a worthwhile definition, and I’ve said it in detail many times here before. But here I’ll just say two short things:

  • Taking V=FinSetV = FinSet, k=k = \mathbb{Q}, and |||\cdot| to be cardinality, the magnitude of a finite category is equal to the Euler characteristic of its classifying space, under suitable hypotheses guaranteeing that the latter is defined.

  • Take V= +V = \mathbb{R}^+, k=k = \mathbb{R}, and |||\cdot| to be se ss \mapsto e^{-s} (because that’s just about the only function converting the tensor product of VV into addition, as our size functions are contractually obliged to do). Then we get a notion of the magnitude of a metric space, a real-valued invariant that turns out to be extremely interesting.

That’s the magnitude of enriched categories. But we can also talk about the magnitude of enriched presheaves. Take a finite VV-category AA and a VV-presheaf X:A opVX: A^{op} \to V. Its magnitude is

|X|= aAw A(a)|X(a)|k. |X| = \sum_{a \in A} w^A(a) |X(a)| \in k.

When I wrote about the magnitude of functors before, I concentrated on covariant functors AVA \to V, which meant that the weights in the weighted sum that defines |X||X| were, well, the weights w A(a)w_A(a). But since we’ve now changed AA to A opA^{op}, the weights have become coweights.

Let me briefly recall why the magnitude of presheaves is interesting, at least in the case V=FinSetV = FinSet:

  • If our presheaf XX is a coproduct of representables then |X||X| is |colim(X)||colim(X)|, the cardinality of the colimit of XX.

  • The magnitude of presheaves generalizes the magnitude of categories. The magnitude of a category AA is equal to the magnitude of the presheaf A opSetA^{op} \to Set with constant value 11.

  • In the other direction, the magnitude of categories generalizes the magnitude of presheaves: |X|=|𝔼(X)||X| = |\mathbb{E}(X)| for all presheaves XX. Here 𝔼(X)\mathbb{E}(X) means the category of elements of XX, also called the (domain of the) Grothendieck construction.

    It’s enlightening to think of this result as follows. If we extend the codomain of XX from SetSet to CatCat then 𝔼(X)\mathbb{E}(X) is the colax colimit of X:A opCatX: A^{op} \to Cat. So |X|=|colaxcolim(X)||X| = |colaxcolim(X)|. You can compare this to the more limited result that |X|=|colim(X)||X| = |colim(X)|, which only holds when XX has the special property that it’s a coproduct of representables.

    There’s also another closely related result, due to Ponto and Shulman: under mild further hypotheses, |X|=χ(hocolim(X))|X| = \chi(hocolim(X)). Mike and I had a little discussion about the relationship here.

    Now here’s something funny. Which do you think is a more refined invariant of a presheaf X:A opFinSetX: A^{op} \to FinSet: the magnitude |X||X|, which is equal to |colaxcolim(X)||colaxcolim(X)| and χ(hocolim(X))\chi(hocolim(X)), or the cardinality |colim(X)||colim(X)| of the strict colimit?

    From one perspective, it’s the magnitude. After all, we usually think of lax or pseudo 2-dimensional things as more subtle and revealing than strict 1-dimensional things. But from another, it’s the cardinality of the strict colimit. For instance, if AA is the one-object category corresponding to a group GG then XX is a right GG-set, the cardinality of the colimit is the number of orbits (an interesting quantity), but the magnitude is always just the cardinality of the set XX divided by the order of GG (relatively boring and crude).

    In this post I’ll keep comparing these two quantities. Whichever seems “more refined”, the comparison is interesting in itself.

(I stuck to the case V=FinSetV = FinSet here, because for an arbitrary VV, there isn’t a notion of “colimit” as such: we’d need to think about weighted colimits. It’s also harder to say what the category of elements or homotopy colimit of an enriched presheaf should be.)

Now here’s something new. The potential function of a VV-functor F:ABF: A \to B is the function

h F:ob(B)k h_F: \ob(B) \to k

defined by

h F(b)=|N F(b)| h_F(b) = |N_F(b)|

for all bBb \in B. Expanding out the definitions, this means that

h F(b)=|A(F,b)|= aAw A(a)|B(Fa,b)|, h_F(b) = |A(F-, b)| = \sum_{a \in A} w^A(a) |B(F a, b)|,

where w Aw^A is the notation I introduced for the coweighting on AA. If FF is full and faithful then h F1h_F \equiv 1 on the set of objects in the image of FF.

Examples   The definition I just gave implicitly assumes that ob(A)\ob(A) is finite. But I’ll relax that assumption in some of these examples, at the cost of some things getting less than rigorous.

Again, I’ll begin with some examples where V=FinSetV = FinSet.

  • What’s the potential function of the inclusion ΔCat\Delta \hookrightarrow Cat? To make sense of this, we need a coweighting on Δ\Delta, and I’m pretty sure there isn’t one. So let’s abandon Δ\Delta and instead use its subcategory Δ inj\Delta_{inj}, consisting of all the finite nonempty totally ordered sets [n]={0,,n}[n] = \{0, \ldots, n\} but only the injective order-preserving maps between them. This amounts to considering only face maps, not degeneracies.

    The coweighting on Δ inj\Delta_{inj} is [n](1) n[n] \mapsto (-1)^n. So, the potential function hh of Δ injCat\Delta_{inj} \hookrightarrow Cat is given, on a category DD, by

    h(D)= n0(1) n|Cat([n],D)|. h(D) = \sum_{n \geq 0} (-1)^n |Cat([n], D)|.

    Here Cat([n],D)Cat([n], D) is the set of paths of length nn in DD, which we often write as D nD_n. So

    h(D)= n0(1) n|D n|. h(D) = \sum_{n \geq 0} (-1)^n |D_n|.

    Even if the category DD is finite, this is a divergent series. But morally, h(D)h(D) is the alternating sum of the number of nn-cells of DD.

    In other words, the potential function of Δ injCat\Delta_{inj} \to Cat is morally Euler characteristic.

    As I hinted above, it’s interesting to compare the potential function with what you get if you take the cardinality of the colimit of B(F,b)B(F-, b) instead of its magnitude. I’ll call this the “strict potential function”. In this case, it’s

    D|colim [n]Δ injD n|=|π 0(D)| D \mapsto |colim_{[n] \in \Delta_{inj}} D_n| = |\pi_0(D)|

    — the cardinality of the set of connected-components of DD. So while the potential function gives Euler characteristic, the strict potential function gives the number of connected components.

  • Similarly, the potential function of the usual functor Δ injTop\Delta_{inj} \hookrightarrow Top, sending nn to Δ n\Delta^n, is given by

    D n0(1) n|Top(Δ n,D)|D \mapsto \sum_{n \geq 0} (-1)^n |Top(\Delta^n, D)|

    for topological spaces DD. Again, this formally looks like Euler characteristic: the alternating sum of the number of cells in each dimension. And much as for categories, the strict potential function gives the number of path-components.

  • For the inclusion {primes}(,|)\{primes\} \hookrightarrow (\mathbb{Z}, |) that we saw earlier, the potential function h:h: \mathbb{Z} \to \mathbb{Q} is what’s often denoted by ω\omega, sending an integer nn to the number of distinct prime factors of nn. The strict potential function is the same.

  • An easy example that works for any VV: if F:ABF: A \to B has a right adjoint then since A(F,b)A(F-, b) is representable, its magnitude is equal to the cardinality of its colimit, which is 11. So h F:ob(B)kh_F: \ob(B) \to k has constant value 11, as does the strict potential function.

    More generally, if A(F,b)A(F-, b) is a coproduct of nn representables then h F(b)=nh_F(b) = n, and the same is true for the strict potential function.

  • For the inclusion F:Field opRing opF: Field^{op} \hookrightarrow Ring^{op}, we saw that

    N F(R)= pSpec(R)Field(Frac(R/p),)N_F(R) = \sum_{p \in Spec(R)} Field(Frac(R/p), -)

    for every ring RR. This is a coproduct of representables, so by the previous example, |N F(R)|=|Spec(R)||N_F(R)| = |Spec(R)|. That is, the potential function is given by

    h F:R|Spec(R)|h_F: R \mapsto |Spec(R)|

    (as is the strict potential function). Usually Spec(R)Spec(R) is infinite, so this calculation is dodgy, but if we restrict ourselves to finite fields and rings then everything is above board.

  • For an opfibration F:ABF: A \to B, one can show that the potential function h Fh_F is given by

    h F(b)=|F 1(b)|. h_F(b) = |F^{-1}(b)|.

    I should explain the notation on the right-hand side. The category F 1(b)F^{-1}(b) is the fibre over bBb \in B, consisting of the objects of AA that FF sends to bb and the maps in AA that FF sends to 1 b1_b. We can take its magnitude (at least if it’s finite and lightning doesn’t strike), which is what I’ve denoted by |F 1(b)||F^{-1}(b)|.

    I won’t include the proof of this result, but I want to emphasize that it doesn’t involve finding a coweighting on AA. You might think it would, because the definition of h F(b)h_F(b) involves the coweighting on AA. But it turns out that it’s enough to just assume it exists.

  • Now take V= +V = \mathbb{R}^+, so that VV-categories are generalized metric spaces. The potential function of a map f:ABf: A \to B of metric spaces is the function h f:Bh_f : B \to \mathbb{R} given by

    h f(b)= aAw A(a)e d(f(a),b). h_f(b) = \sum_{a \in A} w^A(a) e^{-d(f(a), b)}.

    In particular, if ff is the inclusion of a subspace ABA \subseteq B, then it’s natural to write h Ah_A instead of h fh_f, and we have

    h A(b)= aAw A(a)e d(a,b). h_A(b) = \sum_{a \in A} w^A(a) e^{-d(a, b)}.

    This is equal to 11 on AA but can take other values on BAB \setminus A. In suitable infinite contexts, sums become integrals and w Aw^A becomes something like a measure or distribution, in which case the formula becomes

    h A(b)= Ae d(a,b)dw A(a). h_A(b) = \int_A e^{-d(a, b)} \, d w^A(a).

    This is exactly the formula for the potential function in Part 1, with one difference: there, I used weightings on AA, and here, I’m using coweightings. It’s coweightings that one should use. In the previous post, I assumed that all metrics were symmetric, which means that weightings and coweightings are the same. So there’s no inconsistency.

    (Of course, one could take duals throughout and use weightings on AA instead. But we’ll see that whichever choice you make, you end up having to consider weightings on one of AA and BB and coweightings on the other.)

    What about the strict potential function, sending a point bBb \in B to the “cardinality of the colimit of B(f,b):A +B(f-, b): A \to \mathbb{R}^+”? Well, I put that phrase in inverted commas because we’re now in an enriched context, so it needs a bit of interpretation. “Cardinality” is okay: it becomes the size function ||=e (): +|\cdot| = e^{-(\cdot)}: \mathbb{R}^+ \to \mathbb{R}. “Colimit” wouldn’t usually make sense in an enriched world, but we’re saved by the fact that the monoidal unit of V= +V = \mathbb{R}^+ (namely, 00) is terminal. The colimit of a VV-functor into VV is just its infimum. So the strict potential function of a map f:ABf: A \to B of metric spaces is just

    be inf aAd(f(a),b)=e d(fA,B). b \mapsto e^{-\inf_{a \in A} d(f(a), b)} = e^{-d(f A, B)}.

    I showed you an example of the difference between the potential function and the strict potential function in Part 1, although not with those words. If we take ff to be the inclusion {1,1}\{-1, 1\} \hookrightarrow \mathbb{R} then the potential function is

    graph of potential function of a two-point space

    whereas the strict potential function is

    graph of negative exponential distance of a two-point space

    These two functions are identical on (,1][1,)(-\infty, -1] \cup [1, \infty), but different on the interval (1,1)(-1, 1). If you’ve ever wondered what the difference is between strict and lax colimits, here’s an example!

By definition, the potential function of an enriched functor F:ABF: A \to B is given by

h F(b)= aAw A(a)|B(F(a),b)|, h_F(b) = \sum_{a \in A} w^A(a) |B(F(a), b)|,

but a slightly different viewpoint is sometimes helpful. We can take the function w A:ob(A)kw^A: ob(A) \to k and push it forward forward along FF to obtain a new function

F *w A: ob(B) k, b aF 1(b)w A(a). \begin{array}{cccc} F_* w^A: &ob(B) &\to &k, \\ &b &\mapsto &\sum_{a \in F^{-1}(b)} w^A(a). \end{array}

Really it’s best to think of w Aw^A as not a function but a measure taking values in kk (although these are the same thing on a finite set). Then this is just the usual pushforward measure construction. In any case, the formula for the potential function now becomes

h F(b)= bB(F *w A)(b)|B(b,b)|, h_F(b) = \sum_{b' \in B} (F_* w^A)(b') |B(b', b)|,

which has the advantage that everything is taking place in BB rather than AA. In the case where f:ABf: A \to B is an embedding of a subspace of a metric space, f *w Af_* w^A is just the extension of the measure w Aw^A on AA to all of BB, which we’d usually just write as w Aw^A (with a wink to the audience). In integral notation, the last formula becomes

h F(b)= Be d(x,b)dw A(x), h_F(b) = \int_B e^{-d(x, b)} \, d w^A(x),

which is what we had in the last post.

I’ve now explained what potential functions are. But what are they good for?

Last time, I explained that they’re very good indeed for helping us to calculate the magnitude of metric spaces. The key was that

|A|= Bh Adw B |A| = \int_B h_A \, d w_B

for a subspace AA of a metric space BB. And as I recounted, that key unlocks the door to the world of PDE methods.

So you might hope something similar is true for enriched categories in general: that there’s a formula for the magnitude in terms of the potential function. And there is! For any VV-functor F:ABF: A \to B, it’s a theorem that

|A|= bBh F(b)w B(b). |A| = \sum_{b \in B} h_F(b) w_B(b).

This is an easy calculation from the definitions.

(If you’re really paying attention, you’ll notice that we used the coweighting on AA to define the potential function, and now we’re using the weighting on BB. That’s just how it turns out. One is a weighting, and the other is a coweighting.)

Examples

  • For a VV-functor F:ABF: A \to B that has a right adjoint, we saw that the potential function h Fh_F has constant value 11, so this formula tells us that

    |A|= bBw B(b). |A| = \sum_{b \in B} w_B(b).

    But the right-hand side is by definition the magnitude of BB, so what this formula is saying is that

    |A|=|B|. |A| = |B|.

    In other words, if there’s an adjunction between two categories, their magnitudes are equal!

    This has been known forever (Proposition 2.4), and is also intuitive from a homotopical viewpoint. But it’s nice that it just pops out.

  • Less trivially, we saw above that for an opfibration F:ABF: A \to B, the potential function is h F:b|F 1(b)|h_F: b \mapsto |F^{-1}(b)|. So

    |A|= bBw B(b)|F 1(b)|. |A| = \sum_{b \in B} w_B(b) |F^{-1}(b)|.

    In other words, the magnitude of the “total” category AA is the weighted sum over the base BB of the magnitudes of the fibres. (Special case: the magnitude of a product is the product of the magnitudes.)

    Now this has been known forever too (Proposition 2.8), but I want to emphasize that the proof is fundamentally different from the one I just linked. That proof constructs the weighting on AA from the weightings on the base BB and the fibres. Now that’s an easy and informative proof, but what we’ve just done is different, because it didn’t involve figuring out the weighting or coweighting on AA. So although the result isn’t new or difficult, it’s perhaps grounds for optimism that the method of potential functions will let us prove new things about enriched categories other than metric spaces.

What new things? I don’t know! This is where I’ve got to now. Maybe there are applications in the metric world in which f:ABf: A \to B is nothing like an inclusion. Maybe there are applications to graphs, replacing the PDE methods used for subspaces of n\mathbb{R}^n by discrete analogues. Maybe the potential function method can be used to shed light on the tricky result that the magnitude of graphs is invariant under certain Whitney twists (Theorem 5.2), and more generally under the sycamore twists introduced by Emily Roff (Theorem 6.5). Let’s find out!

Posted at February 26, 2025 9:18 PM UTC

TrackBack URL for this Entry:   https://golem.ph.utexas.edu/cgi-bin/MT-3.0/dxy-tb.fcgi/3591

4 Comments & 0 Trackbacks

Re: Potential Functions and the Magnitude of Functors 2

This is all very interesting. I confess that the category theory got too heavy for me almost right away (lots of words whose definitions I have read and understood, but never properly internalized), but I definitely want to understand this thoroughly as soon as I have the time for it.

One little thing that I think is worth noting is that I believe (please correct me if I’m wrong) that the places where coweightings turn out to be appropriate to use are precisely the places where, in infinite metric space contexts, we use measure- or distribution-like objects. This fits perfectly with the fact that a weighting is a function ob(A)kob(A) \to k but a coweighting is canonically the same as a kk-linear function k ob(A)kk^{ob(A)} \to k (right?).

Posted by: Mark Meckes on February 27, 2025 1:57 AM | Permalink | Reply to this

Re: Potential Functions and the Magnitude of Functors 2

Well, almost. It’s coweightings on domains and weightings on codomains. But that seems natural enough.

Posted by: Mark Meckes on February 27, 2025 3:15 AM | Permalink | Reply to this

Re: Potential Functions and the Magnitude of Functors 2

I confess that the category theory got too heavy for me almost right away

Sorry! I’d be happy to try to explain anything.

In trying to guess where the “right away” point was, I realized I hadn’t defined [A op,V][A^{op}, V], and perhaps more importantly, I didn’t say what it was in the metric case. In that case, it’s the set of 1-Lipschitz functions ξ:A op +\xi: A^{op} \to \mathbb{R}^+, but with the subtlety that the metric on +\mathbb{R}^+ is not the usual one. Instead, it’s given by d(s,t)=max(ts,0)d(s, t) = max(t - s, 0). So the 1-Lipschitz condition means

max(ξ(a)ξ(a),0)d A(a,a) max(\xi(a) - \xi(a'), 0) \leq d_A(a, a')

for all a,aAa, a' \in A. Of course, this is equivalent to

ξ(a)ξ(a)d A(a,a). \xi(a) - \xi(a') \leq d_A(a, a').

When the metric on AA is symmetric, this is equivalent to the usual inequality

|ξ(a)ξ(a)|d A(a,a), |\xi(a) - \xi(a')| \leq d_A(a, a'),

but when it’s not, it’s not.

I don’t think anything in my post needs the metric on [A op, +][A^{op}, \mathbb{R}^+] (or more generally the VV-category structure on [A op,V][A^{op}, V]), but in any case, it’s the sup-metric.

As for coweightings and weightings, I may be misunderstanding you, but I think both coweightings and weightings should be interpreted as measure/distribution-like things (by which I really mean elements of the weighting space in the sense of your paper). We have to integrate against both of them. For a map f:ABf: A \to B of metric spaces, we define the potential function h f:Bh_f: B \to \mathbb{R} by

h f(b)= Ae d(f(a),b)dw A(a), h_f(b) = \int_A e^{-d(f(a), b)} \, d w^A(a),

and then we obtain the magnitude of AA as

|A|= Bh f(b)dw B(b). |A| = \int_B h_f(b) \, d w_B(b).

Posted by: Tom Leinster on February 27, 2025 2:08 PM | Permalink | Reply to this

Re: Potential Functions and the Magnitude of Functors 2

I’ll add a result that I didn’t include in the post because I ran out of steam, but might be interesting as a kind of proof of concept. The “concept” here is the idea that the potential function method might be useful in metric contexts that we haven’t explored yet, by taking f:ABf: A \to B not to be an inclusion.

The result I have in mind involves “metric fibrations” f:ABf: A \to B. Happily, the letter B stands not only for “big space” but also for “base”. The result is already proved as Theorem 2.3.11 here, but the potential function method gives a different proof.

I’ll repeat the definition, assuming for simplicity that all distances in our spaces are finite. A map f:ABf: A \to B of metric spaces is a metric fibration if for all aAa \in A and bBb' \in B, there exists a bf 1(b)a_{b'} \in f^{-1}(b') such that for all af 1(b)a' \in f^{-1}(b'),

d(a,a)=d(f(a),b)+d(a b,a). d(a, a') = d(f(a), b') + d(a_{b'}, a').

The idea is that AA projects onto each fibre of ff. There’s a diagram in the paper.

It’s not too hard to show that all the fibres of a fibration are isometric. Write FF for the fibre. Then the result is that |A|=|B||F||A| = |B| \cdot |F|, for finite spaces where everything is defined.

The proof in the paper is very simple. Just check that

aw B(f(a))w f 1(f(a))(a) a \mapsto w_B(f(a)) \cdot w_{f^{-1}(f(a))}(a)

is a weighting on AA, and the result follows.

But here’s another proof, using potential functions. For each aAa \in A, the definition of coweighting gives

aAe d A(a,a)w A(a)=1. \sum_{a' \in A} e^{-d_A(a', a)} w^A(a') = 1.

Now for each bBb \in B, we can take a w f 1(b)w_{f^{-1}(b)}-weighted sum of this equation over all af 1(b)a \in f^{-1}(b) to get

af 1(b) aAe d A(a,a)w A(a)w f 1(b)(a)= af 1(b)w f 1(b)(a), \sum_{a \in f^{-1}(b)} \sum_{a' \in A} e^{-d_A(a', a)} w^A(a') w_{f^{-1}(b)}(a) = \sum_{a \in f^{-1}(b)} w_{f^{-1}(b)}(a),

or equivalently

aAe d B(f(a),b){ af 1(b)e d A(a b,a)w f 1(b)(a)}w A(a)=|f 1(b)|, \sum_{a' \in A} e^{-d_B(f(a'), b)} \Bigl\{ \sum_{a \in f^{-1}(b)} e^{-d_A(a'_b, a)} w_{f^{-1}(b)}(a) \Bigr\} w^A(a') = |f^{-1}(b)|,

which reduces to

h(b)=|f 1(b)|. h(b) = |f^{-1}(b)|.

This is true for all bBb \in B, so

|A|= bBh(b)w B(b)= bB|f 1(b)|w B(b). |A| = \sum_{b \in B} h(b) w_B(b) = \sum_{b \in B} |f^{-1}(b)| w_B(b).

Since all the fibres f 1(b)f^{-1}(b) are isometric, this gives

|A|=|F||B|, |A| = |F| |B|,

where FF is any of the fibres.

Now this proof is not at all important in itself, partly because the original proof was so simple and partly because the class of metric fibrations is very limited anyway (as investigated in detail by Yasuhiko Asao). But I give the full proof here to demonstrate that it really is a different argument, and perhaps the same method can be used to prove more impressive things in other contexts.

Posted by: Tom Leinster on February 27, 2025 2:39 PM | Permalink | Reply to this

Post a New Comment