Jacobi s four squares identity Martin Klazar



Similar documents
Taylor and Maclaurin Series

Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem)

Factoring Polynomials

Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.

1.5. Factorisation. Introduction. Prerequisites. Learning Outcomes. Learning Style

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

2010 Solutions. a + b. a + b 1. (a + b)2 + (b a) 2. (b2 + a 2 ) 2 (a 2 b 2 ) 2

Integrals of Rational Functions

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include

Applications of Fermat s Little Theorem and Congruences

2.6 Exponents and Order of Operations

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)

9.2 Summation Notation

k, then n = p2α 1 1 pα k

Lagrange Interpolation is a method of fitting an equation to a set of points that functions well when there are few points given.

GREATEST COMMON DIVISOR

PROOFS BY DESCENT KEITH CONRAD

15. Symmetric polynomials

1.3 Polynomials and Factoring

PYTHAGOREAN TRIPLES KEITH CONRAD

A Second Course in Mathematics Concepts for Elementary Teachers: Theory, Problems, and Solutions

The cyclotomic polynomials

Computing divisors and common multiples of quasi-linear ordinary differential equations

CM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra - Factorisation

Florida Math Correlation of the ALEKS course Florida Math 0028 to the Florida Mathematics Competencies - Upper

1 Lecture: Integration of rational functions by decomposition

SOLUTIONS FOR PROBLEM SET 2

3.1. Solving linear equations. Introduction. Prerequisites. Learning Outcomes. Learning Style

Discrete Mathematics: Homework 7 solution. Due:

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

Math 115 Spring 2011 Written Homework 5 Solutions

Breaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and

Chapter 7 - Roots, Radicals, and Complex Numbers

Continued Fractions. Darren C. Collins

= = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Indiana State Core Curriculum Standards updated 2009 Algebra I

Section 4.1 Rules of Exponents

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA

Math Workshop October 2010 Fractions and Repeating Decimals

Continued Fractions and the Euclidean Algorithm

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson

2.3. Finding polynomial functions. An Introduction:

RESULTANT AND DISCRIMINANT OF POLYNOMIALS

HFCC Math Lab Arithmetic - 4. Addition, Subtraction, Multiplication and Division of Mixed Numbers

Winter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov

Algebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the school year.

Course Notes for Math 162: Mathematical Statistics Approximation Methods in Statistics

Settling a Question about Pythagorean Triples

Core Maths C1. Revision Notes

Some practice problems for midterm 2

No Solution Equations Let s look at the following equation: 2 +3=2 +7

arxiv:math/ v1 [math.co] 21 Feb 2002

Partial Fractions Examples

IB Maths SL Sequence and Series Practice Problems Mr. W Name

Partial Fractions. p(x) q(x)

Sequences and Series

26 Integers: Multiplication, Division, and Order

SECTION 0.6: POLYNOMIAL, RATIONAL, AND ALGEBRAIC EXPRESSIONS

PURSUITS IN MATHEMATICS often produce elementary functions as solutions that need to be

COLLEGE ALGEBRA. Paul Dawkins

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

Tim Kerins. Leaving Certificate Honours Maths - Algebra. Tim Kerins. the date

If A is divided by B the result is 2/3. If B is divided by C the result is 4/7. What is the result if A is divided by C?

The Ideal Class Group

SOLVING POLYNOMIAL EQUATIONS

Math 55: Discrete Mathematics

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

9. POLYNOMIALS. Example 1: The expression a(x) = x 3 4x 2 + 7x 11 is a polynomial in x. The coefficients of a(x) are the numbers 1, 4, 7, 11.

CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA

Algebra 2 PreAP. Name Period

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

We can express this in decimal notation (in contrast to the underline notation we have been using) as follows: b + 90c = c + 10b

Rational Exponents. Squaring both sides of the equation yields. and to be consistent, we must have

6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives

Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Sample Problems. Practice Problems

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Homework until Test #2

Unique Factorization

1.4. Arithmetic of Algebraic Fractions. Introduction. Prerequisites. Learning Outcomes

Click on the links below to jump directly to the relevant section

1 3 4 = 8i + 20j 13k. x + w. y + w

The Method of Partial Fractions Math 121 Calculus II Spring 2015

