Representing natural numbers as sums of squares is an important topic in number theory. Given a general natural number
n, denote
the number of integer solutions of Diophantine equation
which counts the number of ways in which
n can be written as sums of
l squares. In
l-dimensional space,
gives also the number of points with integer coordinates on the sphere. When
l is odd, the problem is very difficult. However for the even case, the problem may be treated in a fairly reasonable manner. In this section, we will give simple and shot proofs of it by using theta function identities. At the same time, we obtain some interesting results of theta functions.
Proof: In (1.8), setting
and
, we obtain that
In above identity, let
replaced by
q, we have
Combining (1.8) and(1.10) yields
Using (1.8) and letting
q replaced by
in above identity give
Compare the coefficients of
on both sides of above equation, we are able to complete the proof.
Differentiate both sides of the identity (2.2) with respect to
x then set
, we find that
Using the infinite product representations of theta functions , we easily get
Letting
in above identity and making use of (1.10) give
Substituting
q by
in this equation, we arrive at
Proof: From (2.6) and (1.10) we get that
Compare the coefficients of
on both sieds of this equation, we get
We thus complete the proof.
Multiply both sides of the two equations (2.2) and (2.3), then Substitute the equations (1.9) into it and replace
by
, We get
In above identity place
x and
y with
and
respectively, we get
In above equation replace
x with
, we have
In above identity, setting
, we get
We recall the transformation formulas of modular(See for example, [1, P.339] ) as following
It be called the imaginary transformation formulas. Apply the imaginary transformation to identity (2.13), we have
Differentiating four times on both sides of this identity with respect to
x and setting
, we find
Combine (1.8) and (1.10), we have
Substituting
q by
in this equation, we arrive at
Theorem 3.(Eight square theorem) Every nature number can be expressed as sum of eight square numbers, moreover we have
Proof: From (2.16), we have
If
n is even, setting
yields
If
n is odd, we are able to know that
In summary, we have
Compare the coefficient of
on both sieds of above equation, we have