Introduction to Arithmetic Geometry Fall 2013 Lecture #25 12/05/2013

Size: px
Start display at page:

Download "Introduction to Arithmetic Geometry Fall 2013 Lecture #25 12/05/2013"

Transcription

1 Introducton to Arthmetc Geometry Fall 2013 Lecture #25 12/05/ Overvew of Mordell s theorem In the last lecture we proved that the torson subgroup of the ratonal ponts on an ellptc curve E/Q s fnte. In ths lecture we wll prove a specal case of Mordell s theorem, whch states that E(Q) s fntely generated. By the structure theorem for fntely generated abelan groups, ths mples E(Q) Z r T, where Z r s a free abelan group of rank r, and T s the (necessarly fnte) torson subgroup. 1 Thus Mordell s theorem provdes an alternatve proof that T s fnte, but unlke our earler proof, t does not provde an explct method for computng T. Indeed, Mordell s theorem s notably neffectve; t does not gve us a way to compute a set of generators for E(Q), or even to determne the rank r. It s a major open queston as to whether there exsts an algorthm to compute r; t s also not known whether r can be unformly bounded. 2 Mordell s theorem was generalzed to number felds (fnte extensons of Q) and to abelan varetes (recall that ellptc curves are abelan varetes of dmenson one) by André Wel and s often called the Mordell-Wel theorem. All known proofs of Mordell s theorem (and ts generalzatons) essentally amount to two provng two thngs: (a) E(Q)/2E(Q) s a fnte group. (b) For any fxed Q E(Q), the heght of 2P + Q s greater than the heght of P for all but fntely many P. We note that there s nothng specal about 2 here, any nteger n > 1 works. We wll explan what (b) means n a moment, but let us frst note that we really do need some sort of (b); t s not enough to just prove (a). To see why, consder the addtve abelan group Q. the quotent Q/2Q s certanly fnte (t s the trval group), but Q s not fntely generated. To see ths, note that for any fnte S Q, we can pck a prme p such that under the canoncal embeddng Q Q p we have S Z p, and therefore S Z p, but we never have Q Z p. The heght of a projectve pont P = (x : y : z) wth x, y, z Z sharng no common factor s defned as H(P ) := ( x, y, z ), where s the usual archmedean absolute value on Q. The heght H(P ) s a postve nteger that s ndependent of the representaton of the representaton of P, and for any bound B, the set {P E(Q) : H(P ) B} s fnte, snce t cannot possbly have more than (2B + 1) 3 elements. We wll actually use a slghtly more precse noton of heght, the canoncal heght, whch we wll defne later. Now let us suppose that we have proved (a) and (b), and see why ths mples that E(Q) s fntely generated. Snce E(Q)/2E(Q) s fnte, for any suffcently large B the fnte set S = {P E(Q) : H(P ) B} must contan a set of representatves for E(Q)/2E(Q), and 1 Any fntely generated abelan torson group must be fnte; ths does not hold for nonabelan groups. 2 Most number theorsts thnk not, but there are some notable dssenters. Andrew V. Sutherland

2 we can pck B so that (b) holds for all Q S and P S. If S does not generate E(Q), then there s a pont P 0 E(Q) S of mnmal heght H(P 0 ). Snce S contans a set of representatves for E(Q)/2E(Q), we can wrte P 0 n the form P 0 = 2P + Q, for some Q S and P E(Q). Snce P 0 S, we must have P S, but (b) mples H(P ) < H(P 0 ), contradctng the mnmalty of H(P 0 ). So the set E(Q) S must be empty and S s a fnte set of generators for E(Q). We should note that ths argument does not yeld an algorthm to compute S because we do not have an effectve bound on B (we know B exsts, but not how bg t s) Ellptc curves wth a ratonal pont of order 2 In order to smplfy the presentaton, we wll restrct our attenton to ellptc curves E/Q that have a ratonal pont of order 2 (to prove the general case one can work over a cubc extenson of Q for whch ths s true). In short Weerstrass form any pont of order 2 s an affne pont of the form (x 0, 0). After replacng x wth x + x 0 we obtan an equaton for E of the form E : y 2 = x(x 2 + ax + b), on whch P = (0, 0) s a pont of order two. Snce E s not sngular, the cubc on the RHS has no repeated roots, whch mples b 0, a 2 4b 0. The algebrac equatons for the group law on curves of ths form are slghtly dfferent than for curves n short Weerstrass form; the formula for the nverse of a pont s the same, we smply negate the y-coordnate, but the formulas for addton and doublng are slghtly dfferent. To add two affne ponts P 1 = (x 1, y 1 ) and P 2 = (x 2, y 2 ) wth x 1 x 2, as n Lecture 23 we consder the lne L through P 1 and P 2 wth equaton L: (y y 1 ) = λ(x x 1 ), where λ = (y 2 y 1 )/(x 2 x 1 ). Solvng for y and pluggng nto equaton for E, we have λ 2 x 2 = x(x 2 + ax + b) 0 = x 3 + (a λ 2 )x 2 + The x-coordnate x 3 of the thrd pont n the ntersecton L E s a root of the cubc on the RHS, as are x 1 and x 2, and the sum x 1 + x 2 + x 3 must be equal to the negaton of the quadratc coeffcent. Thus x 3 = λ 2 a x 1 x 2, y 3 = λ(x 1 x 3 ) y 1, where we computed y 3 by pluggng x 3 nto the equaton for L and negatng the result. The doublng formula for P 1 = P 2 s the same, except now λ = (3x 2 + 2ax + b)/(2y).

