SYMMETRIC POLYNOMIALS
|
|
- Thomas Adams
- 5 years ago
- Views:
Transcription
1 SYMMETRIC POLYNOMIALS KEITH CONRAD Let F be a field. A polynomial f(x 1,..., X n ) F [X 1,..., X n ] is called symmetric if it is unchanged by any permutation of its variables: for every permutation σ of {1,..., n}. f(x 1,..., X n ) = f(x σ(1),..., X σ(n) ) Example 1. The sum X 1 + +X n and product X 1 X n are symmetric, as are the power sums X r Xr n for any r 1. Example 2. Let f(x 1, X 2, X 3 ) = X X 2X 3. This polynomial is unchanged if we interchange X 2 and X 3, but if we interchange X 1 and X 3 then f becomes X X 2X 1, which is not f. This polynomial is only partially symmetric. An important collection of symmetric polynomials occurs as the coefficients in the polynomial (1) (T X 1 )(T X 2 ) (T X n ) = T n s 1 T n 1 + s 2 T n 2 + ( 1) n s n. Here s 1 is the sum of the X i s, s n is their product, and more generally s k = X i1 X ik 1 i 1 < <i k n is the sum of the products of the X i s taken k terms at a time. The s k s are all symmetric in X 1,..., X n and are called the elementary symmetric polynomials or elementary symmetric functions in the X i s Example 3. Let α = and β = Although α and β are not rational, their elementary symmetric polynomials are: s 1 = α + β = 3 and s 2 = αβ = 1. Example 4. Let α, β, and γ be the three roots of T 3 T 1, so T 3 T 1 = (T α)(t β)(t γ). Multiplying out the right side and equating coefficients on both sides, the elementary symmetric functions of α, β, and γ are s 1 = α + β + γ = 0, s 2 = αβ + αγ + βγ = 1, and s 3 = αβγ = 1. Theorem 5. The set of symmetric polynomials in F [X 1,..., X n ] is F [s 1,..., s n ]. That is, every symmetric polynomial in n variables is a polynomial in the elementary symmetric functions of those n variables. Example 6. In two variables, the polynomial X 3 + Y 3 is symmetric in X and Y. As a polynomial in X + Y and XY, X 3 + Y 3 = (X + Y ) 3 3XY (X + Y ) = s 3 1 3s 1 s 2. 1
2 2 KEITH CONRAD Our proof of Theorem 5 will proceed by induction on the multidegree of a polynomial in several variables, which is defined in terms of a certain ordering on multivariable polynomials, as follows. Definition 7. For two vectors a = (a 1,..., a n ) and b = (b 1,..., b n ) in N n, set a < b if, for the first i such that a i b i, we have a i < b i. Example 8. In N 4, (3, 0, 2, 4) < (5, 1, 1, 3) and (3, 0, 2, 4) < (3, 0, 3, 1). For any two n-tuples a and b in N n, either a = b, a < b, or b < a, so N n is totally ordered under <. (For example, (0, 0,..., 0) < a for all a (0, 0,..., 0).) This way of ordering n-tuples is called the lexicographic (i.e., dictionary) ordering since it resembles the way words are ordered in the dictionary: first order by the first letter, and for words with the same first letter order by the second letter, and so on. It is simple to check that for i, j, and k in N n, (2) i < j = i + k < j + k. A polynomial f F [X 1,..., X n ] can be written in the form f(x 1,..., X n ) = c i1,...,i n X i1 1 Xin i 1,...,i n We will abbreviate this in multi-index form to f = i c it i, where T i := X i 1 1 Xin n i = (i 1,..., i n ). Note T i T j = T i+j. Definition 9. For a nonzero polynomial f F [X 1,..., X n ], write f = i c it i. Set the multidegree of f to be mdeg f = max{i : c i 0} N n. The multidegree of the zero polynomial is not defined. If mdeg f = a, we call c a T a the leading term of f and c a the leading coefficient of f, written c a = lead f. Example 10. mdeg(7x 1 X X 2) = (1, 5) and lead(7x 1 X X 2) = 7. Example 11. mdeg(x 1 ) = (1, 0,..., 0) and mdeg(x n ) = (0, 0,..., 1). Example 12. The multidegrees of the elementary symmetric polynomials are mdeg(s 1 ) = (1, 0, 0,..., 0), mdeg(s 2 ) = (1, 1, 0,..., 0),..., and mdeg(s n ) = (1, 1, 1,..., 1). For k = 1,..., n, the leading term of s k is X 1 X k, so the leading coefficient of s k is 1. Example 13. Polynomials with multidegree (0, 0,..., 0) are the nonzero constants. Remark 14. There is a simpler notion of degree of a multivariable polynomial: the largest sum of exponents of a nonzero monomial in the polynomial, e.g., X 1 X X2 1 has degree 4. This degree has values in N rather than N n. We won t be using it; the multidegree is more convenient for our purposes. Our definition of multidegree is specific to calling X 1 the first variable and X n the last variable. Despite its ad hoc nature (there is nothing intrinsic about making X 1 the first variable), the multidegree is useful since it permits us to prove theorems about all multivariable polynomials by induction on the multidegree. The following lemma shows that a number of standard properties of the degree of polynomials in one variable carry over to multidegrees of multivariable polynomials. n. for
3 SYMMETRIC POLYNOMIALS 3 Lemma 15. For nonzero f and g in F [X 1,..., X n ], mdeg(fg) = mdeg(f) + mdeg(g) in N n and lead(fg) = (lead f)(lead g). For f and g in F [X 1,..., X n ], mdeg(f + g) max(mdeg f, mdeg g) and if mdeg f < mdeg g then mdeg(f + g) = mdeg g. Proof. We will prove the first result and leave the second to the reader. Let mdeg f = a and mdeg g = b, say f = c a T a + i<a c it i with c a 0 and g = c b T b + j<b c j T j with c b 0. This amounts to pulling out the top multidegree terms of f and g. Then fg has a nonzero term c a c b T a+b and every other term has multidegree a + j, b + i, or i + j where i < a and j < b. By (2), all these other multidegrees are less than a + b, so mdeg(fg) = a + b = mdeg f + mdeg g and lead(fg) = c a c b = (lead f)(lead g). Now we are ready to prove Theorem 5. Proof. We want to show every symmetric polynomial in F [X 1,..., X n ] is a polynomial in F [s 1,..., s n ]. We can ignore the zero polynomial. Our argument is by induction on the multidegree. Multidegrees are totally ordered, so it makes sense to give a proof using induction on them. A polynomial in F [X 1,..., X n ] with multidegree (0, 0,..., 0) is in F, and F F [s 1,..., s n ]. Now pick an d (0, 0,..., 0) in N n and suppose the theorem is proved for all symmetric polynomials with multidegree less than d. Write d = (d 1,..., d n ). Pick any symmetric polynomial f with multidegree d. (If there aren t any symmetric polynomials with multidegree d, then there is nothing to do and move on the next n-tuple in the total ordering on N n.) Pull out the leading term of f: (3) f = c d X d 1 1 Xdn n + i<d c i T i, where c d 0. We will find a polynomial in s 1,..., s n with the same leading term as f. Its difference with f will then be symmetric with smaller multidegree than d, so by induction we ll be done. By Example 12 and Lemma 15, for any nonnegative integers a 1,..., a n, mdeg(s a 1 1 sa 2 2 san n ) = (a 1 + a a n, a a n,..., a n ). The ith coordinate here is a i + a i a n. To make this multidegree equal to d, we must set (4) a 1 = d 1 d 2, a 2 = d 2 d 3,..., a n 1 = d n 1 d n, a n = d n. But does this make sense? That is, do we know that d 1 d 2, d 2 d 3,..., d n 1 d n, d n are all nonnegative? If that isn t true then we have a problem. So we need to show the coordinates in d satisfy (5) d 1 d 2 d n 0. In other words, an n-tuple which is the multidegree of a symmetric polynomial has to satisfy (5). To appreciate this issue, consider f = X 1 X X 2. The multidegree of f is (1, 5), so the exponents don t satisfy (5). But this f is not symmetric, and that is the key point. If we took f = X 1 X X5 1 X 2 then f is symmetric and mdeg f = (5, 1) does satisfy (5). The verification of (5) will depend crucially on f being symmetric.
4 4 KEITH CONRAD Since (d 1,..., d n ) is the multidegree of a nonzero monomial in f, and f is symmetric, every vector with the d i s permuted is also a multidegree of a nonzero monomial in f. (Here is where the symmetry of f in the X i s is used: under any permutation of the X i s, f stays unchanged.) Since (d 1,..., d n ) is the largest multidegree of all the monomials in f, (d 1,..., d n ) must be larger in N n than any of its nontrivial permutations 1, which means d 1 d 2 d n 0. That shows the definition of a 1,..., a n in (4) has nonnegative values, so s a 1 1 san n is a polynomial. Its multidegree is the same as that of f by (4). Moreover, by Lemma 15, lead(s a 1 1 san n ) = (lead s 1 ) a1 (lead s n ) an = 1. Therefore f and c d s a 1 1 san n, where c d = lead f, have the same leading term, namely c d X d 1 1 Xdn n. If f = c d s a 1 1 san n then we re done. If f c d s a 1 1 san n then the difference f c d s a 1 1 san n is nonzero with mdeg(f c d s a 1 1 san n ) < (d 1,..., d n ). The polynomial f c d s a 1 1 san n is symmetric since both terms in the difference are symmetric. By induction on the multidegree, f c d s a 1 1 san n F [s 1,..., s n ], so f F [s 1,..., s n ]. Let s summarize the recursive step: if f is a symmetric polynomial in X 1,..., X n then leading term of f is c d X d 1 1 Xd n 1 n 1 Xdn n = mdeg(f c d s d 1 d 2 1 s d n 1 d n n 1 s dn n ) < mdeg(f). Example 16. In three variables, let f(x, Y, Z) = X 4 + Y 4 + Z 4. We want to write this as a polynomial in the elementary symmetric polynomials in X, Y, and Z, which are s 1 = X + Y + Z, s 2 = XY + XZ + Y Z, s 3 = XY Z. Treating X, Y, Z as X 1, X 2, X 3, the multidegree of s a 1 sb 2 sc 3 is (a + b + c, b + c, c). The leading term of f is X 4, with multidegree (4, 0, 0). This is the multidegree of s 4 1 = (X + Y + Z) 4, which has leading term X 4. So we subtract: f s 4 1 = 4x 3 y 4x 3 z + 6x 2 y 2 12x 2 yz 6x 2 z 2 4xy 3 12xy 2 z 12xyz 2 4xz 3 4y 3 z 6y 2 z 2 4yz 3. This has leading term 4x 3 y, with multidegree (3, 1, 0). This is (a + b + c, b + c, c) when c = 0, b = 1, a = 2. So we add 4s a 1 sb 2 sc 3 = 4s2 1 s 2 to f s 4 1 to cancel the leading term: f s s 2 1s 2 = 2x 2 y 2 + 8x 2 yz + 2x 2 z 2 + 8xy 2 z + 8xyz 2 + 2y 2 z 2, whose leading term is 2x 2 y 2 with multidegree (2, 2, 0). This is (a+b+c, b+c, c) when c = 0, b = 2, a = 0. So we subtract 2s 2 2 : f s s 2 1s 2 2s 2 2 = 4x 2 yz + 4xy 2 z + 4xyz 2. The leading term is 4x 2 yz, which has multidegree (2, 1, 1). This is (a + b + c, b + c, c) for c = 1, b = 0, and a = 1, so we subtract 4s 1 s 3 : Thus f s s 2 1s 2 2s 2 2 4s 1 s 3 = 0. (6) X 4 + Y 4 + Z 4 = s 4 1 4s 2 1s 2 + 2s s 1 s 3. 1 A trivial permutation is one that exchanges equal coordinates, like (2, 2, 1) and (2, 2, 1).
5 SYMMETRIC POLYNOMIALS 5 Remark 17. The proof we have given here is based on [2, Sect. 7.1], where there is an additional argument that shows the representation of a symmetric polynomial as a polynomial in the elementary symmetric polynomials is unique. (For example, the only expression of X 4 + Y 4 + Z 4 as a polynomial in s 1, s 2, and s 3 is the one appearing in (6).) For a different proof of Theorem 5, which uses the more usual notion of degree of a multivariable polynomial described in Remark 14, see [1, Sect. 16.1] (there is a gap in that proof, but the basic ideas are there). Corollary 18. Let L/K be a field extension and f(t ) K[T ] factor as in L[T ]. Then for all positive integers r, (T α 1 )(T α 2 ) (T α n ) (T α r 1)(T α r 2) (T α r n) K[T ]. Proof. The coefficients of (T α r 1 )(T αr 2 ) (T αr n) are symmetric polynomials in α 1,..., α n with coefficients in K, so these coefficients are polynomials in the elementary symmetric polynomials in the α i s with coefficients in K. The elementary symmetric polynomials in the α i s are (up to sign) the coefficients of f(t ), so they lie in K. Therefore any polynomial in the elementary symmetric functions of the α i s with coefficients in K lies in K. Example 19. Let f(t ) = T 2 + 5T + 2 = (T α)(t β) where α = ( )/2 and β = ( 5 17)/2. Although α and β are not rational, their elementary symmetric functions are rational: s 1 = α + β = 5 and s 2 = αβ = 1. Therefore any symmetric polynomial in α and β with rational coefficients is rational (since it is a polynomial in α + β and αβ with rational coefficients). In particular, (T α r )(T β r ) Q[T ] for all r 1. Taking r = 2, 3, and 4, we have (T α 2 )(T β 2 ) = T 2 21T + 4, (T α 3 )(T β 3 ) = T T + 8, (T α 4 )(T β 4 ) = T 2 433T Example 20. Let α, β, and γ be the three roots of T 3 T 1, so T 3 T 1 = (T α)(t β)(t γ). The elementary symmetric functions of α, β, and γ are all rational, so for every positive integer r, (T α r )(T β r )(T γ r ) has rational coefficients. As explicit examples, (T α 2 )(T β 2 )(T γ 2 ) = T 3 2T 2 + T 1, (T α 3 )(T β 3 )(T γ 3 ) = T 3 3T 2 + 2T 1. In the proof of Theorem 5, the fact that the coefficients come from a field F is not important; we never had to divide in F. The same proof shows for any commutative ring R that the symmetric polynomials in R[X 1,..., X n ] are R[s 1,..., s n ]. (Actually, there is a slight hitch: if R is not a domain then the formula mdeg(fg) = mdeg f + mdeg g is true only as long as the leading coefficients of f and g are both not zero-divisors in R, and that is true for the relevant case of elementary symmetric polynomials s 1,..., s n, whose leading coefficients equal 1.)
6 6 KEITH CONRAD Example 21. Taking α and β as in Example 19, their elementary symmetric functions are both integers, so any symmetric polynomial in α and β with integral coefficients is an integral polynomial in α + β and αβ with integral coefficients, and thus is an integer. This implies (T α r )(T β r ), whose coefficients are α r + β r and α r β r, has integral coefficients and not just rational coefficients. Examples of this for small r are seen in Example 19. References [1] M. Artin, Algebra, 2nd ed., Prentice-Hall, [2] D. Cox, J. Little, D. O Shea, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, Springer-Verlag, New York, 1992.
Polynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
More informationPOLYNOMIAL DIVISION AND GRÖBNER BASES. Samira Zeada
THE TEACHING OF MATHEMATICS 2013, Vol. XVI, 1, pp. 22 28 POLYNOMIAL DIVISION AND GRÖBNER BASES Samira Zeada Abstract. Division in the ring of multivariate polynomials is usually not a part of the standard
More informationRings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.
Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over
More informationa + bi by sending α = a + bi to a 2 + b 2. To see properties (1) and (2), it helps to think of complex numbers in polar coordinates:
5. Types of domains It turns out that in number theory the fact that certain rings have unique factorisation has very strong arithmetic consequences. We first write down some definitions. Definition 5.1.
More information5.1 Monomials. Algebra 2
. Monomials Algebra Goal : A..: Add, subtract, multiply, and simplify polynomials and rational expressions (e.g., multiply (x ) ( x + ); simplify 9x x. x Goal : Write numbers in scientific notation. Scientific
More informationreview To find the coefficient of all the terms in 15ab + 60bc 17ca: Coefficient of ab = 15 Coefficient of bc = 60 Coefficient of ca = -17
1. Revision Recall basic terms of algebraic expressions like Variable, Constant, Term, Coefficient, Polynomial etc. The coefficients of the terms in 4x 2 5xy + 6y 2 are Coefficient of 4x 2 is 4 Coefficient
More informationProblem Set 1 Solutions
Math 918 The Power of Monomial Ideals Problem Set 1 Solutions Due: Tuesday, February 16 (1) Let S = k[x 1,..., x n ] where k is a field. Fix a monomial order > σ on Z n 0. (a) Show that multideg(fg) =
More informationPermutations and Polynomials Sarah Kitchen February 7, 2006
Permutations and Polynomials Sarah Kitchen February 7, 2006 Suppose you are given the equations x + y + z = a and 1 x + 1 y + 1 z = 1 a, and are asked to prove that one of x,y, and z is equal to a. We
More informationFACTORING IN QUADRATIC FIELDS. 1. Introduction
FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is closed under addition, subtraction, multiplication, and also
More informationHandout #6 INTRODUCTION TO ALGEBRAIC STRUCTURES: Prof. Moseley AN ALGEBRAIC FIELD
Handout #6 INTRODUCTION TO ALGEBRAIC STRUCTURES: Prof. Moseley Chap. 2 AN ALGEBRAIC FIELD To introduce the notion of an abstract algebraic structure we consider (algebraic) fields. (These should not to
More informationLecture 1. (i,j) N 2 kx i y j, and this makes k[x, y]
Lecture 1 1. Polynomial Rings, Gröbner Bases Definition 1.1. Let R be a ring, G an abelian semigroup, and R = i G R i a direct sum decomposition of abelian groups. R is graded (G-graded) if R i R j R i+j
More informationDIHEDRAL GROUPS II KEITH CONRAD
DIHEDRAL GROUPS II KEITH CONRAD We will characterize dihedral groups in terms of generators and relations, and describe the subgroups of D n, including the normal subgroups. We will also introduce an infinite
More informationwhere c R and the content of f is one. 1
9. Gauss Lemma Obviously it would be nice to have some more general methods of proving that a given polynomial is irreducible. The first is rather beautiful and due to Gauss. The basic idea is as follows.
More informationTHE DIVISION THEOREM IN Z AND F [T ]
THE DIVISION THEOREM IN Z AND F [T ] KEITH CONRAD 1. Introduction In the integers we can carry out a process of division with remainder, as follows. Theorem 1.1. For any integers a and b, with b 0 there
More informationTHE DIVISION THEOREM IN Z AND R[T ]
THE DIVISION THEOREM IN Z AND R[T ] KEITH CONRAD 1. Introduction In both Z and R[T ], we can carry out a process of division with remainder. Theorem 1.1. For any integers a and b, with b nonzero, there
More informationChapter 2: Real solutions to univariate polynomials
Chapter 2: Real solutions to univariate polynomials Before we study the real solutions to systems of multivariate polynomials, we will review some of what is known for univariate polynomials. The strength
More informationAlgebra 1. Standard 1: Operations With Real Numbers Students simplify and compare expressions. They use rational exponents and simplify square roots.
Standard 1: Operations With Real Numbers Students simplify and compare expressions. They use rational exponents and simplify square roots. A1.1.1 Compare real number expressions. A1.1.2 Simplify square
More informationOSTROWSKI S THEOREM FOR Q(i)
OSTROWSKI S THEOREM FOR Q(i) KEITH CONRAD We will extend Ostrowki s theorem from Q to the quadratic field Q(i). On Q, every nonarchimedean absolute value is equivalent to the p-adic absolute value for
More informationMIT Algebraic techniques and semidefinite optimization February 16, Lecture 4
MIT 6.972 Algebraic techniques and semidefinite optimization February 16, 2006 Lecture 4 Lecturer: Pablo A. Parrilo Scribe: Pablo A. Parrilo In this lecture we will review some basic elements of abstract
More informationGALOIS GROUPS AS PERMUTATION GROUPS
GALOIS GROUPS AS PERMUTATION GROUPS KEITH CONRAD 1. Introduction A Galois group is a group of field automorphisms under composition. By looking at the effect of a Galois group on field generators we can
More informationdisc f R 3 (X) in K[X] G f in K irreducible S 4 = in K irreducible A 4 in K reducible D 4 or Z/4Z = in K reducible V Table 1
GALOIS GROUPS OF CUBICS AND QUARTICS IN ALL CHARACTERISTICS KEITH CONRAD 1. Introduction Treatments of Galois groups of cubic and quartic polynomials usually avoid fields of characteristic 2. Here we will
More information4. Noether normalisation
4. Noether normalisation We shall say that a ring R is an affine ring (or affine k-algebra) if R is isomorphic to a polynomial ring over a field k with finitely many indeterminates modulo an ideal, i.e.,
More informationAlgebra Review. Terrametra Resources. Lynn Patten
Terrametra Resources Lynn Patten ALGEBRAIC EXPRESSION A combination of ordinary numbers, letter symbols, variables, grouping symbols and operation symbols. Numbers remain fixed in value and are referred
More informationUNIVERSAL IDENTITIES. b = det
UNIVERSAL IDENTITIES KEITH CONRAD 1 Introduction We want to describe an idea which reduces the verification of algebraic identities valid over all commutative rings to the verification over the complex
More informationGENERATING SETS KEITH CONRAD
GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors
More informationMATH 326: RINGS AND MODULES STEFAN GILLE
MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called
More informationGALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2)
GALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2) KEITH CONRAD We will describe a procedure for figuring out the Galois groups of separable irreducible polynomials in degrees 3 and 4 over
More informationLecture 7: Schwartz-Zippel Lemma, Perfect Matching. 1.1 Polynomial Identity Testing and Schwartz-Zippel Lemma
CSE 521: Design and Analysis of Algorithms I Winter 2017 Lecture 7: Schwartz-Zippel Lemma, Perfect Matching Lecturer: Shayan Oveis Gharan 01/30/2017 Scribe: Philip Cho Disclaimer: These notes have not
More informationCHAPTER 3 Further properties of splines and B-splines
CHAPTER 3 Further properties of splines and B-splines In Chapter 2 we established some of the most elementary properties of B-splines. In this chapter our focus is on the question What kind of functions
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More informationg(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series.
6 Polynomial Rings We introduce a class of rings called the polynomial rings, describing computation, factorization and divisibility in such rings For the case where the coefficients come from an integral
More informationMATH 433 Applied Algebra Lecture 22: Semigroups. Rings.
MATH 433 Applied Algebra Lecture 22: Semigroups. Rings. Groups Definition. A group is a set G, together with a binary operation, that satisfies the following axioms: (G1: closure) for all elements g and
More informationPolynomial Rings. i=0. i=0. n+m. i=0. k=0
Polynomial Rings 1. Definitions and Basic Properties For convenience, the ring will always be a commutative ring with identity. Basic Properties The polynomial ring R[x] in the indeterminate x with coefficients
More informationAppendix C Vector and matrix algebra
Appendix C Vector and matrix algebra Concepts Scalars Vectors, rows and columns, matrices Adding and subtracting vectors and matrices Multiplying them by scalars Products of vectors and matrices, scalar
More informationFormal Groups. Niki Myrto Mavraki
Formal Groups Niki Myrto Mavraki Contents 1. Introduction 1 2. Some preliminaries 2 3. Formal Groups (1 dimensional) 2 4. Groups associated to formal groups 9 5. The Invariant Differential 11 6. The Formal
More informationSUPPLEMENTARY NOTES: CHAPTER 1
SUPPLEMENTARY NOTES: CHAPTER 1 1. Groups A group G is a set with single binary operation which takes two elements a, b G and produces a third, denoted ab and generally called their product. (Mathspeak:
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More informationCommutative Rings and Fields
Commutative Rings and Fields 1-22-2017 Different algebraic systems are used in linear algebra. The most important are commutative rings with identity and fields. Definition. A ring is a set R with two
More informationGröbner Bases over a Dual Valuation Domain
International Journal of Algebra, Vol. 7, 2013, no. 11, 539-548 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2013.3550 Gröbner Bases over a Dual Valuation Domain André Saint Eudes Mialébama
More informationIntroduction to finite fields
Chapter 7 Introduction to finite fields This chapter provides an introduction to several kinds of abstract algebraic structures, particularly groups, fields, and polynomials. Our primary interest is in
More informationEXTERIOR POWERS KEITH CONRAD
EXTERIOR POWERS KEITH CONRAD 1. Introduction Let R be a commutative ring. Unless indicated otherwise, all modules are R-modules and all tensor products are taken over R, so we abbreviate R to. A bilinear
More informationSystems of Linear Equations and Matrices
Chapter 1 Systems of Linear Equations and Matrices System of linear algebraic equations and their solution constitute one of the major topics studied in the course known as linear algebra. In the first
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include
PUTNAM TRAINING POLYNOMIALS (Last updated: December 11, 2017) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationSystems of Linear Equations and Matrices
Chapter 1 Systems of Linear Equations and Matrices System of linear algebraic equations and their solution constitute one of the major topics studied in the course known as linear algebra. In the first
More informationA Generalization of Wilson s Theorem
A Generalization of Wilson s Theorem R. Andrew Ohana June 3, 2009 Contents 1 Introduction 2 2 Background Algebra 2 2.1 Groups................................. 2 2.2 Rings.................................
More information15. Polynomial rings Definition-Lemma Let R be a ring and let x be an indeterminate.
15. Polynomial rings Definition-Lemma 15.1. Let R be a ring and let x be an indeterminate. The polynomial ring R[x] is defined to be the set of all formal sums a n x n + a n 1 x n +... a 1 x + a 0 = a
More informationCPSC 536N: Randomized Algorithms Term 2. Lecture 9
CPSC 536N: Randomized Algorithms 2011-12 Term 2 Prof. Nick Harvey Lecture 9 University of British Columbia 1 Polynomial Identity Testing In the first lecture we discussed the problem of testing equality
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationGAUSSIAN ELIMINATION AND LU DECOMPOSITION (SUPPLEMENT FOR MA511)
GAUSSIAN ELIMINATION AND LU DECOMPOSITION (SUPPLEMENT FOR MA511) D. ARAPURA Gaussian elimination is the go to method for all basic linear classes including this one. We go summarize the main ideas. 1.
More informationDefinition 2.3. We define addition and multiplication of matrices as follows.
14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row
More informationRevised Section 9.4. Brian C. Hall. December 29, 2015
Revised Section 9.4 Brian C. Hall December 29, 2015 There were several parts of Section 9.4 (Proof of the PBW Theorem) that were slightly unclear. I have rewritten the section in its entirety. It is notationally
More informationMA106 Linear Algebra lecture notes
MA106 Linear Algebra lecture notes Lecturers: Diane Maclagan and Damiano Testa 2017-18 Term 2 Contents 1 Introduction 3 2 Matrix review 3 3 Gaussian Elimination 5 3.1 Linear equations and matrices.......................
More informationLinear Equations in Linear Algebra
1 Linear Equations in Linear Algebra 1.7 LINEAR INDEPENDENCE LINEAR INDEPENDENCE Definition: An indexed set of vectors {v 1,, v p } in n is said to be linearly independent if the vector equation x x x
More informationNumbers, proof and all that jazz.
CHAPTER 1 Numbers, proof and all that jazz. There is a fundamental difference between mathematics and other sciences. In most sciences, one does experiments to determine laws. A law will remain a law,
More informationProperties of Real Numbers
Pre-Algebra Properties of Real Numbers Identity Properties Addition: Multiplication: Commutative Properties Addition: Multiplication: Associative Properties Inverse Properties Distributive Properties Properties
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationEXAMPLES OF PROOFS BY INDUCTION
EXAMPLES OF PROOFS BY INDUCTION KEITH CONRAD 1. Introduction In this handout we illustrate proofs by induction from several areas of mathematics: linear algebra, polynomial algebra, and calculus. Becoming
More informationTHE ALGEBRAIC GEOMETRY DICTIONARY FOR BEGINNERS. Contents
THE ALGEBRAIC GEOMETRY DICTIONARY FOR BEGINNERS ALICE MARK Abstract. This paper is a simple summary of the first most basic definitions in Algebraic Geometry as they are presented in Dummit and Foote ([1]),
More informationGroups. 3.1 Definition of a Group. Introduction. Definition 3.1 Group
C H A P T E R t h r e E Groups Introduction Some of the standard topics in elementary group theory are treated in this chapter: subgroups, cyclic groups, isomorphisms, and homomorphisms. In the development
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More informationLinear Algebra Lecture Notes
Linear Algebra Lecture Notes Lecturers: Inna Capdeboscq and Damiano Testa Warwick, January 2017 Contents 1 Number Systems and Fields 3 1.1 Axioms for number systems............................ 3 2 Vector
More informationON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION
Annales Univ. Sci. Budapest., Sect. Comp. 33 (2010) 273-284 ON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION L. László (Budapest, Hungary) Dedicated to Professor Ferenc Schipp on his 70th
More informationARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS
ARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS TIMO ERKAMA It is an open question whether n-cycles of complex quadratic polynomials can be contained in the field Q(i) of complex rational numbers
More informationIntegral Extensions. Chapter Integral Elements Definitions and Comments Lemma
Chapter 2 Integral Extensions 2.1 Integral Elements 2.1.1 Definitions and Comments Let R be a subring of the ring S, and let α S. We say that α is integral over R if α isarootofamonic polynomial with coefficients
More informationSIMPLE RADICAL EXTENSIONS
SIMPLE RADICAL EXTENSIONS KEITH CONRAD 1. Introduction A field extension L/K is called simple radical if L = K(α) where α n = a for some n 1 and a K. Examples of simple radical extensions of Q are Q( 2),
More information8. Limit Laws. lim(f g)(x) = lim f(x) lim g(x), (x) = lim x a f(x) g lim x a g(x)
8. Limit Laws 8.1. Basic Limit Laws. If f and g are two functions and we know the it of each of them at a given point a, then we can easily compute the it at a of their sum, difference, product, constant
More informationThe planar resolution algorithm
The planar resolution algorithm Dumitru Stamate 1 Introduction Let I = < m 1,..., m r > S := K[x 1,..., x n ] be an arbitrary monomial ideal, where K is a field. As we saw in [5], by computing the Scarf
More informationPyramids and monomial blowing-ups
Pyramids and monomial blowing-ups arxiv:math/0409446v1 [math.ac] 23 Sep 2004 M.J. Soto soto@us.es Departamento de Algebra Universidad de Sevilla October 4, 2018 José L. Vicente jlvc@us.es Departamento
More informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
More informationTHE MINIMAL POLYNOMIAL AND SOME APPLICATIONS
THE MINIMAL POLYNOMIAL AND SOME APPLICATIONS KEITH CONRAD. Introduction The easiest matrices to compute with are the diagonal ones. The sum and product of diagonal matrices can be computed componentwise
More informationbe any ring homomorphism and let s S be any element of S. Then there is a unique ring homomorphism
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UFD. Therefore
More informationAlgebra Review 2. 1 Fields. A field is an extension of the concept of a group.
Algebra Review 2 1 Fields A field is an extension of the concept of a group. Definition 1. A field (F, +,, 0 F, 1 F ) is a set F together with two binary operations (+, ) on F such that the following conditions
More informationStudy Guide for Math 095
Study Guide for Math 095 David G. Radcliffe November 7, 1994 1 The Real Number System Writing a fraction in lowest terms. 1. Find the largest number that will divide into both the numerator and the denominator.
More informationAlgebra Homework, Edition 2 9 September 2010
Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.
More informationUnit 13: Polynomials and Exponents
Section 13.1: Polynomials Section 13.2: Operations on Polynomials Section 13.3: Properties of Exponents Section 13.4: Multiplication of Polynomials Section 13.5: Applications from Geometry Section 13.6:
More informationREFLECTIONS IN A EUCLIDEAN SPACE
REFLECTIONS IN A EUCLIDEAN SPACE PHILIP BROCOUM Let V be a finite dimensional real linear space. Definition 1. A function, : V V R is a bilinear form in V if for all x 1, x, x, y 1, y, y V and all k R,
More informationTHE GAUSSIAN INTEGERS
THE GAUSSIAN INTEGERS KEITH CONRAD Since the work of Gauss, number theorists have been interested in analogues of Z where concepts from arithmetic can also be developed. The example we will look at in
More informationIDEAL CLASSES AND RELATIVE INTEGERS
IDEAL CLASSES AND RELATIVE INTEGERS KEITH CONRAD The ring of integers of a number field is free as a Z-module. It is a module not just over Z, but also over any intermediate ring of integers. That is,
More informationSomething that can have different values at different times. A variable is usually represented by a letter in algebraic expressions.
Lesson Objectives: Students will be able to define, recognize and use the following terms in the context of polynomials: o Constant o Variable o Monomial o Binomial o Trinomial o Polynomial o Numerical
More informationALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
More informationTROPICAL SCHEME THEORY
TROPICAL SCHEME THEORY 5. Commutative algebra over idempotent semirings II Quotients of semirings When we work with rings, a quotient object is specified by an ideal. When dealing with semirings (and lattices),
More informationMATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS. Contents 1. Polynomial Functions 1 2. Rational Functions 6
MATH 2400 LECTURE NOTES: POLYNOMIAL AND RATIONAL FUNCTIONS PETE L. CLARK Contents 1. Polynomial Functions 1 2. Rational Functions 6 1. Polynomial Functions Using the basic operations of addition, subtraction,
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More information4 Elementary matrices, continued
4 Elementary matrices, continued We have identified 3 types of row operations and their corresponding elementary matrices. If you check the previous examples, you ll find that these matrices are constructed
More informationSolving Linear Systems Using Gaussian Elimination
Solving Linear Systems Using Gaussian Elimination DEFINITION: A linear equation in the variables x 1,..., x n is an equation that can be written in the form a 1 x 1 +...+a n x n = b, where a 1,...,a n
More informationChapter 5 Rational Expressions
Worksheet 4 (5.1 Chapter 5 Rational Expressions 5.1 Simplifying Rational Expressions Summary 1: Definitions and General Properties of Rational Numbers and Rational Expressions A rational number can be
More informationSEPARABILITY II KEITH CONRAD
SEPARABILITY II KEITH CONRAD 1. Introduction Separability of a finite field extension L/K can be described in several different ways. The original definition is that every element of L is separable over
More informationand this makes M into an R-module by (1.2). 2
1. Modules Definition 1.1. Let R be a commutative ring. A module over R is set M together with a binary operation, denoted +, which makes M into an abelian group, with 0 as the identity element, together
More informationTHE DIAMOND LEMMA FOR RING THEORY
THE DIAMOND LEMMA FOR RING THEORY NOTES BY APOORVA KHARE PRESENTED TO AKAKI TIKARADZE IN ECKHART 16 ON AUG 16, 2007, THURSDAY AND TO DMITRIY BOYARCHENKO IN RYERSON ON NOV 26, 2008, WEDNESDAY It is useful
More informationSOLVING SOLVABLE QUINTICS. D. S. Dummit
D. S. Dummit Abstract. Let f(x) = x 5 + px 3 + qx + rx + s be an irreducible polynomial of degree 5 with rational coefficients. An explicit resolvent sextic is constructed which has a rational root if
More informationReal Numbers. Real numbers are divided into two types, rational numbers and irrational numbers
Real Numbers Real numbers are divided into two types, rational numbers and irrational numbers I. Rational Numbers: Any number that can be expressed as the quotient of two integers. (fraction). Any number
More informationTHE DIFFERENT IDEAL. Then R n = V V, V = V, and V 1 V 2 V KEITH CONRAD 2 V
THE DIFFERENT IDEAL KEITH CONRAD. Introduction The discriminant of a number field K tells us which primes p in Z ramify in O K : the prime factors of the discriminant. However, the way we have seen how
More informationThe Integers. Math 3040: Spring Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers Multiplying integers 12
Math 3040: Spring 2011 The Integers Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers 11 4. Multiplying integers 12 Before we begin the mathematics of this section, it is worth
More informationISOMORPHISMS KEITH CONRAD
ISOMORPHISMS KEITH CONRAD 1. Introduction Groups that are not literally the same may be structurally the same. An example of this idea from high school math is the relation between multiplication and addition
More information2. Two binary operations (addition, denoted + and multiplication, denoted
Chapter 2 The Structure of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference between
More information6 Lecture 6: More constructions with Huber rings
6 Lecture 6: More constructions with Huber rings 6.1 Introduction Recall from Definition 5.2.4 that a Huber ring is a commutative topological ring A equipped with an open subring A 0, such that the subspace
More informationLesson 3 Algebraic expression: - the result obtained by applying operations (+, -,, ) to a collection of numbers and/or variables o
Lesson 3 Algebraic expression: - the result obtained by applying operations (+, -,, ) to a collection of numbers and/or variables o o ( 1)(9) 3 ( 1) 3 9 1 Evaluate the second expression at the left, if
More informationFinite Fields: An introduction through exercises Jonathan Buss Spring 2014
Finite Fields: An introduction through exercises Jonathan Buss Spring 2014 A typical course in abstract algebra starts with groups, and then moves on to rings, vector spaces, fields, etc. This sequence
More informationGROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION
Chapter-1 GROUPS 1.1. INTRODUCTION The theory of groups arose from the theory of equations, during the nineteenth century. Originally, groups consisted only of transformations. The group of transformations
More information