GAPS BETWEEN NONZERO FOURIER COEFFICIENTS OF CUSP FORMS SOUMYA DAS AND SATADAL GANGULY

Abstract. We prove that for any even integer k ≥ 12, there are positive constants c and X0 that depend only on k such that for all nonzero cusp forms f of weight k for the full modular group, any interval (X, X + cX 1/4 ) with X > X0 must contain an integer n with the n-th Fourier coefficient of f nonzero.

1. Introduction Fourier coefficients of modular forms are interesting objects and various questions regarding their properties have been investigated by many researchers. In this article we study the question of Serre of bounding the length of a string of consecutive zero Fourier coefficients of cusp forms of integral weight. In [Se81], Serre defined, for any positive integer n, if (n) := max{i | af (n + j) = 0,

0 ≤ j ≤ i},

where af (n) is the n-th Fourier coefficient (at the cusp at ∞) of a cusp form f and proved that if (n) f n if f is not a linear combination of forms with complex multiplication (CM). In the same paper he asks whether it is the case that if (n) f nδ , for some δ, 0 < δ < 1. The answer to this is certainly affirmative as the above is known to hold for δ = 3/5 by the well-known Rankin-Selberg estimate. For details, see the introduction in [KRW07] which also discusses another approach to Serre’s question. The question remains, nevertheless, of reducing the size of the exponent δ and several researchers contributed towards answering this question and its several modifications. See, for example, [BO01], [Al03], [Al05], [AZa05], [AZ08], and [KRW07], the last one, due to Kowalski, Robert, and Wu, containing the strongest general result. They use new bounds on certain exponential sums and distribution of B-free numbers to show that if (n) f n7/17+ε for any ε > 0 for any cusp form f which is not a linear combination of forms with complex multiplication. In this article we improve upon the above result for all cusp forms for the full modular group SL2 (Z) by exploiting some congruence relations established by Hatada [Hat79] for eigenvalues of Hecke operators acting on the space Sk of cusp forms of level one. Our main theorem is: 2010 Mathematics Subject Classification. Primary 11F30; Secondary 11F11, 11N25. Key words and phrases. Fourier coefficients of cusp forms, sums of two squares. 1

2

SOUMYA DAS AND SATADAL GANGULY

Theorem 1. Given any even positive integer k ≥ 12, there is a positive constants c that depends only on k such that for all nonzero cusp forms f in Sk , af (n) 6= 0 for some integer n ∈ (X, X + cX 1/4 ) for all X ≥ 1154. Theorem 1 has the following immediate corollary. Corollary 1. For any nonzero cusp form f ∈ Sk , we have that if (n) k n1/4 whenever n ≥ 1154. In the above theorem, the constant c depends on the weight k. This dependence can be removed at the cost of sacrificing on the exponent as shown in our second theorem. Theorem 2. For any fixed ε > 0, there are positive constants c and X0 that depend only on ε such that for any cusp form f of level one, we have that af (n) 6= 0 for some n ∈ (X, X + cX 131/416+ε ) whenever X > X0 . We think that it is reasonable to conjecture that the above should hold even if we change the exponent to 1/4. Indeed, if we assume an optimistic conjectural bound for exponential sums, namely, the Exponent Pair Hypothesis (see [IK04, Chap. 8]), then we have the following conditional result. Theorem 3. Assume the Exponent Pair Hypothesis. For any fixed ε > 0, there are positive constants c and X0 that depend only on ε such that for any cusp form f of level one, we have that af (n) 6= 0 for some n ∈ (X, X + cX 1/4+ε ) whenever X > X0 . Now we write a few words about the proofs of the theorems. The crucial ingredient for us are the congruences of Hatada [Hat79] which he established using the theory of Hecke operators acting on integral Eichler cohomology. A typical one says, λf (p) ≡ p + 1

(mod 8),

(1.1)

where p 6= 2 is any prime and λf (p) is the eigenvalue of the p-th Hecke operator acting on Sk . From this congruence we first show (Prop. 1) that there is an integer Mf such that if n is a sum of two squares and (n, Mf ) = 1, then λf (n) 6= 0. A modification of the simple but efficient argument of Bambah and Chowla [BC47] shows the interval (X, X + H) with H  X 1/4 contains at least one integer which is a sum of two squares (with the added coprimality condition) for all X sufficiently large. It is this coprimality condition that gives rise to the dependence of the implied constant on the weight k in Theorem 1. The dependence is inherent in Lemma 1 which is needed to handle higher prime powers. For the other two theorems, we consider the problem of counting the sparser sequence of integers n that are sums of two squares as well as square-free and thus doing away with the need to appeal to Lemma 1. This problem has been related to estimation of the error term X P (X) := r(n) − π(X) 1≤n≤X

