# RINGS WITH A POLYNOMIAL IDENTITY

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 RINGS WITH A POLYNOMIAL IDENTITY IRVING KAPLANSKY 1. Introduction. In connection with his investigation of projective planes, M. Hall [2, Theorem 6.2]* proved the following theorem: a division ring D in which the identity (1) {xy yx) 2 z = z(xy yx) 2 holds is either a field or a (generalized) quaternion algebra over its center F. In particular, D is finite-dimensional over F, something not assumed a priori. The main result ( 2) in the present paper is the following : if D satisfies any polynomial identity it is finite-dimensional over F. There are connections with other problems which we note in 3, Proof of finite-dimensionality. Let A be an algebra (no assumption of finite order) over a field F. We denote by F[xi 9, x r ] the free algebra generated by r indeterminates over F. We say that A satisfies a polynomial identity if there exists a nonzero element ƒ in F[xi,, x r ] such that f(ai,, a r ) =0 for all a t - in A. LEMMA l. 2 If A satisfies any polynomial identity, then it satisfies a polynomial identity in two variables. PROOF. Suppose A satisfies the equation f(xi,, ^r)=0. Replacing Xi by u*v we obtain the equation g(u, v)=0, with g a polynomial which is not identically zero. LEMMA 2. If A satisfies any polynomial identity, it satisfies a polynomial identity which is linear in each variable. PROOF. Suppose A satisfies ƒ (xu, x r ) =0 and that/ is not linear in x\. Then f(y + Z, X 2t ', X r ) - f(y, X 2y, X r ) ~ f(z t X 2, ', X r ) = 0 is satisfied by A. This is a polynomial (in r+l variables), not identically zero, and with degree in y and z lower than the degree of ƒ in x\. By successive steps of this kind we reach a polynomial linear in all variables. Presented to the Society, September 3, 1947; received by the editors August 20, Numbers in brackets refer to the bibliography at the end of the paper. 2 Cf. [7, Satz2]. 575

2 576 IRVING KAPLANSKY [June LEMMA 3. Suppose that A satisfies an identity g = 0 where g is linear in all its variables, and let K be a field over F. Then the Kronecker product AXK also satisfies g = 0. PROOF. We have to show that g(xu, x r ) vanishes when the x*s are replaced by elements ]C a^* f AXK(a&A t kiç.k). This follows from the linearity of g and the fact that the k's commute with everything. LEMMA 4. 8 If A satisfies an identity ƒ=0 which is of degree not greater than n in each of its variables y and if F has at least n+1 elements, then A satisfies an identity which is homogeneous in each of its variables. PROOF. We write ƒ = 2/»- where/» is of degree i in x\. Replacing Xi by X#i where X JF, we find X)X*/ t =0. We do this for n different nonzero scalars. Using the resulting Vandermonde determinant, we obtain ƒ< = 0. We repeat this procedure with each of the variables. LEMMA 5. Iff(x t y) is any nonzero element of F[x, y] t we canfindtwo matrices a, b with elements in F such that f {a, b) 5^0. PROOF. A field of degree k over F may be represented by kxk matrices over F. Thus by taking matrices split into suitable smaller blocks, we may arrange for a scalar field of any desired (finite) size. Suppose that on the contrary ƒ vanishes for all matrices with elements in F. Then by Lemma 4 we may pass to a polynomial g(x, y) which also vanishes for any matrices over F, and which is homogeneous in y y say of degree t. Take a to be a diagonal matrix: a = diag («i,, u n ), with n greater than the degree of/, and the u's as yet undefined. For b we choose an n by n matrix which permutes the elements of a diagonal matrix cyclically. Thus (2) Vciïr* = diag («i+i, u i+ 2, - -, u nt ui, * -, Ui). We consider g(a, b)b~~k Using the relation (2), we systematically push b to the right of a, and every such operation induces a cyclic permutation. Corresponding to the typical monomial x^'x^x in g, we obtain the term (uiy(ui + ù k (u M+ i) m -.. in the upper left corner of g(a, b)b"^k Moreover given any such term we can unambiguously reconstruct the monomial from which it arose (we use here the fact that n exceeds the degree of g, so that there is no overlapping of the u's). Thus the upper left entry of g(a, b)b~* is a 3 Cf. [7, Satzl].