3 sogenes In order to prove that E(Q)/2E(Q) s fnte, we need to understand the mage of the multplcaton-by-2 map [2]. We could use the doublng formula derved above to do ths, but t turns out to be smpler to decompose [2] as a composton of two sogenes [2] = ˆϕ ϕ, where ϕ: E E and ˆϕ: E E for some ellptc curve E that we wll determne. The kernel of ϕ wll be {O, P }, where P = (0, 0) s our ratonal pont of order 2. Smlarly, the kernel of ˆϕ wll be {O, P }, where O s the dstngushed pont on E and P s a ratonal pont of order 2 on E. Recall from Lecture 24 that for any sogeny ϕ: E E we have an njectve map ker ϕ Aut(Q(E)/ϕ (Q(E ))) defned by P τp, where τ P s the translaton-by-p morphsm. In our present stuaton there s only one non-trval pont n the kernel of ϕ, the pont P = (0, 0), and t s ratonal, so we can work over Q. We can determne both E and the morphsm ϕ by computng ϕ (Q(E )) as the fxed feld of the automorphsm τp : Q(E) Q(E). Remark Ths strategy apples n general to any separable sogeny wth a cyclc kernel (a cyclc sogeny), all we need s a pont P that generates the kernel. For an affne pont Q = (x, y) not equal to P = (0, 0) the x-coordnate of τ P (Q) = P +Q s λ 2 a x, where λ = y/x s the slope of lne throught P and Q. Usng the curve equaton for E, we can smplfy ths to λ 2 a x = y2 ax 2 x 3 x 2 = bx x 2 = b x. The y-coordnate of τ P (Q) s then λ(0 b/x) 0 = by/x 2. Thus for Q {O, P } the map τ P s gven by (x, y) (b/x, by/x 2 ). To compute the fxed feld of τp, note that f we regard the slope λ = y/x as a functon n Q(E), then composton wth τ P merely changes ts sgn. Thus ( ) by/x τp (λ ( ) y 2 ) = = = λ 2. b/x x We also note that the pont Q + τ P (Q) s fxed by τ P, hence the sum of the y-coordnates of Q and τ P (Q) s fxed by τ P (when represented as affne ponts (x : y : 1)). Thus ( x τp (y by/x 2 ) = τp 2 ) y by x 2 = (b/x)2 ( by/x 2 ) b( by/x 2 ) (b/x) 2 = y by/x 2. Note that λ 2 = y 2 /x 2 = x(x 2 + ax + b)/x 2 = x + a + b/x, so let us defne X = x + a + b/x and Y = y(1 b/x 2 ) Then Q(X, Y ) s a subfeld of E(Q) = Q(x, y) fxed by τ P, hence a subfeld of ϕ (Q(E )), and we clam that t s a subfeld of ndex 2. To see ths, note that x = (X + Y X a)/2 and y = x X,

4 thus [Q(E) : Q(X, Y )] 2 and [Q(E) : Q(X, Y )] 1 because Q(E) contans x/y = X and Q(X, Y ) does not. We also know that [Q(E) : ϕ (Q(E ))] 2, snce ker ϕ Q(E) has order 2 and njects nto Aut(Q(E)/ϕ (Q(E))), therefore ϕ (Q(E )) = Q(X, Y ). Snce ϕ s a feld embeddng, we have Q(E ) Q(X, Y ). We now know the functon feld of E ; to compute an equaton for E we just need a relaton between X and Y. Y 2 = y 2 (1 b/x 2 ) 2 = x(x 2 + ax + b)(1 2b/x 2 b 2 /x 4 ) = X(x 2 2b + b 2 /x 2 ) = X ( (x + b/x) 2 4b ) = X ( (X a) 2 4b ) = X(X 2 2aX + a 2 4b). Let us now defne A = 2a and B = a 2 4b. Then the equaton Y 2 = X(X 2 + AX + B) has the same form as that of E, and snce B = a 2 4b 0 and A 2 4B = 16b 0, t defnes an ellptc curve E wth dstngushed pont O = (0 : 1 : 0), and the affne pont P = (0, 0) has order 2. The 2-sogeny ϕ: E E sends O to O and each affne pont (x, y) on E to (X, Y ) = (x + a + b/x, y(1 b/x 2 )) on E. Snce E has the same form has E, we can repeat the process above to compute the 2-sogeny ˆϕ: E E that sends O to O and (X, Y ) to (X + A + B/X, Y (1 B/X 2 )). One can then verfy that [2] = ˆϕ ϕ, by composng ˆϕ and ϕ and comparng the result to the doublng formula on E. But we can see ths more drectly by notng that ker( ˆϕ ϕ) = E[2] and deg( ˆϕ ϕ) = deg ˆϕ deg ϕ = 2 2 = 4 = #E[2] = # ker( ˆϕ ϕ). Thus the njectve homomorphsm E[2] Aut(Q(E)/( ˆϕ ϕ) (Q(E))) s an somorphsm, and the same holds for Aut(Q(E)/[2] Q(E)). Snce we are n characterstc zero, both extensons are separable, and t follows from Galos theory that there s a unque subfeld of Q(E) fxed by the automorphsm group {τp : P E[2]}. Thus the functon feld embeddngs ( ˆϕ ϕ) and [2] are equal, and the correspondng morphsms must be equal (by the functoral equvalence of smooth projectve curves and ther functon felds). Remark The constructon and argument above apples qute generally. Gven any fnte subgroup H of E( k) there s a unque ellptc curve E and separable sogeny E E wth H as ts kernel; see [2, Prop. III.4.12] The weak Mordell-Wel theorem We are now ready to prove that E(Q)/2E(Q) s fnte (n the case that E(Q) has a ratonal pont of order 2). Ths s a specal case of what s known as the weak Mordell-Wel theorem, whch says that E(k)/nE(k) s fnte, for any postve nteger n and any number feld k. Our strategy s to prove that E(Q)/ϕ(E(Q)) s fnte, where ϕ: E E s the 2-sogeny from the prevous secton. Ths wll also show that E (Q)/ ˆϕ(E(Q)) s fnte, and t wll follow that E/2E(Q) s fnte. We begn by characterzng the mage of ϕ n E (Q).

