Noncommutative geometry and the Riemann zeta function
Oystein Ore mentions the following puzzle from Brahma-Sphuta-Siddhanta (Brahma’s Correct System) by Brahmagupta :
An old woman goes to market and a horse steps on her basket and crashes the eggs. The rider offers to pay for the damages and asks her how many eggs she had brought. She does not remember the exact number, but when she had taken them out two at a time, there was one egg left. The same happened when she picked them out three, four, five, and six at a time, but when she took them seven at a time they came out even. What is the smallest number of eggs she could have had?
Here’s a similar problem from “Advanced Number Theory” by Harvey Cohn1 :
Exercise 5 : In a game for guessing a person’s age x, one discreetly requests three remainders : r1 when x is divided by 3, r2 when x is divided by 4, and r3 when x is divided by 5. Then x=40 r1 + 45 r2 + 36 r3 modulo 60.
Clearly, these problems are all examples of the Chinese Remainder Theorem.
Chinese because one of the first such problems was posed by Sunzi [Sun Tsu] (4th century AD)
in the book Sunzi Suanjing.2
There are certain things whose number is unknown.
Repeatedly divided by 3, the remainder is 2;
by 5 the remainder is 3;
and by 7 the remainder is 2.
What will be the number?
The Chinese Remainder Theorem asserts that when
with the
pairwise coprime, then there is an isomorphism of abelian groups
. Equivalently, given coprime numbers
one cal always solve the system of congruence identities

and all integer solutions are congruent to each other modulo
.
We will need this classical result to prove that
where (as
last time)
is the additive group of all adeles and where
is the subgroup
(i’ll drop all ‘hats’ from now on, so the p-adic numbers are
and the p-adic integers are denoted
).
As we will have to do calculations with p-adic numbers, it is best to have them in a canonical form using digits. A system of digits
of
consists of zero and a system of representatives of units of
modulo
. The most obvious choice of digits is
which we will use today.3 Fixing a set of digits
, any p-adic number
can be expressed uniquely in the form
with all ‘coefficients’
and
being the lowest p-power occurring in the description of
.
Recall that an adele is an element
such that for almost all prime numbers p
(that is
). Denote the finite set of primes p such that
with
and let
. Then, with
we have that
. Observe that for all other prime numbers
we have
and therefore
is invertible in
.
Also
with
. With respect to the system of digits
we have

Note that
and the Chinese Remainder Theorem asserts the existence of an integral solution
to the system of congruences

But then, for all
we have
(with the
) and therefore

But for all other primes
we have that
and that
whence for those primes we also have that
.
Finally, observe that the diagonal embedding of
in
lies entirely in the adele ring
as a rational number has only finitely many primes appearing in its denominator. Hence, identifying
via the diagonal embedding we can rephrase the above as

That is, any adele class
has as a representant a rational number. But then,
which will allow us to give an adelic version of the Bost-Connes algebra!
Btw. there were 301 eggs.
- always, i wonder how one might ‘discreetly request’ these remainders… [↩]
- according to ChinaPage the answer is contained in the song on the left hand side. [↩]
- later we will use another system of digits, the Teichmuller digits using
-th root of unities in
. [↩]
adeles, approximation, chinese remainder theorem, Connes, groups, puzzle
1 comment
Posted in geometry
Written on Thu, 31 January 2008 at 3:48 pm
Tags: adeles, approximation, chinese remainder theorem, Connes, groups, puzzle
If you liked this post, then consider subscribing to our full RSS feed.
February 2nd, 2008 at 2:52 pm
[...] Hecke algebra Bost-Connes for ringtheorists BC stands for Bi-Crystalline graded adeles and ideles Chinese remainders and adele classesabc on adelic [...]