in the Gauss circle problem (see [IK04, Chap. 8]) by Zhai [Zha06] (see also [Krat82]). The results now follow from known and conjectured bounds on P (X).

GAPS BETWEEN NONZERO FOURIER COEFFICIENTS OF CUSP FORMS

3

Remark 1. The reason we consider only the full modular group is due to the fact that the congruence of Hatada that we need is available only in this case. If similar congruence holds for a form of higher level, then this or some similar method should give the same result for such a form. Remark 2. The idea of using congruences to prove existence of nonzero Fourier coefficients of modular forms in short intervals is not new. Indeed, Alkan [AZ05] had previously observed that the Ramanujan congruences for the τ -function could be used to show that τ (m2 + 23n2 ) 6= 0 for any integers m and n, and using this he had obtained a short interval result similar to this for the Ramanujan ∆-function. Remark 3. Instead of estimating if (n) for all n, one may also look for a very strong bound that is valid for almost all n or for most n in the sense of density. Several works on this type of questions have been done by Alkan and Zaharescu. See [Al03], [Al05], [AZa05], & [AZ08]. For example, it is proved in[Al03] that if (n) f,φ φ(n) for almost all n, where φ is essentially any function monotonically increasing to infinity. They have also considered the case where n is restricted to vary over arithmetic progressions. In the rest of the paper we prove Theorem 1 in detail and sketch the proofs of Theorem 2 and Theorem 3. Acknowledgements. The authors thank the School of Mathematics, T.I.F.R., Mumbai and the Stat-Math Unit, I.S.I., Kolkata where this work was carried out for providing excellent working atmosphere. It is a pleasure to thank W. Kohnen from whom the authors first learned of the result of K. Hatada.

2. Notation and Preparatory lemmas For even integers k ≥ 12 we denote the space of holomorphic cusp forms (with trivial nebentypus) of weight k for the modular group SL2 (Z) by Sk . We denote the n-th Fourier coefficent of a form f in this space by af (n); i.e., X f (z) = af (n)q n , n≥1

where q := e2πiz . If f is an Hecke eigenform, we make the standard normalization af (1) = 1, so that af (n) = λf (n), where λf (n) denotes the eigenvalue of the n-th Hecke operator associated to f . For a Hecke eigenform f , let K = Kf := Q({λf (n) : n ≥ 1}) and let OK be its ring of integers. For m ∈ Z and x, y ∈ OK , we denote x − y ∈ mOk by x ≡ y (mod m). Now we state a lemma that combines the level one case of a lemma of Murty and Murty (see [MM07, Lemma 2.5]) and that of a lemma of Kowalski, Robert, and Wu (see [KRW07, Lemma 2.2]).

4

SOUMYA DAS AND SATADAL GANGULY

Lemma 1. Let f ∈ Sk be a Hecke eigenform. Then for all sufficiently large primes p, either λf (p) = 0 or λf (pn ) 6= 0 for all n ≥ 1. If all the Hecke eigenvalues λf (n) are rational integers then the above conclusion is true for all primes.

The next lemma summarises various congruences for Hecke eigenvalues at prime powers that follows from the work of Hatada [Hat79]. Only parts of it will be used in the proof but we include the other cases for completeness. Lemma 2. For any integer n ≥ 1, we have the congruence relations

n

λf (p ) ≡

   (n + 1)   

(mod 4)

if p ≡ 1

(mod 4)

1

(mod 4)

if n ≡ 0

(mod 2) and p ≡ −1

1

(mod 3)

if n ≡ 0

(mod 2) and p = 2.

(mod 4)

Proof. Reducing the generating series X

1 1 − λf (p)X + pk−1 X 2

λf (pn )X n =

n≥0

(2.1)

modulo (4) and using the basic congruence (see [Hat79]) λf (p) ≡ p + 1

(mod 4) for p 6= 2,

(2.2)

we get X

λf (pn )X n ≡

n≥0

 (1 − X)−2 (1 − X 2 )−1

