DOCSLIB.ORG

New Infinite Families of Exact Sums of Squares Formulas, Jacobi Elliptic

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
New Infinite Families of Exact Sums of Squares Formulas, Jacobi Elliptic Proc. Natl. Acad. Sci. USA Vol. 93, pp. 15004–15008, December 1996 Mathematics New infinite families of exact sums of squares formulas, Jacobi elliptic functions, and Ramanujan’s tau function (Jacobi continued fractionsyHankel or Tura´nian determinantsyFourier seriesyLambert seriesySchur functions) STEPHEN C. MILNE Department of Mathematics, Ohio State University, 231 West 18th Avenue, Columbus, OH 43210 Communicated by Walter Feit, Yale University, New Haven, CT, October 22, 1996 (received for review June 24, 1996) ABSTRACT In this paper, we give two infinite families of of the constant ZN, which occurs in the evaluation of a certain explicit exact formulas that generalize Jacobi’s (1829) 4 and Epstein zeta function, needed in the study of the stability of 8 squares identities to 4n2 or 4n(n 1 1) squares, respectively, rare gas crystals and in that of the so-called Madelung con- without using cusp forms. Our 24 squares identity leads to a stants of ionic salts. different formula for Ramanujan’s tau function t(n), when n The s squares problem is to count the number rs(n) of integer is odd. These results arise in the setting of Jacobi elliptic solutions (x1,...,xs) of the Diophantine equation functions, Jacobi continued fractions, Hankel or Tura´nian 2 2 determinants, Fourier series, Lambert series, inclusiony x1 1 zzz1 xs 5 n, [1] exclusion, Laplace expansion formula for determinants, and Schur functions. We have also obtained many additional in which changing the sign or order of the xi’s gives distinct infinite families of identities in this same setting that are solutions. analogous to the h-function identities in appendix I of Mac- Diophantus (325–409 A.D.) knew that no integer of the donald’s work [Macdonald, I. G. (1972) Invent. Math. 15, form 4n 2 1 is a sum of two squares. Girard conjectured in 91–143]. A special case of our methods yields a proof of the two 1632 that n is a sum of two squares if and only if all prime conjectured [Kac, V. G. and Wakimoto, M. (1994) in Progress divisors q of n with q [ 3 (mod 4) occur in n to an even power. in Mathematics, eds. Brylinski, J.-L., Brylinski, R., Guillemin, Fermat in 1641 gave an ‘‘irrefutable proof’’ of this conjecture. V. & Kac, V. (Birkha¨user Boston, Boston, MA), Vol. 123, pp. Euler gave the first known proof in 1749. Early explicit 415–456] identities involving representing a positive integer formulas for r2(n) were given by Legendre in 1798 and Gauss by sums of 4n2 or 4n(n 1 1) triangular numbers, respectively. in 1801. It appears that Diophantus was aware that all positive Our 16 and 24 squares identities were originally obtained via integers are sums of four integral squares. Bachet conjectured multiple basic hypergeometric series, Gustafson’s Cø nonter- this result in 1621, and Lagrange gave the first proof in 1770. minating 6f5 summation theorem, and Andrews’ basic hyper- Jacobi, in his famous Fundamenta Nova (1) of 1829, intro- geometric series proof of Jacobi’s 4 and 8 squares identities. duced elliptic and theta functions, and used them as tools in the We have (elsewhere) applied symmetry and Schur function study of Eq. 1. Motivated by Euler’s work on 4 squares, Jacobi techniques to this original approach to prove the existence of knew that the number rs(n) of integer solutions of Eq. 1 was similar infinite families of sums of squares identities for n2 or also determined by n(n 1 1) squares, respectively. Our sums of more than 8 ` squares identities are not the same as the formulas of Mathews s n n q3~0, 2q! :5 1 1 O~21! rs~n!q , [2] (1895), Glaisher (1907), Ramanujan (1916), Mordell (1917, n51 1919), Hardy (1918, 1920), Kac and Wakimoto, and many others. where q3(0, q)isthez50 case of the theta function q3(z, q) in ref. 21 given by ` 1. Introduction j2 q3~0, q! :5 O q . [3] j52` In this paper, we announce two infinite families of explicit exact formulas that generalize Jacobi’s (1) 4 and 8 squares Jacobi then used his theory of elliptic and theta functions 2 to derive remarkable identities for the s 5 2, 4, 6, 8 cases of identities to 4n or 4n(n 1 1) squares, respectively, without s using cusp forms. Our 24 squares identity leads to a different q3(0, 2q) . He immediately obtained elegant explicit formulas formula for Ramanujan’s (2) tau function t(n), when n is odd. for rs(n), where s 5 2, 4, 6, 8. We recall Jacobi’s identities for These results arise in the setting of Jacobi elliptic functions, s 5 4 and 8 in the following theorem. Jacobi continued fractions, Hankel or Tura´nian determinants, THEOREM 1.1 (JACOBI). Fourier series, Lambert series, inclusionyexclusion, Laplace ` rqr 4 r21 expansion formula for determinants, and Schur functions. (For q3~0, 2q! 5 1 2 8 ~21! r this background material, see refs. 1 and 3–16.) rO51 1 1 q The problem of representing an integer as a sum of squares ` of integers has had a long and interesting history, which is 5 1 1 8 O~21!n O d qn, [4] surveyed in ref. 17 and chapters 6–9 of ref. 18. The review n51 F dun,d.0 G 4Bd article (19) presents many questions connected with represen- tations of integers as sums of squares. Direct applications of and sums of squares to lattice point problems and crystallography ` r3qr can be found in ref. 20. One such example is the computation q ~0, 2q!8 5 1 1 16 ~21!r 3 O r r51 1 2 q The publication costs of this article were defrayed in part by page charge ` payment. This article must therefore be hereby marked ‘‘advertisement’’ in 5 1 1 16 (21)dd3 qn. [5] accordance with 18 U.S.C. §1734 solely to indicate this fact. O O n51Fdun,d.0 G 15004 Downloaded by guest on September 28, 2021 Mathematics: Milne Proc. Natl. Acad. Sci. USA 93 (1996) 15005 Consequently, we have where r ~n! 5 8 d and r ~n! 5 16 ~21!n1dd3, [6] ` rsqr 4 O 8 O r21 dun,d.0 dun,d.0 U [ U (q) :5 (21) s s O r 4Bd r51 11q respectively. ` In general it is true that 5 O O (21)d1nydds qn n51Fdun,d.0 G r2s~n! 5 d2s~n! 1 e2s~n!, [7] 5 y11m1 s m1y1 [12] O (21) m1q . y1,m1$1 where d2s(n) is a divisor function and e2s(n) is a function of order substantially lower than that of d2s(n). If 2s 5 2, 4, 6, 8, Analogous to Theorem 1.3, we have Theorem 1.5. then e (n) 5 0, and Eq. 7 becomes Jacobi’s formulas for r (n), 2s 2s THEOREM 1.5. including Eq. 6. On the other hand, if 2s . 8 then e2s(n) is never n 0. The function e2s(n) is the coefficient of q in a suitable ‘‘cusp 16 form.’’ The difficulties of computing Eq. 7, especially the q ~0, 2q!24 5 1 1 ~17G 1 8G 1 2G ! 3 9 3 5 7 nondominate term e2s(n), increase rapidly with 2s. The mod- ular function approach to Eq. 7 and the cusp form e2s(n)is 512 2 discussed in ref. 13. For 2s . 8, modular function methods such 1 ~G3G7 2 G5!, [13] as those in refs. 22–27, or the more classical elliptic function 9 approach of refs. 28–30, are used to determine general for- where mulas for d2s(n) and e2s(n)inEq.7. Explicit, exact examples of Eq. 7 have been worked out for 2 # 2s # 32. Similarly, explicit ` rsqr r formulas for rs(n) have been found for (odd) s , 32. Alternate, Gs [ Gs(q) :5 (21) r elementary approaches to sums of squares formulas can be rO51 12q found in refs. 31–36. ` We next consider classical analogs of Eqs. 4 and 5 corre- 5 O O (21)dds qn sponding to the s 5 8 and 12 cases of Eq. 7. n51Fdun,d.0 G Glaisher (37, 62–64) used elliptic function methods rather 5 m1 s m1y1 [14] than modular functions to prove the following theorem. O (21) m1q . y ,m $1 THEOREM 1.2 (GLAISHER). 1 1 32 An analysis of Eq. 10b depends upon Ramanujan’s (2) tau q 16 5 1 m1 7 m1y1 [8a] function t(n), defined by 3~0, 2q! 1 O ~21! m1q 17 y1,m1$1 ` 512 q~q; q!24 :5 t(n)qn. [15] 8 2 2 8 ` O 2 q~q; q) (q ;q! , [8b] n 1 17 ` ` 5 For example, t(1) 5 1, t(2) 5224, t(3) 5 252, t(4) 521472, where we have t(5) 5 4830, t(6) 526048, and t(7) 5216744. Ramanujan r (ref. 2, equation 103) conjectured, and Mordell (38) proved, ~q; q!` :5 P(12q ). [9] r$1 that t(n) is multiplicative. In the case where n is an odd integer (in particular an odd n Glaisher took the coefficient of q to obtain r16(n). The same prime), equating Eqs. 10a, 10b, and 13 yields two formulas for formula appears in ref. 13 (equation 7.4.32). t(n) that are different from Dyson’s (39) formula. We first To find r24(n), Ramanujan (ref. 2, entry 7, table VI; see also obtain Theorem 1.6.
Load more

Recommended publications
  • Divisibility of Projective Modules of Finite Groups
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Journal of Pure and Applied I Algebra 8 (1976) 183-185 0 North-Holland Publishing Company DIVISIBILITY OF PROJECTIVE MODULES OF FINITE GROUPS Walter FEIT * Department of Mathematics, Yale University, New Haven, Conn., U.S.A. Communicated by A. Heller Received 12 September 1975 1. Introduction Let H be a finite group. Let p be a prime and let F be an algebraically closed field of characteristic /Jo An F [H] module will always mean a finitely generated unital right F [H] module. If V is an F [H] module let (V) denote the isomorphism class of F [H] modules which contains V. Let &(H’) denote the representation ring of H with respect to F. Since the unique decomposition property holds (Krull-Schmidt Theorem), AF(H) is a commutative Z-algebra which is a free Z module and (V j + (W)= (If @ IV), (V)(W) = (lb Iv). For any F[H] module V let flv denote its Brauer character. The map sending V to /3v defines a homomorphism p of A#) onto the ring A:(H) of all integral linear combinations of irreducible Brauer characters of H. If ar E&(H) let p, denote the image of CYunder this map. Of course&(H) is isomorphic to the Grothendieck ring ofF[H]. Let U be a projective F[H] module and let V be any F[H]module. Then U @ I/ is projective. Thus P#), the subset of A&!?) spanned by all (U) with U projective, is an ideal of AF(H).
    [Show full text]
  • Chapter I, from Solvability of Groups of Odd Order, Pacific J. Math, Vol. 13, No
    Pacific Journal of Mathematics CHAPTER I, FROM SOLVABILITY OF GROUPS OF ODD ORDER, PACIFIC J. MATH, VOL. 13, NO. 3 (1963 WALTER FEIT AND JOHN GRIGGS THOMPSON Vol. 13, No. 3 May 1963 SOLVABILITY OF GROUPS OF ODD ORDER WALTER FEIT AND JOHN G. THOMPSON CHAPTER I 1. Introduction The purpose of this paper is to prove the following result: THEOREM. All finite groups of odd order are solvable. Some consequences of this theorem and a discussion of the proof may be found in [11]. The paper contains six chapters, the first three being of a general nature. The first section in each of Chapters IV and V summarizes the results proved in that chapter. These results provide the starting point of the succeeding chapter. Other than this, there is no cross reference between Chapters IV, V and VI. The methods used in Chapter IV are purely group theoretical. The work in Chapter V relies heavily on the theory of group characters. Chapter VI consists primarily of a study of generators and relations of a special sort. 2. Notation and Definitions Most of the following lengthy notation is familiar. Some comes from a less familiar set of notes of P. Hall [20], while some has arisen from the present paper. In general, groups and subsets of groups are denoted by German capitals, while group elements are denoted by ordinary capitals. Other sets of various kinds are denoted by English script capitals. All groups considered in this paper are finite, except when explicitly stated otherwise. Ordinary lower case letters denote numbers or sometimes elements of sets other than subsets of the group under consideration.
    [Show full text]
  • GROUPS WHICH HAVE a FAITHFUL REPRESENTATION of DEGREE LESS THAN ( P − 1/2)
    Pacific Journal of Mathematics GROUPS WHICH HAVE A FAITHFUL REPRESENTATION OF DEGREE LESS THAN . p − 1=2/ WALTER FEIT AND JOHN GRIGGS THOMPSON Vol. 11, No. 4 1961 GROUPS WHICH HAVE A FAITHFUL REPRESENTATION OF DEGREE LESS THAN [p - 1/2) WALTER FEIT AND JOHN G. THOMPSON 1. Introduction, Let G be a finite group which has a faithful representation over the complex numbers of degree n. H. F. Blichfeldt has shown that if p is a prime such that p > (2n + l)(n — 1), then the Sylow p-group of G is an abelian normal subgroup of G [1]. The pur- pose of this paper is to prove the following refinement of Blichfeldt's result. THEOREM 1. Let p be a prime. If the finite group G has a faithful representation of degree n over the complex numbers and if p > 2n + 1, then the Sylow p-subgroup of G is an abelian normal subgroup of G. Using the powerful methods of the theory of modular characters which he developed, R. Brauer was able to prove Theorem 1 in case p2 does not divide the order of G [2]. In case G is a solvable group, N. Ito proved Theorem 1 [4]. We will use these results in our proof. Since the group SL{2, p) has a representation of degree n = (p — l)/2, the inequality in Theorem 1 is the best possible. It is easily seen that the following result is equivalent to Theorem 1. THEOREM 2. Let A, B be n by n matrices over the complex numbers.
    [Show full text]
  • On Simple Groups of Order 2” L 3B - 7” a P
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOURNAL OF ALGEBRA 25, 1x3-124 (1973) On Simple Groups of Order 2” l 3b - 7” a p LEO J. ALEX* SUNY, Collegeat Oneonta,Oneontn, New York 13820 Cornrn~~ica~e~ by Waher Fed Received November I, 1971 1. INTR~DUCT~ON 1.1 Let PSL(n, n) denote the projective special linear group of degree n over GF(q), the field with p elements. We prove the following theorem. THEOREM. Let G be a simple group of order 2” . 3b * 7” * p, a, b > 0, p a prime distinct from 2, 3 and 7. If the index of a Sylow p-subgroup of G in its normalaker i two, therz G is ~s~rn~ph~cto Mte of the proups, J?w5 5), p=q, 91, PSL[2,27) and PSL(3,4). The methods used to prove the theorem are natural extensions of the methods used by Brauer [2J to classify all simple groups of order 5 . 3” .2b. In Section 2, we discuss the degrees of the irreducible characters in B,(p), the principal p-block of G. Using elementary number theory, we show that there are nine possibilities for the equation relating these character degrees. In Section 3, we consider the possible character degrees for B,(p) obtained in Section 2. Using class algebra coefficients and simple group classification theorems we show that the degree equations 1 + 3 = 4, 1 + 8 = 9, 1 + 27 = 28, and 1 + 63 = 64 lead, respectively, to the groups PSL(2, 5), PSL(2,9), PSL(527) and PSL(3,4).
    [Show full text]
  • Lecture About Efim Zelmanov 1
    1 Lecture ab out E m Zelmanov E m Zelmanov erhielt die Fields-Medaille fur seine brilliante Losung des lange Zeit o enen Burnside-Problems. Dab ei handelt es sich um ein tie iegen- des Problem der Grupp entheorie, der Basis fur das mathematische Studium von Symmetrien. Gefragt ist nach einer Schrankefur die Anzahl der Sym- metrien eines Ob jektes, wenn jede einzelne Symmetriebeschrankte Ordnung hat. Wie alle b edeutenden mathematischen Resultate hab en auch jene von Zelmanov zahlreiche Konsequenzen. Darunter sind Antworten auf Fragen, b ei denen ein Zusammenhang mit dem Burnside-Problem bis dahin nicht einmal vermutet worden war. Vor der Losung des Burnside-Problems hatte Zelma- nov b ereits wichtige Beitrage zur Theorie der Lie-Algebren und zu jener der Jordan-Algebren geliefert; diese Theorien hab en ihre Ursprunge in Geometrie bzw. in Quantenmechanik. Einige seiner dort erzielten Ergebnisse waren fur seine grupp entheoritischen Arb eiten von ausschlaggeb ender Bedeutung. Auf diese Weise wird einmal mehr die Einheit der Mathematik dokumentiert, und es zeigt sich, wie sehr scheinbar weit auseinanderliegende Teilgebiete mitein- ander verbunden sind und einander b eein ussen. Auszug aus der Laudatio von Walter Feit. E m Zelmanov has received a Fields Medal for the solution of the restric- ted Burnside problem. This problem in group theory is to a large extenta problem in Lie algebras. In proving the necessary prop erties of Lie algebras, Zelmanov built on the work of many others, though he went far b eyond what had previously b een done. For instance, he greatly simpli ed Kostrikin's results which settled the case of prime exp onent and then extended these metho ds to handle the prime power case.
    [Show full text]
  • Certain Finite Linear Groups of Prime Degree
    JOURNAL OF ALGEBRA 32, 286-3 16 (1974) Certain Finite Linear Groups of Prime Degree DAVID A. SIBLEY* Department of Mathematics, Box 21.55 Yale Station, Yale University, New Haven, Connecticut 06520 Communicated by Walter Feit Received June 15, 1973 1. INTRODUCTION In studying finite linear groups of fixed degree over the complex field, it is convenient to restrict attention to irreducible, unimodular, and quasiprimitive groups. (For example, see [3], [9], and [12].) As is well known, any representa- tion is projectively equivalent to a unimodular one. Also., a representation which is not quasiprimitive is induced from a representation of a proper subgroup. (A quasiprimitive representation is one whose restriction to any normal subgroup is homogeneous, i.e., amultiple of one irreducible representa- tion of the subgroup.) Hence, these assumptions are not too restrictive. If one assumes also that the degree is an odd prime p, there is a natural division into cases, according to the order of a Sylow p-group P of such a group G. The following is known. (1) / P 1 = p. G is known for small values of p. See below. (2) 1 P j = p2. H ere G is G1 x 2, where 2 is the group of order p and G1 is a group from case (1). (See [3].) (3) 1P 1 = p3. G is known only for small values of p. (4) [ P / = p4. Here P contains a subgroup Q of index p which is normal in G, and G/Q is isomorphic to a subgroup of SL(2,p), See [7] and [lo], independently.
    [Show full text]
  • Lie Algebras and Classical Partition Identities (Macdonald Identities/Rogers-Ramanujan Identities/Weyl-Kac Character Formula/Generalized Cartan Matrix Lie Algebras) J
    Proc. Nati. Acad. Sci. USA Vol. 75, No. 2, pp. 578-579, February 1978 Mathematics Lie algebras and classical partition identities (Macdonald identities/Rogers-Ramanujan identities/Weyl-Kac character formula/generalized Cartan matrix Lie algebras) J. LEPOWSKY* AND S. MILNE Department of Mathematics, Yale University, New Haven, Connecticut 06520 Communicated by Walter Feit, November 7,1977 ABSTRACT In this paper we interpret Macdonald's un- There is in general no such expansion for the unspecialized specialized identities as multivariable vector partition theorems numerator in Eq. 1. However, we have found a product ex- and we relate the well-known Rogers-Ramanujan partition identities to the Weyl-Kac character formula for an infinite- pansion for the numerator when all the variables e(-simple dimensional Euclidean generalized Cartan matrix Lie alge- roots) are set equal. Such a numerator is said to be principally bra. specialized. The reason for this definition is given elsewhere (J. Lepowsky, unpublished). To be more precise, when ao and In this paper we announce relationships between Lie algebra al are the simple roots of the infinite-dimensional GCM Lie theory and certain partition formulas which are important in algebra Al'), which is related to 9f(2, C), we have combinatorial analysis. Specifically, we interpret Macdonald's THEOREM 1. (Numerator Formula): Let X be a dominant unspecialized identities (1) as multivariable vector partition integral linearform and let V be the standard module for A1(l) theorems and we relate the well-known Rogers-Ramanujan with highest weight X. Then we have: partition identities to the Weyl-Kac character formula for an infinite-dimensional Euclidean generalized Cartan matrix x(V) E (-1)l(w)e(wp - p)/e()e(-ao)=e(-aj)=q (GCM) Lie algebra.
    [Show full text]
  • All of Mathematics Is Easy Once You Know How to Do It” Is from My Thesis Advisor, Walter Feit
    Talking About Teaching at The Ohio State University All of Mathematics Is Easy Once You Know How to Do It RON SOLOMON Professor of Mathematics College of Mathematical and Physical Sciences Editor’s note: This essay was originally delivered as an invited lecture at the Academy of Teaching’s “Mini-Conference on Scholarship, Teaching, and Best Practice,” on Friday, April 25, 2008. Some of the marks of the occasion have been retained in order to preserve the full spirit of the lecture. Thank you for the invitation to speak here. I am now nearing the end of my 37th year as a teacher of mathematics and my 33rd year as a faculty member at Ohio State. But this is the first time I have been forced to write a teaching statement or to articulate a philosophy of teaching. I must say that my only personal rules are: love the material that you are teaching; and care about the students you are teaching. The year for which I received a teaching award, I combined these rules with a huge investment of time. I divided my class of roughly 25 students into five groups and I required each group to come to my office for an hour each week. So I was putting in 8 contact hours per week for a 3-credit hour course. It worked, but I’m sure there must be an easier way to be an effective teacher. But it is hard to replace time and personal contact. I stumbled into the title of my lecture at the urging of Dr.
    [Show full text]
  • Chapter I, from Solvability of Groups of Odd Order, Pacific J. Math, Vol. 13, No
    Pacific Journal of Mathematics CHAPTER I, FROM SOLVABILITY OF GROUPS OF ODD ORDER, PACIFIC J. MATH, VOL. 13, NO. 3 (1963 WALTER FEIT AND JOHN GRIGGS THOMPSON Vol. 13, No. 3 May 1963 SOLVABILITY OF GROUPS OF ODD ORDER WALTER FEIT AND JOHN G. THOMPSON CHAPTER I 1. Introduction The purpose of this paper is to prove the following result: THEOREM. All finite groups of odd order are solvable. Some consequences of this theorem and a discussion of the proof may be found in [11]. The paper contains six chapters, the first three being of a general nature. The first section in each of Chapters IV and V summarizes the results proved in that chapter. These results provide the starting point of the succeeding chapter. Other than this, there is no cross reference between Chapters IV, V and VI. The methods used in Chapter IV are purely group theoretical. The work in Chapter V relies heavily on the theory of group characters. Chapter VI consists primarily of a study of generators and relations of a special sort. 2. Notation and Definitions Most of the following lengthy notation is familiar. Some comes from a less familiar set of notes of P. Hall [20], while some has arisen from the present paper. In general, groups and subsets of groups are denoted by German capitals, while group elements are denoted by ordinary capitals. Other sets of various kinds are denoted by English script capitals. All groups considered in this paper are finite, except when explicitly stated otherwise. Ordinary lower case letters denote numbers or sometimes elements of sets other than subsets of the group under consideration.
    [Show full text]
  • Collaborative Mathematics and the 'Uninvention' of a 1000-Page Proof
    436547SSS Social Studies of Science 42(2) 185 –213 A group theory of group © The Author(s) 2012 Reprints and permission: sagepub. theory: Collaborative co.uk/journalsPermissions.nav DOI: 10.1177/0306312712436547 mathematics and the sss.sagepub.com ‘uninvention’ of a 1000-page proof Alma Steingart Program in History, Anthropology, and Science, Technology, and Society, MIT, Cambridge, MA, USA Abstract Over a period of more than 30 years, more than 100 mathematicians worked on a project to classify mathematical objects known as finite simple groups. The Classification, when officially declared completed in 1981, ranged between 300 and 500 articles and ran somewhere between 5,000 and 10,000 journal pages. Mathematicians have hailed the project as one of the greatest mathematical achievements of the 20th century, and it surpasses, both in scale and scope, any other mathematical proof of the 20th century. The history of the Classification points to the importance of face-to-face interaction and close teaching relationships in the production and transformation of theoretical knowledge. The techniques and methods that governed much of the work in finite simple group theory circulated via personal, often informal, communication, rather than in published proofs. Consequently, the printed proofs that would constitute the Classification Theorem functioned as a sort of shorthand for and formalization of proofs that had already been established during personal interactions among mathematicians. The proof of the Classification was at once both a material artifact and a crystallization of one community’s shared practices, values, histories, and expertise. However, beginning in the 1980s, the original proof of the Classification faced the threat of ‘uninvention’.
    [Show full text]
  • On the Work of John Thompson
    Actes, Congrès intern, math., 1970. Tome 1, p. 15 à 16. ON THE WORK OF JOHN THOMPSON by R. BRAUER It is an honor to be called upon to describe to you the brilliant work for which John Thompson has just been awarded the Fields medal. The pleasure is tempered by the feeling that he himself could do this job much better. But perhaps I can say some things he would never say since he is a modest person. The central outstanding problem in the theory of finite groups today is that of determining the simple finite groups. One may say that this problem goes back to Galois. In any case, Camille Jordan must have been aware of it. Important classes of simple groups have been constructed as well as some individual types of such groups.- French mathematicians, Galois, Jordan, Mathieu, Chevalley, have been the pioneers in this work. In recent years, mathematicians of many different countries have joined. However, the general problem is unsolved. We do not know at all how close we are to knowing all simple finite groups. I shall not discuss the present situa- tion of the problem since this will be the topic of Feit's address at this congress. I may only say that up to the early 1960's, really nothing of real interest was known about general simple groups of finite order. I shall now describe Thompson's contribution. The first paper I have to mention is a joint paper by Walter Feit and John Thompson and, of course, Feit's part in it should not be overlooked.
    [Show full text]
  • Minimal 2-Local Geometries for the Held and Rudvalis Sporadic Groups
    JOURNAL OF ALGEBRA 79, 286-306 (1982) Minimal 2-Local Geometries for the Held and Rudvalis Sporadic Groups GEOFFREYMASON* Department of Mathematics, University of California, Santa Cruz, California 95064 AND STEPHEND. SMITH* Department of Mathematics, University of Illinois, Chicago, Illinois 60680 Communicated by Walter Feit Received November 2. 1981 The notion of a 24ocal geometry for a sporadic simple group is introduced by Ronan and Smith in [9]. In the case of the Held and Rudvalis groups, knowledge of 2-local subgroups is sufficient to suggest a 2-local diagram (exhibiting the chamber system, in the sense of Tits [ 13]), but no natural irreducible IF,-module realizing the geometry was provided. In this article, we show that He acts on such a geometry in 51 dimensions, and R in 28 dimensions. The proof is heavily computational. Our final remarks discuss some unusual features of these geometries. SOMESTANDARDARGUMENTS We list here some frequently-used arguments, which we will later refer to by a mnemonic rather than a reference number. For both groups to be considered, we start with a complex irreducible character x for the group, and by reduction mod 2 of an underlying module, obtain an IF,-module V for the group. If now g is any element of the group, we may use the value x(g) to compute the dimensions of C,(g) and [ V, g]. When g has odd order, V is just the direct product of these two subspaces; if * Both authors were partially supported by grants from the National Science Foundation. The work was partly done during visits by Mason at UICC and Smith at Caltech.
    [Show full text]