Algebra in a Category

Size: px
Start display at page:

Download "Algebra in a Category"

Transcription

1 Algebr in Ctegory Dniel Muret Otober 5, 2006 In the topos Sets we build lgebri strutures out o sets nd opertions (morphisms between sets) where the opertions re required to stisy vrious xioms. One we hve trnslted these xioms into digrmmti orm, we n opy the deinition into ny tegory with inite produts. The dvntge o suh onstrutions is tht mny o the omplited onepts turn out to be simple objets (suh s rings or groups) built up inside tegory other thn Sets. We begin this note by explining how to build belin groups, rings nd modules in ny tegory with inite produts. We then show tht the tegories o these objets hve vrious nie properties. Throughout we will be deling with produts A n nd sine in generl tegory there my be no nonil produt, there is some potentil mbiguity. Our stnding ssumptions bout the underlying set theory inlude strong orm o the xiom o hoie, whih llows us to selet produt or every set o objets (inluding terminl objet). Throughout ll tegories re nonempty. Contents 1 Deinitions Abelin Groups Rings Right Modules Let Modules Sheves o Groups, Rings nd Modules 6 1 Deinitions 1.1 Abelin Groups An belin group is set A with binry opertion (ddition), unry opertion (dditive inverse), nd nullry opertion (zero). These re morphisms : A A A, (x, y) x + y v : A A, x x u : 1 A, 0 (1) stisying ertin identities, whih n be restted s the ommuttivity o the ollowing digrms: Assoitivity o Addition A A 1

2 Additive Identity A 1 A 1 A 1 u A u 1 Additive Inverses A ( 1 v ) ( v 1 ) A 1 u A 1 u Commuttivity τ A where τ is deined by tking the projetions, p 2 : A A A nd interhnging them - so τ = ( p2 ). Deinition 1. Let C be tegory with inite produts. We deine n belin group objet (or just belin group) in C to be n objet A together with three rrows : A A A, v : A A, u : 1 A or whih the our digrms bove ommute. A morphism o belin groups (A,, v, u) (B,, v, u ) in C is morphism : A B whih ommutes with the struture mps. Tht is, the ollowing three digrms ommute A A A A v A 1 u A A A A A v A 1 u A This deines the tegory Ab(C) o belin groups in C. Note tht Ab(Sets) is isomorphi to the norml tegory o belin groups, nd we will denote both by Ab. Remrk 1. The deinition o n belin group in C inludes morphism A A A. Here the domin is the objet seleted s prt o the ssignment o speii produt C C to every objet C o C, reerred to in the introdution. I we were to mke dierent seletion o produts, the resulting tegory o belin groups in C would be isomorphi. The reder who is unomortble with strong hoie my preer to leve the hoie o produts rbitrry, so tht n belin group in C is n objet A together with morphism : A A A rom some produt o A with itsel to A. This leves open the possibility o the sme belin group ourring more thn one in Ab(C), in the sense o the identity 1 A : A A being n isomorphism o the two dierent objets, without the struture morphisms being the sme! This hppens beuse the morphism : A A A is only determined up to nonil isomorphism, in the sense tht we ould hoose nother produt A A nd would uniquely determine : A A A. In this pproh the tegory Ab(Sets) would only be equivlent to Ab, not isomorphi. One wy round this is to deine n equivlene reltion on group objets tht sys (A,, v, u) (A,, v, u ) i. 1 A is n isomorphism o group objets. A r esier wy is to ept strong xiom o hoie, whih is in ny se essentil to mny other spets o tegory theory. 2

3 1.2 Rings Throughout the rest o this setion, C will be tegory with inite produts. A ring objet (or just ring) in C is n belin group (A,, v, u) together with nother two morphisms m : A A A (multiplition) nd q : 1 A (multiplitive identity) whih mke the ollowing our digrms ommute: Assoitivity o Multiplition A 3 m 1 1 m m A m Multiplitive Identity A 1 A 1 A 1 q m A m To desribe digrms or let nd right distributivity, let, p 2, p 3 : A 3 A be the projetions rom the produt nd onsider the mps φ = p 2 p 3 : A3 A 4, φ = Then we require tht the ollowing two digrms ommute: Let Distributivity A 4 φ A 3 p 2 p 3 1 q 1 : A3 A 4 m m A Right Distributivity A 4 A 3 φ 1 m m A A morphism o rings (A,, v, u, m, q) (B,, v, u, m, q ) is morphism : A B o belin groups whih in ddition mkes the ollowing two digrms ommute: A A m A 1 q A A A m A 1 q A 3

4 This deines the tegory nrng(c) o (not neessrily ommuttive) rings in C. One gin, the tegory nrng(sets) is isomorphi to the usul tegory o not neessrily ommuttive rings, nd we denote both by nrng. We sy ring R nrng(c) is ommuttive i the ollowing digrm ommutes Commuttivity τ m A Here τ is deined by tking the projetions, p 2 : A A A nd interhnging them - so τ = ( p2 ). Let Rng(C) denote the ull subtegory o nrng(c) onsisting o the ommuttive ring objets. The tegory Rng(Sets) is isomorphi to the usul tegory o ommuttive rings, nd we denote both by Rng. 1.3 Right Modules A right module objet (or just right module) over ring (R,, v, u, m, q) in C is group (A,, v, u ) together with morphism : A R A mking the ollowing digrms ommute. Digrms re lbelled with the usul lw they generlise: m ( + b) r = r + b r R 1 A R A R A R A 1 = A 1 1 q A R A (r + s) = r + s A R 2 1 A R A R A R A ( r) s = (rs) A R 2 1 m A R 1 A R A 4