3 1948] RINGS WÏTH A POLYNOMIAL IDENTITY 577 polynomial h(ux>, u n ) (that is to say, an ordinary commutative polynomial), which is not identically zero. By enlarging the field of scalars, if again necessary, we can find values of the u's which make h different from 0. For this choice we have g(a, b) 5^0, a contradiction. We prove the main theorem of the paper not only for division rings, but more generally for primitive algebras in the sense of Jacobson. THEOREM 1. A primitive algebra satisfying a polynomial identity is finite-dimensional over its center. PROOF. First we assert that A is a matrix algebra of finite order over a division algebra. For if not we would have 4 that for every k 9 A has a sub-algebra homomorphic to Dh where D is a division algebra over F t and D h is the algebra of matrices of order k over D. The polynomial identity satisfied by A is inherited by D k for all k, and therefore holds for all matrices with coefficients in F. By Lemma 1 we may assume that the polynomial in question has two variables, and this contradicts Lemma 5. The problem is thus reduced to the case where A is a division algebra, say with center Z. By Zorn's lemma, select a maximal subfield K of A y and form the Kronecker product A XK over Z. By a theorem of Nakayama and Azumaya [7], A XK is a dense algebra of linear transformations in a vector space over K. By Lemma 2, A has a linear polynomial identity, and by Lemma 3 this identity survives in A XK. By Lemma 1 we pass to an identity in two variables in A XK. Repetition of the argument of the preceding paragraph shows that A XK is finite-dimensional over K, hence A is fihite-dimensional over Z. The following further result is virtually a restatement of Lemma 5. THEOREM 2. The free algebra in any number of indeterminates has a complete set of finite-dimensional representations. PROOF. Let f(xi,, x r ) be an element in the free algebra. We make the replacement Xi uty of Lemma 1. For the resulting polynomial g(u 9 v), we can find, by Lemma 5, matrices a and b such that g(a> b) 7*0. The mapping induced by sending x» into a*6 (i» 1,, r) and all other x's into 0 is a homomorphism of the free algebra into the algebra generated by a and b, and in this representation ƒ (xi,, x r ) is not sent into Algebraic algebras. It is true conversely that any algebra of finite order satisfies a polynomial identity. For algebras over the real numbers, this was shown by Wagner [8, pp ]; his identity 4 [3, Th. 3]. Jacobson has since shown that a unit element is not necessary for this theorem (oral communication).

4 578 IRVING KAPLANSKY [June for n by n matrices has degree (n 2 n+2)(n 2 #+4)/4. E. R. Kolchin has remarked that any algebra of order n satisfies an identity of degree n + 1: where the sign is positive or negative according as the permutation is even or odd. Incidentally the existence of these identities furnishes a brief proof of Malcev's result [6, Theorem 9] that the free algebra in two or more indeterminates cannot be faithfully represented by matrices of finite order. A wider class of algebras than those of finite order is covered by the following result. 5 THEOREM 3. An algebraic algebra of bounded degree satisfies a polynomial identity. PROOF. TO avoid complications of notation, we give the proof for the case where the degrees of the elements are bounded by 3. Thus every element x satisfies an equation (3) x z + ax 2 + px = 0 where a, /3 are scalars which of course depend on x. (We do not assume a unit element, and so no constant appears in (3).) We take the commutator with y, obtaining I* 8, y] + a[x\ y] + P[x,y] = 0 where [x, y] denotes xy yx. Then we take the commutator with [x, y] and finally with [[x, y], [x 2, y]]. The result is: [[[*. y], [*. y]l [[*. yl [*. y]]] - o, a polynomial of degree 11. The polynomial moreover is not identically zero, since for example there is only one term xyx 2 yxyx z y. In the general case where the degree is bounded by n, we get an identity of degree 2 n+1 2 n ~ 1 1. The case w = 2 yields an identity equivalent to (1), with z replaced by x. Combining Theorems 1 and 3, we obtain a new proof of a theorem due to Jacobson [3, Theorems S and 7]. THEOREM 4. A primitive algebraic algebra of bounded degree is finitedimensional over its center. 6 1 am indebted to Prof. Jacobson for Theorem 3 and its proof.

5 1948] RINGS WITH A POLYNOMIAL IDENTITY 579 An outstanding question in the theory of algebraic algebras is Kurosch's analogue of Burnside's problem : is an algebraic algebra necessarily locally finite? 6 Affirmative answers have been contributed in two cases: (1) algebraic algebras of bounded degree [3, 4, and 5], and (2) representable 7 algebraic algebras [6]. A third (trivial) instance where the answer is affirmative is the commutative case. A hypothesis that is weaker than any of these is the assumption of a polynomial identity. It thus seems natural to try Kurosch's problem next for algebraic algebras with a polynomial identity. We shall now contribute an affirmative answer for the case of a nil algebra; in the light of [3, Theorem 15] the question is thus reduced to the semi-simple case. THEOREM 5. A nil algebra satisfying a polynomial identity is locally finite. PROOF. We use the terminology and results of Levitzki (cf. [5] and the references given there). Exactly as in [5] we reduce to the case where A is semi-regular. We choose an element a9*0 such that a 2 = 0. The algebra A a is also semi-regular. We convert our identity into one, say f(xi,, x r ) = 0, which is linear in each variable (Lemma 2). Suppose the variable Xi actually appears first in at least one of the monomials comprising ƒ. We gather all such terms and write (4) /(*i,, X r ) = X 1 g(x 2y, «r) + h(x U ', «r). Each monomial of h has a factor X\ which appears later than the first term. It follows that if we substitute a for #1, and any elements of Aa for #2,, x r, we introduce a factor a 2 in each term of h and thus make h vanish. Thus ag(x 2,, x r ) must also vanish for X 2 f * * "» X'f in Aa. This makes g a right annihilator of Aa. Since Aa is semi-regular it has no right annihilator except 0. Hence Aa satisfies the identity g = 0. By induction on the degree of the identity we have that Aa is locally finite, which contradicts its semi-regularity. 4. Further remarks, (a) Wagner's main theorem in [8] asserts that an ordered algebra over the reals satisfying a polynomial identity is necessarily commutative. Our results furnish a short proof of a special case: any ordered primitive algebra satisfying a polynomial identity is commutative. This is an immediate consequence of Theorem 6 An algebra is locally finite if every finitely generated sub-algebra is of finite order. * An algebra is representable if it is isomorphic to a ring of matrices of finite order over some extension field.

