Jump to content

Modular forms modulo p

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Pauldubois98 (talk | contribs) at 19:24, 23 March 2020 (Created page with '{{subst:AFC submission/draftnew}}<!-- Important, do not remove this line before article has been created. --> In mathematics, modular forms are function...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In mathematics, modular forms are functions on the Upper half-plane. Their study is part of complex analysis. However, once reduced modulo 2, modular forms create a completely different theory, which may be classified as Algebraic number theory.

Reduction of Modular Forms Modulo 2

Conditions to Reduce Modulo 2

Modular forms are analytic functions, so they admit a Fourier series. As modular forms also satisfy a certain kind of functional equation with respect to the group action of the modular group, this Fourier series may be expressed in terms of . So if is a modular form, then there are coefficients such that . To reduce modulo 2, consider the subspace of modular forms with coefficients of the -series being all integers (since complex numbers, in general, may not be reduced modulo 2). It is then possible to reduce all coefficients modulo 2, which will give a modular form modulo 2.

Basis for Modular Forms Modulo 2

Modular forms are generated by and [1]. It is the possible to normalize and to and , having integers coeffieints in their -series. This gives generators for modular forms, which may be reduced modulo 2. Note the Miller basis has some interesting properties [2]. Once reduced modulo 2, and are just . That is, a trivial reduction. To get a non-trivial reduction, mathematicians use the modular discriminant . It is introduced as a "priority" generator before and . Thus, modular forms are seen as polynomials of , and (over the complex in general, but seen over integers for reduction), once reduced modulo 2, they become just polynomials of over .

The Modular Discriminant Modulo 2

The modular discriminant is defined by an infinite product: The coefficients taht matches are usually denoted , and correspond to the Ramanujan tau function. Results from Kolberg[3] and Jean-Pierre Serre[4] allows to show that modulo 2, we have: i.e., the -series of modulo 2 consists of to powers of odd squares.




References

  1. ^ Stein, William (2007). Modular Forms, a Computational Approach. Theorem 2.17: Graduate Studies in Mathematics. ISBN 978-0-8218-3960-7.{{cite book}}: CS1 maint: location (link)
  2. ^ Stein, William (2007). Modular Forms, a Computational Approach. Lemma 2.20: Graduate Studies in Mathematics. ISBN 978-0-8218-3960-7.{{cite book}}: CS1 maint: location (link)
  3. ^ Kolberg, O. (1962). Congruences for Ramanujan's function . Arbok Univ. Bergen Mat.-Natur. Ser. p. 8. ISSN 0522-9189.
  4. ^ Serre, Jean-Pierre (1973). A course in arithmetic. Springer-Verlag, New York-Heidelberg. p. 96.