5 A morphism o modules (A,, v, u, ) (B,, v, u, ) is morphism o belin groups whih in ddition mkes the ollowing digrm ommute: A R A 1 B R B This deines the tegory o right modules over the ring objet R nrng(c), whih is denoted Mod(C; R) or more oten just ModR. To void n explosion in nottion we will reer to group, ring nd modules by the objet, nd only reer to the struture morphisms when neessry. 1.4 Let Modules A let module objet (or just let module) over ring (R,, v, u, m, q) in C is group (A,, v, u ) together with morphism : R A A mking the ollowing digrms ommute. Digrms re lbelled with the usul lw they generlise: r ( + b) = r + r b R R A R A 1 R A A 1 = 1 A q 1 R A A (r + s) = r + s R 2 A 1 R A R A R A A s (r ) = (sr) R 2 A m 1 R A 1 R A A A morphism o modules (A,, v, u, ) (B,, v, u, ) is morphism o belin groups whih in ddition mkes the ollowing digrm ommute: R A A 1 R B B 5

6 This deines the tegory o let modules over the ring objet R nrng(c), whih is denoted (C; R)Mod or more oten just RMod. 2 Sheves o Groups, Rings nd Modules In this setion the reder will need to know something bout topoi, in prtiulr bout grothendiek topologies. However, the reder only interested in sheves on topologil spe n keep in mind the entrl exmple o smll site whih we will desribe in moment. For nonempty smll tegory C we denote by P (C) the topos o ontrvrint untors C Sets. We ll the objets o Ab(P (C)) presheves o belin groups, the objets o nrng(p (C)) presheves o rings, nd the objets o Rng(P (C)) presheves o ommuttive rings. Lemm 1. For ny smll tegory C there is nonil isomorphism o tegories E : Ab(P (C)) Ab Cop E(F,, v, u)(c) = (F (C), C, v C, u C ) Proo. Let (F,, v, u) be n belin group objet in P (C). Then or C C, (F (C), C, v C, u C ) is n belin group in Sets, sine digrms in untor tegories ommute i. they ommute pointwise. Similrly, i φ : C C then F (φ) is morphism o the pproprite groups, sine, v, u re nturl. Also, i : F G is morphism o group objets, then it is lso nturl trnsormtion o the group vlued untors. In the opposite diretion, i F : C op Ab then the struture morphisms on eh F (C) (whih re untions between sets) piee together to orm nturl trnsormtions, v, u (o setvlued untors), nd the tuple (F,, v, u) is in Ab(P (C)). A morphism F G o untors is nturlly morphism o the group objets produed rom F, G. One we hek tht these two ssignments re in t inverse, we see tht we hve the desired isomorphism. Lemm 2. For ny smll tegory C there re nonil isomorphisms o tegories E : nrng(p (C)) nrng Cop E : Rng(P (C)) Rng Cop E(F,, v, u, m, q)(c) = (F (C), C, v C, u C, m C, q C ) Using the previous two Lemms, we heneorth identiy the tegories Ab(P (C)) nd Ab Cop, with similr onvention holding or rings nd ommuttive rings. Corollry 3. Let C be smll tegory. Then Ab(P (C)) is omplete grothendiek belin tegory, Rng(P (C)) is omplete nd oomplete nd nrng(p (C)) is omplete. Proo. These sttements ollow immeditely rom the t tht Ab is omplete grothendiek belin, Rng is omplete nd oomplete nd nrng is omplete. Deinition 2. A smll site is pir (C, J) onsisting o smll tegory C nd grothendiek topology J on C. Let X be topologil spe nd C the tegory o open sets o X. Then the open over topology J is grothendiek topology, nd the pir (C, J) is n exmple o smll site. A preshe o sets on C is she in the usul sense i nd only i it is J-she. The reder not milir with topoi n substitute this exmple every time we mention smll sites. Deinition 3. Let (C, J) be smll site. A she o belin groups on C is n objet A Ab(P (C)) whih is J-she when onsidered s preshe o sets. Similrly we deine sheves o rings nd sheves o ommuttive rings on C. Sine limits in Sh J (C) re omputed pointwise, the objets o Ab(Sh J (C)) re preisely the sheves o belin groups, nd similrly or rings nd ommuttive rings. Thereore Ab(Sh J (C)) is ull subtegory o Ab(P (C)), nd similrly or nrng nd Rng. 6

7 Let (C, J) be smll site nd P preshe o sets on C. Let P + be the preshe o sets obtined by the plus-onstrution nd η : P P + the nonil morphism o presheves o sets. I P is preshe o belin groups, then P + is preshe o belin groups with ddition {x S} + {y g g T } = {x h + y h h S T } nd η is morphism o presheves o belin groups. Similrly i P is preshe o rings, so is P +, with the multiplition {x S} {y g g T } = {x h y h h S T } nd η is morphism o presheves o rings. I P is preshe o ommuttive rings, so is P +. I φ : P Q is morphism o presheves o belin groups, rings or ommuttive rings, so is φ + : P + Q +. Thereore pplying this onstrution twie gives untors : Ab(P (C)) Ab(Sh J (C)) : nrng(p (C)) nrng(sh J (C)) : Rng(P (C)) Rng(Sh J (C)) Fix one o the three types o struture nd let i denote the inlusion. Then P P + (P + ) + gives nturl trnsormtion η : 1 i whih is esily seen to be the unit o n djuntion i. Sine produts nd pullbks in Sh J (C) re omputed pointwise, nd pointwise quire group nd ring strutures, the untors ll preserve inite limits. Thereore Ab(Sh J (C)) is Girud subtegory o Ab(P (C)) nd similrly or rings nd ommuttive rings. Remrk 2. The sheiition untor just deined is the one typilly introdued in the theory o topoi. In the speil se where our smll site is the open over topology on topologil spe, the sheiition untor is usully desribed dierently. Both onstrutions must yield nturlly equivlent untors, so this dierene is nothing to worry bout. Corollry 4. Let (C, J) be smll site. Then Ab(Sh J (C)) is omplete grothendiek belin tegory, Rng(Sh J (C)) is omplete nd oomplete nd nrng(sh J (C)) is omplete. In prtiulr this is true or sheves o belin groups, rings nd ommuttive rings on topologil spe X. Deinition 4. I (C, J) is smll site nd P she o belin groups on C, subshe o belin groups is monomorphism η : Q P o sheves o belin groups with the property tht η C : Q(C) P (C) is the inlusion o subset or every C C. Every subobjet o P is equivlent to subshe. I Q, Q re subsheves o belin groups o P then Q Q i nd only i Q(p) Q (p) or every p C. Corollry 5. Let (C, J) be smll site. The strutures on the belin tegory Ab(Sh J (C)) re desribed s ollows Zero The zero objet is the preshe Z(p) = 0. Kernel I φ : M N is morphism o sheves o belin groups, then K(p) = Ker(φ p ) deines she o belin groups, nd the inlusion K M is the kernel o φ. Cokernel I φ : M N is morphism o sheves o belin groups, then C(p) = N(p)/Im(φ p ) deines preshe o belin groups, nd the nonol morphism N C C is the okernel o φ. Limits I D is digrm o presheves o belin groups, then deine L(p) to be the limit o the digrm D(p) o belin groups. This beomes she o belin groups nd the projetions L D i re limit or the digrm. Colimits I D is digrm o presheves o belin groups, then deine C(p) to be the olimit o the digrm D(p) o belin groups. This beomes preshe o belin groups nd the morphisms D i C C re olimit or the digrm. 7

