The diamond lemma November 20, 2009
Posted by David Speyer in Uncategorized.7 comments
A few results
1 (Bjorner, Eidelman and Ziegler) Suppose we have a finite collection of great circles on a sphere, none of them through the north or nouth pole. Let be the set of regions in the complement of these circles, and suppose that every region is a triangle. Put a partial order on
by
if
is south of every circle that
is south of. Show that, for
and
, there is some
such that
if and only if
and
.
2 (Mozes, see also IMO 1986.3) Let be a finite graph, and let
be a real valued function on the vertices of
. Consider the following (solitaire) game: find a vertex
for which
is negative. Replace
by
and, for every vertex
that neighbors
, decrease
by
. The game ends if all of the
are nonnegative. You and I start playing with the same graph and the same
. Show that, if my game ends in
moves at position
, then your game will end in the same position, in the same number of moves.
3 (Poincare, Birkhoff and Witt) Define to be the ring generated by
,
and
, subject to the relations
,
and
. Show that any element of
can be expressed uniquely as a sum of elements of the form
. (Uniqueness is up to rearranging the sum and combining like terms.)
4 (Jordan and Holder) Let be a finite group. Let
by two sequences of subgroups such that is normal in
, with
simple, and the same is true for the
’s. Then
and the quotients
are a permutation of the quotients
.
What do all of these have in common? You can remember all of their solutions by drawing the same figure — the diamond!
Quantum mechanics and geometry November 16, 2009
Posted by Scott Morrison in crazy ideas, differential geometry, quantum mechanics.19 comments
Here’s a nice little story about quantum mechanics, which surprisingly few mathematicians seem to know about. The essential idea is “quantum mechanics on the projective space looks remarkably like classical mechanics”! Everything I say here comes from two papers Geometrical Formulation of Quantum Mechanics (gr-qc/9706069), Ashtekar and Schilling, and Geometry of stochastic state vector reduction (#), Hughston. If you’re interested in more details, I’d encourage you to read these papers — they’re well written and contain many further references.
As you’ll recall, quantum mechanics says that systems are described by Hilbert spaces, with states given by vectors. I’ll stick with finite-dimensional systems (e.g. particles with spin) for simplicity, but this isn’t essential for what follows. A particular self-adjoint operator H, called the Hamiltonian, governs the dynamics of the system via the Schrodinger equation . Quantum mechanics also says something about measurement, which we’ll come to in a moment.
Now the Schrodinger equation defines a one parameter flow via . This preserves the unit sphere in our Hilbert space, and descends to a flow on the projective space. The projective space is naturally a Kahler manifold, and in particular a symplectic manifold, so we immediately ask if this flow is Hamiltonian. The answer is unsurprising but underappreciated: yes, the flow is Hamiltonian, and the Hamiltonian function is just the expectation value of the Hamiltonian operator
.
The example you should have in mind at this point is a simple spin 1/2 system in a magnetic field, whose Hilbert space is , Hamiltonian
. The projective space is
and the Hamiltonian function we get as the expectation value is just the usual
coordinate of the standard embedding of
in
. The Hamiltonian flow rotates points along lines of latitude, completing each orbit in
units of time (go calculate the unitary).
Eigenvectors for the Hamiltonian operator correspond to critical points for the Hamiltonian function, and in particular fixed points of the flow. (That’s the north and south poles in the example above.) The flow described above is just a rigid rotation of the sphere, and in fact this is generally true: the flow on projective space coming from a self-adjoint operator is Killing, that is, it preserves the metric. This is the first appearance of the metric, but it’s really essential, because the converse of this statement is true — Hamiltonian functions whose corresponding flows preserve the metric are precisely those which arise as expectation values of self-adjoint operators on the Hilbert space.
That’s not all the metric is good for! Quantum mechanics also tells us something about what happens during “measurement”. This is that when a “measurement” (yes, I’m going to keep using scare quotes, so you’re not allowed to argue with me about what measurement means) occurs, the system jumps discontinuously to one of the eigenvector of the Hamiltonian, and the probabilities of reaching the the various different eigenvectors are given by the absolute value squared of the inner product of the current state and the eigenvector. This probability is exactly , where
is the metric distance between the current state and the corresponding fixed point. (In the spin 1/2 example, let’s normalise this metric so it just measures angles between points on S^2.)
It gets even better, but at this point I’m going to stop talking about the conventional description of quantum mechanics, and begin describing a proposed modification of quantum mechanics. Physicists have already thought a lot about whether modifications like this are reasonable, but I’ll postpone that for now. At this point, if you’re reading the actual articles, we’re switching from the Ashtekar/Schilling paper to the Hughston one.
So what is this proposed modification? Well, let’s imagine the symplectic flow as some differential equations describing the trajectory of our state. We now want to add in a stochastic term, in particular an isotropic Brownian motion term with an amplitude that depends on the position in the projective space. This amplitude will be (some simple function of?) the energy uncertainty, namely the quantity . In fact, this energy uncertainty is exactly the squared velocity of the symplectic flow with respect to the metric. In our spin 1/2 example this velocity is
(remember we have rigid rotation) and since
,
. What happens? Well, at the fixed points it’s easy to see that the energy uncertainty is zero, so we might expect that the Brownian motion term drives the state away from areas with high energy uncertainty, towards the eigenstates — just like what is supposed to happen during “measurement”. This is precisely what happens: Hughston does a lot of financial mathematics, and he knows his stochastic calculus. His Proposition 5 says the energy uncertainty in this model is a supermartingale, that is, an on average decreasing function. As time passes, you expect to end up at one of the fixed points, each with various probabilities. Note that these are honest, stochastic probabilities, not just numbers we’ve declared to be interpreted as probabilities as in the naive set up. (ED: see below for Greg’s comment on this.) His next result, of course, is that these probabilities match up with what we want, namely that they are given simply by metric distances on the projective space.
I think this is a beautiful picture. The measurement process is now something more concrete, a stochastic term in the governing equation, and we can resume thinking probabilistically about quantum mechanical probabilities.Very roughly, you’re meant to think that in an “isolated quantum system” the stochastic term is extremely small, and symplectic flow dominates. On the other hand, during a “measurement”, presumably when the system is coupled with the macroscopic world, the scale of energy uncertainties becomes extremely large and the stochastic terms dominates, and the system is quickly driven to a fixed point of the symplectic flow.
You have to think hard, however, about where this stochastic terms comes from, and what it means. Hughston has some ideas about quantum gravity, but I’m not so sure I like them! There are also lots of no-go theorems ruling out stochastic variations on quantum mechanics, and I have to admit to not being clear about whether these results affect Hughston’s model.
A final idea for further thought, from the Ashtekar/Schilling paper: we can fully describe quantum mechanics solely in terms of the Kahler manifold structure of the projective space, so why not drop the requirement that it’s a projective space? That is, can we imagine systems on other Kahler manifolds? It seems that all we lose is the fact that on any two points have a canonical
through them — i.e. that we’re allowed to form linear superpositions of states. Is this really essential? Where might we look for finite dimensional systems described by “exotic” Kahler manifolds? And all you quantum topologist gallium-arsenide engineers out there — how might we try to make one?
Why is physical intuition possible? November 16, 2009
Posted by Noah Snyder in Uncategorized.3 comments
This post is based on a conversation I had with Allan Adams at Mathcamp a few summers ago, and I was reminded of it by an aside in Mike Freedman’s talk in Scott’s backyard on Friday. As usual with blog posts based on other people’s talks, all good ideas in this post should be attributed to Allan and Mike and all mistakes to me. Furthermore I think everything I say here is obvious to people who actually know physics.
My basic confusion was how physical intuition (in particular in quantum field theory) could be applied to so many mathematical settings when there’s only one physical world so there’s no reason to think any intuition built up within that single example would apply any more generally than that one example. What Allan pointed out to me is that it’s not true that physicists are only studying one example. Although there may only be one fundamental theory of physics, by looking at various particular physical systems the limiting behavior becomes its own theory. The physics at the surface of a black hole can be thought of as its own example; the physics of superconductors is its own example; etc. Because all of these examples are physical (they involve minimizing actions, they’re quantum, etc.) they have a lot of attributes in common, so intuition and general techniques can be developed by understanding their commonalities.
Mike made two comments in his talk (on K-theory and superconductors) that flesh out this idea further. He was discussing the BCS superconductor and explained that when physicists refer to a theory by initials they’re not just being polite, what they mean is that you’re studying the mathematical model rather than any particularly instantation of it. In particular, the model doesn’t care if there are exactly 10^9 electron pairs or the exact composition of the material, it is studying the abstract setting that appears in the limit. By calling it the “BCS superconductor” they mean that in some sense they’re studying the physics of a different world. In particular, in the BCS setting since you’re assuming that there’s a huge sea of electron pairs the “vacuum” consists of this huge sea. This explains how physicists can develop intuition for more general notions of vacuum: they’re not always studying the absolute vacuum, they’re also studying other systems with states that have the properties of being a “vacuum.” This particular vacuum has a delightfully strange property. Since a new electron pair doesn’t change the underlying vacuum, in this “world” electric charge isn’t preserved!
Choosing problems for grad. students November 11, 2009
Posted by David Speyer in Uncategorized.28 comments
I am coming to the point in my career where I will be expected to take graduate students, and I’d like some advice about finding problems for them. How responsible am I for making sure that a problem is solvable and not already under attack elsewhere? I have a (private) list of problems that might be suitable for attack with tropical methods, or using cluster algebras. In most cases, the reason that I have not worked on these problems myself is that I would have to do a fair bit of research to find out the current state of the field and make sure that I wasn’t missing something stupid. Is it fair to pass this sort of thing off to a graduate student?
Remarks on career advice November 11, 2009
Posted by Scott Carnahan in Math Overflow, jobs, math life.13 comments
There have been a few questions about the job application process on MathOverflow, and I’d like to make a few remarks in an open forum.
First of all, I think there have been some really good questions, and really good answers. I found it especially illuminating when mathematicians who have been on hiring committees weighed in on what they thought was important in an application. Depending on your social circle and who your advisor is, it can be difficult to get accurate information when you are a graduate student (or a postdoc – I recently learned that my research statement was too long by a factor of 2 or 3). So, hats off to the people who give well-informed advice. Please keep it up.
Classified problem November 4, 2009
Posted by Scott Carnahan in combinatorics.27 comments
Today at tea, some grad students were discussing the following enumeration problem:
How many elements of
have zeroes in all diagonal entries?
I think they [Redacted]. The answer is apparently known but classified. It’s a sort of q-analog of derangements (i.e., permutations without fixed points), but if you take the derangement formula and add q-numbers in the naive way, the formula doesn’t seem to work for n > 2.
Concrete Categories October 26, 2009
Posted by David Speyer in Algebraic Topology, Category Theory.12 comments
In many introductions to category theory, you first learn the notion of a concrete category: A concrete category is a collection of sets, called the objects of the category and, for each pair of objects, a subset of the maps
. (There are, of course, axioms that these things must obey.) In a concrete category, the objects are sets, and the morphisms are maps that obey certain conditions. So the category of groups is concrete: a map of groups is just a map of the underlying sets such that multiplication is preserved. So are the category of vector spaces, topologicial spaces, smooth manifolds and most of the other most intuitive examples of categories.
Using terminology from a discussion at MO, I’ll call a category concretizable if it is isomorphic to a concrete category. For example, can be concretized by the functor which sends a set
to the set
of subsets of
, and sends a map of sets
to the preimage map
.
At one point, I learned of a result of Freyd: The category of topological spaces, with maps up to homotopy, is not concretizable. I thought this was an amazing reflection of how subtle homotopy is. But now I think this result is sort of a cheat. As I’ll explain in this post, if you are the sort of person who ignores details of set theory, then you might as well treat all categories as concrete. My view now is that specific concretizations are very interesting; but the question of whether a category has a concretization is not. I’ll also say a few words about small concretizations, and Freyd’s proof.
MSC vs. ArXiv (and some interesting info on mathjobs) October 25, 2009
Posted by Noah Snyder in conferences, inside baseball, jobs, math life, the arXiv.18 comments
One of my pet peeves is how annoyingly the AMS’s math subject classification is for people working in quantum algebra and quantum topology. The MSC has 97 different major subjects and my field is not one of them, and instead appears many times a subheading. In the new 2009 classification there’s at least the following: 16T, 17B37, 18D10, 20G42, 33D80, 57R56, 58B32, 81R50, and 81T45. Here I’m only counting things that are obviously quantum algebra and quantum topology (for example I didn’t list subfactors, quantum computation, knot invariants, etc.) By way of contrast, on the ArXiv there are only 32 categories, yet one of them (math.QA) contains the vast majority of work in my field (of course, many of those are cross-posted).
This mini-rant of mine came up at dinner at an AMS meeting in Waco (more on the excellent “fusion categories” special session later). Someone pointed out an interesting side-effect of this issue that I hadn’t thought of. One of the awesome things about mathjobs is that rather than simply having a large paper stack of applications, the people on hiring committees can instead sort the applications automatically in many different ways. It makes a lot of sense that mathjobs has this feature, but none of us who were on the applying side of things had ever considered it. Here are a few examples of things you might want to search for: look at people applying from a specific school, find everyone who has a recommendation letter from Prof. X, and (relevant to this post) sort by AMS subject classification.
This means that choosing the right AMS subject classifications is actually somewhat important. If you choose poorly then someone who might be interested in hiring you might never actually find your application among the hundreds they’re looking through. So if you’re in a situation like mine it’s worth asking a professor or two which AMS subject classifications they’d be most likely to look through.
Since then I’ve been wondering whether it might be a useful for mathjobs that the data they ask for also include which arxiv classifications applicants have posted preprints under, as that’s the search that I would want to use if I were on a hiring committee. What do people think? Mathjobs is very responsive to requests, so if people think this makes sense I may send them an email.
Rhombus tilings and an over-constrained recurrence October 21, 2009
Posted by David Speyer in combinatorics, things I don't understand.12 comments
I recently visited Robin Pemantle and his student Peter Du at UPenn. We talked about tilings of planar regions, generating functions and asymptotics. Towards the end, we talked about a bit about a very classical example, which is what I want to tell you about today.
In most planar tiling problems, the goal is an asymptotic analysis for tilings of large regions, because there isn’t enough structure to do better. This is the approach taken in the beautiful work of Kenyon, Okounkov, and collaborators.1, 2, 3 Sometimes, there is enough structure to give exact solutions with explicit generating functions. This is the situation with Aztec Diamonds, fortresses, and other several other examples.4,5 The central name here is Jim Propp 6, 7, who has developed this theory together with many undergraduate and graduate students (including me).
And then there is one case: rhombus tilings of a hexagon. These have almost too much structure; more structures than one would expect to be compatibly possible. In this post, I want to talk about this example. In particular, I want to ask you a question which I thought about a bit on the train ride back and see whether any of you have some thoughts.
Polymath projects on StackExchange/mathoverflow? October 20, 2009
Posted by Scott Morrison in Math Overflow, polymath.6 comments
I’ve been thinking a bit about whether the StackExchange software (which mathoverflow is running on) could be used to host a polymath project.
I’d imagine it involving many many questions and answers, with links between them, modelling the division of the “big question” into its constituent chunks.
There are some big advantages — in particular, it’s easier to pay attention to individual parts, because there’s more structure than in blog comments.
As a first approximation, you might start out like this: Terry asks the polymath7 problem, linking elsewhere for motivation and background. Tim posts a first ‘answer’: “Could we attack this by proving Lemmas X, Y and then generalising the approach of Theorem Z?” and at the same time creates questions corresponding the Lemmas X and Y and a more open question about Theorem Z. Other participants can then go to those questions to give their thoughts. Answers don’t have to be “answers” in the convention sense — they’re just meant to correspond to “ideas”, and should often link to a new question if it’s obvious that the idea needs further development. The StackExchange software allows for comments on answers, which would allow short responses to previous answers.
The big disadvantages of StackExchange are that
* at this point, there’s no LaTeX support, although this will hopefully change.
* the reputation system inhibits new participants, at least at first (they can still ask and answer questions, but commenting and upvoting are limited).
* it may end up harder to understand the “big picture” than in a blog thread.
The solution to the first two of these may be to try a polymath project at mathoverflow.net itself, rather than a new installation. Many participants will already have reputation (and on an established site it’s very easy to gain enough reputation to comment and upvote, because any decent question will quickly garner reputation). It’s easy to filter questions by tags, so I think you could ignore everything else happening on mathoverflow.net if you wanted to.
The last problem might be addressed by having a “community wiki” answer at the top of each question, summarising progress so far, as well as regular progress reports on blogs.