Chapter 2 Introduction to Algebra. Dr. Chih-Peng Li ( 李 )
|
|
- Ursula Arnold
- 5 years ago
- Views:
Transcription
1 Chpter Introducton to Algebr Dr. Chh-Peng L 李
2 Outlne Groups Felds Bnry Feld Arthetc Constructon of Glos Feld Bsc Propertes of Glos Feld Coputtons Usng Glos Feld Arthetc Vector Spces
3 Groups 3
4 Let G be set of eleents. Groups A bnry operton * on G s rule tht ssgn to ech pr of eleents nd b unquely defned thrd eleent c*b n G. Defnton: A group s set G wth bnry opertor * tht stsfes the followng condtons : Closure: b, G b G Assoctve: bc,, G * b* c * b * c Identty: e G s.t. G, * e e* Ths eleent e s clled n dentty eleent of G. Inverse: G, ' G, s.t. * ' '* e The eleent s clled n nverse of. 4
5 Groups Theore.: The dentty eleent n group G s unque. pf : e e*e e *e e fro defnton Theore.: The nverse of group eleent s unque. pf : *e dentty ** nverse ** ssoctve e* nverse dentty 5
6 Rerks: 6 Groups A group G s sd to be couttve beln group f, b G, *b b* Order: The nuber of eleents n group. We denote t G. Fnte group: A group of fnte order. Eples of couttve groups: ntegers under rtonl nubers under {,} under * rel-vlued tr under {,,,., -} under odulo- ddton s couttve see eple. {,, 3.p-} under odulo- p ultplctor p s pre s lso couttve see eple.3
7 Groups Eple. Consder the set of two ntegers, G {, }. Let us defne bnry operton, denoted by, on G s follows : Ths bnry operton s clled odulo- ddton. The set G {, } s group under odulo- ddton. It follows fro the defnton of odulo- ddton tht G s close under nd s the dentty eleent. The nverse of s tself nd the nverse of s lso tself. Thus, G together wth s couttve group. 7
8 Groups Eple. Let be postve nteger. Consder the set of nteger G {,,,, -}. Let denote rel ddton. Defne bnry operton on G s follows: For ny ntegers nd j n G, j r, where r s the render resultng fro dvdng j by. The render r s n nteger between nd - Eucld s dvson lgorth nd s therefore n G. Hence G s closed under the bnry operton, clled odulo- ddton. Frst we see tht s the dentty eleent. For < <, nd re both n G. Snce 8
9 Groups It follows fro the defnton of odulo- ddton tht Therefore, nd - re nverses to ech other wth respect to. It s lso cler tht the nverse of s tself. Snce rel ddton s couttve, t follows fro the defnton of odulo- ddton tht, for ny ntegers nd j n G, j j. Therefore odulo- ddton s couttve. Net we show tht odulo- ddton s lso ssoctve. Let, j, nd k be three ntegers n G. Snce rel ddton s ssoctve, we hve j k j k j k 9
10 Groups Dvdng j k by, we obtn j k q r, where q nd r re the quotent nd the render, respectvely, nd r <. Now, dvdng j by, we hve j q r, wth r <. Therefore, j r. Dvdng r k by, we obtn r k q r wth r <. Hence r k r nd j k r. Cobnng. nd., we hve j k q q r, Ths ples tht r s lso the render when j k s dvded by. Snce the render resultng fro dvdng n nteger by nother nteger s unque, we ust hve r r.
11 Groups As result, we hve j k r. Slrly, we cn show tht j k r. Therefore j k j k nd odulo- ddton s ssoctve. Ths concludes our proof tht the set G {,,,, -} s group under odulo- ddton. We shll cll ths group n ddtve group.
12 Groups Eple.3: Let p be pre e.g. p, 3, 5, 7,,. Consder the set of ntegers, G {,,,, p-}. Let denote rel ultplcton. Defne bnry operton $ on G s follows: For nd j n G, $ j r, where r s render resultng fro dvdng j by p. The set G {,,,, p-} s group under odulo-p ultplcton. Frst we note tht j s not dvsble by p. Hence < r < p nd r s n eleent n G. Therefore, the set G s closed under the bnry operton $, referred to s odulo-p ultplcton. We cn esly check tht odulo-p ultplcton s couttve nd ssoctve. The dentty eleent s. The only thng left to be proved s tht every eleent n G hs n nverse.
13 Groups Let be n eleent n G. Snce p s pre nd <p, nd p ust be reltvely pre.e. nd p don t hve ny coon fctor gret thn. It s well known tht there est two ntegers nd b such tht b p.3 nd nd p re reltvely pre Eucld s theore. Rerrngng.3, we hve - b p..4 Ths sys tht when s dvded by p, the render s. If < < p, s n G nd t follows fro.4 nd the defnton of odulo-p ultplcton tht $ $. 3
14 4 Groups Therefore s the nverse of. However, f s not n G, we dvde by p, q p r. Snce nd p re reltvely pre, the render r cnnot be nd t ust be between nd p-. Therefore r s n G. Now cobnng.4 nd.5, we obtn r - b qp. Therefore r $ $ r nd r s the nverse of. Hence ny eleent n G hs n nverse wth respect to odulo-p ultplcton. The group G {,,,, p-} under odulo-p ultplcton s clled ultplctve group. Def: Let H G & H φ epty set, then H s sd to be subgroup of G f H s group.
15 Felds 5
16 Felds Roughly spekng, feld s set of eleents n whch we cn do ddton, subtrcton, ultplcton, nd dvson wthout levng the set. Addton nd ultplcton ust stsfy the couttve, nd dstrbutve lws. Defnton: Let F be set of eleents on whch two bnry opertons, clled ddton nd ultplcton, re defned. The set F together wth the two bnry opertons nd s feld f the followng condtons re stsfed: F s couttve group under ddton. The dentty eleent wth respect to ddton s clled the zero eleent or the ddtve dentty of F nd s denoted by. 6
17 Felds The set of nonzero eleents n F s couttve group under ultplcton. The dentty eleent wth respect to ultplcton s clled the unt eleent or the ultplctve dentty of F nd s denoted by. Multplcton s dstrbutve over ddton; tht s, for ny three eleents, b, nd c n F, bc b c 7
18 8 Felds A feld conssts of t lest two eleents, the ddtve dentty nd the ultplctve dentty. The nuber of eleents n feld s clled the order of the feld. A feld wth fnte nuber of eleents s clled fnte feld. In feld, the ddtve nverse of n eleent s denoted by nd the ultplctve nverse of s denoted by - provded tht. Subtrctng feld eleent b fro nother feld eleent s defned s ddng the ddtve nverse b of b to. [-b -b]. If b s nonzero eleent, dvdng by b s defned s ultplyng by the ultplctve nverse b - of b. [/b b - ].
19 Felds Property I. For every eleent n feld,. Proof. Addng to both sdes of the equlty bove, we hve: - - Slrly, we cn show tht. Therefore, we obtn. Property II. For ny two nonzero eleents nd b n feld, b. Proof. Fro defnton, nonzero eleents of feld re closed under ultplcton. 9
20 Felds Property III. b nd ply tht b. Ths s drect consequence of Property II. Property IV. For ny two eleents nd b n feld, - b- b -b. b- b b- b - b ust be the ddtve nverse of b nd b- b. Slrly, we cn prove tht b -b. Property V. For, b c ples tht bc. Snce s nonzero eleent n the feld, t hs ultplctve nverse -. Multplyng both sde of b c by -, we obtn - b - c - b - c b c > bc
21 Felds Soe eples: R rel nuber set C cople nuber Q Rtonl nuber GFq ests f q, p s pre p nfnte felds E.4. Bnry feld GF wth odulo- ddton odulo- ultplcton
22 Felds E.5: GFp, p s pre. Pre Feld {,,,.p-} s n beln group under odulo-p ddton. {,, p-} s n ben group under odulo-p ultplcton. Fct: rel nuber ultplcton s dstrbutve over rel nuber ddton. Ths ples tht odulo-p ultplcton s dstrbutve over odulo-p ddton. {,,,.p-} s feld of order p under odulo-p ddton nd ultplcton. In fct, for ny postve nteger, t s possble to etend the pre feld GFp to feld of p eleents clled n etenson feld of GFp nd s denoted by GFp. Furtherore, the order of ny fnte feld s power of pre. Fnte felds re lso clled Glos feld.
23 Felds Def: Chrcterstc of GFq Consder the unt eleent n GFq; sllest postve λ nteger λ s.t., then λ s clled the chrcterstc of GFq EX. The chrcterstc of GF s The chrcterstc of GFp s p k k for k < p, p 3
24 Felds Theore.3: The chrcterstc of GFq s pre. pf λ k k, < λ k k λ. k or contrdcts the defnton of Fct: For ny two dstnct postve nteger k, < k λ 4
25 Rerks:,,,, λ λ q λ λ Felds re dstnct eleents n GFq, whch for subfeld GF of GFq If, then q s power of proven n lter λ Def: Order of feld eleent n Let GFq,, sllest postve nteger n s.t.. n s clled the order of the feld eleent. 5
26 Rerks: Felds 3 n n,,,,, re ll dstnct, whch for group under the ultplcton of GFq. pf: Closure f j n, j j f j > n, we hve j n r where r n j j n r r n Inverse For < n, s the ultplctve nverse of Snce the powers of re nonzero eleents n GFq, they stsfy the ssoctve nd counttve lws. 6
27 7 Felds Def: Cyclc A Group s sd to be cyclc, f there ests n eleent n the group whose powers consttute the whole group. Theore.4: GF q nd, then q pf: Let b, b, b q- be the q- nonzero eleent of GFq, then b, b, b q- re lso nonzero nd dstnct. Thus, b b.. bq- b b bq- q- b b b q- b b b q- q- Theore.5: GF q nd, n s the order of then pf : If not, q- kn r <r<n q kn r n k r r n q
28 Def: Prtve GF q& Rerks:, s sd to be prtve f the order of s q- The powers of prtve eleent generte ll the nonzero eleents of GFq Every fnte feld hs prtve eleent. prob..7 Eple. GF5 ' 3 4 5, 4, 3,, s prtve eleents. prtve eleents re useful for constructng felds. Eple. GF7 3 s prtve eleent, the order of 4 s 3, whch dvdes 6. 8 Felds
29 Bnry Feld Arthetc 9
30 3 Bnry Feld Arthetc Sets of equtons e.g. XY, XZ, XYZ Solved by Grer s rule y z
31 Bnry Feld Arthetc Polynols over GF. We denote t GF[X]. Def: n f f f... f n f GF f f n, deg[f] n f f... f, f n, deg[f] Rerks: Polynols over GF wth degree e :, Polynols over GF wth degree e :,,, n In generl, wth degree n we hve polynols. 3
32 3 Added or subtrcted Multpled If g, then f Couttve n n f f g f g f g f g f... n g g g g n n o f g c c c c f g f g f g, n n g f c g f c f g g f f g g f Bnry Feld Arthetc
33 Assoctve f [g h] [f g] h f [g h] [f g] h Dstrbutve f [g h] [f g] [f h] Bnry Feld Arthetc Eucld s dvson lgorth Suppose deg[g], q, r GF[] s.t. fqg r, where deg[r] < deg[g] q : quotent, r : render e.g. If r, f s dvsble by g. [g dvdes f, g f] 33
34 Bnry Feld Arthetc Root GF, f f, then f s dvsble by e.g. f f, f s dvsble by e. Def: Irreducble p GF [] wth deg[p] s sd to be rreducble over GF f p s not dvsble by ny polynol over GF of degree less thn but greter thn zero. 34
35 e.g. ong, Bnry Feld Arthetc,,, only s n rreducble polynol wth degree. 3 s lso n rreducble poly wth degree 3. In generl, for ny, there ests n rreducble polynol of degree. Theore.6: Any rreducble polynol over GF of degree dvdes. See Theore.4 e.g
36 Bnry Feld Arthetc Def: Prtve An rreducble polynol p of degree s sd to be prtve n f the sllest postve nteger n for whch p dvdes s n. 4 5 e.g. p n but p! for n < 5 prtve p 5 t cn lso p not prtve Rerks: For gven >, there y be ore thn one prtve polynols of degree n. Lsts of prtve polynols see p.9 Tble.7 36
37 Bnry Feld Arthetc FACT: pf: f GF[ ], [ f ] f N n f f f... f n n f f... fn f f n f f... f n f f n... f n f... f... n f f f... f f n f n n 37
38 Constructon of Glos Feld 38
39 Constructon of Glos Feld Consder, n GF nd new sybol. Defne s follows:,, 3 j j tes 39
40 Constructon of Glos Feld j j j j j j j j { j,,,...,...} F wth be soete denoted by 4
41 Let prtve polynol Wth deg [p] & Snce p Constructon of Glos Feld Therefore, under the condton tht p GF[ ] ssue p q p q p q p F s fnte.e. F F { },,,,..., * * Fro, F s closed under 4
42 Constructon of Glos Feld * FACT: The nonzero eleents of F for couttve group wth order under * * Now defne n ddtve operton on F s.t. F fors couttve group under For <, g & over GF s.t. g p, where....e. deg [ ] 4
43 43 Constructon of Glos Feld FACT: For nd p re reltve pre s not dvsble by p For pf: If <j however, p s prtve polynol of degrees whch,, nd, j j < j j [ ] p g g j j j [ ] p g g j j j p p
44 Constructon of Glos Feld Therefore,,,,... re dstnct nonzero poly. of degree - or less. Recll tht g p n GF Replcng by n p / for n < q.e. { } nonzero eleents re represented by dstnct nonzero poly. of over GF wth degree - or less.... o, 44
45 45 Constructon of Glos Feld Snce zero eleent n y be represented by the zero poly. eleents n re represented by dstnct poly. of over GF wth degree - or less nd re regrded s dstnct eleents. Defne s follows:.. for So, * F * F j <,,..., j... j j... j jo o,, j
46 Constructon of Glos Feld * FACT: F s couttve group under ddtve dentty ddtve nverse couttve ssoctve { } FACT: * F,,,..., s Glos feld of eleents. * pf: s couttve group under F * s couttve group under F {} 46
47 Rerks: Constructon of Glos Feld * nd defned on F GF ply odulo- ddton nd ultplcton. {,} fors subfeld of GF.e. GF s clled the ground feld of GF The chrcterstc of GF s Two representtons for the nonzero eleent of GF the power representton for ultplcton the polynol representton for ddton s prtve eleent of GF 47
48 48 Constructon of Glos Feld Eple: over poly. prtve s 4 4 GF p p Set
49 49 Constructon of Glos Feld, Another useful representton of feld eleents n GF,..., tuple... : β
50 5 Constructon of Glos Feld E. Construct GF4 fro GF wth { } { },,,,,, p
51 Bsc Propertes of Glos Feld 5
52 5 Bsc Propertes of Glos Feld over root of the s GF p over of re roots,,, ] ][ [ GF p
53 Bsc Propertes of Glos Feld 4 3 p s rredeucble over GF.e. t doesn't hve ny 4 root over GF. However,t hs four roots over GF Theore.7: f GF [ ], β n etenson feld of GF If f.e. f β, then f β β s root, then β re ll roots pf: [ f ] f f β [ f β ] 53
54 Rerks: The Bsc Propertes of Glos Feld Let f GF[], f β s clled conjugte of β β GF β GF nd f β e.g f Then f... where s.t. f β, then GF GF 4 4,gven by Tble.8 4 The conjugtes of re roots of f FACT: If pf : β β GF 8 :,, re ll roots of nd β fro Theore.4, then β s 5 f, besdes root of & 54
55 Rerks: Bsc Propertes of Glos Feld All nonzero eleents of GF fro ll the roots of All eleents of GF for ll the roots of Def: nl polynol Let β GF, the poly. φ of sllest degree over φ β s clled the nl poly.of β. Rerks: β s root of β y be root of p GF[ ] wth degree[ p ] < GF s.t. 55
56 Bsc Propertes of Glos Feld The nl poly.of s The nl poly.of s The nl poly.of 7 s 4 3 Q : The nl poly.of 4 s or not? Theore.9: The nl poly. φ of feld eleent s rreducble. β pf: If not φ φ φ when < deg[ φ ] < deg[ φ] for, 56
57 Bsc Propertes of Glos Feld φ β φ β φ β φ β or φ β φ s not nl poly. FACT: f GF[ ]. Let φ be the nl poly. of β. If f β, then φ f pf: f φ r, deg[ r ] < deg[ φ ] f β φ β r β If r, then φ s not nl poly.of β. 57
58 Bsc Propertes of Glos Feld FACT: The nl poly. φ of β GF dvdes Rerk: ll the roots of φ re fro GF ccordng to Corollry.8. FACT: f GF[ ] nd f s n rreducble poly. Let β GF nd φ be the nl poly. of β. If f β, then φ f pf: fro fct φ & f φ f s rreducble φ f 58
59 Rerks: Bsc Propertes of Glos Feld Ths fct ples tht n rreducble poly. f wth root β s the nl poly. φ of β. Fro prevous Th.7 β, β, β,, β, re roots of φ. Let e be the sllest e e nteger s.t. β β, then β, β, β β re ll the dstnct conjugtes of β see prob..4 59
60 6 Bsc Propertes of Glos Feld FACT: s.t., then s n rreducble poly over GF pf: proof tht by frst proof be the sllest & e GF β β β e f e β Π [ ] GF f ] [ f f ] [ β β f e e Π Π Π β β β e Π β e
61 6 Bsc Propertes of Glos Feld Let β e Π β e Π f e β β e Π e f e f f f... Epnd where f e [ ] e e f f f f f e e e j j e j j f f f...
62 Bsc Propertes of Glos Feld f e f... fro & Ths holds only when or f f f f GF [ ] e prove tht f s rreducble over GF f not, f b & f β β b β β or b β, f β, hs e roots ββ,, β. Theore.7 deg [ ] e nd f f b β, the sereson s.t. b f Therefore, f ust be rreducble. 6
63 Th.4: Bsc Propertes of Glos Feld Let φ be the nl poly. of β GF nd e be the φ sllest e nteger β followng fro Th. &.3 e s.t. β β, Then e.g. β 3 GF 4 gven by Tble β, β, β 3 The nl poly. of β s φ
64 64 Bsc Propertes of Glos Feld e.g. Fnd the nl poly. Usng poly. representton for of φ n 4 7 GF r ,, r r r Hence φ r r r r r φ 4 3,r,r r, r
65 Bsc Propertes of Glos Feld All the nl poly. of eleents n GF 4. See p.38 Tble.9 Th.5: Let φ,, φ be the nl poly. of β GF & deg[ φ ] e. Then e be the sllest nteger s.t. β β. Moreover e drect fro Th.4&.5 Rerks: f be the nl poly. of then e proof s otted β GF wth deg[ f] e 65
66 Bsc Propertes of Glos Feld Mnl poly. of β GF 66 to see Append B Th.6: β GF, f β s prtve eleent of GF, then ll ts conjugtes eleent of GF re lso prtve pf: Let n be the order of β for >, then n n β β. fro Th.5. n β s prtve eleent of ts order s For β n -&, - n β, β GF re reltve pre,,
67 Bsc Propertes of Glos Feld - n fro, n β s lso prtve eleent. Eple: β 7 GF 4 gven by Tble β, β, β,β β β , β β 7 Clerly, s prtve eleent of GF β, β, β re ll prtve eleents of GF 4 67
68 Bsc Propertes of Glos Feld Th.7: nd hs order n, then ll the conjugte hve the se order n. See prob..5 β GF β 68
69 Coputtons Usng Glos Feld Arthetc 69
70 Coputtons Usng Glos Feld Arthetc 7 EX: Consder Y over GF 4 8 Y 4 X Y
71 Coputtons Usng Glos Feld Arthetc 7 EX: Solve f Tble.8 try nd error 6 f 3 over GF 4 gven by f 7 6 f 6, 7
72 Vector Spces 7
73 Vector Spces Def: V be set of eleents wth bnry operton s defned. F be feld. A ultplcton opertor between F nd v V s lso defned. The V s clled vector spce over the feld F f: V s couttve group under. F & v V v V dstrbutve lw u,v V nd,b F Assoctve Lw. v v u v b v u v b v b b v v v 73
74 Vector Spces The eleents of V re clled vectors nd the eleents of the feld F re clled sclrs. The ddton on V s clled vector ddton nd the ultplcton tht cobnes sclr n F nd vector n V s referred to s sclr ultplcton or product The ddtve dentty of V s denoted by. Property I. Let be the zero eleent of the feld F. For ny vector v n V, v. Property II. For ny sclr c n F, c. Left s n eercse 74
75 Vector Spces Property III. For ny sclr c n F nd ny vector v n V, -c v c -v -c v.e., -c v or c -v s the ddtve nverse of the vector c v. Left s n eercse Consder n ordered sequence of n coponents,,,..., n, where ech coponent s n eleent fro the bnry feld GF.e., or. Ths sequence s clled n n-tuple over GF. n Snce there re two choces for ech, we cn construct dstnct n-tuples. Let V n denote ths set. Now we defne n ddton on V n s followng : For ny u u,,..., nd u u n v v, v,..., v n n V n, u v u v, u v,..., u n vn.7 75
76 Vector Spces where uv s crred out n odulo- ddton. Clerly, u v s lso n n-tuple over GF. Hence V n s closed under the ddton. We cn redly verfy tht V n s couttve group under the ddton defned by.7. we see tht ll zero n-tuple,,, s the ddtve dentty. For ny v n V n, v v v,,, v, v v,..., v n vn Hence, the ddtve nverse of ech n-tuples n V n s tself. Snce odulo- ddton s couttve nd ssoctve, the ddton s lso couttve nd ssoctve. Therefore, s couttve group under the ddton. V n we defned sclr ultplcton of n n-tuple v n V n 76
77 Vector Spces by n eleent fro GF s follows : v, v,..., v n v, v,..., vn.8 where v s crred out n odulo- ultplcton. Clerly, v, v,..., v n s lso n n-tuple n Vn. If, v, v,..., v n v, v,..., vn v, v,..., V n v n By.7 nd.8, the set of ll n-tuples over GF fors vector spce over GF 77
78 Vector Spces Eple Let n. The vector spce V of ll -tuples over GF conssts of the followng 4 vectors : The vector su of nd s Usng the rule of sclr ultplcton defned by.8, we get V beng vector spce of ll n-tuples over ny feld F, t y hppen tht subset S of V s lso vector spce over F. Such subset s clled subspce of V. 78
79 Vector Spces Theore.8 Let S be nonepty subset of vector spce V over feld F. Then S s subspce of V f the followng condtons re stsfed : For ny two vectors u nd v n S, u v s lso vector n S. For n eleent n F nd ny vector u n S, u s lso n S. pf. Condtons nd sy sply tht S s closed under vector ddton nd sclr ultplcton of V. Condton ensures tht, for ny vector v n S, ts ddtve nverse - v s lso n S. Then, v - v s lso n S. Therefore, S s subgroup of V. Snce the vectors of S re lso vectors of V, the ssoctve nd dstrbutve lws ust hold for S. Hence, S s vector spce over F nd s subspce of V. 79
80 Vector Spces Let v, v,,vk be k vectors n vector spce V over feld F. Let,,, k be k sclrs fro F. The su v v kvk s clled lner cobnton of v, v,,vk. Clerly, the su of two lner cobntons of v, v,,vk, v v kvk bv bv bkvk b v b v kbk vk s lso lner cobnton of v, v,,vk, nd the product of sclr c n F nd lner cobnton of v, v,,vk, c v v kvk c v c v... c k v k s lso lner cobnton of v, v,,vk Theore.9 Let v, v,,vk be k vectors n vector spce V over feld F. The set of ll lner cobntons of v, v,,vk fors subspce of V. 8
81 Vector Spces A set of vectors v, v,,vk n vector spce V over feld F s sd to be lnerly dependent f nd only f there et k sclrs,,, k fro F, not ll zeros, such tht v v kvk A set of vectors v, v,,vk s sd to be lnerly ndependent f t s not lnerly dependent. Tht s, f v, v,,vk re lnerly ndependent, then v v kvk unless k. EX. The vectors,, nd re lnerly dependent snce 8
82 Vector Spces However,,, nd re lnerly ndependent. A set of vectors s sd to spn vector spce V f every vector n V s lner cobnton of the vectors n the set. In ny vector spce or subspce there ets t lest one set B of lnerly ndependent vectors whch spn the spce. Ths set s clled bss or bse of the vector spce. The nuber of vectors n bss of vector spce s clled the denson of the vector spce. Note tht the nuber of vectors n ny two bses re the se. 8
83 Vector Spces Consder the vector spce of ll n-tuples over GF. Let us for the followng nn-tuples : e e V n e n-..., where the n-tuple e hs only nonzero coponent t th poston. Then every n-tuple,,..., n n V n cn be epressed s lner cobnton of e, e,,en- s follows :,,..., n e e... n en 83
84 Vector Spces Therefore, e, e,,en- spn the vector spce of ll n-tuples over GF. We lso see tht e, e,,en- re lnerly ndependent. Let u u, u,..., u n nd v v, v,..., v n be two n-tuples n. We defne the nner product or dot product of u nd v s V n where u v nd u v u v re crred out n odulo- ultplcton nd ddton. Hence the nner product u v s sclr n GF. If u v, u nd v re sd to be orthogonl to ech other. The nner product hs the followng propertes : u v v u u vw u v u w u v u v u v uv uv... u n vn, 84 V n
85 Vector Spces Let S be k-denson subspce of nd let Sd be the set of vectors n V n such tht, for ny u n S nd v n Sd, u v. The set Sd contns t lest the ll-zero n-tuple,,,, snce for ny u n S, u. Thus, Sd s nonepty. For ny eleent n GF nd ny v n Sd, f v { v f Therefore, v s lso n Sd. Let v nd w be ny two vectors n Sd. For ny vector u n S, u vw u v u w. Ths sys tht f v nd w re orthogonl to u, the vector su v w s lso orthogonl to u. Consequently, v w s vector n Sd. It follows fro Theore.8 tht Sd s lso subspce of V n. Ths subspce s clled the null or dul spce of S. Conversely, S s lso the null spce of Sd. 85 V n
86 Vector Spces Theore. Let S be k-denson subspce of the vector spce Vn of ll n-tuples over GF. The denson of ts null spce Sd s n-k. In other words, ds dsd n. 86
The Number of Rows which Equal Certain Row
Interntonl Journl of Algebr, Vol 5, 011, no 30, 1481-1488 he Number of Rows whch Equl Certn Row Ahmd Hbl Deprtment of mthemtcs Fcult of Scences Dmscus unverst Dmscus, Sr hblhmd1@gmlcom Abstrct Let be X
More informationFINITE NEUTROSOPHIC COMPLEX NUMBERS. W. B. Vasantha Kandasamy Florentin Smarandache
INITE NEUTROSOPHIC COMPLEX NUMBERS W. B. Vsnth Kndsmy lorentn Smrndche ZIP PUBLISHING Oho 11 Ths book cn be ordered from: Zp Publshng 1313 Chespeke Ave. Columbus, Oho 31, USA Toll ree: (61) 85-71 E-ml:
More informationReview of linear algebra. Nuno Vasconcelos UCSD
Revew of lner lgebr Nuno Vsconcelos UCSD Vector spces Defnton: vector spce s set H where ddton nd sclr multplcton re defned nd stsf: ) +( + ) (+ )+ 5) λ H 2) + + H 6) 3) H, + 7) λ(λ ) (λλ ) 4) H, - + 8)
More informationON NILPOTENCY IN NONASSOCIATIVE ALGEBRAS
Jourl of Algebr Nuber Theory: Advces d Applctos Volue 6 Nuber 6 ges 85- Avlble t http://scetfcdvces.co. DOI: http://dx.do.org/.864/t_779 ON NILOTENCY IN NONASSOCIATIVE ALGERAS C. J. A. ÉRÉ M. F. OUEDRAOGO
More informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More informationThe Schur-Cohn Algorithm
Modelng, Estmton nd Otml Flterng n Sgnl Processng Mohmed Njm Coyrght 8, ISTE Ltd. Aendx F The Schur-Cohn Algorthm In ths endx, our m s to resent the Schur-Cohn lgorthm [] whch s often used s crteron for
More informationp (i.e., the set of all nonnegative real numbers). Similarly, Z will denote the set of all
th Prelmnry E 689 Lecture Notes by B. Yo 0. Prelmnry Notton themtcl Prelmnres It s ssumed tht the reder s fmlr wth the noton of set nd ts elementry oertons, nd wth some bsc logc oertors, e.g. x A : x s
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationFinite Fields and Their Applications
Fnte Felds and Ther Applcatons 5 009 796 807 Contents lsts avalable at ScenceDrect Fnte Felds and Ther Applcatons www.elsever.co/locate/ffa Typcal prtve polynoals over nteger resdue rngs Tan Tan a, Wen-Feng
More informationPrinciple Component Analysis
Prncple Component Anlyss Jng Go SUNY Bufflo Why Dmensonlty Reducton? We hve too mny dmensons o reson bout or obtn nsghts from o vsulze oo much nose n the dt Need to reduce them to smller set of fctors
More informationPolynomials. 1 More properties of polynomials
Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a
More informationChapter Newton-Raphson Method of Solving a Nonlinear Equation
Chpter.4 Newton-Rphson Method of Solvng Nonlner Equton After redng ths chpter, you should be ble to:. derve the Newton-Rphson method formul,. develop the lgorthm of the Newton-Rphson method,. use the Newton-Rphson
More informationMATRICES AND VECTORS SPACE
MATRICES AND VECTORS SPACE MATRICES AND MATRIX OPERATIONS SYSTEM OF LINEAR EQUATIONS DETERMINANTS VECTORS IN -SPACE AND -SPACE GENERAL VECTOR SPACES INNER PRODUCT SPACES EIGENVALUES, EIGENVECTORS LINEAR
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationTwo Coefficients of the Dyson Product
Two Coeffcents of the Dyson Product rxv:07.460v mth.co 7 Nov 007 Lun Lv, Guoce Xn, nd Yue Zhou 3,,3 Center for Combntorcs, LPMC TJKLC Nnk Unversty, Tnjn 30007, P.R. Chn lvlun@cfc.nnk.edu.cn gn@nnk.edu.cn
More informationMath 497C Sep 17, Curves and Surfaces Fall 2004, PSU
Mth 497C Sep 17, 004 1 Curves nd Surfces Fll 004, PSU Lecture Notes 3 1.8 The generl defnton of curvture; Fox-Mlnor s Theorem Let α: [, b] R n be curve nd P = {t 0,...,t n } be prtton of [, b], then the
More informationINTRODUCTION TO COMPLEX NUMBERS
INTRODUCTION TO COMPLEX NUMBERS The numers -4, -3, -, -1, 0, 1,, 3, 4 represent the negtve nd postve rel numers termed ntegers. As one frst lerns n mddle school they cn e thought of s unt dstnce spced
More informationLeast squares. Václav Hlaváč. Czech Technical University in Prague
Lest squres Václv Hlváč Czech echncl Unversty n Prgue hlvc@fel.cvut.cz http://cmp.felk.cvut.cz/~hlvc Courtesy: Fred Pghn nd J.P. Lews, SIGGRAPH 2007 Course; Outlne 2 Lner regresson Geometry of lest-squres
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationOn cyclic of Steiner system (v); V=2,3,5,7,11,13
On cyclc of Stener system (v); V=,3,5,7,,3 Prof. Dr. Adl M. Ahmed Rana A. Ibraham Abstract: A stener system can be defned by the trple S(t,k,v), where every block B, (=,,,b) contans exactly K-elementes
More informationVector Spaces. distributive law u,v. Associative Law. 1 v v. Let 1 be the unit element in F, then
1 Def: V be a set of elements with a binary operation + is defined. F be a field. A multiplication operator between a F and v V is also defined. The V is called a vector space over the field F if: V is
More informationExpected Value and Variance
MATH 38 Expected Value and Varance Dr. Neal, WKU We now shall dscuss how to fnd the average and standard devaton of a random varable X. Expected Value Defnton. The expected value (or average value, or
More informationCOMPLEX NUMBER & QUADRATIC EQUATION
MCQ COMPLEX NUMBER & QUADRATIC EQUATION Syllus : Comple numers s ordered prs of rels, Representton of comple numers n the form + nd ther representton n plne, Argnd dgrm, lger of comple numers, modulus
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationRank One Update And the Google Matrix by Al Bernstein Signal Science, LLC
Introducton Rnk One Updte And the Google Mtrx y Al Bernsten Sgnl Scence, LLC www.sgnlscence.net here re two dfferent wys to perform mtrx multplctons. he frst uses dot product formulton nd the second uses
More informationThe Parity of the Number of Irreducible Factors for Some Pentanomials
The Party of the Nuber of Irreducble Factors for Soe Pentanoals Wolfra Koepf 1, Ryul K 1 Departent of Matheatcs Unversty of Kassel, Kassel, F. R. Gerany Faculty of Matheatcs and Mechancs K Il Sung Unversty,
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationInternational Mathematical Olympiad. Preliminary Selection Contest 2012 Hong Kong. Outline of Solutions
Internatonal Mathematcal Olympad Prelmnary Selecton ontest Hong Kong Outlne of Solutons nswers: 7 4 7 4 6 5 9 6 99 7 6 6 9 5544 49 5 7 4 6765 5 6 6 7 6 944 9 Solutons: Snce n s a two-dgt number, we have
More informationOn the number of regions in an m-dimensional space cut by n hyperplanes
6 On the nuber of regons n an -densonal space cut by n hyperplanes Chungwu Ho and Seth Zeran Abstract In ths note we provde a unfor approach for the nuber of bounded regons cut by n hyperplanes n general
More informationComplex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1)
Complex Numbers If you have not yet encountered complex numbers, you wll soon do so n the process of solvng quadratc equatons. The general quadratc equaton Ax + Bx + C 0 has solutons x B + B 4AC A For
More informationUNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS. M.Sc. in Economics MICROECONOMIC THEORY I. Problem Set II
Mcroeconomc Theory I UNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS MSc n Economcs MICROECONOMIC THEORY I Techng: A Lptns (Note: The number of ndctes exercse s dffculty level) ()True or flse? If V( y )
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationA Family of Multivariate Abel Series Distributions. of Order k
Appled Mthemtcl Scences, Vol. 2, 2008, no. 45, 2239-2246 A Fmly of Multvrte Abel Seres Dstrbutons of Order k Rupk Gupt & Kshore K. Ds 2 Fculty of Scence & Technology, The Icf Unversty, Agrtl, Trpur, Ind
More informationMachine Learning. Support Vector Machines. Le Song. CSE6740/CS7641/ISYE6740, Fall Lecture 8, Sept. 13, 2012 Based on slides from Eric Xing, CMU
Mchne Lernng CSE6740/CS764/ISYE6740 Fll 0 Support Vector Mchnes Le Song Lecture 8 Sept. 3 0 Bsed on sldes fro Erc Xng CMU Redng: Chp. 6&7 C.B ook Outlne Mu rgn clssfcton Constrned optzton Lgrngn dult Kernel
More informationESCI 342 Atmospheric Dynamics I Lesson 1 Vectors and Vector Calculus
ESI 34 tmospherc Dnmcs I Lesson 1 Vectors nd Vector lculus Reference: Schum s Outlne Seres: Mthemtcl Hndbook of Formuls nd Tbles Suggested Redng: Mrtn Secton 1 OORDINTE SYSTEMS n orthonorml coordnte sstem
More informationExample: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,
The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson
More informationLecture 3: Probability Distributions
Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the
More informationDEFINITION OF ASSOCIATIVE OR DIRECT PRODUCT AND ROTATION OF VECTORS
3 DEFINITION OF ASSOCIATIVE OR DIRECT PRODUCT AND ROTATION OF VECTORS This chpter summrizes few properties of Cli ord Algebr nd describe its usefulness in e ecting vector rottions. 3.1 De nition of Associtive
More informationSolubilities and Thermodynamic Properties of SO 2 in Ionic
Solubltes nd Therodync Propertes of SO n Ionc Lquds Men Jn, Yucu Hou, b Weze Wu, *, Shuhng Ren nd Shdong Tn, L Xo, nd Zhgng Le Stte Key Lbortory of Checl Resource Engneerng, Beng Unversty of Checl Technology,
More informationChapter 3. Vector Spaces
3.4 Liner Trnsformtions 1 Chpter 3. Vector Spces 3.4 Liner Trnsformtions Note. We hve lredy studied liner trnsformtions from R n into R m. Now we look t liner trnsformtions from one generl vector spce
More informationON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES
Journal of Algebra, Nuber Theory: Advances and Applcatons Volue 3, Nuber, 05, Pages 3-8 ON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES Feldstrasse 45 CH-8004, Zürch Swtzerland e-al: whurlann@bluewn.ch
More informationBases for Vector Spaces
Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
More informationALGEBRA HW 7 CLAY SHONKWILER
ALGEBRA HW 7 CLAY SHONKWILER 1 Whch of the followng rngs R are dscrete valuaton rngs? For those that are, fnd the fracton feld K = frac R, the resdue feld k = R/m (where m) s the maxmal deal), and a unformzer
More informationNumbers Related to Bernoulli-Goss Numbers
ursh Journl of Anlyss n Nuber heory, 4, Vol., No., -8 Avlble onlne t htt://ubs.sceub.co/tnt///4 Scence n Eucton Publshng OI:.69/tnt---4 Nubers Relte to Bernoull-Goss Nubers Mohe Oul ouh Benough * érteent
More information28 Finitely Generated Abelian Groups
8 Fntely Generated Abelan Groups In ths last paragraph of Chapter, we determne the structure of fntely generated abelan groups A complete classfcaton of such groups s gven Complete classfcaton theorems
More informationISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013
ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run
More information1 Definition of Rademacher Complexity
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #9 Scrbe: Josh Chen March 5, 2013 We ve spent the past few classes provng bounds on the generalzaton error of PAClearnng algorths for the
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationAn Introduction to Morita Theory
An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationApplied Mathematics Letters
Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć
More informationSTUDY GUIDE FOR BASIC EXAM
STUDY GUIDE FOR BASIC EXAM BRYON ARAGAM This is prtil list of theorems tht frequently show up on the bsic exm. In mny cses, you my be sked to directly prove one of these theorems or these vrints. There
More informationDISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization
DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.
More informationChapter Newton-Raphson Method of Solving a Nonlinear Equation
Chpter 0.04 Newton-Rphson Method o Solvng Nonlner Equton Ater redng ths chpter, you should be ble to:. derve the Newton-Rphson method ormul,. develop the lgorthm o the Newton-Rphson method,. use the Newton-Rphson
More informationDCDM BUSINESS SCHOOL NUMERICAL METHODS (COS 233-8) Solutions to Assignment 3. x f(x)
DCDM BUSINESS SCHOOL NUMEICAL METHODS (COS -8) Solutons to Assgnment Queston Consder the followng dt: 5 f() 8 7 5 () Set up dfference tble through fourth dfferences. (b) Wht s the mnmum degree tht n nterpoltng
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationProblem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?
Homework 8 solutons. Problem 16.1. Whch of the followng defne homomomorphsms from C\{0} to C\{0}? Answer. a) f 1 : z z Yes, f 1 s a homomorphsm. We have that z s the complex conjugate of z. If z 1,z 2
More informationMultiplicative Functions and Möbius Inversion Formula
Multplcatve Functons and Möbus Inverson Forula Zvezdelna Stanova Bereley Math Crcle Drector Mlls College and UC Bereley 1. Multplcatve Functons. Overvew Defnton 1. A functon f : N C s sad to be arthetc.
More informationHomework Notes Week 7
Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2014. All Rghts Reserved. Created: July 15, 1999 Last Modfed: February 9, 2008 Contents 1 Lnear Fttng
More informationALGEBRA MID-TERM. 1 Suppose I is a principal ideal of the integral domain R. Prove that the R-module I R I has no non-zero torsion elements.
ALGEBRA MID-TERM CLAY SHONKWILER 1 Suppose I s a prncpal deal of the ntegral doman R. Prove that the R-module I R I has no non-zero torson elements. Proof. Note, frst, that f I R I has no non-zero torson
More informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More information6 Roots of Equations: Open Methods
HK Km Slghtly modfed 3//9, /8/6 Frstly wrtten t Mrch 5 6 Roots of Equtons: Open Methods Smple Fed-Pont Iterton Newton-Rphson Secnt Methods MATLAB Functon: fzero Polynomls Cse Study: Ppe Frcton Brcketng
More informationFrom the Euclidean Algorithm for Solving a Key Equation for Dual Reed Solomon Codes to the Berlekamp-Massey Algorithm
1 / 32 From the Eucldean Algorthm for Solvng a Key Equaton for Dual Reed Solomon Codes to the Berlekamp-Massey Algorthm Mara Bras-Amorós, Mchael E O Sullvan The Claude Shannon Insttute Workshop on Codng
More informationSection 3.6 Complex Zeros
04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there
More informationPART 1: VECTOR & TENSOR ANALYSIS
PART : VECTOR & TENSOR ANALYSIS wth LINEAR ALGEBRA Obectves Introduce the concepts, theores, nd opertonl mplementton of vectors, nd more generlly tensors, n dvnced engneerng nlyss. The emphss s on geometrc
More informationMATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS
MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples
More informationMath 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions
Exercses from Ross, 3, : Math 26: Probablty MWF pm, Gasson 30 Homework Selected Solutons 3, p. 05 Problems 76, 86 3, p. 06 Theoretcal exercses 3, 6, p. 63 Problems 5, 0, 20, p. 69 Theoretcal exercses 2,
More informationSmarandache-Zero Divisors in Group Rings
Smarandache-Zero Dvsors n Group Rngs W.B. Vasantha and Moon K. Chetry Department of Mathematcs I.I.T Madras, Chenna The study of zero-dvsors n group rngs had become nterestng problem snce 1940 wth the
More informationSMARANDACHE-GALOIS FIELDS
SMARANDACHE-GALOIS FIELDS W. B. Vasantha Kandasamy Deartment of Mathematcs Indan Insttute of Technology, Madras Chenna - 600 036, Inda. E-mal: vasantak@md3.vsnl.net.n Abstract: In ths aer we study the
More informationPolynomials. 1 What is a polynomial? John Stalker
Polynomals John Stalker What s a polynomal? If you thnk you already know what a polynomal s then skp ths secton. Just be aware that I consstently wrte thngs lke p = c z j =0 nstead of p(z) = c z. =0 You
More informationA combinatorial proof of multiple angle formulas involving Fibonacci and Lucas numbers
Notes on Number Theory and Dscrete Mathematcs ISSN 1310 5132 Vol. 20, 2014, No. 5, 35 39 A combnatoral proof of multple angle formulas nvolvng Fbonacc and Lucas numbers Fernando Córes 1 and Dego Marques
More information2 More examples with details
Physcs 129b Lecture 3 Caltech, 01/15/19 2 More examples wth detals 2.3 The permutaton group n = 4 S 4 contans 4! = 24 elements. One s the dentty e. Sx of them are exchange of two objects (, j) ( to j and
More informationChapter 6. BCH Codes
Wreless Informaton Transmsson System Lab Chapter 6 BCH Codes Insttute of Communcatons Engneerng Natonal Sun Yat-sen Unversty Outlne Bnary Prmtve BCH Codes Decodng of the BCH Codes Implementaton of Galos
More informationThe Ramanujan-Nagell Theorem: Understanding the Proof By Spencer De Chenne
The Ramanujan-Nagell Theorem: Understandng the Proof By Spencer De Chenne 1 Introducton The Ramanujan-Nagell Theorem, frst proposed as a conjecture by Srnvasa Ramanujan n 1943 and later proven by Trygve
More information5.2 Exponent Properties Involving Quotients
5. Eponent Properties Involving Quotients Lerning Objectives Use the quotient of powers property. Use the power of quotient property. Simplify epressions involving quotient properties of eponents. Use
More informationContinuous Time Markov Chain
Contnuous Tme Markov Chan Hu Jn Department of Electroncs and Communcaton Engneerng Hanyang Unversty ERICA Campus Contents Contnuous tme Markov Chan (CTMC) Propertes of sojourn tme Relatons Transton probablty
More informationElementary Linear Algebra
Elementry Liner Algebr Anton & Rorres, 1 th Edition Lecture Set 5 Chpter 4: Prt II Generl Vector Spces 163 คณ ตศาสตร ว ศวกรรม 3 สาขาว ชาว ศวกรรมคอมพ วเตอร ป การศ กษา 1/2555 163 คณตศาสตรวศวกรรม 3 สาขาวชาวศวกรรมคอมพวเตอร
More informationMSC: Primary 11A15, Secondary 11A07, 11E25 Keywords: Reciprocity law; octic residue; congruence; quartic Jacobi symbol
Act Arth 159013, 1-5 Congruences for [/] mo ZHI-Hong Sun School of Mthemtcl Scences, Hun Norml Unverst, Hun, Jngsu 3001, PR Chn E-ml: zhhongsun@hoocom Homege: htt://wwwhtceucn/xsjl/szh Abstrct Let Z be
More informationTheoretical foundations of Gaussian quadrature
Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of
More informationLecture 4: Piecewise Cubic Interpolation
Lecture notes on Vrtonl nd Approxmte Methods n Appled Mthemtcs - A Perce UBC Lecture 4: Pecewse Cubc Interpolton Compled 6 August 7 In ths lecture we consder pecewse cubc nterpolton n whch cubc polynoml
More informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
More informationSupporting information How to concatenate the local attractors of subnetworks in the HPFP
n Effcen lgorh for Idenfyng Prry Phenoype rcors of Lrge-Scle Boolen Newor Sng-Mo Choo nd Kwng-Hyun Cho Depren of Mhecs Unversy of Ulsn Ulsn 446 Republc of Kore Depren of Bo nd Brn Engneerng Kore dvnced
More informationLecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationFUNDAMENTALS ON ALGEBRA MATRICES AND DETERMINANTS
Dol Bgyoko (0 FUNDAMENTALS ON ALGEBRA MATRICES AND DETERMINANTS Introducton Expressons of the form P(x o + x + x + + n x n re clled polynomls The coeffcents o,, n re ndependent of x nd the exponents 0,,,
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationIntroduction to Algorithms
Introducton to Algorthms 6.046J/8.40J Lecture 7 Prof. Potr Indyk Data Structures Role of data structures: Encapsulate data Support certan operatons (e.g., INSERT, DELETE, SEARCH) Our focus: effcency of
More informationFitting a Polynomial to Heat Capacity as a Function of Temperature for Ag. Mathematical Background Document
Fttng Polynol to Het Cpcty s Functon of Teperture for Ag. thetcl Bckground Docuent by Theres Jul Zelnsk Deprtent of Chestry, edcl Technology, nd Physcs onouth Unversty West ong Brnch, J 7764-898 tzelns@onouth.edu
More informationThe Regulated and Riemann Integrals
Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue
More informationLecture 22: Logic Synthesis (1)
Lecture 22: Logc Synthess (1) Sldes courtesy o Demng Chen Some sldes Courtesy o Pro. J. Cong o UCLA Outlne Redng Synthess nd optmzton o dgtl crcuts, G. De Mchel, 1994, Secton 2.5-2.5.1 Overvew Boolen lgebr
More informationExponents and Powers
EXPONENTS AND POWERS 9 Exponents nd Powers CHAPTER. Introduction Do you know? Mss of erth is 5,970,000,000,000, 000, 000, 000, 000 kg. We hve lredy lernt in erlier clss how to write such lrge nubers ore
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More information18.781: Solution to Practice Questions for Final Exam
18.781: Soluton to Practce Questons for Fnal Exam 1. Fnd three solutons n postve ntegers of x 6y = 1 by frst calculatng the contnued fracton expanson of 6. Soluton: We have 1 6=[, ] 6 6+ =[, ] 1 =[,, ]=[,,
More informationMATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1
MATH34032: Green s Functions, Integrl Equtions nd the Clculus of Vritions 1 Section 1 Function spces nd opertors Here we gives some brief detils nd definitions, prticulrly relting to opertors. For further
More information= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.
Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and
More informationMath 261 Exercise sheet 2
Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse
More information