8 Imge Let φ : M N be morphism o sheves o belin groups nd I the subshe o belin groups o N deined by n I(p) i nd only i there exists T J(p) suh tht n h Im(φ q ) or every h : q p in T. Then I N is the imge o φ. Inverse Imge Let φ : M N be morphism o sheves o belin groups nd T N subshe o belin groups o N. Then the inverse imge φ 1 T is the subshe o belin groups o M deined by (φ 1 T )(p) = φ 1 p (T (p)). Proo. Sine Ab(Sh J (C)) is Girud subtegory o Ab(P (C)) the lims re ll esily heked (AC,Setion 3). Deinition 5. Let C be smll tegory nd R preshe o rings on C. A preshe o right modules over R is n objet o Mod(P (C); R). This onsists o the ollowing dt: preshe o belin groups M : C op Ab together with right R(C)-module struture on M(C) or every C C, with the property tht (m r) = m r or : D C, r R(C) nd m M(C). We use the nottion or M()( ) nd R()( ) to mke the nottion neter. Similrly preshe o let modules over R is n objet o (P (C); R)Mod, whih onsists o preshe o belin groups M together with let R(C)-module struture on M(C) or every C C, with the property tht (r m) = r m. Deinition 6. Let (C, J) be smll site nd R she o rings on C. A she o right modules over R is n objet o Mod(Sh J (C); R), whih is just preshe o right modules over R whih hppens to be J-she. Thereore Mod(Sh J (C); R) is ull subtegory o Mod(P (C); R). Similrly she o let modules over R is n objet o (Sh J (C); R)Mod, whih is preshe o let R-modules tht is J-she, so (Sh J (C); R)Mod is ull subtegory o (P (C); R)Mod. Let (C, J) be smll site nd R she o rings on C. I P is preshe o right R-modules, then the preshe o belin groups P + obtined rom the plus-onstrution is preshe o right R-modules with tion {x S} r = {x r S} Similrly i P is preshe o let R-modules, then P + beomes preshe o let R-modules. The morphism P P + is then morphism o presheves o modules. I φ : P Q is morphism o presheves o modules, then so is φ +. Thereore pplying this onstrution twie gives untors : Mod(P (C); R) Mod(Sh J (C); R) : (P (C); R)Mod (Sh J (C); R)Mod In both ses P P + P ++ gives nturl trnsormtion η : 1 i whih is esily seen to be the unint o n djuntion i. As or sheves o groups, one heks tht preserves ll inite limits, nd thereore Mod(Sh J (C); R) is Girud subtegory o Mod(P (C); R) nd similrly or let modules. Now let (C, J) be smll site nd R preshe o rings on C. I P is preshe o right R- modules, then the preshe o belin groups P + beomes preshe o right R + -modules, where R + is the preshe o rings obtined rom R, vi the tion {x S} {r g g T } = {x h r h h S T } Similrly i P is preshe o let R-modules, then P + beomes preshe o let R-modules. The morphism P P + is then morphism o presheves o belin groups omptible with the morphism o presheves o rings R R +. I φ : P Q is morphism o presheves o modules, then φ + is morphism o presheves o R + -modules. Thereore pplying this onstrution twie, nd denoting the she o rings R ++ by R, we hve untors : Mod(P (C); R) Mod(Sh J (C); R) : (P (C); R)Mod (Sh J (C); R)Mod 8

9 Deinition 7. Let C be smll tegory nd R preshe o rings on C. Deine nother preshe o rings R op : C op nrng by R op (C) = R(C) op, the opposite ring o R(C). We let R op gree with R on morphisms. Clerly R = (R op ) op nd R is ommuttive i nd only i R = R op. I (C, J) is smll site then R is she o rings i nd only i R op is. Lemm 6. Let C be smll tegory nd R preshe o rings on C. Then there is nonil isomorphism o tegories T : (P (C); R)Mod Mod(P (C); R op ) T (A,, v, u, ) = (A,, v, u, τ) where τ : A R R A is the nonil twist. I (C, J) is smll site nd R she o rings on C, then there is nonil isomorphism o tegories T : (Sh J (C); R)Mod Mod(Sh J (C); R op ) T (A,, v, u, ) = (A,, v, u, τ) Proo. It suies to hek the irst sttement. Using the pointwise riterion or the dt to determine preshe o right modules, it is esy to see tht T is well-deined untor, whih is n isomorphism sine the twist is invertible. Deinition 8. Let (C, J) be smll site. A she o Z-grded rings on C is she o rings R together with set o subsheves o belin groups R d, d Z suh tht the morphisms R d R indue n isomorphism o sheves o belin groups d Z R d = R nd or d, e Z, C C nd s R d (C), t R e (C) we must hve st R d+e (C). We lso require tht 1 R 0 (C). We sy R is positive or is she o grded rings i R d = 0 or ll d < 0. Deinition 9. Let (C, J) be smll site nd R she o Z-grded rings. A she o grded let R-modules is she o let R-modules M together with set o subsheves o belin groups {M n } n Z suh tht the morphisms M n M indue n isomorphism o sheves o belin groups n Z M n = M nd suh tht or C C, d, n Z nd s R d (C), m M n (C) we hve s m M n+d (C). A morphism o sheves o grded let R-modules is morphism o sheves o let R-modules M N whih rries M n into N n or ll n Z. This mkes the sheves o grded let R-modules into predditive tegory, denoted (Sh J (C); R)GrMod. Similrly she o grded right R-modules is she o right R-modules M together with set o subsheves o belin groups {M n } n Z suh tht the morphisms M n M indue n isomorphism o sheves o belin groups n Z M n = M nd suh tht or C C, d, n Z nd s R d (C), m M n (C) we hve m s M n+d (C). A morphism o sheves o grded right R-modules is morphism o sheves o right R-modules preserving grde. This mkes the sheves o grded right R-modules into predditive tegory, denoted GrMod(Sh J (C); R). I φ : M N is morphism o sheves o grded R-modules (right or let) then or n Z the mps φ p : M(p) N(p) restrit to give morphisms o belin groups M n (p) N n (p) whih deine morphism o sheves o belin groups φ n : M n N n. Then φ = n φ n in the sense tht φ is the unique morphism o sheves o belin groups mking the ollowing digrm ommute or every n Z M φ N M n φ n N n Let (C, J) be smll site, S she o Z-grded rings nd onsider the oprodut o presheves o belin groups A = n Z S n. For p C we deine ring struture on the belin group A(p) = n S n(p) by {(s n )(t n )} i = s x t y x+y=i 9

