LECTURE NOTES, 11/10/04
|
|
- Octavia Marybeth Evans
- 5 years ago
- Views:
Transcription
1 LECTURE NOTES, 11/10/04 Cotets 1. Direct sum decompositios 1 2. Geeralized eigespaces 3 3. The Chiese remaider theorem 5 4. Liear idepedece of geeralized eigespaces 8 1. Direct sum decompositios Defiitio 1.1. Let V be a F vector space. Let W = (W 1,..., W s ) be a ordered s tuple of vector subspaces of V. (i) A ordered s tuple of vectors i W, (w 1,..., w s ), is a ordered s tuple of vectors i V such that for every i = 1,..., s, w i W i. (ii) The ordered s tuple W is liearly idepedet if the oly ordered s tuple of vectors i W, (w 1,..., w s ), satisfyig w w s = 0 is (0,..., 0). (iii) The ordered s tuple W spas V, or is spaig, if for every vector v V, there exists a ordered s tuple of vectors i W, (w 1,..., w s ), satisfyig w w s = v. (iv) The ordered s tuple W is a direct sum decompositio of V if it is liearly idepedet ad spas V. Remar 1.2. Please do ot cofuse the otio of liearly idepedet (resp. spaig) collectio of subspaces of V with the otio of liearly idepedet (resp. spaig) collectio of vectors i V. These are closely related, but differet. Propositio 1.3. A ordered s tuple of subspaces of V, W = (W 1,..., W s ), is liearly idepedet iff for every ordered s tuple (B 1,..., B s ) of liearly idepedet ordered subsets B i W i, the cocateatio B = B 1 B s is a liearly idepedet ordered subset of V. Proof. ( ) Assume W is liearly idepedet. For every i = 1,..., s, defie e i = #B i, which is 0 Bif i is empty. Defie e = e e s. For every i = 1,..., s such that e i > 0, deote B i = (w (i,1),..., w (i,ei)). If e = 0, the B =. Otherwise, by defiitio, B is the uique ordered set of vectors B = (v 1,..., v e ) such that for every i = 1,..., s with e i > 0 ad every 1 j e i, v e1+ +e i e i+j = w (i,j). If B =, it is vacuously liearly idepedet. Thus assume e > 0. Let (c 1,..., c e ) be a liear relatio amog B. For every i = 1,..., s with e i > 0 ad every 1 j e i, defie c (i,j) = c e 1+ +e i e i+j. If e i = 0, defie w i = 0. If e i > 0, defie w i = c (i,1) w (i,1) + + c (i,ei)w (i,ei). The, e e i s 0 = c w = ( c e1+ +e i e i+jw e1+ +e i e i+j) = w i. =1 1 i s,e i>0 j=1 i=1 1
2 For every i = 1,..., s, because W i V is a vector subspace, w i W i, i.e., (w 1,..., w s ) is a ordered s tuple of vectors i W. Because W is liearly idepedet ad because w w s = 0, w 1 = = w s = 0. So for every i = 1,..., s with e i > 0, (c (i,1),..., c (i,ei)) is a liear relatio amog B i. By hypothesis, B i is liearly idepedet. Therefore c (i,1) = = c (i,ei) = 0. So for every i = 1,..., s such that e i > 0, ad for every 1 j e i, c (i,j) = 0, i.e., the liear relatio (c 1,..., c e ) is (0,...,0). Sice the oly liear relatio amog B is the trivial liear relatio, it is liearly idepedet. ( ) Assume that for every ordered s tuple (B 1,..., B s ) of liearly idepedet ordered subset B i W i, the cocateatio B = B 1 B s is a liearly idepedet ordered subset of V. Let (w 1,..., w s ) be a ordered s tuple of elemets i W. For every i = 1,..., s, if w i = 0, defie B i =, otherwise defie B i = (w i ). Each B i W i is a liearly idepedet subset. By costructio, B = (w i 1 i s, w i = 0). By hypothesis, this is liearly idepedet. B If is oempty, the, s 0 = w i = w i. i=1 w i B Therefore (1,...,1) is a otrivial liear relatio amog B. This cotradictio proves that B is empty, i.e., w 1 = = w s = 0. Therefore W is liearly idepedet. Propositio 1.4. A ordered s tuple of subspaces of V, W = (W 1,..., W s ), spas V iff for every ordered s tuple (B 1,..., B s ) of spaig subsets B i W i, the uio B = B 1 Bs is a spaig set for V. Proof. ( ) Assume W spas V. Let v V be ay vector. If v = 0, by covetio it is i spa( B) (eve if B = ). Assume v = 0. Because W is spaig, there exists a ordered s tuple of vectors i W, (w 1,..., w s ), such that v = w w s. For every i = 1,..., s with w i = 0, because B i is a spaig set for W i, there exists e i > 0, vectors w (i,1),..., w (i,ei) B i ad scalars c (i,1),..., c (i,ei) F such that w i = c (i,1) w (i,1) + + c (i,ei)w (i,ei). The the followig collectio of vectors is a collectio i B, For the choice of coefficiets, (w (i,j) 1 i s, w i = 0, 1 j e i ). (c (i,j) 1 i s, w i = 0, 1 j e i ), the liear combiatio of these vectors B i is, 1 i s, w i = 0w i = v. So v spa(b). ( ) Assume that for every ordered s tuple (B 1,..., B s ) of spaig subsets B i W i, the uio B is a spaig set for V. For i = 1,..., s, defie B i = W i. This is certaily a spaig subset of W i. By hypothesis, B = W 1 Ws is a spaig set for V. Let v V be a vector. If v = 0, the (0,..., 0) is a ordered s tuple of vectors i W such that v = Therefore assume v = 0. Because B is a spaig 2
3 set for V, exists a iteger e > 0, ozero vectors v 1,..., v e B, ad scalars c 1,..., c e F such that, v = c 1 v c e v e. For every j = 1,..., e, let 1 i(j) s be a iteger such that v j W i(j) ; because B = W 1 Ws, there is at least oe such i(j). For every i, if i(j) = i for every j = 1,..., e, defie w i = 0. Otherwise defie, w i = c j v j. 1 j e,i(j)=i For every i = 1,..., s, because W i V is a vector subspace, w i W i. (w 1,..., w s ) is a ordered s tuple of vectors i W. Ad, e s s v = c j v j = ( c j v j ) = w i. Therefore W spas V. j=1 i=1 j,i(j)=i i=1 Thus Propositio 1.5. A ordered s tuple of subspaces of V, W = (W 1,..., W s ), is a direct sum decompositio of V iff for every ordered s tuple (B 1,..., B s ) of bases B i for W i, the uio B = B 1 B s is a basis for V. Proof. This follows from Propositio 1.3 ad Propositio Geeralized eigespaces Defiitio 2.1. Let T : V V be a liear operator. For every iteger 0, the th iterate of T is the liear operator T : V V recursively defied by T 0 = Id V, ad T +1 = T T. For every polyomial f(x) = a x + + a 1 x + a 0 F[x], the associated liear operator, f(t ) : V V, is defied to be f(t ) = a T + + a 1 T + a 0 Id V. Propositio 2.2. (i) For every pair of polyomials f(x), g(x) F[x], f(t ) + g(t ) = (f + g)(t ). (ii) For every polyomial f(x) F[x] ad every scalar a F, a (f(t )) = (a f)(t ). (iii) For every pair of polyomials f(x), g(x) F[x], f(t ) g(t ) = (f g)(t ) = g(t ) f(t ). Proof. (i) Let f(x) = a x + +a 1 x+a 0 ad let g(x) = b x + +b 1 x+b 0. By defiitio of polyomial additio, f + g = (a + b )x + + (a 1 + b 1 )x + (a 0 + b 0 ). By defiitio of the associated liear operator, (f + g)(t ) = (a + b )T + + (a 1 + b 1 )T + (a 0 + b 0 )Id V. By associativity ad commutativity of additio of operators, ad by distributivity of scalar multiplicatio of operators ad additio of operators, this equals, (a T + + a 1 T + a 0 Id V ) + (b T + + b 1 T + b 0 Id V ). By defiitio of the associated liear operator, this f(t is )+g(t ), i.e., (f+g)(t ) = f(t ) + g(t ). (ii) Let f(x) = a x + +a 1 x+a 0. By defiitio of scalar product of polyomials, a f(x) = (aa )x + + (aa 1 )x + (aa 0 ). By defiitio of the associated liear operator, (a f)(t ) = (aa )T + + (aa 1 )T + (aa 0 )Id V. 3
4 By distributivity of multiplicatio of scalars ad scalar multiplicatio of operators, this is, a (a T ) +... a (a 1 T ) + a (a 0 Id V ). By distributivity of scalar multiplicatio of operators ad operator additio, this is, a (a T + + a 1 T + a 0 Id V ). By defiitio of the associated liear operator, this a is (f(t )), i.e., (a f)(t ) = a (f(t )). (iii) The claim is that for every pair of itegers m, 0, T m T = T m+. This is proved by iductio o m. For m = 0, T 0 = Id V so that T 0 T = Id V T = T = T 0+. Thus assume m > 0 ad assume the result is true for smaller values of m. By the recursive defiitio, T m T = (T T m 1 ) T. By associativity of compositio of liear trasformatios, (T T m 1 ) T = T (T m 1 T ). By the iductio hypothesis, T m 1 T = T m 1+. Therefore T m T = T T m 1+. By the recursive defiitio, T m+ = T T m 1+, i.e., T m T = T m+. So the claim is proved by iductio o m. I particular, sice m + = + m, T m T = T m+ = T +m = T T m. Let f(x) = a m x m + + a 1 x + a 0 ad let g(x) = b x + + b 1 x + b 0. Let N = max(m, ). For i > m, defie a i = 0. For j >, defie b j = 0. By defiitio of polyomial multiplicatio, N (f g)(x) = ( a i b i )x. =0 i=0 By defiitio of the associated liear operator, (f g)(t ) = ( a i b i )T. =0 i=0 By the claim above, T = T i T i. Together with commuativity, associativity ad distributivity, the formula above is, ( a i b i T i T i ) = ( (a i T i ) (b i T i )). =0 i=0 =0 i=0 By distributivity of additio ad compositio of liear trasformatios, this is, m ( a i T i ) ( b j T j ). i=0 j=0 By the defiitio of the associated liear operator, this f(t is ) g(t ), i.e., (f g)(t ) = f(t ) g(t ). Defiitio 2.3. For every liear operator T : V V ad every polyomial f(x) F[x], the associated geeralized eigespace is E T,f = er(f(t )). For every λ F ad every iteger 0, the th geeralized λ eigespace is E () = E T,(x λ). Propositio 2.4. (i) For every pair of polyomials f(x), g(x) F[x], E T,f E T,g E T,f+g. (ii) For every polyomial f(x) F[x] ad every scalar a F, E T,f E T,a f. If a 0, the E T,f = E T,a f. 4
5 (iii) For every pair of polyomials f(x), g(x) F[x], E T,f + E T,g E T,f g. Proof. (i) For every v E T,f E T,g, f(t )(v) = g(t )(v) = 0. By Propositio 2.2(i), (f + g)(t )(v) = f(t )(v) + g(t )(v) = = 0. Therefore v E T,f+g, i.e., E T,f E T,g E T,f+g. (ii) For every v E T,f, f(t )(v) = 0. By Propositio 2.2(ii), (a f)(t )(v) = a (f(t )(v)) = a 0 = 0. Therefore v E T,a f, i.e., E T,f E T,a f. If a = 0, the f = a 1 (a f) so that also E T,f E T,a f, i.e., E T,f = E T,a f. (iii) For every v E T,f, f(t )(v) = 0. By Propositio 2.2(iii), (f g)(t )(v) = (g f)(t )(v) = (g(t ) f(t ))(v) = g(t )(f(t )(v)) = g(t )(0) = 0. So v E T,f g, i.e., E T,f E T,f g. By the same argumet, E T,g E T,f g. Because E T,f g is a vector subspace, E T,f + E T,g E T,f g. Corollary 2.5. For every λ F, {0} = E(1) V. E (0) E(2) Proof. For every iteger, by Propositio 2.4(iii), E () = E T,(x λ) E T,(x λ) +1 = E (+1). Defiitio 2.6. For every λ F, the geeralized λ eigespace is E ( ) = 0E (). Propositio 2.7. For every λ F, the geeralized λ eigespace E ( ) is a vector subspace of V. Proof. Because {0} = E (0) E ( ), the subset E( ) is oempty. For every v, w E ( ), there exist itegers m, 0 such that v E(m) ad w E (). Let N = max(m, ). By Corollary 2.5, E (m) E(N). Sice E (N), E() is a vector subspace, v + w E (N) E ( ), i.e., E( ) is stable uder additio of elemets. By a similar argumet, E ( ) is stable uder scalar multiplicatio of elemets. So E ( ) is a vector subspace of V. 3. The Chiese remaider theorem Aciet Chiese geerals discovered a beautiful ad efficiet method for coutig large umbers of soldiers very quicly a tas of great importace i determiig the umber of losses after a battle. Let 1,..., s be itegers such that for every 1 i < j s, the pair of itegers i, ( j ) have o commo factor. For every i = 1,..., s have the N soldiers lie up i rows of size i. Do ot cout the umber of rows! Istead, cout the remaider i, i.e., the umer of soldiers who caot lie up i a row of size i. There exist itegers a 1,..., a s depedig oly o 1,..., s such that for every iteger N, N is cogruet to a 1 r a s r s, modulo 1 s. If 1 = 10, 2 = 11, 3 = 13, the umbers are a 1 = 429, a 2 = 650, a 3 = 220, so that N = 429r r 2 200r 3, modulo These may seem lie large umbers, but it is much faster for a mathematicia to compute the product o a abacus tha to cout the soldiers by brute force. Sice the geeral presumably ows the umber of soldiers to withi a rage ±715, of this method allows the geeral to compute precisely the umber of soldiers very quicly. We will use the same 5
6 method to prove that for distict λ 1,..., λ s F, the ordered s tuple of geeralized eigespaces, W = (E ( ),..., E ( ) 1 s ), is liearly idepedet. Defiitio 3.1. For a s tuple of polyomials i F[x], (f 1,..., f s ), ot all zero, a greatest commo factor is a polyomial f(x) of maximal degree such that f(x) divides f i (x) for every i = 1,..., s. If f 1 = = f s = 0, the greatest commo factor is defied to be 0. A s tuple of polyomials (f 1,..., f s ) is coprime if there exist polyomials (g 1,..., g s ) such that 1 = g 1 f gs f s. Theorem 3.2 (The Chiese remaider theorem). A s tuple of polyomials (f 1,..., f s ) is coprime iff 1 is a greatest commo factor. Proof. ( ) Assume (f 1,..., f s ) is coprime, i.e., 1 = g 1 f gs f s. Let f be ay commo factor of f 1 (,..., f s ). For every i, because f i is divisible by f, also g i f i is divisible by f. Because every g i f i is divisible by f, the sum g 1 f g s f s is divisible by f, i.e., 1 is divisible by f. But the oly polyomials dividig 1 are ozero costats. Thus 1 is a greatest commo factor 1, of..(f., f s ). ( ) Assume 1 is a greatest commo factor fof 1,..., f s. The claim is that 1, (f..., f s ) is coprime. This will be proved by iductio s. o If s = 1, the f 1 is a greatest commo factor of f( 1 ). Sice also 1 is a greatest commo factor, fdeg( 1 ) = 0, i.e., f 1 is a scalar. By defiitio, the greatest commo factor of (0) is f 1 0, is so ozero. Sice F is a field, there exists a scalar g 1 such that 1 = f 1, i.e., (f 1 ) is coprime. Next assume s = 2. If ecessary, permute f 1 ad f 2 so that deg(f 1 ) deg(f 2 ). By hypothesis, 1 is a greatest commo factor of 1, (f f 2 ). If f 2 = 0, the 1 is a greatest commo factor of f( 1 ) ad by the last case there exists g 1 such that 1 = g 1 f 1. Puttig g 2 = 0, 1 = g 1 f 1 + g 2 f 2, i.e., (f 1, f 2 ) is coprime. Therefore assume f 2 = 0, which implies f 1 = 0. The claim i this case will be proved by iductio o deg(f 2 ). If deg(f 2 ) = 0, i.e., if 2 is a ozero scalar, there exists a ozero scalar g 2 such that 1 = g 2 f 2. Settig 1 = 0, 1 = g 1 f 1 + g 2 f 2. Thus, by way of iductio, assume deg(f 2 ) > 0 ad assume the result is ow for smaller values of deg(f 2 ). By the divisio algorithm, there exist polyomials q(x) ad r(x) with deg(r) < deg(f 2 ) such that f 1 (x) = q(x)f 2 (x) + r(x). If h is a commo factor of 2, (fr), the h is also a factor of qf 2 ad so of the sum qf 2 + r, i.e., h is a commo factor of (f 1, f 2 ). Coversely, if h is a commo factor of 1, (ff 2 ), the h is a commo factor of qf 2 ad so of the sum f 1 + ( qf 2 ), i.e., h is a commo factor of 2, (fr). So the commo factors of 1, (ff 2 ) are precisely the commo factors of f 2, ( r). By hypothesis, 1 is a greatest commo factor of 2, r). (f Sice deg(r) < 0, by the iductio hypothesis there exist polyomials g 1, g 2 such that 1 = g 1 f 2 +g 1 r. Defie g 1 = g 2 ad g 2 = g 1 qg 2. The, g 1 f 1 + g 2 f 2 = g 2 (qf 2 + r) + (g 1 qg 2 )f 2 = g 1 f 2 + g g 1 2r = 1. So (f 1, f 2 ) is coprime. So the claim is proved by iductio o deg(f 2) if s = 2. By way of iductio, assume s > 2 ad the result is ow for smaller s. Let h be a greatest commo factor of 1, (f..., f s 1 ). The 1 is a greatest commo factor of (f 1 /h, dots, f s 1 /h). By the iductio hypothesis, there exist elemets g 1,..., g s 1 such that, 1 = g 1 (f 1 /h) + + g s 1 (f s 1 /h), 6
7 i.e., h = g 1 f g s 1f s 1. The greatest commo factor of 1, (f..., f s 1, f s ) is the greatest commo factor of (h, f s ). By hypothesis, 1 is a greatest commo factor h, of f s ). ( By the case s = 2 above, there exist elemets g 1, g 2 such that 1 = g 1 h + g 2 f s. Defiig g 1 g 1 g 1 g 1 = g 1, g 2 = g 2,..., g s 1 = g s 1 ad defiig g s = g 2, g 1 f g s 1 f s 1 + g s f s = g 1 (g s 1f s 1 ) + g 1 h + g 1 f g 2 f s = g 2 f s = 1. So (f 1,..., f s ) is coprime. The theorem is proved by iductio s. o Corollary 3.3. Let s 2 ad let (f 1,..., f s ) be ozero polyomials. For every i = 1,..., s, defie, r i (x) = f j (x). 1 j s,j=i If for every 1 i < j s, 1 is a greatest commo factor (f of i, f j ), the (r 1,..., r s ) is coprime. Proof. By Theorem 3.2, it suffices to prove that 1 is a greatest commo factor of (r 1,..., r s ). This will be proved by iductio s. o For s = 2, (r 1, r 2 ) = (f 2, f 1 ). By hypothesis, 1 is a greatest commo factor. Thus, by way of iductio, assume s > 2 ad the result is ow for smaller values s. of Cosider the sequece (f 1,..., f s 1 ). The hypothesis holds for this collectio. For every i = 1,..., s 1, deote r i = f j. 1 j s 1,j=i By the iductio hypothesis, 1 is a commo factor of 1,..(r., r s 1 ). Therefore f s is a greatest commo factor of f s r( 1,..., f s r s 1) = (r 1,..., r s 1 ). So the commo factors of (r 1,..., r s 1, r s ) are the commo factors of s, (f r s ) = (f s, f 1 f s 1 ). Let h be a irreducible commo factor of s, (ff 1 f s 1 ). Because h is irreducible ad divides f 1 f s 1, there exists 1 i s 1 such that h divides f i, i.e., h is a commo factor of (f i, f s ). By hypothesis, 1 is a greatest commo factor i, of f s (f ). Therefore h is a ozero scalar. So for every commo factor h of (f s, f 1 f s 1 ), every irreducible factor of h is a ozero scalars, i.e., h is a ozero scalar. Therefore 1 is a greatest commo factor of 1, (r..., r s ). The corollary is proved by iductio o s. Corollary 3.4. For every s tuple of distict scalars λ 1,..., λ s F ad every iteger > 0, for every i = 1,..., s defie, r i (x) = (x λ j ). The (r 1,..., r s ) is coprime. 1 j s,j=i Proof. For every 1 i < j, 1 is a greatest commo factor of (x λ i ) ad (x λ j ). To see this, first observe, 1 = (x λ i )/(λ j λ i ) + (x λ j )/(λ i λ j ). Raisig both sides to the power 2 1 ad usig the biomial theorem gives, ( ( ) ) 1 = = i=1 ( 1) i (x λ i ) 1 i (x λ j ) i /(λ j λ i ) 2 1 (x λ i ) ( i 2 1 ( ) ) i= ( 1) i (x λ i ) 2 1 i (x λ j ) i /(λ j λ i ) 2 1 (x λ j ) i. 7
8 I other words, ((x λ i ), (x λ j ) ) is coprime. By the easy part of Theorem 3.2, 1 is a greatest commo factor. 4. Liear idepedece of geeralized eigespaces Let s 2 be a iteger. Let λ 1,..., λ s F be distict, ad let > 0 be a iteger. Defie r 1,..., r s as i Corollary 3.4. By Corollary 3.4, there exist polyomials g 1,..., g s such that, 1 = g 1 (x)r 1 (x) + + g s (x)r s (x). Let T : V V be a liear operator. The idetity above gives a idetity of associated liear operators, Id V = 1(T ) = g 1 (T ) r 1 (T ) + + g s (T ) r s (T ). Lemma 4.1. For every 1 i s ad every w i E () i, for every 1 j s with j = i, r j (T )(w i ) = 0. Proof. Because j = i, by costructio r j (x) = q(x)(x λ i ) for some q(x) F[x], specifically, q(x) = (x λ ). 1 s,=i,j By Propositio 2.2(iii), r j (T ) = q(t ) (T λ i Id V ). By hypothesis, w i E () i := er((t λ i Id V ) ). Thus r j (T )(w i ) = q(t )((T λ i Id V ) (w i )) = q(t )(0) = 0. Lemma 4.2. For every i = 1,..., s ad every w i E () i, g i (T ) r i (T )(v i ) = v i. s Proof. By the idetity, w i = Id V (w i ) = j=1 g i(t ) r i (T )(w i ). By Lemma 4.1, for every j = i, g i (T ) r i (T )(w i ) = g i (T )(r i (T )(w i )) = g i (T )(0) = 0. Deote by W the ordered s tuple of vector subspaces of V, W = (E (),..., E () ) Propositio 4.3. For every ordered s tuple of vectors i W, (w 1,..., w s ), deotig v = w w s, for every i = 1,..., s, w i = g i (T ) r i (T )(v). Proof. Because g i (T ) r i (T ) is a liear operator, 1 s s g i (T ) r i (T )(v) = g i (T ) r i (T )( w j ) = g i (T ) r i (T )(w j ). j=1 j=1 By Lemma 4.1, if j = i the g i (T ) r i (T )(w j ) = g i (T )(r i (T )(w j ) = g i (T )(0) = 0. Therefore, g i (T ) r i (T )(v) = g i (T ) r i (T )(w i ). By Lemma 4.2, g i (T ) r i (T )(w i ) = w i. Therefore g i (T ) r i (T )(v) = w i. Theorem 4.4. Let T : V V be a liear operator. For every iteger s 1 ad every ordered s tuple of distict scalars (λ 1,..., λ s ), the ordered s tuple of vector subspaces W = (E ( ),..., E ( ) 1 s ) is liearly idepedet. 8 s
9 Proof. If s = 1, this is trivial: for ay subspace W of V, (W) is liearly idepedet. Thus assume s 2. Let (w 1,..., w s ) be a ordered s tuple of vectors i W such that 0 = w 1 + +w s. By defiitio, for every i = 1,..., s, E ( ) = 0 E (). So for every i = 1,..., s, there exists a iteger i > 0 such that w i E (i) i. Defie = max( 1,..., s ). By Corollary 2.5, for every i = 1,..., s, w i E () i. By Propositio 4.3, for every i = 1,..., s, w i = g i (T ) r i (T )(0) = 0. Sice (w 1,..., w s ) = (0,..., 0), W is liearly idepedet. i i 9
M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O
M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet
More information, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)
Cosider the differetial equatio y '' k y 0 has particular solutios y1 si( kx) ad y cos( kx) I geeral, ay liear combiatio of y1 ad y, cy 1 1 cy where c1, c is also a solutio to the equatio above The reaso
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More informationAn analog of the arithmetic triangle obtained by replacing the products by the least common multiples
arxiv:10021383v2 [mathnt] 9 Feb 2010 A aalog of the arithmetic triagle obtaied by replacig the products by the least commo multiples Bair FARHI bairfarhi@gmailcom MSC: 11A05 Keywords: Al-Karaji s triagle;
More informationMATH 205 HOMEWORK #2 OFFICIAL SOLUTION. (f + g)(x) = f(x) + g(x) = f( x) g( x) = (f + g)( x)
MATH 205 HOMEWORK #2 OFFICIAL SOLUTION Problem 2: Do problems 7-9 o page 40 of Hoffma & Kuze. (7) We will prove this by cotradictio. Suppose that W 1 is ot cotaied i W 2 ad W 2 is ot cotaied i W 1. The
More informationSOLVED EXAMPLES
Prelimiaries Chapter PELIMINAIES Cocept of Divisibility: A o-zero iteger t is said to be a divisor of a iteger s if there is a iteger u such that s tu I this case we write t s (i) 6 as ca be writte as
More informationDIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS
DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS VERNER E. HOGGATT, JR. Sa Jose State Uiversity, Sa Jose, Califoria 95192 ad CALVIN T. LONG Washigto State Uiversity, Pullma, Washigto 99163
More information1 Summary: Binary and Logic
1 Summary: Biary ad Logic Biary Usiged Represetatio : each 1-bit is a power of two, the right-most is for 2 0 : 0110101 2 = 2 5 + 2 4 + 2 2 + 2 0 = 32 + 16 + 4 + 1 = 53 10 Usiged Rage o bits is [0...2
More informationBasic Sets. Functions. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4. (e) 2 S.
Basic Sets Example 1. Let S = {1, {2, 3}, 4}. Idicate whether each statemet is true or false. (a) S = 4 (b) {1} S (c) {2, 3} S (d) {1, 4} S (e) 2 S. (f) S = {1, 4, {2, 3}} (g) S Example 2. Compute the
More informationA brief introduction to linear algebra
CHAPTER 6 A brief itroductio to liear algebra 1. Vector spaces ad liear maps I what follows, fix K 2{Q, R, C}. More geerally, K ca be ay field. 1.1. Vector spaces. Motivated by our ituitio of addig ad
More informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationA Note on the Symmetric Powers of the Standard Representation of S n
A Note o the Symmetric Powers of the Stadard Represetatio of S David Savitt 1 Departmet of Mathematics, Harvard Uiversity Cambridge, MA 0138, USA dsavitt@mathharvardedu Richard P Staley Departmet of Mathematics,
More informationChapter 2. Periodic points of toral. automorphisms. 2.1 General introduction
Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationMath 140A Elementary Analysis Homework Questions 1
Math 14A Elemetary Aalysis Homewor Questios 1 1 Itroductio 1.1 The Set N of Natural Numbers 1 Prove that 1 2 2 2 2 1 ( 1(2 1 for all atural umbers. 2 Prove that 3 11 (8 5 4 2 for all N. 4 (a Guess a formula
More informationWeek 5-6: The Binomial Coefficients
Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers
More information11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.
11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although
More information1 Last time: similar and diagonalizable matrices
Last time: similar ad diagoalizable matrices Let be a positive iteger Suppose A is a matrix, v R, ad λ R Recall that v a eigevector for A with eigevalue λ if v ad Av λv, or equivaletly if v is a ozero
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationReal Numbers R ) - LUB(B) may or may not belong to B. (Ex; B= { y: y = 1 x, - Note that A B LUB( A) LUB( B)
Real Numbers The least upper boud - Let B be ay subset of R B is bouded above if there is a k R such that x k for all x B - A real umber, k R is a uique least upper boud of B, ie k = LUB(B), if () k is
More informationAlgebraic Geometry I
6.859/15.083 Iteger Programmig ad Combiatorial Optimizatio Fall 2009 Lecture 14: Algebraic Geometry I Today... 0/1-iteger programmig ad systems of polyomial equatios The divisio algorithm for polyomials
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More informationLECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK)
LECTURE 8: ORTHOGONALITY (CHAPTER 5 IN THE BOOK) Everythig marked by is ot required by the course syllabus I this lecture, all vector spaces is over the real umber R. All vectors i R is viewed as a colum
More informationMath 104: Homework 2 solutions
Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does
More informationExercises 1 Sets and functions
Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,
More informationLinearly Independent Sets, Bases. Review. Remarks. A set of vectors,,, in a vector space is said to be linearly independent if the vector equation
Liearly Idepedet Sets Bases p p c c p Review { v v vp} A set of vectors i a vector space is said to be liearly idepedet if the vector equatio cv + c v + + c has oly the trivial solutio = = { v v vp} The
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationThe Structure of Z p when p is Prime
LECTURE 13 The Structure of Z p whe p is Prime Theorem 131 If p > 1 is a iteger, the the followig properties are equivalet (1) p is prime (2) For ay [0] p i Z p, the equatio X = [1] p has a solutio i Z
More informationBertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n.
Bertrad s Postulate Our goal is to prove the followig Theorem Bertrad s Postulate: For every positive iteger, there is a prime p satisfyig < p We remark that Bertrad s Postulate is true by ispectio for,,
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationTEACHER CERTIFICATION STUDY GUIDE
COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra
More informationMATH 304: MIDTERM EXAM SOLUTIONS
MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest
More informationPAPER : IIT-JAM 2010
MATHEMATICS-MA (CODE A) Q.-Q.5: Oly oe optio is correct for each questio. Each questio carries (+6) marks for correct aswer ad ( ) marks for icorrect aswer.. Which of the followig coditios does NOT esure
More information4 The Sperner property.
4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,
More informationHomework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is
Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of
More informationHomework 9. (n + 1)! = 1 1
. Chapter : Questio 8 If N, the Homewor 9 Proof. We will prove this by usig iductio o. 2! + 2 3! + 3 4! + + +! +!. Base step: Whe the left had side is. Whe the right had side is 2! 2 +! 2 which proves
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationUnit 4: Polynomial and Rational Functions
48 Uit 4: Polyomial ad Ratioal Fuctios Polyomial Fuctios A polyomial fuctio y px ( ) is a fuctio of the form p( x) ax + a x + a x +... + ax + ax+ a 1 1 1 0 where a, a 1,..., a, a1, a0are real costats ad
More informationChapter Vectors
Chapter 4. Vectors fter readig this chapter you should be able to:. defie a vector. add ad subtract vectors. fid liear combiatios of vectors ad their relatioship to a set of equatios 4. explai what it
More informationBasic Sets. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4
Basic Sets Example 1. Let S = {1, {, 3}, 4}. Idicate whether each statemet is true or false. (a) S = 4 False. Note that the elemets of S are 1, the set {, 3}, ad 4. Thus S = 3. (b) {1} S False. While 1
More informationand each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.
MATH 324 Summer 200 Elemetary Number Theory Solutios to Assigmet 2 Due: Wedesday July 2, 200 Questio [p 74 #6] Show that o iteger of the form 3 + is a prime, other tha 2 = 3 + Solutio: If 3 + is a prime,
More informationCourse : Algebraic Combinatorics
Course 8.32: Algebraic Combiatorics Lecture Notes # Addedum by Gregg Musier February 4th - 6th, 2009 Recurrece Relatios ad Geeratig Fuctios Give a ifiite sequece of umbers, a geeratig fuctio is a compact
More informationInternational Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL Christos Nikolaidis TOPIC NUMBER THEORY
Iteratioal Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL TOPIC NUMBER THEORY METHODS OF PROOF. Couterexample - Cotradictio - Pigeohole Priciple Strog mathematical iductio 2 DIVISIBILITY....
More informationChapter 3 Inner Product Spaces. Hilbert Spaces
Chapter 3 Ier Product Spaces. Hilbert Spaces 3. Ier Product Spaces. Hilbert Spaces 3.- Defiitio. A ier product space is a vector space X with a ier product defied o X. A Hilbert space is a complete ier
More informationVector Spaces and Vector Subspaces. Remarks. Euclidean Space
Vector Spaces ad Vector Subspaces Remarks Let be a iteger. A -dimesioal vector is a colum of umbers eclosed i brackets. The umbers are called the compoets of the vector. u u u u Euclidea Space I Euclidea
More informationLecture 7: Properties of Random Samples
Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ
More informationOn the Linear Complexity of Feedback Registers
O the Liear Complexity of Feedback Registers A. H. Cha M. Goresky A. Klapper Northeaster Uiversity Abstract I this paper, we study sequeces geerated by arbitrary feedback registers (ot ecessarily feedback
More informationChapter 0. Review of set theory. 0.1 Sets
Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationModern Algebra. Previous year Questions from 2017 to Ramanasri
Moder Algebra Previous year Questios from 017 to 199 Ramaasri 017 S H O P NO- 4, 1 S T F L O O R, N E A R R A P I D F L O U R M I L L S, O L D R A J E N D E R N A G A R, N E W D E L H I. W E B S I T E
More informationLesson 10: Limits and Continuity
www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals
More informationLecture 12: November 13, 2018
Mathematical Toolkit Autum 2018 Lecturer: Madhur Tulsiai Lecture 12: November 13, 2018 1 Radomized polyomial idetity testig We will use our kowledge of coditioal probability to prove the followig lemma,
More informationBroadhurst s Dimensions
Broadhurst s Dimesios May 10, 2010 Abstract Broadhurst cojectured a dimesio for the graded pieces of the Q vector space of multiple zeta values based o large scale experimetal computatios. I this talk,
More informationEnumerative & Asymptotic Combinatorics
C50 Eumerative & Asymptotic Combiatorics Notes 4 Sprig 2003 Much of the eumerative combiatorics of sets ad fuctios ca be geeralised i a maer which, at first sight, seems a bit umotivated I this chapter,
More informationSOLVING LINEAR RECURSIONS OVER ALL FIELDS
SOLVING LINEAR RECURSIONS OVER ALL FIELDS KEITH CONRAD 1. Itroductio A sequece {a } = a 0, a 1, a,... i a field K satisfies a liear recursio if there are c 1,..., c d K such that 1.1 a = c 1 a 1 + c a
More informationLecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =
COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.
More information5. Matrix exponentials and Von Neumann s theorem The matrix exponential. For an n n matrix X we define
5. Matrix expoetials ad Vo Neuma s theorem 5.1. The matrix expoetial. For a matrix X we defie e X = exp X = I + X + X2 2! +... = 0 X!. We assume that the etries are complex so that exp is well defied o
More information# fixed points of g. Tree to string. Repeatedly select the leaf with the smallest label, write down the label of its neighbour and remove the leaf.
Combiatorics Graph Theory Coutig labelled ad ulabelled graphs There are 2 ( 2) labelled graphs of order. The ulabelled graphs of order correspod to orbits of the actio of S o the set of labelled graphs.
More informationPERIODS OF FIBONACCI SEQUENCES MODULO m. 1. Preliminaries Definition 1. A generalized Fibonacci sequence is an infinite complex sequence (g n ) n Z
PERIODS OF FIBONACCI SEQUENCES MODULO m ARUDRA BURRA Abstract. We show that the Fiboacci sequece modulo m eriodic for all m, ad study the eriod i terms of the modulus.. Prelimiaries Defiitio. A geeralized
More informationTrial division, Pollard s p 1, Pollard s ρ, and Fermat s method. Christopher Koch 1. April 8, 2014
Iteger Divisio Algorithm ad Cogruece Iteger Trial divisio,,, ad with itegers mod Iverses mod Multiplicatio ad GCD Iteger Christopher Koch 1 1 Departmet of Computer Sciece ad Egieerig CSE489/589 Algorithms
More informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
More information[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.
[ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural
More informationi is the prime factorization of n as a product of powers of distinct primes, then: i=1 pm i
Lecture 3. Group Actios PCMI Summer 2015 Udergraduate Lectures o Flag Varieties Lecture 3. The category of groups is discussed, ad the importat otio of a group actio is explored. Defiitio 3.1. A group
More informationSingular Continuous Measures by Michael Pejic 5/14/10
Sigular Cotiuous Measures by Michael Peic 5/4/0 Prelimiaries Give a set X, a σ-algebra o X is a collectio of subsets of X that cotais X ad ad is closed uder complemetatio ad coutable uios hece, coutable
More information1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More informationCHAPTER 5. Theory and Solution Using Matrix Techniques
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More informationSquare-Congruence Modulo n
Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet
More information(I.C) Matrix algebra
(IC) Matrix algebra Before formalizig Gauss-Jorda i terms of a fixed procedure for row-reducig A, we briefly review some properties of matrix multiplicatio Let m{ [A ij ], { [B jk ] p, p{ [C kl ] q be
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More information[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]
[ 47 ] Number System 1. Itroductio Pricile : Let { T ( ) : N} be a set of statemets, oe for each atural umber. If (i), T ( a ) is true for some a N ad (ii) T ( k ) is true imlies T ( k 1) is true for all
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
More informationMath 778S Spectral Graph Theory Handout #3: Eigenvalues of Adjacency Matrix
Math 778S Spectral Graph Theory Hadout #3: Eigevalues of Adjacecy Matrix The Cartesia product (deoted by G H) of two simple graphs G ad H has the vertex-set V (G) V (H). For ay u, v V (G) ad x, y V (H),
More informationSolutions to Problem Set 8
8.78 Solutios to Problem Set 8. We ow that ( ) ( + x) x. Now we plug i x, ω, ω ad add the three equatios. If 3 the we ll get a cotributio of + ω + ω + ω + ω 0, whereas if 3 we ll get a cotributio of +
More informationMath 4707 Spring 2018 (Darij Grinberg): homework set 4 page 1
Math 4707 Sprig 2018 Darij Griberg): homewor set 4 page 1 Math 4707 Sprig 2018 Darij Griberg): homewor set 4 due date: Wedesday 11 April 2018 at the begiig of class, or before that by email or moodle Please
More informationMATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006
MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the
More informationn=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n
Series. Defiitios ad first properties A series is a ifiite sum a + a + a +..., deoted i short by a. The sequece of partial sums of the series a is the sequece s ) defied by s = a k = a +... + a,. k= Defiitio
More informationDeterminants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1)
5. Determiats 5.. Itroductio 5.2. Motivatio for the Choice of Axioms for a Determiat Fuctios 5.3. A Set of Axioms for a Determiat Fuctio 5.4. The Determiat of a Diagoal Matrix 5.5. The Determiat of a Upper
More informationLecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
More information5 Birkhoff s Ergodic Theorem
5 Birkhoff s Ergodic Theorem Amog the most useful of the various geeralizatios of KolmogorovâĂŹs strog law of large umbers are the ergodic theorems of Birkhoff ad Kigma, which exted the validity of the
More information5.1. The Rayleigh s quotient. Definition 49. Let A = A be a self-adjoint matrix. quotient is the function. R(x) = x,ax, for x = 0.
40 RODICA D. COSTIN 5. The Rayleigh s priciple ad the i priciple for the eigevalues of a self-adjoit matrix Eigevalues of self-adjoit matrices are easy to calculate. This sectio shows how this is doe usig
More informationComplex Numbers Solutions
Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i
More informationChain conditions. 1. Artinian and noetherian modules. ALGBOOK CHAINS 1.1
CHAINS 1.1 Chai coditios 1. Artiia ad oetheria modules. (1.1) Defiitio. Let A be a rig ad M a A-module. The module M is oetheria if every ascedig chai!!m 1 M 2 of submodules M of M is stable, that is,
More informationCHAPTER I: Vector Spaces
CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig
More informationREGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS
REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS LIVIU I. NICOLAESCU ABSTRACT. We ivestigate the geeralized covergece ad sums of series of the form P at P (x, where P R[x], a R,, ad T : R[x] R[x]
More informationSymmetrization maps and differential operators. 1. Symmetrization maps
July 26, 2011 Symmetrizatio maps ad differetial operators Paul Garrett garrett@math.um.edu http://www.math.um.edu/ garrett/ The symmetrizatio map s : Sg Ug is a liear surjectio from the symmetric algebra
More informationIntroduction to Optimization Techniques
Itroductio to Optimizatio Techiques Basic Cocepts of Aalysis - Real Aalysis, Fuctioal Aalysis 1 Basic Cocepts of Aalysis Liear Vector Spaces Defiitio: A vector space X is a set of elemets called vectors
More informationThe Boolean Ring of Intervals
MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,
More informationApplication of Jordan Canonical Form
CHAPTER 6 Applicatio of Jorda Caoical Form Notatios R is the set of real umbers C is the set of complex umbers Q is the set of ratioal umbers Z is the set of itegers N is the set of o-egative itegers Z
More informationMathematical Foundations -1- Sets and Sequences. Sets and Sequences
Mathematical Foudatios -1- Sets ad Sequeces Sets ad Sequeces Methods of proof 2 Sets ad vectors 13 Plaes ad hyperplaes 18 Liearly idepedet vectors, vector spaces 2 Covex combiatios of vectors 21 eighborhoods,
More informationLecture 10: Mathematical Preliminaries
Lecture : Mathematical Prelimiaries Obective: Reviewig mathematical cocepts ad tools that are frequetly used i the aalysis of algorithms. Lecture # Slide # I this
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More informationStatistical Machine Learning II Spring 2017, Learning Theory, Lecture 7
Statistical Machie Learig II Sprig 2017, Learig Theory, Lecture 7 1 Itroductio Jea Hoorio jhoorio@purdue.edu So far we have see some techiques for provig geeralizatio for coutably fiite hypothesis classes
More informationOn Involutions which Preserve Natural Filtration
Proceedigs of Istitute of Mathematics of NAS of Ukraie 00, Vol. 43, Part, 490 494 O Ivolutios which Preserve Natural Filtratio Alexader V. STRELETS Istitute of Mathematics of the NAS of Ukraie, 3 Tereshchekivska
More informationChapter IV Integration Theory
Chapter IV Itegratio Theory Lectures 32-33 1. Costructio of the itegral I this sectio we costruct the abstract itegral. As a matter of termiology, we defie a measure space as beig a triple (, A, µ), where
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationProblem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
More information(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer.
SOLUTIONS Homewor 5 Due /6/19 Exercise. (a Cosider the set {a, b, c}. For each of the followig, (A list the objects described, (B give a formula that tells you how may you should have listed, ad (C verify
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationReview Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =
Review Problems ICME ad MS&E Refresher Course September 9, 0 Warm-up problems. For the followig matrices A = 0 B = C = AB = 0 fid all powers A,A 3,(which is A times A),... ad B,B 3,... ad C,C 3,... Solutio:
More information