Essays in Constructive Mathematics
Harold M. Edwards
Essays in Constructive Mathematics
Springer
Harold M. Edwards Courant Institute of Mathematical Sciences New York University 251 Mercer Street New York, NY 10012 USA
MSC 2000; 00B15, 03Fxx Library of Congress Cataloging-in-Publication Data Edwards, Harold M. Essays in constructive mathematics / Harold M. Edwards. p. cm. ISBN 0-387-21978-1 (alk. paper) 1. Constructive mathematics. I. Title. QA9.56.E39 2004 511.3—dc22 2004049156 ISBN 0-387-21978-1
Printed on acid-free paper.
© 2005 Harold M. Edwards All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer Science+Business Media, Inc., 233 Spring Street, New York, NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden. The use in this publication of trade names, trademarks, service marks, and similar terms, even if they are not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights. Printed in the United States of America. 987654321
(EB)
SPIN 10985564
Springer is a part of Springer Science+Business Media springeronline.com
For Betty with love
Contents
Preface Synopsis
ix xiii
1
A Fundamental Theorem 1.1 General Arithmetic 1.2 A Fundamental Theorem 1.3 Root Fields (Simple Algebraic Extensions) 1.4 Factorization of Polynomials with Integer Coefficients 1.5 A Factorization Algorithm 1.6 Validation of the Factorization Algorithm 1.7 About the Factorization Algorithm 1.8 Proof of the Fundamental Theorem 1.9 Minimal Splitting Polynomials
1 1 6 10 13 20 27 31 35 39
2
Topics in Algebra 2.1 Galois's Fundamental Theorem 2.2 Algebraic Quantities 2.3 Adjunctions and the Factorization of Polynomials 2.4 The Splitting Field of x^ + cix^"^ -h C2X^~^ + • • • + c^ 2.5 A Fundamental Theorem of Divisor Theory
41 41 46 49 56 62
3
Some Quadratic Problems 3.1 The Problem A\J-\- B = D and "Hypernumbers" 3.2 Modules 3.3 The Class Semigroup. Solution of An^B =n 3.4 Multiplication of Modules and Module Classes 3.5 Is A a Square Mod p? 3.6 Gauss's Composition of Forms 3.7 The Construction of Compositions
65 65 71 79 93 102 108 112
viii
Contents
4
The Genus of an Algebraic Curve 4.1 Abel's Memoir 4.2 Euler's Addition Formula 4.3 An Algebraic Definition of the Genus 4.4 Newton's Polygon 4.5 Determination of the Genus 4.6 Holomorphic Differentials 4.7 The Riemann-Roch Theorem 4.8 The Genus Is a Birational Invariant
119 119 124 128 132 142 155 164 171
5
Miscellany 5.1 On the So-Called Fundamental Theorem of Algebra 5.2 Proof by Contradiction and the Sylow Theorems 5.3 Overview of 'Linear Algebra' 5.4 The Spectral Theorem 5.5 Kronecker as One of E. T. Bell's "Men of Mathematics"
179 179 186 190 196 201
References
205
Index
209
Preface
He [Kronecker] was, in fact, attempting to describe and to initiate a new branch of mathematics, which would contain both number theory and algebraic geometry as special cases.—Andre Weil [62] This book is about mathematics, not the history or philosophy of mathematics. Still, history and philosophy were prominent among my motives for writing it, and historical and philosophical issues will be major factors in determining whether it wins acceptance. Most mathematicians prefer constructive methods. Given two proofs of the same statement, one constructive and the other not, most will prefer the constructive proof. The real philosophical disagreement over the role of constructions in mathematics is between those—the majority—who believe that to exclude from mathematics all statements that cannot be proved constructively would omit far too much, and those of us who believe, on the contrary, that the most interesting parts of mathematics can be dealt with constructively, and that the greater rigor and precision of mathematics done in that way adds immensely to its value. Mathematics came to a fork in the road around 1880. On one side, Dedekind, Cantor, and Weierstrass advocated accepting transfinite "constructions" like those needed to prove the Bolzano-Weierstrass "theorem." On the other, Kronecker argued that no such departure from the standards of proof adhered to by Dirichlet and Gauss was necessary and that the Aristotelian exclusion of completed infinites could be maintained. As we all know, the first group carried the day, and the Dedekind-Cantor-Weierstrass road was the one taken. The new orthodoxy was consolidated by Hilbert a century ago, and has reigned ever since, despite occasional challenges, notably from Brouwer and Bishop. During this century, the phrase "foundations of mathematics" has come to mean for most working mathematicians the complex of ideas surrounding the axioms of set theory and the axiom of choice, matters that for
X
Preface
Kronecker had no mathematical meaning at all, much less foundational meaning. Why, a hundred years after this choice was made, and made so decisively, do I believe t h a t the road Kronecker proposed might win new consideration? T h e advent of computers has had a profound impact on mathematics and mathematicians t h a t has already altered views about t h e n a t u r e and meaning of mathematics in a way favorable to Kronecker. T h e new technology causes mathematics to be t a u g h t and experienced in a much more computational way and directs attention to algorithms. In other words, it fosters constructive attitudes. My own preference for constructive formulations was shaped by my experience with computer programming in the 1950s, and computer programming at t h a t time was trivial by today's standards. No evidence supports the image t h a t is so often presented of Kronecker as a vicious and personal critic of Cantor and Weierstrass—another instance of history being written by the victors. As far as I have been able to discover, Kronecker vigorously opposed the views of Cantor and Weierstrass, as well as those of Dedekind, with whom he was on far better terms, but he was not hostile to the men themselves. Moreover, his opposition t o their views—which was of course reciprocated—was rarely expressed in his publications. In the rare instances in which he mentioned such issues, he merely stated his belief t h a t the new ways of dealing with infinity t h a t were coming to be accepted were unnecessary. Instead of excoriating nonconstructive methods, as legend would have us believe, he concentrated his efforts on backing up his beliefs with concrete mathematical results proved constructively. No one doubts t h a t Kronecker was one of the giants of nineteenth-century mathematics, but it is often said t h a t he succeeded in his works because he ignored the strictures t h a t he advocated in his philosophy. This view of the relation of Kronecker's mathematics to his philosophy is often ascribed to Poincare, but as I have written elsewhere [21], this ascription is based on a misinterpretation of a passage [53] in which Poincare writes about issues unrelated to the t r e a t m e n t of infinity in mathematics. Indeed, no one who has studied Kronecker's works could believe t h a t he accepted completed infinites or made use of nonconstructive arguments. Like many other mathematicians since, he was impatient with the philosophy of mathematics and wanted only to get on with his m a t h e m a t i c s itself, but for him "mathematics" was always constructive. T h a t a t t i t u d e inspires these essays. My goal has been not to argue against the prevailing orthodoxy, but to show t h a t substantial mathematics can be done constructively, and t h a t such mathematics is interesting, illuminating, and concordant with t h e new algorithmic spirit of our times. I have given examples of what I m e a n by constructive mathematics, without trying to define it. The underlying idea is well expressed in the essay of Poincare mentioned above, in which he says t h a t the guiding principle for b o t h Kronecker and Weierstrass was to "derive everything from the n a t u r a l numbers" so t h a t t h e result would "partake of the certainty of arithmetic." I regard the natural
Preface
xi
numbers not as a completed infinite set but as a means of describing the activity of counting. (See Essay 1.1.) T h e essence of constructive mathematics for me hes in the insistence upon treating infinity, in Gauss's phrase, as a fagon de parler, a shorthand way of describing ideas t h a t need to be restated in terms of finite calculations when it comes to writing a formal proof. It will surely be remarked t h a t almost all of the topics treated in the essays come from algebra and number theory. They not only partake of the certainty of arithmetic, as Poincare says, they are arithmetic—what Kronecker called "general arithmetic." (Again, see Essay 1.1.) But there are three exceptions. In Essay 4.4, Newton's polygon is treated as a m e t h o d of constructing an infinite series, which means, constructively, as an algorithm for generating arbitrarily many terms of the series. Convergence is not an issue because the theory t r e a t s t h e series themselves, not their limits in any sense. In Essay 5.1, a complex root of a given polynomial—a convergent sequence of rational complex numbers whose limit is a root of the polynomial—is found by an explicit construction. Finally, Essay 5.4, which sketches a proof of the spectral theorem for symmetric matrices of integers, necessarily deals with real numbers, t h a t is, with convergent sequences of rationals. An essay is "a short literary composition on a single subject, usually presenting t h e personal views of the author." There is nothing literary about these essays, b u t they do treat their mathematical subjects from a personal point of view. For example. Essay 5.1 explains why the "fundamental theorem of algebra" is misnamed—in a very real sense it isn't even t r u e — a n d Essay 1.2 explains why Euclid's statement of Proposition 1 of Book 1 of the Elements^ "On a given finite straight line to construct an equilateral triangle" is b e t t e r t h a n "Given a straight line segment, there exists an equilateral triangle of which it is one of t h e sides," the form in which most of Euclid's present-day successors would state it. These are my opinions. To my dismay, it is incessantly borne in on me how few of my colleagues share t h e m and how completely mathematicians today misunderstand and reject t h e m . These compositions t r y — t h e y essay—to present t h e m in a way t h a t will permit t h e reader to see past the preconceptions t h a t stand between what I regard as a commonsense a t t i t u d e toward the study of m a t h e m a t i c s and t h e attitudes most commonly accepted today. They essay t o reopen the Kroneckerian road not taken. Acknowledgments I am profoundly grateful to Professor David Cox, who provided encouragement when it was sorely needed, and backed it u p with sound advice. I also t h a n k Professors Bruce Chandler, Ricky Pollack, and Gabriel Stolzenberg for friendship and for many years of stimulating conversation about the history and philosophy of mathematics. Most of all, I t h a n k my wife, B e t t y Rollin, t o whom this book is dedicated, for more t h a n I could ever enumerate.
Synopsis
The essays are divided into five parts: A Fundamental Theorem Topics in Algebra Some Quadratic Problems The Genus of an Algebraic Curve Miscellany The fundamental theorem of Part 1 constructs a splitting field for a given polynomial. As is shown in Part 2, the case in which the given polynomial has coefficients in a ring of the form Z[ci, C2, . . . , Cj^]—a ring of polynomials in some set of indeterminates ci, C2, .. •, Cj^ with integer coefficients—suffices for the apparently more general case of a polynomial f{x) whose coefficients are "algebraic quantities" in a very general sense. For this reason, only polynomials with coefficients in Z[ci, C2, . . . , Cjy] are considered in Part 1. Another way to state the problem "Construct a splitting field for a given polynomial" is "Extend the notion of computation with polynomials with integer coefficients in such a way that the given polynomial can be written as a product of linear factors." Computation in Z[ci, C2, . . . , Cj^] involves just addition, subtraction, and multiplication, but it extends to computations involving division in the field of quotients of the integral domain Z[ci, C2, . . . , c^y] in the same way that computation in the ring of integers extends to computation in the field of rational numbers. As Gauss's lemma shows (Essay 1.4), this extension does not affect the factorization of polynomials. A simple further extension of Z[ci, C2, . . . , c^^] is effected by "adjoining" one root of a monic, irreducible polynomial with coefficients in Z[ci, C2, . . . , Cy] to the field of rational functions. This simple construction, which Galois used with amazing success, although with some lack of rigor, is generally known as a "simple algebraic extension" of the field of quotients of Z[ci, C2, . . . , c^y]. For the sake of brevity, I have called a field constructed in this way the "root field" of the monic, irreducible polynomial used in its construction (Essay 1.3).
xiv
Synopsis
W i t h this specific description of the way in which computations in Z[ci, C2, . • . , c^y] are to be extended, the construction problem to be solved becomes, "Given a polynomial / with coefficients in Z[ci, C2, . . . , c^y], find an auxiliary polynomial g with coefficients in t h e same ring such t h a t g is monic and irreducible and such t h a t its root field splits / " in t h e sense t h a t / can be written as a product of linear factors with coefficients in t h e root field of g. T h e problem, then, is, "Given / construct ^f." T h e solution in Part 1 is iterative. Suppose t h a t ^ is a failed a t t e m p t at a solution. Thus, the factorization of / over the root field of g contains at least one irreducible factor of degree greater t h a n 1. The iteration needs to construct a better a t t e m p t at a solution. Specifically, it needs to construct a new auxiliary polynomial, call it gi, with the property t h a t the factorization of / over the root field of gi contains more linear factors t h a n does the factorization of / over the root field of ^f. If gi fails to split / , the same procedure can be applied again to find a g2 t h a t gives / more linear factors t h a n gi did. Since the number of linear factors of / increases with each new ^, and since t h e number of such factors is bounded above by t h e degree of / , such an iteration must eventually reach a solution of the problem—an a t t e m p t e d g t h a t does not fail. To make this sketch into an actual iterative construction of a splitting field for / requires two main steps. First, given / and an a t t e m p t at g^ one needs to be able to factor f when it is regarded as a polynomial with coefficients not in Z[ci, C2, ' • y Ci,] hut in its extension, the root field of g. The difficult step in the construction of a splitting field for / is the algorithmic solution of this factorization problem. T h e algorithm is set forth in Essay 1.5, with examples, and the proof t h a t it achieves its objective is in Essay 1.6. The relation of the algorithm to Kronecker's solution of t h e same factorization problem is among the subjects discussed in Essay 1.7. Second, one needs to describe explicitly how to pass from a g t h a t fails to split / to a new gi t h a t comes closer to splitting / . T h e underlying idea of the construction is simple: Because g does not split / , there is an irreducible factor, call it (/), of / over the root field of g whose degree is greater t h a n 1. Adjoin to the root field of g a root of (j). This double adjunction, first of a root of g and then of a root of 0, gives a field over which / has more linear factors—a field in which / has more roots— because it contains a root of 0, and the root field of g did not. T h e problem is to write this double adjunction as a simple one—specifically as the field obtained by adjoining a root of a new gi with coefficients in Z[ci, C2, • . . , c^y]. T h e construction of such a gi is given in Essay 1.8. Finally, although there are infinitely many polynomials g t h a t split / , there is only one splitting field of / in t h e sense t h a t if ^ is a minimal splitting polynomial of / one t h a t is itself split by any polynomial t h a t splits / — t h e root field of g is isomorphic to the root field of any other minimal splitting polynomial of / . T h e end result is a theorem t h a t in my opinion deserves the name "Fundamental Theorem of Algebra" much more t h a n the theorem t h a t is and probably always will be known by t h a t name: Given a polynomial f (in one
Synopsis
xv
variable) with coefficients in Z[ci, C2, ..., Cjy] there is an explicit way to extend rational computations in Z[ci, C2, .. -, Cj^] so that f factors into linear factors; moreover, any two minimal ways of doing this are isomorphic. For the relation of this theorem to the "Fundamental Theorem of Algebra" see Essay 5.1. The theorem of Part 1 that has just been described is implicitly contained— with no hint of a proof—in Lemma III of Galois's treatise [27] on the algebraic solution of equations (see [22]). In this sense, it is the foundation of Galois theory. The connection is explained in Essays 2.1 and 2.3. Essay 2.2 is devoted to justifying Kronecker's assertion that every field of algebraic quantities is isomorphic to the root field of a polynomial with coefficients in some Z[ci, C2, . . . ; Cj^] as that concept was defined in Part 1. This fact is the basis of Kronecker's later view—despite the fact that he had previously given the title Foundations of an Arithmetical Theory of Algebraic Quantities to his major publication—that "algebraic quantities" were unnecessary in mathematics and that algebraic questions should be studied using "general arithmetic" instead (see Essay 1.1). The algorithmic description of fields of algebraic quantities in terms of "adjunction relations" in Essay 2.3 gives a construction of the splitting field of a polynomial that is very close to Chebotarev's in his excellent but littleknown book on Galois theory [8]. The construction of the splitting field of a general monic polynomial of degree n in Essay 2.4 proves another basic theorem of Galois—another to which Galois gave no hint of a proof—that the Galois group of an nth-degree polynomial f{x) whose coeflacients are 'letters' is the full symmetric group. The splitting field is explicitly given by adjunction relations fi{ai) — 0, where (1)
fi{x) -
^^""^ {x - ai){x - 0^2) • • • {x -
ai-i)
is the irreducible polynomial satisfied by a root a^ of f{x) whose coefficients are polynomials in the roots o^i, 0:2, . . . , o^i-i already adjoined. (The right side of (1), as it stands, is of course not a polynomial; it becomes one once i — 1 roots a i , 0^2, • • •, <^z-i of / ( ^ ) have been adjoined and the divisions (1) calls for have been performed.) The degree n! of the extension is of course the product of the degrees of these adjunction relations. The nub of the matter is the proof that each fi{x) is irreducible over the field generated by a i , 0^2, • • •, ai-i. These ideas stem from Kronecker, as does the fundamental theorem of divisor theory in Essay 2.5. Part 3 deals with different matters altogether. Its primary inspiration is Gauss's proof of quadratic reciprocity in Section 5 of the Disquisitiones Arithmeticae^ but the proof is recast by translating it from a study of quadratic forms and their composition to a study of modules and their multiplication. The "modules" involved are entities of the following type. With "number" meaning a number 0, 1, 2, . . . , let a "hypernumber" for a given A mean
xvi
Synopsis
an expression y -\- x\/~A in which x and y are numbers. Such hyper numbers can be added and multiphed, and, when the sizes of the coefficients allow it, subtracted as well. It is n a t u r a l to assume t h a t t h e given A is not a square, because otherwise, y -f- x\/A would be a number, and nothing new would be found by computing with hypernumbers. It will also be assumed t h a t A is positive, but this assumption is made for the sake of simplicity and has no particular justification except t h a t the case of positive A suffices for the proof of quadratic reciprocity. Let m i , 7722, • • • 5 ^/x be a list of hypernumbers. Two hypernumbers a and b will be said to be congruent mod [mi, m2, ..., ruk], denoted by a = 6 mod [mi, m2, . . . , rn^], if they can be m a d e equal by adding sums of multiples (with multipliers t h a t are hypernumbers) of m i , m2, . . . , m ^ t o each. This is a simple generalization of Gauss's definition of a = 6 mod m, which means t h a t a and b can be made equal by adding multiples of m to each. (This form of the definition eliminates the need for negative numbers in the discussion of congruences.) A m o d u l e is a list of hypernumbers [mi, m2, . . . , m^] written between square brackets to indicate t h a t they are to be used to define a congruence relation in this way. Two modules are e q u a l if they define the same congruence relation. Essay 3.2 gives all these definitions, along with an algorithm for determining whether two given modules are equal. W h e n the product of two lists is defined to be the list t h a t contains all products with one t e r m from the first list and one from the second, the module determined by the product depends only on the modules determined by the factors, so the operation gives a way to multiply modules. Since t h e multiplication defined in this way is clearly associative and commutative, the modules for a given A form a commutative semigroup in which the module [1] is an identity. One more level of abstraction is needed for t h e most interesting construction. Let a module be called p r i n c i p a l if it can be represented by a list [y + x^/A] with just one hypernumber and if, in addition, t h a t hypernumber satisfies y'^ > Ax'^. T h e principal modules are a subsemigroup of the semigroup of modules—which means simply t h a t a product of principal modules is principal—so there is an associated quotient structure: Two modules are e q u i v a l e n t if they can be m a d e equal by multiplying each by a principal module. (That is. M i ~ M2 means there are principal modules Pi and P2 for which Mi Pi — M2P2') T h e equivalence classes of modules for a given A defined in this way form a finite semigroup, which I call the class s e m i g r o u p . It can be determined for each given A by algorithms described in Essay 3.3. These algorithms are essentially the same as Gauss's methods in Section 5 of the Disquisitiones for determining the equivalence classes of binary quadratic forms for a given "determinant" A^ but in my opinion they are simpler in conception. Some rudimentary facts about class semigroups are proved in Essay 3.4 t h a t are then used in Essay 3.5 to prove the law of quadratic reciprocity. The final two essays of P a r t 3 relate the multiplication of modules to Gauss's composition of binary quadratic forms by showing how, given two
Synopsis
xvii
binary quadratic forms, the theory of multiphcation of modules can be used to determine whether there is a third binary quadratic form that composes them in Gauss's sense, and, if so, to find all such compositions. Once this connection is clearly made, it seems to me that the module-and-multiplication formulation will have more appeal than the form-and-composition formulation. But whether or not the module-and-multiplication version is preferred over Gauss's, it has the advantage of relating directly to Gauss's, thereby making Gauss's masterpiece more accessible to modern readers whose familiarity with Dirichlet's simplification of it may, for reasons explained in Essay 3.6, be an impediment. Part 4, on the genus of an algebraic curve, is inspired by Abel's great memoir of 1826 (first published, thanks to the negligence of the Paris Academy, in 1841). The inspiration for the algorithmic method of Part 4 goes back even further, to Newton's method of constructing infinite series expansions of algebraic functions, commonly known today as "Newton's polygon." The construction used in Part 4 (see Essay 4.1) to describe the genus of a curve is based on ideas of Abel that predate the theory of Riemann surfaces by many years, and it makes no reference to complex numbers, much less to Riemann surfaces. Let an algebraic curve xi^^v) — 0 be given (where x is an irreducible polynomial with integer coefficients that contains both x and y and, for simplicity, is monic in y), and let a large number N of points on the curve also be given. Choose a rational function 0 on the curve with many zeros (it will have equally many poles, of course) including zeros at all of the N given points. An algebraic variation of the N points is a variation of the N points that can be achieved as a variation of the N special zeros of the rational function 0 when the coeflicients of 9 are varied in such a way that the remaining zeros and all of the poles remain unchanged. (It is assumed that the N given zeros are points where x is finite, and the poles are specifically taken to be the poles of x^ for some large z/, but in fact any set of poles will do, as long as there are enough of them, and the zeros can also be at points where x is infinite.) The N zeros then vary with N — g degrees of freedom, where the number ^, the genus of the curve, depends only on the curve, not on the other choices. To make this rough idea of the genus of x(^, ^) = 0 into a definition requires, of course, that much more be said. Although the natural first step might seem to be the introduction of complex numbers in order to deal rigorously with the zeros and poles of ^ on x(x, 2/) = 0, the approach taken in Part 4 is quite the opposite: It dispenses with the notion of zeros and poles altogether. Just as the degree of a polynomial determines the number of its roots, general conditions on rational functions 6 can be related heuristically to the notions of zeros and poles of 9 on the curve xi^^v) — 0 ^^d their locations. On this basis, one can give a satisfactory description of rational functions 9 on x{x,y) = 0 with prescribed poles of prescribed multiplicity, all in terms of "general arithmetic"—the arithmetic of polynomials with integer coefficients.
xviii
Synopsis
Then Abel's description of the genus can be given sohd, constructive meaning in terms of the number of free coefficients in 0 when conditions are placed on its zeros and poles, a description that uses nothing but general arithmetic. Essay 4.2 relates Abel's construction to Euler's addition formula for elliptic curves and to the geometric description of addition on an elliptic curve that is so familiar in the present time of great interest in elliptic curves. Essay 4.3 gives the details of the definition of the genus of x(x, ^) = 0 in these terms. Essay 4.4 is an exposition of the Newton algorithm. The task of the algorithm is to construct a solution y oi xi^iV) — 0 ^s an infinite series of (possibly) fractional powers of x. In constructive mathematics an infinite series must of course be presented as an algorithm that generates the successive terms of the series, and this is what the Newton algorithm does. More precisely, the input to the algorithm is a truncated series solution 7/ of x(^, ?/) = 0 and the algorithm generates one further term of the series. In the early stages, a truncated solution may be ambiguous, meaning that it may be extended in more than one way, and the algorithm must determine all possible extensions; eventually, as is proved in the essay, a set of unambiguous truncated solutions is reached, each of which is prolonged by the algorithm with the addition of one more term in just one way and therefore represents an infinite series solution. (Note that convergence is not an issue, because the series itself—not any kind of limit of the series—is the objective.) Essay 4.5 gives an algebraic method of evaluating the genus as it was defined in Essay 4.3. Essay 4.6 gives a simpler description of the genus as the dimension of the vector space of holomorphic differentials on the curve. These differentials are the ones that have no poles, and they have the property that the algebraic variations of a set of A^ points on the curve are described by the differential equations N
^hj{xi,yi)dxi
= 0
for j = 1, 2, . . . , ^,
where the differentials hj{x,y)dx are a basis of the space of holomorphic differentials. Essay 4.7 uses the holomorphic differentials on a curve to state and prove the Riemann-Roch theorem as a formula for the number of arbitrary constants in a rational function with given poles. The last essay of Part 4 proves that the genus is a birational invariant, even though the method of Essay 4.5 for computing it depends on the choice of a parameter x on the curve. This important result can be stated as follows: In the terminology of Essay 2.2, the field of rational functions on an algebraic curve is an algebraic field of transcendence degree one. The genus as it is defined above depends only on this field itself, not on the particular presentation of it as a root field that is used in the definition. This conclusion is established, in essence, by showing that if x and z are different parameters on the curve then hdx is Si holomorphic differential (relative to the parameter x)
Synopsis
xix
if and only ii h • ^ - dz is a, holomorphic differential (relative to the parameter z)^ so the spaces of holomorphic differentials in the two cases are isomorphic. The miscellany of Part 5 begins with a proof of what is called the Fundamental Theorem of Algebra—in fact two proofs of it. But my main point in that essay is that this theorem is not truly a theorem of algebra at all because it relates in an essential way to the nonalgebraic notion of complex numbers. The next essay gives a proof of the Sylow theorems in the theory of finite groups, and the following two summarize the constructive and algorithmic approach of my 1995 book on linear algebra. My hope is that Linear Algebra and the present book will reinforce one another—this book making the case for the clarifying power of algorithmic methods and Linear Algebra giving yet another example of that power. The final essay is a further correction to the Kronecker legend.
A Fundamental Theorem
Essay 1.1 General Arithmetic La derniere chose qu^on trouve en faisant un ouvrage c^est de savoir celle qu^il fallait mettre la premiere. (The last thing one discovers in composing a work is what should be put first.)—Pascal, Pensees Kronecker quoted this saying of Pascal in the first of a series of lectures he gave on the concept of number.* It may have been a somewhat rueful reflection on his own experience with his 1881 treatise Grundzilge einer arithmetischen Theorie der algebraischert Grossen (Elements of an Arithmetical Theory of Algebraic Quantities) [39], which contains at least two indications that he altered his point of view profoundly while writing it, deciding ultimately that the subject of his title was not the one he should be dealing with at all. In his introduction to the treatise and in point IV of its last section he speaks of reducing the entire theory of "algebraic quantities" to the theory of rational functions of variables. In later works he did just that. For example, in Ein Fundamentalsatz der allgemeinen Arithmetik [42] and Uber den Zahlbegriff [43], both published in 1887, he emphasized the importance of rational computation with polynomials with integer coefficients and again stated that theories of algebraic numbers and algebraic quantities could be reduced to such rational computations. Thus, whether or not it was the last thing he discovered in writing his 1881 treatise, Kronecker came to believe that he should have begun with rational algebra. That is where these essays begin. Elsewhere Kronecker said, "In mathematics, I recognize true scientific value only in concrete mathematical truths, or, to put it more pointedly, only in mathematical formulas" (see [21]). I would rather say "computations" than "formulas," but my view is essentially the same. Computation, in turn, is an outgrowth of counting, and in this sense mathematics is founded on numbers, * These lectures, given in the last year of Kronecker's life, 1891, are preserved in the form of a handwritten transcript in the archives of the mathematics library of the University of Strasbourg, and were recently published [45].
1 A Fundamental Theorem
Fig. 1.1. Kronecker. not as abstract "objects" of any kind, but as the system of symbols by which we record the results of counts. We learn to use and understand the symbols 0, 1, 2, 3, . . . at an early age, and most of us understand fairly soon that the important thing is not the actual names or symbols that are used, or even the decimal system on which they are based, but the mere fact that there are agreed-upon symbols and names and an agreed-upon system for counting. In this essay, the word "number" will mean a number 0, 1, 2, . . . in this most basic sense. The more sophisticated computations that we learn later in life grow out of counting. First, the operations of addition and multiplication are grounded in counting. (Counting first to a then to b is the same as counting to a -\- b. Counting a times to b is the same as counting to ab.) Subtraction—the inverse of addition—of course makes sense only when the number being subtracted is not larger than the one from which it is to be subtracted. However, experience teaches us to widen our horizon in such a way that this limitation on subtraction can be put in the background and for the most part ignored. This can be done very conveniently in the way Kronecker does it in the essay Uber den Zahlbegriff {On the Concept of Number), mentioned above. He first introduces ''''Buchstabenrechnung,''^ calculation with letters, in the following way: "The same laws [that govern the addition and multiplication of numbers] needed to be regarded as valid for calculation with letters as soon as letters began to be used to represent numbers whose determination might or
Essay 1.1 General Arithmetic
3
should be postponed. W i t h the introduction of the principle of computing with indeterminates as such, which originated with Gauss, the special theory of whole numbers broadened into the general arithmetical theory of polynomials with whole number coefficients."* In particular, we can compute with—add and multiply—polynomials in a single indeterminate t whose coefficients are numbers. W h e n we use Gauss's notation f{t) = g{t) mod ( t + 1 ) to mean t h a t f{t) can be transformed into g{t) using the identity t + 1 ^ 0 mod (t + 1 ) , we then have a system of computation in which t plays the role of —1. This system of computation is what we mean by the ring of integers. In modern notation, these observations can be abbreviated Z = N[t] mod ( t + 1 ) , meaning t h a t an element of Z—an integer—is represented by an expression of t h e form aof^ + ait'^~^ + • • • + a^, where N denotes the set of numbers { 0 , 1 , 2 , . . . } , where t is an indeterminate, and where n, ao, a i , . . . , a^ are numbers. Two such representations by definition represent the same element of Z if one can be transformed into the other using t-\-l = 0 mod (^+1) in conjunction with the usual laws t h a t govern addition and multiplication of numbers. Since t^ = t2 + (t-f 1) =t'^-\-t-\-l =t{t-hl)-hl = 1 mod ( t + 1 ) , we can always replace t^ with 1. Therefore, we can replace t^ with t, t^ with t^ and then with 1, and so forth, t o represent any integer by an expression of the form at -\- 6, where a and b are numbers. Two such expressions represent t h e same integer, t h a t is, at-\-b = ct-{-d mod (t + 1), if and only if at + 6-f a + c = ct + d-\-a-\-c mod (t + 1), which is t o say b-{-c = d-\-a mod (t + 1). Since this congruence does not involve t, it is equivalent to the equation b -\- c — d -\- a. In short, the simple device of computation with polynomials in t mod t + 1 is all t h a t is needed to describe the usual construction of t h e ring of integers as ordered pairs of numbers (a, b) subject t o t h e equivalence relation "(a, b) = (c, d) means a-\- d = b^ c^^ when equivalence classes are added and multiplied in the obvious ways. As Kronecker observes, the interpretation of t h e equation 7 — 9 = 3 — 5 truly involves this new meaning of the equal sign. In essence, the device of using integers instead of numbers makes it possible to do computations without bothering about whether particular subtractions are possible unless a reason arises to examine t h a t issue. Similarly, it makes possible writing all terms of an equation on one side of the equal sign, which greatly simplifies reasoning by eliminating the need to consider separately cases in which the terms would appear on different sides of t h e equation if numbers were used instead of integers. * Dieselben Gesetze mussten flir die sogenannte Buchstabenrechnung als maassgebend angenommen werden, sobald man anfing, die Buchstaben zur Bezeichnung von Zahlen zu verwenden, deren Bestimmung vorbehalten bleiben kann oder soil. Aber mit der principiellen Einfiihrung der "Unbestimmten" (indeterminatae), welche von Gauss herriihrt, hat sich die specielle Theorie der ganzen Zahlen zu der allgemeinen arithmetischen Theorie der ganzen ganzzahligen Functionen von Unbestimmten erweitert.
4
1 A Fundamental Theorem
T h e fourth rational operation, division, is t h e most interesting one. The division of numbers naturally takes t h e form of division with remainder: Two numbers a and b with b ^ 0 determine numbers q and r by the conditions a = qb -\- r and r < b. This operation is of course very closely connected to t h e original meaning of Gauss's congruence concept a = r mod b. In t h e more general setting of Buchstabenrechnung—computing with polynomials in several indeterminates whose coefficients are numbers—the notion of divisibility has a clear meaning, but t h e more useful concept of division with remainder does not. An exception is t h e case of division by a polynomial with integer coefficients t h a t is monic in one of its indeterminates, meaning t h a t b = x'^ -\- terms of degree less t h a n n in x. In this case, for any polynomial a with integer coefficients, there are unique polynomials q and r with integer coefficients for which a — qb-\-r and for which the degree of r in x is less t h a n t h e degree n of 6 in x. Another role played by division in elementary arithmetic is the cancellation law of multiplication: If ab = ac and a ^ 0, t h e n b = c. This law is obviously valid for numbers—even for integers. Its validity in other contexts, when equality is replaced by some kind of congruence, is often a crucial issue. W h e n it is valid, the ring of congruences classes under addition and multiplication is an i n t e g r a l d o m a i n . For an integral domain one can construct a field of quotients^ t h e set of all formal quotients p/q in which ^ 7^ 0, when p/q = p' /q' is defined to mean pq' = p'q and when addition and multiplication are defined by (p/q) + {p'/q') = {pq' -^ p'q)/qq' and (p/q) • {p'/q') = pp'/qq'. However, for the most p a r t fields of quotients themselves—for example, the field of rational numbers—will be avoided. T h e potential of one, the ability to compute with formal quotients of elements of an integral domain, is enough. Toward the end of his life, Kronecker adopted the t e r m "general arithmetic" {allgemeine Arithmetik) for t h e arithmetic of rings of the form Z[ci, C2, . . . , Cj/], which is to say rings of polynomials in some set of indeterminates ci, C2, . . . , Cjy with integer coefficients (or, in conformity with the approach above, rings N[t, ci, C2, . . . , Cjy] mod {t + 1), where N denotes the set of numbers). Of course there is little to be said about these rings themselves; rather, the substance of general arithmetic lies in the study of certain further constructions t h a t use t h e m . Kronecker wrote a number of papers about what he called m o d u l e s y s t e m s , and he formulated his proof of his Fundamentalsatz of general arithmetic in terms of module systems. For me, however, his module systems pose difficulties. For one thing, a module system in its simplest form—namely, a ring of the form Z[ci, C2, . . . , c^,] mod [Mi, M2, . . . , M ^ ] , a polynomial ring in which computations are done modulo a finite number of given relations Mi = 0—is not normally a field because division is not normally possible. Therefore, one needs to enlarge the realm of objects with which one computes in some way in order t o allow the computations to use t h e most convenient and n a t u r a l representations of them—for example to allow t h e use of cj = y ~
Essay 1.1 General Arithmetic
5
in computations with ^ / ^ . For another thing, this description Z[ci, C2, . . . , Cjy] mod [Ml, M2, . . . , M^] of module systems opens t h e door to t h e problem of determining whether two such module systems are isomorphic, which is t a n t a m o u n t to t h e "ideal membership problem" for rings of t h e form Z[ci, C2, . . . , Cjy], a problem t h a t poses serious difficulties* from a constructive point of view. For these reasons, I have avoided module systems^ and have instead used t h e concrete notion of a simple algebraic extension of the field of quotients of a ring Z[ci, C2, . . . , Cj^]; such simple algebraic extensions are described and given the n a m e "root fields" in Essay 1.3. As will be shown in Essay 2.2— using an argument Kronecker himself gave [39, §2]—fields of this type provide a setting for all algebraic computations.
* Much serious work has been done on the ideal membership problem and the related problem of constructing Grobner bases, but since I have not been able to understand this work in a way that is consistent with my notions of constructivity, I am glad that it is unnecessary for the topics I develop here. ' Specific module systems in which the problems mentioned above do not arise are used in some of the constructions—for example in Essays 1.5 and 2.4.
6
1 A Fundamental Theorem
Essay 1.2 A F u n d a m e n t a l Theorem Proposition V. Probleme. Dans quel cas une equation est-elle soluble par de simples radicaux? (Proposition V. Problem. In what case is an equation solvable by simple radicals?—E. Galois, [27] T h e essays t h a t follow contain applications of general arithmetic to a variety of topics, one of which is the theorem Kronecker stated and proved in his 1887 paper Ein Fundamentalsatz der allgemeinen Arithmetik (On a Fundamental Theorem of General Arithmetic) [42]. This theorem states, roughly, t h a t every polynomial has a splitting field. Proposition 1 of Book 1 of Euclid's Elements [25] is, in the Heath translation, "On a given finite straight line to construct an equilateral triangle." To modern ears, this seems a strange way to state a proposition. A modern writer would be more likely t o say, "Given a finite straight line, there is an equilateral triangle of which it is one of the sides." But Euclid has many such propositions. His propositions fall into two categories, often described as "problems" and "theorems." T h a t Proposition 1 is a "problem" is signaled not only by the form of its statement but also by the fact t h a t its proof ends with "as was to be done" r a t h e r t h a n "as was to be proved." Gauss on at least one occasion* concludes a proof with Q E F ("quod erat faciendum"—that which was to be done) instead of Q E D ("quod erat d e m o n s t r a n d u m " — t h a t which was to be demonstrated), and Galois in his treatise [27] on the algebraic solution of equations presents eight "propositions," five of which are "theorems," two of which are "problems," and one of which is a "lemma," b u t today the designation "problem" has disappeared from formal mathematical exposition, and the designation "proposition" has become more or less synonymous with "theorem." T h e usual definition of "constructive mathematics" is t h a t it requires existence theorems to be proved constructively—that is, constructive mathematics does not accept as a proof of existence an argument t h a t assumes a disproof of existence and derives a contradiction. But the very notion of an "existence theorem" reflects a nonconstructive bias. Is it not ridiculous to say, "Every polynomial has a splitting field," and then to stipulate t h a t "The proof will give an actual construction of a splitting field" ? Is it not more reasonable to follow the Euclidean model and say "Given a polynomial, construct a splitting field for it," thereby making clear t h a t the proof is a construction? In these essays I do follow the Euclidean model, except t h a t I have decided to use the word "theorem" for b o t h types of Euclidean "propositions." Mathematicians today regard "theorems" as the fundamental units of mathematics. Kronecker used t h e t e r m Fundamentals atz even though his theorem was in t r u t h a construction. I doubt t h a t an effort to give another term like "problem" or "construction" the same s t a t u s as "theorem" would succeed. And a See §73 of Disquisitiones Arithmeticae. The notation QEF at the end of §73 was omitted from the German translation by Maser.
Essay 1.2 A Fundamental Theorem
7
"fundamental problem" or a "fundamental construction" would be much less imposing t h a n a "fundamental theorem." Thus, these essays, although they will not contain "existence theorems," will contain many theorems t h a t are constructions, including the theorem of this essay. Gauss's doctoral dissertation of 1799 was devoted to a proof of a theorem very close t o what is now called t h e "fundamental theorem of algebra": A polynomial of degree n has n complex roots when they are counted with multiplicities. In the dissertation he sharply criticizes earlier a t t e m p t s to prove the theorem, saying t h a t they used computations with the roots and t h a t such computations virtually assumed t h e t r u t h of the theorem to be proved. However, as Bashmakova and Rudakov point out in an essay on the history of t h e theorem [35], Gauss returned to t h e theorem in 1815 and gave a new proof t h a t took an approach very similar to t h e one he had criticized in 1799; he justified on other grounds certain limited computations with t h e roots of the given polynomial, and t h e n used such computations to show t h a t t h e roots could be described as complex numbers. (For this second proof, see Essay 5.1.) Kronecker, with his Fundamentalsatz, came to t h e realization t h a t this is the theorem: what is important is not t h e complex numbers b u t , rather, the fact t h a t computations with t h e roots can be justified. T h a t is, given a polynomial with integer coefficients, one can describe a system of computation that extends computations with integers in such a way that the polynomial has a number of roots equal to its degree. In a pragmatic sense, Galois had realized the same thing more t h a n fifty years earlier. Lemma III of his treatise on the algebraic solution of equations [27], which was written in 1830-1831 even though it was not published until 1846, is in essence a construction of a splitting field for a given polynomial. Unfortunately, Galois does not prove L e m m a III. He does give a construction of a splitting field, b u t the construction uses computations with t h e roots! Thus, from a foundational point of view, what Galois proved was t h a t if there is any vaHd way to compute with t h e roots of a polynomial, then computations with the roots can always be done using what is now called a Galois resolvent, as in his L e m m a III. Until computations with the roots were validated— until Kronecker's Fundamentalsatz was proved—Galois theory was without a general foundation, even though splitting fields could be constructed in specific cases. For example, in t h e case of t h e polynomial x^ — 2, t h e polynomial y^ -\-10S is a Galois resolvent, which is to say t h a t computations in Q[y] mod (y^-^lOS) extend computations in the field of rational numbers Q in such a way t h a t x^ — 2 factors into linear factors, as is shown by t h e formula
(1) .3 _ 2 . f. - ?; V . + y^^) i8y V 36
(. + y^±^) mod ( / + 108). yV 36 ,
P u t t i n g aside for the moment t h e question of how such a formula might be constructed, one can easily check t h a t it is correct; t h e product of the last two factors is ^{{36x + y^)'^ - 324y'^) = 3^(36^x2 _^ ^2xy^ + y'^{-10S) -
8
1 A Fundamental Theorem
32%^) = x'^ -\- f^y^ — ^y'^ mod {y^ + 108), and multiplication of this result by the first factor gives x^ + ^y^ - ^y^ - f^/ - ^ | / 2 ( - 1 0 8 ) + ^ ( - 1 0 8 ) = x^ — 2 mod (2/^ + 108). Otherwise stated, the formula proves that adjunction to the field Q of a root ?/ of i/^ + 108 = 0 gives a field over which x"^ — 2 splits into linear factors. Kronecker states the more general version
(^) ^- - ( - C) h ^ ) ( - ' ^ ) ° - (»' - -^) of this formula in his Fundamentalsatz paper [42, end of §2]. This version, too, is easy to check even if it is not easy to guess. It proves that adjunction to the field of rational functions in c of a root y oi y^ -i- Tic? gives a field over which x^ — c splits into linear factors. The general case is developed and proved in the next few essays in the form of the following theorem: F u n d a m e n t a l T h e o r e m . Given a polynomial f in x with integer coefficients, construct a polynomial g in y with integer coefficients that is irreducible, monic in y, and has the property that a formula of the form (3)
fix) = aoY[(^x-
^
)
mod g{y)
holds, in which the (j)i{y) are polynomials whose coefficients are integers, the ipi are nonzero integers, and ao is the leading coefficient of f. More generally. Given a polynomial f in x, ci, C2, ..., Cj^ with integer coefficients, construct a polynomial g in y, c\, C2, ..., Ci, with integer coefficients that is irreducible, monic in y, and gives rise to a formula (3), in which the (j)i{y) are now polynomials in y, ci, C2, • - -, Cy with integer coefficients, the ipi are nonzero polynomials inci, C2, '.', Cjy with integer coefficients, and QQ is the leading coefficient of f as a polynomial in x. To say that g{y) is monic in y means that g has the form y^-\ where the omitted terms all have degree less than n in y. As will be seen in Essay 1.3, this assumption simplifies computations mod g{y). The requirement that g be irreducible guarantees that Z[^, ci, C2, . . . , c^^] mod g{y, ci, C2, . •., c^^) (where ly may be zero) will be an integral domain. In modern parlance, the field of quotients of this integral domain is a splitting field of / as a polynomial with coefficients in the field of rational functions in ci, C2, . . . , c^^. It is obtained by adjoining a root y of g to this field of rational functions. A familiar example of a splitting of this sort, put in an unfamiliar way, is
.2 , .^ , . - J ^ ax -\-bx^c = a[x
-b^y\
(^ J Ix
-b-y
) mod {y — b + 4ac).
Essay 1.2 A Fundamental Theorem
9
Here use is made of the fact that y is a, square root of b'^—Aac mod (|/^—6^+4ac) to express the roots of the quadratic polynomial ax^ + 6x + c in the form {—b ± y)/2a. The stated congruence is easily verified by rewriting the right side as -^{2ax + b-y){2ax-hb^y) = ^(4a^x^+4a6x + 6^-2/^) = ^(4a^x^ + Aabx + 4ac) mod (y^ — 6^ + 4ac). Another example that is considerably less simple to verify is ly^ + 2207/^ - 1846?/^ + 9Q03i/\ 18966 ) ly^ + 220^^ - 1846i/^ + 9003^ \ ^"^ 18966 ) { _ ly^ + 220|/^ - 1846^^ - 9963i/\ V 2•18966 J 7y^ + 220^^ - 1846^/^ - 9963y\ ^^ 2 • 18966 )
x"^ — x^ — 1 = I X
mod (2/^ - lOi/^ + 47i/^ - 110^^ + 841). (See Example 1 of Essay 2.3.)
10
1 A Fundamental Theorem
Essay 1.3 Root Fields (Simple Algebraic Extensions) In brief, one adjoins a root y of g{y) by computing with expressions of the form p{y)/q, where p{y) is a polynomial in y and q is nonzero; addition and multiplication are performed in the obvious ways, while division is accomplished by "rationalizing t h e denominator." Here the given polynomial g{y) is assumed t o be an irreducible polynomial with integer coefficients—or, more generally, with coefficients in t h e ring Z[ci, C2, • . • , Cjy ] of polynomials with integer coefficients in some given set ci, C2, . . . , Cjy of indeterminates—that is monic in y. T h e advantage of assuming t h a t g{y) is monic in y is t h a t it means t h a t division with remainder can be used t o find, for any polynomial in y^ another polynomial congruent to it mod g{y) whose degree is less t h a n n — degg. Since a polynomial of degree less t h a n n = degg can be divisible by g{y) only if it is zero, it follows t h a t every polynomial in y with coefficients in Z[ci, C2, .. •, c^] is congruent mod g{y) to one and only one such polynomial whose degree in y is less than n. Thus, the ring Z[7/, ci, C2, . . . , c^] mod g{y) can be described as the elements of Z[^, ci, C2, . . . , Cjy] whose degrees are less t h a n n = deg^f, added in t h e usual way and multiplied by ordinary multiplication of polynomials followed by division with remainder by g{y) to find a polynomial congruent to the product mod g{y) whose degree in y is less t h a n n. T h e advantage of the assumption t h a t g{y) is irreducible is t h a t it implies—as will be proved in t h e next essay—that the ring Z[^,Ci, C2, . . . , Cjy] mod g{y) defined in this way is an integral domain. Therefore, as described in Essay 1.1, there is an associated field of quotients. It is this field of quotients of the integral domain Z[?/, ci, C2, . . . , Cj^] mod g{y) t h a t I will call the r o o t field of g{y). Another way to describe it is as the s i m p l e a l g e b r a i c e x t e n s i o n of the field of rational functions* in ci, C2, . . . , Cjy obtained by adjoining a root of g{y). An element of the root field is represented in the first instance by a quotient of elements of Z[?/, ci, C2, . . . , c^y] in which the denominator is not zero mod g{y). Since computations are all t o be done mod g{y)j one can assume without loss of generality t h a t b o t h numerator and denominator have degree less t h a n t h e degree n of g{y). Moreover, one can assume without loss of generality t h a t the denominator does not contain y by virtue of the following lemma: L e m m a ( B a s i c e l i m i n a t i o n ) . Given polynomials g{y) and q{y) in y with coefficients in Z[ci, C2, • .., Cy] such that g{y) is irreducible and monic in y and q{y) is nonzero mod g{y), construct polynomials r{y) and s{y) such that r{y)q{y) + s{y)g{y) is nonzero and does not contain y. * The "field of rational functions" in ci, C2, . . . , c^^ is simply the field of quotients of the integral domain Z[ci, C2, . . . , Cu]- Note that the word 'function' is not being used in its modern sense here, because p/q has no 'value' at roots of q. When i/ = 0, the ring is just the ring of integers Z and the field is just the field of rational numbers Q.
Essay 1.3 Root Fields (Simple Algebraic Extensions)
11
Proof. Let n be t h e degree of g{y) and k t h e degree of q{y). Consider t h e polynomials in y with coefficients in Z[ci, C2, . . . , c^] of t h e form r{y)q{y) + s{y)g{y)^ where d e g r < n and degs < k. These polynomials have degree less t h a n n-\-k, so they are described by their n + k coefficients, which depend linearly on t h e n coefficients of r a n d t h e k coefficients of s. Thus, the dependence is described by an {n -\- k) x (n + k) matrix of elements of Z[ci, C2, . . . , Cjy]. If t h e determinant of this m a t r i x were zero, there would be nonzero polynomials r{y) and s{y) with coefficients in Z[ci, C2, . . . , c^] for which r{y)q{y) + s{y)g{y) = 0, which is impossible because it would imply t h a t r{y)q{y) was a product divisible by g{y) in which neither factor was divisible by g{y) {q{y) ^ 0 mod g{y) by assumption, and r{y) ^ 0 m o d g{y) because r{y) ^ 0 and d e g r < d e g ^ ) , contrary t o t h e fact t h a t for polynomials with coefficients inZ[y^ci, C2, . . . ; Cy], irreducible polynomials are prime (see Essay 1.4). Therefore, t h e determinant is nonzero, which implies t h a t t h e system ofn-\-k — l equations in n -\- k unknowns t h a t express t h e condition 'r{y)q{y) + s{y)g{y) does not contain i/' has a nontrivial solution—i.e., a solution other t h a n t h e solution r{y) = s{y) = 0. (In fact, it has t h e explicit nontrivial solution in which t h e coefficients of r and s are D i , —D2^ D^, —i^4, ( _ l ) r i + / c - i ^ ^ ^ ^ where Di is t h e determinant of t h e {n-\-k — l) x {n-\-k — l) matrix obtained by omitting t h e ith. column of its (n + /c — 1) x (n-\- k) matrix of coefficients.) As has already been shown, for such a nontrivial solution r{y)q{y) + s{y)g{y) ^ 0. Thus, given an element of t h e root field of g{y) represented by ^py, t h e same element of t h e root field is represented by r{y)p{y)
^
r{y)p{y)
r{y)q{y)
~ r{y)q{y)
^
+ s{y)g{y)
r{y)p{y) t
where the denominator t does not contain y. In short, every element of t h e root field oi g{y) can be represented by a quotient in which t h e denominator is independent of y. Since t h e numerator can be reduced m o d g{y) and common factors in numerator and denominator can be canceled, it follows t h a t an element of the root field of g{y) has a representation in the form Piy""-^ -^ P2y''~^ -^ • "-\-Pn
where Pi, P2, • • •; Pn, q ^^^ elements of TA\C\, C2, ..., Cj^], where q j ^ 0, and where no divisor of q other than ±1 divides all of pi, p2, • •, Pn- Each field element has exactly two such representations, one obtained from t h e other by reversing t h e signs of numerator a n d denominator. This m e t h o d of representing elements of t h e root field of g{y), together with t h e fact t h a t it is t h e field of quotients of Z[?/, ci, C2, . . . , c^,] m o d g{y)^ describes completely how computations in t h a t field are t o be done.
12
1 A Fundamental Theorem
Example: One learns in school how to compute with expressions 9d^^^ where a, 6, and c are integers and c 7^ 0. In other words, one learns about the root field of 2/2 - 3.
Essay 1.4 Factorization of Polynomials with Integer Coefficients
13
Essay 1.4 Factorization of Polynomials with Integer Coefficients When you can settle a question by explicit with purely existential arguments.—Hermann
construction, Weyl [55]
be not
satisfied
T h e naive construction of a splitting field for a given polynomial is simple. Given a polynomial / with coefficients in a field K^ let it be factored into its irreducible factors over K. If these factors are all linear, K is a splitting field for / . Otherwise, let / i be one of the irreducible factors whose degree is greater t h a n 1, and let Ki be the field K[y] mod fi{y). (The irreducibility o f / i over K implies t h a t K[y] mod fi{y) is a field, because, as in the last essay, if p{x) ^ 0 has degree less t h a n the degree of / i ( x ) , then r{x)p{x) -\-s{x)fi{x) — 0 has no nontrivial solution in which d e g r < d e g / i and d e g s < d e g p , which implies t h a t the problem "r(x)p(x) + s{x)fi{x) does not contain x'' has a nonzero solution.) T h e n Ki contains K^ so every root of / in ii^ is also in Ki, which is to say t h a t / has a least as many linear factors over K as it does over Ki. In fact, it must have at least one more linear factor over K i , because Ki contains at least one root of / i , and K contains none. Thus, there are more linear factors of / as a polynomial with coefficients in Ki t h a n there were linear factors of / as a polynomial with coefficients in iC. If Ki is not a splitting field for / , the process can be repeated to find another field K2 over which / has more linear factors t h a n it does over Ki. Since / has at most deg / linear factors over any field, repetition of this process terminates after at most deg / steps with a field in which / splits into linear factors. The problem with this "construction" occurs at the first step. How can one accomplish the factorization of a polynomial with coefficients in a given field into irreducible factors? T h e answer must of course depend on t h e field of coefficients. If it is a finite field, t h e list of possible factors is finite, so they can all be tried, b u t for an infinite field, even for the field of rational numbers, t h e problem is more subtle. Kronecker presents an algorithm for factoring polynomials with integer coefficients early in his Grundziige einer arithmetischen Theorie der algebraischen Grossen. (See also [40].) It is, in essence, t h e one used in t h e proof of t h e following theorem. T h e o r e m 1. Given a nonzero polynomial with integer coefficients, list its divisors.
(in any number of
indeterminates)
Proof. Consider first t h e case in which t h e given polynomial contains no indeterminates, which is t o say t h a t it is a nonzero integer, call it a. A divisor of a is a nonzero integer, and its absolute value is at most \a\. Therefore, a list of divisors of a can be found by listing t h e 2\a\ nonzero integers whose absolute values are at most |a|, and striking those t h a t do not divide a. Consider next the case in which the given polynomial contains just one indeterminate, say it is f{x) = aox'^ + aix'^"^ + • • • -h a^, where x is t h e indeterminate and ao, a i , . . . , a^, n are integers with ao ^ 0 and n > 0.
14
1 A Fundamental Theorem
Choose* n -\- 1 distinct integers ro, r i , . . . , r^ for which / ( r ^ ) / 0, and for each z = 0, 1, . . . , n let (/)^(x) be the''" polynomial of degree n with rational coefficients determined by the conditions (t>i{rj) = 0 for j ^ i and (t)i{ri) = 1. If ^(x) is a factor of / ( x ) , then its degree is at most n and its value agrees with the value of g{ri)
0 distinct roots a i , a2, .•-, o^m in that domain. Then n > 0 and g(y) = f{y + ai) defines a polynomial of degree n that has m distinct roots 0, Q;2 — Q^i, Q^3 — Q^i, • • • , o^m — «i- Because ^(0) = 0, g{y) = yh(y), where h{y) has degree n — 1. The m — 1 roots a2 — Q^i, Q^a — Q^i, • • • , o^m — o^i of g{y) other than zero are roots of h{y)^ because (ai — ai)h{ai — ai) — g{ai — a i ) = 0 and the first factor on the left is not zero. If a polynomial of degree n had n + 1 distinct roots, this construction would prove that n > 0 and would yield a polynomial of degree n — 1 with n distinct roots, which is impossible because it would imply an infinite sequence of polynomials of decreasing degrees. Corollary 1: Given a polynomial of degree n with integer coefficients, any set of 2n -\- 1 distinct integers contains at least n + 1 that are not roots of it. Corollary 2: Let f{x) be a polynomial with coefficients in an integral domain that has degree n and n distinct roots ai, a^, . . ., OLn in the integral domain. Then f{x) = a{x — ai){x — a2) • • • (x — an), where a is the leading coefficient of f{x). Deduction: The difference between / ( x ) and a(x — ai)(x — a2) •' - (x — an) is a polynomial of degree less than n that has n distinct roots, so it must be zero. ^ As was shown in the previous note, (/)i(x) must be a rational number times n ^ i ( ^ — rj). The rational multiplier is determined by the condition 0(ri) = 1 to be the reciprocal of the value of Y[ -^^(^ ~ ^j) when x = ri. ^ To test whether g(x) = CQX^ + cix^~^ + • - - + Cm divides a nonzero f{x) = aox'^ -\- aix^~^ -\- •' •-\-am determine whether n>m and co divides ao- If not, g{x) does not divide f{x). If so, replace f{x) with f{x) — ^x^~^g{x), a polynomial that has degree less than d e g / and that is divisible by g{x) if and only if the original f(x) was. If the new f{x) is zero, it is divisible by g{x). Otherwise, apply the same test to the new f{x).
Essay 1.4 Factorization of Polynomials with Integer Coefficients
15
polynomials in k indeterminates, witfi ao 7^ 0 and n > 0. Again choose n-\- 1 integers r^ for which / ( n ) 7^ 0 and again construct t h e polynomials (l)i{x) with rational coefficients t h a t are one at r^ and zero at all other r j . Construct t h e finite list of expressions of the form 61 ^ i (x) + &202(^) H H bn(l)n{x) in which bi is a divisor of f{ri). (Here / ( r ^ ) is a polynomial in k indeterminates with integer coefficients. By the inductive hypothesis, its divisors can be listed.) T h e required list of divisors is obtained by striking from this finite list t h e entries t h a t are not polynomials with integer coefficients and those t h a t do not divide f{x). A polynomial with integer coefficients is a u n i t if it is 1 or —1. T h e t r i v i a l divisors of a nonzero polynomial are the units and t h e polynomial itself times a unit. A nonzero polynomial is r e d u c i b l e if its list of divisors given by the theorem contains more t h a n the four trivial divisors, or, what is the same, if it can be written as a product of two polynomials, neither of which is a unit. A nonzero polynomial is i r r e d u c i b l e if it is not a unit and not reducible. Corollary. Given a nonzero polynomial with integer coefficients a unit, write it as a product of irreducible polynomials.
that is not
Deduction. Take t h e given polynomial as t h e initial input to the following algorithm: Input: A product of nonzero polynomials (with integer coefficients) none of t h e m units. Algorithm: If each input factor is of them the list of divisors given divisors—the algorithm terminates. Replace one reducible factor in the factor as a product of two factors,
irreducible—which is to say that for each by the theorem contains only the trivial Otherwise, at least one factor is reducible. input product with a representation of that neither of which is a unit.
If the algorithm terminates, it terminates with a representation of t h e original polynomial as a product of irreducible polynomials, as required. But it must t e r m i n a t e because t h e list of all divisors of t h e original polynomial is finite. A nonzero polynomial with integer coefficients is p r i m e if it is not a unit and if it divides a product of polynomials with integer coefficients only when it divides one of t h e factors. T h e o r e m 2.
Irreducible polynomials
with integer coefficients
are
prime.
W h e n there are no indeterminates in the polynomials, this is the proposition t h a t irreducible integers are prime. Euclid proved it using t h e following lemma:
16
1 A Fundamental Theorem
L e m m a ( T h e E u c l i d e a n * a l g o r i t h m ) . Given positive integers f and g, find integers (j) and t/j for which (j)f -\- ipg is positive and divides both f and g. Proof Let a sequence of pairs of numbers {fni9n) be defined by taking ( / i , ^i) to be (/, g) and taking ( / n + i , ^n+i) to be either {fn^Qn - fn) or (/^ - gn, gn), depending on whether fn ^ 9n or fn > gn > ^' W h e n ^^ = 0, the sequence terminates. A step t h a t changes fn changes it t o a positive value, so each fn is positive. Similarly, each g^ is nonnegative. A step reduces fn-^Qn^ either by fn or by gn- By the principle of infinite descent, therefore, t h e sequence must terminate. Let (c?, 0) be the terminal pair. T h e n d is positive. Since / n + i and gn-\-i are sums of multiples of fn and g^, b o t h entries of the terminal pair (d, 0) are sums of multiples of the initial pair (/, ^ ) . Thus, there are integers 0 and ip such t h a t d = (j)f -\- ipg. A common divisor of / n + i and gn+i is a common divisor of fn and gn^ so, since d divides b o t h entries of (d, 0), it divides both / and ^, which proves the lemma. ^ T h e proof of Theorem 2 for polynomials with indeterminates will use a lemma analogous to t h e one above: L e m m a ( T h e E u c l i d e a n * a l g o r i t h m for p o l y n o m i a l s ) . Given nonzero polynomials f and g in one indeterminate with coefficients in a field, construct polynomials (f) and i/j with coefficients in the same field for which (j)f + ij^g divides both f and g. Proof. Let a sequence of pairs of polynomials (fn.gn) be defined by taking ifi^gi) to be (/, g) and taking (Z^+i, ^n+i) to be the pair derived from {fn,9n) in the following way: If 0 < d e g / ^ < d e g ^ ^ , set i = deg^f^ — d e g / ^ and {fn+i,gn+i) = (/n, 9n " i^x^fn/fJ^), wlicrc /x is t h e leading coefficient of fn and u is the leading coefficient of gn- If d e g / n > d e g ^ ^ > 0, set ( / ^ + i , ^ n + i ) = {fn — l^x^9n/^i9n)^ whcrc i = degfn — deg^n and /i and v are the leading coefficients of fn and gn- T h e sequence terminates if fn or g^ is zero (that is, has degree —oo), which must occur eventually, because d e g / n + deg^n decreases with each step. Let d be the nonzero member of t h e terminal pair. Clearly c?, like all members of all pairs of t h e sequence, has t h e form (f)f -\-ijjg, where 0 and ijj are polynomials with coefficients in the field. T h e predecessor of (/^_^i,^^+i) in the sequence just constructed is either (/n+i,5'n+i + ra'/n+i//^) or (/n+1 + /ix'^fn+i/^^^n+i)- In b o t h cascs, every common divisor of fn-\-i and gn^i is a common divisor of fn and gn- Since d is a common divisor of the polynomials in the terminal pair, it is a common divisor of the polynomials in t h e initial pair (/, ^ ) , and the proof of the lemma is complete. * In essence, this is the algorithm Euclid used [25, Book 7, Propositions 1 and 2], although the formulation is entirely different. ^ For another version of this proof, see Essay 3.2. "•' It is "Euclidean" by virtue of the analogy with the previous case, not because Euclid considered anything of the kind.
Essay 1.4 Factorization of Polynomials with Integer Coefficients
17
Proof of Theorem 2. Let / , g^ and h be in the ring of polynomials Z[xi, X2, . . . , Xm] in m indeterminates with integer coefficients and let them satisfy (1) / is irreducible, (2) / divides gh, and (3) / does not divide g. It is to be shown that / must then divide h. When 777, = 0 the proof is the one that Euclid, in essence, gave [25, Book 7, Prop. 24]. In this case, / , g, and h are integers. Since changing the sign of / or g or h does not change (1), (2), (3), or the desired conclusion, / , ^, and h can be assumed to be nonnegative. Then / > 0 and ^^ > 0, because / is not zero by (1) and g is not zero by (3). The Euclidean algorithm provides a positive d = f -\-^g that divides both / and g. Since / is irreducible and d is positive, d = 1 or / . By (3), d ^^ f. Therefore (t)f ^ i^g ^ 1. Thus 0//^ + ipgh = h is divisible by / , as was to be shown, because / divides both terms on the left. Next consider the case of Theorem 2 in which / contains fewer than m indeterminates: A Special Case. An irreducible element of Z[xi^ X2^ • • •, Xm-i] is prime as an element of Z[xi, X2, • - -, Xm]Let / be an irreducible polynomial in xi, ^2, . . . , Xm-i with integer coefficients, and let g{x) and h{x) be polynomials in x, Xi, a;2, •. •, Xm-i with integer coefficients for which (2) and (3) hold. Then all coefficients oi g{x)h{x) are divisible by / , but at least one of the coefficients oi g{x) is not divisible by / . Let g{x) = a^x^ -\- aix^~^ + • • • + a^, where the a^ are polynomials in xi, X2, . . . , Xm-i: and let / be the least index for which aj is not divisible by / . If h{x) were not divisible by / , then, in the same way, when h{x) was written in the form h{x) = box^ -\- bix^~^ -}-••• -\- bt there would be a least index J for which bj was not divisible by / . Then the coefficient of x^^'^ in g{x)h{x) would be a lb J plus terms divisible by / (this coefficient is ajbj plus terms that are products in which one factor is divisible by / ) . But ajbj would not be divisible by / by the inductive hypothesis, so g{x)h{x) would not then be divisible by / , contrary to hypothesis. Therefore h{x) must be divisible by / , as was to be shown. The general case, in which / may contain x, can now be deduced from the case of TTI — 1 indeterminates as follows: The Euclidean algorithm gives equations d{x) = (t){x)f{x) -\- ip{x)g{x)^ f{x) — qi{x)d{x)^ g{x) = q2{x)d{x) where d^ 0, -0, gi, q2 are polynomials in x with coefficients in the field of rational functions in xi, X2, . . . , Xm-i- Let ^ be a common denominator of all five of these polynomials. (For example, 6 could be taken to be the product of all denominators of all coefficients of the five.) Then D{x) — 6 • d{x)^ ^{x) = 6 • 0(x), ^{x) = 6 • '0(x), Qi{x) = 6 ' qi{x), and Q2{x) = S • q2{x) all are in Z[x, Xi, X2, .. •, Xm-i] and they satisfy D{x) — ^{x)f{x) + ^{x)g{x)^ d'^ • f{x) = Qi{x)D{x) and 6'^ • g{x) = Q2{x)D{x). By the special case already proved, each irreducible factor e of S'^ divides either Qi{x) or D{x). Therefore, 6'^ ' f{x) = Qi{x)D{x) can be divided by each of the irreducible factors of 6'^ in succession to find f{x) = {Qi{x)/ei) • {D{x)/e2) where (5^ = 6162. By (1), D{x)/e2 must be ± 1 or ±f{x). By (3), D{x)/e2 7^ ±f{x). Therefore,
18
1 A Fundamental Theorem
D{x) = ±62, SO dze2h{x) = ^ ( x ) • f{x) ' h{x) + ^{x) • g{x) • h{x), which shows t h a t f{x) divides e2/i(x), say €2h{x) = Q3{x) • f{x). By the special case, each irreducible factor of 62 divides Qs{X)^ so f{x) divides /i(x), as was to be shown. T h u s Theorem 2 follows by induction. C o r o l l a r y 1 ( U n i q u e f a c t o r i z a t i o n of p o l y n o m i a l s w i t h i n t e g e r coeff i c i e n t s ) . If (j)i(j)2' •' (j)^ = '0i'02 • • • '01/; where the factors on both sides are irreducible polynomials with integer coefficients, then fi = v, and the factors can be so ordered that (j)i = —-0^ for an even number of values ofi, and (j)i = ipi for all others. Deduction. Let such an equation 0 i 0 2 * * • ^^^ — i^ii^2 ''' i^i^ be given in which /i > 1. Since Theorem 2 implies t h a t ^ i divides t/jj for some j , the tp^s can be rearranged to make 01 divide '0i, say 0 i = qicf)!. T h e n 0203 ••* 0^^ = ^1'020^3 • • • 01/ is a product of factors, at least z/ — 1 of which are irreducible. If fi were less t h a n z^, ji iterations of this step would express 1 as a product of z/ factors, at least u — ji oi which were irreducible, contrary to the fact t h a t the only factors of 1, t h e units 1 and —1, are not irreducible. Therefore, /J. > v. For the same reason, z/ > /x, so /i and u must be equal in any such equation. In the first equation 0203 • • • 0;u = ^10203 •' 'i^i^ found by the process above, qi must therefore have no irreducible factors and therefore must be a unit. Thus, fi steps rearrange the T/^'S in such a way t h a t 0^ = qi(f)i for each z, where qi is a unit and 1 = qiq2''' q^- T h e last equation shows t h a t the number of g's t h a t are —1 is even, and the corollary follows. C o r o l l a r y 2 ( G a u s s ' s * l e m m a ) . If an element of Z[x,xi, X2, • •., Xm-i] is reducible over the field of rational functions of xi, X2, • • -, Xm-i in the sense that it can be written as a product of two polynomials of positive degree in X with coefficients in this field, then it is reducible as an clement of Z[x^Xi, X2,
...,
Xm-l]'
Deduction. Let f{x) be reducible over the field of rational functions, say f{x) = g{x)h{x), and let di and G?2 be elements of Z[xi, X2, . . . , ^ m - i ] t h a t clear the denominators oi g{x) and h{x) respectively, in other words, elements such t h a t G{x) — dig{x) and H{x) — d2h{x) are in Z [ . T , X I , X2, • . . , Xm-i]T h e n did2f{x) — G{x)H{x); this equation can be divided successively by the irreducible factors of did2 to produce an equation f{x) = —^ • —^ (where Gauss's original statement was that a product of monic polynomials with rational coefficients can have integer coefficients only if the factors do. The same is true for TTi > 1: A product of monic polynomials whose coefficients are rational functions in xi, X2, . . . , Xm-i can have coefficients in Z[3;i, X2, • . . , Xm-i] only if the factors do. This statement can be proved in the same way as the statement above: When g{x) and h[x) are monic, f{x) is monic, so its factors —^ and —^ are monic, which implies that -^ = 1 and -^ — \ and therefore that g{x) = G{x) and h(x) = H{x). For more on Gauss's lemma, see Essay 2.5.
Essay 1.4 Factorization of Polynomials with Integer Coefficients
19
ei and 62 are integers for which 6162 = did2, and both factors have integer coefficients), which shows that f{x) is reducible in Z[x-, Xi, X2, . . . , Xm-i]The methods used to prove Corollary 1 prove another proposition: Proposition. If (f>i(t>2 '''
20
1 A Fundamental Theorem
Essay 1.5 A Factorization Algorithm Die im Art. 1 aufgestellte Definition der Irreductibilitdt entbehrt so lange einer sicheren Grundlage, als nicht eine Methode angegeben ist, mittels deren bei einer bestimmten, vorgelegten Function entschieden werden kann, ob dieselbe der aufgestellten Definition gemdss irreductibel ist oder nicht. (The definition of irreducibility given in Art. 1 lacks a firm foundation until a m e t h o d is given t h a t makes it possible to determine whether a given example does or does not satisfy it.)—L. Kronecker [39, §4] T h e naive m e t h o d of constructing a splitting field t h a t was sketched at the beginning of t h e preceding essay suggests t h a t the factorization into irreducibles of a polynomial with coefficients in a root field (see Essay 1.3) might be a key tool in the proof of t h e fundamental theorem. In fact, as later essays will show, it suffices to be able to factor monic, irreducible polynomials with coefficients in 7i[ci, C2, .-., Cy] itself, which is the problem treated by the following theorem: T h e o r e m . Given monic, irreducible polynomials f and g in one nate with coefficients in the ring Z[ci, C2, . . . , c^^] of polynomials ..., Cy with integer coefficients, factor f{x) as a polynomial with in the root field ofg{y).
indetermiin ci, C2; coefficients
In other words, one is to construct a congruence (1)
f{x)
= (t)i{x,y)(l)2{x,y)
" ' (t)k{x,tj) mod
g{y)
in which t h e factors 0^ are polynomials in two indeterminates with coefficients in the field of rational functions in ci, C2, . . . , c^y t h a t are monic and of positive degree in x, t h a t have degree in y less than* the degree of g., and t h a t cannot be written, mod g{y)^ as products of polynomials of lower degree in x. Notation: T h e ring of polynomials in ci, C2, . . . , c^ with integer coefficients will be denoted by R = Z[ci, C2, . . . , Cy\. Its field of quotients, the field of rational functions in ci, C2, . . . , c^^, will be denoted by K. W h e n z/ = 0, i^ is t h e ring of integers and K is the field of rational numbers. This essay is devoted to a description of the algorithm for finding the factorization of f{x) mod g{y) in the form of a congruence (1). The validity of the algorithm will be proved in the next essay. T h e factorization algorithm will make use of computations in the ring R[x.,y] mod {f{x),g{y)) of polynomials in x, y, ci, C2, . . . , c^ with integer coefficients, where two such polynomials represent the same ring element— by definition—if their difference is a multiple of f{x) plus a multiple of g{y) * As far as (1) is concerned, 0i can be replaced by any polynomial that is congruent to it mod g{y), and this condition on the degrees of the 0's need not be satisfied. Restricting the degree in this way serves to determine the factors (j)i(x^y) once f{x) and g{y) are given, as is shown by the final proposition of Essay 1.4.
Essay 1.5 A Factorization Algorithm
21
(the multipliers being, of course, in R[x, y]). Since f(x) is monic of degree TTI, ^m — f(^x) is di polynomial of degree less than m in x that represents the same ring element as x"^, so any ring element that is represented by a polynomial of degree m -\- j in x for j > 0 can also be represented by a polynomial whose degree in x is less than m -\- j (replace the leading term (j){y)x'^^^ in X with (j){y)x^{x'^ — f{x)) while leaving the other terms unchanged). Thus, every ring element can be represented by a polynomial whose degree in x is less than m. In fact, every element of R[x,y] is congruent mod f{x) to one and only one polynomial of degree less than m in x, because an element of R[x,y] whose degree in x is less than m can be a multiple of f{x) only if it is zero. In the same way, any element of R[x,y] is congruent mod g{y) to just one element whose degree in y is less than n. Moreover, since the reduction method can be applied to each coefficient (f)i{y) of a polynomial (l)i{y)x'^~^ + 02(l/)^^"^ + • • • + (l>m{y) that has already been reduced mod / ( x ) , every element of R[x^ y] mod {f{x),g{y)) is represented by one and only one element of i^[x, y] whose degree in x is less than m and whose degree in y is less than n. Each element of this ring R[x,y] mod {f{x),g{y)) is a root of a monic polynomial with coefficients in R. Specifically, if (t){x^y) is an element of R[x^y]^ a monic polynomial J^{z) of degree mn with coefficients in R for which T{(j){x^y)) = 0 mod {f{x)^g{y)) can be constructed in the following way: For each of the mn monomials x'^y^ in which 0 < i < m and 0 < j < n, the polynomial (j){x^y)x'^y^ is congruent mod f{x) and g{y)^ as was just seen, to a sum of multiples of x^y^ ^ where 0 < a < m and 0 < /^ < n, in which the multipliers are in R, Thus, the congruence m—l n—1
determines an mn x mn matrix M of elements Mij^^fs of R once an ordering of the m.n monomials x'^y^ is decided upon. Otherwise stated, M is the matrix that represents multiplication by (/)(x, y) relative to the basis x^y^ of R[x,y] mod {f{x)^g{y)) over R. The characteristic polynomial of this matrix, which is to say the polynomial ^(2:) = det(2;/—M), is monic of degree mn in z; by the Cay ley-Hamilton theorem, it satisfies J^{(j){x, y)) = 0 mod {f{x),g{y)). (A proof will be given in the next essay.) Let this construction be applied not to a single polynomial (j){x^y) but to tx -\- uy^ regarded as a polynomial in new indeterminates t and u whose coefficients are in R[x^y]. The result is a polynomial T{z,t^u) in 2:, t, and u with coefficients in R. Specifically, T is the characteristic polynomial det(2:/ — M) of the mn x mn matrix M determined by C • {tx -h uy) = MC mod {f{x),g{y)), where C is the column matrix of length mn whose entries are the monomials x'^y^ in which 0 < i < m and 0 < j < n arranged in some order and tx-\-yu is a 1x1 matrix. The entries of M are homogeneous polynomials of degree 1 in t and u with coefficients in R, so the entries oi zl — M are
22
1 A Fundamental Theorem
homogeneous of degree 1 in z, t, and u. Thus, J-{z^ t, u) is homogeneous of degree mn in these indeterminates and has coefficients in R; moreover, it is monic in z. As was seen in the last essay, the irreducible factors of J^{z,t^u) as a polynomial with integer coefficients (in 3 + z/ indeterminates) can be found, say T{z^t^u) = YlJ^i{z^t^u)^ where the Ti[z^t^u) are irreducible. Because T is homogeneous, its irreducible factors Ti are homogeneous. Because J^ is monic in 2:, the leading coefficient of each of its irreducible factors Ti as a polynomial in z is ± 1 , so one can stipulate that each Ti is monic in z, and this condition determines the J^i completely. The required factorization (1)
f{x) = (t)i{x,y)(l)2{x,y) •' • (j)k{x,y) mod g[y)
contains one factor (j)i{x,y) for each Ti{z^t^u). It is constructed as follows: As will be shown, the degree of J^i (it is homogeneous in z, t, and u) is a multiple of n, say it is /x^n. (By symmetry, this degree is also a multiple of m, a fact that is not of interest here.) Substitute tx + uy for z and 1 for t in Ti and write the result in the form (2) T^{x + uy, 1,u) = B^^ou^^^ + ^^,2^^^""' + ^^,2^^^""' + • • • + ^^,M^n. Each coefficient Bi^j is a polynomial in x, y, Ci, C2, . . . , c^^-i, and Cy with integer coefficients. The first fii of these coefficients are all zero mod g{y)^ which is to say that reduction mod g{y) gives J^i{x -h uy, 1, u) = i^iU^^^""-^^ + • • • mod g[y), where the omitted terms are of lower degree in u and ifji = Bi^^. mod g{y). The factor (l)i{x, y) of f{x) mod g{y) corresponding to this factor Ti of T is (3)
0z(x, y) = -77^f|- mod ^(2/),
where g'{ij) is the derivative oi g{y). (Implicit in this statement, since (/)^(x, y) is monic in x, is the statement that ipi = g'{y)^^x^^ + • • • mod g{y) where the omitted terms have lower degree in x.) Example 1. f{x) = x'^ — 2 and g{y) = ^^ — 3. The first step is to find J^{z, t, u) for this / and g. When the monomials x"^^ for 0 < a < 2 and 0 < /^ < 2 are put in the order 1, x, y, xy, the matrix that represents multiplication by tx + uy becomes ' 0 t u 0 2t 0 0 u 3u 0 0 t 0 3u2t0 Therefore J^ is the determinant of
Essay 1.5 A Factorization Algorithm z -2t -3u 0
-t -u z 0 z 0 —3u -2t
23
0 -u -t z
which can be found without too much paper-and-pencil calculation to be z^ - (4^2 -h6?i2)^2 _^4^4 _ 12^21^2 _|_9^4^ rpj^-g polynomial T{z, t, u) is irreducible because J-{z, 1,1) = z^ — lOz^ + 1 obviously has no root mod 5, so it can only have a factorization of the form {z"^ -i-az-\-b) (z^ -h cz-^ d) = z^ — lOz^ + 1, and this would imply a — —c, d -^ ac-\- b = —10, and 6 = d = ± 1 , so a^ = —ac = b-\-d-\-10 =^ ±2 + 10, which is impossible. Therefore, x^ — 2 is irreducible mod y^ — 3 (the factorization algorithm produces only the one factor corresponding to ^ itself). To determine this factor—which must, of course, be a:^ — 2 itself— one computes the coefficient ip of u^ in T{x + uy, 1, li) = {x -\- uy)^ — (4 -h 6u^){x + uy)"^ + 4 — 12u'^ + 9t^^ because degT/degg = 2. (As expected, the coefficient of u^ is y"^ — 6y'^ + 9 = 0 mod {y'^ — 3), and the coefficient of u^ is 4:xy^ — 12xy = 0 mod {y'^ — 3).) Because xp = Qx'^y'^ — Ay'^ — 6x'^ — 12, formula (3) gives the factor 6x'^y'^-4y'^-6x^-12
_ 18^:2-12-6x2-12 _ 12x^-24 12 i^yy
=
X
2 mod g{y)
as expected. Example 2. f{x) determinant of
2 and g{y) = y
18. In this case, J-'{Zj t, u) is the
-t u 0 z z 0 —u -2t 0 z -t -ISu 18u -2t z 0 which can be found—the calculation is a variation of the one in Example 1—to be z^ - (4^2 + 361/2)^2 _^ 4^2 _ 72^2^2 _^ 324^^2^ rj.^^^ ^ factorization T{z^t,u) = J^i{z^t,u)J^2{z^t,u) can be found by completing the square to put J^ in the form T{z,t,u) = {z^ - 2t^ - l8v?Y - lUi^v? = {z^ - 2^ lSv?-l2tu){z'^-2t^-l8v? + l2tu). The factor oif{x) mod g{y) corresponding to J^i{z^t^u) is, because in this case //i = d e g ^ i / d e g ^ = 1, the coefficient of u in {x + uyY — 2 — 181^^ _ i2u divided by g'{y), which is 2xy - 12 _ 2x2/2 - I2y _ 36x - 12^ = X - yf mod (y2 _ 18). 2y2 36 2?/ (As expected, the coefficient of v?^ which is y'^ — 18, is zero mod g{y).) In the same way, the factor of /(x) mod g{y) corresponding to ^2 is x + \y. Indeed, (x - \y) (x + \y) = x2 - ^y'^ = x^ - 2 mod [y'^ - 18), so /(x) = x^ - 2 splits mod g{y) = y'^ — IS into linear factors. (If y = \/T8, then | = \/2.)
24
1 A Fundamental Theorem
Example 3. f{x) — x^ + c i x + C2, g{y) = y'^ — cf -^ 4c2. T h e factorization depends on factoring t h e characteristic polynomial of 0
t
— C2t —Cit
du 0
0 du
u
0
0
U
0 t —C2t —cit
where d = cf — 4c2. T h e computation of this characteristic polynomial is not too onerous. (One m e t h o d is t o use t h e formula z"^ — A\z^ -h A2Z^ — A3Z + A4 for the characteristic polynomial, where Ai is the sum of t h e i x i principal minors of t h e matrix.) T h e result is T{z, t, u) = z^ + 2citz^ + (2c2t^ + cji'^ - 2du^)z^ + Cit{2c2t'^ -\-4r
-h {2c2d - cld)ru^
2du^)z
+ J2^A d^u
a homogeneous polynomial in 2:, t, and u with coefficients in Z[ci,C2] when c\ — 4c2 is substituted for d. T h e difficult step is the factorization of T{z^ t, u). W h e n t = 0 it is ^^ - 2dv?'z'^ + d^u^ = {z'^ - dv?Y, and when 1/ = 0 it is z"^ + 2citz^ + (2c2 + cl)t^z'^ + 2ciC2t'^z + clt^ = (z^ + ci^t + C2t^Y. Therefore, the factorization of ^ , if there is one, must be of the form (2:^ + c i t z + C2t^ + ptu — dv?){z'^ -\- citz -\- C2t^ + gti^ — (ii^^), where p and g' are in Z[ci, C2]. T h e coefficient of t^ix is 0 on the one hand and C2(p + q) on the other, so p — —q. T h e n the coefficient of t^v? is 2c2
C\
- mod^(?/).
(Note t h a t t h e coefficient of u^ is y^ d = 0 mod 5'(2/), as expected.) In t h e same way, ^ 2 leads to t h e factor x + y — | . Note t h a t this process merely factors f{x) mod g{y). It does not construct t h e polynomial g{y) modulo which f{x) is a product of linear factors. Example 4. f{x) — x^ — 2 and g{y) — y^ — 2. W h e n the monomials x^y^ with 0 < a < 3 and 0 < /? < 3 are put in the order 1, y, 7/^, x, xy, xy"^, x^y^^ the m a t r i x of which T^z^t^u) is the determinant is* z/g — IM^^ UMy, where My is the 9 x 9 m a t r i x of 3 x 3 blocks in which the diagonal blocks are all equal to "0 1 0 '
G Here Ik is the k x k identity matrix.
00 1 200
Essay 1.5 A Factorization Algorithm
25
and the blocks off the diagonal are zero, and where Mx is the 9 x 9 matrix of 3 X 3 blocks that has the form of the matrix G; that is, the first block in the first row is zero, the second block in the first row is the identity matrix /s, and so forth, the first block in the last row being 2/3. Hand computation of this 9 x 9 determinant is straightforward but tedious. An easier method of hand computation uses the formula T{z^ l^u) = det {{zl^ — uG)^ — 2/3) that is proved in the next essay. Since G^ = 2/3 (this is the main property of G), it follows that J-{z^ l^u) is the product of the determinant of {zl — uG) — G and the determinant of [zI - uGf + {zl - uG)G + G^
The first determinant is {u^\f
z^ 2{u^-u^l) 2{-2u^\)z det [r^I
( - 2 ^ + 1)2; z^ 2{u^ -u^\)
v?-u-^l {-2u-V\)z z^
- G) = {u-\-l)^ ( T ; ^ ]
- 2) =
2;^—2(tfc-f-l)^, which gives the factor z^ — 2{t-\-u)^ of ^ ( z , t , i i ) ; call it J^i{z^t,u). The second determinant is z^ -^2{-2u + ifz'^ + 4.{v? - w + 1)^ - 3 • 2{v? -u^z- + {-^u^ + ^v? + 6ii - 4)2;^ + 4.{v? - IX + 1)"^, which gives l){-2u-^l)z'^ v6 the factor z^ -f {-Au^ + ^tv? + Gt^w - U'^)z'^ -h 4.{v? -tu^ff ofT{z,t,u); call it T2{z^t^u). The first factor Ti{z,t,u) is irreducible because its degree is 3, and any factor of J-" has degree divisible by 3. That ^2(^5^,'^) is irreducible follows from the irreducibility of J^2(^, 1, - 1 ) = z^ -\- 108. (Since z^ + 108 = (z^ -h 2)(z^ -i- z -\-2){z'^ — z -\-2) mod 5 and the factors on the right are irreducible mod 5, all factors of z^ -\- 108 must have even degree. Similarly, 2:^ + 108 = {z^ — 2){z^ + 2) mod 7 and the factors on the right are irreducible mod 7, so all factors of 2^^ + 108 must have degree divisible by 3. Thus, 2;^ -h 108 has no proper factor.) Therefore, x^ — 2 is a product of a factor of degree 1 and a factor of degree 2 mod y^ — 2. The actual factorization x^ — 2 = {x — y){x'^-^xy-\-y'^) mod {y^ — 2) is in fact obvious once the factor of degree 2 is known to be irreducible. Its derivation using the algorithm is as follows: The coefficient of u^ in J^i{x -\- uy^ l,ifc) is 3xy^ — 6, so the factor is ^^| o"^ = 3xy -6j/ ^ ^ _ y ^ ^ ^ g{y). (As expected. 3?/2
32/3
the coefficient of u^ is y^ 0 mod g{y)-) The coefficient ofu^ in {x-{-uy)^ + 4)(x + uy)^ + 4(1^2 - 1 ^ + 1)^ is Ibx'^y^ + {-4:){3x'^y) + 6(3x7/2) _^ 5^3 ^ 4 (3 + 3), so the corresponding factor of f{x) mod g{y) is 30x'^y-12x'^y-\-18xy'^-\-12-\-24 18x'^y-\-18xy'^-\-18y^ _ -\- xy -{-y'^ mod {y^- 2), as (32/2 18?; expected. (Also as expected, the coefficient of u^^ which is y^ — 4y^ + 4, and the coefficient of tu^^ which is 6xy^ + 6y^ — I2xy'^ — 12, are both zero mod (2/^-2).) Example 5. f{x) c, 9{y) — y^ — c. Replacement of 2 with c in the matrix G of Example 4 gives as the two factors of T{z, l^u) the polynomials z^ — c{u + 1 ) ^ , which is the determinant of
26
1 A Fundamental Theorem z -{u^l) 0 z -c{u-{-l) 0
0 -{u^l) z
•)
and z^ -hc{--2w^H- 3u^ -f 3u - 2)z^ -^c^{u'^-u + 1)^, which of z'^ {-2u^l)z u'^-u-\-l' c(ii^-u+l) z'^ {-2u+l)z c{-2u + l)z c{v? - li + 1) z'^ The factorization of T{z^t^u) is derived from these factors by making the factors homogeneous in t. Both factors are irreducible because they are irreducible when c — 2. They prove that the obvious factorization x^ — c = {x — y){x^ -\- xy -\- y'^) mod {y^ c) is a factorization into factors that are irreducible mod y^ — c.
Essay 1.6 Validation of the Factorization Algorithm
27
Essay 1.6 Validation of t h e Factorization Algorithm Let f{x) and g{y) be monic, irreducible polynomials with coefficients in t h e ring R = Z[ci, C2, . . . , c^,] of polynomials in ci, C2, • . . , c^, with integer coefficients. T h e last essay showed t h a t if C is a column matrix of length mn whose entries are the monomials x^y^ with 0 < a < m — d e g / and 0 < /3 < n = d e g ^ , arranged in some order, t h e n t h e congruence MC = C'{tx
+ uy) mod
U{x),g{y))
determines an mn x mn matrix M whose entries are homogeneous linear polynomials in t and u with coefficients in R. (Here tx -f uy is to be regarded as a 1 X 1 matrix, so t h a t the right side of the congruence, like t h e left, is a m a t r i x product.) Let ^ ( z , t, u) = det{zl — M) be t h e characteristic polynomial of M (which, by the way, is independent of the choice of the order of the entries of C) and let be its factorization into irreducible factors t h a t are monic in z. Clearly T is homogeneous of degree mn in z, t, and u with coefficients in R^ so t h e J^i are homogeneous in z, t, and u. It is to be shown t h a t the degree of each J-i{z, t, u) is a multiple of n, say deg J^i — jiin^ t h a t (1)
9'{y)'^f{x)
= ilJi{x,y)ilj2{x,y)
• " il^k{x,y) mod
g{y)
when %l)i[x^y) is defined to be the coefficient of u^^^^~^) in Ti{x + uy^ 1,'?^), and t h a t t h e factors ipi{x^y) on t h e right are irreducible as polynomials in X with coefficients in t h e root field of g{y); moreover, it is to be shown t h a t ipi{x^y) = g'{y)^^x^^ + • • • m o d ^ ( ^ ) , where t h e omitted terms have lower degree in x, so t h a t division of (1) by g'{y)'^ gives the required factorization f{x) = (l)i{x,y)(j)2{x,y) " ' (l)k{x,y) mod g{y) of f{x) mod g{y) into factors 0i(x, y) = t^^y,] mod g{y) with coefficients in t h e root field of g{y) t h a t are monic as well as irreducible. T h a t d e g ^ ^ is divisible by n can be proved as follows: Set t = 0 and u = 1 in M to find a matrix, call it M^, t h a t satisfies My • C = C • y mod g{y). Let the monomials x^y^ in C be ordered by p u t t i n g x'^y^ ahead of x^ y^ if a < a ' or if a = a^ and p < f3\ T h e n My is a matrix of n x n blocks in which the blocks off the diagonal are all zero and t h e blocks on the diagonal are all u times t h e matrix G whose first n — 1 rows are t h e last n — 1 rows of the n X n identity matrix In and whose last row is —bn^ —bn-i^ • • . , —&i, where the bj are t h e coefficients oi g{y) = y'^ -i- biy^~^ + 62^^"^ + • • • + ^nAs is easily* shown, g{y) = det{yln — G). T h e n T{z^ 0, u) = det(2;/ — uMy) = det{zl - uG)"^ = u^"" d e t ( f / n - G ) ^ = i i ^ ^ ^ ( f ) ^ = g{z, w ) ^ , where g{z, u) * This is the special case f{x) = x and u = 1 of the formula J^{z, l,u) = det f{zl — uG) proved at the end of this essay.
28
1 A Fundamental Theorem
is the homogeneous polynomial in z and u with coefficients in R for which g(^z) = ^(z, 1). Thus n ^A^^ O5 '^) = ^(^^5 '^)^5 so, because ^(z, ix) is irreducible over R and because T[^z^ 0, i^) and ^(z, u) are both monic in z, each JF^(z, 0, TX) is g{z,u)^' for some /i^, where ^ fii = m. Thus, deg^^ = /i^n, as was to be shown. When Ti{x -\- uy^ l^u) is expressed as a polynomial in u whose coefficients are polynomials in x with coefficients in the root field of g{y), the coefficient of u^'^^'^"^ is g'{yY^x^^ + • • • mod g{y), where the omitted terms have lower degree in x. In particular, its degree as a polynomial in u is at least iii(n — 1). This statement follows from the observation that J^i{x -\- uy, l,u) is a sum of terms Xaj3-f{x + uy)^l^u^, where Ac,/?^ is in Z[ci, C2, . . . , c^] and a + /? + 7 = liiU. Thus, this polynomial contains no terms whose combined degree in x and u is greater than jiiU^ and the terms whose combined degree in x and u is exactly //^n are the terms of Ti{x + uy,0,u) = g{x + uy,u)^\ This homogeneous polynomial in x and u with coefficients in the root field of g{y) can also be written in the form
'^^-g (y + ^, lY' = «^- (giy) + g'{y)^ + lg"{y){-)^
+ -i^i
g{y)u^^g\y)xu^-' =
+ \g"{y)x^u^-^
+
{g\y)xu^-^^...Y^
= g\yY^x^^u^^^''-^^ + . •.
mod g{y),
where the omitted terms all have combined degree fiiU in x and u and degree less than /i^(n —1) in u. Therefore, the coefficient of ?/^*^^^~^^ in !Fi{x-\-uy^ l,i/) is as described above. When T[x + uy^ 1,7/) is expressed as a polynomial in u whose coefficients are polynomials in x with coefficients in the root field of g{y), the coefficient ^y ^m(n-i) ^^ g'{y)^f{x) uiod g{y) and the coefficients of all higher powers of u are zero mod g{y). The main step in the proof of these statements is the proof that, as was stated in the preceding essay, T{tx -\- uy^t^u) = 0 mod {f{x)^g{y)). For the proof of this congruence, let M be as above and let A^* be the adjoint of the matrix M — {tx + uy)Imn — M of which J^{tx + uy^ t, u) is the determinant. (That is, the entry in the zth row of the j t h column of A^* is (—1)*"^-^ times the determinant of the [mn — 1) x {mn — 1) matrix that remains when the zth column and the jih row of At are deleted.) Then A4* • M — J-'{tx + uy,t,u)Imn- By the definition of M, all entries of the column matrix AiC are zero mod {f{x)^g{y)). Therefore all entries of J^{tx + uy^t^u)ImnC are zero mod {f{x),g{y)). Since 1 is an entry of C, it follows that J^{tx + uy^t^u) = 0 mod {f{x)^g{y)). Thus, T{x + uy^ 1, w) = 0 mod {f{x)^g{y)). Since the combined degree in x and u of any term of T{x + uy^ 1,7x) is at most m.n^ the coefficient of u^^~^ has degree at most j in X] when j < m it follows that this coefficient has degree less than m, which
Essay 1.6 Validation of the Factorization Algorithm
29
means that it is already reduced mod f{x) and therefore, because reduction of it both mod f{x) and mod g{y) gives the result zero, it must be zero mod g{y). Thus, the coefficients of u^ for k > m{n — 1) are all zero mod g{y)^ as was to be shown. As in the previous paragraph, the coefficient of J^{x + uy^ 1, i/) is congruent to g'{y)^x'^ + • • • mod g{y)^ where the omitted terms have degree less than mmx. Since f{x) is monic of degree mmx^ the polynomial T{x + uy^ 1, u) — g'(y)^ f {x)u'^^^~^^ is zero mod {f{x)^g{y)) and the coefficient of it has no terms of degree m or greater in x, so this coefficient is zero mod g{y)^ as was to be shown. Thus, when the two sides of the congruence J^{x -\- uy, 1, u) = Yl^ J^i{x -h uy^l^u) laod g{y) are regarded as polynomials in u whose coefficients are polynomials in x with coefficients in the root field of g{y)^ the left side is a polynomial of degree m{n — 1) whose leading coefficient is g'{y)'^f{x). The ith factor on the left has been shown to have degree at least /ii{n — 1). If it had greater degree for any i, the degree of the product would be greater than J2iii{n — 1) = m{n — 1), which is not the case. (Since the ring of polynomials in x with coefficients in the root field of g{y) is an integral domain, the degree of a product is the sum of the degrees of the factors, and the leading term of a product is the product of the leading terms.) Therefore, J^i{x + uy^ l^u) = \lji{x^y)u^^^^^~^^ + • • • mod g{y)^ where the omitted terms have degree less than //^(n — 1) in u^ from which the desired congruence g'{y)'^f{x) = Ylii^i{x,y) mod g{y) follows. Since it has already been shown that il^i{x,y) = g'{yY^x^^ + • • • mod g{y)^ it remains only to show that the il)i{x^ y) are irreducible over the root field of g{y). This fact will follow from a quite different description of T{z^ 1,'^), namely, as det f{zln — uG), where G is the n X n matrix described above. As was noted above, the matrix My obtained from M by setting t = 0 and li = 1 in M is a matrix of n x n blocks in which the nondiagonal blocks are all zero and the diagonal blocks are all the matrix G described above. Similarly, M^, the matrix obtained by setting t = 1, u = 0 in M, is a matrix of n X n blocks; the first (m — l)n rows are the last (m — l)n rows of Imn^ and the last n rows contain the matrices —amln, —^m-i-^n, • • •, —<^i^n, where the ai are the coefficients of f{x) = x'^ + aix'^~^ + • • • + a-m- What is to be shown is that ^ ( ^ , l,t^), which is the determinant of zimn — ^x — uMy by the definition of ^ , is det f{zln — uG). Let C be the matrix of n x n blocks in which blocks above the diagonal are zero, blocks on the diagonal are J^, and blocks i steps below the diagonal are {zIn — uGy. By direct computation, {zImn — Mx — uMy)C has the last (m — l)n rows of —Imn in its first (m — l)n rows, and has f{zln — uG) in the first n columns of its last n rows. Since the determinant of £ is 1, it follows that J^{z^l^u) — dzdet f{zIn — uG). Since T{z^ 1, u) and det f{zln — uG) are both monic in 2:, the sign is plus.
30
1 A Fundamental Theorem
Since the matrix G satisfies g{G) — 0 (by direct computation,* or, because g is the characteristic polynomial of G, an application of the Cay ley-Hamilton theorem), a factorization f{x) = 6i{x,y)02{x,y) - - - Oi{x^ y) mod g{y) in which each Oi{x^ y) has coefficients in the field K of rational functions in ci, C2, . . . , Cy and is monic in x implies T{z^\^u) — detf{zln — uG) =
* Let pi denote the zth row of In- Then piG-' = pi^i for ji = 0, 1, ..., n — 1, but piG"^ = pnG = [-ao -ai ••• - a^-i] = pi{-aQl - aiG an-iG"^'^), which proves that pi • g{G) = 0. Therefore, pi^j • g{G) = pi • G^ • g{G) — pi • g{G) • C^ = 0 • G^ = 0 for j = 0, 1, ..., n - 1, which is to say g{G) = Ing{G) = 0.
Essay 1.7 About the Factorization Algorithm
31
Essay 1.7 About the Factorization Algorithm T h e m e t h o d of factoring f{x) mod g{y) in t h e preceding essays has as an immediate corollary: T h e Kronecker—Kneser* T h e o r e m . Let f and g be monic, polynomials with coefficients in Z[ci, C2, ..., c^\, and let f{x)
= 01 (x, y)02(^, y)-"
irreducible
(t>k{x, y) mod g{y)
and g{y) = xlJi{x,y)i;2{x,y)"-
^pi{x, y) mod
f{x)
be the factorizations of each modulo the other. Then k = I, and the can be so ordered that deg^ (/)^/ deg^^ ipi = deg / / d e g ^ for each i.
factors
Proof. To factor g{y) mod / ( x ) , one constructs the characteristic polynomial ^{z, t, u) of t h e m a t r i x tMy^uM^ for which {tMy-\-uMx)C = C{ty-\-ux) m o d {g{y)^ f{x)), where C is the column m a t r i x of length mn t h a t contains the monomials y^x^ in which 0 < a < n = degg and 0 < f3 < m = d e g / . Because this characteristic polynomial is independent of t h e order chosen for the entries of C, it is clear t h a t !F{z^t^u) = !F{z^u^t). T h e factorization algorithm proves t h a t A: = / is t h e number of irreducible factors of J^{z,t,u), and the integers deg / deg^ ipi = d e g ^ deg^, (pi are t h e degrees of those factors. In addition to its aesthetic appeal, this theorem is a powerful tool. See Essay 2.1, where it is used in the proof of Galois's fundamental theorem. Inevitably, some readers will object t h a t t h e algorithm is impractical. T h e construction of T{z, t, u) is already a formidable task, and t h e factorization of this polynomial in three indeterminates with integer coefficients is even more daunting. But t h e practicality of t h e algorithm is irrelevant, because its purpose is to prove the existence of the factorization, not to effect it. Once t h e factorization is known to exist, methods for constructing it can be addressed. A similar situation occurs in t h e case of t h e fundamental theorem of algebra (see Essay 5.1); Newton's m e t h o d is in most cases the best way t o construct the roots of a polynomial, but other methods are needed to prove t h a t there are roots t o be constructed. Kronecker emphasized the importance of the problem of factoring f{x) m o d g{y) in a footnote to his 1887 paper "Uber den Zahlbegriff" [43, p. 262 of vol. * I called this theorem "Dedekind's reciprocity theorem" in Galois Theory [18, p. 66], but I have since learned that it already had the name "KroneckerKneser theorem" (see ([8] and [50]). Richard Dedekind discovered it in 1855, but the discovery was not published until Scharlau's paper [59] appeared in 1982. Kronecker included the theorem in his university lectures ([32, p. 309]). He might have known of Dedekind's work, but since he does not seem to have cited Dedekind, he probably discovered the theorem independently. The first publication of the theorem was by A. Kneser [36].
32
1 A Fundamental Theorem
I l i a of t h e repubhcation in Mathematische Werke]. In 1881, he had already described an algorithm for such factorizations in the following way: It can be assumed t h a t f{x) has no repeated factors, because otherwise one could free it of repeated factors by dividing it by its greatest common divisor with its derivative. One sets z -\- uy in place of x in f{x), where u is an indeterminate; at t h e same time, one t r e a t s / itself as a function of X and the algebraic quantity y, which may figure in its coefficients. Therefore, denote / by f{x,y) and form the product of all the conjugate expressions f{z-\-uy^ y)^ t h a t is, all of t h e m t h a t arise when y is replaced by its conjugate values. This product is a polynomial in z whose coefficients are rational functions in ci, C2, . . . , c^^ [the presence of u in the coefficients is ignored] and therefore, as has been shown, can be decomposed into irreducible factors. If these factors are F i ( z ) , F2{z), . . . , then, as is easy to see, the greatest common divisors of / ( z + uy^ y) and Fi{z) for z = 1, 2, . . . give the irreducible factors of f{z + uy^ y)^ from which the irreducible factors of f{x) itself can be found when x — uy is substituted for z. It remains to remark t h a t substitution of 2; +1^^ for x ensures t h a t y actually occurs in the coefficients of / . " ^ Dabei kann angenommen werden, dass die Function f{x) keine gleichen Factoren enthalt; denn anderenfalls wiirde man dieselbe von gleichen Factoren dadurch befreien konnen, dass man sie durch den grossten Theiler, den die Function f{x) mit ihrer Ableitung gemein hat, dividirt. Man setze nun zuvorderst z -\- uy an Stelle von x in / ( x ) , wo u eine unbestimmte Grosse bedeutet; man betrachte ferner / selbst als Function von x and der zum Rationalitats-Bereich gehorigen algebraischen Grosse y welche also auch in den Coefficient en vorkommen kann, bezeichne demnach die Function / durch / ( x , y) und bilde das Product aller mit einander conjugirten Ausdriicke f{z-\-uy,y), d. h. aller derjenigen, welche entstehen, wenn man die mit y conjugierten algebraischen Grossen an Stelle von y setzt. Dieses Product ist eine ganze Function von z, deren Coefficienten rationale Functionen der Variabeln ci, C2, . . . , Cj, sind, kann also nach dem Vorhergehenden in irreductible Factoren zerlegt werden. Sind diese Factoren: J^i{z), ^2(2^), •••, so bilden, wie leicht zu sehen, die grossten gemeinschaftlichen Theiler von f{z-\-uy,y)
und
Th{z)
fur /i = 1, 2, . . . die irreductibeln Factoren von f{z-\-uy^ y), aus denen die Factoren von f{x) selbst unmittelbar hervorgehen, wenn wieder x — uy ?iii Stelle von z gesetzt wird. Es ist noch zu bemerken, dass die Einfiihrung von 2: + ny an Stelle von X zu dem Zwecke erfolgt ist, das Vorkommen von y in den Coefficienten zu sichern. (From §4 of [39]. The translation above is somewhat free, and Kronecker's notation F , 91, IH', d\'\ d\"'^ . . . , has been changed to / , ?/, ci, C2, . . . , Cjy to agree with the notation of these essays.)
Essay 1.7 About the Factorization Algorithm
33
My discussion of this subject in [18, §§60-61] shows that I found the exact algorithm Kronecker had in mind—not to mention its validity—far from "easy to see." In retrospect, however, I do see that it is essentially the algorithm of Essay 1.5. Instead of factoring a polynomial in x alone as in Essay 1.5, Kronecker changes f{x) to f{z + uy), where u is an indeterminate, in order to be sure that the polynomial to be factored does involve y. He then forms the "product of its conjugates," by which he surely means (see his §2) the norm of f{z -h uy) as a polynomial with coefficients in the root field of g{y)^ which is to say that it is plus or minus the constant term of the polynomial of which f{z-\- uy) is a root. The polynomial of which f{z-\- uy) is a root is the characteristic polynomial of the matrix M of elements of R[z, u] defined by C • f{z + uy) = MC mod g{y)^ where C is the column matrix with entries 1, ?/, ^^, . . . , y'^~^ (n being the degree of ^). Thus, Kronecker's ^1(2;), ^2(^)5 • • • are the irreducible factors of the constant term of the characteristic polynomial of this M. But this is zbdetM, and M is the n x n matrix f(zl + wG), where G is the matrix determined by g{y) as in Essay 1.6. Thus, the Fi{z) are the irreducible factors of det/(2;/ + uG). Since, as was shown in Essay 1.6, det/(;^/ + uG) = T{z^ 1, —u)^ he is saying that the desired irreducible factors 0i(x, y) are the greatest common divisors of f{z^-uy) with Ti (z, 1, —u)^ T2{z^ 1, —It), . . . , or, better, the greatest common divisors of j{x) with T\{x — uy^ 1, —ix), ^2(^ — uy^ 1, —'^)5 When one changes the sign of u and notes that a common divisor of f{x) and Ti{x -\- uy^l^u) must be independent of u and must therefore divide all coefficients of J^i{x -h uy^l^u), Kronecker's claim becomes the statement that (j)i{x^y) is the greatest common divisor of fix) and the coefficients of J-i{x + uy^ l,?i) when it is expanded in powers of u. Now, (j)i{x^y) is the greatest common divisor of f{x) and the leading coefficient %lji{x,y) mod g{y) in this expansion, so his claim comes down to the statement that (/)i(x, y) divides all the other coefficients oi Ti{x-^uy^l, u) when they are regarded as polynomials in x with coefficients in the root field of ^(y). Proposition. As a polynomial in x and u with coefficients in the root field of g{y), J^i{x -\-uy^l^u) is divisible by (f)i{x^y). Proof. Let /C be the field K[x^y] mod ((/>i(x, y),g{y)), which is the ring of polynomials in X with coefficients in the root field of g{y) modulo the irreducible polynomial (j)i{x^y) with coefficients in this root field. (As before, K denotes the field of rational functions in ci, C2, . . . , c^.) Since f{x) is 0 as a polynomial with coefficients in /C (because f{x) is divisible by (j)i{x^y) mod ^(2/)), and since ^(2;, t, tt) = 0 mod {f{x),g{y)) as was shown in Essay 1.6, J-'{z^ t, u) is zero as a polynomial with coefficients in IC. Therefore at least one of its factors Tj{z^t^u) must be zero as a polynomial with coefficients in /C. For any such value of j , J-j{x -\- uy^ 1, u) must be zero as a polynomial in u with coefficients in /C. In particular, iljj{x^y) must be zero as an element of /C, which is to say that ipj{x,y) is divisible by (f)i{x^y) mod g{y). But ipjix^y)
34
1 A Fundamental Theorem
is a unit times (j)j{x^y) and the irreducible factors (j)j{x^y) of f{x) mod g{y) are distinct because f{x) is irreducible. Therefore, 2pj{x,y) is not divisible by (j)i{x^y) mod g{y) unless j — i, and the proposition follows.
Essay 1.8 Proof of the Fundamental Theorem
35
Essay 1.8 Proof of the Fundamental Theorem As before, R will denote the ring Z[ci, C2, . . . , c^^] of polynomials in ci, C2, . . . , Cjy with integer coefficients and K will denote its field of quotients, the field of rational functions of ci, C2, . . . , c^^. When z/ = 0, i? is the ring of integers and K is the field of rational numbers. The theorem to be proved was stated in Essay T2: Fundamental Theorem. Given a polynomial f{x) — a^x^^a\x^~^ ^ h On of positive degree n with coefficients in R, construct a monic, irreducible polynomial g(y) with coefficients in R with the property that f{x) is a product of linear factors with coefficients in the root field of g{y). In other words, when the factors of f{x) mod g{y) are taken to be monic in X, the factorization is to have the form f{x) = ao{x — pi{y)){x — p2{y)) • • • (x — pn{y)) mod g{y), where ao is the leading coefficient of f{x) and the pi{y) are elements of the root field of g{y). Such a polynomial g{y) will be said to split f{x). As the proposition at the end of Essay 1.4 implies, the roots Pi{y) are determined, as elements of the root field of g{y)^ by f{x). Loosely speaking, the root field of g{y) extends computations in J^ in such a way that the given f{x) with coefficients in R splits into linear factors. The factorization algorithm of the preceding essays, which assumes that f{x) is monic and irreducible, can be used to factor an arbitrary / by taking the change of variable xi = aox and writing aQ~^f{x) = Xi + aiXi~^ + aoa2Xi~'^ H ha^Q~^ajX^~-^ H ha^'^an- A factorization of aQ~^f{x) as a polynomial in Xi becomes a factorization of f{x) as a polynomial in x when it is divided by the nonzero element OQ"^ of K and the substitution Xi = aox is made. In this way, the theorem is reduced to the case in which f{x) is monic. The iteration theorem below proves this case of the theorem using the factorization algorithm for monic, irreducible polynomials, which obviously implies a factorization algorithm for arbitrary monic polynomials. This theorem differs from Kronecker's theorem in Ein Fundamentalsatz der allgemeinen Arithmetik [42] in that it specifies that the splitting field is to be described as the root field of g{y)^ whereas Kronecker left the form of the description open and in fact preferred a "prime module system" of an altogether different type. Nor is the proof below similar to Kronecker's, which constructed specific relations satisfied by the roots in a splitting field. Instead, it constructs a splitting polynomial g{y) for f{x) in an iterative way that follows the naive proof sketched at the beginning of Essay 1.4. Iteration Theorem. Given a monic polynomial f{x) with coefficients in R, and given a monic, irreducible polynomial g{y) with coefficients in R that does not split f{x), construct a monic, irreducible polynomial h{z) with coefficients in R for which the factorization of f{x) mod h{z) contains more linear factors than does the factorization of f{x) mod g{y).
36
1 A Fundamental Theorem
Proof. The factorization of f{x) mod g{y) is accomphshed by applying the factorization algorithm to each of the monic, irreducible factors of f{x) and taking the product of the results. By assumption, at least one of the irreducible factors of f{x) mod g{y) obtained in this way has degree greater than 1. With the notation as before, at least one of the polynomials T{z^ t, u) used in the factorization of f{x) mod g{y) (there is an T for each irreducible factor of /(x)) must, by assumption, have at least one factor !Fi{z^t^u) that gives rise to a monic factor (j)i{x^y) of f{x) mod g{y) of degree greater than 1. Let Ti{z,t^u) be such a factor, and let
Essay 1.8 Proof of the Fundamental Theorem
37
at most / / i n — cr in w, so det J\f{u) has degree at most 1 + 2 H h (/iin — 1) = | / i i n ( / i i n — 1) in u. If detAf{u) were zero, there would be* a nontrivial solution vi{u)^ '^2(^), • • • 7 '^/xin(^) (polynomials with coefficients in K) of t h e /iiu x / / i n homogeneous system of linear congruences vi{u){x-\-uy)^'^^~^ -\-V2{u){x-^uy)^'^'^~'^ -\• • --^-Vij^^riiu) = 0 mod (01 (x, y)^g{y))' (This single congruence is equivalent to / i i n congruences, one for each row x^y^ of Ci.) In other words, there would be a nonzero polynomial F{z^ u) with coefficients in K—and therefore one with coefficients in R—whose degree in z was less t h a n jj^in = d e g ^ i and for which reduction of F{x + uy, u) mod (01 (x, y)^g{y)) gave zero. Application of t h e Euclidean algorithm to Ti{z^ 1, u) and F{z^ u) as polynomials in z with coefficients in t h e field of quotients of K[u] would give polynomials a{z) and f5{z) in z with coefficients in this field for which d{z) = a{z)Ti{z^ 1, u)-\-l3{z)F[z^ u) was a common factor of ^ i ( z , l,ti) and F{z^u), say ^ i ( z , l,ix) = d(z)qi{z) and F{z,u) — d{z)q2{z). There would be a polynomial A{u) in u with coefficients in R t h a t cleared the denominators in all three equations, say D{z^u) = A{z,u)J^i{z,l^u) -\- B{z^u)F{z,u), A{u)Ti{z,l^u) = D{z^u)Qi{z^u) and A{u)F[z^u) — D{z,u)Q2{z,u)j where deg^ D = degd. Since J^i{z^l,u) is irreducible, it would be a factor either of D{z, u) or of Qi{z^ u). It cannot be a factor of D ( z , w), because this would imply t h a t it was a factor of A{u)F{z^ u)^ contrary t o deg^ F < fiin = d e g ^ ^ i . Nor can it be a factor of Qi{z,u)^ because then D{z^u) would divide A(u) and therefore be independent of z, cont r a r y to D ( x + n ? / , it) =^ A{x^uy^u)Ti{x-^uy^l^u)-\-B{x+uy^u)F{x^uy^u) = 0 mod {(j)i{x,y),g{y)). Therefore, detM{u) ^ 0. Given an integer a, consider t h e homomorphism i from K[z\ to IC t h a t carries z to x -[- ay and carries elements of K t o themselves. Since L carries ha{z) = ^1(2^, 1, a) to J^i{x + a^, l , a ) , which represents t h e zero''" element of /C, L defines a homomorphism from K[z] m o d ha{z) to /C. T h e m a t r i x of coefficients of L relative to the basis x'^y^ of /C and the basis z^ (0 < 7 < / i i n ) of K[z] mod ha{z) is Af{a). If its determinant is nonzero, t h e n L is an isomorphism. In this case, because /C is a field, K[z] mod ha{z) is a field, which implies t h a t ha{z) is irreducible over K and therefore, by Gauss's lemma (see Essay 1.4), is irreducible over R. T h e degree of det J\f{u) is at most | / / i n ( / / i n — 1) < (//in)^ = ( d e g ^ i ) ^ , so det J\f{u) is zero for fewer t h a n ( d e g ^ i ) ^ integers a, and the lemma follows. Proof of the Iteration Theorem. Suppose t h a t h{z) = ha{z) = ^1(2:, 1, a), where a is chosen in such a way t h a t h is irreducible, and let )C be t h e root * If the rank of J\f{u) is fiin — 1, any nonzero row of the adjoint matrix J\f{uy oi J\f{u) is such a solution. Otherwise, choose an (r -h 1) x (r + 1) subsystem of the original fiin x /^in system whose rank r is the same as that of the original system. A nonzero row of the adjoint of the matrix of coefficients of the chosen subsystem, filled out with zeros, is a nontrivial solution of the original system. ^ In fact, according to the proposition of Essay 1.7, each coefficient of JFi (x+uy, 1, u) as a polynomial in u is zero mod {(j)i{x^y)^g{y)).
38
1 A Fundamental Theorem
field of h{z). It is to be shown that the factorization of f{x) mod h{z) contains more linear factors than does the factorization of f{x) mod g{y). In other words, it is to be shown that the root field of h{z) contains more roots of f{x) than does the root field of g{y). As was shown in the proof of the lemma, K[z] mod h{z) is isomorphic to /C, which is by definition K[x^y] mod {g{y)^ (j)i{x^ay^y)). Since this last field contains a root y of g{y)^ it contains a field isomorphic to K[y] mod g{y)^ so it certainly contains at least as many roots of f{x) as K[y] mod g{y) does. But f{x) = (t)i{x,y)(l)2{x,y) •'• (pkix, y) mod g{y) implies that f{x-^ay) = 0 mod {g{y), (pi{x-\-ay, y)), so /C contains a root of f{x)—namely, the element represented hy x-\- ay—that is not in the subfield corresponding to K[y] mod g{y) (because it is reduced mod {g{x)^(j)i{x + cty.y)) and contains x). Thus, f{x) has at least one more root in the new field than it did in the old, as was to be shown. Proof of the fundamental theorem. Given / ( x ) , start with g{y) = y and apply the following algorithm. If g{y) splits / ( x ) , the algorithm terminates. Otherwise, use the iteration theorem to construct h{z) such that the factorization of f{x) mod h{z) has more linear factors than does the factorization of f{x) mod g{y). Replace g{y) with h{z) and repeat. Since the number of linear factors of f{x) mod g{y) increases with each step and can never exceed d e g / , the algorithm must terminate after at most d e g / steps with a polynomial that splits f{x).
Essay 1.9 Minimal Splitting Polynomials
39
Essay 1.9 Minimal Splitting Polynomials T h e theorem of t h e preceding essay p u t s t h e statement "every polynomial has a splitting field" in a very specific a n d concrete form: Given a polynomial f{x) in one indeterminate with coefficients in R = Z[ci, C2, . . . , Cj^], t h e iterative algorithm t h a t proves t h e fundamental theorem in t h e last essay constructs a monic, irreducible polynomial in one indeterminate g{y), with coefficients in t h e same ring i?, with t h e property t h a t all factors of t h e factorization of f{x) m o d g{y) are linear in x. The splitting field of a polynomial, as opposed t o a splitting field, is t h e field generated by t h e roots. In other words, it is t h e field implicit in t h e assertion (see Essay 1.2) t h a t there is a valid way t o do rational computations with t h e roots of a polynomial. A specific and concrete description of the splitting field of f{x) is given by an amended version of t h e theorem of t h e preceding essay: T h e o r e m . Given a polynomial f{x) = aox'^ -h aix^~^ -h • • • -f a^ with coefficients in R, construct a monic, irreducible polynomial g{y) with coefficients in R that splits f{x) and is itself split by any polynomial that splits f{x). In particular, g{y) splits itself. Galois wrote,* ".. .every equation depends on an auxiliary equation with t h e property t h a t all t h e roots of this new equation are rational functions of one another," which is t o say t h a t t h e polynomial in t h e new equation splits itself. He went on t o write, " . . . this remark is a mere curiosity; in fact, an equation which has this property is not in general any easier to solve t h a n any other," b u t it is hard t o understand how Galois could call his observation a "mere curiosity," because, as Essay 2.1 will explain, his brilliant insight into t h e algebraic solution of equations is based on t h e existence of such an "auxiliary equation" and on t h e fact t h a t t h e solution of such an equation can be analyzed using t h e automorphisms of its splitting field. A polynomial t h a t splits itself is called a G a l o i s p o l y n o m i a l . Proof. T h e construction t h a t proved t h e theorem of t h e preceding essay in fact proves this stronger theorem, because the polynomial it constructs is split by any polynomial that splits f{x). Since any polynomial t h a t splits f{x) also splits t h e identity polynomial g{y) = y, t h e proof of this statement comes down t o proving t h e following statement: Let a monic, irreducible polynomial with coefficients in R split both f{x) and g{y); then it also splits any polynomial h{z) constructed by the iteration theorem of the preceding essay. Since h{z) has t h e form ^ i ( z , l , a ) for some integer a, it will suflB.ce t o prove t h a t any polynomial gi{v)—monic, irreducible, and with coeflBcients in R—that splits t h e monic, irreducible polynomials f{x) and g{y) also splits t h e polynomial J-{z, t, u) t h a t is constructed from f{x) and g{y) by t h e factorization algorithm in Essay 1.5. Quoted from my translation of Galois's memoir in Appendix 1 of [18].
40
1 A Fundamental Theorem
Let /C denote the root field ofgi{v). Since gi{v) splits / ( x ) , /C contains m = deg / distinct (because / is irreducible, it is relatively prime to its derivative, so it has no multiple roots) roots of / ; call them ai, a2, . . . , a^. Similarly, /C contains n = deg^ distinct roots of g; call them 61, 62, . . . , bn- That gi{v) splits J^{z^ t, ix) will be proved by proving that J-{z, t, u) = jT(^ — ciit — bju)^ where the product is over all mn pairs (i, j) in which 1 < i < m and I < j < n. The number mn of factors on the right is the degree of the homogeneous polynomial on the left, and they are distinct (to say that two polynomials of the form z — ait — bjU are equal means that their coefficients are equal, which occurs only when both i and j have the same values in them), so the formula will be proved if it is proved that each z — ait — bjU is a factor of T{z, t, u). In other words, what is to be shown is that T{ait + bjU^ t, u) — 0. To put it yet another way, the determinant of the vnn x mn matrix (a^t H- bju)Imn — tMx — uMy is to be shown to be zero for all pairs (i, j ) . Here M^ is by definition the mn x mn matrix of elements of R for which MxC = Cx mod {f{x),g{y)), where C is a column matrix of length mn whose entries are x^y^ for 0 < a < m, 0 < P < n. Thus, each of the mn entries of the column matrix MxC differs from the corresponding entry of Cx by a polynomial of the form (j){x^y)f{x) + il){x,y)g{y). Because a^ is a root of f{x) and bj is a root of g{y)^ it follows that MxCij and Cijai are equal as matrices whose entries are in /C, where Cij is C with a^ substituted for x and bj substituted for y. In the same way, MyCij = Cijbj. Therefore {{ait + bju)Imn — t^x — uMy)Cij = t{ailmn — Mx)Cij -\-u{bjImn " ^y)Cij = 0. Siucc 1 = a^b^ is one of the entries of Cij, the determinant of {ait -\- bju)Imn — tMx — uMy must be zero, as was to be shown. A polynomial that splits f{x) and is split by any other polynomial that splits f{x) is a minimal splitting polynomial of f{x). There are infinitely many minimal splitting polynomials of / ( x ) , but only one splitting field. In other words, the root fields of two minimal splitting polynomials are isomorphic, as follows from the fact that each polynomial splits the other. This observation is the key to the notion of the Galois group of f{x), which is introduced in the first essay of Part 2.
Topics in Algebra
Essay 2.1 Galois's F u n d a m e n t a l T h e o r e m Theoreme. Soit une equation donnee, dont a, h, c, . . . sont les m racines. II y aura toujours un groupe de permutations des lettres a, h, c, . . . qui jouira de la propriete suivante: 1° que toute fonction des racines, invariables par les substitutions de ce groupe, soit rationellement connue; 2° reciproquement, toute fonction des racines, determinable rationellement, soit invariable par ces substitutions.—E. Galois [27] (English translation [18, p. 104]) A Galois polynomial is a monic, irreducible polynomial that splits itself, and a Galois field is the root field of a Galois polynomial. Here the Galois polynomial, call it ^f, is assumed to have its coefficients in a ring of the form i^ = Z[ci, C2, . . . , c^y], the polynomials with integer coefficients in some set Ci, C2, . . . , Ciy of indeterminates, so the associated Galois field extends the field of quotients K of R, which is the field of rational functions in ci, C2, . . . , Cj^. As is explained in Essay 1.3, computations in the Galois field are done with expressions of the form p{y)/q^ where p{y) is a polynomial in y with coefficients in R whose degree is less than deg^f, and g is a nonzero element of R. Such an expression can also be regarded as a polynomial in y with coefficients in K, in which case the notation K[y] mod g{y) becomes a natural one for the root field of g{y). Because g splits itself, g{x) = HlLiC^ ~" P^iv)) ^ ^ d g{y)^ where n is the degree of g and pi{y), p2{y), • • •, pn{y) are elements of the field. The polynomials pi{y) represent distinct elements of the root field of g{y). When they are reduced mod g{y)^ they are determined by g{y). One of them is y. Substitution of one of the roots Pi{y) in place of y gives an automorphism of K[y] mod g{y). (Since g{pi{y)) = 0 mod g{y), (piy) = ^{y) mod g{y) implies (j){pi{y)) = "(pipiiy)) mod^(y), so substitution of Pi{y) for y gives a homomorphism of K[y] mod g{y) to itself. It is represented by an n x n matrix
42
2 Topics in Algebra
Fig. 2.1. Galois. of elements of K, so to prove that it is one-to-one and onto it will suffice to prove (j){pi{y)) = {) vnod g{y) only when (f){y) = 0 mod g{y). But if (j)(y) ^ 0 mod g{y)^ then (j){y) has a reciprocal mod g{y)^ so (pipiiy)) has a reciprocal mod g{y) and is therefore not zero mod g{y).) Conversely, since an automorphism of the field must carry the root ^ of ^ to another root of g^ there are precisely n automorphisms of K[y] mod g{y), and an automorphism is determined by the root Pi{y) of g to which it carries y. The group of these automorphisms is the Galois group of the field. More generally, the Galois group of a polynomial f{x) is the Galois group of a minimal splitting polynomial of f{x) (see Essay 1.9). The modern version of the fundamental theorem of Galois theory states that the subgroups of the Galois group of a given Galois polynomial g{y) correspond one-to-one to subfields of the Galois field K[y] mod g(y) that contain K. This is nearly Galois's statement of his Proposition 1. Galois was thinking of the field as being built up by a succession of what he called "adjunctions" (see Essay 2.3), and the main problem was to determine, after certain adjunctions had been made, which elements of the field could then be "determined rationally." He said (see above) that there is a subgroup of the group of automorphisms that leaves fixed the elements that can be determined rationally and leaves only these fixed. (He described the automorphisms in terms of the way that they permute the roots of some polynomial of which the Galois field is the splitting field. For him, the elements of the Galois field were rational functions of the roots, so an automorphism of the field was tantamount to the permutation of the roots that it effected.) In more modern terminology, he was saying that the subfield generated by the adjoined elements xi, X2, . . . ,
Essay 2.1 Galois's Fundamental Theorem
43
Xm contains exactly the elements t h a t are left fixed by the automorphisms t h a t leave all of the x's fixed: G a l o i s ' s T h e o r e m . Let xi, X2, .., Xm be elements of a Galois field K[y] mod g{y). The obvious necessary condition for another element z of the field to be expressible as a polynomial in xi, X2, . . . ; Xm with coefficients in K—namely, that z be unmoved by any automorphism of the field that leaves each of xi, X2, . •, Xm unmoved—is also sufficient. Proof Suppose first t h a t xi, X2^ .. •, Xm are all in K, or, what is eff'ectively the same, t h a t m = 0. T h e n all automorphisms leave t h e x's unmoved, and what is to be shown is t h a t all automorphisms leave z unmoved only if z is in K. Let z be expressed as a polynomial in y of degree less t h a n n = d e g ^ with coefl^icients in K^ say z{y) = aiy^~^ -\- a2y^~^ + • • • + a^. Consider t h e polynomial C{X) = aiX^~^ + a2X^~'^ -\ \- a^ — z{y), a polynomial in t h e indeterminate X with coefficients in the Galois field. (All coefficients but t h e constant t e r m an — z{y) are in the smaller field K.)To say t h a t substitution of any root pi{y) in place of ^ in z{y) does not change z{y) mod g{y) is to say t h a t ai{pi{y)Y-^ + a2{Pi{y)T-'' + • • • + a^ - z{y) = z{pi{y)) - z{y) = 0 mod g{y). In other words, each Pi{y) is a root of C{X) in t h e Galois field. Since the degree of C(-^) is less t h a n n, the fact t h a t it has n distinct roots in the root field of g{y) (that is, n distinct linear factors X — Pi{y)) implies* t h a t it is zero. In particular, its constant t e r m a^ — z{y) must be zero, so z{y) = a^ is in i^, as was to be shown. Suppose next t h a t m = 1, and let x{y) denote the one given field element. Let t h e list of images x{pi{y)) of x{y) under t h e Galois group consist of cr distinct field elements, each occurring r = n/a times, and let 0 ( X ) = n ( - ^ ~ ^{pi{y))) be the polynomial of degree a in the indeterminate X with coefficients in the Galois field obtained by taking the product of the distinct factors X — x{pi{y)). For any j = 1, 2, . . . , n, changing y to pj{y) in (j){X) merely permutes the factors and does not change (j){X). Therefore, each coefficient oi (j){X) is unchanged by t h e automorphisms in t h e Galois group, so, by t h e case m = 0 t h a t has already been proved, 0 ( X ) is a polynomial with coefficients in K. Therefore, an element ao in R can be found for which aQ(j){X) has coefficients in R. If x{y) is replaced by aQx{y), the new x{y) is a root of t h e monic polynomial aQ~'^(/)(X/ao), and an element of the Galois field can be expressed as a polynomial in t h e old x{y) with coefficients in K if and only if it can be expressed as a polynomial in the new one with coefficients in K. Therefore, one can assume without loss of generality t h a t (/)(X) is monic in X with coefficients in R. It is irreducible, because a monic factor of (/)(X) = J J ( X — x{pi{y))) over iC is a product of some subset of its factors X — x{pi{y)) over t h e Galois field, so, if it is not 1, it has at least one x{pi{y)) as a root, which implies t h a t it has all x{pi{y)) as roots (because an automorphism carries roots to roots, and t h e automorphisms act * See the first footnote of Essay 1.4.
44
2 Topics in Algebra
transitively on the Pi{y)) and is therefore 0 ( X ) itself. If g{Y) is the Galois polynomial t h a t defines the field, the statement t h a t (j){X) has a = deg(/) roots in the Galois field is the statement t h a t g(Y) splits 0 ( X ) . Therefore, by the Kronecker-Kneser theorem,* t h e factorization of g{Y) mod <j){X) consists of G factors, each of degree r = n/cr, say g{Y) = W ^liY^ X) mod (j){X)^ where each ^i is a polynomial in two indeterminates with coefficients in K. Since (j){x{y)) = O m o d ^ ( ^ ) , g{Y) = Y\^i(X-,^{y)) mod ^(?/) (the difference of g{Y) and ^^^^^(y, X ) is a multiple of 0 ( X ) so it is a polynomial in X and Y in which the substitution of x{y) for X gives a polynomial in y and y t h a t is zero mod g{y))^ so each ^i{Y^x{y)) has precisely r distinct roots /?i(^) m o d g{y)^ and t h e roots of ^ mod g{y) are partitioned in this way into a sets of r each. Let lZ^i(y, X) be the factor for which l^i(i/, x(y)) = 0 mod g{y). Suppose now t h a t z{y) is unchanged by all automorphisms y H^ pi{y) t h a t leave x{y) unmoved; i.e., z{pi{y)) = z{y) uvod g{y) for every z for which x{pi{y)) = x(y) laod g{y). Division of z{Y) by ^liY^X)—where capital letters are used to emphasize t h a t the division is division of a polynomial in Y with coefficients in i^ by a monic polynomial in Y with coefficients in K[X] and has nothing to do with operations in the Galois field—gives an equation z(Y) = q{Y^ X)^i(Y^ X) + r(Y^ X ) , where the degree of the remainder r ( y , X ) in Y is less t h a n r . Since ^i{pi{y)^x{y)) = 0 mod g{y) for each of the T values of i for which x{pi{y)) = x{y) vaod g{y) (because the automorphism y h-> pi{y) carries ^i{y^x{y)) mod g{y) to ^i{pi{y),x{y)) and y^i{y,x{y)) = 0 mod g{y) by the definition of lZ^i(F, X ) ) , and since by assumption z{pi{y)) = z{y) mod g{y) for each of them, r{pi{y)^x{y)) is the same element of t h e Galois field for each of r distinct values of z, which is to say t h a t r{Y,x{y)), as a polynomial in Y with coefficients in the Galois field, has the same value z{y) for r distinct values Pi{y) of Y. Because the degree of r in y is less t h a n r , the argument given in the case m = 0 shows t h a t r{Y,x{y)) — z{y) is t h e zero polynomial (in Y with coefficients in the Galois field), which gives the required expression z{y) = r(0,x(i/)) of z{y) as a polynomial in x{y) with coefficients in K. Finally, t h e general case follows from t h e case ?7i = 1 just proved once one proves t h e lemma below, because a polynomial in uiXi -\- U2X2 + • • • + UmXm, where ui, U2, . . . , Um are integers, can obviously be expressed as a polynomial in X i , X2, . . . , Xrn-
L e m m a ( T h e o r e m o f t h e p r i m i t i v e e l e m e n t ) . Let xi, X2, ..., Xm he elements of a Galois field K[y] mod g{y). Construct integers ui, U2, ..., Um for which the automorphisms of the Galois field that leave all of xi, X2, . • . ; Xm unmoved coincide with the automorphisms that leave x = uiXi -\- U2X2 + • • • + UmXm unmoved. Proof. Consider first t h e case m — 2. Let u be the number of automorphisms y "^ Pi{y) foi" which xi{pi{y)) ^ xi{y). For each of these v automorphisms, * See Essay 1.7.
Essay 2.1 Galois's Fundamental Theorem
45
let Zi be the element ^^1^ 7?? f x of the Galois field, and let u be an integer that is not equal to any such Zi. (The number of ^'s is at most n — 1, so there is sure to be such an integer u among 1, 2, . . . , n.) Then x — uxi ^ X2 has the required property, because an automorphism that does not move x cannot move xi (by the choice of li, u - xi{pi{y)) -^ X2{pi{y)) 7^ u-xi{y) •}-X2{y) when xi{pi{y)) 7^ xi{y)) ^nd therefore cannot move X2 (because u • Xi{pi{y)) + X2{pi{y)) = u ' xi{y) ^ X2{y) and Xi{pi{y)) = xi{y) imply X2(pi(^)) = X2(i/)). If the lemma is true for m, it is true for TTI + 1, because one can use the inductive hypothesis first to find integers i^i, U2, . . . , Um such that the only automorphisms that leave uiXi -^ U2X2 -\- • - - -\- UmXm unmoved also leave all of xi, X2, . . . , Xm unmoved, and then use the case m = 2 to find integers Ui and U2 such that the only automorphisms that leave Ui(uiXi + U2X2 + h Um^m) + U2Xm+i uumovcd Icavc both uiXi + U2X2 4- • • • + UmXm and x^+i unmoved and therefore leave all x's unmoved.
46
2 Topics in Algebra
Essay 2.2 Algebraic Quantities . . . the deep meaning of Kronecker^s view, according to which the absolutely algebraic fields [finite fields or algebraic number fields of finite degree] are the natural ground-fields of algebraic geometry, at any rate as long as purely algebraic methods are being used.—Andre Weil [62] Kronecker asserted, in substance, in §2 of his treatise Grundziige einer arithmetischen Theorie der algebraischen Grossen [39] t h a t the field of rational functions in any finite set of algebraic quantities is isomorphic to a root field as that term is defined in Essay 1.3. Because the t e r m "algebraic quantity" is vague, this is not an assertion t h a t can be proved. However, it can be deduced from a few n a t u r a l assumptions about "algebraic quantities" as follows. Suppose first t h a t just one "algebraic quantity" q is involved. For any polynomial F{X) with integer coefficients, F{q) should be a meaningful algebraic quantity, because one must surely be able to add, subtract, and multiply algebraic quantities. Moreover, one should be able to determine when two such polynomials in q have the same value, or, what is the same, able to determine which such polynomials in q are zero. If only the zero polynomial F[X) satisfies F{q) — 0, t h e n the field of rational functions in q is simply the field of rational functions in a single indeterminate, which is the root field of the polynomial y — ci with coefficients in Z[ci]. Otherwise, there is an irreducible polynomial F{X) with integer coefficients for which F{q) = 0, provided one makes the n a t u r a l assumption t h a t a product of "algebraic quantities" can be zero only when one of the factors is zero. (Of course, F{q) = 0 implies t h a t F is not a unit.) Let F{q) = a^q^ + aiq^~^ + • • • + a^i be zero, where t h e coefficients ai are integers and F{y) is irreducible, and let / be the monic polynomial with integer coefficients defined by f{y) = a^~^F{y/a^)). Then, because rational functions of q are rational functions of a^q and conversely, and because ao^ is a root of / , t h e field of rational functions in q is isomorphic to the root field of / ( ^ ) , which completes the "proof" of Kronecker's assertion in the case of a single algebraic quantity. Suppose now t h a t t h e assertion is true for a set gi, ^^2, • • •, ^m of ^ algebraic quantities and let an ( m - h l ) s t algebraic quantity qm+i be given. Let Q and QQ denote the fields of rational functions in gi, ^^2, • • •, ^m+i and in gi, ^2, • • •, ^m, respectively. By the inductive hypothesis, QQ is isomorphic to t h e root field of some monic, irreducible polynomial g{y) with coefficients in Z[ci, r!2, •. •, c^] for some u. An element of i? can be expressed as a quotient of polynomials in qm+i with coefficients in QQ. A S before, there are two cases, depending on whether there is a nonzero polynomial F{X) with coefficients in QQ for which F{qm^i) = 0. If not, Q is the field of quotients of the ring Z[ci, C2, . . . , Cj^^qm^i] m o d ^ ( ^ ) , which is t h e root field of g{y) when it is regarded as a polynomial with coefficients in Z[ci, C2, . . . , c^^+i] and c^^^i is identified with qm+i- If so, t h e n qm+i is a root of a polynomial with coefficients in the root
Essay 2.2 Algebraic Quantities
47
field of g{y)^ say F{q,y) = 0, where F is a polynomial in two indeterminates with coefficients in Z[ci, C2, . . . , Ci^] and y is a root of g{y) in a splitting field of g; then g is a root of J^{X) = H i L i -^(-^^ yi)-) where n is t h e degree of g and the yi are the roots of g in the splitting field, so t h a t T{X) has coefficients t h a t are symmetric polynomials in T/I, 2/2,---i^n and are therefore in Z[ci, C2, . . . , Ci^]. T h e given field Q is then isomorphic to a subfield of the splitting field of g{X)T{X), namely, the subfield obtained by adjoining first a root y of g and t h e n a root q of F{X,y). By the theorem of the primitive element, this field is the root field of a monic, irreducible polynomial with coefficients in Z[ci, C2, . . . , Ci^]. In either case, then, i? is a root field, as was to be shown. The definition of an "algebraic quantity" is problematic, because algebraic quantities by their very n a t u r e do not exist in isolation; they are "things on which rational computations can be performed," and therefore are items in entire systems of computation, which is to say, elements of entire fields. All in all, it seems best to adopt Kronecker's later view (see Essay 1.1) and to abandon t h e notion of algebraic quantities in favor of a formulation of t h e subject in terms of "general arithmetic" and to make t h e above assertion a definition: An a l g e b r a i c field is a field t h a t can be described as the field of quotients of an integral domain of the form Z[ci, C2, . . . , c^] mod F , where F is a nonconstant irreducible element of Z[ci, C2, . . . , c^y]. (If F is constant and irreducible, this field of quotients is the field of rational functions in ci, C2, . . . , Cjy with coefficients in t h e field with p elements for some prime p, a field t h a t does not really seem to merit the name "algebraic field." T h e field of rational functions in ci, C2, . . . , Cjy with integer coefficients is an algebraic field; for example, it is the field of quotients of Z[ci, C2, . • . , c^, Cj^-\-i] mod c^y+i.) Note t h a t there is no stipulation t h a t the irreducible polynomial be monic in one of its indeterminates. Such a stipulation would involve the indeterminates asymmetrically. As was seen above, one can adjoin a root of a polynomial F{X) = aoX'^ + aiX^~^ + • • • + a^ by adjoining a root of t h e monic polynomial f{X) = aQ~^F{X/ao), from which it follows easily t h a t every algebraic field can be presented as the root field of an irreducible element of Z [ci, C2, . . . , Ciy] t h a t is monic and of positive degree in Ci for some i. A set of elements i^i, 1^2, • • •, Uk of an algebraic field is a l g e b r a i c a l l y i n d e p e n d e n t if no nonzero polynomial (j) in k indeterminates with integer coefficients satisfies 0(iii, U2, . . . , Uk) = 0. If t h e polynomial F t h a t determines an algebraic field involves c^^, t h e n the indeterminates ci, C2, . . . , Cj^-i represent algebraically independent elements of t h e algebraic field. (The construction of this field can be described as the adjunction of a root of a monic irreducible polynomial t o the field of rational functions of ci, C2, . . . , Cjy_i.) Therefore, such an algebraic field always contains a set of z/ — 1 algebraically independent elements. T h e t r a n s c e n d e n c e d e g r e e of an algebraic field is t h e m a x i m u m number of elements in an algebraically independent subset. T h e following proposition implies t h a t an algebraic field defined by some irreducible F in Z[ci, C2, . . . , Cj/l has transcendence degree u — 1:
48
2 Topics in Algebra
P r o p o s i t i o n . Let a nonconstant irreducible element F OJTA\C\, C^, -.., c^\ he given. Assume that F involves c^ and let u he an element of the algehraic field F determines. For a given numher I < v, one can determine whether the elements Ci, 02, . •., ci, u are algebraically independent, and if they are, one can describe the algebraic field as being determined by an irreducible element Fi ofZ[di, d2, . . . ; dj^], where the first I + 1 indeterminates di, d2, ..., di-^i are identified with ci, C2, ..., ci^u. Proof. Assume without loss of generality t h a t F is monic in Cy. Every element of the algebraic field can be written in exactly one way in t h e form Yl,i=i Vii^i^ C2, . . . , Ci^_i)c^~% where N is the degree of F in Cj^ and the rji{ci, C2, . . . , Cj^-i) are rational functions in the first v — 1 indeterminates. W h e n the N-\-l elements l^u^v?., . . . , u^ of the field are written in this form, one can construct a linear dependence of these elements of the field over t h e field of rational functions in ci, C2, . . . , c ^ - i , and from this one can construct a polynomial in u indeterminates with integer coefficients in which substitution of ci, C2, . . . , Cjy_i, 16, regarded as elements of the given root field, results in zero. One of the irreducible factors of this polynomial, call it G, must have t h e same property. This G is determined, u p to sign, by u. Since Ci, C2, . . . , c^, li are algebraically independent if and only if at least one of t h e indeterminates Q+i, Q+2? • • •, Cy-i occurs in G, what is to be shown is t h a t when this is t h e case, the given algebraic field can be described as stated in the proposition. Suppose Ch occurs in G for some h> I. Assume without loss of generality t h a t h — u — 1. T h e field of quotients of Z[ii, ci, C2, . . . , Cy-i] mod G is an algebraic field t h a t can be identified with a subfield of t h e given algebraic field. It can also be described as the field obtained by adjoining Cy-i to t h e field of rational functions in li, ci, C2, . . . , Cy-2' Since t h e given algebraic field can then be obtained by adjoining Cy t o this field, the desired conclusion follows from the theorem of the primitive element, which implies t h a t the given algebraic field, which can be obtained by two successive adjunctions to t h e field of rational functions in tx, ci, C2, . . . , Cy-2-> can be obtained by a single adjunction. Thus, given k algebraically independent elements of an algebraic field, one can successively alter t h e presentation of t h e field so t h a t the first k indeterminates of the polynomial t h a t describes it represent these k field elements. In particular, because t h e v indeterminates of a defining relation do satisfy an algebraic relation, k
Essay 2.3 Adjunctions and the Factorization of Polynomials
49
Essay 2.3 Adjunctions and t h e Factorization of Polynomials Cela pose, nous appellerons rationelle toute quantite qui s'exprimera en fonction rationnelle des coefficients de Vequation et d^un certain nombre de quantites adjointes a Vequation et convenues arbitrairement.—E. Galois, [27] (English translation, [18, p. 101]) Loosely speaking, the assertion of the preceding essay states t h a t any algebraic computation can be regarded as taking place inside the root field of some polynomial. Since t h e theorem of P a r t 1 implies t h a t every such field is a subfield of a Galois field—the root field of a Galois polynomial—every algebraic computation can be regarded as taking place inside a Galois field. For example, the factorization of f{x) mod g{y), where / and g are monic and irreducible, can be described, now t h a t the theorem of P a r t 1 and Galois's fundamental theorem have been proved, in the following way: In a Galois field in which fg splits, adjoin to* K a root 6 of ^ to obtain a subfield K{b) of the Galois field t h a t contains a root of ^. T h e factorization problem is to determine the irreducible factors of / when elements ofK{b) are p e r m i t t e d as coefficients. Over the Galois field, f{x) is a product of linear factors, say f{x) = f K ^ ~" Oi). Because f{x) is irreducible, it is relatively prime to its derivative, which implies t h a t the roots a^ of f{x) are distinct. T h e automorphisms of t h e Galois field t h a t leave b unmoved partition these roots into orbits, two roots being in the same orbit if and only if there is an automorphism t h a t carries one to the other without moving b. Thus, f{x) = Yl (f^ji^)^ where t h e factors (l)j{x) on the right are t h e products of the factors x — ai over all roots ai in one orbit. Each factor (t)j [x) of f{x) found in this way is unchanged by t h e automorphisms t h a t leave b fixed—such automorphisms merely p e r m u t e t h e factors of 0 j ( x ) — s o by Galois's theorem each 0 j ( x ) can be expressed in t h e form (j)j{x,b)^ where 0 j is a polynomial in two indeterminates with coefficients in K t h a t is monic in X. Each (f)j{x,b) is irreducible over K{b)^ because any monic factor other t h a n 1 over K{b) must be divisible by at least one of t h e monic factors x — ai of 0 j ( x , b) over K and therefore must, by the definition of 0 j ( x , 6), be divisible by all such factors, which implies t h a t it is divisible by (j)j{x^b) (because its linear factors are distinct). In conclusion, f{x) — O ^ j C ^ ' ^ ) ^^ ^^^ unique factorization of f{x) into monic factors irreducible over K{\)). Similarly, t h e factorization T{z^ t, u) — W{z — ait — bjU)., where the product is over all vnn pairs (a^, bj) in which ai is a root of / and bj is a root of ^ in a splitting field for fg (see Essay 1.9), implies t h a t t h e factorization of T into factors irreducible over R is obtained by grouping^ together factors z—ait—bjU t h a t are in the same orbit under the action of the Galois group. T h e Galois * As before, K is the field of quotients of the ring i^ = Z[ci, C2, . . . , Ci/] in which / and g have their coefficients. ^ Here the notion of "grouping" is very close to Galois's original use of the word "group" in a similar context.
50
2 Topics in Algebra
group acts transitively on the bj (because g is irreducible), and the a^ for which z — ait — bjU are in a given orbit for any one bj are, as was just shown, the roots Gi of one of the irreducible factors (/)fc(a:, bj) of f{x) when bj is adjoined. From this it follows that the factorization f{x) = Yl(j)k{x^y) mod g{y) implies that the factorization ^(2:, t^u) = Yl ^k{z^ t, u) of J^ into factors irreducible over R is found by defining the factors Tk{z, t, u) to be Y\{z — a^t — bju), where, for a given /c, the product is over all roots bj of g and, for each 6j, over all roots a^ of / for which (l)k{cii, bj) = 0. Thus, the degree of ^^ is /i/gn, where /ik = deg^, 0^. Moreover, J^k{x + uy^ l,w) = Y\{{x — ai) -f u{y — bj)) when the product is over all /i^n pairs (a^, bj) for which (/)k{cii^ bj) = 0. When Tkix + uy, l,u) is expanded as a polynomial in u whose coefficients are polynomials in x and y with coefficients in R, the terms of degree greater than fikU — n m. u are zero mod g{y)^ because, as is clear from the product representation, it is a sum of terms, each of which contains all n factors y — bj of g{y). (The portion x — ai of fewer than n factors is used in forming the term, so all distinct portions u{y — bj) are used at least once.) By the same token, the coefficient '0fc(x,y) of u^k(n-i) ^^ J^j^[x -h uy^ 1, u) (in the notation of Essay 1.5) contains only n terms that are nonzero mod g{y); explicitly,
^k{x,^) = XI^^'^^'^^'^ ( _/, )
^^^9{y)-
Therefore, ^l^ki^^y) has degree jj^k in x and its leading coefficient is Mfc
Y.(f^)'-^iY:m ^.'(.r.-„„,. (The first step follows from / _^.)( _ij ) = 0 mod g{y) when j 7^ /c, and the second follows from the observation that ^ ^ ^ has degree n — 1 and agrees with g^{y) when y = 6^-.) Similarly, JF(x + uy, 1, li) = f{x)g'{y)^u'^^^~^^ -\ mod g{y), which implies f{x)g'{y)'^ = Ylipk{x,y) mod g{y). By unique factorization mod g{y), it follows that each ipki'X^y) is of the form g'{y)^^(f)i{x^y) mod g{y) for some /. That / = k follows from the observation that if (ai^bj) is a pair for which (j)i{ai^bj) = 0, then substitution of {ai^bj) for (x, y) in %ljk{x, y) = YTL^I ^k{x, b,) [J^J mod g{y) gives 0 when k = I, so ipi{x,y) cannot divide (t)i{x,y) mod g{y) unless k = I. Therefore, ipk{x,y) = g\y)^^'^(j)k{x^ y) mod g{y)^ as the algorithm of Essay 1.5 asserts. Galois theory can be used to describe computations in a subfield K{ai^ 0^25 • • • 5 <^n) of a Galois field in the following way: First, if /ii is the number of distinct images of a i under the Galois group, then the product of the linear polynomials x — Sai over all distinct images Sai oi ai under the Galois group is a monic polynomial in x with coefficients in K that is irreducible over K by the argument above. Call it fi{x). Then fi{ai) = 0 provides a relation
Essay 2.3 Adjunctions and the Factorization of Polynomials
51
t h a t can be used to replace any element of the Galois field expressed as a polynomial in a i with coefficients in K^ say '0(Q;I), by another expression of t h e same element of the same form in which the degree of the polynomial is less t h a n /xi; one has only to divide ip{ai) by / i ( a i ) regarded as a monic polynomial with coefficients in K to find '0(Q;I) = 9(Q^I)/I(Q^I) + r(o^i) and t h e n to note t h a t '?/^(Q;I) = r{ai) as elements of the Galois field.* In this way, the relation fi{ai) = 0 can be used to find the unique representation of any element of K{ai) as a polynomial in a i with coefficients in K of degree less than 111. Similarly, if /i2 is the number of distinct images of 0^2 under the elements of t h e Galois group t h a t leave a i unmoved, the product of the /X2 distinct linear polynomials of the form x — Sa2, where Sa2 is t h e image of 0^2 under an element S of the Galois group t h a t leaves ai unmoved, is a monic polynomial f2{oLi^x) of degree 112 with coefficients in the field K[ai) t h a t is irreducible over this field and t h a t satisfies /2(0^1,0^2) = 0- Using the relation / 2 ( a i , 0^2) = 0 one can (division with remainder by a monic polynomial) find, for any polynomial in a i and a2 with coefficients in K , another polynomial representing the same element of K{ai.,a2) whose degree in a2 is less t h a n Ii2' By the irreducibility of / 2 , t h e only way t h a t a polynomial in ai and a2 of degree less t h a n 112 in a2 can be zero is for the coefficient of each power of a2 to be zero. Division by / I ( Q ; I ) to reduce the degree in ai does not increase t h e degree in 0^2 and proves t h a t each element of K{ai^a2) is represented by one and only one polynomial in Q;I and (X2 with coefficients in K whose degree in ai is less than /ii and whose degree in 0^2 is less than /i2- Continuation of this process leads to the following description of t h e Galois field: P r o p o s i t i o n . Given elements a\, a2, .. -, otn of a Galois field K[y] mod g{y), and given an element f3 of this Galois field that is unmoved by the elements of the Galois group that leave all of a\, a2, .. -, otn unmoved, express (3 as a polynomial in ai, 0L2, • -, OLn with coefficients K whose degree in ai for each i is less than the number of distinct images of ai under elements of the Galois group that leave all of ai, a2, • • •, oii-i unmoved. This polynomial is determined by (3. It will be called the representation in c a n o n i c a l f o r m of (3 as an element of the sub field K{ai, a2, . • . , otn) of the Galois field generated by a\, a2, • •., 01^ over K. Computations in K{a\., a 2 , . . . , 01^) can be done by dealing with polynomials in canonical form; addition is the usual addition of polynomials, while multiplication is t h e usual multiplication of polynomials followed by reduction to canonical form. T h e reduction of a polynomial to canonical form uses n relations fi{ai) = 0, / 2 ( Q ^ I , « 2 ) = 0, . . . , / n ( a ; i , 0^2, . . . , a ^ ) = 0 t h a t will be called a d j u n c t i o n r e l a t i o n s . T h e relation fi = 0 can be described either as a f ' = (j)i{ai^ a2, ..., cxi), where (piiai^ a 2 , • • • ? <^i) is the expression of a f ' in canonical form, or as t h e statement t h a t x = a^ is a root of t h e * Alternatively, one can iteratively replace a^^ with a^^ — (/)(ai) until the degree is less than /ii = degV^.
52
2 Topics in Algebra
polynomial IK^ ~" '^^i)^ where the product is over all distinct images of ai under elements S of the Galois group that leave a i , a2, . . . , o^i-i fixed and where the coefficients of this polynomial are written in canonical form. The adjunction relations are naturally used in reverse order—that is, /n = 0 is used to reduce the degree in a^, then fn-i = 0 is used to reduce the degree in a^-i without increasing the degree in a^, then fn-2 = 0 is used to reduce the degree in an-2 without increasing the degree in either a^ or Qn-i? and so forth, to end with a polynomial in canonical form. The theorem of the primitive element (Essay 2.1) implies, of course, that the field K{ai, a2, . . . , c^n) described in this way can be described by a single adjunction K{(3) with a single adjunction relation f{P) = 0. However, a construction of a field by a number of simple adjunctions may be preferable to a single adjunction, because it may describe the field more simply. For example, the classical question of whether a given equation can be solved by radicals simply asks whether a splitting field for a given a polynomial f{x) can be described by adjunction relations of the special form af' = 0i(ai, 0:2, . . . , ai-i) in which the right side does not involve ai. Example 1. The splitting field of /(x) = x^ — x'^ — 1. This polynomial is irreducible over Z, because a factorization would have the form (x^ + Ax + l)(x2 + 5 x - 1), and ^ + 5 = 0, - 1 + AB + 1 = - 1 , and - ^ + 5 = 0 would all hold. The factorization of f{x) mod f{y) can be found by the elementary calculation x^ a : 2 - -1 =EX4 - x 2 -y' + y2 ^{x 2 - y 2 ) ( ^ 2 ^ ^ 2 ) _ ( x 2 - -y') {x - y){x ^ y){x'^ Thus, adjunction of a root a :' + y'- - 1 ) mod {y' -y'of f{x) to Q gives f{x) either 2 or 4 roots, depending on whether x^ + a^ — 1 splits over Q(a). If one assumes that f{x) is not a Galois polynomial—which is to say that x^ + i/^ — 1 is irreducible mod y^ — y'^ — 1—this factorization of f{x) mod f{y) implies that the adjunction relations - ! ) •
a^ = a^ + 1, b = —a, 2 c = 11 - a 2 , d = —c, describe the splitting field. These relations show that the permutation (ab) is in the Galois group, because they easily imply the relations b^ = 6"^ + 1, a = —6, c^ = 1 — 6^, d = —c that result when a and b are interchanged and c and d are unmoved. Similarly, the four-cycle (acbd) is in the Galois group because the adjunction relations also imply all the relations c^ = c^ + 1, (i = —c, 6^ = 1 — c^, a = —6 obtained when the roots of f{x) in the splitting field are permuted in this way. These two permutations generate a group of 8 motions (a dihedral group). Since the field described by the adjunction relations obviously has degree 8 over Q, these 8 motions account for the entire Galois group.
Essay 2.3 Adjunctions and the Factorization of Polynomials
53
As for the proof that f{x) is not a Galois polynomial—which comes down to the statement that 1 — a^ is not a square in the field Q(a) obtained by adjoining a root of a^ — a^ — 1 to the rationals—the means to do it are given by the algorithms of Part 1, but the computations they require are not easily done with pencil and paper. As is shown in Essay 1.6, x'^ -\-y^ — 1 is irreducible mod y^ — y'^ — 1 \i and only if the determinant of {zl/^ — UGY -\- G^ — I4 is irreducible in Z[z,u\, where G is the 4 x 4 matrix whose first 3 rows are the last 3 rows of I4 and whose last row is 1, 0, 1, 0. This determinant, call it JS(^, 1, u), is z^ + (-2i/2 - 2)z^ -h (-u^ + 16^/2 - 1)^4 _^ ^2u^ _ i2u^ _ y2^2 _^ 2)z^ -h {y? H- 6^^ + \\u^ + ^u^ + 1). It is irreducible because J^3(^, 1, 2) = z^ 10z^-\-47z'^ — llOz^ + 841 is in fact irreducible. (The proof can be accomplished using the primitive methods of Essay 1.4, but of course a computer algebra package will find the answer much more quickly.) Therefore, the algorithms of Part 1 lead to the conclusion that ^3(^, 1,2) is a minimal splitting polynomial ofx^-x^-1. An easier method of proving that f{x) is not a Galois polynomial using an altogether different method is to observe that f{x) has the real root
'1 + V5 so that Q(a) can be embedded in the field of real numbers; relative to this embedding, 1 — a^ is a negative number, so it is not a square in Q(a). Once the adjunction relations are known, the computation of ^^3(2;, 1,2) can be accomplished as follows: This polynomial is the polynomial of which aH-2c and its conjugates—a set of 8 distinct elements of the splitting field—are the roots. Therefore, it is the product of the eight conjugates of ^ —a —2c under the Galois group. The product of this linear polynomial and its conjugate z — c — 2a under {ac){bd) is z'^ — 3(a -h c)z + bac + 2. The motion {ah){cd) carries 2^ — a — 2c to 2^ + a + 2c and 2; — c — 2a to z + c + 26 and their product to z^ + 3(a + c)^; + bac + 2; thus, the product of all four factors is z^-f-(10ac+4-9(a+c)2)z2_^(^5^^_l_2)2 = ^4_(^5^3^)^2_2i_^20i, where use is made of the identity a^(? = a^(l — a^) — —a'^-^a^ = —1 to write i for ac. Since {ah) carries i to — i, the product of all 8 conjugates is therefore the norm of z"^ - (5 + 8i)z2 - 2 1 + 20i, which is the polynomial z^ - 10z^+47z^ -110^^ + 841 found above. The explicit factorization oix^ — x'^ — 1 in the field Q\z\ mod {z^ — lOz^ -f 4:1 z^ — 1102:^ + 841) can be found using a method described by Galois (see [18, §37]). Because ( X - 6 ) ( X - c ) ( X - ( i ) = ( X 4 - X 2 - l ) / ( X - a ) = X 3 + aX2 + (a^ — 1)X -\- {a^ — a)^ a polynomial relation between a and t = a + 2c is given byO = ( t - a - 2 c ) ( t - a - 2 6 ) ( t - a - 2 6 / ) = 8 ( ^ - 6 ) ( ^ - c) [ ^ - d) = 8 {{^f + « ( V ) ' + (^' - 1) V + a^ - a) = ( t - a ) 3 + 2 a ( t - a ) 2 + 4 ( a 2 l)(t - a) + 8(a^ - a) = ba^ + 'Ma^ - {t^ + 4)a + t^ - U. In other words, a is a root of the polynomial 5^^ + ZtV^ - (t^ + 4 ) r + t^ - 4t in Y with
54
2 Topics in Algebra
coefficients in the splitting field. Since it is also a root of y ^ — F^ — 1, it is a root of the greatest common divisor of these two polynomials, which can be found using the Euclidean algorithm. Explicitly, if A — Y^ — Y'^ — \ and B = 5y3 + 3ty2 _ (t2 + 4 ) y + t^ _4t, then a is a root of A,B,C = yB-5A = 3ty3 _ (t2 _ i)y2 _^ (^3 _ 4^)y ^^^ D = 3tB-5C = {Ut^ - 5)Y^ - {St^ St)Y + {3t^ - 12^2 -25), E^ {3tYD - {Ut^ - 5)C) /5 = {-2t^ + ^^ + l)Y^ + (-t^H-5t^-19t)y-14t2 + 5, and F = ((-2t^ + 1 ^ + 1)D - (Mt^ - 5)E) /3t = (lOt^ - 33^4 + 97^2 - 29)y + {-2f + 9t^ -f 79t^ - 59t). Thus, a is expressed rationally in terms of t as 2^^ - 9t^ - 79t^ + 59t 10^6-33^4 + 9 7 ^ 2 - 2 9 ' and so are b — —a, c = ^ ^ , and d = —c. The explicit splitting is therefore 4 ^
2 ^ ^
.
/
2f -9t^ - 79t^ + 59t \ / 2t^ - 9t^ - 79t^ + 59t ^TTT^i :::rT^ ^77 h ^ + 10t6 - 33^4 + 97^2 - 29y V 10^^ " 33^^ + 97^2 - 29 Af - 12t^ + SSt^ - Ut\ / 4:f ~ 12t^ + 88t^ - 44t ^ ' ^ ~ 10^6 - 33t4 + 97t2 - 29/ V ^ 10^6 _ 33^4 _^ 97^2 _ 29
1 = U ^ — TTT-^
mod(t^ - lOt^ + 47t^ - 110^2 + 841). To express the four roots as polynomials in t with rational coefficients, one must 'rationalize the denominator' lOt^ — 33^^ + 97t^ — 29, which is simple in theory but lies beyond the range of hand computation. Doing the algebra on a computer (I used Maple), one can obtain (674t^ - 6363t^ - 7501^^ + 179117)(10t^ - 33^"^ + 97^^ - 29) = (6740t^ - 18472^2 - 301153)(t^ - 10^^ + 47t^ - llOt^ + 841) + 248075280. Multiplication of numerator and denominator of a by 674^^ —6363^'^ —7501t"^ + 179117 and simplification then gives 7f + 220^^ - 1846t^ + 9003t 18966 Because c = ^ ^ , the factorization 2^ X 18966^(x^ -x^
then follows easily.
-1)
= (18966X - {if + 220t^ - 1846t^ + 9003t)) x(18966x + {7f + 220t^ - 1846t^ + 9003t)) x(2 • 18966X - {7f + 220t^ - 1846^"^ - 9963t)) x(2 • 18966X + {7f + 220t^ - 1846t^ - 9963t)) mod(t^ - lOt^ + 47t^ - llOt^ + 841)
Essay 2.3 Adjunctions and the Factorization of Polynomials
55
Example 2. The splitting field of f{x) — x^ -\- 3x^ + 7x + 4. In this case, my derivation of the adjunction relations is rather long and ad hoc. The end result is that the Galois group is the alternating group, which makes the first two adjunction relations and the last easy. The third one is the hard one: a^ + Sa^ -h 7a + 4 = 0, b^ + ab^ + a^6 + a^ + 3a + 36 + 7 = 0, c = -l-(-24a^62 + 84a^6 - 36a^ + 42a'^b'^ - UaH + 63a^ -22a6^ + 210a6 - 299a - 636^ -f 1546 - 294), d=-a-b-c= b-c=
-^(24a^62 (24a^6^-84a - 84a^6 + 36a^ - 4:2a%^ + Ua^b - Q^a^ l133^ oo +22a6^ - 210a6 + 166a + 636^ - 2876 + 294).
56
2 Topics in Algebra
Essay 2.4 T h e Splitting Field of X"^ + CiX'^-^
+ C2X^"^ H
\- Cn
Dans le cas des equations algebriques, ce groupe n'est autre chose que Vensemble des 1 • 2 • 3 • • • m permutations possibles sur les m lettres, puisque dans ce cas, les fonctions symetriques sont seules determinables rationnellement.—E. Galois, [27] (English translation, [18, p. 104]) T h e o r e m . Construct the splitting field of the polynomial f{x) = x'^ -\cix'^~^ + C2X^^^ -\- '' • -\- Cn in which the coefficients ci, C2, ..., Cn are indeterminates. As the preceding essay explains, a natural way in which to describe the splitting field of a polynomial is to give the relations t h a t tell how to adjoin each new root to t h e field obtained by adjoining the roots t h a t precede it. Given the splitting field of any polynomial / ( x ) , one can write (1)
{x - ai){x - ai^i)
---{x-an)^
{x - ai){x
- a2) " ' {x -
ai-i)'
where Q;I, 0^2, • • •, c^n are the roots of f{x) in the splitting field, arranged in some order. T h e right side can be regarded as specifying a monic polynomial of degree n — i-\-l with coefficients in the field obtained by adjoining a i , 0^2, . . . , a^_i, namely, the polynomial t h a t results from simple division of the monic polynomial in the numerator by t h e monic polynomial in the denominator, because the numerator does not involve any a ' s at all, and the denominator involves just o^i, 0^2, • • •, ^ i - i - As t h e left side shows, a^ is a root of this monic polynomial. Since t h e adjunction relation is the irreducible monic polynomial with coefficients in t h e field obtained by adjoining a i , 0^2, . . . , o^i-i of which ai is a root, it must b e an irreducible factor of the polynomial indicated by the right-hand side of formula (1). T h e key to the theorem above is t h a t these polynomials themselves are irreducible, so they are the adjunction relations t h a t describe the splitting field. Galois, with his customary terseness, said this when he wrote (see above) t h a t "In the case of algebraic equations, this group is none other t h a n the set of all 1 •2-3 • • • n p e r m u t a t i o n s of the n letters, because in this case the symmetric functions are the only ones t h a t can be determined rationally"; the order of the Galois group is t h e product of t h e degrees of the adjunction relations, so Galois's statement t h a t the order of t h e Galois group is n • (n — 1) • (n — 2) • • • 1 implies t h a t the polynomial in (1) is the adjunction relation at each step. How Galois might have justified his assertion can only be guessed. The proof t h a t follows is inspired by Kronecker.* T h e adjunction relations are certain polynomials in a i , a 2 , • • •, c^n and ci, C2, . . . , Cn t h a t are zero as elements of the splitting field of f{x) = x^ + cix^~^ + C2x'^~'^ + • • • + c^. In theory they can of course be found by * See Kronecker, [37, Sec V]. Also [39, §12].
Essay 2.4 The Splitting Field of x"" + cix"""^ + C2x''~^ -\
+ Cn
57
constructing the splitting field as the root field of a Galois polynomial with coefficients in Z[ci, C2, . . . , Cn] and then doing the computations sketched in Essay 2.3. The objective is to find them without constructing the splitting field. Let R be the ring of polynomials in 2n indeterminates ai, a2, . . . , a^, ci, C2, . . . , Cn with integer coefficients. Imagine that a splitting field of f{x) = x'^ + Cix^~^ + C2x'^~'^ + • • • + Cri has been constructed and that an order has been chosen for the roots o^i, 0^2, . . . , ce^ of f{x) in the splitting field. Substituting a^ for a^ for i = 1, 2, . . . , n while sending each Q to itself defines a homomorphism from R to the splitting field. The objective is to determine the kernel of this homomorphism, and, more generally to determine conditions under which two elements 0 and ip of R have the same image in the splitting field. The following proposition gives sufficient conditions for this to be the case: Proposition 1. Let ai for i = 1, 2, ..., n he the elementary symmetric polynomials in ai, a2, . . . ; On, which is to say the coefficients of x'^~^, x'^~'^, ..., 1, respectively, in the polynomial HlLiC^ "^ ^0- Then the elements Q and (—l)Vi of R have the same image in the splitting field of f{x) = x'^ -\cix'^~^ + C2X^~^ H \- Cn under any homomorphism from R to the splitting field constructed in the way that was just described. Consequently, elements 0 and ipofR have the same image in the splitting field whenever their difference is a sum of multiples of the polynomials Ci — (—l)Vi. Proof Change x to —x in the definition of the elementary symmetric polynomials and multiply by (—1)'^ to obtain x^ — crix^~^-h(72x^~^H h(—l)^cr^ = {x — ai){x — 02)'' • {x — On)' Under a homomorphism of R into the splitting field that comes from ordering the roots o^i, 0^2, • • •, otn of / ( x ) and sending Oi to ai for each i while sending each Q to itself, this polynomial is carried to / ( x ) . Since f{x) = x"' + cix^~^ + C2X^~^ -^ • - • -\- Cn has this same image under such a homomorphism, the corresponding coefficients (—l)^cr^ and Q must also have the same image, as was to be shown. Let Ai — Ci~ {—lyai for i = 1, 2, . . . , n. Then such homomorphisms send Ai, ^ 2 , . . . , An all to zero. Therefore, if 0 and '0 are elements of R for which 0 ~ V^ = Z] DiAi^ where Di, 2^2, • • •, Dn are elements of R, then cj) and tp must have the same image under any such homomorphism, and the proof is complete. Let the statement that (j) and ip satisfy (/> — '0 = ^DiAi for some elements Di, D2, • • • 5 Dn of R be abbreviated (j) = ip mod A. Since this congruence relation is consistent with addition and multiplication, a ring R mod A is defined in this way. Proposition 2. As a polynomial with coefficients in the ring R mod A, the polynomial {x — ai){x — a^+i) • • • (x — a^); call it fi{x), for i = 1, 2, ..., n, is congruent to
58 (2)
2 Topics in Algebra 0i,o(a:) + 0i,l(x)ci + (t)i^2{x)c2 H
h (t)i^n-i{x)Cn-i + Cn-i+l mod ^
i(;/iere (j>i^j{x) is defined by (3)
X 0 , , , ( x ) = X ; a r a ? •••
/or i > 1 anc? for j = 0, 1, 2, ..., n — i, the sum being over all monomials in which the exponents ei, e2, • • •, ei are nonnegative integers whose sum is n — i—j-\-l. (In particular, (t)ij (x) is monic of degree n — i — j + l i n x . When i = 1, it is simply x^~^.) Proof. To say that two elements of R[x] (polynomials in x, ai, a2, . . . , a^, ci, C2, . . . , Cn with integer coefficients) are congruent mod A means, of course, that their difference can be written in the form J2^=i^j^j where Di, D2, . . . , Dn are in R[x]. The case i = 1 of (2) follows from the observation that the right side minus the left side is ^2^=1 x^~^ Aj. When the formula is proved for one value of i, one knows in particular, because (x - ai)fi^i{x)
- fi{x) = fi{x) - fi{ai),
that {x — ai)fi-\-i{x) is congruent to {(l)i,o{x) - 02,0(^0) + (02,1 (x) - (t)i,l{ai))ci-\
\-{(l)i,n-i{x) - (j)i,n-i{cii))Cn-i
mod A, say their difference is ^^=iDi,jAj, where the elements Z^2,i, ^2,2, . . . , Di^n of R[x] are defined in this way. Each of the n — i -\- I summands {(t)i,t{x)-(l)i^,{ai))c, is divisible by x - a ^ , as is {x-ai)fi^i{x), so ZlJ^i A j ^ j is divisible by x —a^. The quotient is ^ EijAj^ where Eij is found by striking from Dij all terms that are not divisible by x and dividing what is left by x. In particular, fi^i{x) and /.x (4)
02,O(^)-02,O(G^O , (t>i,i{x)-(t)i,i{ai) —
\
——
(t>i,n-i{x)-(l)i,n-i{ai) CiH
\
—
Cn-i
are congruent mod A (their difference is ^Ei^jAj). But this is the statement to be proved, because, (j)i^ri-i{x) being monic of degree 1 in x, the numerator of the last term is x — a^, while the numerators of the other terms are (x — ai)(j)ij^i^j{x)^ as follows easily from x^ -a^ = {x- a) (x^-^ -f x^-^a + • • • + a^'^) . Let an element of R be said to be in canonical form if its degree in a^ is at most n — i for each i = 1, 2, . . . , n. The following proposition makes computations in the ring R mod A possible:
Essay 2.4 The Splitting Field of x^ + cix^"^ + C2x''~^ + - • - + Cn
59
Proposition 3. Each element of R is congruent mod A to one and only one element in canonical form. Proof Let Ti = 0i,o(ai) + (/)z,i(a^)ci+0i,2(<^2)c2H \-(l)i^n-i{cii)cn-i-^Cn-i+i. Then Ti — a'^~'^~^^-\ hCn-i+i, where the omitted terms have degree at most n — i in ai, and do not contain aj for j > i or Cj for j > n — i -f 1. Moreover, Ti = 0 mod A (because fi{ai) = 0). Division of a given element 0 of i? by T^ = a^ + • • • regarded as a monic polynomial in a^ leaves a remainder that is congruent to (f) mod A, call it 01, from which a^ has been eliminated. Division of 01 by T^-i = cin-i + *' • regarded as a monic polynomial in an-i leaves a remainder that is congruent to 01 = 0 mod A, call it 02, in which the degree of a^-i is at most 1 and a^ has not been reintroduced. Continuing in this way—on the zth step dividing 0i_i by Tn+l_^ regarded as a monic polynomial in a^+i-z and calling the remainder 0^—produces a sequence 0 = 0o, 0i, 02, • • •, 0n of polynomials congruent to 0 mod A. Since the degree in a^ is reduced to at most n — z by the (n + 1 — i)th step and is not increased by any subsequent step, 0^ is in canonical form. Thus, every element 0 of i? is congruent mod A to an element 0n in canonical form. Any element '0 of i^ is congruent mod A to an element from which the c's have been eliminated, because division of ip by Ti regarded as a monic polynomial in Cn leaves a remainder that does not contain c^, then division of this remainder by T2 regarded as a monic polynomial in c^-i leaves a remainder that contains neither c^-i nor c^, and so forth. (In other words, at the ith step, one substitutes c^+i-i — Ti in place of Cn-\-i-i to obtain an element that is unchanged mod A in which c^+i-i is no longer present and no c with a larger index is reintroduced.) When the input to the first algorithm is a polynomial in ai, a2, . . . , a^ alone and the input to the second algorithm is a polynomial in canonical form, these two algorithms are inverse to one another and establish a one-toone correspondence between polynomials in ai, a2, . . . , a^ and polynomials in canonical form in which corresponding polynomials are congruent mod A, because the first algorithm produces a sequence of equations QiTji
01 = Q2Tn-l >n-l = QnTl
n, +02, +0n,
in which, when 0 contains none of Ci, C2, . . . , c^, 0^ contains none of Q+i, Q+2, . . . , c^ for z = 1, 2, . . . , n — 1, and 0^ is in canonical form. Thus, 0^ is the remainder when 0^+i is divided hy Tn-i regarded as a monic polynomial in Q+i, as was to be shown. To say that a polynomial 0 in ai, a2, . . . , a^ alone is congruent to zero mod A means that it has the form 0 = ^DjAj] this means that 0 = 0 because
60
2 Topics in Algebra
substitution of (—1)V^ for Q in this equation leaves t h e left side unchanged and makes t h e right side zero. Thus, two elements of R in canonical form are congruent mod A if and only if the two polynomials in a i , a2, . . . , a^ alone to which they correspond are congruent mod A, which is true if and only if these two polynomials are equal. This shows t h a t two elements of R in canonical form are congruent mod A only if they are equal and completes the proof of t h e proposition. Proof of the Theorem. The formula x^ -f Cix'^~^ + C2x'^~'^ + • • • + c^ = (x — ai){x — a2) •'' {x — an) mod A gives an explicit factorization of this polynomial with indeterminate coefficients into linear factors over an integral domain t h a t contains Z[ci, C2, . . . , c^] as a subring. (Elements of R t h a t do not contain a i , a2, ... ^ an are in canonical form, so they are congruent mod A only if they are equal.) Thus, the field of quotients of this integral domain is a splitting field of the polynomial. Since it is generated over Z[ci, C2, . . . , c^] by the roots of t h e polynomial in the ring, it is a minimal splitting field and is therefore the splitting field. C o r o l l a r y 1. The Galois group of x^ + cix^~^ -\- C2x'^~'^ + • • • + c^; where the c 's are indeterminates, permutes the roots in the splitting field in all n\ possible ways. Deduction. Each element of the integral domain R mod A has a unique representation in the form ^ ^ei,e2,...,e^(ci, C2, . . . , c^)a^^a2^ • • • a^j', where the coefficients Be^^e2,...,erA^i^ ^2, • • •, Cn) are in Z[ci, C2, . . . , Cn] and the monomials al^a2^ • • • a^"^ range over all n! such monomials in which e^ < n — i for each i, which shows t h a t the degree of the splitting field as an extension of the field of rational functions in ci, C2, . . . , c^ is n! and therefore t h a t n! is the order of the Galois group. C o r o l l a r y 2. A polynomial in ai, 02, • -, On that is unchanged by all n\ permutations of ai, 02, . . , On has one and only one representation as a polynomial with integer coefficients in the elementary symmetric polynomials ai, a2, •.., cFn in ai, 02, . . •, anDeduction. Let 0 be a given polynomial in a i , 02, . . . , On t h a t is unchanged by permutations of t h e a's. W h e n (j) is regarded as an element of i? = Z[ai, a2, . . . , ttn, ci, C2, . . . , Cn] it is cougrucnt mod A to one and only one element in canonical form; call it 0^. Since 0 and Ai, ^42, . . . , An are unchanged by permutations of the a's, (pn is unchanged by permutations of the a's. Since (pn does not contain a^, it cannot contain any a. Therefore (pn is a polynomial ^ ( c i , C2, . . . , Cn) in the c's alone. Since it is congruent mod A to (j) and to no other element of Z[ai, a2, . . . , a^], it follows t h a t 0 is equal to ^(—(71, ( 7 2 , . . . , (—1)^(7^) and to no other polynomial in the cr's with integer coefficients.
Essay 2.4 The Splitting Field of x^ + cix^"^ + C2X^"^ + • • • + Cn
61
Example. T h e adjunction relations t h a t describe the splitting field of x^ -\cix^ + C2X^ + csx^ + C4X + C5, where ci, C2, . . . , C5 are indeterminates, are al + c i ^ i H- C2ai -f c s ^ i -f C4^ai -h C5 = 0, (0^2 + Q;2cei + a^^^f + 0:20^1 + <^i) + Ci (0^2 + ci;!^! + c^2<^i + <^i) -\-C2{a2 -\- a2ai + a f ) +C3(Qf2 + a i ) + C4 = 0, (^3 + Q;3Q^2 + Q^io^i + <^3<^2 + <^3Q;2<^I + a^al
+ ^2 + o^l^i + 0^2(^1 + o;?)
+Ci (0^3 + 0^30^2 + <^3<^l + Cl^2 + ^2(^1 + Q^l) -h ^2(0^3 + Ce2 + Cei) + C3 = 0, (^4 + a^as + Q;4Q;2 + ^40^1 + c^i + Q;3<^2 + ces^;! + <^2 + <^2<^i + <^i) + C I ( Q ; 4 + Q;3 + 0^2 + ai)
+ C2 =
0,
^5 + 0^4 + a 3 + Q;2 + Q;I + ci = 0, where a i , a 2 , . . . , 0^5 are t h e roots of the equation in a splitting field. (In t h e above construction, a^ is the element of R m o d A represented by a^.)
62
2 Topics in Algebra
Essay 2.5 A F u n d a m e n t a l Theorem of Divisor Theory In 1894, when Richard Dedekind's theory of ideals was first beginning to gain widespread recognition, Adolph Hurwitz published a paper [33] in which he proposed a new approach to the theory. Unfortunately for him, Dedekind did not accept his proposal as a friendly amendment. In fact, Dedekind replied [13] rather sharply t h a t he too had discovered the approach Hurwitz described— he had even published a paper [12] on it in an out-of-the-way journal—but t h a t he had firmly decided against it on philosophical grounds. Neither Hurwitz nor Dedekind seems to have been p e t t y or disagreeable as a general rule, but b o t h of t h e m felt they had a vital stake in the matter. Hurwitz replied [34] t h a t he was not persuaded by Dedekind's philosophical objections to his proposal and t h a t t h e published theorem to which Dedekind had referred was in fact a special case of a theorem Kronecker had published [41] long before Dedekind had, although Hurwitz himself had only lately learned of Kronecker's theorem. T h e interesting p a r t of this story is t h a t three eminent mathematicians— Kronecker, Dedekind, and Hurwitz, in t h a t order—discovered and focused on this one theorem and its importance for the theory of ideals (or, as Kronecker termed it, the theory of divisors), yet the theorem is not widely known today and is rarely included in modern t r e a t m e n t s of the theory. Dedekind regarded the theorem as a generalization of Gauss's lemma [28, Art. 42]: If the product of two monic polynomials with rational coefficients has integer coefficients, then the factors must have integer coefficients. He restated Gauss's lemma in the following form: If the product of two polynomials (not necessarily monic) with rational coefficients has integer coefficients, then the product of any coefficient of the first and any coefficient of the second is an integer. This s t a t e m e n t obviously implies Gauss's lemma (1 is a coefficient of b o t h polynomials in Gauss's case). The reverse implication can be proved fairly easily, so t h e two statements are essentially t h e same. T h e advantage of Dedekind's version is t h a t it is true with algebraic numbers and algebraic integers in place of rational numbers and rational integers. Thus, Dedekind's theorem states t h a t if the product of two polynomials whose coefficients are algebraic numbers has coefficients that are algebraic integers, then the product of any coefficient of the first and any coefficient of the second is an algebraic integer. Another way to p u t it is the following: Let ao, a i , . . . , Om and 6o, &i, . . . , bn be two sequences of algebraic numbers. There are two ways to "multiply" them, call t h e m the "polynomial" way, in which t h e product is the sequence dobo^ dobi + ai6o, ao62 + ai6i + a26o, .. •, ambn of coefficients of the product {aox'^ + aix'^~^ H \- am){box'^ -^ bix^~^ -\ \-bn) of polynomials of which the given sequences are the coefficients, and the "pairwise" way, in which the product is t h e sequence of products a^fej, where 0 < i < m and 0 < j < n, arranged in some order. Each t e r m of the polynomial product is a sum of terms of the pairwise product, so if all terms of the pairwise product sequence
Essay 2.5 A Fundamental Theorem of Divisor Theory
63
are algebraic integers, the terms of the polynomial product sequence are too. Dedekind's theorem states the converse: if all terms of the polynomial product of two sequences of algebraic numbers are algebraic integers, then so are all terms of the pairwise product. Here an algebraic number is a "quantity" x that satisfies an equation x^ -\-Aix^~^ -\-' • • + ^ i v = 0 in which the coefficients Ai are rational numbers. After this definition is made, one can prove that in fact x is an algebraic number if the coefficients Ai are merely algebraic numbers. An algebraic integer is an algebraic number that satisfies such an equation in which the Ai are integers. Again, one can prove that in fact x is an algebraic integer if the Ai are merely algebraic integers. Dedekind's version of Gauss's lemma is then the statement that each term aibj of the pairwise product satisfies an equation of the form (aibj)^ + Ai{aibj)^~^ + A2(aibj)^~'^ + • • • + ^ ^ = 0 in which the coefficients Ai can be chosen to be algebraic integers whenever all terms of the polynomial product are algebraic integers. Kronecker made the stronger statement [41] that one can give (theoretically, at least) explicit formulas in which the A's are expressed as polynomials with integer coefficients in the terms of the polynomial product and are therefore algebraic integers whenever the terms of the polynomial product are algebraic integers. Stated in this way, the theorem becomes a very concrete theorem of "general arithmetic": Theorem. Let ao, ai, ..., am, bo, bi, ..., bn be indeterminates and let R = Z ao, ai, ..., am, bo, bi, ..., bn] be the ring of polynomials in these indeterminates with integer coefficients. Let co, ci, ..., Cm+n be the elements of R defined by Ci =
2_j
^j^k-
j-\-k—i
For each product ajbk of one a and one b (where 0 < j < m and 0 < k < n), construct a relation of the form F{ajbk) = 0 in which F{X) = X^ + PiX^~^ + P2X^~'^ + • • • + Pn is a monic polynomial whose coefficients pi, P2, . . . ; PN O^TC elements of R that are polynomials in co, ci, ..., Cm-\-n 'with integer coefficients. Proof. Let f,g, and h be the polynomials with coefficients in R defined by f{x) = aox"^ + a i x ^ - i + • • • + a^, g{x) = box"" -f bix""-^ + • • • + 6n, h{x) = f{x)g{x). Construct a splitting field for h{x)^ and let ^i, ^2, • • •, im+n be the negatives of the roots of h{x) in this field. Then h{x) = cox'^^^ -{-cix'^^^~^ -h Ui^ -^ Ci)^ SO Ci = co^i, where Ei is the ith elementary symmetric polynomial in ^1, ^2^ •••, im+n- The equation h{x) = f{x)g{x) partitions the factors x-\-^i of h{x) into two subsets, say f{x) = ao{x-\-£^i){x-\6 ) • • • (^ + ^m) and g{x) = 6o(^-f-^m+i)(^ + ^m+2) • • • (^+^m+n). Then ajbk = aoboCTjTk = coCTjTk, where aj is the j t h elementary symmetric polynomial in ^1, ^2 5 • • • 5 ^m and Tk is the kth elementary symmetric polynomial in ^m+i, ^m+2, . . . , ^m+n- Let F{X) = Us i^ ~ ^oS{crjrk)), where S runs over all
64
2 Topics in Algebra
{m-\-n)\ permutations 5 of ^ i , ^2, • • •, Cm+n- Since ajbk is a root of the monic polynomial F{X) (it is the root of the factor in which S is the identity), the theorem will be proved if the coefficients of F are shown to be polynomials in Co, ci, . . . , Cm-\-n with integer coefficients. T h e coefficient of x ^ ^ + ^ ^ ' ~ ^ in F is (—CQ)^ times the sum of all products of p distinct conjugates of ajTk under p e r m u t a t i o n of ^ i , ^2, • • • 5 Cm-\-n' The degree of any conjugate of ajTk in ^1 is 1, so this coefficient is CQ times a symmetric polynomial in ^ 1 , ^2, • • •, £,m-\-n whose degree in ^1—and therefore in any one ^^—is at most p. Because t h e polynomial is symmetric, this coefficient of F has the form CQC{UI^ Z ' 2 , . . . , Urn-\-n)^ where C is a polynomial with integer coefficients, by Corollary 2 of Essay 2.4. Let each t e r m -iU^^Ui'' • • • U^^;^ of C, where 7 is the integer coefficient of the term, be expressed as a polynomial in ^ 1 , <^2, • • • 5 im+n^ and let the terms be arranged in lexicographic order (terms with highest degree in ^1 come first, among terms with the same degree in ^1 t h e terms with highest degree in ^2 come first, and so forth). The leading t e r m of t h e result is 7^1 ^^2^ • • • i^^n •> where ei = c^i +G?2 + • * '-\-dm+ni ^2 ^
^ 2 ~r 0^3 I ' ' • I (lra-\-ni
- - - •> ^m-\-n — l ^^ ^m-\-n — l
i (^m-\-n^ ^m+n
^^ ^m-\-n-)
because the leading t e r m of a product is the product of the leading terms and the leading t e r m of E^ is ii^2''' ik- No two of these leading terms contain the same exponents (the e's determine the (i's as differences of successive e's), so the leading term of C, when it is expressed in terms of ^ 1 , ^2, . . . , ^rn+n ciud Written in lexicographic order, is one of these leading terms 7 ^ r ^ 2 ^ ' ' ' Cn^n • -'-^ particular, its degree in ^1 m di -\- d^ -\- - - - -\- d^ for some term, so its degree in ^1 is t h e total degree of C in the Z"s. Therefore, C Q C ( Z V 1 , 2^25 ' ' • •> ^ m + /co) can be expressed as a polynomial in CQ, ci, . . . , Cm+n with integer coefficients, as was to be shown. See P a r t 0 of [19] and [23, Nr. 20] for fuller accounts and other references.
Some Quadratic Problems
Essay 3.1 The Problem An + B = n and "Hypernumbers" The problem that motivates the study of 'hypernumbers' in the next few essays comes from the prehistory of mathematics. In "The Measurement of the Circle," Archimedes states that Y | | < \/3 and ^YH' > v ^ without giving any derivation. The closeness of these approximations becomes clear when one compares 265"^ = 70225 to 3 • 153^ = 70227 in the case of the first and 1351^ = 1825201 to 3 • 780^ = 1825200 in the case of the seco'nd to find that 265^ + 2 = 3- 153^ and 1351^ = 3 • 780^ + 1. There have been many attempts to guess how Archimedes might have derived these estimates. One can be certain that they were not found by trial and error; very probably, they involve some analogue of what is today called the continued fractions algorithm, but there is no documentary evidence on which to base such speculations. A similar problem is treated in earlier Greek mathematics. As early as the time of Pythagoras, Greek mathematicians are said to have derived* an entire sequence of approximations to \/2 in the form of "side and diagonal" numbers. If d is the length of the diagonal of a square and s is the length of its side, then (P = 25^ by the Pythagorean theorem. The followers of Pythagoras are thought to have discovered that there are no whole-number solutions (d, s) of this equation—and to have been very dismayed to learn that numbers, in the simplest sense, are not sufficient for the description of this simple geometrical construction. But their study of the problem probably went well beyond the impossibility of (P = 2s'^ in whole numbers to the following sequence of approximate solutions d^ = 2s'^ d= 1. A solution (d^, Sn) of (i^ = 2s^ =b 1 implies a solution (o^^+i, s^+i) of
66
3 Some Quadratic Problems
--" ^
[^
I
N
\
/-
I I
\ V
y
/
I
^\
y
''
/ N
\
\
I I I
S
I
y
y
y
y
y
^^ \
I /
Fig. 3 . 1 . The line segment AB is the hypotenuse of two different right triangles.
algebraic notation, to verify.''' Let (o^o, ^o) = (1,1). T h e n dg = 2^0 — 1, and t h e formula generates the sequence (1,1), (3,2), (7,5), (17,12), (41,29), (99,70), (239,169), (577,408), . . . , which alternates between solutions of d^ + 1 = 2s^ and solutions of c/2 = 25^ + 1; t h a t is, 1^ + 1 = 2-l2,32 - 2-22 + 1, 7^ + 1 = 2 . 5 ^ and so forth. In this way one derives, for example, 577^ = 2 • 408^^ + 1, which shows t h a t | ^ is a very good approximation to v/2, because ( | ^ ) ^ = 2 + 4 ^ , but t h a t it is a bit too large. Plato's reference in Theaetetus to the study of the irrationality of square roots up to v T z probably indicates t h a t mathematicians of his time studied rational approximations of these other square roots as well. There are other indications t h a t techniques of finding approximate solutions of y-^ = Ax^ were studied by ancient mathematicians whose works are lost. In India, Brahm a g u p t a , in the 7th century, stated the formula t h a t will be studied later in ^ The statement that d^ = 2s^ ± 1 implies d^-j-i = 2s^_j_i =F 1 can be deduced from the formula (2s + d)^ + d^ == 2s^ + 2(s + 2s^ implies (2s + df < 2(s + df and 2(s + df - (2s + df = d^ - 2s^; in the same way, d^ < 2s^ implies (2s + df - 2(s + df = 2s^ - d^.
Essay 3.1 The Problem AD + B = D and "Hypernumbers"
67
this essay, and Bhascara Acharya, in t h e 12th century, mentioned t h e spectacular fact t h a t the smallest number x for which 61x^ + 1 is a square is X = 226153980. Problems similar to this one are connected with the famous "cattle problem" of Archimedes [49], causing scholars to believe t h a t Archimedes knew far more about such number-theoretic problems t h a n our usual view of Greek mathematics as being primarily geometrical would lead us to expect. These problems will be studied in this group of essays in the form of t h e problem t h a t will be indicated by the symbolic equation AU -h 5 = D, which is to say t h e problem "Given numbers A and 5 , find numbers x for which Ax'^-\-B is a square," say Ax^-^B = y"^. (At first glance, Archimedes' solution 265^ + 2 = 3-153^ does not appear to be an instance of this problem, because A = 3 and B = 2 are on opposite sides of t h e equation, b u t if t h e equation is multiplied by 3, it becomes 3 • 265"^ H- 6 = (3 • 153)^, which is a solution of 3n + 6 = n . Conversely, in any solution (x, y) of 3x^ -\- ^ — y^ ^ y must be divisible b y 3, say z = i//3, and division of 3x^ + 6 = ^z^ by 3 gives a solution of x^ + 2 = 3z^.) Because the solution of this problem is easy when ^4 is a square,* t h e case in which ^4 is a square will be ignored. B r a h m a g u p t a stated (but in words, not as an algebraic formula) t h e crucial tool t h a t is used in the solution of AU + B = D. It is the observation^ t h a t a solution of AU + ^ = D can be combined with a solution of AU + C = D to find a solution of ^ D + BC = U. Specifically, if Ax'^ -\- B = y'^ and Au'^ -\-C = v'^, then A{xv + yu)'^ + BC — {^Axu -h yv)^. It seems likely t h a t some version of this remarkable fact was known was known in Greek times and t h a t it was involved in the calculation of approximations to square roots. Archimedes' approximations to \ / 3 can be derived using B r a h m a g u p t a ' s formula in t h e following way: Combine t h e simple equation 3 - 1 ^ + 1 = 2^ with itself to obtain 3 • 4^ + 1 = 7^, t h e n combine this new equation with 3 • 1^ + 1 ^^ 2^ to obtain 3 • 15^ + 1 = 26^, and so forth, to obtain the infinite sequence 3-1^ + 1 = 2^ 3.42 + 1 = 7^ * When A is a square, the problem is to write the given B in the form s^ — ^^ = (s — t)(s + 1 ) , where t is a multiple of the square root of A. Thus s — t — B\ and s-\-t — ^ 2 , where B = B1B2 is one of the finite set of factorizations of B in which Bi < B2. Since Bi-\-B2 — 2s is even, the problem is thus to find all factorizations BxB2 = B, if any, in which Bx < B2, Bi = B2 mod 2, and {B2 - Bi)/2 is a multiple of the square root of A. For each of them, {^^^Y = {^^^Y + B is a solution, and there are no others. ^ See [10, p. 363]. The proof, using modern algebraic notation, is a simple calculation. How Brahmagupta might have proved it without algebraic notation—or how he might have known it is true—is a mystery. Certainly Euclid's Proposition 10 of Book 2 (see note above) indicates a Greek awareness of a similar phenomenon many centuries earlier, but there is no reason to suppose that the Greeks were the first.
68
3 Some Quadratic Problems 3 • 15^ 1 = 26^ 3 • 56^ 1 = 97^ 1 = 362^ 3•209^ 3.780^ + 1 = 1351^
of solutions of 3n + 1 = D that includes the one Archimedes used. Each of these equations can be combined with 3 • 1^ + 6 — 3^ to obtain 3-52 + 6 = 3-192 + 6 = 3-712 + 6 = 3 • 265^+ 6 = 3 • 989^ + 6 = - 3691^ + 6 =
(^^ 3 ) ^ isM l ) ^ {c^ 4 l ) ^ {cM 5 3 ) ^
ic^ 5 7 l ) ^ ii^ 2 l 3 l ) ^
3 to obtain an infinite sequence 52 + 2 == 3 192 + 2 =- 3 71^ + 2 == 3 265^ + 2--= 3 989^ + 2--= 3 3691^ + 2'-= 3
32, ll^ 41^, 1532, 571^, 2131^,
of solutions of D + 2 = 3n that includes, of course, the other solution Archimedes used. (One naturally wonders whether D + 1 = 3n is possible; it is not, because —1 is not a square mod 3.) In modern terminology, Brahmagupta's formula has become the statement that for expressions of the form y + xy/A, the product of the norms is the norm of the product. Here the norm of y -\- xy/A is by definition its product with its conjugate y — x \ M , which is to say that it is {y + xy/A){y — xy/A) = ^^ — Ax^. When one computes with these expressions using the normal rules of algebra—the Buchstabenrechnung of Essay 1.1—one finds that the conjugate of a product is the product of the conjugates, because f ^ -h xvAj
(v-^ uvAj
(y — XVA\
(V — uyA\
= (yv + Axu) -\- [yu + xt')vG4,
whereas = {yv + Axu) — {yu +
xv)vA,
Essay 3.1 The Problem AU-\- B = U and "Hypernumbers"
69
so the norm of a product can be computed in either of two ways: the product can be expanded (y + x\/]4) (v + uy/A j = {yv -f Axu) + {yu + xv) y/A to find that the norm of the product is {yv-\-Axu)'^ — A{yu-\-xv)"^, or the norm of the product can be computed by multiplying the product ( y + xvAj f v -\- uy/Aj by its conjugate (y — xy/Aj
(v — uy/Aj.
Thus
{yv + Axu)'^ - A{yu + xv)^ = {y'^ - Ax^){v'^ - Au^). With B = y'^—Ax'^ and C = v'^—Au'^, this is Brahmagupta's formula rewritten as {yv + Axu)'^ — A{yu + xv)'^ = BC. A solution of ^ n + 5 = D is an expression y + X \ / A , in which x and y are numbers, whose norm is B. For want of a better term, I will call such an expression y + x\/A a hypernumber for A, so that the problem "find all solutions of An + -B = D" for given numbers A and B^ with A not a square, becomes "find all hypernumbers for A whose norms are J5." More precisely, the hypernumbers for a given number A not a square can be described in the following way: As in Essay 1.1, a number is a term in the sequence 0, 1,2, For a given number A not a square, a hypernumber is an expression y -f- xy/A in which x and y are numbers and y/A is a mere symbol. Hypernumbers for the same A are added in the obvious way, (T/I
+ X2 vC4) + (2/2 + X 2 \ / l ) = (^1 + y2) + {xi +
X2)VA,
and they are multiplied using the rule f y/A J = A to obtain (^yi + X2^/Aj [y2 + 2:2V^j = (2/12/2 + ^^1X2) + {yiX2 +
y2Xi)\fA.
Otherwise stated, the hypernumbers for A are N(X) mod (X^ — A), the set of all polynomials in X whose coefficients are numbers, when two such polynomials are considered to be equal if they are congruent mod (X^ — A). Every polynomial in X whose coefficients are numbers is congruent mod {X'^ — A) to one and only one polynomial of degree less than 2 (replace X^ with A, X^ with AX, X^ with A^, and so forth), and the defining relation X'^ =^ A justifies writing yfA in place of X. This definition of course implies the rules of addition and multiplication of hypernumbers just stated. (The assumption that A is not a square guarantees that nonzero factors can be canceled in the arithmetic of hypernumbers y-\-xy/A, because it guarantees that X'^ — A is irreducible, from which it follows that Z[X] mod {X'^ — A) is an integral domain; then for integers r, 5, x, y, u, v the congruence {s-\-rX){y-\xX) = (s -f rX){v 4- uX) mod (X^ - A) implies 5 + r X = 0 or y + x X = v + uX mod (X^ — A) and therefore implies s -\- rX = 0 or y-{- xX — v ^ uX. On the other hand, if A = r^ then, (r + X ) r = (r + X ) X mod (X^ - A) even though r + X ^ O a n d r ^ X mod (X^ - A).)
70
3 Some Quadratic Problems
The exclusion of negative numbers is a bit inconvenient—-the norm y'^—Ax'^ of a hypernumber y + xy/A may not be a number in this strict sense because Ax'^ may be larger than 2/^, and the conjugate y — x\J~A of ^ + x\/~A will be a hypernumber only when x = 0—but insistence on the narrow definition of "number" can be maintained with very little real difficulty and gives the theory a pleasing economy of structure. All of the results in the first five essays of this section, including the law of quadratic reciprocity in Essay 3.5, are deduced using only the arithmetic of numbers 0, 1, 2, . . . in the narrowest sense.
Essay 3.2 Modules
71
Essay 3.2 Modules T h e notion of a module of hypernumbers t h a t is introduced in this essay is used in t h e next essay to solve AD -\- B = D and in the following essays to deal with other questions in number theory. Very simply put, a module of hypernumbers for a given A is a list of hypernumbers for t h a t A, written between square brackets to indicate t h a t the list is to be used to define a congruence relation. The concept is motivated by the following reexamination of the Euclidean algorithm. Gauss's notion of what it means to say t h a t a = b mod m—that is, two numbers a and b are congruent modulo a third number m—was generalized by Kronecker* as follows: Given a list of numbers m i , m2, . . . , TTT,^, two numbers a and b are c o n g r u e n t m o d u l o [TTII, m2, • . . , m ^ ] , written a = b mod [mi, 1712, • • •, rn/j], if there are numbers i i , 22, - - - ^i/j. and j i , J2, • • •, j ^ such t h a t Ci-\-Yla=i '^^'^a = ^ + Sa=i^Q!^^Q!- ^ module is a (nonempty, finite) list of numbers [TTII, 7722, . . . , 777,^] written between square brackets to indicate t h a t they are to be used to define a congruence relation in this way. Two modules are e q u a l if they define the same congruence relation. Clearly, two modules are equal if t h e lists of numbers they contain can be obtained from one another by a sequence of steps in which (1) terms are rearranged, or (2) a zero is omitted from the list or annexed to it, or (3) a t e r m is added to or subtracted from another term. (A subtraction assumes, of course, t h a t the t e r m being subtracted is less t h a n or equal to t h e t e r m from which it is being subtracted.) In the case of operations of types (1) or (2) the assertion is obvious. In t h e case of an operation of t y p e (3), it follows from t h e observations t h a t a -f- i i ( m i + 7712) + Z2^2 + ^3^3 + • • • = 6+ji(miH-7n2)-f J 2 ^ 2 + J 3 ^ 3 H implies a - h i i m i + ( 2 1 + ^ 2 ) ^ 2 ^ - i s ^ s H = 6 + j i m i H - ( j i H - J 2 ) ^ 2 + J 3 ^ 3 + - • • and, conversely, a+Zi777,i+i2^2-f ^WsH = 6+Jimi+J2^2+J3^3H implies a+ii(?77.i+777,2)+ (^'(+^2)^2+^3^3H ^ b-\-j'i{mi +777-2) + (^1 + ^ 2 ) ^ 2 + J 3 ^ 3 + • • • when i^777,2 + J W 2 is added t o b o t h sides. These simple observations lead t o a version of the Euclidean algorithm: The Euclidean Algorithm. Input: A list of numbers describing a module. Algorithm: While the list contains more than one number If the first entry is zero, drop it from the list. If the first entry is greater than the second entry, interchange entries. Otherwise, subtract the first entry from the second. End
the first
two
See, for example, [44, p. 144]. Kronecker did not go to the extreme that I have of insisting that the multipliers all be natural numbers, so he did not need to put sums of multiples of m's on both sides of the equation.
72
3 Some Quadratic Problems
Output: The list with one entry that remains. For example, [21,15,6] = [15,21,6] = [15,6,6] = [6,15,6] = [6,9,6] = [6,3,6] = [3,6,6] = [3,3,6] = [3,0,6] = [0,3,6] = [3,6] = [3,3] = [3,0] = [0,3] = [3]. Each step results in a new module equal to the preceding one; it either reduces the length of the list (the first alternative holds), or it reduces the sum of the entries (the third alternative), or it is followed by a step in which one of these two types of reduction occurs (the second alternative). Therefore, the algorithm eventually terminates, and reduces the module to a very simple form: Theorem 1. Given any module [mi, m2, - • •, m^]; there is a number n for which [mi, m2, ..., m^] — [n]. This theorem gives a canonical form for modules, because [ni] = [77,2] only if ni =712. (If [^1] = [^2], then each of the numbers ni and n2 is a multiple of the other, which implies ni = 712, because it implies that if one is zero, then both are, and otherwise, each is less than or equal to the other.) One can determine whether two given modules are equal by putting them both in canonical form; they are equal if and only if the canonical forms are identical. The number n is obviously the greatest common divisor of mi, 7712, • • •, '^n^^ except when the numbers m^i are all zero, in which case there is no greatest common divisor because all numbers are common divisors. Corollary. / / two lists determine the same module, they can he transformed into one another by a sequence of steps of types (1), (2), and (3) described above. Deduction. One can pass from either of them to their common canonical form and back by a sequence of such steps, so one can pass from either of them to the other. The "Euclidean algorithm" of Essay 1.4 shows that if [7711,7712] = [^], there are integers (j) and if) for which (j)mi + ipm2 = 77,. Without using integers, this fact can be stated and generalized as follows: Proposition 1. / / [777,1, ^ 2 ; •••; '^^i] = [^] o.'nd m.^ 7^ 0, then there are numbers ki, k2, ..., kf^ for which kirui +/c2r7i2H \-k^-im.^-i-\-n = kfj^m^. Proof. Because 71 = 0 mod [77,] and therefore 77, = 0 mod [777,1, ^ 2 , • • •, '^^l]l there are numbers zi, 22, . . . , i^ and ji, J2, • • •, j/^ such that n -\-J2^a'^a = X l i a ^ a - What is to be shown is that there is an equation of this form in which ia > ia for Q; = 1, 2, . . . , /i — 1. If i^ < ja for some a, one can add T^a'^ii to both sides by adding 772^ to i^ and 777,c, to j ^ , increasing io, without changing any other i and without changing any j other than j ^ . Repetition of this step enough times makes ice ^ ja without changing the relation between i(i and j ^ for any (3 < /i other than a. Since this can be done for each a < /x, the desired conclusion follows.
Essay 3.2 Modules
73
Two numbers mi and 1712 are relatively prime if [mi, 7712] = [1]. Proposition 1 implies that if mi and m2 are relatively prime and nonzero then each is invertible mod the other. It also implies an important theorem of elementary number theory: The Chinese remainder theorem. / / / > 0 and F > 0 are relatively prime and g and G are given numbers, the congruences x = g mod / and X ~ G mod F determine a number x mod fF in the sense that there is a solution X of the congruences and any two solutions are congruent mod fF. Proof By the proposition, there are numbers /ci, A:2, /i, and I2 for which kif + 1 = k2F and hF + 1 = hf. Then x = g • k2F ^ G • hf satisfies X = g-k2F = g'{kif^l) = g mod / and x = G-hf = G-(/iF-f 1) = G mod F , as required. The uniqueness of x mod fF follows from simple counting: Since one of the fF numbers x less than fF solves each of the fF possible problems X = g mod / and x = G mod F in which g < f and G < F , no two of them solve the same problem. There is a natural way to multiply modules: The product of [777,1, '^2, . . . , m^] and [ni, 77,2, • • •, nj^] is by definition the module described by a list [..., rrianp,...] made up of all products of one m and one 77,, arranged in some order. Multiplication is well defined for modules in the sense that if one list is replaced by another list describing the same module, then the product list may change, but the module it describes will not. (This statement is clear if the passage from one factor to an equal factor involves rearranging the list or omitting or annexing zeros. If the passage involves adding a term to or subtracting a term from another, it is only slightly less obvious.) Multiplication of modules is obviously commutative and associative. All of the same ideas apply without change to modules of hypernumbers, except that there is no Euclidean algorithm in the case of hypernumbers, and the problem of establishing a canonical form for modules of hypernumbers is more challenging. Let a number A, not a square, be fixed throughout the discussion. A module of hypernumbers is simply a list [mi, m2, . . . , m^] of hypernumbers (for the given A) enclosed in square brackets. Two hypernumbers a and b are congruent modulo a given module, written a = fe mod [mi, 777-2, •••? m^], if there are hypernumbers ii, i2, . • •, i/^ and j i , J2, . . . , j ^ such that a -\- ^ia'^a = b -\- YlJa'^a- Two modulcs are equal if they determine the same congruence relation. Again it is easy to see that two modules are equal if the lists of numbers they contain can be obtained from one another by a sequence of steps in which (1) terms are rearranged, or (2) a zero is omitted from the list or annexed to it, or (3) a term is added to or subtracted from another term. (A subtraction is of course possible only when the coefficients of the term being subtracted are no larger than the corresponding coefficients of the term from which it is being subtracted.) In the hypernumber case, there is another elementary
74
3 Some Quadratic Problems
operation t h a t does not change t h e module, namely, (4) \fA times a term is added to or subtracted from another term. This set of four types of transformations t h a t change a module into an equal module are sufficient to establish a m e t h o d for determining whether two given modules are equal: T h e o r e m 2. pernumbers for [e/, eg + ey/A], g^ = A mod / .
Let A he a fixed number, not a square. Every module of hyA that is not"" equal to [0] is equal to a module of the form where e, f, and g are numbers for which ef ^ 0, g < f, and Two modules of this form are equal only if they are identical.
A module [e/, eg + e^/A] in which e / 7^ 0, ^ < / , and g'^ = A mod / will be said to be in c a n o n i c a l form. Proof. T h e following elaboration of t h e Euclidean algorithm p u t s any module t h a t is not equal t o [0] in canonical form after a finite number of steps. By assumption, t h e list t h a t presents the given module contains at least one nonzero entry, call it y + x\/~A. Because the number \y'^ — Ax'^\ can be annexed to the list, one can assume without loss of generality t h a t the list t h a t presents the given module contains a nonzero number. (The annexed number is y(7/ + X \ / A ) — x\fA{y + x\fA) if y'^ > Ax'^ and xy/A{y + x\fA) — y{y + xy/A) if y'^ < Ax'^. Therefore, annexing it t o the list does not change the module. It cannot be zero because A is not a square, so Ax'^ cannot be a square"^ unless x = 0.) Therefore, provided the given module is not [0], one can assume without loss of generality t h a t the list representing the given module has a nonzero number as its first entry. Moreover, because the first entry times \/]4 can be annexed to the list if necessary, one can also assume without loss of generality t h a t the list contains at least one hypernumber t h a t is not a number. Reduction to Canonical Form Input: A presentation of a module in which the first entry is a nonzero number, and at least one entry is a hypernumber t h a t is not a number. * The module [0] is equal only to modules of the form [0, 0 , . . . , 0]. It is a very trivial sort of module—congruence mod it is simply equality—which for the most part will be ignored. A module in canonical form is not [0]. ^ li y^ = Ax^ and x ^ 0, then A must be a square, as can be seen as follows: Let [x,y] = [d] ^ [0]. If 2/ = 0, then yl = 0 is a square. Otherwise, by Proposition 1, there are numbers a and jS for which ax + d = /3y, from which it follows that [xd] = [xd,Ax^] = [xd.y'^] = [xd,y^, f3^y^] = [xd, y^, {ax -\- df] = [xd,y^,d'^] = [d"^]. Thus, xd = d^,x = d, y"^ = Ad^, and {y/d^ = A. Or if one is willing to take the unique factorization of numbers as known, one can simply observe that some prime factor of A divides A an odd number of times, and therefore divides Ax'^ an odd number of times, so Ax"^ is not a square.
Essay 3.2 Modules
75
Algorithm: While the module is not in canonical form If any number in the list is preceded by an entry that is not a number, interchange the two. Otherwise, if the second entry is a number, use the Euclidean algorithm to replace the first two entries with their greatest common divisor. Otherwise, if there is a third term (in which case the first term is a number and the second and third terms are not numbers), make use of the first term to perform the Euclidean algorithm on the coefficients of y/A in the second and third terms. Specifically, if the coefficient of y/A in the second term is less than or equal to the coefficient of ^TA in the third term, add the first term to the third term as many times as necessary and then subtract the second term from the third; otherwise, interchange the second and third terms. Otherwise (in which case there are just two entries, the first a number and the second not), if the coefficient of y/A in the second entry does not divide the other coefficient of the second entry, annex VA times the second entry to the list as a third entry. Otherwise, if the coefficient of y/A in the second entry does not divide the first entry, annex y/A times the first entry to the list as a third entry. Otherwise (in which case the module has the form [e/, eg + ey/A] but is not in canonical form), subtract the first term from the second if possible. Otherwise, annex the difference of the numbers eA and eg^, which is the difference of the hypernumbers y/A{eg-\-ey/A) and g{eg-\-eyA), to the list as a third entry. End Output: The module in canonical form with which the algorithm terminates. Example. To apply the algorithm to [7+5\/3] one must first annex |7^—3-5^| — 26. The succeeding steps are [26, 7 + 5\/3] = [26, 7 + 5^3,15 + 7^3] = [26,7 + 5^3,8 + 2^3] = [26,8 + 2\/3,7 -h 5v^] = [26,8 + 2\/3,25 + 3\/3] = [26,8 + 2V^, 17 + 73] - [26,17 + v ^ , 8 + 2^3] = [26,17 + x/3,17 + v^] - [26,17 + \/3,0] = [26,0,17 + \/3] = [26,17 + V^]. The final module is in canonical form because 1 divides both 17 and 26, 17 is less than 26, and 17^ = 3 mod 26. This algorithm terminates for the following reasons: By assumption, the input list contains both a number and a hypernumber that is not a number. A step that changes a hypernumber into a number leaves a hypernumber in the list unchanged, and the only step that reduces the number of numbers in the list replaces two numbers with a single one (the greatest common divisor of the first two entries). Therefore, at each step
76
3 Some Quadratic Problems
there is at least one number and at least one hypernumber not a number. They are arranged by the first step to put all numbers first, and the second step eventually reduces the number of numbers in the list to one. Steps of t h e first three types do not change t h e greatest common divisor of the coefficients of \/]4 t h a t occur in entries of t h e list. Since they reduce the total of the numbers in the list or t h e total of t h e coefficients of ^Tk (except for the finitely many steps t h a t rearrange terms), eventually a step beyond t h e first three must be reached. Each such step reduces either t h e greatest common divisor of the coefficients of ^/]4 or t h e greatest common divisor of t h e numbers in t h e list (except for finitely many steps t h a t reduce the first coefficient of the second term), so only a finite number of t h e m can occur before canonical form is achieved. L e m m a . Let [e/, eg + e\/]4] he a module in canonical form. The congruence y + xy/A = 0 mod [e/, eg + eVA] is equivalent to the pair of congruences y = gx mod ef and x = 0 mod e. Proof
Because efVJ
+ efg = f [eg +
e^/A^
and vA
{eg + evAj
= g ieg ^ evA\
mod e / ,
an equation of t h e form y + x \ ^ + iief
+ i2 (eg + e\fA\
= y' + x'\fA
+ jief
+ J2 Ug + e\/~A\
in which zi, 22, j i , J2 are hypernumbers implies another equation of the same form in which i i , 22, j i , J2 are numbers. (For example, if zi = a + / 5 \ / ] 4 , one can add I3efg to b o t h sides and replace l3\fAef-]-f3efg with f]f{eg-\-ey/A) to obtain another equation of t h e same form in which ii is a, 22 is increased by / 3 / , and ji is increased by Pg. If ^2 = Q^ + / 3 V ^ , one can use the fact t h a t y/A{eg + e\/^)-\7 e / = g{eg + ey/A) + Sef for suitable 7 and S to add P'yef to b o t h sides and replace f3y/A{eg + e^/A) + P^ef with f3g{eg + ey/A) -f- pSef to obtain another equation of the same form in which Z2 is a -\- Pg, while pS is added to ii and P^ is added to j i , and so forth.) Therefore, y -h xy/A = 0 mod [e/, eg + ey/A] if and only if y -\- x \ ^ -\- iief -\- i2{eg -\- ey/A) = jief-\-J2{eg-\-e\/^) for some numbers i i , 22, j i , J2- Comparison of the coefficients of VA shows not only t h a t X = 0 mod e but also t h a t x -\- i2e = J2e; then comparison of the other t e r m s shows t h a t y-\-iief-{-i2eg = jief-\-J2eg = jief-\-{x-\-i2e)g and therefore t h a t y = gx mod ef. Conversely, if x -h ie = je and y + kef = gx -\- lef for numbers z, j , A:, /, then y-\-xy/A-\-kef-hi{eg-\-ey/A) = gx-\-lef -{-jey/A-\-ieg = gje + lef + je\/A = j{eg + ey/A) + lef, so 2/ + xy/A = 0 mod [ef, eg + e\/\A].
Essay 3.2 Modules
77
Completion of the Proof of Theorem 2. Thus, if [e/, eg -f eVA] = [e' f, e'g' + e'y/A\^ then e'^f' + e'^/A = 0 mod [e/, eg + e\/]4], which imphes in particular that e' = 0 mod e. By symmetry, e = 0 mod e', so e = e^ Then e' f = ^ • 0 mod ef implies f' = 0 mod / , and f — f follows as before by symmetry. Finally, eg' + e\fA = 0 mod [e/, eg + e v ^ ] implies eg' = ge mod e/, which is to say g' = g mod / . Since both g and ^' are less than f = f ^ 9 = 9' fohows. Corollary. / / two modules are equal, each can be transformed into the other by a sequence of steps of types (l)-(4)' Deduction. Such steps suffice to transform a module into its canonical form and vice versa. The product of two modules of hypernumbers can be defined, exactly as in the case of modules of numbers, to be the module described by the list containing all products in which one factor is from a list describing the first module and the other factor is from a list describing the second. Products are easily shown to be well defined for modules; that is, if a factor is replaced by an equal module, the new product is equal to the old one. The product operation defined in this way is commutative and associative, which is to say that it makes the set of modules of hypernumbers for a given A into a commutative semigroup. In this semigroup, [1] is an identity. The "modules" described here are closely related to Dedekind's "ideals" in the ring Z[\/]4], but the underlying attitude is opposite to Dedekind's. His goal was to divorce the theory as much as possible from algorithmic techniques, and he felt that he had achieved his goal by considering the infinite set of all ring elements that are zero mod [e/, eg-\-e^/A] to be a mathematical entity. To me, it borders on the absurd to believe that a mathematical idea is made "concrete" [23, Remark 21, p. 60] by describing it as an infinite set whose elements are themselves abstractions. Modules of hypernumbers for a given A are made concrete by specifying how they are to be described (as finite, nonempty lists of hypernumbers between square brackets) and how to compute with them (they are multiplied by the familiar rule, and one determines whether two given modules are equal by reducing them both to canonical form). Examples. When A — 3^ some modules in canonical form are [2,1 + ^ 3 ] , [3, A/S] , [11,5 + Vs], [ll, 6 + \ / 3 ] . Some products of such modules are 2,1 + Vsl [2,1 + V^j = [4, 2(1 + V3), 4 + 2\/3] = [2] [2,1 + A/3, 2 +
A/S
= [2] [2,1 + ^/3,1]= [2], 11, 5 + \/3] [11,5 + V3J = [ l l ^ 11(5 + V^), 28 + 10\/3 121,55 - 28 + (11 - 10)\/3,28 -h 10\/3 = 1121, 27 + VS, 28 + 10\/3 + 2 • 121 - 10(27 + V^)
78
3 Some Quadratic Problems
121,27 + Tsl , 11,5 + \/3l 111,6 + V31 = 1121,11(5 + V3), 11(6 + Vs),33 + llVsj = [11] [ll, 5 + VS, 6 + V3,3 + \/3l - [11] fll, 2,3,3 + \/3l= [11] [ll, 2,1,3 + ^ 1 = [11].
Essay 3.3 The Class Semigroup. Solution of AB -\- B = D.
79
Essay 3.3 T h e Class Semigroup. Solution of An + B = D. ... die schwierigste Frage ... ndmlich die, oh zwei reducirte Formen derselben Determinante, welche verschiedenen Perioden angehoren, dquivalent sein konnen oder nicht. ( . . . the most difficult question . . . , namely, whether two reduced forms with the same determinant t h a t belong to different periods can be equivalent.)—P. G. Lejeune Dirichlet [16, §80] Again let ^ be a fixed number, not a square. As was seen in t h e previous essay, the modules of hypernumbers for A form a commutative semigroup under multiplication, or, to p u t it more simply, the operation of multiplication of modules is commutative and associative. Computations in the semigroup of modules will be used in this essay to solve An -\- B = D. A key role will be played by t h e following notion of equivalence of modules. A module will be called principal* if it can be expressed in the form [?/ + x\/]4] for some hypernumber y-\-xy/A t h a t satisfies y'^ > Ax^. T h e principal modules form a subsemigroup—in other words, a product of principal modules is principal—by virtue of B r a h m a g u p t a ' s formula {y'^ — Ax^){v'^ — Au^) = {yv + Axu)^ — A{yu + xv)'^, because this formula shows t h a t the product [{y + x\^){v + US/A)] = [{yv + Axu) + {yu -f xv)y/A] of [y -\- X^/A] and [^; + 'U\/A] satisfies {yv-{-Axu)^ > A{yu-\-xv)'^ when y'^ > Ax'^ and v'^ > Av?. Two modules M i and M2 will be called e q u i v a l e n t , written M i ~ M2, if there are principal modules P i and P2 for which M i P i = M2P2. This is an equivalence relation (transitivity follows from t h e fact t h a t a product of principal modules is principal, because M i P i = M2P2 and M2P1 = M3P2 imply M i P i P { = M2P2P1 = M3P2P2) t h a t is consistent with multiplication of modules ( M i ~ M2 implies M1M3 ^ M2M3 for any module M3). T h e c l a s s s e m i g r o u p is simply t h e set of equivalence classes, multiplied by multiplying representatives. Otherwise stated, t h e class semigroup is t h e quotient semigroup of t h e semigroup of modules relative to the subsemigroup of principal modules. Computations in t h e class semigroup depend on solving t h e problem of determining whether two given modules are equivalent; this problem, which I will call t h e equivalence problem, is solved by the theorem of this essay. It is the main step in the solution of AU -h P = • • T h e equivalence problem cannot be solved by giving a canonical form t h a t picks one representative out of each equivalence class, because there is no natural canonical form for this particular equivalence relation. Instead, the solution of t h e equivalence problem will follow a procedure like t h e one Gauss used in Section 5 of Disquisitiones Arithmeticae to determine whether two given binary quadratic forms are equivalent; it consists of two parts, the first establishing t h a t every module is equivalent to one in a certain finite set of * This term derives from the fact that the module is in the principal class of the class group. It has always seemed to me peculiar to apply the adjective "principal" to the module itself, but the usage is universal among mathematicians.
80
3 Some Quadratic Problems
Fig. 3.2. Gauss.
stable^ modules, and t h e second giving a method of determining whether two stable modules are equivalent. Specifically, an algorithm—the "comparison algorithm"—will be given for generating a sequence of modules equivalent to a given one. A sequence of equivalent modules generated by the comparison algorithm eventually begins to cycle, as will be shown; a module will be called s t a b l e if the sequence of modules obtained by applying t h e comparison algor i t h m to it cycles back to this module itself. T h e equivalence problem will be solved by showing t h a t the obvious sufficient condition for the equivalence of two modules—namely, t h a t apphcation of t h e comparison algorithm to t h e m leads to the same cycle of stable modules—is also necessary. Thus, the answer to Dirichlet's "most difficult question" is no: Reduced forms in different periods are not equivalent, or, in the present formulation, stable modules in different cycles are not equivalent. By the definition of equivalence, a module [e] [/, g -h \^4] in canonical form is equivalent to [f,g-\-^/A]. Therefore, in solving the equivalence problem one can assume without loss of generality t h a t the given modules in canonical form have e = 1. ^ I have avoided Gauss's term "reduced" because it conflicts with my term "reduction algorithm," an algorithm for reducing a coefficient of VA, not for reducing the module.
Essay 3.3 The Class Semigroup. Solution of AD -\- B = B.
81
Comparison Algorithm. Input: A module [f,g + \/A] in canonical form with e = 1. Algorithm: Let r be the smallest solution ofr-\-g = 0 mod / for which r^ > A. Let A ^ (r2 - A)lf. Let gi be the smallest solution of gi = r mod / i . Output: A module [fi,gi-\-VA] in canonical form with e — 1 and an equation [r + \/A] [/, g -\- y/A] = [/] [/i, gi + ^/A] showing that it is equivalent to the input module. That the definition of/i makes sense—that is, that r'^ = A mod /—follows from r = —g mod / and the fact that ^ is a square root of A mod / . That gi is a square root of A mod / i follows from r = gi mod / i and r'^ — A = ffi. Of course gi < fi, because gi is the smallest number in its class mod / i . Finally, when q is defined hy qf = r -{- g one obtains the output equation [r + V I ] [/, ^ + / A ] = [/(r + y Z ) , r^ + A + (r + g) V I ]
= [/(r + VA), fq{r + VA),rg^r^~
ffi + (r + g)y/A]
= [f{r + VA)Jq{r + ^/A),rfq-ff^^fq^/A] = [f{r + ^/A), ff^^rfq - ff, + fqVI] = [/(r + ^/I),/A] = [/][/i,r + y i ] = [f][f,^g, ^ VJ]. Let the output [/i, gi -h \ / I ] of the comparison algorithm be called the immediate successor of the input [/, g + A / I ] , and let the successors of [/, g+y/A] be the modules in the sequence generated by repeated application of the comparison algorithm. Not only is each successor of [/, g + y/A] equivalent to [/, g -j- \ / I ] , but the algorithm gives an explicit equivalence
(1)
n(n+vi) [/,(/ +VI] =
"fe-1
"
fki9k
where [fi, gi + \ / I ] is the ith successor of [/, g + \/A] = [/o, go + y/A] and where ri is the value of r used by the comparison algorithm to go from [/^_i, ^^_i + ^/A] to [fi,gi^y/A]. Theorem. Let [/, g + \ / I ] and [F, G -\- \/A] be modules in canonical form with e = 1, and let [F, G-\-V\A] be stable. Formula (1) describes all equivalences between [/, g + \ / I ] and [F, G -h \ / I ] ^^ the sense that any equivalence \Y + X^fA][f,g+^fJ] = [V^UVA][F,G^y/A] in which Y^ > AX^ andV^ > AU'^ must satisfy k
(v + UVA) J] {n + VA)
k-1
= (Y + XVA) H
fi,
82
3 Some Quadratic Problems
where k is a number for which [F, G + VA] is the kth successor of [/, g + y/A]. In particular, there are no equivalences when [F, G + y/A] is not a successor
of[f,g + VA]. Equation (1) implies that both coefficients of the hypernumber / n^^]^(ri + VA) are divisible by Hi^o /*• Therefore both coefficients of (ri -\- VA){r2 + VA) • • • (^/C + y/A) are divisible by /1/2 • • • fk-i- Thus, (1) can be divided by /1/2 • • • fk-i^ which will normally be a very large number, to put it in the form
(2)
[y + xVA] [/, g + VA] = [/] [fk, <7fc + VI] where
, + xx/I =
n t i ^ l ± ^ .
The theorem shows that the most general equivalence [Y -f Xy/A][f,g^
y/J] = [V ^ UVA][F,
G+VI]
is obtained from (2) by multiplying by [{V + Uy/A) YliZi fi] ^^^ dividing by
[n-=o/.]. Proposition 1. The number of stable modules is finite, and every module has a stable successor. Proof As above, let [fi.gi + ^/A] be the ith successor of the given module, and let r^ be the number used in passing from [/j_i,^^_i + \/A] to [fi.gi + \/A]. In other words, let r^ be the least solution of r^ + ^^_i = 0 mod fi-i whose square is greater than A. It will be shown that if \ri — / i - i p > A, then | r ^ - / ^ - l p > |r,+i - fi\'^. Note ffist that \ri — / i - i p < ^ if and only if \ri — /^p < A, because both are equivalent to fi-i -\- fi < 2ri, as one sees when one writes them as rf + ff_i < 2rifi-i -i- A and rf -\- ff < 2rifi -\- A, respectively, subtracts A from both sides, and uses rf — A = fi-ifi to obtain fi-ifi + f^_i < 2r^/i_i and fi-ifi + ff < 2rifi^ respectively. In the same way, the three inequalities \ri - / i - i p > A, \ri - Zip > A, and fi-i -\- fi > 2ri all imply one another. Also, on successive steps, the inequality r^ + r^+i > 2fi holds, as can be seen as follows: Because r^-hri-t-i = gi-\-ri-^i = 0 mod fi, it will suffice to prove that ri -\- r^+i > fi. This is true if ri > fi. It is also true if r^ < /z_i, because then rf > rf - A ^ fifi-i > fin, so r^ > fi. Otherwise, /^_i < r^ < fi, in which case (r^ — fi-iY < -A by the definition of r^ {A is not a square, so {ri — fi-iY 7^ A), which implies |r^ — fi\^ < A, as was just seen. Thus, {fi — ^i)'^ < f^i-\-i and fi — ri < r^+i in this case as well. Suppose now that |r^ — fi-i\^ > A. If fi < r^+i, the definition of r^+i implies |r^+i — fi\^ < A, so of course |r^ — / ^ - i p > |r^+i — /^p in that case. Otherwise, r^+i < fi, in which case the inequality of the last paragraph imphes that ri — fi > fi — rij^i > 0. On the other hand, the assumption |r^ —/^_ip > A
Essay 3.3 The Class Semigroup. Solution of AD + B = D.
83
implies fi-i -\- fi > 2ri, as was seen above. Therefore /^_i —ri > ri — fi^ which combines with t h e previous inequality t o give fi-i — Vi > fi — r^+i > 0, from which the desired inequality |r^ — / ^ - i p > |^i+i — / z P follows. Therefore |r^ — / i _ i p decreases as long as it is greater t h a n A, so a step must be reached at which |r^ — / i - i p < A. T h a t t h e same inequality holds on all subsequent steps—which is t o say t h a t Ir^ —/^_i p < A implies |r^+i —/^P < A—can be proved as follows: If |r^—/^_ip < A, then |r^—/^p < A, as was seen. If |r^+i—/^p were greater t h a n A, t h e n fi would be greater t h a n r^+i (r^+i is t h e least number in its class m o d fi whose square is greater t h a n A), in which case t h e above inequality n + r^+i > 2fi would imply U - fi > fi - r^+i > 0, from which \ri - / ^ P > 1/^ — r ^ + i p > A would follow. Therefore, 1/^ — r ^ + i p must be less t h a n A. Thus, t h e sequence of successors of any module eventually reaches a module [/, g-\-\^] in canonical form for which |r — / p < A, where r is t h e least solution of r + ^ = 0 mod / for which r^ > A. Let M. denote t h e set of such modules. T h e set A4 is finite, as one sees when one sets (p = |^ — / | and notes t h a t t h e n (f)^ < A and (j) = =br = =b^ m o d / , so / divides A — (j)"^. In particular, / < A. Since canonical form requires t h a t g be less t h a n / , A1 is therefore finite. T h e comparison algorithm defines a function from A4 t o itself, as was shown above. Since it carries [/,^ + y/A] in A^ t o a module [fi,gi + VA] for which |r — / i p < A, / i and gi determine r as t h e least number in t h e class of gi mod / i whose square is greater t h a n A. (If gf > A, t h e n r = gi; otherwise, r = gi + / i / i for /i > 0.) Therefore, [fi^gi -\- VA] determines r and determines [/, ^ -h y/A] by t h e rules f = {r"^ — A)/fi and g = —r mod / . In short, t h e function from A4 to itself defined by t h e comparison algorithm is one-to-one. Therefore, t h e comparison algorithm permutes t h e finite set A^, which implies t h a t every module in M. is stable—application of t h e comparison algor i t h m to it cycles back to this module itself—and t h e proof of t h e proposition is complete. Moreover, it has been shown t h a t t h e stable modules are precisely those in Ai. (It is not difficult t o show t h a t these are t h e modules [/, g -\- VA] in canonical form in which / divides a number of t h e form A — 0^ and t h e square root g oi A mod / satisfies either g'^ < A o r {f — gY < A.) See the table at t h e end of t h e essay for a list of t h e stable modules for a few values of A and t h e cycles into which they are partitioned by t h e comparison algorithm. T h e first step in finding all equivalences between [/, g + A/A] and [F, G + \ / A ] , where [F,G + ^/A\ is stable, will be t o find all equivalences of t h e special f o r m [ ^ - h x V ^ ] [ / , ^ + \/]4] = [n][F,G^VA] in which ^ - h a ; A / I = 0 m o d [ F , G 4 \fA\. T h e solution of this problem will use t h e following algorithm: Reduction Algorithm. Input: An equation [y -h x^/A][f,g -^ ^/A] = [n][F, G + V l ] in which x > 0, y^ > Ax^^ t h e modules [/, ^ -h \fA\ and [F, G -h \/~A\ are in canonical form, and y + x\fA = 0 mod [F, G + \fA]. ([F, G + ^/A] need not be stable.)
84
3 Some Quadratic Problems
Algorithm: Determine p as the least number congruent to G mod F for which y < px. Define yi -h Xl^/A to be {p - \fA){y + x\/A)/F. Define Fi to be {p^ — A)/F and Gi to be the least solution of p -\- Gi = OmodFi. O u t p u t : A new equation [yi + xi\fA\[f^g + \/]4] = [n][Fi,Gi -h \ / A ] , with Xi < X, which can be used as a new input equation—that is, [-Fi, G i + \/A\ is in canonical form, yi > Ax\^ and y\ + xi\fA = 0 mod [Fi, Gi -h \/^]—unless xi = 0 . Justification. By t h e choice of p, px > y and p = G mod F , so t h e definition of xi as {px — y)/F is valid by virtue of ^ = Gx = px mod F (because y + x\fA = 0 mod [F, G + V ^ ] ) - Moreover, Fxi = px — y < Fx because px — y > Fx would imply p> F and (p — F)x > ?/, contrary to the definition of p. Thus, xi < X. Since p'^x'^ > y^ > Ax'^ implies p^ > A (because x > 0), it follows t h a t [pyY — f? - y^ > A- Ax^ — (Ax)^ and py > Ax; at the same time, py = Gy = G^x = Ax m o d F , which shows t h a t the definition of yi as {py — Ax)/F is valid. T h a t yf > Ax\ follows from (p^ - A){y'^ - Ax'^) > 0 when one rewrites this inequality first as p^y^ -\- A?x^ > Ax'^p^ -\- Ay^ ^ then as {py — Ax)"^ > A{xp — yY^ and divides by F^. Since p^ = G^ = A mod F , the definition of F i as (p^ - A)/F is valid and F i > 0. Also, Gl = {-pf = p'^ = A mod F i by virtue of p^ - yl = F F i , so [ F i , G i + \AA] is in canonical form. W h e n q is defined by p + Gi = g'Fi, one deduces [Fi][F,G + V 3 ] = [Fi][F,p + ^] = [(p - y/A){p + ^ ) , F i ( p + v ^ ) ] = [(gFi-Gi-A/Z)(p+x/I),Fi(p + v^)] = [ ( g F i - G i - y Z ) ( p + x / I ) , F i ( p + \/]4), g F i ( p + VA) - {qFi - G l - V ^ ) ( p + V ^ ) ] (the third entry is q times the second minus the first) = [{qFi - Gi - V ^ ) ( p + \/]4), F i ( p -h \ / A ) , ( G I +
^ ) ( p + v^)] = [Fi(p + ^ ) , ( G i + VI)(p + V^)] = [ p + ^ ] [ F i , G i + VI]. Since (p + V ^ ) ( y i + X I A / A ) = (p^ - ^)(?/ + a:\/]4)/F = Fi(?/ + x\/]4) = 0 mod [Fi][F,G + / A ] , t h e equation [Fi][F,G + V ^ ] = [ p + v ^ ] [ F i , Gi + V A ] implies (p + V A ) {yi-\-Xi ^/A) = 0 mod [p + \/]4] [Fi, Gi + V ^ ] and therefore implies* yi+xi^/A = 0 mod [Fi, Gi + %/]4]. Finally, multiplication of the input equation by [Fi] gives [Fi][?/ + x ^ ] [ / , ^ + / A ] = [n][p + y : 4 ] [ F i , G i + ^ ] ; multiply by [p—V^]—which is valid even though p—y/Ais not a hypernumber because the hypernumbers y-\-xy/A and p + y/A can b o t h be multiplied by p—y/A—to put this equation in t h e form [Fi][F{yi + xiy/A)][f, g-j-^/A] = [n][FFi][Fi, Gi + ^/A] and divide by [FFi] to conclude t h a t the o u t p u t equation holds. T h e theorem will be proved by proving t h a t if [F, G + ^/A] is stable and if the reduction algorithm is applied iteratively until x is reduced to zero, then (1) the terminal equation is obvious from t h e original equation and (2) the steps of the algorithm can be retraced using t h e comparison algorithm * The definitions imply—when use is made of the fact that if a, 6 and c are hypernumbers with c 7^ 0 then ac = be implies a = b—that, for any nonzero hypernumber c and any module M, a congruence ac = be mod [e]M implies a = b mod M.
Essay 3.3 The Class Semigroup. Solution oi AU -{• B = B.
85
to go from the terminal equation back to the original, thereby determining the possible original equations and showing that [F, G -f y/A] is a successor of [f,g + V ^ ] . For example, the input equation [236 + 89\/7][83,16-\-V7] = [83][3, l + \/7] leads to [236 -h 89\/7][83,16 + v^] = [83] [3,1 -f V7] [107 + 40^7] [83,16 + ^ ] = [83] [3,2 + ^ ] [85 + 31v^][83,16 + ^/7] = [83] [6,1 + V7]
{pi = 4), (p2 = 5), {p^ = 7),
[63 + 22A/7][83, 16 + X/7] -
[83] [7, V7]
{PA = 7),
[41 + 13^7] [83,16 + V7] [19 + 4^7] [83,16 + V7] [35 + 3x/7][83,16 + A/7] [51 + 2v^][83,16 + v^] [67 + A/7] [83,16 + 77] [83] [83,16 + / f ]
[83] [6, 5 + ^7] [83] [3,1 + ^7] [83] [14, 7 + ^7] [83] [31,10 + v^] [83] [54,13 + x/7] [83] [83,16 + A/7].
(ps = 5), (pe - 7), (pr = 21), (ps = 41), (pg = 67),
= = = = = =
Each step leaves the second factor on the left and the first factor on the right unchanged. At the last step, the uniqueness of canonical form implies that the two sides are identical. Therefore, the terminal equation [83] [83,16 + \/7] = [83] [83,16 + \/7] is determined without computation by the original one. Moreover, at each step the module on the right will be seen to be the immediate successor of the module below it. In fact, the number pi used to go from equation i — 1 to equation i is the number r used by the comparison algorithm to go from the module in equation i to the one in equation i — 1, which implies that the input equation at the top of the list can be obtained by starting with the identity at the bottom and successively multiplying by 67 + A/7, dividing by 83, multiplying by 41 + \/7, dividing by 54, and so forth, applying the operations to the hypernumbers in the first factors on the left and to the modules in the second factors on the right. As this example indicates, the key fact used to determine the possible input equations is that application of the reduction algorithm to an equation [y + xy/A] [/, g + \fA] = [n] [F, G + ^/A] in which [F, G + VA] is stable produces a sequence of equations [i/i + Xi^/A][f^ g + \/]4] = [n][F^, Gi + ^/A\ in which the immediate successor of [F^, Gi + A/A] is [Fj_i, G^_i + \fA\ and the number Pi used by the reduction algorithm to go from equation i — 1 to equation i is the number used by the comparison algorithm to go from [F^, Gi + y/A\ to its immediate successor. Let a step of the reduction algorithm be called traceable if the number p used to perform it is equal to the number r used by the comparison algorithm to determine the immediate successor of [Fi, Gi + Lemma. A step of the reduction algorithm is traceable if [F, G + \fA\ is stable or if it follows a traceable step. Proof. Let [y + x^/A][f, g + y/A] = [n][F, G + \/A] be an input to the reduction algorithm. To say that the resulting step of the reduction algorithm is
86
3 Some Quadratic Problems
traceable is to say that p = r where p is the number used by the reduction algorithm and r is the number used by the comparison algorithm to determine the immediate successor of [Fi,Gi -f y/A]. Let s be the number used by the comparison algorithm to determine the immediate successor The first step of the proof will be to show that if the step is not traceable, then p-\- s = F. If the step is not traceable, then because p'^ > A and p-\- Gi = 0 mod Fi, and because r is by definition the smallest number for which r'^ > A and r + Gi = 0 mod Fi, p must be at least as great as Fi, and the square of p- Fi must be greater than A. Then {p - Fi^ > A or p^ + Ff > 2pFi + A, from which it follows (subtract A and divide by Fi) that F -\- Fi > 2p and F > p -\- {p — Fi) > p^ so F — p > p — Fi > 0. If p -\- s were greater than or equal to 2F, it would follow that s > F -\- {F - p) > F dnid {s - F)'^ > {F - PY > {p- FiY > A, contrary to the definition of s. Thus, p + s < 2F. Since p + s = G + 5 = 0 mod F , the desired conclusion p-\- s = F follows from the assumption that the step is not traceable. Since p ^ s = F implies |s — F p = p^ > A, which in turn implies that [F, G + \/]4] is not stable (see the proof of Proposition 1), the first statement of the lemma, that if [F, G + y/A] is stable then the step is traceable, follows. Suppose, finally, that the step follows a traceable step of the reduction algorithm. Then the step that it follows is retraced by multiplying by s + \/A and dividing by F . Thus, the previous x is {y + sx)/F. Since the reduction algorithm reduces x, it follows that x < ^^^^, which is to say Fx < y ^ sx. If the step were not traceable, F would be 5 + p, so px + sx would be less than y + sx, and px would be less than ?/, contrary to the definition of p. Therefore, the proof of the lemma is complete. Proposition 2 (Solution of Pell's equation). The only solutions of PelVs equation Ax'^ -\-l = y'^ are those given by the reduction algorithm, namely, the pairs {x,y) given by formula (2) when [f,g + \fA] = [fki9k + \fA] = [!]• Proof. Putting [y^x\fA\ in canonical form when y and x are relatively prime and y'^ > Ax"^ easily gives [y + XVA] — [y'^ — Ax'^^g + V^], where g is determined by y = gx mod (^^ — Ax"^). Therefore, Ax^ + 1 = 7/^ implies [y + x\/]4] = [1]. Conversely, if y^ > Ax^ and [y + XA/A] = [1], then x and y are relatively prime and y^ — Ax^ = 1. In short, solutions of Pell's equation correspond one-to-one to hypernumbers y + xy/A for which y^ > Ax^ and [y + xVA] = [l]. Since [1] is stable, infinitely many of its successors are [1]. Each such successor implies a solution {xk,yk) of Pell's equation given by the formula yk
-^Xk^/A
^Yt
is to be shown is that there iare no others.
Essay 3.3 The Class Semigroup. Solution of AD + 5 = D.
87
But a solution of Pell's equation is, as was just shown, a hypernumber y + x\fA that satisfies [y + xv^][l] — [1]. This equation is an input to the reduction algorithm (write the right side as [1][1,A/A]), and repeated application of the reduction algorithm reduces it to [l][l,\/]4] = [l][l,^/]4]. The input y + x\fA = 1 + 0 • ^/A of course is already reduced and corresponds to the trivial solution A • 0^ + 1 = 1^ of Pell's equation. Otherwise, the reduction requires /c > 1 steps, all steps are traceable, and y + x\/A is obtained when 1 is multiplied by pk + \fA and divided by 1, multiplied by pk-i + ^/A and divided by / ^ - i , and so forth. Since the sequence of p's is the sequence—in reverse order—of r's obtained by applying the comparison algorithm to [1], Proposition 2 follows. For example, when A = 13, the cycle of [1] is [1], [3,1 + Vl3], [4,1 -h vT3], [9,7 + ^13], [12,ll + Vl3], [13,713], [12,1 + 713], [9,2 + ^13], [4,3 + 713], [3, 2 + \/l3], after which the sequence returns to [1] and repeats. The r's used at the successive steps are 4, 5, 7, 11, 13, 13, 11, 7, 5, 4, after which they repeat. Thus the smallest solution of 13a:^ -\-l = y'^ other than the trivial one is given by the coefficients of (4 + 7 l 3 ) ' ( 5 + 713)^(7 + 713)^(11 + 713)^(13 + 713) 32 .42 . 92 .122 . 13
which is easily found to be 649 + 1807l3. That is, the smallest solution of Pell's equation when A = 13 is 13 • 180^ + 1 = 649^ Since (649 + 1807l3)^ = 842401 + 2336407l3, the next smallest solution is 13 • 233640^ + 1 = 842401^ and so forth. (For any A^ as for A = 13, the sequence of r's is in fact a palindrome, so the sequence of p's is identical to the sequence of r's.) Proposition 3. / / [/, g + ^/A\ is principal, then [f,f — g-h VA] is also principal, and the product of these modules is [/]. Proof. Suppose [/, ^ + 7 2 ] = [y-\-xy/A], where y'^ > Ax'^. Since any common divisor of x and y divides the coefficient of \fA in ^f + \fA, x and y are relatively prime. Therefore, the number y'^ —Ax^^ call it TV, is relatively prime to X, and x has a reciprocal, call it r, mod N. Then [y -\- x^/A] = [N, y -\XVA, r{y + X 7 A ) ] = [N,G-\7 3 ] , where G = ry mod N, so f = N, g = G, and y = xry = gx mod A^. The solutions (X, Y) of Pell's equation obviously grow without bound, so there is a solution Y'^ = AX'^ + 1 of Pell's equation in which X > x. Since y^-Ax^ = / > 0, it follows that X'^y^ = AX^x^-^fX^ > AX^x'^-hx^ = Y^x'^, which implies Xy > Yx. Also, Y'^y'^ = A^x^X'^ ^-Ax^ ^ f AX'^ ^ f > A^X'^x^, so Yy > AXx. Therefore, the formula z + wy/A = (Y -\- XVA){y - XVA) defines a hypernumber z -\- wyfA (even though, by the strict definition being used here, y — xyA is not a hypernumber). This hypernumber satisfies [z + w^fA){y + X 7 A ) = ( r + X^fA){y - x^fA){y + x^^A) = ( F + X^fA)f, Thus,
88
3 Some Quadratic Problems
[z + wy/A][y -h x^/A] = [F + Xy/A][f]
= [/], and what is to be shown is t h a t
Now, z^ = {Yy-AxXf = Y'^y^-2AxyXY^A^x^X^ = Y'^y'^-AY^x^ + AY^x^ - 2AxyXY + AX^y^ - AX^y^ + A^x^X^ = {Y^ - AX^){y^ - Ax^) + A{Xy — Yx)'^ = Aw'^-hf. Thus z'^—Aw'^ = / , and it remains only t o show t h a t z = {f—g)w mod / . B u t equating coefficients of VA in {z-{-w^/A){y-\-x^/A) = ( y + X\/A)f gives wy -\- zx = / X , so 0 ^ wy -\- zx = wgx -\- zx mod / , which implies, because x is relatively prime to / , t h a t wg -\- z = 0 mod / , or z = (f — g)w mod / , as was to be shown. Corollary.
A module that is equivalent
to [1] is
principal
Deduction. To say t h a t M is equivalent to [1] means t h a t there are principal modules P i and P2 for which MPi — P2. By Proposition 3, there is a principal module P3 such t h a t P1P3 = [n] for some number n. Thus M[n] = P2P3, which implies M[n\ = [z -{- wy/A]^ where z^ > Aw'^. This equation impHes t h a t n divides b o t h z and i^, so M = [^ + ^^^^1 ^^ principal. Proof of the Theorem. Suppose t h a t [/, g + y/A] and [P, G + ^/A] are equivalent—say [y + xy/A][f,g + y/A] = [v -\- UVA][F,G + y/A] where y'^ > Ax^ and v^ > Au^—and t h a t [P, G + \/]4] is stable. By Proposition 3, there is a hypernumber z + w\fA for which z^ > Aii;^ and [z + i^jv^lit' + u\/A\ = [n] for some number n. Let t h e given equivalence between [/, g + y/A\ and [P, G + \fA\ be multiplied by [P(2; + w\fA)] to yield an equation of the form [Y + X / A ] [/, ^ + \/]4] = [N] [P, G + \/A], where TV = Fn, t h a t is an input to the reduction algorithm. Application of the reduction algorithm reduces this equation to [N][f,g + y/A] = [N][f,g^ \fA]. Since [P, G + \fA] is stable, the steps of the algorithm can be retraced by applying the comparison algorithm to [/, ^ + \ / ^ ] , from which it follows t h a t Y + X\/~A can be obtained by multiplying N hy ri -{- \/]4, dividing by / , multiplying by r2 + \ / ^ , dividing by / i , and so forth, stopping with the kih step, where [P, G + \/~A] is the A:th successor of [/, ^ + \ / ^ ] . In short.
Y ^Xy/A
= N 112 = 0 /^
Since Y + X \ / ] 4 = F{z + it;\/]4)(2/ + x\/]4) and N = P n , the equation F{z + ^ ^ ) ( ? / + x^/A) n t r j / i = ^ ^ n j = i ( n + V ^ ) foUows. The equation k-l
{y + xs/A)
k
J J / i = (i; + w \ / I ) J J ( r , + V I ) Z=0
2=1
of the theorem follows when one multiplies by i; + uyA C o r o l l a r y ( S o l u t i o n of t h e e q u i v a l e n c e p r o b l e m ) . different cycles are not equivalent.
and divides by Fn. Stable modules
in
Essay 3.3 The Class Semigroup. Solution of AD + B = U.
89
Deduction. If two stable modules are equivalent, the theorem implies that each is a successor of the other, so they are in the same cycle. Solution of An^B = D. A solution of Ax^ -\-B = y'^ is called primitive if X and y are relatively prime. The primitive solutions are found in the following way: For each square root p of A mod B, use formula (2) to find all solutions
of the problem [y + x\fA\[B^p^yfA] — [B]. Each pair {x, y) found in this way is a primitive solution of Ax'^ -\- B — y'^, and there are no others. The solutions {x,y) that are not primitive are of the form {ud^vd), where is a square factor of B and (w, v) is a primitive solution of Au^ ~^ ^ ~ v^. Therefore, they can be found by finding all square factors d^ of B that are greater than 1 and, for each of them, using the method just described to find B_ all primitive solutions (u, v) of Au^ Proof. The hypernumbers (3) are the solutions of [y -\- x\fA\[B^p -\- \fA\ = [5][1, yA\ found by the construction of the theorem. Multiplication by [5, B — p + \fA] then gives [y + xV^][5] = [B][B, B - p-^ ^/A], which implies [y + xv]4] = [B, B — p-\-\/A]^ so X and y are relatively prime and satisfy y"^ —Ax"^ = B. Conversely, if x and y satisfy these conditions, then reduction of [^ + x\/]4] to canonical form gives [B^g -\- ^/A] for some square root g of A mod B, so [y + x\^][B^ B — g ^ y/A] = [B] for another square root B — g of A mod 5 , and y + x^/A is among the solutions given by (3). For example, the solution of 79n + 21 = D requires finding the square roots of 79 mod 21. (Note that 21 has no square factors, so all solutions are primitive solutions.) These are easily found by finding the square roots ± 1 of 79 mod 3 and the square roots ± 3 of 79 mod 7 and putting them together using the Chinese remainder theorem to find the four square roots 4, 10, 11, and 17 of 79 mod 21. The module [21,4 + \/79] is stable, and its cycle under the comparison algorithm contains 8 stable modules; since [1] is not among them, the square root 4 of 79 mod 21 gives rise to no solutions of 79n + 21 = D. Similarly, the module [21,17 -h A/79] is stable. Its cycle—which contains the conjugates of the modules in the cycle of [21,4 + \/79], as is shown in the table below—also has length 8 and does not contain [1], so this square root does not give rise to any solutions of 79n + 21 = D either. Application of the comparison algorithm to [21,10 + \/79], on the other hand, reaches [1] in two steps from [21,10 + \/79] to [2,1 + \/79] to [1]; the values of r are first 11 and then 9, so 7/ + x\/79 = (II+V^)(9+A/79) = 89 + 10\/79, and the smallest solution of 79n + 21 = D in the sequence of solutions corresponding to [21,10 + A/79] is 79 • 10^ + 21 = 89^. The next solution is found by taking
90
3 Some Quadratic Problems
t h e comparison algorithm two steps further, which multiplies 89 + 10\/79 by (9+v^K9+x/79) ^ go -f 9 / 7 9 , which of course describes the smallest solution 79 • 9^ + 1 = 80^ of Pell's equation in t h e case A = 79. Since (89 + 1 0 \ / 7 9 ) (80 + 9 v ^ ) = 1 4 2 3 0 + 1 6 0 1 ^ 7 9 , t h e next solution of 790 4-21 = D in this sequence is 79 • 1601^ + 21 = 14230^. More generally, the n t h solution in t h e sequence is contained in the coefficients of (89 + 10\/79)(80 + 9 \ / 7 9 ) ' ' " ^ . In the same way, the fact t h a t [21,11 + v ^ ] ^ [1] leads to an infinite sequence of solutions of 79x^ + 21 = 2/^, namely, the solutions in which x is t h e coefficient of \/79 in (10 + \/79)(80 + 9\/79)'^"^. All solutions are contained in these two infinite sequences. O r b i t s of S t a b l e M o d u l e s for V a r i o u s V a l u e s of A A = 2. (2 modules, 1 cycle) [1]~[2,V21; A = 3. (3 modules, 2 cycles) [1] (Cycle contains just one module.) [2,1 + ^/3] - [3,\/3]; A = 5. (5 modules, 2 cycles) [1] - [4,3 + x/5] - [5, v^] - [4,1 + v ^ ] , [2,1 + V5]; A = 6. (6 modules, 2 cycles) [1]-[3,V6], [2, V6] - [5,4 + V6] - [6, V6] - [5,1 + x/6]; A = 7. (7 modules, 2 cycles) [ l ] - [ 2 , l + x/7], [3,1 + V^] - [6, 5 + V7] - [7, V7] - [6,1 + x/7] - [3, 2 + v/7]; A = 8. (7 modules, 3 cycles) [1], [2,V8]-[4,v^], [7,1 + V8] - [4, 2 + x/8] - [7, 6 + ^/8] - [8, v ^ ] ; A = 10. (10 modules, 2 cycles) [1] - [6,4 + VTO] - [9, 8 + yiO] - [10, \/lO] - [9,1 + \/lO] - [6, 2 + VTO], [2, v ^ ]
-
[3,1 + VW]
-
[5, \/l0]
-
[3, 2 + A/10];
A = 11. {9 modules, 2 cycles)
[i]-[5,4 + A/n]-[5,i + y n ] , [2,1 + x/iI] - [7,5 + \/Ii] - [io,9 + \/TT] - [ii,\/rTl - [10, i + x/TI]
-
[7,2 + A/n]; A = 12. (11 modules, 4 cycles) [l]~[4,x/l2], [2,712], [3,^12] ~ [8,6+\/l2] ~ [ 1 1 , 1 0 + v ^ ] ~ [12,VT2] ~ [11,1 + ^12] ~ [8,2+^12],
Essay 3.3 The Class Semigroup. Solution oi AD -\- B = D.
91
[6,Vl2]-[4,2 + VT2]; A = 13. (13 modules, 2 cycles) [1] - [3,1 + Vl^] - [4,1 + A/T3] - [9, 7 + VT3] - [12,11 + x/l3] - [13, VU] [12,1 + v ^ ] - [9, 2 + VlS] - [4,3 + VTS] - [3, 2 + ^13], [2,1 + v ^ ] - [6, 5 + 713] - [6,1 + 713]; A = 14. (10 modules, 2 cycles) [l]-[2,yi4], [13,1 + ^/I4] - [10, 2 + VTi] - [ 5 , 3 + ^/l4] - [7, VU] - [ 5 , 2 + x/T4] - [10, 8 + Vli] - [13,12 + A/14] - [14, VT4]; ^ = 15. (12 modules, 4 cycles) [1], [5,^/T5]-[2,l + Vl5], [3, 715] - [7,6 + VT5] - [7,1 + yi5], [15, A/15] - [14,l + x/T5] - [11,2+ v ^ ] - [6,3 + ^/15] - [11,9+ v ^ ] [14,13 + VT5]; A = 17. (13 modules, 2 cycles) [1] - [8,5 + ^ - [13,11 + ^17] - [16,15 + ^ - [17,^17] - [16,l + \/l7] [13,2 + x/l7]-[8,3 + Vl7],
[2,1 + v^] - [4,1 + Vrf] - [8,7 + Vrf] - [8,1 + Vrf] - [4,3 + yi7]; A = 18. (12 modules, 2 cycles) [1] - [7, 5 + \/l8] - [9, Vl8] - [7, 2 + / I S ] , [2, Vl8] - [ 9 , 6 + Vl8] - [14,12 + x/Ts] - [17,16 + \/l8] - [18, Vl8] - [17,1 + \/T8] - [14, 2 + VlS] - [9, 3 + A/18];
A = 19. (17 modules, 2 cycles) [1] - [ 6 , 5 + A/19] - [ 5 , 2 + yi9] - [9, 8 + 719] - [9,1 + VT9] - [ 5 , 3 + \/l9] [6,1 + A/T9],
[2,1 + \/i9] - [ 3 , 2 + 719] - [10, 7 + A/19] - [15,13 + 7l9] - [18,17 + \/i9] [19, 7l9] - [18,1 + \/T9] - [15, 2 + \/l9] - [10, 3 + VT9] - [3,1 + \/l9]; A = 20. (14 modules, 3 cycles) [l]-[5,720], [2, 720] - [8,6 + 720] - [10, 720] - [8, 2 + 720], [20, 720] - [19,1 + 720] - [16, 2 + 720] - [11, 3 + 720] - [4, 720] - [11,8 + 720] - [16,14 + 7 ^ ] - [19,18 + 720]; A = 21. (18 modules, 4 cycles) [1] - [4,1 + 72l] - [7, 72l] - [4, 3 + 721], [3, 721] - [5,1 + 72T] - [12, 9 + A/2T] - [17,15 + 721] - [20,19 + 72T] [21, V2i] - [20,1 + 721] - [17, 2 + 72I] - [12, 3 + 721] - [5,4 + 721], [2,l + 72l], [6,3 + 72I] - [10,9 + 72T] - [10,1 + 72I].
92
3 Some Quadratic Problems
Finally, an example that is frequently cited by Gauss.* A = 79. (51 modules, 6 cycles) [ 1 ] - [ 2 , 1 + ^79], [3,1 + ^79] ~ [14,11 + 779] - [15, 2 + A / 7 9 ] - [6,1 + ^79] - [7,4 + ^79], [9,4 + V79] - [13,1 + V79] - [ 5 , 2 + ^79] - [18,13 + ^79] - [25, 23 + ^79] ^ [26,1 + A/79] - [21,4 + A/79] - [10, 7 + ^79], [27,22 + v ^ ] - [ 3 5 , 3 2 + A/79] - [39,38 + ^/79] - [39,1 + ^79] - [35,3 + ^79] [27, 5 + A/79] - [15, 7 + A/79] - [30,23 + A/79] - [43,37 + ^79] - [54,49 + V ^ ] . ^ [63,59 + A/79] - [70,67 + A/79] - [75,73 + A/79] - [78, 77 + A/79] ~ [79, A/79] [78,1 + v ^ ] - [75, 2 + Vi9] - [70, 3 + V79] - [63,4 + ^79] - [54, 5 + A/79] [43,6 + Vf9] - [30, 7 + A/79] - [15,8 + ^79], [9, 5 + A/79] ~ [10,3 + V79] - [21,17 + ^79] - [26, 25 + ^79] - [25, 2 + ^79] [18,5 + A / 7 9 ] - [5,3 + V 7 9 ] - [13,12 + A/79], [3, 2 + A/79] ~ [7,3 + V79] -
[6, 5 + ^79] -
[15,13 + A/79] -
[14,3 + A/79].
* Disquisitiones Arithmeticae, §§185, 186, 187, 195, 196, 198, 223. The reason 79 is of interest is that it is the smallest value of A for which the class group contains a square that is not the identity—for example, [3,1 + A/79]^ ~ [9, 4 + V ^ ] / [1]. Perhaps Gauss's attention was drawn to this case by the fact that it occurs in a counterexample Lagrange gave to a conjecture of Euler [48, Article 84]. Lagrange notes that the problem 79 • D + 733 = D has a solution (the comparison algorithm gives [733, 476 + A/79] - [90, 77 + v/79] - [1]) but the problem 79 • D + 101 = D does not ([101,33 + ^79] - [45,23 + A/79] - [9,4 + A/79] ^ [1]), contrary to a conjecture of Euler that would have implied that the answer to "Does An-\~B = D have a solution?" might, for prime B, depend only on the class of B mod 4A.
Essay 3.4 Multiplication of Modules and Module Classes
93
Essay 3.4 Multiplication of Modules and Module Classes In this essay, the semigroup of modules and the class semigroup are examined more closely. In the semigroup of modules, modules can be decomposed as products of their "p-parts" where p ranges over the primes, and in this way t h e semigroup can be described quite fully, except for the crucial problem of determining the primes p mod which A is a square, which are t h e primes for which [p] is a product in which neither factor is [1]. This question is the subject of Essay 3.5. T h e structure of the class semigroup depends on more subtle considerations, and general statements are harder to come by. T h e theorem t h a t is proved in this essay and t h a t is used in the next to prove the law of quadratic reciprocity merely describes the subgroups of index 2 of the class group in a few simple cases (namely, t h e cases in which A is an odd prime or twice an odd prime or a product of two primes t h a t are congruent mod 4). The computation of products of modules comes down to the computation of products [/, g + \/~A] [F, G + \fA] (where g'^ = A mod / and G'^ = A mod F), because multiplication of a module by [e] is easy. T h e following theorem determines these products when / and F are relatively prime: T h e o r e m 1. / / / and F are relatively prime, [/F, z + V ^ ] ; where z is determined by z = g mod / and z = G mod F. Proof. By t h e Chinese remainder theorem,* t h e congruences z = g mod / and z ^ G m o d F determine a unique z m o d / F , so t h e formula [/F, z -\- y/A] determines a module. T h e desired product is [/F, / ( G + V ^ ) , F{g-\-y/A), {g-\VA){G + VA)], which is [/F, f(z + y/A),F{z + yfA),gG + A + (^ + G ) v ^ ] , because fG = fz mod / F and Fg = Fz mod / F . If / 3 / = aF -\- 1, then z + \fA is t h e difference of (3f{z + \fA) and aF{z -h v ^ ) , so t h e desired product is [fF,z -h VA^gG + A + (^ + G)y/A]. Since A = z'^ m o d / and A = z"^ mod F and since / and F are relatively prime, A = z'^ mod / F ; moreover, {z — g){z — G) = 0 mod / F , so A + gG = z{g + G) mod / F , which implies t h a t gG + ^ in t h e last t e r m can be replaced by z{g -\- G)^ and t h e desired product becomes [/F, z + \/]4, {g -^ G){z + v ^ ) ] = [fF^ z + V ^ ] , as was to be shown. Given a prime p and a module [/, g + \fA\, let t h e p - p a r t of [/, g + vC4] be the module [p^^g -\- \ / ^ ] , where n is the number of times p divides / . (If p does not divide / , the p-part of [/, ^ + ^fA\ is [1] by this definition.) By Theorem 1, every module is the product of its p-parts, and one can find t h e product of [/, g -f- \fA\ and [F, G + vG4] by finding t h e product of their p-parts for each prime divisor p of / F , which reduces t o finding t h e product of the p-parts for t h e primes p t h a t divide b o t h / and F . In short, the computation of [/, g + \fA\ [F, G + \fA\ can be done prime by prime. For all b u t a very few primes, the needed products are given by the three propositions t h a t follow. * See Essay 3.2.
94
3 Some Quadratic Problems
Proposition 1. Let p be an odd prime that does not divide A. If A is not a square mod p, there are no modules [/, g + A/A] in canonical form other than [1] in which f is a power of p. If A is a square mod p, there are exactly two modules [p^ ^g -\- \/A\ in canonical form for each n > 0^ and they are the nth powers of those in which n = 1. The product of the two in which n = 1 is [p]. Thus, a product of the form [p'^^g + A/]4][^^, G + y/A] can be found by writing it as [p, ^ + \/]4]^[p, G + A/Z]^ and observing that the theorem imphes that their product is [p,g + \/A]'^+'' if [p,g + VA] = [p,G -\- VA], and is [j9]^[p, G + \ / ] 4 ] ^ - ^ or [p]^[p, g + \ / ] 4 ] ^ - ^ in the obvious way 'ii\p,g + VA]^ [P.G^VA]. Proof Because a polynomial of degree n with integer coefficients that is not zero mod p has at most n roots mod p, A has at most two square roots mod p. Because —g is a square root of A mod p whenever g is, and because g and —g are different mod p when this is the case (if they were the same, then 2g would be zero mod p so AA = {2gY = 0 mod p, contrary to hypothesis), A has either no square roots mod p or exactly two. When it has two, and when g < p is one of them, the product [p, g + \/]4][p,P — ^ + VA] is [p^,p{p — g ^ ^/^)iP{9 + ^/^)iP9 — g'^ -\- A -\- py/A]. The third term minus the second is 2pg mod p^ and [p^, 2pg] = [p] (again, because the square of 2g is not divisible by p and p is prime), so the first term p^ can be replaced by p, and the module is equal to [p]. If, for some n > 1, gn-i is a square root of A modp^~^, then there is a unique square root of A mod p^ that is congruent to gn-i modp^~^, because the formula {gn-i + l3p^~^Y = A m o d p ^ implies 2(3gn-i = {A— ^^_i)/p^~^ mod p, which determines /? mod p because 2gn-i is relatively prime to p. Therefore, for each value of n and for each square root g of A mod p there is exactly one square root of A mod p^ that is g mod p; call it gn. If [p,^ + ^ ] " - ^ = [p^-\gn-i + VA], then the same formula holds with n in place of n - 1, because [p,^ + y/A]'^ = [p'^~^,gn-i + ^/A][p,g 4- VA] = [p^-\gn^VA][p,gn + VA] = [p^,p{gr^ + ^/A), gl ^ A + 2gnVA] = [p",p(^n + VA),2gn{gn + VA)] = [p^.g^ + VA] (because [p,2^,] = [1]). Thus [p,^ + VA]is the unique module [p^,G -\- y/A] in canonical form in which G = g mod p, as was to be shown. Proposition 2. If p is a prime that divides A once but not twice, the only module [p^,^ -f vA] in canonical form in which n > 0 is [p, V ^ ] ; the square
of[p,VA] is [p]. Proof If g were a square root of A mod p^ for n > 1, then p would divide g^ and therefore would divide g itself, so p^ would divide g^ = A mod p^, contrary to the assumption that A^O mod p^. Therefore, the only module [p^,g-\-\/A] in canonical form in which n > 0 is [p, \/A] because g"^ = A = 0 mod p implies ^ = 0 mod p. The square of this module is [P^,PA/]4, A] = [p], because [p^,^] = [p] by assumption.
Essay 3.4 Multiplication of Modules and Module Classes
95
Proposition 3. If A is odd, the modules in canonical form [2^,^ + v ^ ] with n > 0 are as follows: (i) When A = 3 mod A, [2,1 + A/Z] is the only one; its square is [2]. (a) When A = b mod 8, there are three: a = [2,1 + ^/A], /? = [4,1 + \fA], and (5 = [4, 3 + yA\. The product of a with any of the three is [2\a, whereas p^ = [2]~P, 'f = [2]/3 and (3p = [4]. (Hi) When A = 1 mod 16, let a = [2,1 + VA], /? = [8,5 + VA], and P = [8,3 + y/A]. The modules in question are a and four infinite sequences of modules /^^/[2^-i], ^''/[2''-^], a/3^/[2^], and op /['^"'] for n > 0, these modules being distinct from one another. They can be multiplied using o? — \2\a andf5p^ [8]. (iv) When A = 9 mod 16, the answer is given by (Hi) when (5 is changed to [8,1 + y/A] and ^ to [8, 7 + y/A]. Proof, (i) The square of any odd number is 1 mod 4, so A = 3 mod 4 implies that no module [2^,^ -f v ^ ] is in canonical form when n > 1. The square of [2,1 + \/A] is [4,2 + 2 A / I , A + 1 + 2y/A] = [4,2 + 2y/A, A - 1], which is [2] because [A, A - 1] = [2]. (ii) Similarly, the square of any odd number is 1 mod 8, so ^ = 5 mod 8 implies that there are no modules [2^, p -h A/A] in canonical form in which n > 2. The multiplication formulas that are given are easy to verify. For example, [4,1 -f- y/Af = [16,4(1 -f \/]4), 1 + A + 2y/A]] twice the third term minus the second is 2+2A—A — 2(^1—1) = 8 mod 16, so the 16 in the first term can be replaced by 8, after which the second term can be dropped because it can be expressed in terms of the first and third, resulting in [8, H-A-f2\/]4] =
[2][4,3 + y i ] . (iii) and (iv) Let .A be 1 mod 8. For each n>l, there is a unique solution gn < 2^+2 of gl = A + 2^+^ ^^^ 2^+^ for which gn = 1 mod 4. In fact, ^1 = 5 is determined by these conditions when A = 1 mod 16, and gi = 1 is determined by them when A = 9 mod 16. For n > 1, knowledge of gn-i enables one to find gn in the following way. The congruence h^ = A.+2^"^^ mod 2n+3 Q£ which gn is a root implies, because g^_i = A-\- 2^+^ mod 2^^+^, that h^-gl_i = 2^+1 mod 2^+2. If /i = 1 = gn-i mod 4, then /i + ^n-i is divisible by 2 but not 4, so the congruence {h -\- gn-i){h — gn-i) = 2^^^ mod 2^^+^ imphes that h — gn-i is divisible by 2^ but not 2^'^^. Thus h = gn-i + 2^ mod 2^^+^. In short, if the conditions on gn can be met, then gn = gn-i + 2^ mod 2^+^. The two possible values gn-i =t 2^ of gn mod 2^+^ determined in this way have squares that differ by 2^^+^ mod 2"^+"^, so the condition g'^ = A + 2^+^ mod 2^"^^ is satisfied by exactly one of them. The sequence ^1, ^2, 93 j • • • determined in this way describes the modules /3^/[2'^~^] — [2^+^, ^n H- VA], as can be seen as follows: By the very definition of ^1, P = [8,^1 + y/A] in both (iii) and (iv). What is to be shown, then, is that [8,^1 + \/]4][2^+\^n_i + VA] = [2][2^+^^n + VA]. The product on the left side is [2^^\S{gn-i + y/A),2^^^{gi-^VA),gign-i-hA + {gi+gn-i)VA]. Because gn-i = gn + 2'' mod 2 ^ + \ one has 8gn-i = 8gn + 2^+^ mod 2^+^,
96
3 Some Quadratic Problems
so the second term can be changed to 8{gn + y/A) -h 2"^+^. Similarly, the third term can be changed to 2''^^{gn + VA) + 2"'+^. (Use ^i = ^2 + 4 mod 8 and g2 = Qn mod 8.) Finally, the congruences g^ = gi + 4 mod 8 and gn = gn-i + 2- mod 2-+1 imply {g^ - gi){gn - 9n-i) = 2^+^ mod 2-+^ which combines with A = g'^ -\- 2"^+^ mod 2^^+"^ to give A -\- gign-i = 9n{9n-i + ^fi) mod 2^+^, and the product [8,^i + \/]4][2^+-^,^^_i + \/]4] can be written as [2"+^8(5n + y I ) + 2"+^2"+l(9n + V I ) + 2"+^(5l+5„-l)(5r^ + VA)+2"+3a], where a = 0 or 1. The diflFerence between ^^ ^"^"^ times the second term and 4 times the last term is 2"^+^ mod 2^+"^, because ^^"^^"""^ is odd. Thus the first term can be changed to 2^+^, and the desired product can be expressed as [2"+^ ^{gn + v ^ ) , 2^^\9n + VC4), (^1 + ^n-i)(^n + v ^ ) ] - The third term is a multiple of the second and can be dropped. Because [8,^1 + gn] = [2], this brings [8,^i + \ / I ] [ 2 ^ + \ ^ n _ i + \ / I ] to the desired form [2-2^+^ 2(^^ + V^)]. The sequence ^1, '§2^ ^25 • • • defined by 'g^ = —gn mod 2^"^^ satisfies the same conditions as the sequence ^ 1 , ^2, S's • • •, except that the condition gn = I mod 4 is replaced by ^^ = 3 mod 4. Therefore, the same argument gives ;5''/[2^-i] = [2^+2^-^^ + VA\ = [2'^+^^^ + \ / I ] . For n > 1 there are four modules of the form [2^~^^,g + V ^ ] , one for each of the four square roots of A mod 2^+^, which are ib^^ and ih^^ + 2^"*"^. The first two have been 77,4-1
accounted for. The remaining two are a/?^^^/[2"^+^] and a(3 /[2^+^], as follows from the observation that the last term in [2,1 + \/]4][2^'^'^, :^gn-\-i + y/A] = [2-+^2(±^,+l + ^ ) , 2 - + 3 ( l + v ^ ) , ± ^ , + l + A + ( l ± ^ , + l ) ^ / I ] can be changed to (1 ± ^n+i)(±^n+i) + 2""+^ + (1 ± ^n+i)V^, which is 2^+^ plus a multiple of the second term; therefore, the first term can be replaced with 2^+^, so that the module becomes [2^+^, 2(±c/n+i + V^)] = [2][2^+^ zb^f^ + 2'^+^H-\/]4], as was to be shown. When n = 0 the result is [2] [4, ±l+\/]4], which accounts for the two modules aP/[2] = [4,1 + y/A\ and a^/[2] = [4,3 + \/]4] and completes the proof. These three propositions cover all products [/, g + \/]4] [F^ G + y/A] except those in which some prime p divides both / and F and divides A twice. In particular, if A is square-free, it describes all products. The description of products of equivalence classes of modules is in principle much easier, because the number of equivalence classes is finite, so one can simply compile a multiplication table showing all products of all pairs of classes. However, multiplication tables are rarely very enlightening. More insight into the class semigroup is obtained by considering specific features. In particular, as Gauss's work in Section 5 of Disquisitiones Arithmeticae showed, enough information about the class semigroup on which to base a proof of quadratic reciprocity is provided by analyzing the classes that are ambiguous in the sense defined below. Lemma. / / [/, g + y/A] is stable and if [/i, gi + y/A\ is its successor in the comparison algorithm, then [/, f—g-\-y/A] is the successor o/[/i, / i —gi-\-VA] in the comparison algorithm.
Essay 3.4 Multiplication of Modules and Module Classes
97
Proof. By definition, [/i, gi + VA] is determined by / / i = r'^ — A and gi = r mod / i where r is the least solution of r + ^f = 0 mod / whose square is greater t h a n A. Similarly, t h e successor of [/i, / i — ^i + \ / ^ ] is [f^g^ + V ^ ] where / ' / i = r^ — ^ , ^' = r i mod f\ and r i is t h e least solution of r i = gi mod / i whose square is greater t h a n A. It was shown in Essay 3.3 in t h e proof t h a t t h e comparison algorithm permutes stable modules t h a t r is t h e least number in its class mod / i whose square is greater t h a n A. T h u s , since r i and r are b o t h gi mod / i , r i = r, which implies f = f and g' = ri = —g mod / , as was t o be shown. Thus, if [/, g -\- y/A] is stable, t h e cycle of [f,f — g-\- y/A] contains t h e modules obtained by changing g to f — g in t h e modules in t h e cycle of [f,g + v A ] , but they are traversed in t h e opposite direction. In particular, if [fif~9~^ VA] ^ [/, ^ -h y/A] holds for one module in a cycle it holds for all W h e n this is t h e case, t h e cycle is called a m b i g u o u s . Let Ml, M2, • . . , Mjy be t h e modules in an ambiguous cycle in t h e order given t h e m by t h e comparison algorithm. Let t h e definition of Mi be extended t o all integers i by setting Mi = Mj whenever i = j mod z/, and, for Mi = [fi 5 9i + VA] •> let Mi denote [/^, fi — gi-^ y/A]. Call a stable module Mi p i v o t a l if (1) Mi = Mi or (2) Mi = M^_i. An ambiguous cycle contains exactly two pivotal modules—unless it contains just one module—as can be seen as follows: Let t h e given cycle be ambiguous and let /i > 0 satisfy MQ = M ^ . By t h e lemma, M i = M ^ _ i , M2 = M ^ _ 2 , and so forth. If /i > 1 renumber t h e modules in t h e cycle by setting M / = M^+i. T h e n M / = M^+i = M ^ _ i _ i = -M^_^_2, so t h e renumbering of t h e modules has t h e effect of reducing /i by 2. In this way, // can be successively reduced until it is 0 or 1. If // = 0, t h e n Mi — M(^_i) = M^^^i for each z, which is to say Mi — Mj^-i, so Mi is pivotal of t y p e (1) if and only iii = —i mod u and pivotal of t y p e (2) if and only if i = 1 — i mod ly. T h u s , when z/ = 2cr for a > 0 t h e only pivotal modules are MQ and M^ (because 0 and a are t h e only numbers i less t h a n u for which 2i = 0 mod 2a and 2i = 1 m o d 2cr has no solutions at all) and when z/ = 2 r -f 1 t h e only pivotal modules are MQ and M^-^-i. Similarly, if /i = 1, t h e n Mi = Mi^+i_^, so Mi is pivotal of t y p e (1) if and only if i = 1 — i m o d v and pivotal of type (2) if and only if i = 2 — z mod u, from which it follows t h a t there are two pivotal modules when z/ = 2(j for cr > 0, namely, M i and M0-+1, and two pivotal modules when u = 2 T -h 1, namely. M i and M ^ + i . T h a t there are two pivotal modules unless u = 1 follows from t h e observation t h a t the modules given by these formulas are distinct unless 1/ = 1. T h e o r e m 2. (a) If A is an odd prime, there are four pivotal modules, [1,VA], [2,1 -h VA], [A,y/A], and [ ^ ^ , 1 + y/A] (except that in the cases A = 3 and A = b the last of these coincides with one of the first two to form a cycle of length 1). (b) If A is twice an odd prime, say A = 2p, there are four pivotal modules, [1,VA], [2,VA], [P,VA], and[A,^/A].
98
3 Some Quadratic Problems
(c) If A is a product of two odd primes, say A = pq, where p < q, there are eight pivotal modules, [1, ^/A], [p, \/]4], [q, VA], [A, ^/A], [2,1 + VA], [2p,p-\\/A], [^^y^, 1 + VA] cind [ ^ ^ , p + \fA\ (except that the last of these coincides with one of the others to form a cycle of length 1 if q — p — 2 or 4). Thus, in cases (a) and (b) there are 2 ambiguous cycles, and in case (c) there are four. Proof (a) A module [/, g + y/A] in canonical form is pivotal of type (1) if and only if ^ = —g mod / . W h e n this is the case, 2g = 0 mod / and 4A = (2^)^ = 0 mod / ; t h a t is, / is a factor of 4A. Since A is an odd prime, / = 1, 2, 4, or A, because / < A in a stable module. Since f = 4 would imply 2g = 0 mod 4 and ^ = 0 mod 2, it is impossible in view of ^^ = A mod / . Therefore, the only possible pivotal modules of type (1) in this case are [l,v^], [2,1 + / A ] , and [A, v ^ ] , all of which are clearly pivotal of type (1). If [/, ^ + y/A] is pivotal of type (2), then its predecessor in t h e comparison algorithm is [f,f — g-\- V ^ ] , and the r t h a t determines the step from [f^f — g-\- VA] to [/,g-\-y/A] satisfies p ^ y.2 _ ^ Thus, A = {r - f){r -\- f), which implies t h a t r - / = 1 and r-\-f = A and therefore t h a t / = ^ ^ , r = ^-^. Since the new g is congruent to r mod / , and since r = 1 mod / , the only possible pivotal module of type (2) is M ^ , l + \/]4 , which is in fact pivotal of type (2). (b) As in the proof of (a), if [/, g + ^/A] is pivotal of type (1), then 4^4 = 0 mod / and / < A, so / = 1, 2, 4, p, or 2p. Again, / = 4 is impossible because it would imply ^4 = 0 mod 4, so the only pivotal modules of type (1) are the ones listed in (b). There are no pivotal modules of type (2) because A = 2 mod 4, so r^ — f^ = A is impossible. (c) If / is a factor of 4^4 less t h a n or equal to A, then / = 1, 2, 4, p, g', 2p, 2g, or A = pq. Since [2g, q + \/A] is not stable (both q'^ and {2q — q)'^ are q^ > pq =^ A)^ the only possible pivotal modules of type (1) are [1], [2, 1 + A/A], [p, vA], [q^ A / ^ ] , [2p^p + vA], and [A^ \A]^ all of which are indeed pivotal of type (1). Those t h a t are pivotal of type (2) satisfy A = {r — f){r -\- f) as in the proof of (a), where r is t h e number used by the comparison algorithm to go to the pivotal module from its predecessor. Thus, either r — / = 1 and r-\-f = A or r — f = p and r + / = g. In t h e first case, r = 1 mod / , so the module must be
^ ^ ^ , 1 + y/Al,
module must be
^,P
and in the second case, r = p mod / , so the
+ VA which completes the list.
The complications t h a t arise in the cases A = 1 mod 4 of Proposition 3 stem from the fact t h a t in these cases the class semigroup is not a group, which is to say t h a t there are classes without inverses. For example, the square of [2,1 + \/5] is [2] [2,1 + V^], but [2,1 + V^] constitutes a cycle of length 1 and is therefore not equivalent to [1]. Therefore, the class of a = [2,1 + \/5] has no inverse because a^ ~ [1] would imply a = Q;[1] ^ a'^^y = [2] 0^7 ^ 0^7 ^ [1]. A module whose class is invertible in the class semigroup is called p r i m i t i v e .
Essay 3.4 Multiplication of Modules and Module Classes
99
The class group for a number A, not a square, consists of the invertible elements of the class semigroup, those classes whose elements are primitive. For any given A, the class semigroup is found by finding the cycles of stable modules. One can then find the class group by using the following theorem to determine which cycles contain primitive modules: Theorem 3. Let [e][/, ^ + y/A] be a module in canonical form, and let d he the greatest common divisor of f, 2g, and '^ 7 ^ if d = 1, then [f,g + y/A][f,f — g -\- y/A] = [/]; in particular, [e][f,g + \/]4] is primitive, because the class of [f, f — g -\- A/]4] is inverse to its class. If d > 1, [e][f,g + ^/A] is not primitive. In particular, if A = 1 mod 4, the module [2,1 + y/A] is not primitive, because in this case d = 2. Proof. By direct computation
[f,g+y/A][f,f-g+VA]
= [f, -fg + fVAJg + fVAJg-g^ = [f, -2fg,fg + fVA,\g^= [/]
+A
•/VA]
'f,2gJ-lf^,g + VA
= [/]['i,g + \/A], where use is made of the first term /^ to compute with the coefficients of the other terms as numbers mod /^. If d = 1, this product is [/], which proves the first statement.
Now, [d,g + VA][f,g + VA] = [df,d{g + VA),g^ + A + 2g^]
= [df,dig +
VA),A — g'^] (subtract 2g/d times the second term from the third, computing mod df) = [d][f^g + ^/~A\ (because g^ = Axnoddf). Therefore [d,g + y/A][f,g + VA] = [d][f,g ^ yfA] - [/,^ + A / I ] , which shows that ^