10 using the produt in the ring S(p). This mkes A into preshe o rings on C (lerly A(p) is ommuttive i S(p) is). Let Q be the she o rings on C obtined by sheiying A, whih is Z-grded ring with the subsheves given by the imges o S d A Q. The nonil morphism o presheves o rings A S given pointwise by the morphism n S n(p) S(p) indued by the inlusions S n (p) S(p) indues n isomorphism o sheves o Z-grded rings ϕ : Q S. This shows tht she o Z-grded rings is determined by the groups S n (p) or n Z, p C nd the multiplition rules or homogenous elements. For more long this line see (LC,Setion 3). Deinition 10. Let (C, J) be smll site nd R she o Z-grded rings. Then the she o rings R op is she o Z-grded rings with the sme grding, whih we ll the opposite Z-grded ring. Lemm 7. Let (C, J) be smll site nd R she o Z-grded rings. Then there is nonil isomorphism o tegories T : (Sh J (C); R)GrMod GrMod(Sh J (C); R op ) Proo. Given she o grded let R-modules M, let T (M) be the nonil she o right R op - modules s deined bove. The subsheves M n mke T (M) into she o grded right R-modules. The untor T ts s the identity on morphisms, nd it is obvious tht T is n isomorphism. Reerenes [1] B. Mithell, Theory o Ctegories, Ademi Press (1965). 10

The Riemann and the Generalised Riemann Integral

The Riemann and the Generalised Riemann Integral The Riemnn nd the Generlised Riemnn Integrl Clvin 17 July 14 Contents 1 The Riemnn Integrl 1.1 Riemnn Integrl............................................ 1. Properties o Riemnn Integrble Funtions.............................

More information

MAT 403 NOTES 4. f + f =

MAT 403 NOTES 4. f + f = MAT 403 NOTES 4 1. Fundmentl Theorem o Clulus We will proo more generl version o the FTC thn the textook. But just like the textook, we strt with the ollowing proposition. Let R[, ] e the set o Riemnn

More information

Bisimulation, Games & Hennessy Milner logic

Bisimulation, Games & Hennessy Milner logic Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory

More information

6.1 Definition of the Riemann Integral

6.1 Definition of the Riemann Integral 6 The Riemnn Integrl 6. Deinition o the Riemnn Integrl Deinition 6.. Given n intervl [, b] with < b, prtition P o [, b] is inite set o points {x, x,..., x n } [, b], lled grid points, suh tht x =, x n

More information

Chapter 3. Vector Spaces. 3.1 Images and Image Arithmetic

Chapter 3. Vector Spaces. 3.1 Images and Image Arithmetic Chpter 3 Vetor Spes In Chpter 2, we sw tht the set of imges possessed numer of onvenient properties. It turns out tht ny set tht possesses similr onvenient properties n e nlyzed in similr wy. In liner

More information

Boolean Algebra cont. The digital abstraction

Boolean Algebra cont. The digital abstraction Boolen Alger ont The igitl strtion Theorem: Asorption Lw For every pir o elements B. + =. ( + ) = Proo: () Ientity Distriutivity Commuttivity Theorem: For ny B + = Ientity () ulity. Theorem: Assoitive

More information

Introduction to Group Theory

Introduction to Group Theory Introduction to Group Theory Let G be n rbitrry set of elements, typiclly denoted s, b, c,, tht is, let G = {, b, c, }. A binry opertion in G is rule tht ssocites with ech ordered pir (,b) of elements

More information

MA10207B: ANALYSIS SECOND SEMESTER OUTLINE NOTES

MA10207B: ANALYSIS SECOND SEMESTER OUTLINE NOTES MA10207B: ANALYSIS SECOND SEMESTER OUTLINE NOTES CHARLIE COLLIER UNIVERSITY OF BATH These notes hve been typeset by Chrlie Collier nd re bsed on the leture notes by Adrin Hill nd Thoms Cottrell. These

More information

The Regulated and Riemann Integrals

The 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 information

INTEGRATION. 1 Integrals of Complex Valued functions of a REAL variable

INTEGRATION. 1 Integrals of Complex Valued functions of a REAL variable INTEGRATION NOTE: These notes re supposed to supplement Chpter 4 of the online textbook. 1 Integrls of Complex Vlued funtions of REAL vrible If I is n intervl in R (for exmple I = [, b] or I = (, b)) nd

More information

Co-ordinated s-convex Function in the First Sense with Some Hadamard-Type Inequalities

Co-ordinated s-convex Function in the First Sense with Some Hadamard-Type Inequalities Int. J. Contemp. Mth. Sienes, Vol. 3, 008, no. 3, 557-567 Co-ordinted s-convex Funtion in the First Sense with Some Hdmrd-Type Inequlities Mohmmd Alomri nd Mslin Drus Shool o Mthemtil Sienes Fulty o Siene

