Skip to content →

Chinese remainders and adele classes

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 Cohn (( always, i wonder how one might ‘discreetly request’ these remainders… )) :

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. (( according to ChinaPage the answer is contained in the song on the left hand side. ))

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 N=n1n2nk with the ni pairwise coprime, then there is an isomorphism of abelian groups Z/NZZ/n1Z×Z/n2Z××Z/nkZ. Equivalently, given coprime numbers ni one cal always solve the system of congruence identities

{xa1 (mod n1)xa2 (mod n2)xak (mod nk)

and all integer solutions are congruent to each other modulo N=n1n2nk.

We will need this classical result to prove that
Q/ZA/R
where (as last time) A is the additive group of all adeles and where R is the subgroup pZp (i’ll drop all ‘hats’ from now on, so the p-adic numbers are Qp=Q^p and the p-adic integers are denoted Zp=Z^p).

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 D of Qp consists of zero and a system of representatives of units of Zp modulo pZp. The most obvious choice of digits is D=0,1,2,,p1 which we will use today. (( later we will use another system of digits, the Teichmuller digits using p1-th root of unities in Qp. )) Fixing a set of digits D, any p-adic number apQp can be expressed uniquely in the form

ap=n=deg(ap)ap(n)pn with all ‘coefficients’ ap(n)D and deg(ap) being the lowest p-power occurring in the description of ap.

Recall that an adele is an element a=(a2,a3,a5,)pQp such that for almost all prime numbers p apZp (that is deg(ap)0). Denote the finite set of primes p such that deg(ap)<0 with P=p1,,pk and let di=deg(api). Then, with N=p1d1p2d2pkdk we have that NapiZpi. Observe that for all other prime numbers qP we have  (N,q)=1 and therefore N is invertible in Zq.

Also N=pidiKi with KiZpi. With respect to the system of digits D=0,1,,p1 we have

Napi=Kij=0di1api(di+j)pij=αi+Kijdiapi(di+j)pijZpi

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

{Mα1 modulo p1d1Mα2 modulo p2d2Mαk modulo pkdk

But then, for all 1ik we have NapiM=pidij=0bi(j)pj (with the bi(j)D) and therefore

apiMN=1Kij=0bi(j)pjZpi

But for all other primes qP we have that αqZq and that NZq whence for those primes we also have that αqMNZq.

Finally, observe that the diagonal embedding of Q in pQp lies entirely in the adele ring A as a rational number has only finitely many primes appearing in its denominator. Hence, identifying QA via the diagonal embedding we can rephrase the above as

aMNR=pZp

That is, any adele class A/R has as a representant a rational number. But then, A/RQ/Z which will allow us to give an adelic version of the Bost-Connes algebra!

Btw. there were 301 eggs.

Published in featured

Comments

Leave a Reply

Your email address will not be published. Required fields are marked *