Binary Quadratic Forms over F[T] and Principal Ideal Domains
|
|
- Christal Lloyd
- 6 years ago
- Views:
Transcription
1 Clemson University TigerPrints All Theses Theses Binary Quadratic Forms over F[T] and Principal Ideal Domains Jeff Beyerl Clemson University, Follow this and additional works at: Part of the Applied Mathematics Commons Recommended Citation Beyerl, Jeff, "Binary Quadratic Forms over F[T] and Principal Ideal Domains" (009). All Theses. Paper 574. This Thesis is brought to you for free and open access by the Theses at TigerPrints. It has been accepted for inclusion in All Theses by an authorized administrator of TigerPrints. For more information, please contact
2 Binary Quadratic Forms over and Principal Ideal Domains A Masters Thesis Presented to the Graduate School of Clemson University In Partial Fulfillment of the Requirements for the Degree Masters of Science Mathematics by Jeffrey J. Beyerl May 009 Accepted by: Drs. Kevin James, Hui Xue, Committee Chairs Hiren Maharaj
3 Abstract This paper concerns binary quadratic forms over. It develops theory analogous to the theory of binary quadratic forms over Z. Most although not all of the results are almost identical, while some of the proofs require different techniques. In particular, the form class group is determined when the form takes values in a principal ideal domain, and the ideal class group (and class group isomorphism) is determined when the form takes values in. ii
4 Table of Contents Title Page i Abstract ii 1 Introduction Definitions and Notation Quadratic Forms Preliminaries Introduction Some Lemmas On Quadratic Forms Main Results Introduction The Form Class Group The Polynomial Ring Orders And the Ideal Class Group In The Class Group Isomorphism Conclusions and Discussion Appendices A Proofs of Random Things B Proofs of Some More Random Things C Proofs of Random Things Relating To the Class Group Isomorphism Bibliography Index iii
5 Chapter 1 Introduction Polynomial functions, such as i 1,i,...,i n 0 a i 1,i,...,i n x i1 1 xin n, have been studied since long ago. Quadratic forms are a particular kind of polynomial equation of particular interest. A quadratic form is a polynomial in which the total degree of each term (i 1 +i + +i n above) is two. Quadratic forms have been studied in various dimensions (number of different independent variables) and over various settings (the ring the variables take values from). In particular there is an extensive theory for quadratic forms over Q, Q p as well as over arbitrary fields. Cassels text [1] provides an in depth treatment of forms over Q and Q p. Chapter 15 of [5] also provide a classification of equivalent forms and genera over Z and Z p. O Meara s text [7] provides a treatment of forms over fields, as well as some theory over more general rings. Springer s Online Reference Works [6] gives a short summary of many of the general results. The primary direction for this work is analogous to the material on binary quadratic forms over Z found in []. Many of the theorems hold true over an arbitrary PID or more specifically, although some of the proof methods require more attention. 1
6 Chapter Definitions and Notation.1 Quadratic Forms Let A be any Principal Ideal Domain in which A is a unit. A binary quadratic form, or just form for short, is a function of the form [ f(x, y) ax + bxy + cy x ] a b/ y x : [a, b, c] A[x, y]. b/ c y Above, a will occasionally be referred to as the first coefficient and similarly b and c as the second and third coefficients respectively. f is said to be primitive when a, b, c A : {αa + βb + γc α, β, γ A} A. The discriminant of f is Disc(f) b 4ac. Given a, b, D Disc(f), c is uniquely determined, and so f will occasionally be denoted by f [a, b, ] D. An element m A is said to be represented by f if there exists x, y A such that f(x, y) m. Such m is said to be properly represented by f when we also have x, y A. The set of all primitive forms will be denoted Q( ) : {f f is a primitive form}, and those with a given discriminant Q(D) : {f f is a primitive form, Disc(f) D}. Further, the group GL (A) acts on Q( ) and SL (A) acts on Q(D), the set of all primitive forms of fixed discriminant,
7 (see [A.1]) via the group action with operation denoted by juxtaposition and defined by γf p r q f f(px + qy, rx + sy) s [ ] x y γ T a b/ γ x b/ c y [ ] T p q x y a b/ p r s b/ c r q x. s y We obtain an equivalence relation: f g iff there exist γ GL (A) such that γf g (see [A.]). We say that f is properly equivalent with g if γ SL (A), and write f g, which is also the equivalence relation induced by the subgroup SL (A) acting on Q( ) (see [A.3]). Define Q(D)/ : {[f] Q( )/ Disc(f) D, f is primitive}. Two forms f 1, f with the same discriminant are said to be concordant if they can be written as f 1 [a 1, B, a C] and f [a, B, a 1 C] where a 1, a, B, C A. We also define a binary operation on concordant forms, defined by f g : [a 1 a, B, C], and call it the composition of f and g. 3
8 Chapter 3 Preliminaries 3.1 Introduction In this chapter we lay the technical foundation and present results required for the next chapter. All these results should hold in any principal ideal domain. In fact most will hold true more generally, with the limiting factor being Lemma Some Lemmas On Quadratic Forms Lemma 3..1 With f [a, b, c] Q( ), and p, q, r, s A, then p q f [f(p, r), apq + bqr + r s bps + crs, f(q, s)]. (Regardless of whether or not p q is in GL (A), or SL (A) or not). r s 4
9 Proof: p r q [ ] p r f x y a b/ p q x s q s b/ c r s y [ ] pa + br/ pb/ + rc x y p q x qa + bs/ qb/ + sc r s y [ ] p a + bpr/ + pbr/ + r c pqa + bqr/ + pbs/ + rcs x y x pqa + pbs/ + qbr/ + scr q a + bqs/ + qbs/ + s c y [ ] ap + bpr + cr apq + bqr/ + bps/ + crs x y x apq + bqr/ + bps/ + crs aq + bqs + cs y [ ] f(p, r) b / x y x b / f(q, s) y [f(p, r), apq + bqr + bps + crs, f(q, s)]. Lemma 3.. m A is properly represented by f(x, y) [a, b, c] Q( ) if and only if there exists b, c A such that f [m, b, c ]. That is, f is properly equivalent to a form with m as the first coefficient. Proof: ( ) Suppose f(p, r) m with p, r A. Then there exists q, s A such that ps qr 1. So p r q f [f(p, r), b, f(r, s)] [m, b, c ], s (see [3..1]) so that indeed f [m, b, c ]. ( ) Clearly [m, b, c ] properly represents m. Write γf f(px + qy, rx + sy) [m, b, c ], where γ p q SL (A). Then m f(p 1 + q 0, r 1 + s 0) f(p, r) Now p, r A r s because ps qr 1. Thus f also properly represents m. Lemma 3..3 Equivalent forms represent the same things. Likewise if f g then f and g properly represent the same elements of A. 5
10 Proof: Suppose f and g are equivalent. Then write γf g, γ GL (A). If g represents m via ] ] g(b 1, b ) m, then f represents m via [x y [b 1 b γ, so we have f(x, y ) m. For the second part, suppose f g, and suppose f properly represents m A. Then by Lemma 3.., we know that [m, b, c ] f g for some b, c A. Hence [m, b, c ] g, and so again by Lemma 3.. g properly represents m. The next lemma is tricky. It is necessary for our construction of certain forms later, yet requires a setting in which a, b A not sharing a common factor implies that a, b A. Lemma 3..4 Let M A {0}, and f Q( ). Then there exists r, s A, r, s A such that f(r, s), M A. Proof: We shall find r, s A with r, s A so that f(r, s), M A. Write M i m i j p j k q k where m i, p i, q k are all irreducible, and m i a, p j a, p j c, q k a, q k c, q k b. There are no other possible irreducible divisors, because f is primitive. Setting r j p j and s i m i we are done after a little bit of work (see [A.6]). Lemma 3..5 Fix M A {0}. Let f [a, b, c] Q( ). Then f is properly equivalent to a form [a, b, c ] where a, M A. Proof: Apply 3..4 to obtain a properly represented a with a, M A. Then apply Lemma 3.. to place a as the first coefficient of f. Lemma 3..6 Let D A, M A {0}, C 1, C Q(D)/. Then there is an f 1 [a, b, c] C 1 and f [a, b, c ] C such that a, a A, aa, N A and aa 0. Proof: Let f 1 [a, b, c] C 1 and g [α, β, γ] C. If a 0, replace f by a properly equivalent form with nonzero x coefficient via Lemma 3... Apply Lemma 3..5 to f so that we may assume a, M A. Now apply Lemma 3..5 to g to find g [a, b, c ] g with a, am A. We are now done because a, am A implies a, a A, and both a, M A & a, am A together imply that aa, M A. 6
11 Lemma 3..7 If two forms f 1 [a 1, b, c 1 ], f [a, b, c ] have the same discriminant, a 1 a 0, a 1, a A, and a 1 c, a c 1, then f and g are concordant. Proof: Write c a 1 n 1 and c 1 a n. Then D b 4a 1 a n 1 b 4a 1 a n. Hence a 1 a n 1 a 1 a n and so n 1 n. Define c : n 1 n. Thus we have that f 1 [a 1, b, a c], f [a, b, a 1 c] and so f 1 and f are concordant. We now have enough to prove the next result, which will eventually allow us to define an operation on Q(D)/. Proposition 3..8 Let D A, M A {0}, C 1, C Q(D)/. Then there are f 1 C 1 and f C such that f 1 [a 1, B, a C], f [a, B, a 1 C] where a i, B, C A a 1 a 0, a 1, a A, and a 1 a, M A. That is, there are two concordant forms with a 1, a A and a 1 a, M A. Proof: As in Lemma 3..6, choose f 1 [a, b, c] C 1, f [a, b, c ] C so that a, a A and aa, M A. Choose n, n A so that an a n b b. Then write B : an + b a n + b so B an + b a n + b, and C B D 4aa A (see [A.4]). Then we compute 1 0 f 1 [a, B, a C], and n f [a, B, ac] n 1 (see [A.5]). Denote a 1 a and a a and we are done. Definition 3..9 We shall now define an operation on Q(D)/, represented by juxtaposition, and defined by C 1 C : C where [f g] C with the notation from above. That is, if f 1 C 1, f C are two concordant forms, then [f 1 ][f ] [f 1 f ]. We will prove (4..) that this operation is well defined. 7
12 Chapter 4 Main Results 4.1 Introduction This chapter contains the main results of this paper. In the second section will determine the Form Class Group Q(D)/. That is, the group of proper equivalence classes in Q( ). We prove that it is a group, using a method analogous to that over Z by Flath in chapter 5 of [3]. In the third section we will specialize to and discuss some developments new to the introduction of an independent variable to our coefficients. In the fourth section we discuss orders and define the ideal class group. In the fifth section we show that the two class groups are isomorphic: Q(D)/ I(O)/P (O) in a manner analogous to Cox in section 7 of []. 4. The Form Class Group Lemma 4..1 If f 1, f C Q(D)/ are concordant, then f 1 f f f 1. Proof: This is trivial: Denote f 1 [a 1, b, a c], f [a, b, a 1 c]. Then f 1 f [a 1 a, b, c] [a a 1, b, c] f f 1. Theorem 4.. Composition of classes via concordant forms defined by [a 1, B, a C] [a, B, a 1 C] [a 1 a, B, C] gives a well defined operation on S(D). Proof: Let C 1, C Q(D)/. Then by Proposition 3..8 we may choose two concordant forms f 1 C 1, f C, and define C 1 C [f 1 f ]. To be well defined means precisely that if g 1 C 1, g 8
13 C is another pair of concordant forms, that [g 1 g ] [f 1 f ]. We shall prove this by considering a series of sequentially more general cases. Denote f 1 [a 1, b, a c], f [a, b, a 1 c] and g 1 [a 1, b, a c ], g [a, b, a 1c ]. (We know that f 1 g 1 and f g ). Case 1, f 1 g 1, a 1, a A 1 A : Because f 1 g 1, we know that b b. Let γ SL (A) such that γf g, and write γ r t. Then we know γ T a b/ γ a b/, which gives s u b/ a 1 c b/ a 1c that ta sa 1 c as well as some other useful equalities (see [A.7]). Now because a 1, a A, we know that a 1 t, and thus γ : r t/a 1 SL (A) sa 1 u (see [A.8]). Then we after a little work have that [g 1 g ] [f 1 f ] because g 1 g f 1 f via γ (see [A.9]). Case, b b, a 1, a A : We have f 1 [a 1, b, a c], f [a, b, a 1 c], g 1 [a 1, b, a c ], g [a, b, a 1c ]. Then because the discriminants are equal, we have b 4a 1 a c b 4a 1a c so that a 1 a c a 1a c. Thus a 1 a 1c, a a c, and so by Lemma 3..7 f 1 and g are concordant. Thus we may write f 1 [a 1, b, a c 0 ], and g [a, b, a 1 c 0 ]. Thus by applying case 1 to the two pairs of concordant forms (f 1, f ) and (f 1, g ) we obtain [f 1 f ] [f 1 g ], and similarly [g g 1 ] [g f 1 ] (see [A.10]). Then using the fact that is Abelian (see [4..1]), and case 1 [f 1 f ] [f 1 g ] [g f 1 ] [g g 1 ] [g 1 g ] which finishes case. Case 3, a 1 a, a 1a A : If b b we are done by applying case. Otherwise choose n, n A so that a 1 a n a 1a n b b. Rearranging this, we have B : b + a 1a n b + a 1 a n. Set F 1 : 1 a n f 1 [a 1, B/, a (a 1 a n + bn + c)] f 1, 9
14 F : 1 a 1n f [a, B/, a 1 (a 1 a n + bn + c)] f, G 1 : 1 a n g 1 [a 1, B/, a (a 1a n + b n + c )] g 1, G : 1 a 1n g [a, B/, a 1(a 1a n + b n + c )] g, H 1 : 1 n f 1 f 1 n [a 1 a, b/, c] [a 1 a, B/, a 1 a n + bn + c] f 1 f, and H : 1 n g 1 g 1 n [a 1a, b /, c ] [a 1a, B/, a 1a n + b n + c ] g 1 g where the equalities are proven in (A.11), and the proper equivalence is by construction. We then have that F 1 and F are concordant, and F 1 F H 1 (see [A.1]). Likewise G 1 and G are concordant and G 1 G H. Now because a 1 a, a 1a A, it is certainly true that a 1, a A. Thus we may apply case to F 1, F, G 1, G. In doing so we obtain that F 1 F G 1 G. Thus, [f 1 f ] [H 1 ] [F 1 F ] [G 1 G ] [H ] [g 1 g ] using the fact that H 1 F 1 F and H G 1 G. Case 4, no additional assumptions: Given f 1 [a 1, b, a c], f [a, b, a 1 c] and g 1 [a 1, b, a c ], g [a, b, a 1c ], set M : a 1 a a 1a. Then via Proposition 3..8 Choose α 1, α with α 1, α A 1 A, α 1 α, M A, and concordant forms g 1, g so that f 1 g 1 [α 1, β, α η] f g [α, β, α 1 η] Now by the fact that α 1 α, a 1 a a 1a A, we know both a 1 a, α 1 α A and α 1 α, a 1a A. Hence f 1, f, g 1, g satisfy the premesis for case 3, and so f 1 f g 1 g. 10
15 Likewise g 1, g, g 1, g satisfy the premesis for case 3, and so g 1 g g 1 g. Thus [f 1 f ] [g 1 g ] [g 1 g ]. And therefore to summarize our argument, given any representatives f 1, g 1 C 1 and f, g C with f 1 concordant with f and g 1 concordant with g, we have C 1 C [f 1 ][f ] [g 1 ][g ]. That is, C 1 C is well defined. Lemma 4..3 Composition of forms, and thus multiplication of elements of Q(D)/ is associative. Proof: By associativity in A and well definedness, we need only construct forms f 1 C 1, f C, f 3 C 3 in which we can compose. By Proposition 3..8 choose f 1 [a 1, b 1, a c 1 ] C 1, f [a, b 1, a 1 c 1 ] C. Then by Lemma 3..5 choose f 3 [a 3, b 3, c 3 ] C 3 with a 3, a 1 a A. By the fact that a 3, a 1 a A choose m, n 3 A so that a 1 a m a 3 n 3 b3 b1. We then have that a 1 a m + b1 a 3n 3 + b3. This gives us, labeling n 1 : a m, n : a 1 m, that a 1 n 1 + b 1 a n + b 1 a 3n 3 + b 3 : B. Now we find g 1 C 1, g C, g 3 C 3 by g 1 : 1 n 1 f 1 [a 1, B, δ 1 ], g : 1 n f [a, B, δ ], g 3 : 1 n 3 f 3 [a 3, B, δ 3 ]. for appropriate (albeit messy) δ 1, δ, δ 3 A where the latter equalities are derived in A.15. The result now follows from associativity of A and the well definedness of (for more detail, see 11
16 A.16). Lemma 4..4 [f 0 ] Q(D)/ is an identity element, where f 0 [1, 0, D 4 ]. Proof: Let f [a, b, c] C Q(D)/. Then f 0 1 b/ f 0 [1, b, ac] (see [A.13]). Denote f 0 : [1, b, ac], and we have that f 0 f [a, b, c] f, so that indeed [f 0 ]C C. Lemma 4..5 Inverses exist in Q(D)/. Proof: Let [a, b, c] C such that ac 0 (there always exist such forms, see A.14). Then [c, b, a] and [a, b, c] are concordant. Further, [c, b, a] / C because [a, b, c] [c, b, a], but GL (A) SL (A). Thus denote C 1 as the class with [c, b, a] C 1. Then we know that f 0 [1, b, ac], and that [a, b, c], [c, b, a] are concordant. Hence [a, b, c] [c, b, a] [ac, b, 1] [1, b, ac] f 0 and we are done. Theorem 4..6 Q(D)/ is an Abelian group. Proof: Multiplication of classes is well defined by 4... The previous lemmas give us that that multiplication is associative, that there is an identity, and that each element has an inverse. Thus indeed Q(D)/ is a group. It is Abelian by
17 4.3 The Polynomial Ring We will now specialize to the polynomial ring, although several results here should hold true in any specialization in which the induced (from being an Euclidean Domain) size function is discrete. A form [a, b, c] will be called nearly reduced when deg(b ) < deg(a ) deg(c ) (note that we will use the convention that deg(0). The following lemma guarantees the existence of nearly reduced forms in each class C Q(D)/. Lemma Denote f [a, b, c] Q( ). Then f f [a, b, c ] where deg(b ) < deg(a ) deg(c ). Proof: If b 0 and deg(a) > deg(c), then take f f. Note that we cannot have two 1 0 of a, b, c zero lest fnot be primitive unless if one of a, b, c is a unit and the other two are zero. In this case however, 1 1 f has two nonzero entries (see [B.1]). If a 0 or c 0, without loss of generality a 0, then f 1 f 3 1 f 3 f, at least one of which has nonzero entries (see [B.]). So we have reduced the simple cases to the case that b 0. Then if deg(a) > b and deg(c) > b, then we are done with f f or f f. If deg(a) deg(b), then write 1 0 b qa + r where q, r. Then choose m : q/, so that for γ : 1 m, we have that f γf [a, b, c ] has deg(b ) < deg(a) (see [B.4]). Note that a a so that a 0. If c 0, use the above to reduce the form to a form with all nonzero coefficients. (Note thatthis does not increase the minimum degree of the nonzero coefficients). If deg(c) < deg(a), apply. Otherwise 1 0 repeat this process at most min(deg(a), deg(b), deg(c)) + 1 times until deg(b) is less than both deg(a) and deg(c). Note that in the case that deg(a) 0, this will yield a form with b 0. Note that the quantity min(deg(a), deg(b), deg(c)) comes from the fact that we reduce the degree of b each iteration, and min(deg(a), deg(c)) does not increase. Proposition 4.3. Denote f [a, b, c]. Let D be the discriminant of f. If deg(d) 0, then f [a, 0, c ] where deg(a ) deg(c ) 0. 13
18 Proof: Reduce f to f [a, b, c ] so that deg(b ) < deg(a ) deg(c ) by Then 0 deg(d) deg(b 4a c ) deg(a c ) deg(a ) + deg(c ). Thus deg(a ) deg(c ) 0. So we must have b 0, because only 0 has degree less than 0. Theorem Q(D)/ is a finite Abelian group. Proof: Let C Q(D)/, and choose f C to be a nearly reduced form. Then D b 4ac. However, deg(b ) < deg(4ac) because f is reduced, so deg(d) deg(ac). Hence deg(c) is bounded by deg(c) deg(d), and so deg(a), deg(b), deg(c) deg(d). Hence for a not very sharp upper bound, Q(D)/ F 3 deg(d). The Abelian group part was proven in
19 4.4 Orders And the Ideal Class Group In We will continue to specialize to, whose field of fractions is F(T ). Let D be an irreducible polynomial. Denote d : D. The field of fractions of [d] is F(T )(d) F(T )[d]. We then know that the integral closure of in F(T )[d] is O K [d] d (see [8]). For clarity s sake we shall avoid using anything for K other than F(T )[d], although we shall still use the notation O K instead of O. Note that we will use d or F(T )[d] D depending on which seems more appropriate for intuition purposes at the time interchangeably. Definition A subring {1} O F(T )[d] is said to be an order in F(T )[d] when O is a finitely generated -module, and contains a basis of F(T )[d] as a F(T )-vector space. Lemma 4.4. Let O be an order in F(T )[d]. Then O is of rank as a module. Proof: O is has no torsion because F(T )[d] has no zero divisors. By the structure theorem of modules over principal ideal domains it is free. It is of rank at least two because it contains a basis for F(T )[d] as an F(T ) vector space. To show that it is of rank less than 3, Let g 1, g, g 3 O F(T )[d]. We know that F(T )[d] is of rank as an F(T ) vector space, so that there are a 1, a, a 3 F(T ) not all zero so that a 1 g 1 + a g + a 3 g 3 0. Then clearing denominators we get a 1g 1 + a g + a 3g 3 0 where a 1, a, a 3 and not all are zero. Thus g 1, g, g 3 are dependent over as well. Therefore O is of rank less than 3, and thus exactly. Lemma Let a ring R with unity be a finitely generated -submodule of F(T )[d]. Then R F(T ). Proof: Let p q R F(T ), p, q. Each element of R F(T ) may be represented as this, with p and q having no common factors. Indeed assume that p and q have no common factors. 15
20 Then we have i1 p n q n R F(T ). Now R is a free module and finitely generated. Thus any submodule is also finitely generated. In particular i1 deg(q) 0. p n q n is which implies Thus we have that R F(T ). Further, R because 1 R, and R is a module. Trivially F(T ) Therefore we have our result R F(T ). Lemma Let O be an order in F(T )[d]. Then O O K. Proof: Write O g 1, g by Thus we may write 1 pg 1 + qg where p, q. Write p, q g by the fact that is a principle ideal domain. Then g 1 p g g 1 + q g g O F(T ). Hence g F by Lemma Thus without loss of generality we may choose p, q so that g 1. Then we may choose r, s, F [T ] so that ps qr 1. Hence p q SL (), r s and so we may choose λ : rg 1 + sg so that 1, λ O. Now O is a ring, and so λ O because λ O. Thus there are some a 0, a 1 such that λ a 0 a 1 λ. Hence λ + a 1 λ + a 0 0, and so λ is integral over. Hence O is contained in the integral closure of, that is, O O K. Lemma Let O be a subring 1 O F(T )[d] of rank as an -submodule. Then O is an order and can be written as 1, fd for some f. Proof: As in the proof of Lemma we know that O 1, b where b O O K. Write b a + fd where a, f. Then we have O 1, b 1, fd. Then because fd is F(T ) independent of 1, we know that 1, fd F(T ) F(T )[d]. Hence O is an order. Definition Let a be an ideal of O. A fractional ideal of O is a nonzero O-submodule a of F(T )[d] such that there is an a O such that aa O. A fractional ideal a of O is said to be a proper fractional ideal if O {b F(T )[d] ba a}. Note that any nonzero finitely generated O-submodule of F(T )[d] is a fractional ideal (See page 401 in [4]). Proposition If a is a fractional ideal of an order O, then a is an module of rank. Proof: Select a O so that aa O. Then aa γ, λ for some λ, γ O because aa is a -submodule of O K. Then a a 1 aa γ a, λ a 16
21 Lemma Let ax + bx + c [x] be the minimal polynomial for some τ F(T )[d]. Then O : 1, aτ is an order of F(T )[d], and 1, τ is a a proper fractional ideal of O. Proof: First note that 1, aτ 1, b + D 1, D. Then because D we find that 1, aτ is a free module of rank and is closed under multiplication. Hence it is a ring containing 1 and of rank as an module and so is an order by , τ is a fractional ideal because O so that 1, τ is a finitely generated O module: ( 1, τ ) O 1, τ O 1, τ O. Now we shall prove that 1, τ is proper. To do this we must prove that O {b F(T )[d] : b 1, τ 1, τ }. Because 1, τ is an O-module, is trivial. We must prove. Note that β 1, τ 1, τ if and only if both β 1, τ and βτ 1, τ if and only if there are n, m so that β m + nτ and a n. This is because if β m + nτ, then βτ mτ + nτ mτ n bτ+c a cn a + ( bn a + m) τ. Thus βτ 1, τ if and only if both cn a and bn a if and only if a n. ( is trivial, is because with cn a + bn a d we have would n(c + b) da, so that a n). The converse is trivial. Further there are n, m so that β m+nτ and a n if and only if β 1, aτ. This is actually quite easy once one thinks about it. For the forward implication, write β m + n aτ. For the converse write β m + n aτ, and then define n : n a. Hence 1, τ is also proper. The set of all fractional ideals of an order O is a monoid with the standard multiplication of fractional ideals, and identity O. Thus we use the following standard definition. Definition A fractional ideal a of O is said to be invertible if there is another fractional ideal b such that ab O. Because multiplication of fractional ideals is associative, inverses are unique. We shall denote the inverse of a as a 1. Proposition Suppose O is an order of F(T )[d]. Let a be a fractional O-ideal. Then a is a proper if and only if a is invertible. Proof: ( ) Write ab O. We must prove that O {b F(T )[d] ba a}. Because a is an O-module, is trivial. We must prove. Let b F(T )[d] such that ba a. Then 17
22 bo b(ab) (ba)b ab O. Thus bo O. In particular, b b 1 bo O. Hence a is proper. ( ) Let a be a proper fractional ideal. Then by we may write a α, β for some α, β F(T )[d]. Then denoting τ : β α we have a α 1, τ F(T ). Now let ax + bx + c be the minimal polynomial of τ. (Note that τ must be of degree two over, because 1 and τ generate a free module of rank that contains ) Denote τ to be the other root of ax + bx + c. Now because a is proper, we know that O {β F(T )[d] βa a}. Hence by we know that O 1, aτ, and that the order 1, aτ has proper fractional ideal a : 1, τ. We see that these orders are actually the same, as 1, aτ 1, b+ D 1, b + D 1, b D 1, b D 1, aτ. We can now obtain that a 1 a α a. This is because ( a α a ) a ( a α 1, τ ) (α 1, τ ) aα 1, τ 1, τ α a, aτ, aτ, aττ a, aτ, a(τ + τ ), aττ a, aτ, b, c (a, b, c), aτ 1, aτ O. For the fourth equality consider that we know that aτ + bτ + c is the minimal polynomial of τ and τ. Thus τ is the only conjugate of τ, and so ττ N(τ) ( 1) deg(mτ (x)) [τ]m τ (x) b as well as τ + τ T r(τ) [τ 0 ]m τ (x) c. Now to move toward the ideal class group, let I(O) denote the set of all proper fractional ideals of O, and P (O) denote the subset of all principal proper fractional ideals. Clearly O is an 18
23 identity element of I(O) under multiplication. By we have inverses for each element of I(O). (In fact we have constructed I(O) by taking precisely those elements with inverses!). Thus I(O) is a group if we can only show closure. Proposition I(O) is an Abelian group under multiplication. Proof: By the above comments we need only show that if a, b I(O) then ab I(O). As in page 40 of [4] we know that ab is a fractional ideal. Thus we need only show that it is proper. Indeed by we know that ab is proper if and only if it has an inverse. Such an inverse is b 1 a 1, as abb 1 a 1 aoa 1 aa 1 O. (Note that this concurrently proves that b 1 a 1 must also be proper because b 1 and a 1 are). The fact that I(O) is Abelian follows from the fact that multiplication in F(T )[d] is commutative. Proposition P (O) is a normal subgroup under multiplication. Proof: The fact that P (O) is a group is trivial, as (a)(b) (ab) and (a) 1 (a 1 ). (Note that a 1 may not be in, but that is fine because it may be a fractional ideal). The fact that P (O) is normal follows from the fact that I(O) is Abelian. Definition We can then define the ideal class group of O, I(O)/P (O) : I(O)/P (O). Corollary I(O)/P (O) is a group. Proof: Trivial. 19
24 4.5 The Class Group Isomorphism Assume that D is not a square in. There is an isomorphism between the form class group constructed in 4..6 and the ideal class group mentioned in To prove this we shall construct a map from the set of primitive forms of a given discriminant, Q(D), to the ideals of an order I(O). The order involved is 1, aτ 1, b+ D 1, D, where [a, b, c] Q(D) and τ : b+ D a. The latter equality above is mostly obvious (see [C.1]), although slightly surprising. This is an order by Denote this order as O. In figure 4.1, ϕ is the map we shall construct, which induces the isomorphism ϕ between ] the two groups we are interested in. Define ϕ (f) : a, τ, so ϕ([f]) [ a, τ Lemma Let [a, b, c] Q(D)/. Then ideal of O. a, b+ D ( a 1, b + ) D is a proper Proof: Let τ be a root of ax + bx + c. In the future we will specify which root, but for this lemma it does not matter. Because D is not a square, ax + bx + c is irreducible, and thus the minimal polynomial of τ. Hence by we have that 1, τ is a proper fractional ideal of O 1, aτ. Now a 1, τ 1, aτ and thus a 1, τ is a ordinary ideal. (by ordinary ideal we merely mean an ideal of O). That is, we found that 1, τ and thus a 1, τ is a proper fractional ideal of O. But because it is contained in O it is in fact a ordinary ideal. Lemma 4.5. ϕ is well defined. Both our domain and codomain are equivalence classes, and so we must verify well definedness in both regards. So let C Q(D)/ with representatives f, g C. Q(D) ϕ I(O) [ ] [ ] Q(D)/ ϕ I(O)/P (O) Figure 4.1: The constructed mapping 0
25 Denote f f(x, y) [a, b, c] ax +bxy+cy, g a x +b xy+c y. Let τ b+ D a, τ b + D a. Thus ϕ([f]) [ a, τ ], ϕ([g]) [ a, τ ]. To show well definedness and one-to-one we will prove that f is properly equivalent to g if and only if a, τ is equivalent to a, τ. That is to say that there is a γ SL () such that γg f if and only if there is a λ F(T )[d] such that a, τ λ a, τ. We shall do this in the next four claims, of which 4.5. will follow as a corollary. Claim If f g via p q g f, then τ p q ( ) τ pτ+q rτ+s. r s r s Proof: We shall prove that pτ+q rτ+s is actually τ. We have and we will need the fact that p r q s 1 f s r p r q g f, p s r q SL (), s q f g. This yields a f(s, r), b p aqs + bpr + bps cpr, and c f( q, p) (see 3..1, with different constants plugged in. Now expanding pτ+q rτ+s pτ + q rτ + s out we get that aqs bps bqr + cpr + D(ps qr) (as bsr + cr ) b + D a τ where we removed the ps qr because ps qr 1 because p r q SL (). s 1
26 This proves the result, although it may be noted that the first equality above is is because pτ + q rτ + s p b+ D a + q + s r b+ D a p( b + D) + aq r( b + D) + as aq bp + p D as br + r D aq bp + p D as br + r D ( as br r ) D as br r D (aq bp)(as br) rpd + ( r(aq bp) + p(as br)) D (as br) r D) 4a qs abqr abps + b pr rp(b 4ac) + ( aqr + bpr + aps bpr) D 4a s 4abrs + b r r (b 4ac) 4a qs abqr abps + b pr b pr 4acpr + ( aqr + aps) D 4a s 4abrs + b r b r + 4ar c 4a qs abqr abps 4acpr + ( aqr + aps) D 4a s 4abrs + 4ar c ( a aqs bqr bps cpr + ( qr + ps) ) D a (as brs + r c) aqs bqr bps cpr + (ps qr) D as brs + r c aqs bqr bps cpr + (ps qr) D (as brs + cr ) aqs bqr bps cpr + (ps qr) D (as brs + cr. ) Claim If p r q τ τ, then f p s r SL (), then f g, while if p r Proof: Consider that q g. s q GL (), then f g.) s a τ + b τ + c 0 ( ) pτ + q a + b pτ + q rτ + s rτ + s + c 0 (Note that this implies that if a (pτ + q) + b (pτ + q)(rτ + s) + c (rτ + s) 0 p r q s
27 a (p τ + pqτ + q ) + b (prτ + (ps + qr)τ + qs) + c (r τ + rsτ + s ) 0 (a p + b pr + c r )τ + (a pq + bqr + bps + c rs)τ + (a q + b qs + c s ) 0 g(p, r)τ + (a pq + bqr + bps + c rs)τ + g(q, s) 0. So that we have that τ is a root of the polynomial g(p, r)x + (a pq + bqr + bps + c rs)x + g(q, s). Hence because ax + bx + c is the minimal polynoimal of τ, [a, b, c] divides g(p, r)x + (a pq + bqr + bps + c rs)x + g(q, s). Because both of these polynomials are of degree two, we thus have that there is a u F so that au g(p, r), bu a pq + bqr + bps + c rs, and cu g(q, s). Now note that we have by applying det p r q p s r 1 q to p s r q τ τ, s (ps qr)τ s r q τ p which gives (ps qr) ( b + ) D a a pq b qr b ps c rs + (ps qr) D (a p + b pr + c r. ) 3
28 because sτ q rτ + p s b + D a q r b + D a + p s( b + D) a q r( b + D) + a p a q b s + s D a p + b r r D a q b s + s D a p + b r r D ( a p + b r + r ) D a p + b r + r D ( a q b s)(a p + b r) + rsd + (r( a q b s) + s(a p + b r)) D (a p + b r) r D 4a qp a b qr a b sp b sr + rs(b 4a c ) + ( a qr + a sp) D 4a p + 4a b rp + b r r (b 4a c ) 4a qp a b qr a b sp b sr + b sr 4a c sr + ( a qr + a sp) D 4a p + 4a b rp + b r b r + 4a r c 4a qp a b qr a b sp 4a c sr + ( a qr + a sp) D 4a p + 4a b rp + 4a r c a ( a qp b qr b sp c sr + ( qr + sp) ) D a (a p + b rp + r c ) a qp b qr b sp c sr + (sp qr) D a p + b rp + r c a qp b qr b sp c sr + (sp qr) D (a p + b rp + c r ) a qp b qr b sp c sr + (sp qr) D (a p + b rp + c r ) a pq b qr b ps c rs + (ps qr) D (a p + b pr + c r. ) Then by comparing the D parts we get ps qr a ps qr ps qr (a p + b pr + c r ) g(p, r) which gives a g(p, r). And hence we have that u 1. Whence p q g f by r s 4
29 Claim If p q τ τ r s 1, τ λ 1, τ. and p r q SL (), then there is a λ F(T )[d] so that s Proof: Let λ rτ + s, and then we have λ 1, τ λ 1, pτ + q rτ + s, pτ + q rτ + s 1, τ. This is because for We find that 1, τ rτ + s, pτ + q because τ (ps qr)τ s(pτ + q) q(rτ + s) 1 ps qr p(rτ + s) r(pτ + q). And that is clear because rτ + s s 1 + r τ, and likewise for pτ + q. Claim If there is a λ F(T )[d] so that 1, τ λ 1, τ, then there is a SL () so that p q τ τ. r s p r q s Proof: With the fact that λ, λτ 1, τ choose p, q, r, s so that λτ pτ + q and λ rτ + s. Then Now p r we have τ p r we have p r Then we have τ pτ + q rτ + s p r q τ. s q must be invertible because we could likewise write τ a b τ, in which case s c d q a s c b τ so that p d r q a s c b I. Thus because p d r q GL () and so by we know that f g. In particular, p s r q is invertible, s q g f. s b + D a τ pτ + q rτ + s aqs bps bqr + cpr + D(ps qr) (as bsr + cr b + (ps qr) D ) a, 5
30 where we used the fact that pτ+q rτ+s aqs bps bqr+cpr+ D(ps qr) (as bsr+cr ) as proven in Claim and the other equalities are all by construction Next by equating the D parts, we find that so that ps qr 1 and so p r q SL (). s 1 ps qr a a Combining the above four claims we may obtain that f g via γ if and only if γτ τ if and only if 1, τ is equivalent to 1, τ in I(O)/P (O). We now have by taking the forward implications that ϕ is well defined. We have by taking the reverse implications that ϕ is injective. We still need to prove that it is surjective and a homomorphism. These are the next two lemmas. Lemma ϕ is surjective. Proof: Recall that O 1, D. Let C I(O)/P (O), and [a] C. That is, a is a proper fractional ideal of O. By this we know that we may write a α, β where α, β F(T )[d], and α, β are independent. Then write τ : β α so that a α, β α 1, τ. Let ax + bx + c be the minimal polynomial of τ (it must be of degree because α and β are independent). We then know that τ b± D a. If τ b D a negative 1 so that without loss of generality τ b+ D a. Then we have because a 1, b+ D a ϕ([ax + bx + c]) a 1, b + D a a, b + D ] [α 1, τ C multiply ax + bx + c through by aα 1 ( α 1, τ ), so that these ideals are equivalent. We have thus constructed an element (namely, [a, b, c]) that maps to C. Hence ϕ is surjective. 6
31 Lemma ϕ is a homomorphism of groups. Proof: We know by 3..8 that given any two C 1, C Q(D)/ we may choose [a, b, a c] C 1, [a, b, ac] C such that a, a 1. Then we have ϕ ([[a, b, a c]])ϕ ([[a, b, ac]]) a, b + D aa, a b + D aa, b + D ϕ ([[aa, b, c]]) a, b + D, a b + ( D, ϕ ([[a, b, a c]][[a, b, ac]]) b + D ) where the third equality is from C.. And we finally have the main result, Theorem Q(D)/ I(O)/P (O) as groups. Proof: The previous lemma s, and in fact everything in this section lead to this theorem. 7
32 Chapter 5 Conclusions and Discussion After working out many of the results from [] over we find that for the most part the results are mostly the same. We did stick to the case that is a unit the entire time which simplified some proofs. It is not entirely clear what would happen in characteristic. The primary difficulty in generalizing from Z is that we lose properties of the greatest common divisor. In particular, 3..4 explicitly fails to hold in a general unique factorization domain. Consider for instance any unique factorization domain which whose nontrivial generating sets have more than two elements. Such as F[x 1, x, x 3, x 4 ]. Take the coefficients of f include at least one of x 1, x, while M includes x 3, and we shall never obtain x 4 by F[x 1, x, x 3, x 4 ] combinations of M and those elements represented by f. However, 3..4 and possibly A.1 are the only facts in the first part of the theory that relies on more than a general integral domain in which is a unit. In the specialization to we also run into the fact that we need to deal with the degree at times. For instance, while over Z one can talk fairly easily about a unique reduced form in every equivalence class, in we were able to determine no such classification. However, we were able to find a somewhat reduced form in each case (it usually is not unique). In the latter part of the theory much notation was retained for intuition s sake, although some of the ideals and orders are simpler than in Z. In particular, the mapping ϕ between Q(D)/ and I(O)/P (O) can be stated less cumbersomely. We were also able to develop this equivalence of Q(D)/ and I(O)/P (O) without the need of developing any theory regarding the conductor of O or norms. One lingering question though regarding the previous comments, is as to whether we have 8
33 taken the best approach toward these forms. In particular, some things may have been more clear by dealing with the differing yet equivalent viewpoint and segregating forms ax + bxy + cy by their the determinant ac b instead of the discriminant. 9
34 Appendices 30
35 Appendix A Proofs of Random Things Claim A.1 With f Q( ), p q f : f(px + qy, rx + sy), GL (A) acts on Q( ) and SL (A) r s acts on Q(D). Proof: First let us prove that matrices over A act on the set of all binary quadratic forms. By construction we have closure. Let f [a, b, c] be a binary quadratic form. Clearly 1 0 f f. Let p q, p q be matrices over A. Then we have by the Associativity of matrices, r s r s p r q p q f s r s [ [ [ x x x ] y p r ] T p q y p r s r T q p q a s r s c ] p q y T p r s r p [ q x r s p q p r s r ] y p r q f, s T q a s c T q a s c T q a s c b p d r b p d r b p d r b p d r q p q x s r s y q p q x s r s y q p q x s r s y q x s y which gives us a group action. (This is actually an action from the right. But for convenience sake we will write it as an action from the left, and always remember that (γ 1 γ )f γ (γ 1 f). Second let us prove that GL (A) acts on Q( ). The the primary difficulty here is closure. That is, to show that γf Q( ) when γ GL (A) and f Q( ). Let γ GL (A). Then we know γ 1 GL (A). Let f Q( ). Then we know that we cannot have a common factor amongst the coefficients of f. That is, we cannot write f αg with α A A and g is some form over A (g is not necessarily primitive). Relying on the fact 31
36 that A is a PID, we know that this is if and only if. (That is, f fails to be primitive if and only if we can write f αg as above). Assume for the purpose of later contradiction that γf / Q( ). Then we can write γf αg where α A A. Then γ 1 γf γ 1 αg f αγ 1 g f αh. where h is a binary quadratic form. But we know that f Q( ), and so this is a contradiction. Hence γf Q( ). Then because SL (A) GL (A) we know that SL (A) acts on Q( ) as well. Third let us prove that SL (A) acts on Q(D). We now need only show that the discriminant is the invariant under the action. Denote γ : p q SL (A), then consider that r s 3
37 γf [f(p, r), apq + bqr + bps + crs, f(q, s)], so that Disc(γf) (apq + bqr + bps + crs) 4f(p, r)f(q, s) 4a p q + 4abpq r + 4abp qs + 4apqrs + b q r + b pqrs +4bcqr s + b p s + 4bcprs + 4c r s 4(ap + bpr + cr )(aq + bqs + cs ) 4a p q + 4abpq r + 4abp qs + 8acpqrs + b q r + b pqrs +4bcqr s + b p s + 4bcprs + 4c r s 4a p q 4abp qs 4acp s 4abpq r 4b pqrs 4bcprs 4acq r 4bcqr s 4c r s 8acpqrs + b q r + b p s 4acp s b pqrs 4acq r b q r + b p s b pqrs 4acpqrs 4acp s + 8acq r b (q r + p s pqrs) 4ac(p s + q r pqrs) b (q r + ps(ps qr) pqrs) 4ac(p s + qr(qr ps) pqrs) b (q r + ps pqrs) 4ac(p s qr pqrs) b (qr(qr ps) + ps) 4ac(ps(ps qr) qr) b ( qr + ps) 4ac(ps qr) b 4ac. Hence the discriminant is invariant under the action by SL (A). Claim A. With f g iff there exist γ GL (A) such that γf g, then is an equivalence relation. Proof: Let f, g, h S( ) with f g and g h. Reflexive: Choosing γ 1 0 GL (A) we have that f f. Symmetric: We have that there is a γ GL (A) so that γf g. Inverting γ we then have 33
38 γ 1 g γ 1 γf f, so that g f. Transitive: Writing γ 1 f g, γ g h we then have that h γ g (γ 1 γ )f so that f h. Claim A.3 With f g iff there exist γ SL (A) such that γf g, then is an equivalence relation. Proof: Let f, g, h S( ) with f g and g h. Reflexive: 1 0 SL (A) so that we have f f. Symmetric: We have that there is a γ SL (A) so that γf g. Inverting γ we then have γ 1 g γ 1 γf f. Now, det(γ 1 ) so that γ 1 SL (A). Thus so that g f. Transitive: Writing γ 1 f g, γ g h we then have that h γ g (γ 1 γ )f so that f h, because det(γ 1 γ ) Claim A.4 With f [a, b, c] Q(D), B an + b a n + b, then C : B D 4aa A. Proof: We know that D b 4ac, and B b na. Thus B D B (b 4ac) (B b)(b + b) + 4ac na(b + b) + 4ac a(n(b + b) + 4c). so that a B D. Similarly a B D. Because a, a A we then know that aa B D. 4 F, and so C A. Claim A.5 With f 1 [a, b, c], B an + b a n + b, then 1 n f [a, B, a 1 C]. Proof: First by A.4 we see that B D a(n(b + b) + 4c) na(b + an) + 4ac 4aa 4aa 4aa (4abn + 4a n + 4ac) 4aa A. 34
39 This will be C. Then by using 3..1 we obtain 1 n f [f(1, 0), an + b, f(n, 1)] [f(1, 0), B, an + bn + c] [f(1, 0), B, (4aa )(bn + an + c) 4aa ] [f(1, 0), B, a (4abn + 4a n + 4ac) 4aa ] [f(1, 0), B, a 1 C]. Claim A.6 With f [a, b, c] Q( ),r j p j and s i m i where M i m i j p j k q k with m i, p i, q k all irreducible, m i a, p j a, p j c, and q k a, q k c, q k b, then (f(r, s), M) (1). Proof: Consider that f(r, s) a p j + b ( ) ( ) p j m i + c m i j j i i q 1 m i + a p j i j q q k + b ( ) p j m i k j i ( ) q 3 p j + c m i. j i so that in the case of each irreducible divisor α of M, α divides precisely two terms of f(r, s) and thus does not divide f(r, s) (the second equality uses the fact that q k a, q k c). Hence because no irreducible divisor M is also an irredicuble divisor of f(r, s), we must have f(r, s), M A. Claim A.7 With f 1 [a 1, b, a c], f [a, b, a 1 c], r t f g, r t SL (A), a 1 a 1, s u s u a c a c, and a 1, a A then ta sa 1 c, a t sa 1 c, ua ra + bs, and c r 35
40 uc + bt/a 1. Proof: By inverting γ and noting that a 1 a 1 we get that, r t s a b/ a b/ u u b/ a 1 c b/ a 1 c s t, r which gives the following four equations. ra + bs/ ua bs/ br + sa 1c a t + br a t + bu bu a 1c s bt/ + uca 1 bt/ + a 1 c r, which give respectively, ua ra + bs ta sa 1 c a t sa 1 c a 1 c r uca 1 + bt. In the last, we note that t/a 1 A and so we have c r uc + bt/a 1. Claim A.8 With r t SL (A), ta sa 1 c, and a 1, a A, then r t/a 1 s u sa 1 u SL (A). Proof: To be in SL (A), we must have det 1 1, and all the entries in A. Indeed sa 1 u t/a 1 A because a 1 t, and so det 1 ru st det 1. sa 1 u s u 36
41 Claim A.9 With f 1 [a 1, b, a c], f [a, b, a 1 c] and g 1 [a 1, b, a c ], g [a, b, a 1c ], f 1 g 1, a 1, a A, f 1 g 1, f g, then g 1 g f 1 f. Proof: First note that because f 1 g 1 we know that a 1 a 1, and that a c a c. In fact, the equivalence we want is via γ : r t/a 1, by verifying that γ (f 1 f ) g 1 g, which is to say sa 1 u that r sa 1 a 1a b/ r t/a 1 a 1a b/, t/a 1 u b/ c sa 1 u b/ c which is equivalent to showing that r sa 1 a 1a b/ a 1a b/ u t/a 1, t/a 1 u b/ c b/ c sa 1 r The left hand side is r sa 1 a 1a b/ ra 1a + bsa 1 / br/ + sca 1, t/a 1 u b/ c a t + bu/ bt/(a 1 ) + uc while indeed the right hand side is a 1a b/ u t/a 1 b/ c sa 1 r a 1a b/ u t/a 1 b/ c sa 1 r a 1a u bsa 1 / br/ a t bu/ c sa 1 rc bt/(a 1 ) ra 1a + bsa 1 bsa 1 / br/ + sca 1 bu/ + a t uc + bt/a 1 bt/(a 1 ) ra 1a + bsa 1 / br/ + sca 1. bu/ + a t uc + bt/(a 1 ) using the identies found in A.7 for the last equality. This is the same as the left hand side, and so proves the claim. Claim A.10 With f 1 [a 1, b, a c], f [a, b, a 1 c] and g 1 [a 1, b, a c ], g [a, b, a 1c ], b b, 37
42 a 1, a A, f 1 g 1, f g, then [g g 1 ] [g f 1 ]. Proof: By comparing (g, g 1 ) with (g, f 1 ) we may apply case 1, and so this is indeed similar. Claim A.11 With f 1 [a 1, b, a c], f [a, b, a 1 c] and g 1 [a 1, b, a c ], g [a, b, a 1c ],B b + a 1 a n b + a 1 a n, f 1 g 1, f g, F 1 : 1 a n f 1, F : 1 a 1n f, G 1 : a n g 1, G : 1 a 1n g, H 1 : 1 n f 1 f 1 n [a 1 a, b/, c], H : 1 n g 1 g n [a 1a, b /, c ], then F 1 [a 1, B/, ] D, F [a, B/, ] D, G 1 [a 1, B/, ] D, G [a, B/, ] D, H 1 [a 1 a, B/, ] D, and H [a 1a, B/, ] D. Proof: The equality for F 1 (and similarly G 1 ) is because 1 0 a 1 b/ 1 a n a n 1 b/ a c a 1 b/ 1 a n a 1 a n + b/ a bn/ + a c a 1 a 1 a n + b/ a 1 a n + b/ a 1 a n + ba n/ + a bn/ + a c a 1 B/ B/ a 1 a n + ba n/ + a bn/ + a c a 1 B/ B/ a 1 a n + a bn + a c a 1 B/. B/ a (a 1 a n + bn + c) 38
43 The equalitiy for F (and similarly G ) is because 1 0 a b/ 1 a 1n a 1 n 1 b/ a 1 c a b/ 1 a 1n a 1 a n + b/ a 1 bn/ + a 1 c a a 1 a n + b/ a 1 a n + b/ a 1a n + a 1 bn + a 1 bn/ + a 1 c a B/. B/ a 1 (a 1 a n + bn + c) The equality for H 1 (and similarly H ) is because 1 0 a 1a b/ 1 n n 1 b/ c a 1 a b/ 1 n a 1 a n + b/ nb/ + c a 1 a a 1 a n + b/ 1 n a 1 a n + b/ a 1 a n + bn + c a 1a B/. B/ a 1 a n + bn + c Claim A.1 With F 1 [a 1, B/, a (a 1 a n + bn + c)], F [a, B/, a 1 (a 1 a n + bn + c)], H 1 [a 1 a, B/, a 1 a n +bn+c], and a 1 a, a 1a A, then F 1 and F are concordant, and F 1 F H 1. Proof: Denote C a 1 a n + bn + c, so that F 1 [a 1, B/, a C] and F [a, B/, a 1 C]. Hence by construction F 1 and F are concordant. (note that a 1 a 0 because f 1 and f are concordant). Further merely by writing out what we have defined as composition we then know that F 1 F [a 1 a, B/, C] H 1. Claim A.13 With f 0 [1, 0, D 4 ], then 1 b/ f 0 [1, b, ac] and 1 b/ f 0 [1, b, ac]. 1 39
44 Proof: This is because b/ b/ 1 0 D/4 1 0 b/ D/4 1 b/ 1 b/ b/ b /4 D/4 1 b/, b/ ac and b/ b/ 1 0 D/4 1 0 b/ D/4 1 b/ 1 b/ b/ b /4 + D/4 1 b/. b/ ac Claim A.14 For C Q(D)/, there always exists a form in C with nonzero first and third coefficient. Proof: If f [0, b, 0] take 1 1 f. If f [c, b, 0] then without loss of generality we may take f [0, b, c]. For f [0, b, c] then either 1 1 f [a, a + b, a + b] or 1 f [a, 4a + b, 4a + b] 0 1 has nonzero first and third coefficient. Lastly if f [a, 0, 0] take 1 1 f [a, a, a]. Claim A.15 With g 1 : 1 n 1 f 1, g : 1 n f, g 3 : 1 n 3 f 3, then g 1 [a 1, B, δ 1 ], g [a, B, δ ], g 3 [a 3, B, δ 3 ] for some appropriate δ 1, δ, δ 3. 40
45 Proof: The equality for g 1 (and similarly g ) are because 1 0 a 1 b 1 / 1 n 1 n 1 1 b 1 / a c 1 a 1 b 1 / 1 n 1 a 1 n 1 + b 1 / b 1 n 1 + a c 1 a 1 a 1 n 1 + b 1 / a 1 n 1 + b 1 / a 1 n 1 + b 1 n 1 / + b 1 n 1 + a c 1 a 1 B/. B/ a 1 n 1 + b 1 n 1 / + b 1 n 1 + a c 1 The equality for g 3 is because 1 0 a 3 b 3 / 1 n 3 n 3 1 b 3 / c 3 a 3 b 3 / 1 n 3 a 3 n 3 + b 3 / b 3 n 3 / + c 3 a 3 a 3 n 3 + b 3 / a 3 n 3 + b 3 / a 3 n 3 + b 3 n 3 / + b 3 n 3 / + c 3 a 3 B/. B/ a 3 n 3 + b 3 n 3 / + b 3 n 3 / + c 3 Labeling δ i appropriately, we have the desired equalities. Claim A.16 With g 1 [a 1, B, δ 1 ], g [a, B, δ ], g 3 [a 3, B, δ 3 ], and a 3, a 1 a A, then g 1 g g 3 is unambiguous. Proof: First note that D B 4a 1 δ 1 B 4a δ so that a 1 δ and a δ 1. Thus by 3..7 g and g are concordant. Denote g 1 g [a 1 a, B, ɛ 1 ]. Now note that g 1 g and g 3 are concordant again by 3..7 because D B 4a 1 a ɛ 1 B 4a 3 δ 3 and a 1 a, a 3 A. Hence we have (g 1 g ) g 3 [a 1 a a 3, B, ɛ ]. Next we have that g and g 3 are concordant because a, a 3 A and D B 4a δ B 4a 3 δ 3. Denote g g 3 [a a 3, B, ɛ 3 ]. Then g 1 and g g 3 are concordant because 41
46 a 1, a a 3 A and D B 4a 1 δ 1 B 4a 1 a ɛ 3. Hence we have g 1 (g g 3 ) [a 1 a a 3, B, ɛ 4 ]. is unambiguous. Now, finally, ɛ 4 ɛ because D B 4a 1 a a 3 ɛ 4 B 4a 1 a a 3 ɛ. Therefore g 1 g g 3 4
47 Appendix B Proofs of Some More Random Things Claim B.1 With f [a, b, c] where two of a, b, c are zero and the other is a unit, then has two nonzero entries. 1 1 f Proof: Suppose that a (or c before a change of variables) is the nonzero coefficient, then 1 1 f 1 1 f[a, 0, 0] [a, a, a]. Suppose that b is the nonzero coefficient, then 1 1 f 1 1 f[0, b, 0] [0, b, b]. Claim B. With a 0, b 0, c 0, one of 1 f, 3 1 f, 3 f has all nonzero coefficients Proof: We will work out that 1 f [b+c, 3b+c, b+c], 3 1 f [(3b+c), 5b+4c, b+c], f [3b + c, 5b + c, b + c]. Then we will note that either there is no F combination of b, c to 1 1 give zero, in which case all three have nonzero entires. Or if there is, such a combination is unique, all of these three forms do not have a coefficient in common. (each coefficient is a F combination, and so this shows that at least one of them must have all nonzero coefficients). With that we will 43
48 be done. 1 [ ] 1 [0, b, c] x y 0 b/ 1 x b/ c 1 1 y [ ] b/ b + c x y 1 x b/ b/ + c 1 1 y [ ] b + c 3b/ + c x y x. 3b/ + c b + c y [b + c, 3b + c, b + c] 3 1 [ ] 3 [0, b, c] x y 0 b/ 3 1 x b/ c 1 y [ ] b 3b/ + c x y 3 1 x b/ b/ + c 1 y [ ] 6b + 4c 5b/ + c x y x. 5b/ + c b + c y [(3b + c), 5b + 4c, b + c] 3 [ ] 3 1 [0, b, c] x y 0 b/ 3 x b/ c 1 1 y [ ] b/ 3b/ + c x y 3 x b/ b + c 1 1 y [ ] 3b + c 5b/ + c x y x. 5b/ + c b + c y [3b + c, 5b + c, b + c] 44
49 Claim B.3 With a, b, d the square root of a squarefree element of, then 1, ad + b F(T ) F(T )[d]. Proof: ( ) Trivial. ( ) Let γ + λd be an arbitrary element of F(T )[d]. (so γ, λ, a, b F(T )) Then γ + λd ( λa 1 ) (ad + b) + ( γ bλa 1) 1. Claim B.4 With f [a, b, c] Q( ), b + ma r where r 0 or deg(r) < deg(a), a, b, c, m, r and [a, b, c ] 1 m f, then deg(b ) < deg(a ) deg(a). Proof: First note that the case r 0 is redundant but was stated for completeness sake because r comes from the division algorithm. This is because if r 0, deg(r) and so deg(r) < deg(a) anyway. (if a 0 we already showed that we can reduce f so that a 0). In any event, let us work out that 1 m [a, b, c] [ x [ x [ x ] 1 0 y a b/ 1 m x m 1 b/ c y ] a b/ y 1 m x b/ + am bm/ + c y ] a b/ + am y x b/ + am bm/ + am + bm/ + c y [a, b + am, am + bm + c] [a, r, am + bm + c] [a, b, c ]. Thus a a, b r, so that indeed deg(b ) < deg(a ) deg(a). Claim B.5 There are n, m so that β m + nτ and a n iff β 1, aτ. Proof: This is quite easy once you think about it: ( ) Trivial: Write β m + n aτ. ( ) Nearly as trivial: Write β m + n aτ, and then define n : n a. 45
SPECIAL VALUES OF j-function WHICH ARE ALGEBRAIC
SPECIAL VALUES OF j-function WHICH ARE ALGEBRAIC KIM, SUNGJIN. Introduction Let E k (z) = 2 (c,d)= (cz + d) k be the Eisenstein series of weight k > 2. The j-function on the upper half plane is defined
More information(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d
The Algebraic Method 0.1. Integral Domains. Emmy Noether and others quickly realized that the classical algebraic number theory of Dedekind could be abstracted completely. In particular, rings of integers
More information(Rgs) Rings Math 683L (Summer 2003)
(Rgs) Rings Math 683L (Summer 2003) We will first summarise the general results that we will need from the theory of rings. A unital ring, R, is a set equipped with two binary operations + and such that
More informationChapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples
Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter
More informationRings. Chapter 1. Definition 1.2. A commutative ring R is a ring in which multiplication is commutative. That is, ab = ba for all a, b R.
Chapter 1 Rings We have spent the term studying groups. A group is a set with a binary operation that satisfies certain properties. But many algebraic structures such as R, Z, and Z n come with two binary
More informationEighth Homework Solutions
Math 4124 Wednesday, April 20 Eighth Homework Solutions 1. Exercise 5.2.1(e). Determine the number of nonisomorphic abelian groups of order 2704. First we write 2704 as a product of prime powers, namely
More informationMath 547, Exam 1 Information.
Math 547, Exam 1 Information. 2/10/10, LC 303B, 10:10-11:00. Exam 1 will be based on: Sections 5.1, 5.2, 5.3, 9.1; The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)
More informationw d : Y 0 (N) Y 0 (N)
Upper half-plane formulas We want to explain the derivation of formulas for two types of objects on the upper half plane: the Atkin- Lehner involutions and Heegner points Both of these are treated somewhat
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,
More informationMINKOWSKI THEORY AND THE CLASS NUMBER
MINKOWSKI THEORY AND THE CLASS NUMBER BROOKE ULLERY Abstract. This paper gives a basic introduction to Minkowski Theory and the class group, leading up to a proof that the class number (the order of the
More informationMath 2070BC Term 2 Weeks 1 13 Lecture Notes
Math 2070BC 2017 18 Term 2 Weeks 1 13 Lecture Notes Keywords: group operation multiplication associative identity element inverse commutative abelian group Special Linear Group order infinite order cyclic
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More information5 Dedekind extensions
18.785 Number theory I Fall 2016 Lecture #5 09/22/2016 5 Dedekind extensions In this lecture we prove that the integral closure of a Dedekind domain in a finite extension of its fraction field is also
More informationAlgebraic Number Theory
TIFR VSRP Programme Project Report Algebraic Number Theory Milind Hegde Under the guidance of Prof. Sandeep Varma July 4, 2015 A C K N O W L E D G M E N T S I would like to express my thanks to TIFR for
More informationRings and groups. Ya. Sysak
Rings and groups. Ya. Sysak 1 Noetherian rings Let R be a ring. A (right) R -module M is called noetherian if it satisfies the maximum condition for its submodules. In other words, if M 1... M i M i+1...
More informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
More informationExample: This theorem is the easiest way to test an ideal (or an element) is prime. Z[x] (x)
Math 4010/5530 Factorization Theory January 2016 Let R be an integral domain. Recall that s, t R are called associates if they differ by a unit (i.e. there is some c R such that s = ct). Let R be a commutative
More informationSolutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 2
Solutions to odd-numbered exercises Peter J Cameron, Introduction to Algebra, Chapter 1 The answers are a No; b No; c Yes; d Yes; e No; f Yes; g Yes; h No; i Yes; j No a No: The inverse law for addition
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More informationChapter 5. Linear Algebra
Chapter 5 Linear Algebra The exalted position held by linear algebra is based upon the subject s ubiquitous utility and ease of application. The basic theory is developed here in full generality, i.e.,
More informationSUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT
SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT Contents 1. Group Theory 1 1.1. Basic Notions 1 1.2. Isomorphism Theorems 2 1.3. Jordan- Holder Theorem 2 1.4. Symmetric Group 3 1.5. Group action on Sets 3 1.6.
More informationSelected Math 553 Homework Solutions
Selected Math 553 Homework Solutions HW6, 1. Let α and β be rational numbers, with α 1/2, and let m > 0 be an integer such that α 2 mβ 2 = 1 δ where 0 δ < 1. Set ǫ:= 1 if α 0 and 1 if α < 0. Show that
More information0.2 Vector spaces. J.A.Beachy 1
J.A.Beachy 1 0.2 Vector spaces I m going to begin this section at a rather basic level, giving the definitions of a field and of a vector space in much that same detail as you would have met them in a
More informationCHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and
CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)
More information5 Dedekind extensions
18.785 Number theory I Fall 2017 Lecture #5 09/20/2017 5 Dedekind extensions In this lecture we prove that the integral closure of a Dedekind domain in a finite extension of its fraction field is also
More information6 Ideal norms and the Dedekind-Kummer theorem
18.785 Number theory I Fall 2016 Lecture #6 09/27/2016 6 Ideal norms and the Dedekind-Kummer theorem Recall that for a ring extension B/A in which B is a free A-module of finite rank, we defined the (relative)
More informationReview of Linear Algebra
Review of Linear Algebra Throughout these notes, F denotes a field (often called the scalars in this context). 1 Definition of a vector space Definition 1.1. A F -vector space or simply a vector space
More informationSubrings and Ideals 2.1 INTRODUCTION 2.2 SUBRING
Subrings and Ideals Chapter 2 2.1 INTRODUCTION In this chapter, we discuss, subrings, sub fields. Ideals and quotient ring. We begin our study by defining a subring. If (R, +, ) is a ring and S is a non-empty
More informationMONOID RINGS AND STRONGLY TWO- GENERATED IDEALS
California State University, San Bernardino CSUSB ScholarWorks Electronic Theses, Projects, and Dissertations Office of Graduate Studies 6-2014 MONOID RINGS AND STRONGLY TWO- GENERATED IDEALS Brittney
More information7 Orders in Dedekind domains, primes in Galois extensions
18.785 Number theory I Lecture #7 Fall 2015 10/01/2015 7 Orders in Dedekind domains, primes in Galois extensions 7.1 Orders in Dedekind domains Let S/R be an extension of rings. The conductor c of R (in
More informationIntegral Extensions. Chapter Integral Elements Definitions and Comments Lemma
Chapter 2 Integral Extensions 2.1 Integral Elements 2.1.1 Definitions and Comments Let R be a subring of the ring S, and let α S. We say that α is integral over R if α isarootofamonic polynomial with coefficients
More informationBasic Algebra. Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series
Basic Algebra Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series Cornerstones Selected Pages from Chapter I: pp. 1 15 Anthony
More informationChapter 14: Divisibility and factorization
Chapter 14: Divisibility and factorization Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Summer I 2014 M. Macauley (Clemson) Chapter
More information(a + b)c = ac + bc and a(b + c) = ab + ac.
2. R I N G S A N D P O LY N O M I A L S The study of vector spaces and linear maps between them naturally leads us to the study of rings, in particular the ring of polynomials F[x] and the ring of (n n)-matrices
More informationMoreover this binary operation satisfies the following properties
Contents 1 Algebraic structures 1 1.1 Group........................................... 1 1.1.1 Definitions and examples............................. 1 1.1.2 Subgroup.....................................
More informationExtension theorems for homomorphisms
Algebraic Geometry Fall 2009 Extension theorems for homomorphisms In this note, we prove some extension theorems for homomorphisms from rings to algebraically closed fields. The prototype is the following
More informationModules Over Principal Ideal Domains
Modules Over Principal Ideal Domains Brian Whetter April 24, 2014 This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License. To view a copy of this
More informationLINEAR SYSTEMS AND MATRICES
CHAPTER 3 LINEAR SYSTEMS AND MATRICES SECTION 3. INTRODUCTION TO LINEAR SYSTEMS This initial section takes account of the fact that some students remember only hazily the method of elimination for and
More informationTotal 100
Math 542 Midterm Exam, Spring 2016 Prof: Paul Terwilliger Your Name (please print) SOLUTIONS NO CALCULATORS/ELECTRONIC DEVICES ALLOWED. MAKE SURE YOUR CELL PHONE IS OFF. Problem Value 1 10 2 10 3 10 4
More informationGorenstein Injective Modules
Georgia Southern University Digital Commons@Georgia Southern Electronic Theses & Dissertations Graduate Studies, Jack N. Averitt College of 2011 Gorenstein Injective Modules Emily McLean Georgia Southern
More informationTheorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.
5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field
More information1. multiplication is commutative and associative;
Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.
More informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
More information2. Prime and Maximal Ideals
18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the so-called prime and maximal ideals. Let
More informationMath 121 Homework 5: Notes on Selected Problems
Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements
More informationA connection between number theory and linear algebra
A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.
More information12 16 = (12)(16) = 0.
Homework Assignment 5 Homework 5. Due day: 11/6/06 (5A) Do each of the following. (i) Compute the multiplication: (12)(16) in Z 24. (ii) Determine the set of units in Z 5. Can we extend our conclusion
More informationADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS
ADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS UZI VISHNE The 11 problem sets below were composed by Michael Schein, according to his course. Take into account that we are covering slightly different material.
More informationALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS.
ALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS. KEVIN MCGERTY. 1. RINGS The central characters of this course are algebraic objects known as rings. A ring is any mathematical structure where you can add
More information36 Rings of fractions
36 Rings of fractions Recall. If R is a PID then R is a UFD. In particular Z is a UFD if F is a field then F[x] is a UFD. Goal. If R is a UFD then so is R[x]. Idea of proof. 1) Find an embedding R F where
More informationSCTT The pqr-method august 2016
SCTT The pqr-method august 2016 A. Doledenok, M. Fadin, À. Menshchikov, A. Semchankau Almost all inequalities considered in our project are symmetric. Hence if plugging (a 0, b 0, c 0 ) into our inequality
More informationRINGS: SUMMARY OF MATERIAL
RINGS: SUMMARY OF MATERIAL BRIAN OSSERMAN This is a summary of terms used and main results proved in the subject of rings, from Chapters 11-13 of Artin. Definitions not included here may be considered
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationEXERCISE SET 5.1. = (kx + kx + k, ky + ky + k ) = (kx + kx + 1, ky + ky + 1) = ((k + )x + 1, (k + )y + 1)
EXERCISE SET 5. 6. The pair (, 2) is in the set but the pair ( )(, 2) = (, 2) is not because the first component is negative; hence Axiom 6 fails. Axiom 5 also fails. 8. Axioms, 2, 3, 6, 9, and are easily
More informationComputations/Applications
Computations/Applications 1. Find the inverse of x + 1 in the ring F 5 [x]/(x 3 1). Solution: We use the Euclidean Algorithm: x 3 1 (x + 1)(x + 4x + 1) + 3 (x + 1) 3(x + ) + 0. Thus 3 (x 3 1) + (x + 1)(4x
More informationRings and Fields Theorems
Rings and Fields Theorems Rajesh Kumar PMATH 334 Intro to Rings and Fields Fall 2009 October 25, 2009 12 Rings and Fields 12.1 Definition Groups and Abelian Groups Let R be a non-empty set. Let + and (multiplication)
More informationSolutions I.N. Herstein- Second Edition
Solutions I.N. Herstein- Second Edition Sadiah Zahoor 25, July 2016 Please email me if any corrections at sadiahzahoor@cantab.net. Problem 0.1. In the following determine whether the systems described
More informationGraduate Preliminary Examination
Graduate Preliminary Examination Algebra II 18.2.2005: 3 hours Problem 1. Prove or give a counter-example to the following statement: If M/L and L/K are algebraic extensions of fields, then M/K is algebraic.
More informationSchool of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information
MRQ 2017 School of Mathematics and Statistics MT5836 Galois Theory Handout 0: Course Information Lecturer: Martyn Quick, Room 326. Prerequisite: MT3505 (or MT4517) Rings & Fields Lectures: Tutorials: Mon
More informationFinitely Generated Modules over a PID, I
Finitely Generated Modules over a PID, I A will throughout be a fixed PID. We will develop the structure theory for finitely generated A-modules. Lemma 1 Any submodule M F of a free A-module is itself
More informationALGEBRA PH.D. QUALIFYING EXAM September 27, 2008
ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008 A passing paper consists of four problems solved completely plus significant progress on two other problems; moreover, the set of problems solved completely
More informationc ij x i x j c ij x i y j
Math 48A. Class groups for imaginary quadratic fields In general it is a very difficult problem to determine the class number of a number field, let alone the structure of its class group. However, in
More informationCollected trivialities on algebra derivations
Collected trivialities on algebra derivations Darij Grinberg December 4, 2017 Contents 1. Derivations in general 1 1.1. Definitions and conventions....................... 1 1.2. Basic properties..............................
More informationRestoring Factorization in Integral Domains
Virginia Commonwealth University VCU Scholars Compass Theses and Dissertations Graduate School 015 Restoring Factorization in Integral Domains Susan Kirk Virginia Commonwealth University Follow this and
More information6]. (10) (i) Determine the units in the rings Z[i] and Z[ 10]. If n is a squarefree
Quadratic extensions Definition: Let R, S be commutative rings, R S. An extension of rings R S is said to be quadratic there is α S \R and monic polynomial f(x) R[x] of degree such that f(α) = 0 and S
More informationMath Introduction to Modern Algebra
Math 343 - Introduction to Modern Algebra Notes Field Theory Basics Let R be a ring. M is called a maximal ideal of R if M is a proper ideal of R and there is no proper ideal of R that properly contains
More informationMATH 326: RINGS AND MODULES STEFAN GILLE
MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called
More informationMODEL ANSWERS TO THE FIRST HOMEWORK
MODEL ANSWERS TO THE FIRST HOMEWORK 1. Chapter 4, 1: 2. Suppose that F is a field and that a and b are in F. Suppose that a b = 0, and that b 0. Let c be the inverse of b. Multiplying the equation above
More informationAlgebraic structures I
MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one
More informationRings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.
Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over
More informationSolution to Homework 1
Solution to Homework Sec 2 (a) Yes It is condition (VS 3) (b) No If x, y are both zero vectors Then by condition (VS 3) x = x + y = y (c) No Let e be the zero vector We have e = 2e (d) No It will be false
More informationHASSE-MINKOWSKI THEOREM
HASSE-MINKOWSKI THEOREM KIM, SUNGJIN 1. Introduction In rough terms, a local-global principle is a statement that asserts that a certain property is true globally if and only if it is true everywhere locally.
More informationOutline. MSRI-UP 2009 Coding Theory Seminar, Week 2. The definition. Link to polynomials
Outline MSRI-UP 2009 Coding Theory Seminar, Week 2 John B. Little Department of Mathematics and Computer Science College of the Holy Cross Cyclic Codes Polynomial Algebra More on cyclic codes Finite fields
More informationGaussian integers. 1 = a 2 + b 2 = c 2 + d 2.
Gaussian integers 1 Units in Z[i] An element x = a + bi Z[i], a, b Z is a unit if there exists y = c + di Z[i] such that xy = 1. This implies 1 = x 2 y 2 = (a 2 + b 2 )(c 2 + d 2 ) But a 2, b 2, c 2, d
More informationAN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS
AN ALGEBRA PRIMER WITH A VIEW TOWARD CURVES OVER FINITE FIELDS The integers are the set 1. Groups, Rings, and Fields: Basic Examples Z := {..., 3, 2, 1, 0, 1, 2, 3,...}, and we can add, subtract, and multiply
More informationSubrings of Finite Commutative Rings
Subrings of Finite Commutative Rings Francisco Franco Munoz arxiv:1712.02025v1 [math.ac] 6 Dec 2017 Abstract We record some basic results on subrings of finite commutative rings. Among them we establish
More informationSupplementary Material for MTH 299 Online Edition
Supplementary Material for MTH 299 Online Edition Abstract This document contains supplementary material, such as definitions, explanations, examples, etc., to complement that of the text, How to Think
More informationRings. Chapter Homomorphisms and ideals
Chapter 2 Rings This chapter should be at least in part a review of stuff you ve seen before. Roughly it is covered in Rotman chapter 3 and sections 6.1 and 6.2. You should *know* well all the material
More informationRepresentation of prime numbers by quadratic forms
Representation of prime numbers by quadratic forms Bachelor thesis in Mathematics by Simon Hasenfratz Supervisor: Prof. R. Pink ETH Zurich Summer term 2008 Introduction One of the most famous theorems
More informationSolutions of exercise sheet 8
D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 8 1. In this exercise, we will give a characterization for solvable groups using commutator subgroups. See last semester s (Algebra
More informationALGEBRA QUALIFYING EXAM SPRING 2012
ALGEBRA QUALIFYING EXAM SPRING 2012 Work all of the problems. Justify the statements in your solutions by reference to specific results, as appropriate. Partial credit is awarded for partial solutions.
More informationERRATA. Abstract Algebra, Third Edition by D. Dummit and R. Foote (most recently revised on February 14, 2018)
ERRATA Abstract Algebra, Third Edition by D. Dummit and R. Foote (most recently revised on February 14, 2018) These are errata for the Third Edition of the book. Errata from previous editions have been
More informationTROPICAL SCHEME THEORY
TROPICAL SCHEME THEORY 5. Commutative algebra over idempotent semirings II Quotients of semirings When we work with rings, a quotient object is specified by an ideal. When dealing with semirings (and lattices),
More information2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a.
Chapter 2 Groups Groups are the central objects of algebra. In later chapters we will define rings and modules and see that they are special cases of groups. Also ring homomorphisms and module homomorphisms
More informationPolynomial Rings. i=0. i=0. n+m. i=0. k=0
Polynomial Rings 1. Definitions and Basic Properties For convenience, the ring will always be a commutative ring with identity. Basic Properties The polynomial ring R[x] in the indeterminate x with coefficients
More informationMODEL ANSWERS TO HWK #7. 1. Suppose that F is a field and that a and b are in F. Suppose that. Thus a = 0. It follows that F is an integral domain.
MODEL ANSWERS TO HWK #7 1. Suppose that F is a field and that a and b are in F. Suppose that a b = 0, and that b 0. Let c be the inverse of b. Multiplying the equation above by c on the left, we get 0
More information1. Factorization Divisibility in Z.
8 J. E. CREMONA 1.1. Divisibility in Z. 1. Factorization Definition 1.1.1. Let a, b Z. Then we say that a divides b and write a b if b = ac for some c Z: a b c Z : b = ac. Alternatively, we may say that
More informationThe Mass Formula for Binary Quadratic Forms
The Mass Formula for Binary Quadratic Forms by John Paul Cook A well-documented question from classical number theory pertains to the different representations of an integer k by a binary quadratic form.
More informationHomework 6 Solution. Math 113 Summer 2016.
Homework 6 Solution. Math 113 Summer 2016. 1. For each of the following ideals, say whether they are prime, maximal (hence also prime), or neither (a) (x 4 + 2x 2 + 1) C[x] (b) (x 5 + 24x 3 54x 2 + 6x
More informationAMBIGUOUS FORMS AND IDEALS IN QUADRATIC ORDERS. Copyright 2009 Please direct comments, corrections, or questions to
AMBIGUOUS FORMS AND IDEALS IN QUADRATIC ORDERS JOHN ROBERTSON Copyright 2009 Please direct comments, corrections, or questions to jpr2718@gmail.com This note discusses the possible numbers of ambiguous
More informationTHE HALF-FACTORIAL PROPERTY IN INTEGRAL EXTENSIONS. Jim Coykendall Department of Mathematics North Dakota State University Fargo, ND.
THE HALF-FACTORIAL PROPERTY IN INTEGRAL EXTENSIONS Jim Coykendall Department of Mathematics North Dakota State University Fargo, ND. 58105-5075 ABSTRACT. In this paper, the integral closure of a half-factorial
More informationIdeal Composition in Quadratic Fields: from Bhargava to Gauss
Ideal Composition in Quadratic Fields: from Bhargava to Gauss Duncan Buell Department of Computer Science and Engineering University of South Carolina Clemson, 10 Oct 010 DAB Page 1 Composition in Quadratic
More informationφ(xy) = (xy) n = x n y n = φ(x)φ(y)
Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =
More informationMath 762 Spring h Y (Z 1 ) (1) h X (Z 2 ) h X (Z 1 ) Φ Z 1. h Y (Z 2 )
Math 762 Spring 2016 Homework 3 Drew Armstrong Problem 1. Yoneda s Lemma. We have seen that the bifunctor Hom C (, ) : C C Set is analogous to a bilinear form on a K-vector space, : V V K. Recall that
More informationSubsets of Euclidean domains possessing a unique division algorithm
Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness
More informationSPRING 2006 PRELIMINARY EXAMINATION SOLUTIONS
SPRING 006 PRELIMINARY EXAMINATION SOLUTIONS 1A. Let G be the subgroup of the free abelian group Z 4 consisting of all integer vectors (x, y, z, w) such that x + 3y + 5z + 7w = 0. (a) Determine a linearly
More informationMATH 403 MIDTERM ANSWERS WINTER 2007
MAH 403 MIDERM ANSWERS WINER 2007 COMMON ERRORS (1) A subset S of a ring R is a subring provided that x±y and xy belong to S whenever x and y do. A lot of people only said that x + y and xy must belong
More informationJohns Hopkins University, Department of Mathematics Abstract Algebra - Spring 2009 Midterm
Johns Hopkins University, Department of Mathematics 110.401 Abstract Algebra - Spring 2009 Midterm Instructions: This exam has 8 pages. No calculators, books or notes allowed. You must answer the first
More information1. Algebra 1.5. Polynomial Rings
1. ALGEBRA 19 1. Algebra 1.5. Polynomial Rings Lemma 1.5.1 Let R and S be rings with identity element. If R > 1 and S > 1, then R S contains zero divisors. Proof. The two elements (1, 0) and (0, 1) are
More informationABSTRACT ALGEBRA 2 SOLUTIONS TO THE PRACTICE EXAM AND HOMEWORK
ABSTRACT ALGEBRA 2 SOLUTIONS TO THE PRACTICE EXAM AND HOMEWORK 1. Practice exam problems Problem A. Find α C such that Q(i, 3 2) = Q(α). Solution to A. Either one can use the proof of the primitive element
More information