if p ≡ 1

(mod 4) (mod 4)

(mod 4)

if p ≡ −1

(mod 4).

Using the negative binomial expansion (1 − X)−t =

 ∞  X t+s−1 s

s=0

X s,

(t ≥ 1)

we finally get λf (pn ) ≡

 (n + 1) 1

(mod 4)

(mod 4)

if p ≡ 1

(mod 4)

if n ≡ 0

(mod 2) and p ≡ −1

(mod 4).

For the prime 2 we use another congruence from [Hat79]: λf (2) ≡ 0

(mod 3).

We also note that λf (2) 6= 0 by a result of Kohnen [Koh99]. Hence, reducing (2.1) modulo 3, we obtain λf (2n ) ≡ 1

(mod 3),

n even. 

GAPS BETWEEN NONZERO FOURIER COEFFICIENTS OF CUSP FORMS

5

3. Proofs of the theorems We begin this section with a crucial proposition which is an outcome of the above congruences. Proposition 1. Let f ∈ Sk be a Hecke eigenform. Then there is an even integer Mf such that λf (a2 + b2 ) 6= 0 for any integers a and b, with (a2 + b2 , Mf ) = 1. If, moreover, all the Hecke eigenvalues λf (n) are rational integers then one can take Mf = 1. Proof. We consider the general case first. Let us write the prime factorization: a2 + b2 = Qs αj j=1 pj . Then, as is well-known, either pj = 2 or the exponent αj of pj is even if pj ≡ −1 (mod 4). By multiplicativity of the Hecke eigenvalues λf (n), we have s Y

λf (a2 + b2 ) =

α

λf (pj j ).

(3.1)

j=1

Define Mf to be the smallest even integer with the property that if p is a prime and (p, Mf ) = 1, then λf (p) 6= 0 implies λf (pn ) 6= 0 for all n ≥ 1. Existence of such integers is assured by Lemma 1. Let us call the set of primes coprime to Mf to be Af . Let p = pj ∈ Af . If p ≡ 1 (mod 4), then the congruence (2.2) implies that λf (p) 6= 0, whence it follows by Lemma 1 that λf (pn ) 6= 0 for all n ≥ 1. If p ≡ −1 (mod 4), we invoke the second congruence relation in Lemma 2 to conclude λf (pn ) 6= 0 for all even n. Since Mf is even, this finishes the proof. If λf (n) ∈ Z for all n ≥ 1, then we make use of the last sentence in Lemma 1 and proceed as above. The congruences in Lemma 2 and the result of Kohnen that λf (2) 6= 0 ensure that none of the factors in the right hand side of (3.1) can be zero.  Corollary 2. For any even integer k ≥ 12, there is an integer Mk such for all integer a, b with (a2 + b2 , Mk ) = 1, the Hecke operator Tk (a2 + b2 ) is an automorphism of Sk . One can take Mk = 1 if the eigenvalues of all the Hecke operators are rational integers. 3.1. Proof of Theorem 1. Let us denote by Hk the normalized Hecke basis for Sk and define M := lcm{Mf | f ∈ Hk }

(Mf as in Prop. 1).

We note that M depends only on k. We first prove Theorem 1 for a form f ∈ Hk . Note that by Prop. 1, all we need to show is that there are integers prime to M that can be written as sums of two squares in intervals of the type mentioned in the theorem. This is known in the case M = 1 by the work of Bambah and Chowla [BC47]. We adapt their argument to treat the general case. We start with an integer X, sufficiently large, and choose an integer m such that m < X 1/2 < m + 1. Define λ to be the unique positive real that satisfies the quation m2 + λ2 = X. Let m2 ≡ a (mod M ), where 0 ≤ a ≤ M − 1. Claim. There exists an integer b, 0 ≤ b ≤ M − 1, such that (b2 + a, M ) = 1. Granting the claim for a moment, we next choose an integer α such that α − 1 ≤ (λ − b)/M < α.

6

SOUMYA DAS AND SATADAL GANGULY

Let us define n := M α + b (0 ≤ b ≤ M − 1) with b chosen as above. With these choices, note that n − M ≤ λ < n. Thus we arrive at the inequalities m2 + n2 > m2 + λ2 = X,

m2 + n2 ≤ m2 + (λ + M )2 ≤ X + 2M λ + M 2 .

(3.2)