The Relation between Two Present Value Formulae

Math Circle Beginners Group October 18, 2015

0.8 Rational Expressions and Equations

Polynomial Operations and Factoring

Lecture Notes on Polynomials

Equations, Inequalities & Partial Fractions

Cyclotomic Extensions

SECTION 10-2 Mathematical Induction

Factoring Polynomials

International Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013

UNCORRECTED PAGE PROOFS

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013

Transcription:

Jacobi s four squares identity Martin Klazar (lecture on the 7-th PhD conference) Ostrava, September 10, 013 C. Jacobi [] in 189 proved that for any integer n 1, r (n) = #{(x 1, x, x 3, x ) Z ( i=1 x i = n} = 8 d ) d. d n In other words, the number of ways to express n as a sum of four squares of integers equals eight times the sum of the divisors of n not divisible by four. Thus r (n) = 8(1 +...) 8 for every n 1, which gives as a corollary Lagrange s theorem from 1770 that every natural number is a sum of four squares. We give a complete and purely formal proof of Jacobi s identity by generating functions; the proof is due to Hirschhorn [1] in 1987. Idea: since r g (n), the number of expressions of an integer n 0 as a sum of g squares of integers, equals to the coefficient of x n in (the formal power series expansion of) ( + x n) g, n= and d n d equals to the coefficient of xn in the Lambert series k, nx kn = nx n 1 x n, d n it suffices to derive the identity ( x n ) = 1 + 8 ( nx n 1 x nx n ) n 1 x n (1) Jacobi s identity in the GF language. (We write briefly for + n= and for.) We achieve it by a succession of the next seven identities. 1

1. ( 1) n x n = 1 x n 1 + x n.. JTI: (1 x n )(1 + zx n 1 )(1 + z 1 x n 1 ) = z n x n. 3. (z z 1 ) (1 x n )(1 z x n )(1 z x n ) = ( 1) n z n+1 x n(n+1)/.. (1 x n ) 3 = 1 (n + 1)( 1) n x n(n+1)/. 5. (1 x n ) 6 = 1 ((r + 1) (s) )x r +r+s. r,s 6. (1 x n ) 6 = Q n [ 1 8 ( (n 1)x n 1 1 + x n 1 nxn 1 + x n )], where Q n = (1 x n ) (1 + x n ) (1 + x n 1 ). 7. (1 + x n ) (1 x n ) = Q n. The key identity, from which we derive everything, is, the celebrated Jacobi s triple product identity (JTI for short), obtained by C. Jacobi in []. We first deduce (1) from the identities, then derive the seven identities assuming the JTI, and at the end we give a proof for the JTI. We have that ( ( 1) n x n) (id.1) = ( 1 x n ) (the left side of id. 6) = 1 + x n (the left side of id. 7) equals to the ratio of the right sides 1 8 ( (n 1)x n 1 ) nxn. 1 + x n 1 1 + x n

Replacing x with x, we obtain the identity ( x n ) = 1 + 8 ( (n 1)x n 1 ) + nxn, 1 x n 1 1 + x n which is similar to (1). We rewrite the last sum as ( (n 1)x n 1 ) + nxn 1 x n 1 1 x n ( nx n ) nxn. 1 xn 1 + x n The first sum equals nx n by regrouping, and the summand in the 1 x n second sum equals, by subtracting the two fractions, to nxn. Thus the 1 x n obtained identity is not just similar to but indeed identical to (1). We start from identity, the JTI, and derive from it the rest. 1. We set z = 1 in the JTI and get that ( 1) n x n equals to (1 x n )(1 x n 1 ). Since (1 x n )(1 x n 1 ) = (1 x n ) and (1 x n ) = (1 x n )/(1 + x n ), regrouping yields the right side of 1. 3. We set z = xz in the JTI, then x = x 1/ and multiply the result by z. 3. We differentiate 3 by z, set z = 1 and multiply the result by 1. 5. Squaring gives (1 x n ) 6 = 1 (m + 1)(n + 1)( 1) m+n x (m +m+n +n)/. m,n We split the sum in two subsums, the first with even m + n and the second with odd m + n. In the first subsum we change the variables to r = (m + n)/, s = (m n)/, and in the second to r = (m n 1)/, s = (m+n+1)/. It is easy to check that in both cases m +m+n +n turns into (r +r +s ) and ( 1) m+n (m + 1)(n + 1) into (r + 1) (s). Hence the two subsums coincide and the sign disappears; we get the right side of 5. 5, 6. We write the right side of 5 as a difference of two sums, by the difference (r + 1) (s), and separate in each sum the variables r and s. Then we express the coefficients by differentiation and obtain 1 ( s x s (1 + x d dx ) r x r +r r 3 x r +r x d dx x s). s

