A p-adic PERRON-FROBENIUS THEOREM
|
|
- Valerie Lillian Thompson
- 5 years ago
- Views:
Transcription
1 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 Theorem for square matrces over the real numbers In partcular, we show that f a square n n matrx A has all entres p-adcally close to 1, then ths matrx wll possess a unque maxmal egenvalue 0 such that: a 0 s a p-adc nteger, b 0 has an algebrac multplcty of one, and c there exsts an egenvector assocated to 0 wth all entres p-adcally close to 1 Furthermore, we show that teraton of A/ 0 converges to a projecton operator onto the egenspace of 0 1 Introducton The classcal Perron-Frobenus Theorem gves us nformaton about square matrces wth all entres gven by postve real numbers Theorem 11 Perron-Frobenus, Theorem 1 n Chapter 16 of [3] Let A be a square matrx wth all entres gven by postve real numbers Then there exsts an egenvalue 0 of A of multplcty one such that 0 s a postve real number and < 0 for all other complex egenvalues of A Furthermore, there exsts an egenvector v of A wth egenvalue 0 such that all components of v are postve real numbers A useful applcaton of Theorem 11 s the followng Theorem 12 Theorem 3 n Chapter 16 of [3] Let A be a square n n matrx wth all entres gven by postve real numbers such that, for each column of A, the sum of the entres n that column s 1 Then the maxmal egenvalue 0 of A guaranteed by Theorem 11 s equal to 1, and for any vector x R n wth all entres nonnegatve, the sequence A k x converges to an egenvector of 0 The dynamcal mplcatons of Theorem 12 make t useful for studyng many real-world phenomena Matrces n the form of the matrx A from Theorem 12 are used to model changes n atomc nucle and populatons n ecologcal systems [3, p 241], and Theorem 12 tself forms the bass of Google s search strategy [3, p 242] Our frst result over the p-adc numbers s analogous to Theorem 11 Ths result apples to any p-adc n n matrx A, where: a all entres of A are n 1 + pz p, and b p n For a demonstraton of why these condtons cannot be relaxed, see Example 43 Date: August 13, 2015 Ths work was done durng the Summer 2015 REU program n Mathematcs at Oregon State Unversty Ths work was supported by the Natonal Scence Foundaton Grant DMS
2 2 Robert Costa and Patrck Dynes Theorem 13 Let p be a prme and let n be a postve nteger such that p n Let A be a square n n matrx wth all entres n 1 + pz p ; that s, let 1 + pa pa pa 1n 1 + pa A = pa pa 2n, pa n1 1 + pa n2 1 + pa nn where each a j Z p Then there exsts an egenvalue 0 of A of multplcty one such that 0 Z p, 0 n mod pz p, and p < 0 p for all other egenvalues of A n C p In addton, there exsts an egenvector v of A wth egenvalue 0 such that all components of v are elements of 1 + pz p Our next result states that we can relax the condton of Theorem 13 that p n as long as we strengthen the other condton accordng to the extent to whch p n Specfcally, gven a prme p and postve nteger n, we show that the concluson of Theorem 13 about the exstence of a strctly maxmal egenvalue 0 of A stll holds f we requre that all entres of A be close enough to 1 Theorem 14 Let p be a prme and let n, l be postve ntegers Let A be a square n n matrx wth all entres n 1 + p l Z p ; that s, let 1 + p l a p l a p l a 1n 1 + p A = l a p l a p l a 2n, p l a n1 1 + p l a n2 1 + p l a nn where each a j Z p Suppose l > 2n 1ν p n Then there exsts an egenvalue 0 of A of multplcty one such that 0 Z p, 0 n p p l / n n 1 p, and p < 0 p for all other egenvalues of A n C p Our fnal result analyzes the forward orbts of vectors wth p-adc components under teraton by p-adc square matrces wth a strctly domnant egenvalue of multplcty one We produce a statement for matrces over the p-adc numbers analogous to that of Theorem 12 for matrces over the real numbers Theorem 15 Let A be a square n n matrx wth all entres n Q p Suppose that A has an egenvalue 0 of multplcty one such that p < 0 p for all other egenvalues of A n C p Then teraton of A/ 0 converges to a projecton operator onto the egenspace of 0 2 Background on the p-adc Numbers We begn wth some remarks on the p-adc numbers Q p and ther complete, algebracally closed extenson C p Unless otherwse specfed, we wll take p to be any prme number We refer the reader to [2] for more detals on Q p and C p
3 21 Constructon of Q p A p-adc Perron-Frobenus Theorem 3 Defnton 21 The p-adc valuaton on Z s the functon ν p : Z \ { 0 } Z defned by { max { k N : p k n } f p n ν p n = 3 0 f p n We extend ν p to Q as follows: we defne ν p : Q Z { } by { νp a ν p b f x = a/b Q ν p x = f x = 0 Defnton 22 The p-adc absolute value on Q s the functon p : Q R defned by where we defne p = 0 4 x p = p νpx, 5 We recall that a feld K s complete f every Cauchy sequence n K converges n K It s known that Q s not complete wth respect to any of ts nontrval absolute values [2, Lemma 323] Defnton 23 The feld Q p of p-adc numbers s the completon of Q wth respect to the p-adc absolute value 22 Propertes of Q p There are several useful propertes of Q p that we wll keep n mnd throughout our work The frst of these appears as part of Theorem 3213 n [2] Theorem 24 Fx a prme p and let a, b Q p Then a + b p max { a p, b p } 6 Theorem 25 Proposton 233 n [2] Fx a prme p and let a, b Q p wth a p b p Then a + b p = max { a p, b p } 7 It s a consequence of Theorem 24 that Z p = { x Q p : x p 1 } s a subrng of Q p ; we call ths the rng Z p of p-adc ntegers It follows smlarly that pz p = { x Q p : x p < 1 } s the unque maxmal deal of Z p The quotent feld Z p /pz p s called the resdue feld of Z p ; t s an mmedate consequence of [2, Corollary 336] that Z p /pz p = Z/pZ The followng results allow us to deduce nformaton about the roots of a polynomal fx Z p [X] from the behavor of the reductons of fx and f X modulo pz p f X beng the formal dervatve of fx Theorem 26 Hensel s Lemma, Theorem 341 n [2] Let fx be a polynomal whose coeffcents are n Z p and suppose that there exsts a p-adc nteger α 1 Z p such that and fα 1 0 mod pz p 8 f α 1 0 mod pz p 9 Then there exsts a unque p-adc nteger α Z p such that fα = 0 and α α 1 mod pz p
4 4 Robert Costa and Patrck Dynes Theorem 27 Strong Hensel s Lemma, Lemma 31 and Corollary 1 n [1] Let fx Z p [X] be a polynomal whose coeffcents are n Z p and suppose that there exsts a p-adc nteger α 1 Z p such that fα 1 p < f α 1 2 p 10 Then there exsts a unque p-adc nteger α Z p for whch fα = 0 and α α 1 p fα 1 p f α 1 p 11 We conclude ths subsecton wth a theorem that gves us suffcent condtons for a polynomal n Z p [x] to be rreducble over Q p Theorem 28 Esensten Irreducblty Crteron, Proposton 5311 n [2] Let be a polynomal satsfyng the condtons a n p = 1, a p < 1 for 0 < n, and a 0 p = 1/p Then fx s rreducble over Q p fx = a 0 + a 1 X + + a n X n Z p [x] The Feld C p and Newton Polygons Whle the algebrac closure Q p of Q p s not complete [2, Theorem 574], the completon of Q p s algebracally closed [2, Proposton 578]; we call ths feld C p Defnton 29 Let fx = a 0 + a 1 X + + a n X n C p [X] be a polynomal The Newton polygon of f s the lower convex hull of the set of ponts S = {, ν p a : 1 n } 13 By a slope of the Newton polygon, we wll mean the slope of a lne segment appearng n the polygon Gven a slope of the polygon, by the length of the slope, we wll mean the length of the projecton of the correspondng segment on the x-axs It s clear that snce the Newton polygon s the lower convex hull of a set of ponts n R 2, the slopes form a nondecreasng sequence f we pck the correspondng segments from left to rght Theorem 210 Theorem 647 n [2] Let fx = a 0 + a 1 X + + a n X n C p [X] be a polynomal, and let m 1, m 2,, m r be the slopes of ts Newton polygon n ncreasng order Let 1, 2,, r be the correspondng lengths Then, for each k, 1 k r, fx has exactly k roots countng multplctes of absolute value p m k 3 Background on Lnear Algebra We now revew necessary background materal on lnear algebra We wll take A to be a square n n wth entres from a feld F We refer the reader to [3] and [4] for addtonal detals on lnear algebra
5 A p-adc Perron-Frobenus Theorem 5 31 Calculaton of Determnants A useful formula for computng determnants s provded n [3, Chapter 5, Equaton 16] Ths formula expresses the determnant of A as the sum of sgned products of entres from dstnct rows and columns n A We wll quote ths formula below for convenence Lemma 31 Determnant Formula Let S n denote the symmetrc group on { 1,, n }, and let sgn denote the sgn functon of permutatons n S n Then deta = n sgnσ a,σ 14 σ S n 32 Calculatons Involvng Jordan Normal Forms We brefly revew how to compute powers of matrces gven n Jordan normal form Let A be a matrx n Jordan normal form: =1 J m J J = m2 0, J mj where, for 1 j, J m s the m m Jordan block assocated to the egenvalue of J: J m = Dfferent Jordan blocks may share the same egenvalue, but dfferent egenvalues may not share the same Jordan bock A useful computatonal property of Jordan normal forms, as noted n Secton 55 of [4], s that we can easly compute powers of A: Jm1 n J J n m = n J n m j Thus, n order to compute J n for a postve nteger n, we only have to compute the power J n m of each Jordan block J m By nducton, we wll show that, for any postve nteger n, n n 1 n 1 n n m m 2 2 n n m m n Jm n n n m m 3 3 n n m m 2 2 = n n 1 n n
6 6 Robert Costa and Patrck Dynes If a < b, we say a b = 0, as s standard In the case n = 1, the formula 18 agrees wth the Jordan block J m Suppose nductvely that the formula 18 holds for some nteger n = k 1 That s, We compute J k+1 m : k k 1 k 1 k k m m 2 2 k k m m k n k m m 3 3 k k m m 2 2 Jm k = k k 1 k k k k 1 k 1 k k m m 2 2 k k m m k k k m m 3 3 k k m m Jm k+1 = k k 1 k k k+1 k + k 1 k k k m m k k m m k+1 k k m m k k m m 2 3 = 0 0 k + 21 k 1 k 0 0 k+1 k+1 k+1 k k+1 k+1 m m 2 2 k+1 k+1 m m k+1 k+1 k+1 m m 3 3 k+1 k+1 m m 2 2 = k+1 k+1 k k+1 The fnal step follows by Pascal s dentty for bnomal coeffcents: a + 1 = b + 1 a a + b b for nonnegatve ntegers a and b Hence, the formula 18 holds for n = k + 1 By the Prncple of Mathematcal Inducton, ths formula holds for all postve ntegers n
7 A p-adc Perron-Frobenus Theorem 7 4 Proofs of Man Results 41 Proof of Theorem 13 In ths subsecton, we establsh Theorem 13 Our argument wll make use of the Newton polygon assocated to the characterstc polynomal fx of A Frst we establsh several lemmas Lemma 41 Let p be a prme and let n be a postve nteger Let A be a square n n matrx wth all entres n 1 + pz p ; that s, let Then deta p p 1 n Proof Usng Lemma 31, we calculate: 1 + pa pa pa 1n 1 + pa A = pa pa 2n pa n1 1 + pa n2 1 + pa nn deta = σ S n sgnσ = σ S n sgnσ = σ S n sgnσ = n k=0 where for each I { 1,, n } we defne I {1,,n} I =k n 1 + a,σ p 25 =1 I {1,,n} n k=0 a,σ p 26 I I {1,,n} I =k SI = σ S n sgnσ I a,σ p 27 I p k SI, 28 a,σ 29 Now suppose that 0 k n 2 Let I { 1,, n } wth I = k Snce I n 2, there exsts a transposton ɛ S n that fxes the elements of I Then snce the map σ σɛ s a bjecton from S n to tself, we can wrte SI = σ S n sgnσɛ I a,σɛ 30 = sgnɛ sgnσ a,σ σ S n I 31 = SI, 32
8 8 Robert Costa and Patrck Dynes where n lne 31 we use the fact that a,σɛ = a,σ for all σ S n and for all I The statement SI = SI mples that SI = 0, so lne 28 becomes n deta = p k SI 33 k=n 1 I {1,,n} I =k We see from Theorem 24 that for any subset I of { 1,, n }, SI p 1 Takng the p-adc absolute value of both sdes of equaton 33 and agan applyng Theorem 24, we fnd that n deta p p k max { p p n 1 p, p n p } = p 1 n 34 k=n 1 I {1,,n} I =k Lemma 42 Let the matrx A be as n the statement of Lemma 41 Let the characterstc polynomal fx of A be gven as: fx = X n + C n 1 X n C 1 X + C 0 35 Then C p p 1 n+ for 0 n 1, and f addtonally p n, C n 1 p = 1 Proof Frst we establsh some notatons Gven postve ntegers and j, let δ,j represent the Kronecker delta functon of and j Gven a permutaton σ S n, let Fxσ denote the set of all elements of { 1,, n } that are fxed by σ Gven a subset I of { 1,, n }, let I c represent the set { 1,, n } \ I We apply Lemma 31 to A XI to fnd the characterstc polynomal fx of A: fx = 1 n deta XI 36 = 1 n n sgnσ 1 + pa,σ δ,σ X σ S n 37 = 1 n σ S n sgnσ = 1 n σ S n sgnσ = 1 n I {1,,n} =1 I {1,,n} I Fxσ 1 I X I 1 + pa,σ δ,σ X 38 I c I 1 + pa,σ 1 I X I 39 I c sgnσ 1 + pa,σ 40 I c σ Sn I Fxσ Note that f we let A I denote the n I n I matrx formed by removng the th row and column from A for each I, then lne 40 becomes fx = 1 n 1 I X I deta I 41 I {1,,n}
9 A p-adc Perron-Frobenus Theorem 9 Ths s because, gven I { 1,, n }, applyng Lemma 31 to A I tells us that deta I = sgnσ 1 + pa,σ 42 I c σ SymI c = σ S n I Fxσ sgnσ I c 1 + pa,σ 43 It follows that for 0 n 1, the coeffcent C can be calculated by addng and subtractng the determnants of n n matrces wth entres n 1 + pz p ; Lemma 41 mples that each of these determnants has a p-adc absolute value of at most p 1 n = p 1 n+, and Theorem 24 then mples that C p p 1 n+ 44 Suppose, addtonally, that p n We note by lne 41 that C n 1 p = deta I 45 p I =n 1 = tra p 46 = 1 + a 11 p a nn p p 47 = n + a a nn p p 48 It follows from Theorem 24 that a a nn p 1, and so a a nn p p p 1 But n p = 1 snce p n, so by Theorem 25, lne 48 becomes C n 1 p = max { n p, a a nn p p } = n p = 1 49 Proof of Theorem 13 Let the matrx A be as n the statement of Theorem 13 Suppose that p n Our frst goal s to show the exstence of a strctly maxmal egenvalue 0 of A of multplcty one We reach ths goal by an analyss of the characterstc polynomal fx of A We frst construct a partal Newton polygon for fx Referrng to Lemma 42, we fnd that ν p C n + 1 for 0 n 2, and ν p C n 1 = 0 = ν p 1; see Fgure 1 The slope of the Newton polygon from n 2, ν p C n 2 to n 1, 0 must be at most 0 1 = 1 The fact that the Newton polygon s the lower convex hull of a set of ponts n R 2 mples that the slopes are nonncreasng from rght to left, so we conclude that all slopes to the left of n 1, 0 must be at most 1 Applyng Theorem 210 to ths Newton polygon, we fnd that there are n 1 roots of fx n C p, countng multplctes of absolute value at most p 1, and there s one root 0 wth 0 p = p 0 = 1 50 It follows that 0 s a strctly maxmal egenvalue of A of multplcty one Our second goal s to show that 0 Z p Ths wll requre an applcaton of Theorem 26, Hensel s lemma In partcular, we wll show that 0 n mod pz p Recall we showed n
10 10 Robert Costa and Patrck Dynes n n 1 Remanng Ponts Le n ths Regon n 1 n Fgure 1 Newton Polygon for fx n the proof of Theorem 13 Lemma 42 that f we wrte the characterstc polynomal fx of A as fx = X n + C n 1 X n C 1 X + C 0, 51 then we know that C p p 1 n+ for 0 n 1, and C n 1 p = 1 snce p n Thus, fx Z p [X], so fn and f n are n Z p Note that C n 1 = tra = n a a nn p n mod pz p 52 Reducng fn and f n modulo pz p, we fnd that snce C p p 1 for 0 n 2, whereas fn n n nn n 1 mod pz p 53 0 mod pz p, 54 f n nn n 1 n 2 nn n 2 mod pz p 55 n n n n + n n 1 mod pz p 56 n n 1 0 mod pz p 57 We now apply Theorem 26 to conclude that there exsts a unque p-adc nteger α Z p such that fα = 0 and α n mod pz p Wrtng α = n + x for some x pz p, t follows from Theorem 25 that α p = n p = 1 But we saw n equaton 50 that 0 s the unque root of fx of p-adc absolute value 1, so t follows that 0 = α Z p We now have that 0 n mod pz p 58 What remans s to show that there exsts an egenvector of A wth egenvalue 0 such that all of ts components are elements of 1 + pz p We can solve a lnear system of equatons
11 A p-adc Perron-Frobenus Theorem 11 n Q p to fnd a nonzero egenvector v = v 1,, v n Q n p of 0 If we pck a component v of v such that v p = max { v 1 p,, v n p }, then t follows that s an egenvector of 0 contaned n Z n p Snce u = 1, we see that u = v v 59 Au = 0 u = 0 n mod pz p 60 The matrx A s equvalent to the matrx of all 1 s modulo pz p, so for all j wth 1 j n, calculatng Au j as the scalar product of the jth row of A wth u shows that Au j u u n mod pz p 61 Thus, all of the components of Au j are equvalent to each other modulo pz p, and by equaton 60, they are all equvalent to n modulo pz p But snce Au = 0 u, we also know that Au j = 0 u j nu j mod pz p 62 for all j wth 1 j n Then we have the system of equatons: n nu 1 mod pz p 63 n nu 2 mod pz p 64 n nu n mod pz p 65 Snce n 0 mod pz p, we can dvde each lne above through by n to see that every component u j of u s equvalent to 1 modulo pz p and s hence an element of 1 + pz p Example 43 Here we show that the conclusons of Theorem 13 do not necessarly hold f we relax the condtons that: a all entres of A are n 1 + pz p, and b p n When we appled Theorem 26 n the proof of Theorem 13 to show that the maxmal egenvalue was n Z p, we used the fact that fn 0 mod pz p, but f n 0 mod pz p It stands to reason that f we want the maxmal egenvalue to not be n Z p, t would be worthwhle to consder cases where f n s equvalent to zero modulo pz p We consder the matrx A Mat 2 2 Q 2 defned by [ ] 1 + 2a a A = 12, a a 22 where each a j Z 2 The characterstc polynomal of A s fx = X 2 trax + deta, 67 so f X = 2X tra and f 2 = 4 tra If f 2 = 0, then tra = 4 Then 2 + 2a 11 + a 22 = 4 68 a 11 + a 22 = 1 69
12 12 Robert Costa and Patrck Dynes Let a 11, a 12, a 21, a 22 = 1/3, 0, 0, 2/3, so that each a j Z 2 and a 11 + a 22 = 1 Then equaton 66 becomes 5/3 1 A =, /3 and equaton 67 becomes fx = X 2 4X + 26/9 71 Takng the 2-adc absolute values of the coeffcents of fx n equaton 71, we fnd that 1 2 = 1, 4 2 = 1/4 < 1, and 26/9 2 = 1/2 We conclude by Theorem 28 that fx s rreducble over Q 2 Thus, nether egenvalue of fx s n Q 2, let alone Z 2 If we look at the Newton polygon of fx, we see that ts vertces are 0, 1 and 2, 0, so ts egenvalues have the same 2-adc absolute value, 2 1/2 42 Proof of Theorem 14 In ths subsecton, we generalze Theorem 13 to establsh Theorem 14 Many parts of the argument wll be smlar Lemma 44 Let p be a prme and let n, l be postve ntegers Let A be a square n n matrx wth all entres n 1 + p l Z p ; that s, let 1 + p l a p l a p l a 1n 1 + p A = l a p l a p l a 2n p l a n1 1 + p l a n2 1 + p l a nn Then deta p p l1 n Proof The argument s as n the proof of Lemma 41; the only dfference s that one must replace p wth p l throughout Lemma 45 Let the matrx A be as n the statement of Lemma 44 Let the characterstc polynomal fx of A be gven as: fx = X n + C n 1 X n C 1 X + C 0 73 Then C p p l1 n+ for 0 n 2 and f addtonally l > ν p n, C n 1 p = n p Proof The estmates for C p n the case 0 n 2 follow as n the proof of Lemma 42; the only dfference s that one must replace p wth p l throughout Suppose addtonally that l > ν p n, so n p > p l p p l a a nn p We estmate: C n 1 p = tra p 74 = 1 + p l a p l a nn p 75 = n + p l a a nn p 76 = n p 77
13 A p-adc Perron-Frobenus Theorem 13 Proof of Theorem 14 Let the matrx A be as n the statement of Theorem 14 Suppose n > 1, for otherwse ths dscusson s trval Suppose that l > 2n 1ν p n Our frst goal s to show the exstence of a strctly maxmal egenvalue 0 of A of multplcty one Ths requres a careful analyss of the characterstc polynomal fx of A From Lemma 45, we have that ν p C ln 1 for 0 n 2, and ν p C n 1 = ν p n We note that snce n s a postve nteger larger than 1, the hypotheses mply that l > 2ν p n, so ν p C n 1 < l/2 We construct a partal Newton polygon for fx; see Fgure 2 nl n 1l Remanng Ponts Le n ths Regon 2l l 1 2 n 2 n 1 n Fgure 2 Newton Polygon for fx n the proof of Theorem 14 We note that the lne segment connectng n 1, ν p C n 1 wth n, 0 has the slope 0 ν p C n 1 n n 1 = ν pc n 1 78 > l/2 79 We now consder extendng the lne segment through n 1, ν p C n 1 and n, 0 to the left untl t ntersects the y axs For 0 n 2, we bound the y-coordnate of the pont on the lne segment extenson wth x-coordnate : ν p C n 1 n < l/2n 80 = l/2n 1 + l/2 81 ν p C /2 + l/2 82 ν p C /2 + ν p C /2 83 = ν p C 84
14 14 Robert Costa and Patrck Dynes The calculaton above shows that ths lne segment extenson wll le strctly below the remanng ponts of the Newton polygon We note that the slopes of the segments of the Newton polygon to the left of the pont n 1, ν p C p 1 are bounded above by the slope of the lne segment through n 2, l and n 1, ν p C n 1 We calculate: ν p C n 1 l n 1 n 2 < l/2 l 85 = l/2 86 Applyng Theorem 210 to ths Newton polygon, we fnd that there are n 1 roots of fx n C p, countng multplctes of absolute value strctly less than p l/2 We wll denote these roots by 1, 2,, m Furthermore, there s one root, denoted 0, of absolute value strctly greater than p l/2 Ths root s a strctly maxmal egenvalue of A of multplcty one Now that we have establshed the exstence of a maxmal egenvalue 0, we wll show that 0 s a p-adc nteger Ths wll requre an applcaton of Theorem 27, the strong verson of Hensel s lemma We calculate: fn = n n + C n 1 n n 1 + C n 2 n n C 1 n + C 0 87 = n n n + p l a a nn n n 1 + C n 2 n n C 1 n + C 0 88 = p l a a nn n n 1 + C n 2 n n C 1 n + C 0 89 Snce C p p l for 0 n 2, we have the bound fn p p l We calculate: f n = nn n 1 + n 1C n 1 n n 2 + n 2C n 2 n n C 1 90 = n n n 1n + p l a a nn n n 2 + n 2C n 2 n n C 1 91 = n n + n n 2 n n 1 n + p l a a nn + n 2C n 2 n n C 1 92 = n n 1 + p l n n 2 n n 1 a a nn + n 2C n 2 n n C 1 93 Snce l > n 1ν p n, so that p l < n n 1 p, and snce C p p l for 0 n 2, we have the equalty f n p = n n 1 p Fnally, snce l > 2n 1ν p n, we have the bound: fn p p l 94 < p 2n 1νpn 95 = n 2n 1 p 96 = f n 2 p 97 We now apply Theorem 27 to conclude that there exsts a unque p-adc nteger α so that fα = 0 satsfyng
15 A p-adc Perron-Frobenus Theorem 15 α n p fn p f n p 98 p l n n 1 p 99 < p l p l/2 100 = p l/2 101 We wll show that the none of the nonmaxmal egenvalues are canddates for the root α found by Hensel s lemma Let, 1 m be a nonmaxmal egenvalue of A Snce p < p l/2 and n p > p l/2, we have: n p > p l/2 102 Hence, the nonmaxmal egenvalues are not α Thus 0 = α In partcular, 0 s a p-adc nteger From 99, we obtan 0 n p p l / n n 1 p From the Newton polygon n Fgure 2 and the estmate for C n 1 p from Lemma 45, we calculate: 0 p = C n 1 p 103 = n p Proof of Theorem 15 In ths subsecton, we establsh Theorem 15 Out argument wll make use of the Jordan canoncal form of n n matrces wth a strctly domnatng egenvalue of multplcty one Proof of Theorem 15 Let A be an n n matrx wth an egenvalue 0 of multplcty one such that p < 0 p for all other egenvalues of A We wrte the Jordan canoncal form of A n block form: J A = Q 1 m1 0 Q, J mj where the J m are m m Jordan blocks assocated to the nonmaxmal egenvalues of A We wll denote the nonmaxmal egenvalues, by 1, 2,, j ; note, however, that the egenvalues n ths lst are not necessarly dstnctwe wrte out each matrx J m as:
16 16 Robert Costa and Patrck Dynes We calculate the kth power of these Jordan blocks: J m = k k 1 k 1 k k m m k k k m m 3 3 Jm k = 0 0 k k m 1 k m 2 k m 1 k m k 1 k k For a postve nteger k, the kth power of A can be calculated as k A k = Q 1 0 Jm k 1 0 Q 108 We wll now dvde through by k 0 to obtan: We compute each power J k m / k 0: 0 0 J k m j A/ 0 k = Q 1 0 Jm k 1 / k 0 0 Q Jm k j / k 0 k k k k k m 1 m 1 0 k 0 0 k k m 2 m 2 0 Jm k / k 0 = 0 0 k k k m m
17 A p-adc Perron-Frobenus Theorem 17 Notng that each p < 0 p for 1 j, we see that each block J k m / k 0 vanshes as k tends towards nfnty Thus as as k tends towards nfnty, the sequence A/ 0 k converges to P = Q 1 Q Snce Q and Q 1 nduce a change of bass from the standard bass of Q n p to the bass of generalzed egenvectors of A, and snce the frst column of Q 1 s the egenvector v 0 assocated to the maxmal egenvalue 0, P s the projecton onto the egenspace spanned by v 0 References [1] JWS Cassels Local Felds Cambrdge Unversty Press, frst edton, 1986 [2] Fernando Q Gouvêa p-adc Numbers: An Introducton Sprnger, second edton, 1997 [3] Peter D Lax Lnear Algebra and Its Applcatons Wley, second edton, 2007 [4] Igor R Shafarevch and Alexey O Remzov Lnear Algebra and Geometry Sprnger, frst edton, 2012 Tufts Unversty E-mal address: robert jcosta@tuftsedu Clemson Unversty E-mal address: pdynes@gclemsonedu
APPENDIX 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 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 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 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 informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result 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 informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationTHE 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 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 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 informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
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 informationDISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization
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.
More informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
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 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 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 informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
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 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 informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
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 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 informationA FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX
Hacettepe Journal of Mathematcs and Statstcs Volume 393 0 35 33 FORMUL FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIGONL MTRIX H Kıyak I Gürses F Yılmaz and D Bozkurt Receved :08 :009 : ccepted 5
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 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 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 informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
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 informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
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 informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
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 informationThe Degrees of Nilpotency of Nilpotent Derivations on the Ring of Matrices
Internatonal Mathematcal Forum, Vol. 6, 2011, no. 15, 713-721 The Degrees of Nlpotency of Nlpotent Dervatons on the Rng of Matrces Homera Pajoohesh Department of of Mathematcs Medgar Evers College of CUNY
More informationDeterminants Containing Powers of Generalized Fibonacci Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 19 (2016), Artcle 1671 Determnants Contanng Powers of Generalzed Fbonacc Numbers Aram Tangboonduangjt and Thotsaporn Thanatpanonda Mahdol Unversty Internatonal
More informationRepresentation theory and quantum mechanics tutorial Representation theory and quantum conservation laws
Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationTHERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS
Research and Communcatons n Mathematcs and Mathematcal Scences Vol 10, Issue 2, 2018, Pages 123-140 ISSN 2319-6939 Publshed Onlne on November 19, 2018 2018 Jyot Academc Press http://jyotacademcpressorg
More informationLinear Algebra and its Applications
Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler
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 informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
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 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 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 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 informationIntroduction. - The Second Lyapunov Method. - The First Lyapunov Method
Stablty Analyss A. Khak Sedgh Control Systems Group Faculty of Electrcal and Computer Engneerng K. N. Toos Unversty of Technology February 2009 1 Introducton Stablty s the most promnent characterstc of
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 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 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 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 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 informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
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 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 informationBézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0
Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of
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 informationA new construction of 3-separable matrices via an improved decoding of Macula s construction
Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula
More informationDistribution det x s on p-adic matrices
January 30, 207 Dstruton det x s on p-adc matrces aul arrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ Let e a p-adc feld wth ntegers o, local parameter, and resdue feld cardnalty q. Let A
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationGoogle PageRank with Stochastic Matrix
Google PageRank wth Stochastc Matrx Md. Sharq, Puranjt Sanyal, Samk Mtra (M.Sc. Applcatons of Mathematcs) Dscrete Tme Markov Chan Let S be a countable set (usually S s a subset of Z or Z d or R or R d
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationOn the irreducibility of a truncated binomial expansion
On the rreducblty of a truncated bnomal expanson by Mchael Flaseta, Angel Kumchev and Dmtr V. Pasechnk 1 Introducton For postve ntegers k and n wth k n 1, defne P n,k (x = =0 ( n x. In the case that k
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 informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
More informationSome basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C
Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +
More information20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.
20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed
More informationBezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0
Bezer curves Mchael S. Floater August 25, 211 These notes provde an ntroducton to Bezer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of the
More informationP.P. PROPERTIES OF GROUP RINGS. Libo Zan and Jianlong Chen
Internatonal Electronc Journal of Algebra Volume 3 2008 7-24 P.P. PROPERTIES OF GROUP RINGS Lbo Zan and Janlong Chen Receved: May 2007; Revsed: 24 October 2007 Communcated by John Clark Abstract. A rng
More informationRapid growth in finite simple groups
Rapd growth n fnte smple groups Martn W. Lebeck, Gl Schul, Aner Shalev March 1, 016 Abstract We show that small normal subsets A of fnte smple groups grow very rapdly namely, A A ɛ, where ɛ > 0 s arbtrarly
More informationNon-negative Matrices and Distributed Control
Non-negatve Matrces an Dstrbute Control Yln Mo July 2, 2015 We moel a network compose of m agents as a graph G = {V, E}. V = {1, 2,..., m} s the set of vertces representng the agents. E V V s the set of
More informationAn (almost) unbiased estimator for the S-Gini index
An (almost unbased estmator for the S-Gn ndex Thomas Demuynck February 25, 2009 Abstract Ths note provdes an unbased estmator for the absolute S-Gn and an almost unbased estmator for the relatve S-Gn for
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 informationComplex Numbers Alpha, Round 1 Test #123
Complex Numbers Alpha, Round Test #3. Wrte your 6-dgt ID# n the I.D. NUMBER grd, left-justfed, and bubble. Check that each column has only one number darkened.. In the EXAM NO. grd, wrte the 3-dgt Test
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationA property of the elementary symmetric functions
Calcolo manuscrpt No. (wll be nserted by the edtor) A property of the elementary symmetrc functons A. Esnberg, G. Fedele Dp. Elettronca Informatca e Sstemstca, Unverstà degl Stud della Calabra, 87036,
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationarxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
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 informationRemarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence
Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
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 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 informationMULTIPLICATIVE FUNCTIONS: A REWRITE OF ANDREWS CHAPTER 6
MULTIPLICATIVE FUNCTIONS: A REWRITE OF ANDREWS CHAPTER 6 In these notes we offer a rewrte of Andrews Chapter 6. Our am s to replace some of the messer arguments n Andrews. To acheve ths, we need to change
More informationPhysics 5153 Classical Mechanics. Principle of Virtual Work-1
P. Guterrez 1 Introducton Physcs 5153 Classcal Mechancs Prncple of Vrtual Work The frst varatonal prncple we encounter n mechancs s the prncple of vrtual work. It establshes the equlbrum condton of a mechancal
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
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 informationGELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n
GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n KANG LU FINITE DIMENSIONAL REPRESENTATIONS OF gl n Let e j,, j =,, n denote the standard bass of the general lnear Le algebra gl n over the feld of
More informationStatistical Mechanics and Combinatorics : Lecture III
Statstcal Mechancs and Combnatorcs : Lecture III Dmer Model Dmer defntons Defnton A dmer coverng (perfect matchng) of a fnte graph s a set of edges whch covers every vertex exactly once, e every vertex
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationSpectral Graph Theory and its Applications September 16, Lecture 5
Spectral Graph Theory and ts Applcatons September 16, 2004 Lecturer: Danel A. Spelman Lecture 5 5.1 Introducton In ths lecture, we wll prove the followng theorem: Theorem 5.1.1. Let G be a planar graph
More informationMAT 578 Functional Analysis
MAT 578 Functonal Analyss John Qugg Fall 2008 Locally convex spaces revsed September 6, 2008 Ths secton establshes the fundamental propertes of locally convex spaces. Acknowledgment: although I wrote these
More information