As in [BC47], one has λ < 3X 1/4 if X ≥ 1154. This shows that m2 + n2 < X + 6M X 1/4 + M 2 < X + cX 1/4 ,

(3.3)

where c > 0 is a constant that depends only on M and thus, only on the weight k. It remains to prove the claim. Let us define the polynomial A(x) = x2 + a. We want to prove that (A(b), M ) = 1 for some b. Let the prime decomposition of M be M=

g Y

qiβi .

i=1

It is enough to prove that there exists b such that (A(b), qi ) = 1 for all 1 ≤ i ≤ g. Now we find integers bi such that A(bi ) 6≡ 0 (mod qi ) for all i. This can be done easily. If qi | a, we choose bi = qi + 1, otherwise we choose bi = 0. Now, by the Chinese Remainder Theorem, we can choose an integer b ≡ bi (mod qi ) for all i. This finishes the proof as A(b) ≡ A(bi ) 6≡ 0 (mod qi ) for all i. If f ∈ Sk is a normalized Hecke eigenform with all its coefficients in Z, then the above proof is much simplified as one can take M = 1 and we record this special case as a proposition. Proposition 2. Let f ∈ Sk be a normalized Hecke eigenform that has all its coeffieients rational integers. Then, λf (n) 6= 0 for some integer n ∈ (X, X +7X 1/4 ) for all X ≥ 1154. Now we prove Theorem 1 by extending the result to all nonzero cusp forms following P a technique of Balog and Ono [BO01]. Let f = af (n)q n be any nonzero cusp form in n≥1

Sk . We can expand it as f=

µ X

ci fi ,

(3.4)

i=1

where µ = dim Sk and the set {fi | 1 ≤ i ≤ µ} is the normalized Hecke basis for Sk . Let us write the Fourier expansion of each fi as X fi = λi (n)q n , λi (1) = 1. n≥1

Without loss of generality we assume that c1 6= 0. By the multiplicity one principle, for each pair (i, j) with i 6= j, there are infinitely many primes p such that λi (p) 6= λj (p). Let us choose the smallest prime p1 such that λ1 (p1 ) 6= λ2 (p1 ) and consider g2 := Tp1 f − λ2 (p1 )f.

(3.5)

It is clear that the Hecke eigenform f2 does not appear in the decomposition of g2 in terms of the Hecke basis as in (3.4). Furthermore, we can easily write down the Fourier coefficients of g2 : ag2 (n) = af (p1 n) + p1k−1 af (n/p1 ) − λ2 (p1 )af (n).

GAPS BETWEEN NONZERO FOURIER COEFFICIENTS OF CUSP FORMS

7

We continue in this way µ − 1 times, removing the forms f2 , f3 , · · · , fµ one by one, and end up with a nonzero cusp form F which must be of the form: F = c0 f1 ,

c0 6= 0.

We see by induction that the Fourier coefficients of F can be expressed as aF (n) =

s X

βj af (n/rj ),

(3.6)

j=1

for some complex numbers βj and some real numbers rj > 0. In fact, βj ’s are algebraic integers and rj ’s are rational numbers but we shall not need this fact. Define R := max{1, rj | 1 ≤ j ≤ µ} . We note that R depends only on k. Since we have already proved the theorem for Hecke eigenforms, applying it to f1 we see that there is a constant c > 0 that depends only on k such that for every j and for any X ≥ 1154/rj , there is some n ∈ (rj X, rj X +cX 1/4 ) such that aF (n) 6= 0. Therefore, there is some j for which af (n/rj ) 6= 0. Defining X0 := 1154R, we see that all intervals (X, X + cX 1/4 ) with X > X0 must contain an integer m for which af (m) 6= 0. This proves the theorem. 3.2. Proofs of Theorems 2 and 3. We consider the sequence integers which are sums of two squares as well as square-free. Such integers are products of distinct primes that are congruent to 1 (mod 4) and possibly the prime 2. Therefore, by the result that λf (2) 6= 0 which follows from a work of Kohnen [Koh99] and the congruence (2.2), it follows that the Hecke eigenvalues corresponding to these integers are nonzero. Since no higher exponent is present, there is no need to appeal to Lemma 1 and thus the coprimality condition we had earlier is gone. This is how we remove the dependence of the constants on the form f . Now the best short interval result known for this sequence is due to [Zha06] and it says that all intervals of the form (X, X + X 131/416+ε ) for any ε > 0 contain square-free integers which are sums of two squares, provided X is large enough. Thus, Theorem 2 follows. Zhai actually proves this any interval of the form (X, X + X θ+ε ) for any ε > 0, where we can take any θ > 0 such that the error term X P (X) := r(n) − π(X) 1≤n≤X

