This week I was in my home town of Adelaide, Australia, for the 2009 annual meeting of the Australian Mathematical Society. This was a fairly large meeting (almost 500 participants). One of the highlights of such a large meeting is the ability to listen to plenary lectures in fields adjacent to one’s own, in which speakers can give high-level overviews of a subject without getting too bogged down in the technical details. From the talks here I learned a number of basic things which were well known to experts in that field, but which I had not fully appreciated, and so I wanted to share them here.
The first instance of this was from a plenary lecture by Danny Calegari entitled “faces of the stable commutator length (scl) ball”. One thing I learned from this talk is that in homotopy theory, there is a very close relationship between topological spaces (such as manifolds) on one hand, and groups (and generalisations of groups) on the other, so that homotopy-theoretic questions about the former can often be converted to purely algebraic questions about the latter, and vice versa; indeed, it seems that homotopy theorists almost think of topological spaces and groups as being essentially the same concept, despite looking very different at first glance. To get from a space to a group, one looks at homotopy groups of that space, and in particular the fundamental group ; conversely, to get from a group back to a topological space one can use the Eilenberg-Maclane spaces associated to that group (and more generally, a Postnikov tower associated to a sequence of such groups, together with additional data). In Danny’s talk, he gave the following specific example: the problem of finding the least complicated embedded surface with prescribed (and homologically trivial) boundary in a space , where “least complicated” is measured by genus (or more precisely, the negative component of Euler characteristic), is essentially equivalent to computing the commutator length of the element in the fundamental group corresponding to that boundary (i.e. the least number of commutators one is required to multiply together to express the element); and the stable version of this problem (where one allows the surface to wrap around the boundary times for some large , and one computes the asymptotic ratio between the Euler characteristic and ) is similarly equivalent to computing the stable commutator length of that group element. (Incidentally, there is a simple combinatorial open problem regarding commutator length in the free group, which I have placed on the polymath wiki.)
This theme was reinforced by another plenary lecture by Ezra Getzler entitled “-groups”, in which he showed how sequences of groups (such as the first homotopy groups ) can be enhanced into a more powerful structure known as an -group, which is more complicated to define, requiring the machinery of simplicial complexes, sheaves, and nerves. Nevertheless, this gives a very topological and geometric interpretation of the concept of a group and its generalisations, which are of use in topological quantum field theory, among other things.
Mohammed Abuzaid gave a plenary lecture entitled “Functoriality in homological mirror symmetry”. One thing I learned from this talk was that the (partially conjectural) phenomenon of (homological) mirror symmetry is one of several types of duality, in which the behaviour of maps into one mathematical object (e.g. immersed or embedded curves, surfaces, etc.) are closely tied to the behaviour of maps out of a dual mathematical object (e.g. functionals, vector fields, forms, sections, bundles, etc.). A familiar example of this is in linear algebra: by taking adjoints, a linear map into a vector space can be related to an adjoint linear map mapping out of the dual space . Here, the behaviour of curves in a two-dimensional symplectic manifold (or more generally, Lagrangian submanifolds in a higher-dimensional symplectic manifold), is tied to the behaviour of holomorphic sections on bundles over a dual algebraic variety, where the precise definition of “behaviour” is category-theoretic, involving some rather complicated gadgets such as the Fukaya category of a symplectic manifold. As with many other applications of category theory, it is not just the individual pairings between an object and its dual which are of interest, but also the relationships between these pairings, as formalised by various functors between categories (and natural transformations between functors). (One approach to mirror symmetry was discussed by Shing-Tung Yau at a distinguished lecture at UCLA, as transcribed in this previous post.)
There was a related theme in a talk by Dennis Gaitsgory entitled “The geometric Langlands program”. From my (very superficial) understanding of the Langlands program, the behaviour of specific maps into a reductive Lie group , such as representations in of a fundamental group, étale fundamental group, class group, or Galois group of a global field, is conjecturally tied to specific maps out of a dual reductive Lie group , such as irreducible automorphic representations of , or of various structures (such as derived categories) attached to vector bundles on . There are apparently some tentatively conjectured links (due to Witten?) between Langlands duality and mirror symmetry, but they seem at present to be fairly distinct phenomena (one is topological and geometric, the other is more algebraic and arithmetic). For abelian groups, Langlands duality is closely connected to the much more classical Pontryagin duality in Fourier analysis. (There is an analogue of Fourier analysis for nonabelian groups, namely representation theory, but the link from this to the Langlands program is somewhat murky, at least to me.)
Related also to this was a plenary talk by Akshay Venkatesh, entitled “The Cohen-Lenstra heuristics over global fields”. Here, the question concerned the conjectural behaviour of class groups of quadratic fields, and in particular to explain the numerically observed phenomenon that about of all quadratic fields (with prime) enjoy unique factorisation (i.e. have trivial class group). (Class groups, as I learned in these two talks, are arithmetic analogues of the (abelianised) fundamental groups in topology, with Galois groups serving as the analogue of the full fundamental group.) One thing I learned here was that there was a canonical way to randomly generate a (profinite) abelian group, by taking the product of randomly generated finite abelian -groups for each prime . The way to canonically randomly generate a finite abelian -group is to take large integers , and look at the cokernel of a random homomorphism from to . In the limit (or by replacing with the -adics and just sending ), this stabilises and generates any given -group with probability
where ranges over all -groups; I do not know how to prove this identity other than via the above probability computation, the proof of which I give below the fold.
Based on the heuristic that the class group should behave “randomly” subject to some “obvious” constraints, it is expected that a randomly chosen real quadratic field has unique factorisation (i.e. the class group has trivial -group component for every ) with probability
whereas a randomly chosen imaginary quadratic field has unique factorisation with probability
The former claim is conjectural, whereas the latter claim follows from (for instance) Siegel’s theorem on the size of the class group, as discussed in this previous post. Ellenberg, Venkatesh, and Westerland have recently established some partial results towards the function field analogues of these heuristics.
— 1. -groups —
Henceforth the prime will be fixed. We will abbreviate “finite abelian -group” as “-group” for brevity. Thanks to the classification of finite abelian groups, the -groups are all isomorphic to the products
of cyclic -groups.
The cokernel of a random homomorphism from to can be written as the quotient of the -group by the subgroup generated by randomly chosen elements from that -group. One can view this quotient as a -fold iterative process, in which one starts with the -group , and then one iterates times the process of starting with a -group , and quotienting out by a randomly chosen element of that group . From induction, one sees that at the stage of this process (), one ends up with a -group isomorphic to for some -group .
Let’s see how the group transforms to the next group . We write a random element of as , where and . Observe that for any , is a multiple of (but not ) with probability . (The remaining possibility is that is zero, but this event will have negligible probability in the limit .) If is indeed divisible by but not , and is not too close to , a little thought will then reveal that . Thus the size of the -groups only grow as increases. (Things go wrong when gets close to , e.g. , but the total size of this event as ranges from to sums to be as (uniformly in ), by using the tightness bounds on mentioned below. Alternatively, one can avoid a lot of technicalities by taking the limit before taking the limit (instead of studying the double limit ), or equivalently by replacing the cyclic group with the -adics .)
The exponentially decreasing nature of the probability in (and in ) furthermore implies that the distribution of forms a tight sequence in : for every , one has an such that the probability that is less than for all choices of . (This tightness is necessary to prove the equality in (2) rather than just an inequality (from Fatou’s lemma).) Indeed, the probability that converges as to the coefficient in the generating function
In particular, this claim is true for the final cokernel . Note that this (and the geometric series formula) already yields (1) in the case of the trivial group and the order group (note that has order and in these respective cases). But it is not enough to deal with higher groups. For instance, up to isomorphism there are two -groups of order , namely and , whose automorphism group has order and respectively. Summing up the corresponding two expressions (1) one can observe that this matches the coefficient of (3) (after some applications of the geometric series formula). Thus we see that (3) is consistent with the claim (1), but does not fully imply that claim.
To get the full asymptotic (1) we try a slightly different tack. Fix a -group , and consider the event that the cokernel of a random map is isomorphic to . We assume so large that all elements in have order at most . If this is the case, then there must be a surjective homomorphism such that the range of is equal to the kernel of . The number of homomorphisms from to is (one has to pick generators in ). If is large, it is easy to see that most of these homomorphisms are surjective (the proportion of such homomorphisms is as ). On the other hand, there is some multiplicity; the range of can emerge as the kernel of in different ways (since any two surjective homomorphisms with the same kernel arise from an automorphism of ). So to prove (1), it suffices to show that for any surjective homomorphism , the probability that the range of equals the kernel of is
The range of is the same thing as the subgroup of generated by random elements of that group. The kernel of has index inside , so the probability that all of those random elements lie in the kernel of is . So it suffices to prove the following claim: if is a fixed surjective homomorphism from to , and are chosen randomly from the kernel of , then will generate that kernel with probability
where means “bounded uniformly in “, and there are factors here. As in the previous argument, one can now imagine starting with the group (5), and then iterating times the operation of quotienting out by the group generated by a randomly chosen element; our task is to compute the probability that one ends up with the trivial group by applying this process.
where there are factors of . The group is increasing in size, so the only way in which one ends up with the trivial group is if all the are trivial. But if is trivial, the only way that is trivial is if the randomly chosen element from (6) has a component which is invertible (i.e. not a multiple of ), which occurs with probability (assuming is large enough). Multiplying all these probabilities together gives (4).