We replace each of the four s by a using the JTI, setting z = 1 in s and z = x in r ( 1 gets cancelled by 1 + x0 ): (1 x n )(1 + x n 1 ) (1 + x d dx ) (1 x n )(1 + x n ) minus (1 x n )(1 + x n ) x d dx (1 x n )(1 + x n 1 ). We differentiate the infinite products by means of the identity ( f n ) = fn f n/f n and, denoting a = 1 + x n, b = 1 + x n 1, c = 1 x n and taking out the factor Q n = (abc), get the expression Qn [ 1 + x ( (a c) a c (b c) )]. b c The last summand simplifies after an easy calculation to (a /a b /b). We get the right side of 6. 7. We have Qn = (1 x n ) (1 + x n ) (1 + x n 1 ). Since 1 x n = (1 x n )(1 + x n ) and (1 + x n )(1 + x n 1 ) = (1 + x n ), regrouping gives the left side of 7. It remains to prove the JTI (1 x n )(1 + zx n 1 )(1 + z 1 x n 1 ) = z n x n. We give a purely formal proof. Let S(z, x) be the product on the left side. It follows that zx S(zx, x) = S(z, x), because the substitution z zx almost preserves the two arithmetic progressions of odd positive integers in the two exponents of x: it just adds to S(z, x) the factor (1 + z 1 x 1 )/(1 + zx) = 1/zx. Therefore if we expand S(z, x) in the integral powers of z as S(z, x) = a n z n = a n (x)z n (n runs through the whole Z) with the power series coefficients a n C[[x]], comparison of the coefficients of z n on both sides of the functional equation gives the relation x n 1 a n 1 = a n, n Z.

Thus a 1 = xa 0 = a 1 (n = 1, 0), a = x 3 a 1 = x 3 a 1 = a (n =, 1) and a = x a 0 = a. In general, a n = a n = x n a 0, n = 1,,..., since 1 + 3 + 5 +... + (n 1) = n. (The equality a n = a n is immediate also from the symmetry S(z, x) = S(z 1, x).) So we have deduced that S(z, x) = (1 x n )(1 + zx n 1 )(1 + z 1 x n 1 ) = a 0 (x) z n x n and are almost done it only remains to be shown that a 0 = 1. This we prove by three specializations of the last identity (the JTI with the undetermined coefficient a 0 (x)): (i) z = x = 0, (ii) z = i and (iii) z = 1, x = x. Then (i) gives that a 0 (0) = 1, (ii) gives that (1 x n )(1 + x n ) = a 0 (x) ( 1) n x (n) and (iii) gives that (1 x 8n )(1 x 8n ) = a 0 (x ) ( 1) n x n. Clearly, the sums on the right sides are equal. So are the products on the left sides, despite appearance: since (1 x 8n )(1 x 8n ) = (1 x n ), 1 x 8n = (1 x n )(1 + x n ) and (1 x n )(1 x n ) = (1 x n ), the product of (iii) equals to that of (ii). Hence the remaining factors have to be equal too, a 0 (x) = a 0 (x ), which forces that a 0 (x) = a 0 (0) = 1, as we needed to show. This completes the proof of the JTI and of Jacobi s four squares identity. Exercise. Justify rigorously formal manipulations in the above proof. In particular, clarify in what sense does the formal equality (1 x n )(1 + zx n 1 )(1 + z 1 x n 1 ) = a n (x)z n hold and why it is preserved by the substitution z zx. References [1] M. D. Hirschhorn, A simple proof of Jacobi s four-square theorem, Proc. Amer. Math. Soc. 101 (1987), 36 38. [] C. G. J. Jacobi, Fundamenta nova theoriae functionum ellipticarum, Sumtibus fratrum, 189. 5