6 580 IRVING KAPLANSKY 1 and Albert's theorem [l] to the effect that any ordered algebra of finite order is a field. (b) The argument of Theorem 1 can be made to yield an explicit upper bound for the order of the algebra over its center, in terms of the degree and number of variables of the identity; the bound however is far too generous. In a special case like Hall's theorem there is no difficulty in getting the precise bound. Specifically it is only necessary to produce 3 by 3 matrices violating the linearized form of (1). One may in this way also verify the following result: a semi-simple algebra satisfying a polynomial identity of degree not greater than 3 is commutative. (c) We have for simplicity given all the results in this paper for algebras, but they may be extended to rings as follows. Assume that the polynomials in question have as coefficients operators a such that ax = 0 implies x = 0. It is to be observed that this holds in particular if the coefficients are ±1. Thus we may assert that any primitive ring satisfying (1) is an algebra of finite order; and Theorem 5 thus extended subsumes Levitzki's theorem [5] that a finitely generated nil-ring of bounded index is nilpotent. Added in proof (May 1, 1948). I am indebted to Dr. Harish- Chandra for the following brief proof of Lemma 5. Let n be the degree of f(x, y) and J the ideal F[x, y] generated by monomials of degree not less than n+1. Then F[x, y]/i is an algebra, which can be faithfully represented by matrices since it is of finite order. This gives us matrices for which ƒ 3^0. BIBLIOGRAPHY 1. A. A. Albert, On ordered algebras, Bull. Amer. Math. Soc. vol. 46 (1940) pp M. Halt, Projective planes, Trans. Amer. Math. Soc. vol. 54 (1943) pp N. Jacobson, Structure theory for algebraic algebras of bounded degree, Ann. of Math. (2) vol. 46 (1945) pp I. Kaplansky, On a problem of Kurosck and Jacobson, Bull. Amer. Math. Soc. vol. 52 (1946) pp J. Levitzld, On a problem of A, Kurosch, Bull. Amer. Math. Soc. vol. 52 (1946) pp A. Malcev, On the representations of infinite algebras, Rec. Math. (Mat. Sbornik) N. S. vol. 13 (1943) pp (Russian with English summary). 7. T. Nakayama and G. Azumaya, Über einfache distributive Système unendlicher Riinge II, Proc. Imp. Acad. Tokyo vol. 20 (1944) pp W. Wagner, Über die Grundlagen der projektiven Geometrie und allgemeine Zahlensysteme, Math. Ann. vol. 113 (1937) pp UNIVERSITY OF CHICAGO

### IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible

### FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it

### it is easy to see that α = a

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 UF. Therefore

### ON THE EMBEDDING OF BIRKHOFF-WITT RINGS IN QUOTIENT FIELDS

ON THE EMBEDDING OF BIRKHOFF-WITT RINGS IN QUOTIENT FIELDS DOV TAMARI 1. Introduction and general idea. In this note a natural problem arising in connection with so-called Birkhoff-Witt algebras of Lie

### THE 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

### GROUP ALGEBRAS. ANDREI YAFAEV

GROUP ALGEBRAS. ANDREI YAFAEV We will associate a certain algebra to a finite group and prove that it is semisimple. Then we will apply Wedderburn s theory to its study. Definition 0.1. Let G be a finite

### The determinant of a skew-symmetric matrix is a square. This can be seen in small cases by direct calculation: 0 a. 12 a. a 13 a 24 a 14 a 23 a 14

4 Symplectic groups In this and the next two sections, we begin the study of the groups preserving reflexive sesquilinear forms or quadratic forms. We begin with the symplectic groups, associated with

### ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS

ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS M. AXTELL, J. COYKENDALL, AND J. STICKLES Abstract. We recall several results of zero divisor graphs of commutative rings. We

### F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p

### PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

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

### Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points

Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a

### Appendix A. Appendix. A.1 Algebra. Fields and Rings

Appendix A Appendix A.1 Algebra Algebra is the foundation of algebraic geometry; here we collect some of the basic algebra on which we rely. We develop some algebraic background that is needed in the text.

### Computing divisors and common multiples of quasi-linear ordinary differential equations

Computing divisors and common multiples of quasi-linear ordinary differential equations Dima Grigoriev CNRS, Mathématiques, Université de Lille Villeneuve d Ascq, 59655, France Dmitry.Grigoryev@math.univ-lille1.fr

### Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

### Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2)

Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2) Kevin Broughan University of Waikato, Hamilton, New Zealand May 13, 2010 Remainder and Factor Theorem 15 Definition of factor If f (x)

### The Dirichlet Unit Theorem

Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

### NONASSOCIATIVE ALGEBRAS SATISFYING IDENTITIES OF DEGREE THREE(i)

NONASSOCIATIVE ALGEBRAS SATISFYING IDENTITIES OF DEGREE THREE(i) BY FRANK ROSIER AND J. MARSHALL OSBORN A number of different authors have studied classes of nonassociative algebras or rings satisfying

### THE DIMENSION OF A VECTOR SPACE

THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field

### some algebra prelim solutions

some algebra prelim solutions David Morawski August 19, 2012 Problem (Spring 2008, #5). Show that f(x) = x p x + a is irreducible over F p whenever a F p is not zero. Proof. First, note that f(x) has no

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### 4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2:

4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets

### 1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]

1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not

### GROUPS ACTING ON A SET

GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for

### H/wk 13, Solutions to selected problems

H/wk 13, Solutions to selected problems Ch. 4.1, Problem 5 (a) Find the number of roots of x x in Z 4, Z Z, any integral domain, Z 6. (b) Find a commutative ring in which x x has infinitely many roots.

### RINGS OF ZERO-DIVISORS

RINGS OF ZERO-DIVISORS P. M. COHN 1. Introduction. A well known theorem of algebra states that any integral domain can be embedded in a field. More generally [2, p. 39 ff. ], any commutative ring R with

### Proofs are short works of prose and need to be written in complete sentences, with mathematical symbols used where appropriate.

Advice for homework: Proofs are short works of prose and need to be written in complete sentences, with mathematical symbols used where appropriate. Even if a problem is a simple exercise that doesn t

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### Solving Systems of Linear Equations

LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

### Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

### 4.5 Linear Dependence and Linear Independence

4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then

### Irreducible Representations of Wreath Products of Association Schemes

Journal of Algebraic Combinatorics, 18, 47 52, 2003 c 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Irreducible Representations of Wreath Products of Association Schemes AKIHIDE HANAKI

### RESULTANT AND DISCRIMINANT OF POLYNOMIALS

RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results

### minimal polyonomial Example

Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We

### Inner Product Spaces and Orthogonality

Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,

### MATH PROBLEMS, WITH SOLUTIONS

MATH PROBLEMS, WITH SOLUTIONS OVIDIU MUNTEANU These are free online notes that I wrote to assist students that wish to test their math skills with some problems that go beyond the usual curriculum. These

### T ( a i x i ) = a i T (x i ).

Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)

