MODULES OVER A PID KEITH CONRAD


 Agnes Gray
 2 years ago
 Views:
Transcription
1 MODULES OVER A PID KEITH CONRAD Every vector space over a field K that has a finite spanning set has a finite basis: it is isomorphic to K n for some n 0. When we replace the scalar field K with a commutative ring A, it is no longer true that every Amodule with a finite generating set has a basis: not all modules have bases. But when A is a PID, we get something nearly as good as that: (1) Every submodule of A n has a basis of size at most n. (2) Every finitely generated torsionfree Amodule M has a finite basis: M = A n for a unique n 0. (3) Every finitely generated Amodule M is isomorphic to A d T, where d 0 and T is a finitely generated torsion module. We will prove this based on how a submodule of a finite free module over a PID sits inside the free module. Then we ll learn how to count with ideals in place of positive integers. 1. Preliminary results We start with three lemmas that have nothing to do with PIDs. Lemma 1.1. If A is a nonzero commutative ring and A m = A n as Amodules then m = n. Proof. The simplest proof uses a maximal ideal m in A. Setting M = A m and N = A n, if M = N as Amodules then it restricts to an isomorphism mm = mn and we get an induced isomorphism M/mM = N/mN. This says (A/m) m = (A/m) n as Amodules, hence also as A/mvector spaces, so m = n from the welldefinedness of dimension for vector spaces. Lemma 1.1 says all bases in a finite free module over any nonzero commutative ring have the same size, and we call the size of that basis the rank of the free module. Therefore the term rank means dimension when the ring is a field. 1 The proof of Lemma 1.1 remains valid for free modules with a basis of infinite cardinality, so the rank of a free module with an infinite basis is welldefined as a cardinal number. For our purposes, free modules of finite rank will be all we care about. Commutativity in Lemma 1.1 is important: there are noncommutative rings A such that A 2 = A as left Amodules. Lemma 1.2. Let A be a commutative ring and M be an Amodule. Every surjective linear map onto a finite free module looks like projection out of a direct sum decomposition. That is, if f : M A n is Alinear and onto, then there is an Amodule isomorphism h: M = A n ker f where h(m) = (f(m), ), making f the first component of h. Proof. Let A n = Ae 1 Ae n and pick m i M such that f(m i ) = e i. Let g : A n M by g(c 1 e c n e n ) = c 1 m c n m n 1 The word rank means something completely different in linear algebra the dimension of the image of a linear map. 1
2 2 KEITH CONRAD (i.e., g is Alinear and g(e i ) = m i ). So f(g(v)) = v for all v A n (just check at v = e i and use linearity). Define the function h: M A n ker f by h(m) = (f(m), m g(f(m))). Check that h is an isomorphism as Exercise 2. Any linear surjection f : M N of Amodules induces an isomorphism M/ ker f = N but there is usually not a direct sum decomposition M = N ker f. That is, we can t usually split off ker f as a direct summand of M. For example, the surjection f : Z Z/6Z doesn t come from an isomorphism Z = (Z/6Z) ker f. Lemma 1.2 says there is such a splitting when N = A n. This is a useful property of finite free modules. Lemma 1.3. Every finitely generated torsionfree module M over an integral domain A can be embedded in a finite free Amodule. More precisely, if M 0 there is an embedding M A d for some d 1 such that the image of M intersects each standard coordinate axis of A d. Proof. Let K be the fraction field of A and x 1,..., x n be a generating set for M as an Amodule. We will show n is an upper bound on the size of any Alinearly independent subset of M. Let f : A n M be the linear map where f(e i ) = x i for all i. (By e 1,..., e n we mean the standard basis of A n.) Let y 1,..., y k be linearly independent in M, so their Aspan is isomorphic to A k. Write y j = n i=1 a ijx i with a ij A. We pull the y j s back to A n by setting v j = (a 1j,..., a nj ), so f(v j ) = y j. A linear dependence relation on the v j s is transformed by f into a linear dependence relation on the y j s, which is a trivial relation by their linear independence. Therefore v 1,..., v k is Alinearly independent in A n, hence Klinearly independent in K n. By linear algebra over fields, k n. From the bound k n, there is a linearly independent subset of M with maximal size, say t 1,..., t d. Then d j=1 At j = A d. We will find a scalar multiple of M inside of this. For any x M, the set {x, t 1,..., t d } is linearly dependent by maximality of d, so there is a nontrivial linear relation ax + d i=1 a it i = 0, necessarily with a 0. Thus ax d j=1 At j. Letting x run through the spanning set x 1,..., x n there is an a A {0} such that ax i d j=1 At j for all i, so am d j=1 At j. Multiplying by a is an isomorphism of M with am, so we have the sequence of Alinear maps M am where the last map is an isomorphism. d At j A d, j=1 2. Submodules of a finite free module Theorem 2.1. When A is a PID, any submodule of a free Amodule of rank n is free of rank n. Proof. We may assume the free Amodule is literally A n and will induct on n. The case where n = 1 is true since A is a PID: every Asubmodule of A is an ideal, hence of the form Aa since all ideals in A are principal, and Aa = A as Amodules when a 0 since A is an integral domain. Say n 1 and the theorem is proved for A n. Let M A n+1 be a submodule. We want to show M is free of rank n + 1. View M A n+1 = A A n and let π : A A n A n be projection to the second component of this direct sum. Then N = π(m) A n is free of rank n by the induction hypothesis. Since π maps M onto N
3 and N is finite free, by Lemma 1.2 MODULES OVER A PID 3 M = N ker π M and ker π M = M (A 0). All submodules of A 0 = A are free of rank 1. Thus N ker π M is free of rank n + 1, so M is as well. Theorem 2.1 is false if A is not a PID, even for the Amodule A itself. Nonexample 2.2. If A is not a PID because it has a nonprincipal ideal, that ideal is not a free Amodule. If A is not a PID because it is not an integral domain, with xy = 0 where x and y are nonzero, then the principal ideal Ax is not a free Amodule. Remark 2.3. Theorem 2.1 is true for nonfinitely generated free modules too: any submodule of a free module over a PID is free. The proof allowing infinite bases uses Zorn s lemma. See [1, pp ]. Corollary 2.4. When A is a PID, every finitely generated torsionfree Amodule is a finite free Amodule. Proof. By Lemma 1.3, such a module embeds into a finite free Amodule, so it is finite free too by Theorem 2.1. The term free in torsionfree module and free module means different things: a torsionfree module has no nonzero torsion elements (all elements have annihilator ideal (0) aside from the element 0), while a free module has a basis. So Corollary 2.4 is saying a finitely generated module over a PID that has no torsion elements admits a basis. Corollary 2.4 is false without the finite generatedness hypothesis. For example, Q is a torsionfree abelian group but it has no basis over Z: any (nonzero) free Zmodule has proper Zsubmodules (that is, proper subgroups) of finite index while Q does not. Corollary 2.5. Let A be a PID. If we have a tower of Amodules M M M with M = A n and M = A n then M = A n. Proof. Since M is free of rank n and M is a submodule, Theorem 2.1 tells us M = A m with m n. Using Theorem 2.1 on M as a submodule of M, M = A k with k m. By hypothesis M = A n, so k = n by Lemma 1.1. Thus m = n. Corollaries 2.4 and 2.5 are both generally false when A is not a PID. Nonexample 2.6. Let A = Z[ 5] and consider the tower of ideals 3Z[ 5] (3, 1 + 5) Z[ 5]. The bottom and top are principal ideals, so they are free Amodules of rank 1. The middle ideal (3, 1 + 5) is finitely generated and torsionfree, but is not principal and therefore is not a free Amodule. (A nonzero ideal is a free module only when it is principal, since any two elements in an ideal are linearly related.) There is a convenient way of picturing any submodule of a finite free module over a PID: bases can be chosen for the module and submodule that are aligned nicely, as follows. Definition 2.7. If A is a PID, M is a finite free Amodule, and M is a submodule of M, a basis {v 1,..., v n } of M and a basis {a 1 v 1,..., a m v m } of M with a i A {0} and m n is called a pair of aligned bases.
4 4 KEITH CONRAD Pictures will explain what alignment of bases means before we give the main theorem about them. Example 2.8. Let A = Z, M = Z[i] and take N = (1 + 2i)Z[i]. So M = Z + Zi and N = (1 + 2i)Z[i] = (1 + 2i)Z + (1 + 2i)Zi = Z(1 + 2i) + Z( 2 + i). The obvious Zbases for M and N are {1, i} and {1 + 2i, 2 + i}. In Figure 1, we shade a box having each basis as a pair of edges and translate each box across the plane. The modules M and N are the intersection points of the networks of lines formed by the small and large boxes, respectively. The modules do not know about the lines, which only show us how a choice of basis gives a specific way to picture how the module is generated by the basis. Z[i] = Z(1 + 2i) + Zi, (1 + 2i) = Z(1 + 2i) + Z( 2 + i) Figure 1. Nonaligned bases for a modules and submodule To see a completely different picture of the same two modules, we use new bases: {1+2i, i} for M and {1 + 2i, 5i} for N. These are bases because of the relations ( ) ( ( ) ( ) ( ) ( ) 1 + 2i i i =, =, i 0 1) i 5i i where the two matrices are integral with determinant 1, so the vectors on both sides have the same Zspan. These new bases lead to Figure 2, where the parallelograms with each basis as a pair of edges is shaded and looks quite unlike the shaded boxes of Figure 1. Translating the parallelograms across the plane produces two new networks of lines (both sharing all the vertical lines) The intersection points are the same as before; make sure you
5 MODULES OVER A PID 5 can see the vertices of the large box from Figure 1 as intersection points of lines in Figure 2. In Figure 2 five of the parallelograms for M fill up of the parallelograms for N. These bases are aligned. Z[i] = Z(1 + 2i) + Zi, (1 + 2i) = Z(1 + 2i) + Z 5i Figure 2. Aligned bases for a module and submodule Theorem 2.9. Any finite free Amodule M of rank n 1 and nonzero submodule M of rank m n admit a pair of aligned bases: there is a basis v 1,..., v n of M and nonzero a 1,..., a m A such that n m M = Av i and M = Aa j v j. i=1 Proof. A basis of M gives us coordinate functions for that basis, which are linear maps M A. Having a set of bases for M and M as in the theorem means there are a set of compatible coordinate systems on M and M. To motivate the main idea in the proof, first suppose the theorem is true and let s see what it tells us about linear maps ϕ: M A when they are restricted to M : ( m ) m ϕ(m ) = ϕ Aa j v j = Aa j ϕ(v j ) Aa Aa m. j=1 j=1 Write Aa Aa m = Ac, so ϕ(m ) Ac for every ϕ M. Moreover, writing c = x 1 a x m a m with x j A (the choice of x i s may not be unique, but fix such j=1
6 6 KEITH CONRAD a representation for c) and defining ψ : M A by ψ( n i=1 c iv i ) = m j=1 c jx j, we have ψ( m i=1 a iv i ) = c, so ψ(m ) = Ac. The set of all ideals ϕ(m ) as ϕ runs over linear maps M A has Ac as the unique maximal member in this set with respect to inclusion (this is not saying Ac is a maximal ideal!). Now we start over and define S to be the set of ideals ϕ(m ) where ϕ: M A is Alinear. This includes nonzero ideals; for example, let M have Abasis {e 1,..., e n }, so M = n i=1 Ae i. At least one coordinate function for this basis is not identically 0 on M, and the image of that coordinate function on M is a nonzero ideal in S. Any nonzero ideal in A is contained in only finitely many ideals since A is a PID, so S contains maximal members with respect to inclusion. Call one of these maximal members Aa 1, so a We know already that Aa 1 = ϕ 1 (M ) for some linear map ϕ 1 : M A. There s some v M such that a 1 = ϕ 1 (v ). Eventually we are going to show ϕ 1 takes the value 1 on M. Claim: For any linear map ϕ: M A, a 1 ϕ(v ). To show this, set ϕ(v ) = a ϕ A. Since A is a PID, Aa 1 + Aa ϕ = Ad for some d, so Aa 1 Ad. We have d = xa 1 + ya ϕ for some x, y A. Then so da (xϕ 1 + yϕ)(m ) S. Hence d = xϕ 1 (v ) + yϕ(v ) = (xϕ 1 + yϕ)(v ), ϕ 1 (M ) = Aa 1 Ad (xϕ 1 + yϕ)(m ). Since xϕ 1 + yϕ is a linear map M A it belongs to S, so maximality of ϕ 1 (M ) in S implies ϕ 1 (M ) = (xϕ 1 + yϕ)(m ) = Ad. Hence Aa 1 = Ad = Aa 1 + Aa ϕ, which implies a ϕ Aa 1, so a 1 a ϕ. With the claim proved, we are ready to build aligned bases in M and M. M = n i=1 Ae i for some basis {e 1,..., e n }, write v = c 1 e c n e n Letting for c i A. The ith coordinate function for this basis is a linear map M A taking the value c i at v, so c i is a multiple of a 1 by our claim. Writing c i = a 1 b i, n n v = c i e i = a 1 b i e i = a 1 (b 1 e b n e n ) = a 1 v 1, say. Then i=1 i=1 a 1 = ϕ 1 (v ) = ϕ 1 (a 1 v 1 ) = a 1 ϕ 1 (v 1 ), so ϕ 1 (v 1 ) = 1. We have found an element of M at which ϕ 1 takes the value 1. The module M can be written as Av 1 + ker ϕ 1 since for any v M v = ϕ 1 (v)v 1 + (v ϕ 1 (v)v 1 ). Also Av 1 ker ϕ 1 = {0} (check!). Thus M = Av 1 ker ϕ 1. Since M is free of rank n its submodule ker ϕ 1 is free and necessarily of rank n 1. 2 We anticipate Aa1 will be the unique maximal member of S by the argument at the start of the proof, but at the moment it is just some maximal member of S.
7 MODULES OVER A PID 7 How does M fit in this decomposition of M? 3 For any w M we have and the first term is So w ϕ 1 (w)v 1 M also. Therefore w = ϕ 1 (w)v 1 + (w ϕ 1 (w)v 1 ) ϕ 1 (w)v 1 ϕ(m )v 1 = (Aa 1 )v 1 = Aa 1 v 1 = Av M. M = (M Av 1 ) } {{ } =Aa 1 v 1 (M ker ϕ 1 ). So M = Av 1 ker ϕ 1 and M = Aa 1 v 1 (M ker ϕ 1 ). This last equation tells us M ker ϕ 1 is free of rank m 1 since M is free of rank m. If m = 1 then we re done. If m > 1, then we can describe how M ker ϕ 1 sits in ker ϕ 1 by induction on the rank: we have a basis v 2,..., v n of ker ϕ 1 and a 2,..., a m A {0} such that a 2 v 2,..., a m v m is a basis of M ker ϕ 1. Corollary Let A be a PID, M be finite free Amodule, and M be a submodule of M. Then M and M have the same rank if and only if M/M is a torsion module. Proof. Let M have rank n. The module M is free of some rank m n. Using aligned bases for M and M, we can write n m M = Av i and M = Aa j v j i=1 with nonzero a j s. Then M/M = m j=1 A/(a j) n and only if m = n. j=1 i=m+1 3. Finitely generated modules A. This is a torsion module if As an application of aligned bases for a submodule of a finite free module, we describe the structure of every finitely generated module over a PID. Theorem 3.1. Let A be a PID. Every finitely generated Amodule has the form F T where F is a finite free Amodule and T is a finitely generated torsion Amodule. Moreover, T = m j=1 A/(a j) for some m with nonzero a i. Proof. Let M be a finitely generated Amodule, with generators x 1,..., x n. Define f : A n M by f(e i ) = x i. Then there is a surjective linear map A n M, so M is isomorphic to a quotient A n /N. As in the proof of Corollary 2.10, A n /N ( m = j=1 j)) A/(a A n m for some m n and nonzero a j s. The direct sum of the A/(a j ) s is a torsion module and A n m is a finite free Amodule. Example 3.2. Taking A = Z, every finitely generated abelian group is isomorphic to Z n G where n 0 and G is a finite abelian group (a finitely generated torsion abelian group must be finite). Corollary 3.3. Every finitely generated torsion module over a PID A is a direct sum of cyclic torsion modules: it is isomorphic to A/(a 1 ) A/(a k ), where the a i s are nonzero. 3 Warning: if M = M1 M 2 and N M, usually N (N M 1) (N M 2). For example, consider M = Z 2 = Z(1, 0) Z(0, 1) with N = Z(1, 1).
8 8 KEITH CONRAD Some a i s might be units, making A/(a i ) = 0. Proof. Use the description of T in Theorem 3.1. Corollary 2.4 could be regarded as a consequence of Theorem 3.1: a finitely generated module is F T where F is finite free and T is torsion, and being torsionfree as well forces T = 0, so the module is free. When a finitely generated Amodule is written as F T, where F is a finite free submodule and T is a torsion submodule, the choice of F is not unique but T is unique: T is the set of all elements in F T with nonzero annihilator ideal, which is a description that makes no reference to the direct sum decomposition. The best way to see F is not unique is by examples. Example 3.4. Using A = Z, Z Z/(2) has generating set {(1, 0), (0, 1)} and {(1, 1), (0, 1)}. Therefore it can be written as F 1 T 1, where F 1 = (1, 0) = Z and T 1 = 0 Z/(2), and also as F 2 T 2 where F 2 = (1, 1) = Z and T 2 = 0 Z/(2) = T 1. Example 3.5. It can be shown that every unit in Z[ 2] has the form ±(1 + 2) k some choice of sign ±1 and some integer k, so Z[ 2] is a finitely generated abelian group. The torsion subgroup of Z[ 2] is {±1}, while and (1 + 2) each generate different free subgroups that complement {±1}: Z[ 2] = {±1} (1 + 2) Z = {±1} ( (1 + 2)) Z This leads to two isomorphisms of Z[ 2] with Z Z/2Z, which identify different subgroups with Z (the powers of and the powers of (1 + 2)) but both identify the same subgroup {±1} with Z/(2). Example 3.6. It can be shown that Z[ 2, 3] = ±(1 + 2) Z (2 + 3) Z ( 2 + 3) Z, where the units 1 + 2, 2 + 3, and (with respective inverses 2 1, 2 + 3, and 3 2) have no multiplicative relations over Z: if (1 + 2) a (2 + 3) b ( 2 + 3) c = 1 for integer exponents a, b, and c, then a = b = c = 0. Therefore Z[ 2, 3] = Z 3 Z/2Z. Two examples of complements to ±1 in Z[ 2, 3] are 1 + 2, 2 + 3, and 1 + 2, (2 + 3), ( 2 + 3). While the free part of a direct sum decomposition is not unique, the rank of the free part is unique: writing M = F T with F finite free and T necessarily being the torsion submodule M tor of M, we have F = M/T = M/M tor so the rank of F is the rank of the finite free module M/M tor. The rank of a finitely generated module over a PID A is defined to be the rank of its free part, which is welldefined even though the free part itself is not. In downtoearth terms, the rank is the largest number of linearly independent torsionfree elements (over Z, it is the largest number of independent elements of infinite order). Our focus here is describing the abstract structure of a finitely generated module over a PID, not proving a module over a PID arising somewhere in mathematics is finitely generated. The fact that certain abelian groups are finitely generated can be a major theorem (look up the Mordell Weil theorem) and a formula for the rank can be a major theorem or conjecture (see Dirichlet s unit theorem or the Birch and SwinnertonDyer conjecture). 4. Cardinality and Index over a PID A finite abelian group is the same thing as a finitely generated torsion module over Z, so finitely generated torsion modules over a PID are generalizations of finite abelian groups.
9 MODULES OVER A PID 9 Corollary 3.3 provides a method of defining a size for finitely generated torsion modules over a PID as an ideal that generalizes the size of a finite abelian group. Definition 4.1. Let T be a finitely generated torsion module over the PID A. Writing T = A/(a 1 ) A/(a m ), define the Acardinality of T to be the ideal card A (T ) = (a 1 a 2 a m ). This is not the same thing as the annihilator ideal Ann A (T ) = {a A : at = 0}, just as in group theory the order of a finite abelian group is not the same thing in general as the least positive integer whose power kills everything in the group (the exponent of the group). A finitely generated torsion module can be written as a direct sum of cyclic modules in more than one way (including different numbers of cyclic components, e.g., Z/(4) Z/(5) = Z/(20)), so we really need to check Acardinality is welldefined. But first we look at a few examples of Acardinality. Example 4.2. If G is a finite abelian group and G = Z/(a 1 ) Z/(a m ), then card Z (G) = (a 1 a m )Z, whose positive generator is a 1 a m = G. Example 4.3. Let V = R 2, viewed as an R[X]module with X acting on R 2 as the identity matrix. Then, as an R[X]module, we have V is the direct sum of submodules Re 1 Re 2 = R[X]/(X 1) R[X]/(X 1), so cardr[x] (V ) = (X 1) 2 as an ideal in R[X]. Example 4.4. Let V = R 2, viewed as an R[X]module with X acting on R 2 as ( ). Then X(e 1 ) = e 1 and X(e 2 ) = ( 1 1) = e1 + e 2, so {e 2, X(e 2 )} is a basis of R 2. Since X 2 (e 2 ) = 2e 1 + e 2 = 2(e 1 + e 2 ) e 2 = 2X(e 2 ) e 2, so (X 2 2X + 1)(e 2 ) = 0, as an R[X]module V = R[X]/(X 2 2X +1) = R[X]/(X 1) 2. Therefore card R[X] (V ) = (X 1) 2, which is the same ideal as in the previous example. The difference between R[X]/(X 1) R[X]/(X 1) and R[X]/(X 1) 2 as R[X]modules is similar to that between Z/(2) Z/(2) and Z/(4) as abelian groups, which are nonisomorphic but have the same size. Now we show card A (T ) is welldefined. You may want to skip the proof on a first reading. Theorem 4.5. If A/(a 1 ) A/(a m ) = A/(b 1 ) A/(b n ) as Amodules, where the a i s and b j s are nonzero, then (a 1 a 2 a m ) = (b 1 b 2 b n ) as ideals. Proof. If A is a field then the theorem is obvious since both ideals are (1), so we assume A is not a field: it has irreducible elements. For every irreducible π in A, we will show the highest power of π in a 1 a 2... a m and b 1 b 2 b n are equal. Therefore by unique factorization (every PID is a UFD) a 1 a 2... a m and b 1 b 2 b n are equal up to multiplication by a unit, so (a 1 a 2... a m ) = (b 1 b 2 b n ). Set T = A/(a 1 ) A/(a m ). For each irreducible π in A we look at the descending chain of modules T πt π 2 T π i T The quotient of successive modules π i 1 T/π i T is an Amodule on which multiplication by π is 0, so this is an A/(π)vector space. Since T is finitely generated, so is π i 1 T (multiply the generators of T by π i 1 ) and thus so is its quotient π i 1 T/π i T, so π i 1 T/π i T is a finitedimensional A/(π)vector space. The dimensions dim A/(π) (π i 1 T/π i T ) will be the key. We will show the highest power of π in a 1 a 2... a m is i 1 dim A/(π)(π i 1 T/π i T ).
10 10 KEITH CONRAD Step 1: T = A/(a) is a cyclic torsion module. For i 1 we will show dim A/(π) (π i 1 T/π i T ) = { 1, if π i a, 0, otherwise. Since T is generated as an Amodule by 1, π i 1 T/π i T is spanned as an A/(π)vector space by π i 1, so π i 1 T/π i T has dimension 1 over A/(π). It is 0dimensional if and only if π i 1 T = π i T, which is equivalent to π i 1 π i A + (a) = (π i, a). If π i a then (π i, a) (π i ), and obviously π i 1 (π i ), so π i 1 T/π i T is 1dimensional over A/(π). If π i does not divide a then the greatest common divisor of π i and a is π j for some j i 1, and therefore π i 1 (π j ) = (π i, a). Thus dim A/(π) (π i 1 T/π i T ) = #{i 1 : π i a}, i 1 which is the highest power of π dividing a. Step 2: T is any finitely generated torsion module. Writing T = A/(a 1 ) A/(a m ), we have an A/(π)vector space isomorphism π i 1 T/π i T m = π i 1 (A/(a k ))/π i (A/(a k )), so dim A/(π) (π i 1 T/π i T ) = k=1 m dim A/(π) (π i 1 (A/(a k ))/π i (A/(a k ))) k=1 so summing over all i 1 gives us on the right the sum of the highest powers of π in all a k s, which is the highest power of π in a 1 a 2 a m. Step 3: Comparing isomorphic cyclic decompositions. The number dim A/(π) (π i 1 T/π i T ), which does not depend on a cyclic decomposition, is unchanged if T is replaced by an isomorphic Amodule because any Amodule isomorphism T T induces an A/(π)vector space isomorphism π i 1 T/π i T π i 1 T /π i T in a natural way. Therefore a 1 a 2... a m and b 1 b 2 b n are divisible by the same highest power of π, for all π. Example 4.6. We have card A (T ) = (1) if and only if each a i in a cyclic decomposition is a unit, which means T = 0. Example 4.7. For nonzero a A, card A (A/(a)) = (a). (This is trivial only after we know that Acardinality is welldefined.) For nonzero a and b, card A (A/(ab)) = (ab) = (a)(b) = card A (A/(a)) card A (A/(b)). Corollary 4.8. If T is a finitely generated torsion module over A then card A (T ) Ann A (T ), Proof. It is obvious from a cyclic decomposition T = A/(a 1 ) A/(a m ) that multiplication by a 1 a 2 a m kills T, so a 1 a m Ann A (T ), and therefore card A (T ) Ann A (T ). Theorem 4.9. For two finitely generated torsion Amodules T 1 and T 2, card A (T 1 T 2 ) = card A (T 1 ) card A (T 2 ). Proof. Combine cyclic decompositions of T 1 and T 2 to get one for T 1 T 2.
11 MODULES OVER A PID 11 Some properties of card A (T ) that generalize results about orders of finite abelian groups (e.g., Cauchy s theorem) are in the exercises. The notion of index also generalizes from abelian groups to finitely generated modules over a PID, as an ideal. Definition If M is a finitely generated module over the PID A with submodule M such that M/M is a torsion module, we set the Aindex of M in M to be the Acardinality of their quotient: [M : M ] A = card A (M/M ). Example If M M then M = M if and only if [M : M ] A = (1), since M/M = 0 if and only if card A (M/M ) = (1). Example For nonzero a and b in A, [A 2 : aa ba] A = (ab) since A 2 /(aa ba) = A/(a) A/(b). Example Let A = Z[i], ( ) ( ) 1 0 M = Z[i] 2 = Z[i] + Z[i], 0 1 and ( ) ( ) ( ) ( ) M = Z[i] + Z[i] = Z[i]3 + Z[i](1 + 2i) i 0 1 Since M/M = Z[i]/(3) Z[i]/(1 + 2i), [M : M ] Z[i] = (3(1 + 2i)). Using different bases for these two modules, ( ) ( ) 3 1 2i M = Z[i] + Z[i] 1 + 2i 2 and ( ) ( ) 3 1 2i M = Z[i] + Z[i]3(1 + 2i), 1 + 2i 2 so M/M = Z[i]/(3(1 + 2i)). Thus again we compute [M : M ] Z[i] = (3(1 + 2i)). If M is a finite free Amodule and M is a submodule, by Corollary 2.10 the Aindex [M : M ] A is defined if and only if M and M have equal rank. This is also true in the general case (Exercise 7). When A = Z, [M : M ] Z is the subgroup of Z generated by the positive integer #(M/M ), which is the usual index [M : M ], so the Aindex generalizes the index in group theory. Theorem Let M be a finitely generated Amodule with submodules M M and assume M/M is a torsion module. Then Proof. In terms of Acardinalities, this says [M : M ] A = [M : M ] A [M : M ] A. card A (M/M ) = card A (M/M ) card A (M /M ). The ideal card A (M/M ) is defined by hypothesis. Since M /M is a submodule of M/M and M/M is a quotient module of M/M, both are finitely generated torsion modules so card A (M/M ) and card A (M /M ) are both defined. Setting T = M/M and T = M /M, the identity we want to prove becomes This is Exercise 8. card A (T ) = card A (T ) card A (T/T ).
12 12 KEITH CONRAD Any finitefree Zmodule M looks like Z n, and a submodule M also of rank n has finite index in M. We will prove a determinant formula for the index of M in M and then generalize to the case of an arbitrary PID in place of Z. Theorem Let M be a finite free Zmodule with rank n and M be a submodule of M with rank n. Let x 1,..., x n be a basis of M and y 1,..., y n be a basis of M. Writing y j = n i=1 c ijx i with c ij Z, the index [M : M ] equals det(c ij ). Proof. Our proof will be an application of aligned bases in a finite free abelian group and finiteindex subgroup: Theorem 2.9 with A = Z. The ntuples x 1,..., x n and y 1,..., y n do not have the same Zspan (unless M = M), but morally they should have the same Qspan. To make this idea precise, we transfer the data of M and M into the vector space Q n. Let e 1,..., e n be the standard basis of Q n and set f j = n i=1 c ije i, using the same coefficients that express y 1,..., y n in terms of x 1,..., x n. Identify M with Z n by x i e i (extended by Zlinearity). This isomorphism identifies y i with f i, so M inside M is identified with the Zspan of f 1,..., f n inside Z n. Every Zlinear map Z n Z n is determined by where it sends e 1,..., e n. Let ϕ: Z n Z n be the Zlinear map determined by ϕ(e 1 ) = f 1,..., ϕ(e n ) = f n. Then ϕ(e j ) = n i=1 c ije i for j = 1,..., n, so (c ij ) is the matrix representation of ϕ with respect to the standard basis e 1,..., e n of Z n and ϕ(z n ) = Zϕ(e 1 ) Zϕ(e n ) = Zf 1 Zf n, so [M : M ] = [Z n : ϕ(z n )]. We will show [Z n : ϕ(z n )] = det(ϕ) = det(c ij ). The bases e 1,..., e n and f 1,..., f n of Z n are usually not aligned with each other. By Theorem 2.9, there is a set of aligned bases for Z n and its submodule ϕ(z n ): Z n = Zv 1 Zv n, ϕ(z n ) = Za 1 v 1 Za n v n, where the a i s are nonzero integers. Then which tells us Z n /ϕ(z n ) = n Z/a i Z, i=1 (4.1) [Z n : ϕ(z n )] = a 1 a 2 a n. We want to prove det(ϕ) = a 1 a 2 a n too. Any Zlinearly independent set of size n in Q n is a Qbasis of Q n, so all four sets {e i }, {ϕ(e i )}, {v i } and {a i v i } are Qbases for Q n. For any two Qbases of Q n there is a unique Qlinear map Q n Q n taking one basis to the other. The Qlinear map Q n Q n taking e i to ϕ(e i ) is the natural extension of ϕ: Z n Z n from a Zlinear map to a Qlinear map, so we will also call it ϕ (its matrix representation with respect to the standard basis of Q n is (c ij ), just like ϕ as a Zlinear map on Z n ). Consider the diagram of Qlinear maps Q n α Q n ϕ β Q n γ Q n where e i α v i ϕ β f i γ a i v i
13 This diagram commutes: ϕ = γ β α. Q n Q n, 4 (4.2) det(ϕ) = det(γ) det(β) det(α). MODULES OVER A PID 13 Taking determinants of these Qlinear maps Using the Qbasis {v i } of Q n, the matrix representation [β] is diagonal with a i s along its main diagonal, so det(β : Q n Q n ) = a 1 a 2 a n. What is det(α)? The map α identifies two Zbases of the same Zmodule Z n : α(c 1 e c n e n ) = c 1 v c n v n, c i Z. Therefore α is invertible as a Zlinear map of Z n to itself. Using {e i } as the basis in which a matrix for α is computed, the matrices of α: Q n Q n over Q and α: Z n Z n over Z are the same. Since an invertible Zlinear map has determinant ±1, A similar argument shows det(α: Q n Q n ) = det(α: Z n Z n ) = ±1. det(γ : Q n Q n ) = det(γ : ϕ(z n ) ϕ(z n )) = ±1 since γ identifies two Zbases of ϕ(z n ). Feeding these determinant formulas into the right side of (4.2), (4.3) det(ϕ) = ±a 1 a 2 a n. Comparing (4.1) and (4.3), det(ϕ) = a 1 a 2 a n = [Z n : ϕ(z n )] = [M : M ]. Example In the ring Z[ 10] let a be the ideal (2+5 10, ). We will compute the index of a in Z[ 10] as abelian groups by finding Zbases for Z[ 10] and a and then computing the determinant of the matrix expressing the second basis in terms of the first. The Zbases do not have to be aligned to make the calculation. A Zbasis for Z[ 10] is {1, 10}. A Zbasis for a is { , }, but this requires verification because it is a stronger condition to generate a as a Zmodule than to generate it as an ideal: the initial definition of a tells us that a = Z[ 10]( ) + Z[ 10]( ) = (Z + Z 10)( ) + (Z + Z 10)( ) = Z( ) + Z( ) + Z( ) + Z( ). For a to be spanned over Z by and , we need to write the other two Zmodule generators in terms of them. After some linear algebra, we can do this: = 57( ) + 41( ), = 79( ) + 57( ). Therefore a = Z( ) + Z( ) and the numbers and are obviously Zlinearly independent, so they are a Zbasis of a. Under the isomorphism Z[ 10] Z 2 as abelian groups (Zmodules) by a + b 10 ( a b), the ideal a is identified with Z ( ( 2 5) + Z 4 ) 7 = ( )(Z2 ), so Theorem 4.15 tells us that the index of a in Z[ 10] is det( ) = 6 = 6. The absolute value is important: the index is not 6. 4 We are using Qlinear maps throughout because it is nonsense to talk about the determinant of a Z linear map Z n ϕ(z n ) when ϕ(z n ) Z n : the different bases don t all have the same Zspan but they do all have the same Qspan.
14 14 KEITH CONRAD Theorem Let M be a finite free module over the PID A with rank n and M be a submodule with rank n. Let x 1,..., x n be a basis of M and y 1,..., y n be a basis of M. Writing y j = n i=1 c ijx i with c ij A, (det(c ij )) = [M : M ] A. In particular, det(c ij ) 0. Proof. Let K be the fraction field of A. If we run through the proof of Theorem 4.15 with A in place of Z, K in place of Q, and use aligned bases v 1,..., v n and a 1 v 1,..., a n v n for M and M, with all a i nonzero in A, so M/M = n i=1 A/(a i), then the proof of Theorem 4.15 shows det(c ij ) = det ϕ = ua 1... a n, where u = det α det γ is a unit in A. The Klinear operators α and γ on K n have unit determinant since they are also Alinear operators on A n and ϕ(a n ) sending a basis to a basis. By the definition of Aindex, [M : M ] A = card A (M/M ) = (a 1 a 2 a n ). Corollary Let M be a finite free Amodule with rank n and basis x 1,..., x n. For y 1,..., y n in M, write y j = n i=1 c ijx i with c ij A. Then y 1,..., y n is linearly independent if and only if det(c ij ) 0. Proof. If y 1,..., y n is a linearly independent set, then its Aspan in M is a free Asubmodule of rank n, so det(c ij ) 0 by Theorem Conversely, if det(c ij ) 0, then we want to show an Alinear relation n j=1 c jy j = 0 with c j A must have all c j equal to 0. Writing y j in terms of the x i s, ) n n n n 0 = c j y j = c ij x i = c ij c i x i, j=1 j=1 c j ( n i=1 so looking at the coefficients of x 1,..., x n tells us n j=1 c ijc i = 0 for all i. As a matrix equation this says c 11 c c n1 c 1 0 c 12 c c n2 c = 0.. c 1n c 2n... c nn 0 This is an equation in A n K n, where K is the fraction field of A. The matrix is the transpose of (c ij ). Since det((c ji ) ) = det(c ij ) 0 the vector vanishes, so all c i are 0. Corollary If M is a finite free module over the PID A with basis x 1,..., x n, a set of n elements y 1,..., y n in M is a basis of M if and only if the matrix (c ij ) expressing the y s in terms of the x s has unit determinant. Proof. If y 1,..., y n is a basis of M then (det(c ij )) = [M : M] A = (1) by Theorem 4.17, so det(c ij ) A. Conversely, if det(c ij ) A then y 1,..., y n is linearly independent by Corollary 4.18 and the Aindex of Ay j in M is (det(c ij )) = (1), so Ay j = M. Example A set of n vectors v 1,..., v n in Z n is a basis of Z n if and only if the matrix (v 1 v 2 v n ) with the v s as the columns has determinant ±1, since this matrix expresses v 1,..., v n in terms of the standard basis of Z n. Exercises. 1. Let A be a commutative ring. If every submodule of every finite free Amodule is a free Amodule, show A is a PID. c n i=1 j=1
15 MODULES OVER A PID Let A be a commutative ring, M be an Amodule, and f : M A n be an A linear surjection. For the standard basis e 1,..., e n of A n, pick m i M such that f(m i ) = e i. Define the linear maps g : A n M by g(e i ) = m i for all i and h: M A n ker f by h(m) = (f(m), m g(f(m))) for all m M. Show h is an Amodule isomorphism. (Hint on surjectivity: for (x, y) A n ker f let m = g(x) + y. Then h(m) = (x, y).) 3. Suppose A is a PID and π is irreducible in A. Inside A 2, set ( ) ( ) {( ) } 1 0 x M = A + A 0 π 2 = : y 0 mod π 2 y and ( ) ( ) π 1 N = A + A = 0 π {( ) } x : y 0 mod π, πx y mod π 2. y a) Find a basis {e 1, e 2 } of A 2 and a 1 and a 2 in A such that {a 1 e 1, a 2 e 2 } is a basis of N. (Such an aligned pair of bases obviously exists for A 2 and M.) b) Show there is no basis {e 1, e 2 } of A 2 and a 1, a 2, b 1, b 2 in A such that {a 1 e 1, a 2 e 2 } is a basis of M and {b 1 e 1, b 2 e 2 } is a basis of N. That is, the submodules M and N of A 2 do not admit bases simultaneously aligned with a single basis of A If M is a finitely generated module over a PID A and M is a submodule, is it always possible to align their decompositions into free parts and torsion parts: can we write M = F T and M = F T such that F and F are free, T and T are torsion, and F F and T T? If A is not a field, show the answer is no by picking an irreducible π in A and using M = A A/(π) and M = A(π, 1). (Hint: first show M is free.) 5. Let A be a PID. a) Prove an analogue of Cauchy s theorem from group theory: for a finitely generated torsion Amodule T and irreducible π in A such that π divides card A (T ), meaning π divides a generator of the ideal card A (T ), show there is some t T with order π: the annihilator ideal Ann A (t) = {a A : at = 0} is πa. b) Let T and T be finitely generated torsion Amodules such that card A (T ) = card A (T ). If f : T T is an Alinear map, show f is onetoone if and only if it is onto. (When A = Z this is the familiar statement that a homomorphism between finite abelian groups of equal size is onetoone if and only if it is onto.) c) Show a finitely generated Amodule M is a torsion module if and only if there is some a 0 in A such that am = 0. (This is false without a hypothesis of finite generatedness even for A = Z, since infinite torsion abelian groups exist.) d) For a finitely generated Amodule M and submodule N, show M/N is a torsion module if and only if there is some a 0 in A such that am N. 6. Let V be a finitedimensional vector space over a field K and f : V V be an Klinear operator. Viewing V as an K[X]module where X acts on V as the map f, show card K[X] (V ) = (χ f (X)), where χ f is the characteristic polynomial of f. 7. For a pair of finitely generated Amodules M M, show M/M is a torsion module if and only if M and M have the same rank (that means the free parts of M and M have equal rank). This generalizes Corollary 2.10 in the case of free modules.
16 16 KEITH CONRAD 8. Let T be a finitely generated torsion module over the PID A and T be a submodule. Show card A (T ) = card A (T ) card A (T/T ). 9. Prove Corollaries 4.18 and 4.19 when A is an arbitrary integral domain, not necessarily a PID. References [1] J. Rotman, Advanced Modern Algebra, PrenticeHall, Upper Saddle River, NJ, 2002.
Mathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationFOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it
More informationThe Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationFACTORING IN QUADRATIC FIELDS. 1. Introduction. This is called a quadratic field and it has degree 2 over Q. Similarly, set
FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is called a quadratic field and it has degree 2 over Q. Similarly,
More informationGROUP ALGEBRAS. ANDREI YAFAEV
GROUP ALGEBRAS. ANDREI YAFAEV We will associate a certain algebra to a finite group and prove that it is semisimple. Then we will apply Wedderburn s theory to its study. Definition 0.1. Let G be a finite
More informationThe Ideal Class Group
Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned
More informationZORN S LEMMA AND SOME APPLICATIONS
ZORN S LEMMA AND SOME APPLICATIONS KEITH CONRAD 1. Introduction Zorn s lemma is a result in set theory that appears in proofs of some nonconstructive existence theorems throughout mathematics. We will
More informationFactoring of Prime Ideals in Extensions
Chapter 4 Factoring of Prime Ideals in Extensions 4. Lifting of Prime Ideals Recall the basic AKLB setup: A is a Dedekind domain with fraction field K, L is a finite, separable extension of K of degree
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationEXERCISES FOR THE COURSE MATH 570, FALL 2010
EXERCISES FOR THE COURSE MATH 570, FALL 2010 EYAL Z. GOREN (1) Let G be a group and H Z(G) a subgroup such that G/H is cyclic. Prove that G is abelian. Conclude that every group of order p 2 (p a prime
More informationChapter 13: Basic ring theory
Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationISOMETRIES OF R n KEITH CONRAD
ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x
More informationPOLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS
POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).
More informationUNIT 2 MATRICES  I 2.0 INTRODUCTION. Structure
UNIT 2 MATRICES  I Matrices  I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress
More informationUnique Factorization
Unique Factorization Waffle Mathcamp 2010 Throughout these notes, all rings will be assumed to be commutative. 1 Factorization in domains: definitions and examples In this class, we will study the phenomenon
More informationr(x + y) =rx + ry; (r + s)x = rx + sx; r(sx) =(rs)x; 1x = x
Chapter 4 Module Fundamentals 4.1 Modules and Algebras 4.1.1 Definitions and Comments A vector space M over a field R is a set of objects called vectors, which can be added, subtracted and multiplied by
More informationIRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
More information1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]
1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More informationRevision of ring theory
CHAPTER 1 Revision of ring theory 1.1. Basic definitions and examples In this chapter we will revise and extend some of the results on rings that you have studied on previous courses. A ring is an algebraic
More informationGENERATING SETS KEITH CONRAD
GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
More informationADDITIVE GROUPS OF RINGS WITH IDENTITY
ADDITIVE GROUPS OF RINGS WITH IDENTITY SIMION BREAZ AND GRIGORE CĂLUGĂREANU Abstract. A ring with identity exists on a torsion Abelian group exactly when the group is bounded. The additive groups of torsionfree
More informationA number field is a field of finite degree over Q. By the Primitive Element Theorem, any number
Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α K. The minimal polynomial Let K be a number field and
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More information26. Determinants I. 1. Prehistory
26. Determinants I 26.1 Prehistory 26.2 Definitions 26.3 Uniqueness and other properties 26.4 Existence Both as a careful review of a more pedestrian viewpoint, and as a transition to a coordinateindependent
More informationG = G 0 > G 1 > > G k = {e}
Proposition 49. 1. A group G is nilpotent if and only if G appears as an element of its upper central series. 2. If G is nilpotent, then the upper central series and the lower central series have the same
More informationit is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More information11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationsome algebra prelim solutions
some algebra prelim solutions David Morawski August 19, 2012 Problem (Spring 2008, #5). Show that f(x) = x p x + a is irreducible over F p whenever a F p is not zero. Proof. First, note that f(x) has no
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More informationAppendix A. Appendix. A.1 Algebra. Fields and Rings
Appendix A Appendix A.1 Algebra Algebra is the foundation of algebraic geometry; here we collect some of the basic algebra on which we rely. We develop some algebraic background that is needed in the text.
More informationDecember 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in twodimensional space (1) 2x y = 3 describes a line in twodimensional space The coefficients of x and y in the equation
More informationNOTES ON DEDEKIND RINGS
NOTES ON DEDEKIND RINGS J. P. MAY Contents 1. Fractional ideals 1 2. The definition of Dedekind rings and DVR s 2 3. Characterizations and properties of DVR s 3 4. Completions of discrete valuation rings
More informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationBILINEAR FORMS KEITH CONRAD
BILINEAR FORMS KEITH CONRAD The geometry of R n is controlled algebraically by the dot product. We will abstract the dot product on R n to a bilinear form on a vector space and study algebraic and geometric
More informationUniversity of Lille I PC first year list of exercises n 7. Review
University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients
More information4. FIRST STEPS IN THE THEORY 4.1. A
4. FIRST STEPS IN THE THEORY 4.1. A Catalogue of All Groups: The Impossible Dream The fundamental problem of group theory is to systematically explore the landscape and to chart what lies out there. We
More informationFirst and raw version 0.1 23. september 2013 klokken 13:45
The discriminant First and raw version 0.1 23. september 2013 klokken 13:45 One of the most significant invariant of an algebraic number field is the discriminant. One is tempted to say, apart from the
More informationABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair
More informationABSTRACT ALGEBRA. Romyar Sharifi
ABSTRACT ALGEBRA Romyar Sharifi Contents Introduction 7 Part 1. A First Course 11 Chapter 1. Set theory 13 1.1. Sets and functions 13 1.2. Relations 15 1.3. Binary operations 19 Chapter 2. Group theory
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 34 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationProof. The map. G n i. where d is the degree of D.
7. Divisors Definition 7.1. We say that a scheme X is regular in codimension one if every local ring of dimension one is regular, that is, the quotient m/m 2 is one dimensional, where m is the unique maximal
More informationThe determinant of a skewsymmetric matrix is a square. This can be seen in small cases by direct calculation: 0 a. 12 a. a 13 a 24 a 14 a 23 a 14
4 Symplectic groups In this and the next two sections, we begin the study of the groups preserving reflexive sesquilinear forms or quadratic forms. We begin with the symplectic groups, associated with
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationFacts About Eigenvalues
Facts About Eigenvalues By Dr David Butler Definitions Suppose A is an n n matrix An eigenvalue of A is a number λ such that Av = λv for some nonzero vector v An eigenvector of A is a nonzero vector v
More informationUsing determinants, it is possible to express the solution to a system of equations whose coefficient matrix is invertible:
Cramer s Rule and the Adjugate Using determinants, it is possible to express the solution to a system of equations whose coefficient matrix is invertible: Theorem [Cramer s Rule] If A is an invertible
More informationMATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix.
MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. Inverse matrix Definition. Let A be an n n matrix. The inverse of A is an n n matrix, denoted
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 918/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationGROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
More informationMATH 240 Fall, Chapter 1: Linear Equations and Matrices
MATH 240 Fall, 2007 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 9th Ed. written by Prof. J. Beachy Sections 1.1 1.5, 2.1 2.3, 4.2 4.9, 3.1 3.5, 5.3 5.5, 6.1 6.3, 6.5, 7.1 7.3 DEFINITIONS
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationOSTROWSKI FOR NUMBER FIELDS
OSTROWSKI FOR NUMBER FIELDS KEITH CONRAD Ostrowski classified the nontrivial absolute values on Q: up to equivalence, they are the usual (archimedean) absolute value and the padic absolute values for
More informationFACTORING AFTER DEDEKIND
FACTORING AFTER DEDEKIND KEITH CONRAD Let K be a number field and p be a prime number. When we factor (p) = po K into prime ideals, say (p) = p e 1 1 peg g, we refer to the data of the e i s, the exponents
More informationChapter 19. General Matrices. An n m matrix is an array. a 11 a 12 a 1m a 21 a 22 a 2m A = a n1 a n2 a nm. The matrix A has n row vectors
Chapter 9. General Matrices An n m matrix is an array a a a m a a a m... = [a ij]. a n a n a nm The matrix A has n row vectors and m column vectors row i (A) = [a i, a i,..., a im ] R m a j a j a nj col
More information2.1 Functions. 2.1 J.A.Beachy 1. from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair
2.1 J.A.Beachy 1 2.1 Functions from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 21. The Vertical Line Test from calculus says that a curve in the xyplane
More informationIntroduction to finite fields
Introduction to finite fields Topics in Finite Fields (Fall 2013) Rutgers University Swastik Kopparty Last modified: Monday 16 th September, 2013 Welcome to the course on finite fields! This is aimed at
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An ndimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0534405967. Systems of Linear Equations Definition. An ndimensional vector is a row or a column
More information( ) which must be a vector
MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are
More information(January 14, 2009) End k (V ) End k (V/W )
(January 14, 29) [16.1] Let p be the smallest prime dividing the order of a finite group G. Show that a subgroup H of G of index p is necessarily normal. Let G act on cosets gh of H by left multiplication.
More informationCOMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:
COMMUTATIVE RINGS Definition: A commutative ring R is a set with two operations, addition and multiplication, such that: (i) R is an abelian group under addition; (ii) ab = ba for all a, b R (commutative
More informationElements of Abstract Group Theory
Chapter 2 Elements of Abstract Group Theory Mathematics is a game played according to certain simple rules with meaningless marks on paper. David Hilbert The importance of symmetry in physics, and for
More informationSolutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part II: Group Theory
Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN Part II: Group Theory No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Version: 1.1 Release: Jan 2013
More information2.1: MATRIX OPERATIONS
.: MATRIX OPERATIONS What are diagonal entries and the main diagonal of a matrix? What is a diagonal matrix? When are matrices equal? Scalar Multiplication 45 Matrix Addition Theorem (pg 0) Let A, B, and
More informationIntroduction to Algebraic Geometry. Bézout s Theorem and Inflection Points
Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a
More information1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on realclosed fields These notes develop the algebraic background needed to understand the model theory of realclosed fields. To understand these notes, a standard graduate course in algebra is
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More informationCHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
More information4. Matrix inverses. left and right inverse. linear independence. nonsingular matrices. matrices with linearly independent columns
L. Vandenberghe EE133A (Spring 2016) 4. Matrix inverses left and right inverse linear independence nonsingular matrices matrices with linearly independent columns matrices with linearly independent rows
More informationChapter 10. Abstract algebra
Chapter 10. Abstract algebra C.O.S. Sorzano Biomedical Engineering December 17, 2013 10. Abstract algebra December 17, 2013 1 / 62 Outline 10 Abstract algebra Sets Relations and functions Partitions and
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More information4. CLASSES OF RINGS 4.1. Classes of Rings class operator Aclosed Example 1: product Example 2:
4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets
More information4.1 Modules, Homomorphisms, and Exact Sequences
Chapter 4 Modules We always assume that R is a ring with unity 1 R. 4.1 Modules, Homomorphisms, and Exact Sequences A fundamental example of groups is the symmetric group S Ω on a set Ω. By Cayley s Theorem,
More informationLinear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
More information5.1 Commutative rings; Integral Domains
5.1 J.A.Beachy 1 5.1 Commutative rings; Integral Domains from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 23. Let R be a commutative ring. Prove the following
More informationSection 6.1  Inner Products and Norms
Section 6.1  Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More informationFinite Fields and ErrorCorrecting Codes
Lecture Notes in Mathematics Finite Fields and ErrorCorrecting Codes KarlGustav Andersson (Lund University) (version 1.01316 September 2015) Translated from Swedish by Sigmundur Gudmundsson Contents
More informationRINGS WITH A POLYNOMIAL IDENTITY
RINGS WITH A POLYNOMIAL IDENTITY IRVING KAPLANSKY 1. Introduction. In connection with his investigation of projective planes, M. Hall [2, Theorem 6.2]* proved the following theorem: a division ring D in
More informationDiagonal, Symmetric and Triangular Matrices
Contents 1 Diagonal, Symmetric Triangular Matrices 2 Diagonal Matrices 2.1 Products, Powers Inverses of Diagonal Matrices 2.1.1 Theorem (Powers of Matrices) 2.2 Multiplying Matrices on the Left Right by
More information3. Prime and maximal ideals. 3.1. Definitions and Examples.
COMMUTATIVE ALGEBRA 5 3.1. Definitions and Examples. 3. Prime and maximal ideals Definition. An ideal P in a ring A is called prime if P A and if for every pair x, y of elements in A\P we have xy P. Equivalently,
More informationFinite dimensional C algebras
Finite dimensional C algebras S. Sundar September 14, 2012 Throughout H, K stand for finite dimensional Hilbert spaces. 1 Spectral theorem for selfadjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n
More informationx1 x 2 x 3 y 1 y 2 y 3 x 1 y 2 x 2 y 1 0.
Cross product 1 Chapter 7 Cross product We are getting ready to study integration in several variables. Until now we have been doing only differential calculus. One outcome of this study will be our ability
More informationFactorization Algorithms for Polynomials over Finite Fields
Degree Project Factorization Algorithms for Polynomials over Finite Fields Sajid Hanif, Muhammad Imran 20110503 Subject: Mathematics Level: Master Course code: 4MA11E Abstract Integer factorization is
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationFINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROSSHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS
FINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROSSHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS Abstract. It is shown that, for any field F R, any ordered vector space structure
More informationLECTURE 1 I. Inverse matrices We return now to the problem of solving linear equations. Recall that we are trying to find x such that IA = A
LECTURE I. Inverse matrices We return now to the problem of solving linear equations. Recall that we are trying to find such that A = y. Recall: there is a matri I such that for all R n. It follows that
More informationMAT 200, Midterm Exam Solution. a. (5 points) Compute the determinant of the matrix A =
MAT 200, Midterm Exam Solution. (0 points total) a. (5 points) Compute the determinant of the matrix 2 2 0 A = 0 3 0 3 0 Answer: det A = 3. The most efficient way is to develop the determinant along the
More informationSome Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.
Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus ndimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More information(a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular.
Theorem.7.: (Properties of Triangular Matrices) (a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular. (b) The product
More information