in the Gauss circle problem satisfies P (X) ε X θ+ε

(3.7)

for any ε > 0. Zhai’s result follows from the bound P (X) ε X 131/416+ε due to Huxley [Hux03]. Obtaining the smallest θ such that the bound 3.7 holds is a famous problem in Number Theory and it is conjectured that θ = 1/4 is possible. This problem is connected to the theory of exponential sums and an optimistic assumption on cancellations in such sums called the Exponent Pair Hypothesis ([IK04, Chap. 8]) implies this conjecture and thus Theorem 3.

8

SOUMYA DAS AND SATADAL GANGULY

References [Al03] [Al05] [AZ05] [AZa05] [AZ08] [BO01] [BC47] [Hat79] [Hux03] [IK04]

E. Alkan, Nonvanishing of Fourier coefficients of modular forms, Proc. Am. Math. Soc. 131 no. 6, 2003, 1673–1680. E. Alkan, On the sizes of gaps in the Fourier expansion of modular forms, Can. J. Math. 57 no. 3, 2005, 449–470. E. Alkan, A. Zaharescu, Nonvanishing of the Ramanujan’s Tau function in short intervals, Int. J. Number Theory, 1 no. 1, 2005, 45–51. E. Alkan, A. Zaharescu, Nonvanishing of Fourier coefficients of newforms in progressions, Acta Arith. 116 no. 1, 2005, 81–98. E. Alkan, A. Zaharescu, On the gaps in the Fourier expansion of cusp forms, Ramanujan J. 16 no. 1, 2008, 41–52. A. Balog, K. Ono, The Chebotarev Density Theorem in Short Intervals and a Question of Serre, J. Number Theory 91, 2001, 356–371. R. P. Bambah, S. D. Chowla, On numbers which can be expressed as sums of two squares, Proc. Nat. Inst. Sci. India 13, 1947, 101–103. K. Hatada, Eigenvalues of Hecke Operators on SL(2, Z), Math. Ann. 239, 1979, 75–96. M. N. Huxley, Exponential sums and lattice points III, Proc. Lond. Math. Soc. 87 no. 3, 2003, 591–609. H. Iwaniec and E. Kowalski, Analytic Number Theory, American Mathematical Society Colloquium Publications, 53. American Mathematical Society, Providence, RI, 2004.

[Koh99]

W. Kohnen, Period polynomials and congruences for Hecke algebras, Proc. Edinburgh Math. Soc. (2) 42 no. 2, 1999, 217–224. [KRW07] E. Kowalski, O. Robert, J. Wu: Small gaps in coefficients of L-functions and B-free numbers in short intervals, Rev. Mat. Iberoam. 23, no. 1, 2007, 281–326. [Krat82] E. Kr¨ atzel, Squarefree numbers as sums of two squares, Arch. Math (Basel), 39 no. 1, 1982, 28–31. [Leh47] D. H. Lehmer, The vanishing of Ramanujan’s function τ (n), Duke Math. J. 14, 1947, 429–433. [MM07] [Se81] [Zha06]

