Download Lagrange`s Four Square Theorem

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Wiles's proof of Fermat's Last Theorem wikipedia , lookup

List of important publications in mathematics wikipedia , lookup

Collatz conjecture wikipedia , lookup

Mathematics of radio engineering wikipedia , lookup

List of prime numbers wikipedia , lookup

Fermat's Last Theorem wikipedia , lookup

Quadratic reciprocity wikipedia , lookup

Classical Hamiltonian quaternions wikipedia , lookup

Addition wikipedia , lookup

Proofs of Fermat's little theorem wikipedia , lookup

Transcript
7/8/2011

Any natural number 𝑁 can be represented as
𝑁 = π‘Ž 2 + 𝑏 2 + 𝑐 2 + 𝑑2
where π‘Ž, 𝑏, 𝑐, and 𝑑 are integers.
Erin Compaan and Cynthia Wu
SPWM 2011




Diophantus – ca. 200 A.D.
Bachet – 1621
Fermat – 17th c.
Lagrange – 1770
Lagrange’s Four Square Theorem:
Our goal is to prove this theorem using Hurwitz
Quaternions.


Denoted by ℍ
Members of a non-commutative division algebra

Form of quaternions:
π‘Ž + 𝑏𝑖 + 𝑐𝑗 + π‘‘π‘˜
where π‘Ž, 𝑏, 𝑐, and 𝑑 are real numbers

Fundamental formula of quaternion algebra:
𝑖 2 = 𝑗 2 = π‘˜ 2 = π‘–π‘—π‘˜ = βˆ’1
1
7/8/2011

Not that much of a difference!
𝑯 = *π‘Ž + 𝑏𝑖 + 𝑐𝑗 + π‘‘π‘˜ πœ–β„ ∢ π‘Ž, 𝑏, 𝑐, 𝑑 πœ– β„€ or π‘Ž, 𝑏, 𝑐, 𝑑 πœ–



1
β„€+ +
2
So now π‘Ž, 𝑏, 𝑐, and 𝑑 are either all integers or all half
integers
Half integers: all numbers that are half of an odd
1
integer – the set β„€ + .
2
A Hurwitz quaternion 𝛼 is prime if it divisible only
1
1
by the quaternions ±1, ±π‘–, ±π‘—, ±π‘˜, and ± ± 𝑖 ±
1
𝑗
2

1
2
2
2
± π‘˜, and multiples of 𝛼 with these.
A Hurwitz quaternion 𝛽 divides 𝛼 if there exists a
Hurwitz quaternion πœ‘ such that 𝛼 = π›½πœ‘ or 𝛼 = πœ‘π›½.
β—¦ EG: 7/2, -13/2, 8.5

A Lipschitz quaternion is a quaternion of
the form π‘Ž + 𝑏𝑖 + 𝑐𝑗 + π‘‘π‘˜, with a, b, c, d πœ– β„€.
β—¦ E.g. 1 + 7𝑖 βˆ’ 83𝑗 + 12π‘˜.
Any natural number 𝑁 can be represented as
𝑁 = π‘Ž 2 + 𝑏 2 + 𝑐 2 + 𝑑2
where π‘Ž, 𝑏, 𝑐, and 𝑑 are integers.
Prove this using Hurwitz Quaternions:
𝑯 = *π‘Ž + 𝑏𝑖 + 𝑐𝑗 + π‘‘π‘˜ πœ–β„ ∢ π‘Ž, 𝑏, 𝑐, 𝑑 πœ– β„€ or π‘Ž, 𝑏, 𝑐, 𝑑 πœ– β„€+
2
7/8/2011


If 𝑝 is a prime 𝑝 = 2𝑛 + 1, 𝑛 πœ– β„•, then there are
𝑙, π‘š πœ– β„€ such that 𝑝 divides 1 + 𝑙2 + π‘š2.
If a Hurwitz prime divides a product of
Hurwitz quaternions 𝛼𝛽, then the prime
divides 𝛼 or 𝛽.


Then 𝑒 = π‘Ž + 𝑏𝑖 + 𝑐𝑗 + π‘‘π‘˜ 2 = 𝛼 2 and
𝑣 = 𝑀 + π‘₯𝑖 + 𝑦𝑗 + π‘§π‘˜ 2 = 𝛽 2 , for some Lipschitz
quaternions 𝛼 and 𝛽.
Then
𝑒𝑣 = 𝛼 𝛽 2 = 𝛼𝛽 2
= 𝐴 + 𝐡𝑖 + 𝐢𝑗 + π·π‘˜ 2= 𝐴2 + 𝐡 2 + 𝐢 2 + 𝐷2 for some
𝐴, 𝐡, 𝐢, 𝐷 πœ– β„€.


Base Cases
1 = 12 + 02 + 02 + 02
2 = 12 + 12 + 02 + 02
If two numbers can be written as a sum of four integer
squares, then so can their product.
Proof: Suppose that 𝑒 = π‘Ž 2 + 𝑏2 + 𝑐 2 + 𝑑 2 and
𝑣 = 𝑀 2 + π‘₯2 + 𝑦2 + 𝑧2.






Suppose 𝑝 is an odd prime which has a non-trivial
Hurwitz factorization 𝑝 = (π‘Ž + 𝑏𝑖 + 𝑐𝑗 + π‘‘π‘˜)𝛼.
Conjugating: 𝑝 = 𝑝 = 𝛼(π‘Ž βˆ’ 𝑏𝑖 βˆ’ 𝑐𝑗 βˆ’ π‘‘π‘˜).
Multiplying the equations:
𝑝2 = π‘Ž + 𝑏𝑖 + 𝑐𝑗 + π‘‘π‘˜ 𝛼𝛼 π‘Ž βˆ’ 𝑏𝑖 βˆ’ 𝑐𝑗 βˆ’ π‘‘π‘˜
= π‘Ž2 + 𝑏 2 + 𝑐 2 + 𝑑 2 𝛼 2
Since 𝑝 is prime, the factors of 𝑝2 must both be
𝑝. Thus 𝑝 = π‘Ž 2 + 𝑏 2 + 𝑐 2 + 𝑑2.
If π‘Ž, 𝑏, 𝑐, and 𝑑 are integers , we’re done.
If not, we can still show that p is a sum of four
integer squares.
3
7/8/2011



Now let 𝑝 be an odd prime. Then there exist integers
𝑙 and π‘š such that 𝑝 divides 1 + 𝑙2 + π‘š2.
Then 𝑝 divides (1 + 𝑙𝑖 + π‘šπ‘—)(1 βˆ’ 𝑙𝑖 βˆ’ π‘šπ‘—). By the
previously stated lemma, if 𝑝 were a Hurwitz prime,
it must divide one of these factors.
1
𝑙
βˆ’ 𝑖
𝑝
𝑝

1
𝑝
𝑙
𝑝
But this would imply that + 𝑖 +
π‘š
βˆ’ 𝑗
𝑝
π‘š
𝑗
𝑝
or



is a Hurwitz integer, a contradiction.
Thus 𝑝 is not a Hurwitz prime.
Fermat’s Two Square Theorem: If a prime 𝑝 is of the form 4𝑛 + 1
for some 𝑛 πœ– β„•, then 𝑝 = π‘Ž 2 + 𝑏 2 for some π‘Ž, 𝑏 πœ– β„€.

Gaussian integers: Complex numbers with integer coefficients.

Gaussian integer prime: A Gaussian integer z which is divisible
only by ±1 or ± 𝑖, or products of z with these.


Lemma: For any prime 𝑝 of the form 4𝑛 + 1, 𝑛 πœ– β„•, there exists an
integer π‘š such that 𝑝 divides 1 + π‘š2 .


Lemma: If a Gaussian integer prime 𝑝 divides 𝛼𝛽 for some
Gaussian integers 𝛼 and 𝛽, then 𝑝 divides 𝛼 or 𝑝 divides 𝛽.



Since 𝑝 is not a Hurwitz prime, we can apply our
previous conclusion and say that 𝑝 is a sum of four
integer squares.
We now have that 1, 2, and all odd primes can be
written as a sum of four squares.
By the Four Squares identity, every natural number
can be written as a sum of four squares.
Suppose p is a prime of the form 4𝑛 + 1 for some
𝑛 πœ– β„•.
Then p divides 1 + π‘š2 = (1 + π‘šπ‘–)(1 βˆ’ π‘šπ‘–) for some
π‘š πœ– β„•.
Since p divides neither factor of 1 + π‘š2, 𝑝 is not a
Gaussian prime.
Then p has a nontrivial factorization in the Gaussian
integers 𝑝 = (π‘Ž + 𝑏𝑖)(π‘₯ + 𝑦𝑖).
4
7/8/2011





Conjugating and multiplying equations
𝑝2 = π‘Ž + 𝑏𝑖 π‘₯ + 𝑦𝑖 π‘Ž + 𝑏𝑖 π‘₯ + 𝑦𝑖
= (π‘Ž + 𝑏𝑖)(π‘Ž βˆ’ 𝑏𝑖)(π‘₯ + 𝑦𝑖)(π‘₯ βˆ’ 𝑦𝑖)
= π‘Ž2 + 𝑏 2 π‘₯ 2 + 𝑦 2 .
Since p is prime and the factorization was nontrivial,
the factors π‘Ž 2 + 𝑏 2 and π‘₯ 2 + 𝑦 2 are equal to p.
Thus p can be written as a sum of two integer
squares.





Various contributions
Calculus of Variations,
Lagrange Multipliers,
PDE’s
Prolific writer
Proved four square
theorem in 1770
Meticulous and shy
Joseph-Louis Lagrange




Born to a Jewish family
Number theorist
Mostly contributed to
number theory and
algebras
Sickly




Adolf Hurwitz
German mathematician
Investigated number
theory, Bessel functions,
PDE’s
Work on quadratic
mechanics influenced
Einstein
Also very sickly
Rudolf Lipschitz
5
7/8/2011
Any natural number N can
be represented as
𝑁 = π‘Ž2 + 𝑏 2 + 𝑐 2 + 𝑑 2
where a, b, c, and d are
integers

Hurwitz quaternions can
be useful in a variety of
ways!
6