Considering that the last novel of Haruki Murakami
is scheduled to appear in English translation in October this year, can we deduce anything about language (or anything else) from the fact that the German translation
already appeared last year?
Considering that the last novel of Haruki Murakami
is scheduled to appear in English translation in October this year, can we deduce anything about language (or anything else) from the fact that the German translation
already appeared last year?
I had promised a while ago to say more about the original proof of Peter-Weyl of the “completeness theorem” for compact groups: matrix coefficients of finite-dimensional irreducible representations span a dense subspace of , for a compact group
. With some delay, here we go…
Before giving just a brief overview of the strategy in the paper of Peter and Weyl, here are some mostly historical or psychological remarks that came to mind while looking at the paper and related sources:
So what is the Peter-Weyl argument? I’ll first say how it differs from the modern treatments (at least, those I have seen): either for philosophical reasons (which is conceivable, in view of Weyl’s fairly constructivist ideas) or because abstract Hilbert space theory was not within their frame of thought, they do not use the type of argument that comes the most naturally to mind today: to show that the finite-dimensional matrix coefficients span a dense subspace, one shows that its orthogonal is zero. This reduces, for a given non-zero function on
, to finding a single finite-dimensional unitary representation
for which
is not orthogonal to the corresponding space of matrix coefficients. Instead, Peter and Weyl more or less present an algorithmic way to, in principle, decompose
into a combination of matrix coefficients of finite-dimensional representations.
In both cases, however, the basic mechanism to produce the finite-dimensional representations is the same: one uses integral operators on , constructed as convolution operators using the “left” regular representation, and which therefore commute with the “right” regular one. Any non-zero eigenspace of such an operator is a finite-dimensional subrepresentation of the right-regular representation, and basically because any function gives a suitable integral operator, it is not too surprising that this gives enough finite-dimensional unitary representations.
This is the principle. The Peter-Weyl constructive method is maybe best illustrated in the case of the circle, where the theory becomes that of Fourier series (of course, the completeness in that case is older and has many different proofs, but in fact Weyl first implemented the strategy in the related case of Bohr’s almost periodic functions, to get the analogue of Parseval’s identity in that setting; this was in the same volume of Math. Annalen, in fact.) Here, given a 1-periodic function
what they do is basically to construct (by iterative procedures) the successive approximations
of the Fourier series such that
where the sets of frequencies are increasing (for inclusion), and involve the successive Fourier coefficients with decreasing magnitude. In other words,
is the set of frequencies where
is maximal,
adds all frequencies for which
is the second-largest, etc. This is related to the previous discussion because the
are the eigenvalues of the convolution operator with kernel
, and
are those for
, the corresponding non-negative kernel.
Using a rather cute argument, Peter and Weyl are able to show that (the analogue for compact gropups of) this process leads to approximations which converge in to
, i.e., to a proof of the Parseval identity, which is the completeness theorem.
Altogether, for the circle, this proof might be a bit involved, but it is very nice and conceptual, and would certainly make interesting exercises in a functional analysis class. I had not seen it anywhere before, but it could be just personal ignorance of the literature… I also have no idea if the constructive aspect is actually numerically interesting.
To justify the title of the post: the way I think about this is that they “peel off” the largest contributions to the function , one by one, as one may peel an onion…
(Or in other words, the Klein bottle
is not a Riemann surface…)
I bought this little marvel in the shop of the excellent Giessen Mathematikum math museum. My two favorite exhibits were this playful shadow (a sculpture of Larry Kagan)
and a rather thought-provoking physical illustration of what is a “one in a million chance”
Searching on Numdam for the papers of É. Cartan, I noticed one from 1927 entitled “Sur certains cycles arithmétiques”. Although this was not the one I was looking for, natural curiosity immediately had the better of me, and I downloaded the article, wondering what marvels could be there: an anticipation of Heegner cycles? special subvarieties of Shimura varieties?
As usual, the truth was even more surprising than such exalted expectations. Indeed, Cartan, considering “le problème de Mathématiques élémentaires proposé au dernier concours d’agrégation”, raises and solves the following question:
Classify, for any base
, the integers
such that, when
is written in base
, the integers obtained by all cyclic permutation of the digits are in arithmetic progression.
This is rather surprising, since I had no idea that É. Cartan had any interest in elementary number theory; considering that he was 58 years old in 1927, I find this quite whimsical and refreshing…
Here is an example: for base 10, take ; the cyclic permutations yield the additional integers
and
; and — lo and behold — we have indeed
exhibiting the desired arithmetic progression. (One also allows a leading digit being , wich can be permuted with the others, so that, for instance,
, with companions
and
, is also a solution.)
More impressively consider ; with — in order — the progression
with common difference equal to (which is also the smallest of the 6 integers.)
Cartan finds two distinct sources of such cycles, which he calls “de première [resp. de seconde] catégorie”, and classifies them, for any base . The original problème d’agrégation asked for cycles of lengths 3 and 6 in base 10 and Cartan finds 3 cycles of length 6 and 6 of length 3. I wonder how many students managed to solve this question…
I won’t write down the solutions here — for the moment at least –, so that those readers who are interested can try their own skill…
The fundamental fact about the representation theory of a compact topological group is the Peter-Weyl Theorem, which can be described as follows: the regular representation of
on
(defined using the probability Haar-measure on
) decomposes as an orthogonal Hilbert direct sum of the spaces of matrix coefficients of the finite-dimensional irreducible representations of
. (Books, for instance the one of Knapp on semisimple Lie groups, often include more in what is called Peter-Weyl Theory, but this is the statement that is proved in the original paper.)
As I am currently preparing to write down a proof of the Peter-Weyl theorem for my notes on representation theory, I had a look at this paper. Although I probably won’t follow it quite completely, I found it very interesting — it is quite subtly different from all modern treatments I have seen, in an interesting way, and without being much more complicated than what is found, e.g., in Knapp’s book. (For a short masterful online account, this post of Terry Tao is very good; from a search in the same Göttingen archive web site, it seems that — maybe — the modern treatment dates back to Pontryagin, in 1936.)
In any case, the question for today is: Who was Peter? Only the initial “F.” and the affiliation “in Karlsruhe” identifies this coauthor on the original paper (even the “F.” is misread as “P.” on the PDF cover page…) It seem he was a student of Weyl, but note that there is no Peter on the math genealogy page for Weyl. (A joke here at ETH, is that when the lecture room known as the Hermann Weyl Zimmer is renovated this summer, some unfortunate skeletons will be found in the closets and under the floor, or behind the blackboards…)