M. R. Murty, V. K. Murty, Odd values of Fourier coefficients of certain modular forms, Int. J. Number Theory 3 no. 3, 2007, 455–470. J.-P. Serre, Quelques applications du th´ eor` eme de densit´ e Chebotarev, Inst. Hautes Etudes Sci. Publ. Math. 54, 1981, 323–401. W. Zhai, Square-free integers as sum of two squares (English summary), Number theory, Dev. Math 15 219–227, Springer, New York, (2006).

School of Mathematics, Tata Institute of Fundamental Research, Homi Bhabha Road, Mumbai – 400005, India. E-mail address: [email protected],[email protected]

Theoretical Statistics and Mathematics Unit, Indian Statistical Institute, 203 Barrackpore Trunk Road, Kolkata 700108, India E-mail address: [email protected]

GAPS BETWEEN NONZERO FOURIER ...

τ(m2 + 23n2) = 0 for any integers m and n, and using this he had obtained a short interval result similar to this for the Ramanujan ∆-function. Remark 3. Instead of estimating if (n) for all n, one may also look for a very strong bound that is valid for almost all n or for most n in the sense of density. Several works on this type of ...

298KB Sizes 0 Downloads 239 Views

Recommend Documents

Fourier series
Fourier series in an interval of length i2. Even Function. Odd Function. Convergence of Fourier Series: ➢ At a continuous point x = a, Fourier series converges to ...

Idea gaps and object gaps in economic development
[most notably by Joan Robinson (1933) and Edward Chamberlain (1933)]. Most economists, however, accepted the challenge of trying first to formalize existing intuitions in terms of .... models that we could add to our tool kit. Work in industrial orga

fourier integrals
1 sin(1 )x sin(1 )x. 1 (1 )sin(1 )x (1 )sin(1 )x. 1. 1. 2. 1. (1 ) sin cos cos sin. (1 ) sin cos cos sin. 1. 1. 1 2sin. 2sin. 1. (1. ) x x x x x x x x π π π λ λ λ λ λ λ π.

THE FOURIER-STIELTJES AND FOURIER ALGEBRAS ...
while Cc(X) is the space of functions in C(X) with compact support. The space of complex, bounded, regular Borel measures on X is denoted by. M(X).

fourier transformation
1. (x). (s). 2. 1. 2sin sin. (x). (x). 2. Now putting x 0 both sides, we get sin. (0). [ f(0) 1by definition of f(x)] sin sin sin. 2. 2 isx isx isx f. F. e d s s s f e ds e ds f s s s. d s.

lecture 15: fourier methods - GitHub
LECTURE 15: FOURIER METHODS. • We discussed different bases for regression in lecture. 13: polynomial, rational, spline/gaussian… • One of the most important basis expansions is ... dome partial differential equations. (PDE) into ordinary diffe

Generational Gaps in the Workplace -
May 18, 2011 - Human Resource Management. Generational Gaps in the Workplace. 18 May, 2011. Youth Square, Chai Wan. A Chance for Students and HR ...

Fascinating Fourier Series
Nov 30, 2007 - by M.R. Spiegel. Using these formulae, any periodic function can be expressed in terms of its Fourier series expansion. We use these definitions to deduce some interesting mathematical series in the following sections. Using the Fourie

GAPs Toolkit v4.pdf
information if you have downloaded this or are viewing electronically. If you have any comments, questions, or suggestions, please let us know by emailing. us at [email protected]. Michele Schermann & Annalisa Hultberg. University of Minnesota. On-Farm

Fourier Transformation for Pedestrians
casting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of ... This English edition is based on the third, enlarged edition in German. [4]. ...... smaller and smaller, provided only we make N big enough.

Fourier Transformation for Pedestrians
Springer is a part of Springer Science+Business Media. ... From the host of available material we'll ..... serve as a small introduction to dealing with complex numbers. ..... As frequency ω = 0 – a frequency as good as any other frequency ω =0â€

FOURIER-MUKAI TRANSFORMATION ON ...
Also, since µ and p1 : X × ˆX → X are transverse morphisms, we have p12∗(µ × id ˆX)∗P = µ∗p1∗P. But, in K0(X × ˆX), p1∗P = ∑i(−1)i[Rip1∗P]. From [13, § 13] we have that Rip1∗P = 0 for i = g and Rgp1∗P = k(0) where k(0)

Partial fourier partially parallel imaging
around 2 and 4, respectively, have been widely attained and even higher values for ... The central 1/8 portion of (ii) is extracted and Fou- .... For the constraint to be meaningful there must be some ... during the reconstruction using phase maps.

Fast Fourier Color Constancy - Jon Barron
or subjectively attractive is just a matter of the data used during training. Despite ... performing techniques on standard color constancy bench- marks [12, 20, 30].

ASYMPTOTIC RELATIONS AMONG FOURIER ...
where g(x) is a real valued C∞ function with compact support containing a neigh- borhood ... Let g be a function on R, define the Fourier transform of g by. F(g)(t) ...

Fourier series Vacuum Maxwell's equations.
3 First order vacuum solution with Fourier series. 4. 3.1. Basic solution in terms of undetermined coefficients. . . . . . . 4. 3.2. Solution as time evolution of initial field. . . . . . . . . . . . . . 5. 3.3. Prettying it up? Questions of commutat