### LINEAR ALGEBRA W W L CHEN

LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,

### MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### Solutions A ring A is called a Boolean ring if x 2 = x for all x A.

1. A ring A is called a Boolean ring if x 2 = x for all x A. (a) Let E be a set and 2 E its power set. Show that a Boolean ring structure is defined on 2 E by setting AB = A B, and A + B = (A B c ) (B

### FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

### UNIT 2 MATRICES - I 2.0 INTRODUCTION. Structure

UNIT 2 MATRICES - I Matrices - I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress

### EXERCISES FOR THE COURSE MATH 570, FALL 2010

EXERCISES FOR THE COURSE MATH 570, FALL 2010 EYAL Z. GOREN (1) Let G be a group and H Z(G) a subgroup such that G/H is cyclic. Prove that G is abelian. Conclude that every group of order p 2 (p a prime

### A note on companion matrices

Linear Algebra and its Applications 372 (2003) 325 33 www.elsevier.com/locate/laa A note on companion matrices Miroslav Fiedler Academy of Sciences of the Czech Republic Institute of Computer Science Pod

Facts About Eigenvalues By Dr David Butler Definitions Suppose A is an n n matrix An eigenvalue of A is a number λ such that Av = λv for some nonzero vector v An eigenvector of A is a nonzero vector v

### Group Theory. Contents

Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation

### Chapter 13: Basic ring theory

Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring

### G = G 0 > G 1 > > G k = {e}

Proposition 49. 1. A group G is nilpotent if and only if G appears as an element of its upper central series. 2. If G is nilpotent, then the upper central series and the lower central series have the same

### Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.

Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(

### 1 Sets and Set Notation.

LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most

### Field Fundamentals. Chapter 3. 3.1 Field Extensions. 3.1.1 Definitions. 3.1.2 Lemma

Chapter 3 Field Fundamentals 3.1 Field Extensions If F is a field and F [X] is the set of all polynomials over F, that is, polynomials with coefficients in F, we know that F [X] is a Euclidean domain,

### ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for

### 50. Splitting Fields. 50. Splitting Fields 165

50. Splitting Fields 165 1. We should note that Q(x) is an algebraic closure of Q(x). We know that is transcendental over Q. Therefore, p must be transcendental over Q, for if it were algebraic, then (

### THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP

THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP by I. M. Isaacs Mathematics Department University of Wisconsin 480 Lincoln Dr. Madison, WI 53706 USA E-Mail: isaacs@math.wisc.edu Maria

### Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

### Putnam Notes Polynomials and palindromes

Putnam Notes Polynomials and palindromes Polynomials show up one way or another in just about every area of math. You will hardly ever see any math competition without at least one problem explicitly concerning

### Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part II: Group Theory

Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN Part II: Group Theory No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Version: 1.1 Release: Jan 2013

### DETERMINANTS. b 2. x 2

DETERMINANTS 1 Systems of two equations in two unknowns A system of two equations in two unknowns has the form a 11 x 1 + a 12 x 2 = b 1 a 21 x 1 + a 22 x 2 = b 2 This can be written more concisely in

### Row Ideals and Fibers of Morphisms

Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion

### Factoring of Prime Ideals in Extensions

Chapter 4 Factoring of Prime Ideals in Extensions 4. Lifting of Prime Ideals Recall the basic AKLB setup: A is a Dedekind domain with fraction field K, L is a finite, separable extension of K of degree

### CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

### Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013

Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of

### FACTORING IN QUADRATIC FIELDS. 1. Introduction. This is called a quadratic field and it has degree 2 over Q. Similarly, set

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 called a quadratic field and it has degree 2 over Q. Similarly,

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### Introduction to Finite Fields (cont.)

Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number

### 7. Some irreducible polynomials

7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of

### Monogenic Fields and Power Bases Michael Decker 12/07/07

Monogenic Fields and Power Bases Michael Decker 12/07/07 1 Introduction Let K be a number field of degree k and O K its ring of integers Then considering O K as a Z-module, the nicest possible case is

### Solving Linear Systems, Continued and The Inverse of a Matrix

, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing

### Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

Degrees of Sums in a Separable Field Extension Author(s): I. M. Isaacs Source: Proceedings of the American Mathematical Society, Vol. 25, No. 3 (Jul., 1970), pp. 638-641 Published by: American Mathematical

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### Chapter 8. Matrices II: inverses. 8.1 What is an inverse?

Chapter 8 Matrices II: inverses We have learnt how to add subtract and multiply matrices but we have not defined division. The reason is that in general it cannot always be defined. In this chapter, we

### Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number

### 1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain

Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is

### Linear Algebra I. Ronald van Luijk, 2012

Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.

### 3. INNER PRODUCT SPACES

. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.

### Real Roots of Univariate Polynomials with Real Coefficients

Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials

### ( ) which must be a vector

MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are

### 11 Ideals. 11.1 Revisiting Z

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

### LINEAR DIFFERENTIAL EQUATIONS IN DISTRIBUTIONS

LINEAR DIFFERENTIAL EQUATIONS IN DISTRIBUTIONS LESLIE D. GATES, JR.1 1. Introduction. The main result of this paper is an extension of the analysis of Laurent Schwartz [l ] concerning the primitive of

### 1 VECTOR SPACES AND SUBSPACES

1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such

### Associativity condition for some alternative algebras of degree three

Associativity condition for some alternative algebras of degree three Mirela Stefanescu and Cristina Flaut Abstract In this paper we find an associativity condition for a class of alternative algebras

### Similarity and Diagonalization. Similar Matrices

MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

### MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

### On the representability of the bi-uniform matroid

On the representability of the bi-uniform matroid Simeon Ball, Carles Padró, Zsuzsa Weiner and Chaoping Xing August 3, 2012 Abstract Every bi-uniform matroid is representable over all sufficiently large

### Nilpotent Lie and Leibniz Algebras

This article was downloaded by: [North Carolina State University] On: 03 March 2014, At: 08:05 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered

### QUADRATIC RECIPROCITY IN CHARACTERISTIC 2

QUADRATIC RECIPROCITY IN CHARACTERISTIC 2 KEITH CONRAD 1. Introduction Let F be a finite field. When F has odd characteristic, the quadratic reciprocity law in F[T ] (see [4, Section 3.2.2] or [5]) lets

### Prime Numbers and Irreducible Polynomials

Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.

### Introduction to Modern Algebra

Introduction to Modern Algebra David Joyce Clark University Version 0.0.6, 3 Oct 2008 1 1 Copyright (C) 2008. ii I dedicate this book to my friend and colleague Arthur Chou. Arthur encouraged me to write

### A Hajós type result on factoring finite abelian groups by subsets II

Comment.Math.Univ.Carolin. 51,1(2010) 1 8 1 A Hajós type result on factoring finite abelian groups by subsets II Keresztély Corrádi, Sándor Szabó Abstract. It is proved that if a finite abelian group is

### (a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9

Homework #01, due 1/20/10 = 9.1.2, 9.1.4, 9.1.6, 9.1.8, 9.2.3 Additional problems for study: 9.1.1, 9.1.3, 9.1.5, 9.1.13, 9.2.1, 9.2.2, 9.2.4, 9.2.5, 9.2.6, 9.3.2, 9.3.3 9.1.1 (This problem was not assigned

### 1 Formulating The Low Degree Testing Problem

6.895 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 5: Linearity Testing Lecturer: Dana Moshkovitz Scribe: Gregory Minton and Dana Moshkovitz In the last lecture, we proved a weak PCP Theorem,

### Math 315: Linear Algebra Solutions to Midterm Exam I

Math 35: Linear Algebra s to Midterm Exam I # Consider the following two systems of linear equations (I) ax + by = k cx + dy = l (II) ax + by = 0 cx + dy = 0 (a) Prove: If x = x, y = y and x = x 2, y =

### 6. Fields I. 1. Adjoining things

6. Fields I 6.1 Adjoining things 6.2 Fields of fractions, fields of rational functions 6.3 Characteristics, finite fields 6.4 Algebraic field extensions 6.5 Algebraic closures 1. Adjoining things The general

### Quotient Rings and Field Extensions

Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

### Non-unique factorization of polynomials over residue class rings of the integers

Comm. Algebra 39(4) 2011, pp 1482 1490 Non-unique factorization of polynomials over residue class rings of the integers Christopher Frei and Sophie Frisch Abstract. We investigate non-unique factorization