More information

Lecture 1 - Introduction and Basic Facts about PDEs

Lecture 1 - Introduction and Basic Facts about PDEs * 18.15 - Introdution to PDEs, Fll 004 Prof. Gigliol Stffilni Leture 1 - Introdution nd Bsi Fts bout PDEs The Content of the Course Definition of Prtil Differentil Eqution (PDE) Liner PDEs VVVVVVVVVVVVVVVVVVVV

More information

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

Project 6: Minigoals Towards Simplifying and Rewriting Expressions MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy

More information

Figure 1. The left-handed and right-handed trefoils

Figure 1. The left-handed and right-handed trefoils The Knot Group A knot is n emedding of the irle into R 3 (or S 3 ), k : S 1 R 3. We shll ssume our knots re tme, mening the emedding n e extended to solid torus, K : S 1 D 2 R 3. The imge is lled tuulr

More information

arxiv: v1 [math.ca] 21 Aug 2018

arxiv: v1 [math.ca] 21 Aug 2018 rxiv:1808.07159v1 [mth.ca] 1 Aug 018 Clulus on Dul Rel Numbers Keqin Liu Deprtment of Mthemtis The University of British Columbi Vnouver, BC Cnd, V6T 1Z Augest, 018 Abstrt We present the bsi theory of

More information

Coalgebra, Lecture 15: Equations for Deterministic Automata

Coalgebra, Lecture 15: Equations for Deterministic Automata Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined

More information

Part 4. Integration (with Proofs)

Part 4. Integration (with Proofs) Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1

More information

Generalization of 2-Corner Frequency Source Models Used in SMSIM

Generalization of 2-Corner Frequency Source Models Used in SMSIM Generliztion o 2-Corner Frequeny Soure Models Used in SMSIM Dvid M. Boore 26 Mrh 213, orreted Figure 1 nd 2 legends on 5 April 213, dditionl smll orretions on 29 My 213 Mny o the soure spetr models ville

More information

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1)

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1) Green s Theorem Mth 3B isussion Session Week 8 Notes Februry 8 nd Mrh, 7 Very shortly fter you lerned how to integrte single-vrible funtions, you lerned the Fundmentl Theorem of lulus the wy most integrtion

More information

Pre-Lie algebras, rooted trees and related algebraic structures

Pre-Lie algebras, rooted trees and related algebraic structures Pre-Lie lgers, rooted trees nd relted lgeri strutures Mrh 23, 2004 Definition 1 A pre-lie lger is vetor spe W with mp : W W W suh tht (x y) z x (y z) = (x z) y x (z y). (1) Exmple 2 All ssoitive lgers

More information

Lecture 1. Functional series. Pointwise and uniform convergence.

Lecture 1. Functional series. Pointwise and uniform convergence. 1 Introduction. Lecture 1. Functionl series. Pointwise nd uniform convergence. In this course we study mongst other things Fourier series. The Fourier series for periodic function f(x) with period 2π is

More information

6.5 Improper integrals

6.5 Improper integrals Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =

More information

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6 CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized

More information

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides. 1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the

More information

arxiv: v1 [math.ct] 8 Sep 2009

arxiv: v1 [math.ct] 8 Sep 2009 On the briding of n Ann-tegory rxiv:0909.1486v1 [mth.ct] 8 Sep 2009 September 8, 2009 NGUYEN TIEN QUANG nd DANG DINH HANH Dept. of Mthemtis, Hnoi Ntionl University of Edution, Viet Nm Emil: nguyenqung272002@gmil.om

More information

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:

More information

Journal of Inequalities in Pure and Applied Mathematics

Journal of Inequalities in Pure and Applied Mathematics Journl o Inequlities in Pure nd Applied Mthemtics http://jipm.vu.edu.u/ Volume 6, Issue 4, Article 6, 2005 MROMORPHIC UNCTION THAT SHARS ON SMALL UNCTION WITH ITS DRIVATIV QINCAI ZHAN SCHOOL O INORMATION

More information

ad = cb (1) cf = ed (2) adf = cbf (3) cf b = edb (4)

ad = cb (1) cf = ed (2) adf = cbf (3) cf b = edb (4) 10 Most proofs re left s reding exercises. Definition 10.1. Z = Z {0}. Definition 10.2. Let be the binry reltion defined on Z Z by, b c, d iff d = cb. Theorem 10.3. is n equivlence reltion on Z Z. Proof.

More information

Discrete Structures Lecture 11

Discrete Structures Lecture 11 Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.

More information

Abstraction of Nondeterministic Automata Rong Su

Abstraction of Nondeterministic Automata Rong Su Astrtion of Nondeterministi Automt Rong Su My 6, 2010 TU/e Mehnil Engineering, Systems Engineering Group 1 Outline Motivtion Automton Astrtion Relevnt Properties Conlusions My 6, 2010 TU/e Mehnil Engineering,

More information

Electromagnetism Notes, NYU Spring 2018

Electromagnetism Notes, NYU Spring 2018 Eletromgnetism Notes, NYU Spring 208 April 2, 208 Ation formultion of EM. Free field desription Let us first onsider the free EM field, i.e. in the bsene of ny hrges or urrents. To tret this s mehnil system

More information

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their

More information

Notes on length and conformal metrics

Notes on length and conformal metrics Notes on length nd conforml metrics We recll how to mesure the Eucliden distnce of n rc in the plne. Let α : [, b] R 2 be smooth (C ) rc. Tht is α(t) (x(t), y(t)) where x(t) nd y(t) re smooth rel vlued

More information

The one-dimensional Henstock-Kurzweil integral

The one-dimensional Henstock-Kurzweil integral Chpter 1 The one-dimensionl Henstock-Kurzweil integrl 1.1 Introduction nd Cousin s Lemm The purpose o this monogrph is to study multiple Henstock-Kurzweil integrls. In the present chpter, we shll irst

More information

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4. Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix

More information

Green s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e