5 Lemma An affne pont (X, Y ) E (Q) les n the mage of ϕ f and only f ether X Q 2, or X = 0 and a 2 4b Q 2. Proof. Suppose (X, Y ) = ϕ(x, y). T If X 0 then X = (y/x) 2 Q 2. If X = 0 then x(x 2 +ax+b) = 0, and x 0 (snce ϕ(0, 0) = O ), so x 2 +ax+b = 0 has a ratonal soluton, whch mples a 2 4b Q 2. Conversely, f X Q 2 then x = (X + Y X a)/2 and y = x X gves a pont (x, y) E(Q) for whch ϕ(x, y) = (X, Y ), and f X = 0 and a 2 4b Q 2, then x 2 + ax + b has a nonzero ratonal root x for whch ϕ(x, 0) = (0, 0) = (X, Y ). Now let us defne the map π : E (Q) Q /Q 2 by { X f X 0, (X, Y ) a 2 4b f X = 0, and let π(o ) = 1. Lemma The map π : E (Q) Q /Q 2 s a group homomorphsm. Proof. By defnton, π(o ) = 1, so π preserves the dentty element and behaves correctly on sums nvolvng O. and snce π(p ) = π( P ) and the square classes of X and 1/X are the same, π preserves nverses. We just need to verfy π(p + Q) = π(p )π(q) for affne ponts P, Q that are not nverses. So let P and Q be affne ponts whose sum s an affne pont R, let Y = lx + m be the lne L contanng P and Q (the lne L s not vertcal because P + Q = R O ). Pluggng the equaton for Y gven by L nto the equaton for E gves (lx + m) 2 = X(X 2 + AX + B) 0 = X 3 + (A l 2 )x 2 + (B lm)x m 2. The X-coordnates X 1, X 2, X 3 of P, Q, R are all roots of the cubc on the RHS, hence ther product s equal to m 2, the negaton of the constant term. Thus X 1 X 2 X 3 s a square, whch means that π(p )π(q)π(p + Q) = 1, and therefore π(p )π(q) = 1/π(P + Q) = π(p + Q), snce π(p + Q) and 1/π(P + Q) are n the same square-class of Q. Lemma The mage of π : E (Q) Q /Q 2 s fnte. Proof. Let (X, Y ) be an affne pont n E (Q) wth X 0, and let r Z be a square-free nteger representatve of the square-class π(x, Y ). We wll show that r must dvde B, whch clearly mples that m π s fnte. The equaton Y 2 = X(X + ax + B) for E mples that X and X + ax + B le n the same square-class, thus X 2 + AX + B = rs 2 X = rt 2, for some s, t Q. Let us wrte t = l/m wth l, m Z relatvely prme. Pluggng X = rt 2 nto the frst equaton gves r 2 t 4 + Art 2 + B = rs 2 r 2 l 4 /m 4 + Arl 2 /m 2 + B = rs 2 r 2 l 4 + Arl 2 m 2 + Bm 4 = rm 4 s 2,

6 and snce the LHS s an nteger, so s the RHS. Let p be any prme dvdng r. Then p must dvde Bm 4, snce t dvdes every other term. If p dvdes m then p 3 must dvde r 2 l 4, snce t dvdes every other term, but then p dvdes l, snce r s squarefree, whch s mpossble because l and m are relatvely prme. So p does not dvde m and therefore must dvde B. Ths holds for every prme dvsor of the squarefree nteger r, so r dvdes B as clamed. Corollary E (Q)/ϕ(E(Q)) and E(Q)/ ˆϕ(E(Q)) are fnte. Proof. Lemma 25.3 mples that ker π = ϕ(e(q)), thus E (Q)/ϕ(E(Q)) m π s fnte, and ths remans true f we replace E wth E and ϕ wth ˆϕ. Corollary E(Q)/2E(Q) s fnte. Proof. The fact that [2] = ˆϕ ϕ mples that each ˆϕ(E (Q))-coset n E(Q) can be parttoned nto 2E(Q)-cosets. Two ponts P and Q n the same ˆϕ(E (Q))-coset le n the same 2E(Q)- coset f and only f (P Q) 2E(Q) = ( ˆϕ ϕ)(e(q)), equvalently, ˆϕ 1 (P Q) ϕ(e(q). Thus the number of 2E(Q)-cosets n each ˆϕ(E (Q))-coset s precsely E (Q)/ϕ(E(Q)), thus s fnte. #E(Q)/2E(Q) = #E(Q)/ ˆϕ(E (Q)) #E (Q)/ϕ(E(Q)) Remark The only place n our work above where we really used the fact that we are workng over Q, as opposed to a general number feld, s n the proof of Lemma Specfcally, we used the fact that the rng of ntegers Z of Q s a UFD, and that ts unt group Z s fnte. Nether s true of the rng of ntegers O k of a number feld k, n general, but there are analogous facts that one can use; specfcally, O k s a Dedeknd doman, hence deals can be unque factored nto prme deals, the class number of O k s fnte, and O k s fntely generated. We also assumed that E has a ratonal pont of order 2, but after a base extenson to a number feld we can assume ths wthout loss of generalty Heght functons Let k be any number feld. Recall from Lecture 6 that (up to equvalence) the absolute values of k consst of non-archmedean absolute values, one for each prme deal p of the rng of ntegers O k (these are the fnte places of k), and archmedean absolute values, one for each embeddng of k nto R and one for each conjugate par of embeddngs of k nto C (these are the nfnte places of k). Let P k denote the set of (fnte and nfnte) places of k. For each place p P k we want to normalze the assocated absolute value p so that (a) The product formula x p = 1 holds for all x k. (b) For any number feld k k and any place p of k we have q p x q = x p, where q p means that the restrcton of q to k s equvalent to p. Both requrements are satsfed by usng the standard normalzaton for Q, wth x p = p vp(x) for p < and x = x, and then for each q P k wth q p defnng x q = N kq/q p (x) 1/[k:Q] p,

7 where k q and Q p denote the completons of k at q and Q at p, respectvely. 3 Defnton The (absolute) heght of a projectve pont P = (x 0 : : x n ) P n (Q) s H(P ) := x p, where k = Q(x 0,..., x n ). For any λ Q, f we let k = Q(x 0,..., x n λ), then λx p = ( λ p x p ) = λ p p x = thus H(P ) s well defned (t does not depend on a partcular choce of x 0,..., x n ). For k = Q we can wrte P = (x 0 : : x n ) wth the x Z havng no common factor. Then x p = 1 for p < and H(P ) = x ; ths agrees wth the defnton we gave earler. Lemma For all P = (x 0 : : x n ) P n (Q) we have H(P ) 1. Proof. Pck a nonzero x j and let k = Q(x 0,..., x n ). Then H(P ) = x p x j p = 1. Defnton The logarthmc heght of P P n (Q) s the nonnegatve real number h(p ) := log H(P ). We now consder how the heght of a pont changes when we apply a morphsm to t. We wll show that there for any fxed morphsm φ: P m P n there are constants c and d (dependng on φ) such that for any pont P P m (Q) we have Ths can be wrtten more succnctly wrte as dh(p ) c h(φ(p )) dh(p ) + c. h(φ(p )) = dh(p ) + O(1), where the O(1) term ndcates a bounded real functon of P (the functon h(φ(p )) dh(p )). We frst prove the upper bound; ths s easy. Lemma Let k be a number feld and let φ: P n P m be a morphsm (φ 0 : : φ n ) defned by homogeneous polynomals φ k[x 0,..., x n ] of degree d. There s a constant c such that h(φ(p )) dh(p ) + c for all P P n ( k). 3 The correctness of ths defnton reles on some standard results from algebrac number theory that we wll not prove here; the detals are not mportant, all we need to know s that a normalzaton satsfyng both (a) and (b) exsts, see [1, p. 9] or [2, pp ] for a more detaled exposton. x,

8 Proof. Let c = N p j c j p, where c j ranges over coeffcents that appear n any φ, and N bounds the number of monomals appearng n any φ. If P = (a 0 :... : a n ) and k = Q(a 0,..., a n ), then H(φ(P )) = φ (P ) p,j c j a d p = ch(p ) d, by the multplcatvty of p and the trangle nequalty. The lemma follows. We now make a few remarks about the morphsm φ: P n P m appearng n the lemma. Morphsms wth doman P n are tghtly constraned, more so than projectve morphsms n general, because the deal of P n ( as a varety), s trval; ths means that the polynomals defnng φ are essentally unque up to scalng. Ths has several consequences. The polynomals φ defnng φ cannot have a common zero n P n ( k); otherwse there would be a pont at whch φ s not defned. Ths requrement s not explctly stated because t s mpled by the defnton of a morphsm as a regular map. The mage of φ n P m s ether a pont (n whch case d = 0), or a subvarety of dmenson n; f ths were not the case then the polynomals defnng φ would have a common zero n P n ( k). The fact that m φ s a varety follows from the fact that projectve varetes are complete (so every morphsm s a closed map). In partcular, f φ s non-constant then we must have m n. If φ s non-constant, then d = [k(p n ) : φ (k(m φ))] s equal to the degree of the φ. In partcular, f d = 1 then φ s a bjecton from P n to ts mage. Note that ths agrees wth out defnton of the degree of a morphsm of curves. Corollary It φ s any automorphsm of P n, then h(φ(p )) = h(p ) + O(1). (1) Proof. We must have d = 1, and we can apply Lemma to φ 1 as well. The corollary acheves our goal n the case d = 1 and m = n. If d = 1 and m > n, after applyng a sutable automorphsm to P m we can assume that m φ s the lnear subvarety of P m defned by x n+1 = x n+2 = = x m+1 = 0, and t s clear that the orthogonal projecton (x 0 : : x m ) (x 0 : : x n ) does not change the heght of any pont n ths subvarety. It follows that (2) holds whenever d = 1, whether m = n or not. We now prove the general case Theorem Let k be a number feld and let φ: P n P m be a morphsm (φ 0 : : φ n ) defned by homogeneous polynomals φ k[x 0,..., x n ] of degree d. Then h(φ(p )) = dh(p ) + O(1). (2) Proof. If d = 0 then φ s constant and the theorem holds trvally, so we assume d > 0. We wll decompose φ as the composton of four morphsms: a morphsm ψ : P n P N, an automorphsm of P N, an orthogonal projecton P N P n P m, and an automorphsm of P m. All but the morphsm ψ change the logarthmc heght of a pont P by at most an addtve constant that does not depend on P, and we wll show that h(ψ(p )) = dh(p ).

9 The map ψ = (ψ 0 : : ψ N ) s defned as follows. We let N = ( ) n+d d 1, and take ψ 0,..., ψ N to be the dstnct monomals of degree d n the varables x 0,..., x n, n some order. Clearly the ψ N have no common zero n P n (Q), so ψ defnes a morphsm P n P N. Let P = (a 0 : : a n ) be any pont n P n, and let k = Q(a 0,..., a n ). For each p P k, and t follows that ψ (P ) p = j H(ψ(P )) = a d j p = j ψ (P ) p = a j d p = ( a j p ) d, j ( j a j p ) d = H(P ) d. Thus h(ψ(p )) = dh(p ) as clamed. We now note that each φ s a lnear combnaton of the ψ j, thus φ nduces an automorphsm ˆφ: P N P N, and after applyng a second automorphsm of P N we may assume that the mage of ˆφ ψ n P N s the varety defned by x n+1 = = x N = 0. Takng the orthogonal projecton from P N to P n embedded n P m as the locus of x n+1 = = x m = 0 does not change the heght of any pont, and we may then apply an automorphsm of P m to map ths embedded copy of P n to m φ. Remark For an alternatve proof of Theorem usng the Nullstellensatz, see [2, VIII.5.6]. Lemma Let k/q be a fnte Galos extenson. Then h(p σ ) = h(p ) for all P P n (k) and σ Gal(k/Q). Proof. The acton of σ permutes P k, so f P = (x 0 : : x n ) wth x k, then H(P σ ) = x σ p = x σ p σ = x p = x p = H(P ). p σ P k p σ P k Remark Lemma also holds for k = Q. Theorem (Northcott). For any postve ntegers B, d, and n, the set s fnte. {P P n (k) : h(p ) B and [k : Q] d} Proof. Let P = (x 0 : : x n ) P n (k) wth [k : Q] d. We can vew each x as a pont P = (x : 1) n P 1 (k), and we have H(P ) = x p ( x p, 1) = H(P ). p P Thus t suffces to consder the case n = 1, and we may assume P = (x : 1) and k = Q(x). Wthout loss of generalty we may replace k by ts Galos closure, so let k/q be Galos wth Gal(k/Q) = {σ 1,... σ d }. The pont Q = (x σ 1 : : x σ d) P d 1 (k) s fxed by Gal(k/Q), hence by Gal(Q/Q), so Q P d 1 (Q). By Lemma 25.16, h(q) = h(p ), so we have reduced to the case k = Q, and by the argument above we can also assume n = 1. The set {P P 1 (Q) : h(p ) B} s clearly fnte; each P can be represented as a par of relatvely prme ntegers of whch only fntely many have absolute value at most e B.

10 25.6 Canoncal heght functons on ellptc curves Theorem (Tate). Let S be a set and let r > 1 a real number. Let φ: X X and h: X R be functons such that h φ = rh + O(1), and let 1 ĥ φ (x) := lm n r n h(φn (x)). Then ĥφ s the unque functon S R for whch () ĥφ = h + O(1); () ĥφ φ = rĥφ. Proof. Choose c so that 1 r h(φ(x)) h(x) c r for all x S. For all n > 1 we have 1 r n h(φn (x)) 1 r n 1 h(φn 1 (x)) = 1 1 r n 1 r h(φ(φn 1 (x)) h(φ n 1 (x)) c r n 1, thus for all x S the sequence 1 r h(φ n (x)) converges, so n ĥφ s well defned. For all x S we have ĥφ(x) h(x) 1 r n h(φn (x)) 1 r n 1 h(φn 1 (x)) n=1 n=1 c r n = c r 1, so () holds. Property () s clear, and for unqueness we note that f f = h + O(1) and f φ = rf then applyng the constructon above wth h replaced by f yelds ˆf φ = ĥφ, but t s also clear that ˆf φ = f, so f = ĥφ. We now want to apply Theorem to the set S = E(Q) wth φ = [2] the multplcatonby-2 map and r = 4, It mght seem natural to let h be the heght functon on the projectve plane P 2 contanng our ellptc curve E, but as E s a one-dmensonal varety, t s better to work wth P 1, so we wll use the mage of E under the projecton P 2 P 1 defned by (x : y : z) (x : z). To understand how [2] operates on π(e), we recall the formula to double an affne pont P = (x 1 : y 1 : 1) wth y 1 0 computes the x-coordnate of 2P = (x 3 : y 3 : 1) va x 3 = λ 2 2x 1, wth ( ) 3x λ = 1 + a 4 = 9x a 4x a2 4 2y 1 4y 2 = 9x a 4x a2 4 4x a, 4x 1 + 4a 6 where we have used the curve equaton y 2 = x 3 +a 4 x+a 6 to get a formula that only depends on x 1. We then have x 3 = 9x a 4x a2 4 4x a 4x 1 + a 6 2x 1 = x a 4x 2 1 8a 6x 1 + a 2 4 4x a 4x 1 + a 6. Puttng ths n projectve form, we now defne the map φ: P 1 P 1 by φ(x : z) = (x 4 + 2a 4 x 2 z 2 8a 6 xz 3 + a 2 4z 4 : 4x 3 z + 4a 4 xz 3 + a 6 z 4 ). The fact that 4a a2 6 0 ensures that the polynomals defnng φ have no common zero n P 1 (Q), thus φ: P 1 P 1 s a morphsm of degree 4, and Theorem mples that h(φ(p )) = 4h(P ) + O(1).

11 Defnton Let E be an ellptc curve over a number feld k. The canoncal heght ĥ: E( k) R s the functon ĥ = ĥφ π, where ĥφ s the functon gven by Theorem 25.19, wth φ: P 1 P 1 as above and h the absolute heght on P 1. It satsfes ĥ(2p ) = 4ĥ(P ) for all P E(Q). Theorem Let E be an ellptc curve over a number feld k. For any bound B the set {P E(k) : ĥ(p ) B} s fnte. Proof. Ths follows mmedately from Northcott s theorem and Theorem part (). Theorem (Parallelogram Law). Let ĥ be the canoncal heght functon of an ellptc curve E over a number feld k. Then for all P, Q E( k) we have ĥ(p + Q) + ĥ(p Q) = 2ĥ(P ) + 2ĥ(Q) Proof. Ths s a straght-forward but tedous calculaton that we omt; see [2, VIII.6.2] Proof of the Mordell s Theorem Wth all the peces n place we now complete the proof of Mordell s theorem for an ellptc curve E/Q wth a ratonal pont of order 2. Theorem Let E/Q be an ellptc curve wth a ratonal pont of order 2. Then E(Q) s fntely generated. Proof. By the weak Mordell-Wel theorem that we proved n 25.4 for ths case we know that E(Q)/2E(Q) s fnte. So let us choose a bound B such that the set S : = {P E(Q) : ĥ(p ) B} contans a set S 0 of representatves for E(Q)/2E(Q). We clam that S generates E(Q). Suppose for the sake of obtanng a contradcton that ths s not the case. Then there s a pont Q E(Q) S of mnmal heght ĥ(q); the fact that every set of bounded heght s fnte mples that ĥ takes on dscrete values, so such a Q exsts. There s then a pont P S 0 S such that Q = P + 2R for some R E(Q). Snce Q S, we must have R S, so ĥ(r) ĥ(q), by the mnmalty of ĥ(q). By the parallelogram law, 2ĥ(P ) = ĥ(q + P ) + ĥ(q P ) 2ĥ(Q) 0 + ĥ(2r) 2ĥ(Q) = 4ĥ(R) 2ĥ(Q) 2ĥ(Q) So ĥ(q) ĥ(p ) B and therefore Q S, a contradcton. References [1] J-P. Serre, Lectures on the Mordell-Wel theorem, 3rd edton, Sprnger Fachmeden Wesbaden, [2] J. H. Slverman, The arthmetc of ellptc curves, Sprnger, 2009.

where 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

where 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 information

where a is any ideal of R. Lemma Let R be a ring. Then X = Spec R is a topological space. Moreover the open sets

where 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 information

REDUCTION 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. 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 information

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

FACTORIZATION 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 information

Polynomials. 1 More properties of polynomials

Polynomials. 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 information

DIFFERENTIAL FORMS BRIAN OSSERMAN

DIFFERENTIAL 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 information

SL n (F ) Equals its Own Derived Group

SL 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 information

APPENDIX A Some Linear Algebra

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 information

ALGEBRA HW 7 CLAY SHONKWILER

ALGEBRA 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 information

12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product

12 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 information

Affine transformations and convexity

Affine 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 information

FINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN

FINITELY-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 information

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

Linear, 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 information

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

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 information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner 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 information

THERE ARE NO POINTS OF ORDER 11 ON ELLIPTIC CURVES OVER Q.

THERE 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 information

a b a In case b 0, a being divisible by b is the same as to say that

a 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 information

Math 101 Fall 2013 Homework #7 Due Friday, November 15, 2013

Math 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 information

Kuroda s class number relation

Kuroda 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 information

Restricted Lie Algebras. Jared Warner

Restricted 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 information

An Introduction to Morita Theory

An 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 information

LECTURE V. 1. More on the Chinese Remainder Theorem We begin by recalling this theorem, proven in the preceeding lecture.

LECTURE 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 information

The Ramanujan-Nagell Theorem: Understanding the Proof By Spencer De Chenne

The 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 information

ALGEBRA 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. 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 information

Lecture 7: Gluing prevarieties; products

Lecture 7: Gluing prevarieties; products Lecture 7: Glung prevaretes; products 1 The category of algebrac prevaretes Proposton 1. Let (f,ϕ) : (X,O X ) (Y,O Y ) be a morphsm of algebrac prevaretes. If U X and V Y are affne open subvaretes wth

More information

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

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 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 information

28 Finitely Generated Abelian Groups

28 Finitely Generated Abelian Groups 8 Fntely Generated Abelan Groups In ths last paragraph of Chapter, we determne the structure of fntely generated abelan groups A complete classfcaton of such groups s gven Complete classfcaton theorems

More information

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws

Representation 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 information

Example: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,

Example: (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 information

2 More examples with details

2 More examples with details Physcs 129b Lecture 3 Caltech, 01/15/19 2 More examples wth detals 2.3 The permutaton group n = 4 S 4 contans 4! = 24 elements. One s the dentty e. Sx of them are exchange of two objects (, j) ( to j and

More information

1 Matrix representations of canonical matrices

1 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 information

Difference Equations

Difference 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 information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - 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 information

3.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

3.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 information

( 1) i [ d i ]. The claim is that this defines a chain complex. The signs have been inserted into the definition to make this work out.

( 1) i [ d i ]. The claim is that this defines a chain complex. The signs have been inserted into the definition to make this work out. Mon, Apr. 2 We wsh to specfy a homomorphsm @ n : C n ()! C n (). Snce C n () s a free abelan group, the homomorphsm @ n s completely specfed by ts value on each generator, namely each n-smplex. There are

More information

THE CLASS NUMBER THEOREM

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

9 Characteristic classes

9 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 information

The Second Eigenvalue of Planar Graphs

The Second Eigenvalue of Planar Graphs Spectral Graph Theory Lecture 20 The Second Egenvalue of Planar Graphs Danel A. Spelman November 11, 2015 Dsclamer These notes are not necessarly an accurate representaton of what happened n class. The

More information

Spectral Graph Theory and its Applications September 16, Lecture 5

Spectral 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 information

Math 594. Solutions 1

Math 594. Solutions 1 Math 594. Solutons 1 1. Let V and W be fnte-dmensonal vector spaces over a feld F. Let G = GL(V ) and H = GL(W ) be the assocated general lnear groups. Let X denote the vector space Hom F (V, W ) of lnear

More information

MTH 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/ 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 information

On cyclic of Steiner system (v); V=2,3,5,7,11,13

On 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 information

More metrics on cartesian products

More 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 information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.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 information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 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 information

p-adic Galois representations of G E with Char(E) = p > 0 and the ring R

p-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 information

5 The Rational Canonical Form

5 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 information

18.781: Solution to Practice Questions for Final Exam

18.781: Solution to Practice Questions for Final Exam 18.781: Soluton to Practce Questons for Fnal Exam 1. Fnd three solutons n postve ntegers of x 6y = 1 by frst calculatng the contnued fracton expanson of 6. Soluton: We have 1 6=[, ] 6 6+ =[, ] 1 =[,, ]=[,,

More information

Polynomials. 1 What is a polynomial? John Stalker

Polynomials. 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 information

Fixed points of IA-endomorphisms of a free metabelian Lie algebra

Fixed 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 information

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

BOUNDEDNESS 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 information

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

COMPLEX 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

Graph Reconstruction by Permutations

Graph 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 information

CONJUGACY IN THOMPSON S GROUP F. 1. Introduction

CONJUGACY IN THOMPSON S GROUP F. 1. Introduction CONJUGACY IN THOMPSON S GROUP F NICK GILL AND IAN SHORT Abstract. We complete the program begun by Brn and Squer of charactersng conjugacy n Thompson s group F usng the standard acton of F as a group of

More information

= s j Ui U j. i, j, then s F(U) with s Ui F(U) G(U) F(V ) G(V )

= s j Ui U j. i, j, then s F(U) with s Ui F(U) G(U) F(V ) G(V ) 1 Lecture 2 Recap Last tme we talked about presheaves and sheaves. Preshea: F on a topologcal space X, wth groups (resp. rngs, sets, etc.) F(U) or each open set U X, wth restrcton homs ρ UV : F(U) F(V

More information

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there

More information

Descent is a technique which allows construction of a global object from local data.

Descent is a technique which allows construction of a global object from local data. Descent Étale topology Descent s a technque whch allows constructon of a global object from local data. Example 1. Take X = S 1 and Y = S 1. Consder the two-sheeted coverng map φ: X Y z z 2. Ths wraps

More information

Section 8.3 Polar Form of Complex Numbers

Section 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 information

Foundations of Arithmetic

Foundations 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 information

Math 217 Fall 2013 Homework 2 Solutions

Math 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 information

arxiv: v3 [math.co] 20 Dec 2017

arxiv: v3 [math.co] 20 Dec 2017 CONSTRUCTION OF THE LINDSTRÖM VALUATION OF AN ALGEBRAIC EXTENSION arxv:1704.08671v3 [math.co] 20 Dec 2017 DUSTIN CARTWRIGHT Abstract. Recently, Bollen, Drasma, and Pendavngh have ntroduced the Lndström

More information

Week 2. This week, we covered operations on sets and cardinality.

Week 2. This week, we covered operations on sets and cardinality. Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from

More information

Edge Isoperimetric Inequalities

Edge Isoperimetric Inequalities November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary

More information

CALCULUS CLASSROOM CAPSULES

CALCULUS CLASSROOM CAPSULES CALCULUS CLASSROOM CAPSULES SESSION S86 Dr. Sham Alfred Rartan Valley Communty College salfred@rartanval.edu 38th AMATYC Annual Conference Jacksonvlle, Florda November 8-, 202 2 Calculus Classroom Capsules

More information

k(k 1)(k 2)(p 2) 6(p d.

k(k 1)(k 2)(p 2) 6(p d. BLOCK-TRANSITIVE 3-DESIGNS WITH AFFINE AUTOMORPHISM GROUP Greg Gamble Let X = (Z p d where p s an odd prme and d N, and let B X, B = k. Then t was shown by Praeger that the set B = {B g g AGL d (p} s the

More information

= z 20 z n. (k 20) + 4 z k = 4

= z 20 z n. (k 20) + 4 z k = 4 Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5

More information

INTERSECTION THEORY CLASS 13

INTERSECTION THEORY CLASS 13 INTERSECTION THEORY CLASS 13 RAVI VAKIL CONTENTS 1. Where we are: Segre classes of vector bundles, and Segre classes of cones 1 2. The normal cone, and the Segre class of a subvarety 3 3. Segre classes

More information

Character Degrees of Extensions of PSL 2 (q) and SL 2 (q)

Character Degrees of Extensions of PSL 2 (q) and SL 2 (q) Character Degrees of Extensons of PSL (q) and SL (q) Donald L. Whte Department of Mathematcal Scences Kent State Unversty, Kent, Oho 444 E-mal: whte@math.kent.edu July 7, 01 Abstract Denote by S the projectve

More information

Algebraic properties of polynomial iterates

Algebraic properties of polynomial iterates Algebrac propertes of polynomal terates Alna Ostafe Department of Computng Macquare Unversty 1 Motvaton 1. Better and cryptographcally stronger pseudorandom number generators (PRNG) as lnear constructons

More information

HOPF ALGEBRAS WITH TRACE AND CLEBSCH-GORDAN COEFFICIENTS. 1. Recollections and the problem

HOPF 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 information

Canonical transformations

Canonical transformations Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,

More information

New York Journal of Mathematics. Characterization of matrix types of ultramatricial algebras

New York Journal of Mathematics. Characterization of matrix types of ultramatricial algebras New York Journal of Mathematcs New York J. Math. 11 (2005) 21 33. Characterzaton of matrx types of ultramatrcal algebras Gábor Braun Abstract. For any equvalence relaton on postve ntegers such that nk

More information

The Order Relation and Trace Inequalities for. Hermitian Operators

The 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 information

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

8.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 information

Ballot Paths Avoiding Depth Zero Patterns

Ballot 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 information

DIFFERENTIAL SCHEMES

DIFFERENTIAL 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 information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

Lecture Notes Introduction to Cluster Algebra

Lecture 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 information

On functors between module categories for associative algebras and for N-graded vertex algebras

On functors between module categories for associative algebras and for N-graded vertex algebras On functors between module categores for assocatve algebras and for N-graded vertex algebras Y-Zh Huang and Jnwe Yang Abstract We prove that the weak assocatvty for modules for vertex algebras are equvalent

More information

2.3 Nilpotent endomorphisms

2.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 information

P.P. PROPERTIES OF GROUP RINGS. Libo Zan and Jianlong Chen

P.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 information

Solutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010

Solutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010 Solutons to the 7st Wllam Lowell Putnam Mathematcal Competton Saturday, December 4, 2 Kran Kedlaya and Lenny Ng A The largest such k s n+ 2 n 2. For n even, ths value s acheved by the partton {,n},{2,n

More information

BRAUER GROUPS, MONDAY: DIVISION ALGEBRAS

BRAUER GROUPS, MONDAY: DIVISION ALGEBRAS BRAUER GROUPS, MONDAY: DIVISION ALGEBRAS GENE S. KOPP 1. Dvson Algebras A dvson rng s a rng wth 1 n whch every nonzero element s nvertble. Equvalently, the only one-sded deals are the zero deal and the

More information

Problem Solving in Math (Math 43900) Fall 2013

Problem Solving in Math (Math 43900) Fall 2013 Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:

More information

C/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/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 information

Some 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 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 information

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law: CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and

More information

On intransitive graph-restrictive permutation groups

On intransitive graph-restrictive permutation groups J Algebr Comb (2014) 40:179 185 DOI 101007/s10801-013-0482-5 On ntranstve graph-restrctve permutaton groups Pablo Spga Gabrel Verret Receved: 5 December 2012 / Accepted: 5 October 2013 / Publshed onlne:

More information

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Salmon: 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 information

HMMT February 2016 February 20, 2016

HMMT 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 information

SUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION

SUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION talan journal of pure appled mathematcs n. 33 2014 (63 70) 63 SUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION M.R. Farhangdoost Department of Mathematcs College of Scences Shraz Unversty Shraz, 71457-44776

More information

Elliptic Curves Spring 2017 Problem Set #10

Elliptic Curves Spring 2017 Problem Set #10 18.783 Ellptc Curves Sprng 2017 Problem Set #10 Descrpton These problems are related to the materal covered n Lectures 18-20. Instructons: Solve one of Problems 1 3, then fll out the survey problem 4.

More information

The internal structure of natural numbers and one method for the definition of large prime numbers

The internal structure of natural numbers and one method for the definition of large prime numbers The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract

More information

Bernoulli Numbers and Polynomials

Bernoulli Numbers and Polynomials Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that

More information

Math 261 Exercise sheet 2

Math 261 Exercise sheet 2 Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse

More information

REGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction

REGULAR 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 information

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso

Supplement: 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 information

NOTES ON SIMPLIFICATION OF MATRICES

NOTES 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 information

Lecture 5 Decoding Binary BCH Codes

Lecture 5 Decoding Binary BCH Codes Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture

More information

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve

More information