DISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization
|
|
- Martina Henry
- 6 years ago
- Views:
Transcription
1 DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1. If every e equals 1, we say p s unramfed n K. Example 1.1. In Z[], the only prme whch ramfes s 2: (2) = (1 + ) 2. Example 1.2. Let K = Q(α) where α s a root of f(x) = T 3 9T 6. Then 6 = α 3 9α = α(α 3)(α + 3). For m Z, α + m has mnmal polynomal f(t m) n Q[T ], so N K/Q (α + m) = f( m) = m 3 9m + 6 and the prncpal deal (α m) has norm N(α m) = m 3 9m + 6. Therefore N(α) = 6, N(α 3) = 6, and N(α + 3) = 6. It follows that (α) = p 2 p 3, (α 3) = p 2 p 3, and (α + 3) = p 2 p 3 (so, n partcular, α + 3 and α 3 are unt multples of each other). Thus (2)(3) = (6) = (α)(α 3)(α + 3) = p 2 p 2 2 p 3 3, so (2) = p 2 2 p 2 and (3) = p3 3. Ths shows 2 and 3 are ramfed n K. Note that one of the exponents n the factorzaton of (2) exceeds 1, whle the other equals 1. One way to thnk about ramfed prmes s n terms of the rng structure of O K /(p). By (1.1) and the Chnese Remander Theorem, (1.2) O K /(p) = O K /p e 1 1 O K/p eg g. If some e s greater than 1, then the quotent rng O K /p e has a nonzero nlpotent element (use the reducton modulo p e of any element of p p e ), so the product rng (1.2) has a nonzero nlpotent element. If each e equals 1, then O K /(p) s a product of (fnte) felds, and a product of felds has no nonzero nlpotent elements. Thus, p ramfes n K f and only f O K /(p) has a nonzero nlpotent element. Our goal n ths handout s to prove the followng result, whch characterzes the prme numbers ramfyng n a number feld n terms of the dscrmnant. Theorem 1.3. For a number feld K, the prmes whch ramfy are those dvdng the nteger dsc Z (O K ). Snce dsc Z (O K ) 0, only fntely many prmes ramfy n K. 1
2 2 KEITH CONRAD 2. The power-bass case We wll frst consder Theorem 1.3 when O K has a power bass over Z. The treatment of the general case n Secton 3 wll not rely on the power-bass case at all, but the power-bass case s techncally smpler. We wll just sketch the basc deas behnd ths specal case. Proof. Assume O K = Z[α] for some α O K. Let f(t ) be the mnmal polynomal of α over Q, so f(t ) s monc n Z[T ]. Wth po K factorng nto prmes as n (1.1), by defnton p ramfes n O K f and only f some e > 1. The factorzaton of the mod p reducton f(t ) n (Z/pZ)[T ] s f(t ) = π e 1 1 πeg g for some dstnct monc rreducbles π (Z/pZ)[T ]. The π (T ) s are separable (all rreducbles over a fnte feld are separable), so some e > 1 f and only f f(t ) has a repeated root n a splttng feld over Z/pZ. Ths s equvalent to f(t ) havng dscrmnant 0: p ramfes n O K f and only f dsc(f) = 0 n Z/pZ. Snce the dscrmnant of a monc polynomal s a unversal polynomal n ts coeffcents (consder the quadratc case, where T 2 + bt + c has dscrmnant b 2 4c), dscrmnants of monc polynomals behave well under reducton: dsc(f(t ) mod p) = dsc(f(t )) mod p. Therefore dsc(f(t )) = 0 n Z/pZ f and only f dsc(f) 0 mod p. Thus p ramfes n O K f and only f p dsc(f). Snce O K = Z[α] = Z[T ]/(f(t )), dsc(f) = dsc Z (Z[T ]/(f)) = dsc Z (O K ). 3. The general case To prove Theorem 1.3 for every O K, we wll examne dscrmnants of rng extensons to show computng the dscrmnant commutes wth reducton mod p: dsc Z (O K ) mod p = dsc Z/pZ (O K /(p)). Then we wll use (1.2) to wrte dsc Z/pZ (O K /(p)) as a product of dscrmnants of rngs of type O K /p e and compute the dscrmnants of these partcular rngs. Defnton 3.1. Let A be a commutatve rng and B be a rng extenson of A whch s a fnte free A-module: B = Ae 1 Ae n. Then we set dsc A (e 1,..., e n ) = det(tr B/A (e e j )) A. Remark 3.2. The dscrmnant of a bass s an algebrac concept of volume. To explan ths vewpont, we should thnk about Tr B/A (xy) as an analogue of the dot product v w n R n. For a bass v 1,..., v n n R n, the ordnary Eucldean volume of the parallelotope { } a v : 0 a 1 havng edges v s det(v v j ). The dscrmnant of an A-bass of B uses the A-valued parng x, y = Tr B/A (xy) on B n place of the R-valued dot product on R n and we just drop the absolute value and the square root when we make the algebrac analogue. How are the dscrmnants of two A-module bases for B related? Pck a second bass e 1,..., e n of B as an A-module. Then e = a j e j, j=1
3 DISCRIMINANTS AND RAMIFIED PRIMES 3 where a j A and the change of bass matrx (a j ) has determnant n A. Then ( ) Tr B/A (e e j) = Tr B/A a k e k a jl e l k=1 so Therefore We set = k=1 l=1 l=1 a k Tr B/A (e k e l )a jl, (Tr B/A (e e j)) = (a j )(Tr B/A (e e j ))(a j ). dsc A (e 1,..., e n) = (det(a j )) 2 dsc A (e 1,..., e n ). dsc A (B) = dsc A (e 1,..., e n ) A for any A-module bass {e 1,..., e n } of B. It s well-defned up to a unt square. In partcular, the condton dsc A (B) = 0 s ndependent of the choce of bass. Gven a number feld K, ramfcaton of the prme p n K has been lnked to the structure of the rng O K /(p) n Secton 1. Let s look at the dscrmnant of ths rng over Z/pZ. Lettng K have degree n over Q, the rng O K s a free rank-n Z-module, say O K = Zω. Reducng both sdes modulo p, O K /(p) = (Z/pZ)ω, so O K /(p) s a vector space over Z/pZ of dmenson n. The dscrmnant of O K s dsc Z (O K ). The next lemma says reducton modulo p commutes (n a sutable sense) wth the formaton of dscrmnants. Lemma 3.3. Choosng bases approprately for O K and O K /(p), dsc Z (O K ) mod p = dsc Z/pZ (O K /(p)). Proof. Pck a Z-bass ω 1,..., ω n of O K. The reductons ω 1,..., ω n n O K /(p) are a Z/pZbass, so the multplcaton matrx [m x ] for any x O K, wth respect to the bass {ω }, reduces modulo p to the multplcaton matrx [m x ] for x on O K /(p) wth respect to the bass {ω }. Therefore Tr (OK /(p))/(z/pz)(x) = Tr(m x ) = Tr(m x ) mod p = Tr OK /Z(x) mod p. Thus, the mod p reducton of the matrx (Tr OK /Z(ω ω j )) s (Tr (OK /(p))/(z/pz)(ω ω j )). Now take determnants. Lemma 3.4. Let A be a commutatve rng and B 1 and B 2 be commutatve rng extensons of A whch are each fnte free A-modules. Then, choosng A-module bases approprately, dsc A (B 1 B 2 ) = dsc A (B 1 ) dsc A (B 2 ).
4 4 KEITH CONRAD Proof. Pck A-module bases for B 1 and B 2 : m B 1 = Ae, B 2 = Af j. As an A-module bass for B 1 B 2 we wll use the m + n elements e 1,..., e m, f 1,..., f n. Snce e f j = 0 n B 1 B 2, the matrx whose determnant s dsc A (B 1 B 2 ) s a block dagonal matrx ( ) (Tr(B1 B 2 )/A(e e k )) O. O (Tr (B1 B 2 )/A(f j f l )) For any x B 1, multplcaton by x on B 1 B 2 klls the B 2 component and acts on the B 1 -component n the way x multples on B 1, so a matrx for multplcaton by x on B 1 B 2 s a matrx whose upper left block s a matrx for multplcaton by x on B 1 and other blocks are 0. Thus Tr (B1 B 2 )/A(x) = Tr B1 /A(x) for x B 1. Smlarly, Tr (B1 B 2 )/A(x) = Tr B2 /A(x) for x B 2. Thus ( ) ( (Tr(B1 B 2 )/A(e e k )) O (TrB1 = /A(e e k )) O O (Tr (B1 B 2 )/A(f j f l )) O (Tr B2 /A(f j f l )) and takng determnants gves Now we prove Theorem 1.3. j=1 dsc A (B 1 B 2 ) = dsc A (B 1 ) dsc A (B 2 ). Proof. We have p dsc Z (O K ) f and only f dsc Z (O K ) 0 mod p. By Lemma 3.3 dsc Z (O K ) mod p = dsc Z/pZ (O K /(p)), so p dsc Z (O K ) f and only f dsc Z/pZ (O K /(p)) = 0 n Z/pZ. In (1.2), each factor O K /p e s a Z/pZ-vector space snce p p e. Usng (1.2) and Lemma 3.4, g dsc Z/pZ (O K /(p)) = dsc Z/pZ (O K /p e ). Therefore we need to show for any prme number p and prme-power deal p e such that p e (p) that dsc Z/pZ (O K /p e ) s 0 n Z/pZ f and only f e > 1. (Recall that the vanshng of a dscrmnant s ndependent of the choce of bass.) Suppose e > 1. Then any x p p e s a nonzero nlpotent element n O K /p e. By lnear algebra over felds, such an x can be used as part of a Z/pZ-bass of O K /p e, say {x 1,..., x n } wth x = x 1. Wrtng the trace map Tr (OK /p e )/(Z/pZ) as Tr for short, the frst column of the matrx (Tr(x x j )) contans the numbers Tr(x x). These traces are all 0: x x s nlpotent, so the lnear transformaton m x x on O K /p e s nlpotent and thus ts egenvalues all equal zero. Snce one column of the trace-parng matrx (Tr(x x j )) s all 0, dsc Z/pZ (O K /p e ) = 0. Now suppose e = 1. Then O K /p e = O K /p s a fnte feld of characterstc p. We want to prove dsc Z/pZ (O K /p) 0. If ths dscrmnant s 0, then (because O K /p s a feld) the trace functon Tr: O K /p Z/pZ s dentcally zero. However, from the theory of fnte felds, ths trace functon can be wrtten as a polynomal functon: Tr(t) = t + t p + t p2 + + t pr 1, ),
5 DISCRIMINANTS AND RAMIFIED PRIMES 5 where #(O K /p) = p r. Snce the degree of ths polynomal s less than the sze of O K /p, ths functon s not dentcally zero on O K /p. Therefore the dscrmnant of a fnte extenson of Z/pZ does not equal zero.
THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationwhere a is any ideal of R. Lemma Let R be a ring. Then X = Spec R is a topological space. Moreover the open sets
11. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of
More informationwhere a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets
5. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of
More informationDIFFERENTIAL FORMS BRIAN OSSERMAN
DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne
More informationIDEAL FACTORIZATION. Theorem 1.2. For elements α and β in a commutative ring, α β as elements if and only if (α) (β) as ideals.
IDEAL FACTORIZATION KEITH CONRAD 1. Introducton We wll prove here the fundamental theorem of deal theory n number felds: every nonzero proper deal n the ntegers of a number feld admts unque factorzaton
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More information12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product
12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton
More informationD.K.M COLLEGE FOR WOMEN (AUTONOMOUS), VELLORE DEPARTMENT OF MATHEMATICS
D.K.M COLLEGE FOR WOMEN (AUTONOMOUS), VELLORE DEPARTMENT OF MATHEMATICS SUB: ALGEBRA SUB CODE: 5CPMAA SECTION- A UNIT-. Defne conjugate of a n G and prove that conjugacy s an equvalence relaton on G. Defne
More informationALGEBRA HW 7 CLAY SHONKWILER
ALGEBRA HW 7 CLAY SHONKWILER 1 Whch of the followng rngs R are dscrete valuaton rngs? For those that are, fnd the fracton feld K = frac R, the resdue feld k = R/m (where m) s the maxmal deal), and a unformzer
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationAn Introduction to Morita Theory
An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory
More informationLECTURE V. 1. More on the Chinese Remainder Theorem We begin by recalling this theorem, proven in the preceeding lecture.
LECTURE V EDWIN SPARK 1. More on the Chnese Remander Theorem We begn by recallng ths theorem, proven n the preceedng lecture. Theorem 1.1 (Chnese Remander Theorem). Let R be a rng wth deals I 1, I 2,...,
More informationErrata to Invariant Theory with Applications January 28, 2017
Invarant Theory wth Applcatons Jan Drasma and Don Gjswjt http: //www.wn.tue.nl/~jdrasma/teachng/nvtheory0910/lecturenotes12.pdf verson of 7 December 2009 Errata and addenda by Darj Grnberg The followng
More informationTHE CLASS NUMBER THEOREM
THE CLASS NUMBER THEOREM TIMUR AKMAN-DUFFY Abstract. In basc number theory we encounter the class group (also known as the deal class group). Ths group measures the extent that a rng fals to be a prncpal
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationThe Ramanujan-Nagell Theorem: Understanding the Proof By Spencer De Chenne
The Ramanujan-Nagell Theorem: Understandng the Proof By Spencer De Chenne 1 Introducton The Ramanujan-Nagell Theorem, frst proposed as a conjecture by Srnvasa Ramanujan n 1943 and later proven by Trygve
More informationinv lve a journal of mathematics 2008 Vol. 1, No. 1 Divisibility of class numbers of imaginary quadratic function fields
nv lve a journal of mathematcs Dvsblty of class numbers of magnary quadratc functon felds Adam Merberg mathematcal scences publshers 2008 Vol. 1, No. 1 INVOLVE 1:1(2008) Dvsblty of class numbers of magnary
More informationPolynomials. 1 What is a polynomial? John Stalker
Polynomals John Stalker What s a polynomal? If you thnk you already know what a polynomal s then skp ths secton. Just be aware that I consstently wrte thngs lke p = c z j =0 nstead of p(z) = c z. =0 You
More information332600_08_1.qxp 4/17/08 11:29 AM Page 481
336_8_.qxp 4/7/8 :9 AM Page 48 8 Complex Vector Spaces 8. Complex Numbers 8. Conjugates and Dvson of Complex Numbers 8.3 Polar Form and DeMovre s Theorem 8.4 Complex Vector Spaces and Inner Products 8.5
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationSmarandache-Zero Divisors in Group Rings
Smarandache-Zero Dvsors n Group Rngs W.B. Vasantha and Moon K. Chetry Department of Mathematcs I.I.T Madras, Chenna The study of zero-dvsors n group rngs had become nterestng problem snce 1940 wth the
More information= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.
Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and
More information9 Characteristic classes
THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct
More informationMEM 255 Introduction to Control Systems Review: Basics of Linear Algebra
MEM 255 Introducton to Control Systems Revew: Bascs of Lnear Algebra Harry G. Kwatny Department of Mechancal Engneerng & Mechancs Drexel Unversty Outlne Vectors Matrces MATLAB Advanced Topcs Vectors A
More informationSection 3.6 Complex Zeros
04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationTHERE ARE NO POINTS OF ORDER 11 ON ELLIPTIC CURVES OVER Q.
THERE ARE NO POINTS OF ORDER 11 ON ELLIPTIC CURVES OVER Q. IAN KIMING We shall prove the followng result from [2]: Theorem 1. (Bllng-Mahler, 1940, cf. [2]) An ellptc curve defned over Q does not have a
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationFactoring polynomials over Z4 and over certain Galois rings
Loughborough Unversty Insttutonal Repostory Factorng polynomals over Z4 and over certan Galos rngs Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Ctaton: SALAGEAN,
More information763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.
7636S ADVANCED QUANTUM MECHANICS Soluton Set 1 Sprng 013 1 Warm-up Show that the egenvalues of a Hermtan operator  are real and that the egenkets correspondng to dfferent egenvalues are orthogonal (b)
More informationMTH 819 Algebra I S13. Homework 1/ Solutions. 1 if p n b and p n+1 b 0 otherwise ) = 0 if p q or n m. W i = rw i
MTH 819 Algebra I S13 Homework 1/ Solutons Defnton A. Let R be PID and V a untary R-module. Let p be a prme n R and n Z +. Then d p,n (V) = dm R/Rp p n 1 Ann V (p n )/p n Ann V (p n+1 ) Note here that
More informationSMARANDACHE-GALOIS FIELDS
SMARANDACHE-GALOIS FIELDS W. B. Vasantha Kandasamy Deartment of Mathematcs Indan Insttute of Technology, Madras Chenna - 600 036, Inda. E-mal: vasantak@md3.vsnl.net.n Abstract: In ths aer we study the
More informationCOMPUTING THE NORM OF A MATRIX
COMPUTING THE NORM OF A MATRIX KEITH CONRAD 1. Introducton In R n there s a standard noton of length: the sze of a vector v = (a 1,..., a n ) s v = a 2 1 + + a2 n. We wll dscuss n Secton 2 the general
More informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More informationAlgorithms for factoring
CSA E0 235: Crytograhy Arl 9,2015 Instructor: Arta Patra Algorthms for factorng Submtted by: Jay Oza, Nranjan Sngh Introducton Factorsaton of large ntegers has been a wdely studed toc manly because of
More informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informationPolynomials. 1 More properties of polynomials
Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a
More informationChapter Twelve. Integration. We now turn our attention to the idea of an integral in dimensions higher than one. Consider a real-valued function f : D
Chapter Twelve Integraton 12.1 Introducton We now turn our attenton to the dea of an ntegral n dmensons hgher than one. Consder a real-valued functon f : R, where the doman s a nce closed subset of Eucldean
More informationALGEBRA MID-TERM. 1 Suppose I is a principal ideal of the integral domain R. Prove that the R-module I R I has no non-zero torsion elements.
ALGEBRA MID-TERM CLAY SHONKWILER 1 Suppose I s a prncpal deal of the ntegral doman R. Prove that the R-module I R I has no non-zero torson elements. Proof. Note, frst, that f I R I has no non-zero torson
More informationLecture 4: Universal Hash Functions/Streaming Cont d
CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationFixed points of IA-endomorphisms of a free metabelian Lie algebra
Proc. Indan Acad. Sc. (Math. Sc.) Vol. 121, No. 4, November 2011, pp. 405 416. c Indan Academy of Scences Fxed ponts of IA-endomorphsms of a free metabelan Le algebra NAIME EKICI 1 and DEMET PARLAK SÖNMEZ
More informationMATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS
MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples
More informationVector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.
Vector Norms Chapter 7 Iteratve Technques n Matrx Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematcs Unversty of Calforna, Berkeley Math 128B Numercal Analyss Defnton A vector norm
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationHomework Notes Week 7
Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we
More informationPolynomial PSet Solutions
Polynomal PSet Solutons Note: Problems A, A2, B2, B8, C2, D2, E3, and E6 were done n class. (A) Values and Roots. Rearrange to get (x + )P (x) x = 0 for x = 0,,..., n. Snce ths equaton has roots x = 0,,...,
More informationEigenvalues of Random Graphs
Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationMath 101 Fall 2013 Homework #7 Due Friday, November 15, 2013
Math 101 Fall 2013 Homework #7 Due Frday, November 15, 2013 1. Let R be a untal subrng of E. Show that E R R s somorphc to E. ANS: The map (s,r) sr s a R-balanced map of E R to E. Hence there s a group
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More informationREGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction
REGULAR POSITIVE TERNARY QUADRATIC FORMS BYEONG-KWEON OH Abstract. A postve defnte quadratc form f s sad to be regular f t globally represents all ntegers that are represented by the genus of f. In 997
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationHowever, since P is a symmetric idempotent matrix, of P are either 0 or 1 [Eigen-values
Fall 007 Soluton to Mdterm Examnaton STAT 7 Dr. Goel. [0 ponts] For the general lnear model = X + ε, wth uncorrelated errors havng mean zero and varance σ, suppose that the desgn matrx X s not necessarly
More informationp-adic Galois representations of G E with Char(E) = p > 0 and the ring R
p-adc Galos representatons of G E wth Char(E) = p > 0 and the rng R Gebhard Böckle December 11, 2008 1 A short revew Let E be a feld of characterstc p > 0 and denote by σ : E E the absolute Frobenus endomorphsm
More informationRestricted Lie Algebras. Jared Warner
Restrcted Le Algebras Jared Warner 1. Defntons and Examples Defnton 1.1. Let k be a feld of characterstc p. A restrcted Le algebra (g, ( ) [p] ) s a Le algebra g over k and a map ( ) [p] : g g called
More informationLecture Notes Introduction to Cluster Algebra
Lecture Notes Introducton to Cluster Algebra Ivan C.H. Ip Updated: Ma 7, 2017 3 Defnton and Examples of Cluster algebra 3.1 Quvers We frst revst the noton of a quver. Defnton 3.1. A quver s a fnte orented
More informationQuantum Mechanics I - Session 4
Quantum Mechancs I - Sesson 4 Aprl 3, 05 Contents Operators Change of Bass 4 3 Egenvectors and Egenvalues 5 3. Denton....................................... 5 3. Rotaton n D....................................
More informationRandom Walks on Digraphs
Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected
More informationA p-adic PERRON-FROBENIUS THEOREM
A p-adic PERRON-FROBENIUS THEOREM ROBERT COSTA AND PATRICK DYNES Advsor: Clayton Petsche Oregon State Unversty Abstract We prove a result for square matrces over the p-adc numbers akn to the Perron-Frobenus
More informationREDUCTION MODULO p. We will prove the reduction modulo p theorem in the general form as given by exercise 4.12, p. 143, of [1].
REDUCTION MODULO p. IAN KIMING We wll prove the reducton modulo p theorem n the general form as gven by exercse 4.12, p. 143, of [1]. We consder an ellptc curve E defned over Q and gven by a Weerstraß
More informationQuantum Mechanics for Scientists and Engineers. David Miller
Quantum Mechancs for Scentsts and Engneers Davd Mller Types of lnear operators Types of lnear operators Blnear expanson of operators Blnear expanson of lnear operators We know that we can expand functons
More informationIntroduction to Algorithms
Introducton to Algorthms 6.046J/8.40J Lecture 7 Prof. Potr Indyk Data Structures Role of data structures: Encapsulate data Support certan operatons (e.g., INSERT, DELETE, SEARCH) Our focus: effcency of
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationThe Pseudoblocks of Endomorphism Algebras
Internatonal Mathematcal Forum, 4, 009, no. 48, 363-368 The Pseudoblocks of Endomorphsm Algebras Ahmed A. Khammash Department of Mathematcal Scences, Umm Al-Qura Unversty P.O.Box 796, Makkah, Saud Araba
More informationOn cyclic of Steiner system (v); V=2,3,5,7,11,13
On cyclc of Stener system (v); V=,3,5,7,,3 Prof. Dr. Adl M. Ahmed Rana A. Ibraham Abstract: A stener system can be defned by the trple S(t,k,v), where every block B, (=,,,b) contans exactly K-elementes
More informationBallot Paths Avoiding Depth Zero Patterns
Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,
More informationShort running title: A generating function approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI
Short runnng ttle: A generatng functon approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI JASON FULMAN Abstract. A recent paper of Church, Ellenberg,
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More informationPRIMES 2015 reading project: Problem set #3
PRIMES 2015 readng project: Problem set #3 page 1 PRIMES 2015 readng project: Problem set #3 posted 31 May 2015, to be submtted around 15 June 2015 Darj Grnberg The purpose of ths problem set s to replace
More informationσ τ τ τ σ τ τ τ σ Review Chapter Four States of Stress Part Three Review Review
Chapter Four States of Stress Part Three When makng your choce n lfe, do not neglect to lve. Samuel Johnson Revew When we use matrx notaton to show the stresses on an element The rows represent the axs
More informationNOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules
NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules EVAN WILSON Quantum groups Consder the Le algebra sl(n), whch s the Le algebra over C of n n trace matrces together wth the commutator
More informationAttacks on RSA The Rabin Cryptosystem Semantic Security of RSA Cryptology, Tuesday, February 27th, 2007 Nils Andersen. Complexity Theoretic Reduction
Attacks on RSA The Rabn Cryptosystem Semantc Securty of RSA Cryptology, Tuesday, February 27th, 2007 Nls Andersen Square Roots modulo n Complexty Theoretc Reducton Factorng Algorthms Pollard s p 1 Pollard
More informationNOTES ON SIMPLIFICATION OF MATRICES
NOTES ON SIMPLIFICATION OF MATRICES JONATHAN LUK These notes dscuss how to smplfy an (n n) matrx In partcular, we expand on some of the materal from the textbook (wth some repetton) Part of the exposton
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationCocyclic Butson Hadamard matrices and Codes over Z n via the Trace Map
Contemporary Mathematcs Cocyclc Butson Hadamard matrces and Codes over Z n va the Trace Map N. Pnnawala and A. Rao Abstract. Over the past couple of years trace maps over Galos felds and Galos rngs have
More informationSTARK S CONJECTURE IN MULTI-QUADRATIC EXTENSIONS, REVISITED
STARK S CONJECTURE IN MULTI-QUADRATIC EXTENSIONS, REVISITED Davd S. Dummt 1 Jonathan W. Sands 2 Brett Tangedal Unversty of Vermont Unversty of Vermont Unversty of Charleston Abstract. Stark s conjectures
More informationBasic Number Theory. Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor. Last revision: June 11, 2001
Basc Number Theory Instructor: Laszlo Baba Notes by Vncent Lucarell and the nstructor Last revson: June, 200 Notaton: Unless otherwse stated, all varables n ths note are ntegers. For n 0, [n] = {, 2,...,
More informationISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013
ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run
More informationOn the Reducibility of Cyclotomic Polynomials over Finite Fields
On the Reducblty of Cyclotomc Polynomals over Fnte Felds Brett Harrson under the drecton of Mk Havlíčková Massachusetts Insttute of Technology Research Scence Insttute August 2, 2005 Abstract The rreducblty
More informationComputation of Units in Number Fields
UTRECHT UNIVERSITY MASTER THESIS Computaton of Unts n Number Felds Author: Bas JACOBS Supervsor: Prof. dr. Frts BEUKERS Second revewer: Prof. dr. Gunther CORNELISSEN June 14, 2016 Abstract We dscuss three
More informationKuroda s class number relation
ACTA ARITMETICA XXXV (1979) Kurodas class number relaton by C. D. WALTER (Dubln) Kurodas class number relaton [5] may be derved easly from that of Brauer [2] by elmnatng a certan module of unts, but the
More informationHOPF ALGEBRAS WITH TRACE AND CLEBSCH-GORDAN COEFFICIENTS. 1. Recollections and the problem
HOPF ALGEBRAS WITH TRACE AND CLEBSCH-GORDAN COEFFICIENTS CORRADO DE CONCINI Abstract. In ths lecture I shall report on some jont work wth Proces, Reshetkhn and Rosso [1]. 1. Recollectons and the problem
More informationEuclidean Systems. Stefan G. Treatman* Communicated by A. Granville. Received November 8, 1996; revised March 6,
Journal of Number Theory 73, 7791 (1998) Artcle No. NT9884 Eucldean Systems Stefan G. Treatman* Department of Mathematcs and Computer Scence, Sant Joseph's Unversty, Phladelpha, Pennsylvana 19131 E-mal:
More informationDIFFERENTIAL SCHEMES
DIFFERENTIAL SCHEMES RAYMOND T. HOOBLER Dedcated to the memory o Jerry Kovacc 1. schemes All rngs contan Q and are commutatve. We x a d erental rng A throughout ths secton. 1.1. The topologcal space. Let
More informationw ). Then use the Cauchy-Schwartz inequality ( v w v w ).] = in R 4. Can you find a vector u 4 in R 4 such that the
Math S-b Summer 8 Homework #5 Problems due Wed, July 8: Secton 5: Gve an algebrac proof for the trangle nequalty v+ w v + w Draw a sketch [Hnt: Expand v+ w ( v+ w) ( v+ w ) hen use the Cauchy-Schwartz
More informationDifferential Polynomials
JASS 07 - Polynomals: Ther Power and How to Use Them Dfferental Polynomals Stephan Rtscher March 18, 2007 Abstract Ths artcle gves an bref ntroducton nto dfferental polynomals, deals and manfolds and ther
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationMEM633 Lectures 7&8. Chapter 4. Descriptions of MIMO Systems 4-1 Direct Realizations. (i) x u. y x
MEM633 Lectures 7&8 Chapter 4 Descrptons of MIMO Systems 4- Drect ealzatons y() s s su() s y () s u () s ( s)( s) s y() s u (), s y() s u() s s s y() s u(), s y() s u() s ( s)( s) s () ( s ) y ( s) u (
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More information