Green s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e Green s Theorem. Let be the boundry of the unit squre, y, oriented ounterlokwise, nd let F be the vetor field F, y e y +, 2 y. Find F d r. Solution. Let s write P, y e y + nd Q, y 2 y, so tht F P, Q. Let

More information

TOPIC: LINEAR ALGEBRA MATRICES

TOPIC: LINEAR ALGEBRA MATRICES Interntionl Blurete LECTUE NOTES for FUTHE MATHEMATICS Dr TOPIC: LINEA ALGEBA MATICES. DEFINITION OF A MATIX MATIX OPEATIONS.. THE DETEMINANT deta THE INVESE A -... SYSTEMS OF LINEA EQUATIONS. 8. THE AUGMENTED

More information

Handout: Natural deduction for first order logic

Handout: Natural deduction for first order logic MATH 457 Introduction to Mthemticl Logic Spring 2016 Dr Json Rute Hndout: Nturl deduction for first order logic We will extend our nturl deduction rules for sententil logic to first order logic These notes

More information

16z z q. q( B) Max{2 z z z z B} r z r z r z r z B. John Riley 19 October Econ 401A: Microeconomic Theory. Homework 2 Answers

16z z q. q( B) Max{2 z z z z B} r z r z r z r z B. John Riley 19 October Econ 401A: Microeconomic Theory. Homework 2 Answers John Riley 9 Otober 6 Eon 4A: Miroeonomi Theory Homework Answers Constnt returns to sle prodution funtion () If (,, q) S then 6 q () 4 We need to show tht (,, q) S 6( ) ( ) ( q) q [ q ] 4 4 4 4 4 4 Appeling

More information

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106 8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly

More information

NON-DETERMINISTIC FSA

NON-DETERMINISTIC FSA Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is

More information

T b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions.

T b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions. Rel Vribles, Fll 2014 Problem set 5 Solution suggestions Exerise 1. Let f be bsolutely ontinuous on [, b] Show tht nd T b (f) P b (f) f (x) dx [f ] +. Conlude tht if f is in AC then it is the differene

More information

The Riemann-Stieltjes Integral

