Math 4330 Fall 2015 1 Examples of Vector Spaces Examples of Vector Spaces Let F° be an arbitrary field. 1, F™ for 1 > 0 an integer, where F” is the set of n-tuples of elements of F'. Here the vector space structure is the usual one: B. (gs eo 4 ig) # (bys 225 Dy) = (ay HB 2s #b,), for Ge F, be. Db. e(ay,.+.54,) = (cay,...,00,) force. geek FF" for myn > 0 integers. Again the vector space structure is the standard 2. one! a Feria teen ba Ba On M1 aa +| Pet Bae oben Sat Oma baa Oma Oma ait Ou Gat Dae 1+ b1 Maa tao ant Pan Ona + Fant Pray for a,,€F, 5 €F b. Pett Oy i i an Gn Om2 mn bran for ceF, ase F 3. Let Me P™", m,n>0 bea fixed matrix. W = (Ce F™|MC =0}, the solution space for the matrix equation, is a vector space over F as is easily checked, 4, Let S$ be a non-empty set and FS the set of all functions from S to F Addition and scalar multiplication for FS is given as in calculus: a. (f+9)(s) = f(s) +9(s) for f.geF*, seS b. (@f)(s)=af(s) for fe P%, seS,aeF 09/04/15 K, DennisMath 4330 Fall 2015 2 Examples of Vector Spaces ‘The notation F* may appear a bit unusual if you haven't seen it before. For X Y sets we denote hy X" the sot of all functions from Y to X. For finite sets it is easy to check the sizes of the sets satisfy |X¥|=|X|!"1; hence the notation. For arbitrary sets, this yields the definition of powers for cardinal numbers. In addition, one can define a multiplication of two such functions by ©. (F-9)(8) = f(s)-9(s) for f,geP?, ses. . Let S$ be a non-empty set and let FO) be the subset of F* consisting of those functions with finite support. Por a function f: S—> F its support is the set Supp(/) = {s€S | f(s) #0} where it takes on non-zero values. Finite support just means that Supp(f) is a finite set. Addition and scalar multiplication for F() is the same as in F* One can also define multiplication of two such functions as before. Note that this only gives a vector space different from FS in ease the set S is infinite. Let $ be a non-empty set and let V be a vector space over the field F. We denote by V5 the set of all functions from S to V. Addition and scalar multiplication for VS is given as earlier: a. (f +9)(s) = f(s) +9(s) for fgeVS, 56S. b. (af)(s)=af(s) for feV5, seS,aeF Let S be a non-empty set and let V be a vector space over the field F. We denote by V4) the subset of V% consisting of those functions with finite support. Addition and scalar multiplication are the same as in VS Again this gives a vector space different from V* only in case the set S is infinite, . F [x] denotes the set of all polynomials with coefficients in F , treated formally. Addition and scalar multiplication are given by the usual formulas: a. Dibaat + DER bat = DoMa, + ba! for ae F, be F img af = 4 db. e Lia’ = Lip caye' ‘The phrase “treated formally” means that two polynomials in F[x] are equal if and only if their corresponding coefiicients are equal. They are NOT functions. However, we will later show that a function is determined by a polynomial, but it is not true that different coefficients on f and 9 mean one obtains different functions - it depends on the field. A more detailed treatment of this ean be found in the lectures and the exercises. In addition, one can define multiplication in the usual way: 09/04/15 K. DennisMath 4330 Fall 2015 3 Examples of Vector Spaces ©. (DED) (LEP he") = BEG" oat with c,€F given by c;= Dagb, where the sum is taken over all k,d such that i= k+! (that is, the terms which have the same a* are added together). 9. F[ [x] denotes the set of all formal power series with coefficients in F. Addition and scalar multiplication are given by the usual formulas: a. Dino ae" + Dep be" b. eDts aai= Bip As in the previous example, “formal” means that two power series in F[[x]] are equal if and only if all of their corresponding coefficients are equal. Another way to think of this is that there is one-to-one correspondence between F{[2]] and F™ for N the set of non-negative integers. This correspondence does not preserve the multiplication, vse(a,+b,)a* for aeF, be F. ca, Fie] is the subring of F{[2]] consisting of those power series whose coefficients a, are all O for sufficiently lange 7. Elements of F([x]] are NOT functions. For an arbitrary field, they don’t even determine functions. For very special fields, those with a topology, perhaps given hy a metric, one can define a meaning, using convergence (which may or may not happen for a given power series). However, we will normally not consider such here. In addition, one can define multiplication in the usual way: &. (Lie ae") (Lice ba") = DEP gat with c,¢ F given by c,= Dayb, where the sum is taken over all k,l such that i= 4-41 just as for polynomials, ‘The ¢, is given by a finite sum (with i#1 terms) since 4,120. It should again be noted that this is NOT the same multiplication (not the same ring) as example 4, 10. Let F¢ K be fields where the addition and multiplication of elements in F is the same as that when they are considered elements of K'. It is easy to check that A’ is a vector space over F since the required axioms are just a subset of the statements that are valid for the field 1, We thus obtain many examples this way: (1) REC, (ie, C is a vector space over R) (2) QeRsc. (3) QeQfi], (4) Qe Q[v3] (5) 09/04/15 K, DennisMath 4330 Fall 2015 4 Examples of Vector Spaces IL, Let DR where, for example, D = (0,1) is the open interval from 0 to 1, In all cases addition and scalar multiplication are defined as in caleulus (see example d. above). ‘The following are all vector spaces over R: (1) The set of all functions from D to R, (2) The set of all continuous functions from D to R, (3) The set of all differentiable functions from D to R, (4) The set. C"(D), of all functions from D to R, which are differentiable m> 1 times (including the case m =e ). (5) Let f: RR bea function. f is called odd if f(-2) = -f(e) for all weR; f is called even if f(-x) = f(«) for all 2€R. ‘The set of all odd functious is a vector space over IR; the set of all even functions is a vector space over R., 12, Let F bea field, V a vector space over #*, and L: V— V a linear transfor- mation. If f ¢ F{x] isa polynomial of degree n, say f = ay+a,e+--+a,0", we will write f(L) = ay! +a,L+--+2,,L" to mean the linear transformation given by the formule, F(E)(0) = agua L(v) +--+ a,"(0) for any vector v €V. Here Lf means L composed with itself # times (and L° =I, the identity function on V). a. Let F=R be the field of real numbers, V_ the vector space of all infinitely differentiable rea] valued functions defined on R. Take L=D where D+ V— V denotes ordinary differentiation, Dg(x) = g'(x) for any function geV. Now let f R(x] be a polynomial of degree n (as above). ‘Then f(D): V— V isa linear transformation. ‘The set ker( f(D) = (ve V| F(D)(v) = 0} is a subspace of V. ‘This is the set of solutions to the differential equation f(D)(v) =0. For example, if f(x) = «? +1, the corresponding differential equation is D°g(x) + 9(¢) =0 or g(x) + g(x) = 0 (sometimes written as y +y=0). It is easy to check that the functions sinx and cose are both solutions to this equation. b. Let F be afield and F{[]] the ring of formal power series over F, Define D+ Fi{z]) > F[[z]] by D(LEP ae) = TEP tae. It is easy to check that D is a linear transformation which has the usual properties of the derivative, including D(gh) = hD(g) + gD(h) for any g,h € F[[x]]. For a polynomial f = by +bx+-~+0,2" of degree n , we write f(D) byL+b,D+--+b, D", which is also a linear transformation defined on Ff]. Here Dé is the composition of D with itself i times, D°= I, the identity transformation, ker f(D) = (g ¢ F{[x]}| f(D)(g) = 0} is called the set of solutions to the formal homogeneous linear differential equation with constant coefficients, 09/04/15 K. Dennis‘Math 4330 Fall 2015 5 Examples of Vector Spaces 13. Let X be an arbitrary set and let V = P(X) be the set of all subsets of X Let F, = {0,1} be the field with two elements, the integers mod 2. We define an addition on V as follows: for subsets $,7'¢ X.. S+T=SaT where $47 denotes the symmetric difference: the elements that are either in S or in T but not in both (ie, SUT with ST removed). Note that with this definition of addition, V is an abelian group: a, The operation is associative, (Draw the Venn diagram!) b. The empty set is the zero 0 Every element is its own inverse: S+S'=0. ‘The addition is commutative: S4U=SAT=TAS=T+8 = Finally, V is a yector space over the field F, via the only possible definition of inultiplication by scalars: os = 0 1S = Note that V even has a multiplication defined on it: by intersection: S-T=SnT Multiplication is associative, commutative and there is au identity element, namely X. The only element with a multiplicative inverse is the identity X This example is actually an algebra over F, (see the following remark) and is called the boolean algebra of all subsets of X. Some generalizations of such algebras are also called boolean algebras. 10 is relatively easy to show that there is an isomorphism of vector spaces of VRE using the characteristic function x. x(9): XR, is given by 1 ifres xsyee={ 0 ifees. In fact, this fimetion gives an isomorphism of I -algebras Note that sometimes this vector space P(X) is denoted by 2* ‘A mumber of assertions were given without proof in this example, You should verify them. 09/04/15 K. Dennis‘Math 4330 Fall 2015 6 Examples of Vector Spaces Remark 1, In the preceding Examples 2 (when m =n), 4, 8,9, 10, 11, and 13 there is also a multiplication defined. In each case we get what is called an F-algebra, ‘That is, a set F which is a vector space over J’, is a ring, and for which the scalar multiplication and multiplication are compatible, that is, satisty: . cfg) = (fa = F(eg) for all ce F and f,geR In all examples except for matrices (with n> 1), these are commutative F algebras, that is, the multiplication in the ring is commutative. By using an F-algebra A (instead of V7) in Example 6 one could also define a multiplication as in 6, which would yield another example of an F-algebra. See the section “Some Useful Definitions". 09/04/15, K. DennisMath 4330 Fall 2015 id Examples of Vector Spaces History of the Notes ‘The Notes for the course Math 4330, Honors Linear Algebra at Cornell University have been developed over the last ten years or so mainly by the following (in chronological order) Gerhard ©. Michler R. Keith Dennis, Martin Kassabov W. Frank Moore ‘Yuri Berest. Harrison Tsai also contributed number of interesting exercises that appear at the ends of several sections of the notes. Most sections have eon revised so many times the original author may no longer recognize it. The intent is to provide a modern treatement of linear algebra. using consistent terminology and notation. Some sections are written simply to provide a central source of information such as those on “Useful Definitions”, “Subobjects”, and “Universal Mapping Properties” rather than as a chapter as one might find in a traditional textbook. Additionally there are sections whose intent is to provide proofs of some results which are not given in the lectures, but rather provide them as part of a more thorough development of a tangential topic (e.g., Zom’s Lemma to develop cardinal numbers and the existence of bases and dimension in the general case). ‘A large number of challenging exercises from many different sources have been included, Although most should be readily solvable hy students who have mastered the material, a few even more challenging ones still remain. ‘Much still remains to be done. Corrections and suggestions for additional exercises, topics and supplements are always welcome. Keith Dennis e-mail address: [email protected] 09/04/15 K. DennisMath 4330 Pall 2015 1 Subobjects Subobjects A quick summary is given here for a standard “construction” that we use several difforent times. First of all, by “object” we will mean one of the standard types of algebraic structures that are considered in the course: groups, fields, vector spaces, rings, modules, or algebras. (See the section “Some Useful Definitions” for a quick summary of these.) ‘The use of the word construction will appear to most as perhaps not the correct terminology to use, as the method is not constructive, in spite of the fact that it quickly shows, at least mathematically, that the desired object actually cxists. In fact, for many proofs, this idea will be the simplest to use. However, in general it gives no idea whatsoever about actually constructing the elements belonging to the object. We'll address that separately, usually immediately afterwards, in each case. IVs easy to see the pattern of what we do however: 1. Show that the intersection of an arbitrary number of subobjects of the given type it also a subobject of that same type. 2. Apply the preceding statement to the collection of all subobjects that satisfy some specific condition, 3. ‘Take the intersection of this special collection and show that in fact it is the sought-after subobject. 4. Actually construct a natural list of elements that clearly always satisfy the condi- tion and show that this collection is a subobject. Verify that this is the explicit. description of the desired subobject; this usually follows automatically, ‘The first 3 items show the existence of the sought-after subobject while the last gives an explicit. way of obtaining its elements. ‘This is all fairly vague at this point, so we proceed to the specific cases, We will omit a number of proofs as they are easy, and in most cases the proof for any one type of object is similar to that for a different type (which is given), Groups ‘We start with the simplest object, a group, which has only one operation. Definition 1. A subset H of a group G is a subgroup if H is a group with respect, to the same operation * of G. Lemma 2. HCG is a subgroup if and only if 1, H is not empty. 09/04/15 K. DennisMath 4330 Fall 2015 2 Subobjects 2 If hh, EH, then hxh eH, 3. If RCH, then he H Proof. Note that if H is a subgroup, then the conditions must clearly hold. On the other hand, if h € H (by condition 1.), 2“! € H (by 3.), aud hence e= heh"! © H (by 2.). The only conditions left to check (¢.g., associativity) follow immediately as allelements of H are in G. o Lemma 3. Let G be a group and let H,, i€ I be an arbitrary collection of subgroups. Then u=(\H, ict és a subgroup of G. H is the largest subgroup of G which és contained in all of the Hy, iel. Proof. Left. as an exercise. o Definition 4. Let G be a group and let § be a subset of G. The subgroup of @ generated by S is the intersection of all subgroups of G containing S ‘This subgroup is usually denoted by (8). Lemma 5. Let G be a group and let S be a subset of @. 1. The subgroup of G generated by S exists. 2. (8) ={e} for S=@, the empty set. 8. (S) is the set of all finite products t,t, where either 1, or t' isin S for S non-empty. Proof. For the first part, the interseetion of all subgroups of @ which contain S exists by the previous lemma. For S the empty set, then every subgroup of G contains S and the proof is given in the following remark. Finally, if $ is not empty, consider the set X of all finite sequences of the form fy +++ ly where either f, or tj? lies in $. Since $CX, X isnot empty. Clearly the product, of two stich sequences is just another such sequence, so lies in X , and finally since (t,-++t,)71 = 6,1 -+-4)) the inverse of such a sequence is the same sort of sequece and hence in X. That is, we've proven that X is a subgroup of @ which contains 3. Thus (S) CX. On the other hand we must have X C (5) since $C X and all of the products of elements of S and their inverses must lie in (S) since (S) is a subgroup. a Remark 6. If Cis an arbitrary collection of subgroups of G, then by Lemn H =Ngcc¢ is a subgroup of G. We now compute Hf for the two extreme possiiliti for the collection C 09/04/15 K. DennisMath 4330 Fall 2015 3 Subobjects a. If C=@, the empty collection, then H =G b. If C is the set of all subgroups of @, then H = {e}, the trivial subgroup of G ‘The second case is easy to see since the subgrop {e} is contained in every subgroup in @ and further, is one of the subgroups in C’, as C’ contains all subgroups. ‘The first case may appear trickier at first: Note that one can decide what is in an intersection, by equivalently determining what is not in it. An clement 2 is left out of the intersection of a collection precisely when there exists a member ¢ of C’ which does not contain it. But there are no members of C' since Cis the empty collection of subgroups, and hence there are no elements omitted from the collection, Note: The first case, C’ is empty, never arises when applying Definition 4. Why? Vector Spaces Let V be a vector space over the field F Definition 7. A subset W of V is a, subspace if W is a vector space over F with respect to the operations of addition and scalar multiplication for V . Lemma 8. W CV is a subspace if and only if 1. W is not emply. 2. If w,,m, €W, then w, +, €W 3. fae F and weW, then wew. Proof. An easy exercise a ‘There are other versions of this lemma which perhaps look more efficient, but in fact ate not, although they appear in many linear algebra texts, Lemma 9. Let V be a vector space over a field F and let W,, 1 € I be an arbitrary collection of subspaces. Then wen, fel is a subspace of V. Then W is the largest subspace of V which is contained in all of the W,, i€1 Proof. We check the required conditions to verify that W is a subpace: 1. OEW as OEY, forall 1€ 2. Thus W is non-empty. 2. W is closed under addition: If u,v €W, then u,v € W, for all i € I, hence u+v6W, forall i¢ J (because W, is a subspace). Hence, u+0c¢ W. 09/04/15 K. DennisMath 4330 Fall 2015 4 Subobjects 3. W in closed under scalar multiplication: If a € F and u¢ W, then w€ W, for all i€ J. Hence au € W, for all 1 € I (because W, is a subspace). Hence aueW ‘That the subspace W is the largest contained in all W, is clear. [The only part of the argument that ever seems to cause any worries is the case when I is empty. But by logic (or definition if you like), the intersection of an emply collection of subsets of the set V is V itself] o Definition 10. Let V be a vector space over the field F and let $ be a subset of V. ‘The subspace of V sponned by S is the intersection of all subspaces of V containing S. Sometimes one also says “spanned by $ over F* in case one wants to make it, clear which field is involved. We denote this subspace Spanp($), or more simply Span(S) when F is fixed in the etire discussion. H {v,-..,%,} is a finite subset of V and a,,...,0, € 7, then called a linear combination of the vectors v, fray, € Vis Lemma 11. Let V be a vector space over the field F and let S be a subset of V. 1, The subspace of V spanned by 'S exists. 2, Spanp($) = {0} for $=, the empty set. 3. Span,($) is the set of all linear combinations of finite subsets of Sif non-empty. is Proof. Exercise. o Definition 12. Let V be a vector space over the field F and let W,,...,W, be subspaces of V. Then W,+++-+1¥, is the set of all vectors of the form w, ++ -Fw, for w, € W,. This is called the sum of the subspaces W,. See the exercises below to relate the previous definition to span, as well as for a more general definition. Rings ‘We next consider the case of associative rings, Recall that we always assume our ring R has an identity clement, 1. Again, one should read the section “Some Useful Definitions” to see all of the definitions we consider as well as how they are related to each other. Definition 13. A subset 5 of aring is a subring if S is a ring with respect to the operations of aldition and multiplication in R and the identity of $ is the identity of R 09/04/15 K, Dennis‘Math 4330 Fall 2015 5 Subobjects Lemma 14. $C R is a subring if and only if 1. 8 is a subgroup with respect to addition. 2. S és closed under multiplication. a 1e8. Proof. Left as an exercise. o Lemma 15. Let R be a ring and let $,, i € I be an arbitrary collection of subrings. Then S=()5, fel is a subring of R. It is the largest subring of R which is contained in all of the S,, ier. Proof. The only real change in the pattern here is to verify that 1 is in the intersection, and that it is the same 1 as in R, but of course it is, as the corresponding statement for each i holds for S,. ‘The rest is left as an exercise a Definition 16. Let R be a ring and let S be a subset of R. The subring of R generated by $ is the intersection of all subrings of R containing S, and will denoted here by [5]. ‘The idea of the smallest subring generated by a subset is used frequently. However, the notation used here, [S], is not commonly used. Also see the section on R-algebras below Lemma 17. Let R be a ring and let § be a subset of R. 1. The subring of R. generated by S exists. 2. [S] = (1) where Tis the subset consisting of all finite products of elements from {1}US, where (T) is the additive subgroup generated by T . Proof. Exercise, o Note that in particular [S] = (1), the additive subgroup generated by 1, in case $ is empty. The result may be slightly different from what you expected due to the requirement that rings have an identity element. 09/04/15 K. DennisMath 4330 Fall 2015 4 Subobjects Fields ‘We next consider the case of fields. Definition 18. A subset K ofa field F is a subfield if K is a field with respect to the operations of addition and multiplication of F’. For K a field, we denote by K* the subset K\ {0}, ie. K with 0 removed. Lemma 19. K C F is a subfield if and only éf 4. K is a subgroup of F with respect to addition, and 2. K* is a subgroup of F* with vespect to multiplication. Proof. The conditions listed are certainly necessary. ‘The identity of any subfield is the same as the identity of the containing field: 1'-1/ = 1/-1 and since ' £0 and a field is a domain (no produet of two elements is 0 unless at least one of the factors is 0) it follows that 1/=1. Applying Lemma 14, we see that additionally we only need check that every non-zero element of 1 has a multiplicative inverse. This is asserted by the last condition. ‘That the distributive law holds for elements of KC follows from. the fact that it holds in the larger field F’. o Lemma 20. Let F be a field and let K,, 1 € I be an arbitrary collection of subfields. Then K=()K, ict is a subfield of F. It is the largest subfield of F which is contained in all of the K,, iel. Proof. The proof follows exactly the same pattern as earlier ones and is left as an exercise. It can be shortened a bit by applying the result for rings first. a Definition 21. Let F be a field and let S be a subset of F. The subfield of generated by $' is the intersection of all subfields of F containing 5. ‘The subfield generated by $ is the smallest subfield containing S. This idea is used frequently. See the section on R-algebras below. Lemma 22. Let F be a field and let $ be a subset of F. 1. The subfield of F generated by 8 exists. 2. Insert correct description of the elements. [Brercise 7.] Proof. ‘The last statement differs slightly from the case of rings since inverses must exist in a field. Other than that, the proof is similar to previous cases and left as an exercise. o 09/04/15 K. Demis‘Math 4330 Fall 2015 7 Subobjects Note that in particular that the smallest subficld is (1) -(1)~' in case S' is empty, where (1)! denotes the set of inverses of the non-zero elements in (1). This smallest, subfield of J is called the prime subfield (mentioned eaulier in the paragraph after Remark 8 in the section on “Fields”) R-Modules This is getting a bit repetitive by now, perhaps boring, but we hope, very easy. Write your own version of this section, with details! R-Algebras A complete section on R-algebras for Fa commutative ring (with 1), would include many repetitions as well. ‘That will be left as an exercise. However, instead we'll give here some typical applications which are the main ones used (in fact, they were used earlier!) in this course, Note that there is a natural R-algebra homomorphism r+ 1, where 1 denotes the identity of A. Recall that thi all algebraic structure: R— A given by i(r) = just means that i preserves. irs) = ar) Fils) itrs) = ar)ils) ifr-s) = r-i(s) ‘This holds for all r,s € R, The - on the left side of the last equation is just ordinary multiplication in R, but the one on the right is from the module structure of A For most of our applications, we'll assume that 4 is a one-to-one function. ‘That is, we can use i to identify R with a subring of A. Now let A be an R-algebra and let S be a subset of A. The R-algebra generated by $ will be denoted by R[S] — it is just the smallest subset of A which is a ring (so contains 1), an R-module (so contains 2), and contains $'. it can be described as Spang(T) where 7’ is the set of all finite products of elements of § (note the missing definition of span over rings! ‘What is it?) Earlier in the course examples of fields of the form Q[y2} or Qfi] were given. These are just applications for R=Q, A=C and S= {V2} or S= {i}. Similarly for Qlv3, v3) as well as LY}. ‘There is another standard notion that: is commonly in use which should be mentioned here. As in the preceding examples, we assume that we have fields F CK’, where the F is a subfield of K. Then K is an F-algebra. For $C iC an arbitrary subset, F{S] denotes the F-subalgebra of K generated by S. Since K is a field, there also exists a smallest subfield of K which contains both F and $' (it’s the smallest, subfield containing $ which is also an F-algebra). This is denoted by F(S). Now F(S| © F(S), but the two are not always equal. As an exercise, you'll later prove that they are equal in case F[S] has finite dimension over F’, 09/04/15 K. DennisMath 4330 Fall 2015 8 Subobjects Remark 23. One important case where é defined above is not one-to-one, is the case of i: Z—+ F, for F afield. See the discussion on the characteristic of a field F in the section “Fields”. The kernel of i (keri = {k € Z | i(k) =0}) is used to define char F: it is the smallest positive integer in keri if keri # {0} and it is 0 when ker ‘That is, it is the non-negative integer d which generates the ideal keri =(d)={jd |G EZ}. 09/04/15 K. DennisMath 4330 Pall 2015 9 Subobjects Exercises SubObj 1. Verify Lemma 8 SubObj 2. Let F be a field and V a vector space over F. Verify that for a subset W of V, then W is a subspace of Vif and only if both of the following hold: 1. W is not empty and 2. for all w,, w, in W and a€ F, then w,—aw, €W. Give two reasons why the preceding is neither more efficient nor nicer than the defini- tion given in Lemma 8. SubObj 3. Verify that the sum of subpaces which appears in Definition 12 is in fact a subspace of V. SubObj 4. Verify Lemma 11 SubObj 5. Let W,, i € I be a collection of subspaces of the vector space V ove the field F. Define SOW, = Span, (Um). ‘ar er Verify that for I finite this yields the same as Definition 12. SubObj 6. Let V be a vector space over the field /. Assume W is a subspace of V and S, S,, i€ J are arbitrary subsets. Verify the following: 1. Spany(W) = W. 2. Spang(Span -($)) = Spany(S) 3. Spanp(L)S) = > Spanp(S) a ‘al 4. Spany((]§,) ©] Spang(S,) - Bquality may not hold; give an explicit example _ ied of this. SubObj 7. Give a careful description of the set of elements in the smallest subfield of afield F which is generated by a set of elements (analagous to, but a bit different from, that given in Lemma 17). SubObj 8. Let K bea field and S a subset, Let F be the prime subfield of Show that the field of fractions of F[S] is naturally isomorphic to F(S) SubObj 9. Write complete version of the section for R-modules following the pat terns you've seen above, SubObj 10. Write a complete version of the section for R-algebras. 09/04/15 K. DennisMath 4330 Pall 2015 10 Subobjects: History of the Notes ‘The Notes for the course Math 4830, Honors Linear Algebra at Cornell University have been developed over the last ten years or so mainly by the following (in chronological order): Gerhard O. Michler R. Keith Dennis Martin Kassabov W. Frank Moore Yuri Berest, Harrison ‘Tsai also contributed a mumber of interesting exercises that appear at the ends of several sections of the notes. Most sections have been revised so many times the original author may no longer recognize it. ‘The intent is to provide a modem treatement of linear algebra using consistent terminology and notation. Some sections are written simply to provide a central source of information such as those on “Useful Definitions”, “Subobjects” and “Universal Mapping Properties” rather than as a chapter as one might find in a traditional textbook. Additionally there are sections whose intent is to provide proofs of some results which are not given in the lectures, but rather provide them as part of a more thorough development of a tangential topic (e.g., Zorn’s Lemma to develop cardinal numbers and the existence of bases and dimension in the general case). A large number of challenging exercises from many different sources have been included. Although most should be readily solvable by students who have mastered the material, a few even more challenging ones still yemain Much still remains to be done. Corrections and suggestions for additional exercises, topics and supplements are always welcome. Keith Dennis e-mail address: [email protected] 09/04/15 K. DennisMath 4330 Fall 2015 1 Homework Set 2 Math 4330 Homework Set 2 ‘Due Friday, September 12, 2015 Keith Dennis Malott 524 255-4027 [email protected] TA: Goutam Gopal Krishnan 120 Malott Hall [email protected] Read: Handouts on “Some Useful Definitions” , “Fields”, “Examples of Vector Spaces”, and ‘“Subobjects”, Problems marked by [box] or [#] are move challenging and may be turned in anytime during the semester. ‘There will be several such problems assigned during the term. Please turn in separately from routine assignments — if incorrect or incomplete, they will be returned to you to complete correctly. Final deadline is Monday, Nov. 1, no exceptions. Do the following problems from the handouts: Fields 15 Fields 26 Fields 27 SubObj 3 SubObj 5 SubObj 6 SubObj 7 (compare to Fields 7) 09/04/15 K. Dennis