The Riemann-Stieltjes Integral Chpter 6 The Riemnn-Stieltjes Integrl 6.1. Definition nd Eistene of the Integrl Definition 6.1. Let, b R nd < b. ( A prtition P of intervl [, b] is finite set of points P = { 0, 1,..., n } suh tht = 0

More information

CS 573 Automata Theory and Formal Languages

CS 573 Automata Theory and Formal Languages Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple

More information

1.3 SCALARS AND VECTORS

1.3 SCALARS AND VECTORS Bridge Course Phy I PUC 24 1.3 SCLRS ND VECTORS Introdution: Physis is the study of nturl phenomen. The study of ny nturl phenomenon involves mesurements. For exmple, the distne etween the plnet erth nd

More information

On the Co-Ordinated Convex Functions

On the Co-Ordinated Convex Functions Appl. Mth. In. Si. 8, No. 3, 085-0 0 085 Applied Mthemtis & Inormtion Sienes An Interntionl Journl http://.doi.org/0.785/mis/08038 On the Co-Ordinted Convex Funtions M. Emin Özdemir, Çetin Yıldız, nd Ahmet

More information

Introduction to Olympiad Inequalities

Introduction to Olympiad Inequalities Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................

More information

(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P.

(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P. Chpter 7: The Riemnn Integrl When the derivtive is introdued, it is not hrd to see tht the it of the differene quotient should be equl to the slope of the tngent line, or when the horizontl xis is time

More information

INDIAN INSTITUTE OF TECHNOLOGY BOMBAY MA205 Complex Analysis Autumn 2012

INDIAN INSTITUTE OF TECHNOLOGY BOMBAY MA205 Complex Analysis Autumn 2012 Lecture 6: Line Integrls INDIAN INSTITUTE OF TECHNOLOGY BOMBAY MA205 Complex Anlysis Autumn 2012 August 8, 2012 Lecture 6: Line Integrls Lecture 6: Line Integrls Lecture 6: Line Integrls Integrls of complex

More information

Natural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring

Natural examples of rings are the ring of integers, a ring of polynomials in one variable, the ring More generlly, we define ring to be non-empty set R hving two binry opertions (we ll think of these s ddition nd multipliction) which is n Abelin group under + (we ll denote the dditive identity by 0),

More information

Line Integrals. Chapter Definition

Line Integrals. Chapter Definition hpter 2 Line Integrls 2.1 Definition When we re integrting function of one vrible, we integrte long n intervl on one of the xes. We now generlize this ide by integrting long ny curve in the xy-plne. It

More information

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd

More information

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into

More information

FUNDAMENTALS OF REAL ANALYSIS by. III.1. Measurable functions. f 1 (

FUNDAMENTALS OF REAL ANALYSIS by. III.1. Measurable functions. f 1 ( FUNDAMNTALS OF RAL ANALYSIS by Doğn Çömez III. MASURABL FUNCTIONS AND LBSGU INTGRAL III.. Mesurble functions Hving the Lebesgue mesure define, in this chpter, we will identify the collection of functions

More information

Bernoulli Numbers Jeff Morton

Bernoulli Numbers Jeff Morton Bernoulli Numbers Jeff Morton. We re interested in the opertor e t k d k t k, which is to sy k tk. Applying this to some function f E to get e t f d k k tk d k f f + d k k tk dk f, we note tht since f

More information

Infinite Geometric Series

Infinite Geometric Series Infinite Geometric Series Finite Geometric Series ( finite SUM) Let 0 < r < 1, nd let n be positive integer. Consider the finite sum It turns out there is simple lgebric expression tht is equivlent to

More information

Euler, Ioachimescu and the trapezium rule. G.J.O. Jameson (Math. Gazette 96 (2012), )

Euler, Ioachimescu and the trapezium rule. G.J.O. Jameson (Math. Gazette 96 (2012), ) Euler, Iochimescu nd the trpezium rule G.J.O. Jmeson (Mth. Gzette 96 (0), 36 4) The following results were estblished in recent Gzette rticle [, Theorems, 3, 4]. Given > 0 nd 0 < s

More information

Lecture 2: Cayley Graphs

Lecture 2: Cayley Graphs Mth 137B Professor: Pri Brtlett Leture 2: Cyley Grphs Week 3 UCSB 2014 (Relevnt soure mteril: Setion VIII.1 of Bollos s Moern Grph Theory; 3.7 of Gosil n Royle s Algeri Grph Theory; vrious ppers I ve re

More information

A BRIEF INTRODUCTION TO UNIFORM CONVERGENCE. In the study of Fourier series, several questions arise naturally, such as: c n e int

A BRIEF INTRODUCTION TO UNIFORM CONVERGENCE. In the study of Fourier series, several questions arise naturally, such as: c n e int A BRIEF INTRODUCTION TO UNIFORM CONVERGENCE HANS RINGSTRÖM. Questions nd exmples In the study of Fourier series, severl questions rise nturlly, such s: () (2) re there conditions on c n, n Z, which ensure

More information

Absolute values of real numbers. Rational Numbers vs Real Numbers. 1. Definition. Absolute value α of a real

Absolute values of real numbers. Rational Numbers vs Real Numbers. 1. Definition. Absolute value α of a real Rtionl Numbers vs Rel Numbers 1. Wht is? Answer. is rel number such tht ( ) =. R [ ( ) = ].. Prove tht (i) 1; (ii). Proof. (i) For ny rel numbers x, y, we hve x = y. This is necessry condition, but not

More information

= state, a = reading and q j

= state, a = reading and q j 4 Finite Automt CHAPTER 2 Finite Automt (FA) (i) Derterministi Finite Automt (DFA) A DFA, M Q, q,, F, Where, Q = set of sttes (finite) q Q = the strt/initil stte = input lphet (finite) (use only those

More information

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri

More information

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.

More information

THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p

THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS PETE L CLARK Circ 1870, Zolotrev observed tht the Legendre symbol ( p ) cn be interpreted s the sign of multipliction by viewed s permuttion of the set Z/pZ

More information

Nondeterministic Finite Automata

Nondeterministic Finite Automata Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)

More information

DEFORMATIONS OF ASSOCIATIVE ALGEBRAS WITH INNER PRODUCTS

DEFORMATIONS OF ASSOCIATIVE ALGEBRAS WITH INNER PRODUCTS Homology, Homotopy nd Applitions, vol. 8(2), 2006, pp.115 131 DEFORMATIONS OF ASSOCIATIVE ALGEBRAS WITH INNER PRODUCTS JOHN TERILLA nd THOMAS TRADLER (ommunited y Jim Stsheff) Astrt We develop the deformtion

More information

CHAPTER V INTEGRATION, AVERAGE BEHAVIOR A = πr 2.

CHAPTER V INTEGRATION, AVERAGE BEHAVIOR A = πr 2. CHAPTER V INTEGRATION, AVERAGE BEHAVIOR A πr 2. In this hpter we will derive the formul A πr 2 for the re of irle of rdius r. As mtter of ft, we will first hve to settle on extly wht is the definition

More information

Linear Algebra Introduction

Linear Algebra Introduction Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +

More information

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)} Grph Theory Simple Grph G = (V, E). V ={verties}, E={eges}. h k g f e V={,,,,e,f,g,h,k} E={(,),(,g),(,h),(,k),(,),(,k),...,(h,k)} E =16. 1 Grph or Multi-Grph We llow loops n multiple eges. G = (V, E.ψ)

More information

MAA 4212 Improper Integrals

MAA 4212 Improper Integrals Notes by Dvid Groisser, Copyright c 1995; revised 2002, 2009, 2014 MAA 4212 Improper Integrls The Riemnn integrl, while perfectly well-defined, is too restrictive for mny purposes; there re functions which

More information

Lecture 11 Binary Decision Diagrams (BDDs)

Lecture 11 Binary Decision Diagrams (BDDs) C 474A/57A Computer-Aie Logi Design Leture Binry Deision Digrms (BDDs) C 474/575 Susn Lyseky o 3 Boolen Logi untions Representtions untion n e represente in ierent wys ruth tle, eqution, K-mp, iruit, et

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep

More information

1.9 C 2 inner variations

1.9 C 2 inner variations 46 CHAPTER 1. INDIRECT METHODS 1.9 C 2 inner vritions So fr, we hve restricted ttention to liner vritions. These re vritions of the form vx; ǫ = ux + ǫφx where φ is in some liner perturbtion clss P, for

More information

CS 275 Automata and Formal Language Theory

CS 275 Automata and Formal Language Theory CS 275 Automt nd Forml Lnguge Theory Course Notes Prt II: The Recognition Problem (II) Chpter II.5.: Properties of Context Free Grmmrs (14) Anton Setzer (Bsed on book drft by J. V. Tucker nd K. Stephenson)

More information

On the free product of ordered groups

On the free product of ordered groups rxiv:703.0578v [mth.gr] 6 Mr 207 On the free product of ordered groups A. A. Vinogrdov One of the fundmentl questions of the theory of ordered groups is wht bstrct groups re orderble. E. P. Shimbirev [2]

More information

f (x)dx = f(b) f(a). a b f (x)dx is the limit of sums

f (x)dx = f(b) f(a). a b f (x)dx is the limit of sums Green s Theorem If f is funtion of one vrible x with derivtive f x) or df dx to the Fundmentl Theorem of lulus, nd [, b] is given intervl then, ording This is not trivil result, onsidering tht b b f x)dx

More information

LESSON 11: TRIANGLE FORMULAE

LESSON 11: TRIANGLE FORMULAE . THE SEMIPERIMETER OF TRINGLE LESSON : TRINGLE FORMULE In wht follows, will hve sides, nd, nd these will e opposite ngles, nd respetively. y the tringle inequlity, nd..() So ll of, & re positive rel numers.

More information

Well Centered Spherical Quadrangles

Well Centered Spherical Quadrangles Beiträge zur Algebr und Geometrie Contributions to Algebr nd Geometry Volume 44 (003), No, 539-549 Well Centered Sphericl Qudrngles An M d Azevedo Bred 1 Altino F Sntos Deprtment of Mthemtics, University

More information

Determinants. x 1 y 2 z 3 + x 2 y 3 z 1 + x 3 y 1 z 2 x 1 y 3 z 2 + x 2 y 1 z 3 + x 3 y 2 z 1 = 0,

Determinants. x 1 y 2 z 3 + x 2 y 3 z 1 + x 3 y 1 z 2 x 1 y 3 z 2 + x 2 y 1 z 3 + x 3 y 2 z 1 = 0, 6 Determinnts One person s onstnt is nother person s vrile. Susn Gerhrt While the previous hpters h their ous on the explortion o the logi n struturl properties o projetive plnes this hpter will ous on

More information

SEMICANONICAL BASES AND PREPROJECTIVE ALGEBRAS II: A MULTIPLICATION FORMULA

SEMICANONICAL BASES AND PREPROJECTIVE ALGEBRAS II: A MULTIPLICATION FORMULA SEMICANONICAL BASES AND PREPROJECTIVE ALGEBRAS II: A MULTIPLICATION FORMULA CHRISTOF GEISS, BERNARD LECLERC, AND JAN SCHRÖER Abstrt. Let n be mximl nilpotent sublgebr of omplex symmetri K-Moody Lie lgebr.

More information

Math 4310 Solutions to homework 1 Due 9/1/16

Math 4310 Solutions to homework 1 Due 9/1/16 Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1

More information

NAME: MR. WAIN FUNCTIONS

NAME: MR. WAIN FUNCTIONS NAME: M. WAIN FUNCTIONS evision o Solving Polnomil Equtions i one term in Emples Solve: 7 7 7 0 0 7 b.9 c 7 7 7 7 ii more thn one term in Method: Get the right hnd side to equl zero = 0 Eliminte ll denomintors

More information

Qualgebras and knotted 3-valent graphs

Qualgebras and knotted 3-valent graphs Qulgers nd knotted 3-vlent grphs Vitori Leed To ite this version: Vitori Leed. Qulgers nd knotted 3-vlent grphs. 2014. HAL Id: hl-00951712 https://hl.rhives-ouvertes.fr/hl-00951712 Sumitted

More information

Unit 4. Combinational Circuits

Unit 4. Combinational Circuits Unit 4. Comintionl Ciruits Digitl Eletroni Ciruits (Ciruitos Eletrónios Digitles) E.T.S.I. Informáti Universidd de Sevill 5/10/2012 Jorge Jun 2010, 2011, 2012 You re free to opy, distriute

More information

DIRECT CURRENT CIRCUITS

DIRECT CURRENT CIRCUITS DRECT CURRENT CUTS ELECTRC POWER Consider the circuit shown in the Figure where bttery is connected to resistor R. A positive chrge dq will gin potentil energy s it moves from point to point b through

More information

CHENG Chun Chor Litwin The Hong Kong Institute of Education

CHENG Chun Chor Litwin The Hong Kong Institute of Education PE-hing Mi terntionl onferene IV: novtion of Mthemtis Tehing nd Lerning through Lesson Study- onnetion etween ssessment nd Sujet Mtter HENG hun hor Litwin The Hong Kong stitute of Edution Report on using

More information

A Study on the Properties of Rational Triangles

A Study on the Properties of Rational Triangles Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn

More information

1 Sets Functions and Relations Mathematical Induction Equivalence of Sets and Countability The Real Numbers...

1 Sets Functions and Relations Mathematical Induction Equivalence of Sets and Countability The Real Numbers... Contents 1 Sets 1 1.1 Functions nd Reltions....................... 3 1.2 Mthemticl Induction....................... 5 1.3 Equivlence of Sets nd Countbility................ 6 1.4 The Rel Numbers..........................

More information

Logic Synthesis and Verification

Logic Synthesis and Verification Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most

More information

Lecture 3: Equivalence Relations

Lecture 3: Equivalence Relations Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts

More information

Behavior Composition in the Presence of Failure

Behavior Composition in the Presence of Failure Behvior Composition in the Presene of Filure Sestin Srdin RMIT University, Melourne, Austrli Fio Ptrizi & Giuseppe De Giomo Spienz Univ. Rom, Itly KR 08, Sept. 2008, Sydney Austrli Introdution There re

More information

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004 Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when

More information

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply

More information

Data Structures LECTURE 10. Huffman coding. Example. Coding: problem definition

Data Structures LECTURE 10. Huffman coding. Example. Coding: problem definition Dt Strutures, Spring 24 L. Joskowiz Dt Strutures LEURE Humn oing Motivtion Uniquel eipherle oes Prei oes Humn oe onstrution Etensions n pplitions hpter 6.3 pp 385 392 in tetook Motivtion Suppose we wnt

More information

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw

More information

II. Integration and Cauchy s Theorem

II. Integration and Cauchy s Theorem MTH6111 Complex Anlysis 2009-10 Lecture Notes c Shun Bullett QMUL 2009 II. Integrtion nd Cuchy s Theorem 1. Pths nd integrtion Wrning Different uthors hve different definitions for terms like pth nd curve.

More information

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS. THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem

More information

Supervisory Control under Partial Observation

Supervisory Control under Partial Observation Supervisory Control under Prtil Observtion Dr Rong Su S1-B1b-59, Shool of EEE Nnyng Tehnologil University Tel: +65 6790-6042, Emil: rsu@ntu.edu.sg EE6226 Disrete Event Dynmi Systems 1 Outline Motivtion

More information

The Word Problem in Quandles

The Word Problem in Quandles The Word Prolem in Qundles Benjmin Fish Advisor: Ren Levitt April 5, 2013 1 1 Introdution A word over n lger A is finite sequene of elements of A, prentheses, nd opertions of A defined reursively: Given

More information

INTEGRATION. 1 Integrals of Complex Valued functions of a REAL variable

INTEGRATION. 1 Integrals of Complex Valued functions of a REAL variable INTEGRATION 1 Integrls of Complex Vlued funtions of REAL vrible If I is n intervl in R (for exmple I = [, b] or I = (, b)) nd h : I C writing h = u + iv where u, v : I C, we n extend ll lulus 1 onepts

More information