A LOGIC OF ORTHOGONALITY
|
|
- Antonia Simpson
- 6 years ago
- Views:
Transcription
1 ARCHIVUM MATHEMATICUM (BRNO) Tomu 42 (2006), A LOGIC OF ORTHOGONALITY J. ADÁMEK, M. HÉBERT AND L. SOUSA Thi paper wa inpired by he hard-o-beleive fac ha Jiří Roický i geing ixy. We are happy o dedicae our paper o hi birhday. Abrac. A logic of orhogonaliy characerize all orhogonaliy conequence of a given cla Σ of morphim, i.e. hoe morphim uch ha every objec orhogonal o Σ i alo orhogonal o. A imple four-rule deducion yem i formulaed which i ound in every cocomplee caegory. In locally preenable caegorie we prove ha he deducion yem i alo complee (a) for all clae Σ of morphim uch ha all member excep a e are regular epimorphim and (b) for all clae Σ, wihou rericion, under he e-heoreical aumpion ha Vopěnka Principle hold. For finiary morphim, i.e. morphim wih finiely preenable domain and codomain, an appropriae finiary logic i preened, and proved o be ound and complee; here he proof follow immediaely from previou join reul of Jiří Roický and he fir wo auhor. 1. Inroducion The famou orhogonal ubcaegory problem ak wheher, given a cla Σ of morphim of a caegory, he full ubcaegory Σ of all objec orhogonal o Σ i reflecive. Recall ha an objec i orhogonal o Σ iff i hom-funcor ake member of Σ o iomorphim. In he realm of locally preenable caegorie for he orhogonal ubcaegory problem and (a) he anwer i affirmaive whenever Σ i mall more generally, a proved by Peer Freyd and Max Kelly [7], i i affirmaive whenever Σ = Σ 0 Σ 1 where Σ 0 i mall and Σ 1 i a cla of epimorphim, (b) auming he large-cardinal Vopěnka Principle, he anwer remain affirmaive for all clae Σ, a proved by he fir auhor and Jiří Roický in [3]. Suppored by he Czech Gran Agency, Projec 201/06/0664 Financial uppor by he Cener of Mahemaic of he Univeriy of Coimbra and he School of Technology of Vieu
2 310 J. ADÁMEK, M. HÉBERT, L. SOUSA The problem o which he preen paper i devoed i dual : we udy he orhogonaliy conequence of clae Σ of morphim by which we mean morphim uch ha every objec of Σ i alo orhogonal o. Example: if Σ i reflecive, hen all he reflecion map are orhogonaliy conequence of Σ. Anoher imporan example: given a Gabriel-Ziman caegory of fracion C Σ : A A[Σ 1 ], hen every morphim which C Σ ake o an iomorphim i an orhogonaliy conequence of Σ. In Secion 2 we recall he precie relaionhip beween Σ and A[Σ 1 ]. We formulae a very imple logic for orhogonaliy conequence (inpired by he calculu of fracion and by he work of Grigore Roçu [12]) and prove ha i i ound in every cocomplee caegory. Tha i, whenever a morphim ha a formal proof from a cla Σ, hen i an orhogonaliy conequence of Σ. In he realm of locally preenable caegorie we alo prove ha our logic i complee, ha i, every orhogonaliy conequence of Σ ha a formal proof, provided ha or (a) Σ i mall more generally, compleene hold whenever Σ = Σ 0 Σ 1 where Σ 0 i mall and Σ 1 i a cla of regular epimorphim (b) Vopěnka Principle i aumed. (We recall Vopěnka Principle in Secion 4.) In fac he compleene of our logic for all clae of morphim will be proved o be equivalen o Vopěnka Principle. Thi i very imilar o reul of Jiří Roický and he fir auhor concerning he orhogonal ubcaegory problem, ee 6.24 and 6.25 in [3]. Our logic i quie analogou o he Injeciviy Logic of [4] and [1], ee alo [12]. There a morphim i called an (injeciviy) conequence of Σ provided ha every objec injecive w.r.. member of Σ i alo injecive w.r... Recall ha an objec i injecive w.r.. a morphim iff i hom-funcor ake o an epimorphim. Recall furher from [1] ha he deducion yem for Injeciviy Logic ha ju hree deducion rule: ranfinie compoiion puhou i (i < α) if i an α-compoie of he i if i a puhou u cancellaion We recall he concep of α-compoie in 3.2 below. In locally preenable caegorie he Injeciviy Logic i, a proved in [1], complee and ound for all e Σ of morphim; bu no for clae, in general: a couner-example can be preened, ee he end of our paper, independen of e heory. Thi i quie urpriing ince under Vopěnka Principle all injeciviy clae are weakly reflecive, ee [3], 6.27, which eem o indicae ha he Injeciviy Logic hould alway be complee - bu i i no!
3 A LOGIC OF ORTHOGONALITY 311 Now boh ranfinie compoiion and puhou are ound rule for orhogonaliy oo. In conra, cancellaion i no ound and ha o be ubiued by he following weaker form: u v u weak cancellaion Furher we have o add a fourh rule in cae of orhogonaliy: coequalizer if f g i a coequalizer uch ha f = g We obain a 4-rule deducion yem for which he above compleene reul (a) and (b) will be proved. The above logic are infiniary, in fac, ranfinie compoiion i a cheme of deducion rule, one for every ordinal α. We alo udy he correponding finiary logic by rericing ourelve o e Σ of finiary morphim, meaning morphim wih finiely preenable domain and codomain. Boh in he injeciviy cae and in he orhogonaliy cae one imply replace ranfinie compoiion by wo rule: ideniy id A and 1 2 compoiion if = 2 1 Thi finiary logic i proved o be ound and complee for e of finiary morphim. In fac, in [10] a decripion of he caegory of fracion A ω [Σ 1 ] (ee 2.4) a a dual o he heory of he ubcaegory Σ i preened; our proof of compleene of he finiary logic i an eay conequence. The reul of Peer Freyd and Max Kelly menioned a he beginning goe beyond locally preenable caegorie, and alo our preceding paper [1] i no rericed o hi conex. Nonehele, he preen paper udie he orhogonaliy conequence and i logic in locally preenable caegorie only. Throughou he paper we work wih caegorie ha are, in general, no locally mall. The Axiom of Choice for clae i aumed. 2. Finiary Logic and he Calculu of Fracion 2.1. Aumpion. Throughou he paper A denoe a locally preenable caegory in he ene of Gabriel and Ulmer; he reader may conul he monograph [3]. Recall ha an objec i λ-preenable iff i hom-funcor preerve λ-filered colimi. A locally preenable caegory i a cocomplee caegory A uch ha, for ome infinie cardinal λ, here exi a e A λ of objec repreening all λ-preenable objec up-o an iomorphim and uch ha a compleion of A λ under λ-filered colimi i all of A. The caegory A i
4 312 J. ADÁMEK, M. HÉBERT, L. SOUSA hen aid o be locally λ-preenable. Recall ha a heory of a locally λ-preenable caegory A i a mall caegory T wih λ-mall limi 1 uch ha A i equivalen o he caegory Con λ (T ) of all e-valued funcor on T preerving λ-mall limi. For every locally λ- preenable caegory i follow ha he dual A op λ of he above full ubcaegory i a heory of A: A = Con λ (A op λ ). Morphim wih λ-preenable domain and codomain are called λ-ary morphim Noaion. (i) For every cla Σ of morphim of A we denoe by Σ he full ubcaegory of all objec orhogonal o Σ. If Σ i mall, hi ubcaegory i reflecive, ee e.g. [7]. (ii) We wrie Σ = for he aemen ha i an orhogonaliy conequence of, in oher word, Σ = ({} Σ). (iii) We denoe, whenever Σ i reflecive, by R Σ : A Σ a reflecor funcor and by η A : A R Σ A he reflecion map; wihou lo of generaliy we will aume R Σ η A = id RΣA = η RΣA Obervaion. If Σ i a reflecive ubcaegory, hen orhogonaliy conequence of Σ are preciely he morphim uch ha R Σ i an iomorphim. In fac, if : A B i an orhogonaliy conequence of Σ, hen R Σ A i orhogonal o, which yield a commuaive riangle A η A u R Σ A The unique morphim ū : R Σ B R Σ A wih ū η B = u i invere o R Σ : hi follow from he diagram A η A u R Σ A B ū R Σ B η B R Σ B Converely, if : A B i urned by R Σ o an iomorphim, hen every objec X orhogonal o Σ i orhogonal o : given f : A X we have a unique f : R Σ A 1 Limi of diagram of le han λ morphim are called λ-mall limi. Analogouly λ-wide puhou are puhou of le han λ morphim.
5 A LOGIC OF ORTHOGONALITY 313 X wih f = f η A, and we ue f (R Σ ) 1 η B : B X. I i eay o check ha hi i he unique facorizaion of f hrough Remark. The above obervaion how a connecion of he orhogonaliy logic o he calculu of fracion of Peer Gabriel and Michel Ziman [8], ee alo Secion 5.2 in [5]. Given a cla Σ of morphim in A, i caegory of fracion i a caegory A[Σ 1 ] ogeher wih a funcor C Σ : A A[Σ 1 ] univeral w.r.. he propery ha C Σ ake member of Σ o iomorphim. (Tha i, if a funcor F : A B ake member of Σ o iomorphim, hen here exi a unique funcor F : A[Σ 1 ] B wih F = F C Σ.) The caegory of fracion i unique up-o iomorphim of caegorie. If A i locally mall, he caegory of fracion i alo locally mall if Σ i mall, ee [5], Example (ee [5], 5.3.1). For every reflecive ubcaegory B of A, R : A B he reflecor, pu Σ = { R i an iomorphim}. Then B = Σ A[Σ 1 ]. More preciely, here exi an equivalence E : A[Σ 1 ] Σ uch ha E C Σ = R = R Σ Example (ee [6]). In he caegory Ab of abelian group conider he ingle morphim Σ = {Z 0} where Z i he group of ineger. Then clearly Oberve ha Σ = {0}. Ab[Σ 1 ] = {0} becaue he coreflecor F : Ab Ab of he full ubcaegory Ab of all orion group ake Z 0 o an iomorphim, bu F i he ideniy funcor on Ab. Thi of coure implie ha C Σ : Ab Ab[Σ 1 ] i monic on Ab Definiion (ee [8]). A cla Σ of morphim i aid o admi a lef calculu of fracion provided ha (i) Σ conain all ideniy morphim, (ii) Σ i cloed under compoiion, (iii) for every pan here exi a commuaive quare f wih Σ f f wih Σ
6 314 J. ADÁMEK, M. HÉBERT, L. SOUSA and (iv) for every parallel pair f, g equalized by a member of Σ here exi a member of Σ coequalizing he pair: f g 2.8. Theorem (ee [10], IV.2). Le Σ be a e of finiary morphim of a locally finiely preenable caegory A. If Σ admi a lef calculu of fracion in he ubcaegory A ω, hen Σ i a locally finiely preenable caegory whoe heory i dual o A ω [Σ 1 ]. More preciely: Le C Σ : A ω A ω [Σ 1 ] be he canonical funcor from A ω ino he caegory of fracion of Σ in A ω, ee 2.4. Then here exi an equivalence funcor J : Con ω (A ω [Σ 1 ] op ) Σ uch ha for he incluion funcor I : A ω A and he Yoneda embedding Y : A ω [Σ 1 ] Con ω (A ω [Σ 1 ] op ) he following diagram (2.1) A ω C Σ A ω [Σ 1 ] I Y Con ω (A ω [Σ 1 ] op ) commue. A R Σ 2.9. Corollary. Le Σ admi a lef calculu of fracion in A ω. Then he orhogonaliy conequence of Σ in A ω are preciely he finiary morphim uch ha C Σ i an iomorphim. In fac, ince J Y i a full embedding, we know ha C Σ i an iomorphim iff (J Y C Σ ) i one, hu, hi follow from Obervaion Example (refer o 2.6). For Σ = {Z 0}, he malle cla Σ 0 in Ab (rep., in Ab ω ) conaining Σ and admiing a lef calculu of fracion i he cla of all (rep., all finiary) morphim which are ideniie or have codomain 0. One ee eaily ha Ab[Σ0 1 ] = {0} = Ab ω[σ 1 0 ] = Σ 0 = Σ Remark. In a finiely cocomplee caegory A for every e Σ of finiary morphim here i a canonical exenion of Σ o a e Σ admiing a lef calculu of fracion in A ω : le Σ be he cloure in A ω of J Σ under Σ {id A } A Aω
7 A LOGIC OF ORTHOGONALITY 315 (a) compoiion (b) puhou and (c) weak coequalizer in he ene ha Σ conain, for every pair f, g : A B, a coequalizer of f, g whenever f = g for ome member of Σ. We will ee in Obervaion 2.16 below ha Σ and Σ have he ame orhogonaliy conequence Theorem (ee [5], 5.9.3). If a e Σ admi a lef calculu of fracion, hen he cla of all morphim aken by C Σ o iomorphim i he malle cla Σ conaining Σ and uch ha given hree compoable morphim u v wih u and v u boh in Σ, hen lie in Σ Remark. Apply he above heorem o Σ of Remark 2.11: if Σ denoe he cloure of Σ under weak cancellaion in he ene ha from u Σ and v u Σ we derive Σ, hen Σ i preciely he cla aken by C Σ o iomorphim. Thi lead u o he following Definiion. The Finiary Orhogonaliy Deducion Syem coni of he following deducion rule: ideniy compoiion puhou coequalizer id A 1 2 if = 2 1 if if f g i a puhou i a coequalizer and f = g weak cancellaion u v u We ay ha a morphim can be proved from a e Σ of morphim uing he Finiary Orhogonaliy Logic, in ymbol Σ provided ha here exi a formal proof of from Σ uing he above five deducion rule (in A ω ) Remark. A formal proof of i a finie li 1, 2,..., k
8 316 J. ADÁMEK, M. HÉBERT, L. SOUSA of finiary morphim uch ha = k and for every i = 1,...,k eiher i Σ, or i i he concluion of one of he deducion rule whoe aumpion lie in he e { 1,..., i 1 }. For a locally preenable caegory he Finiary Orhogonaliy Logic i he applicaion of he relaion and = o finiary morphim of A Obervaion. In every finiely cocomplee caegory he Finiary Orhogonaliy Logic i ound: if a finiary morphim ha a proof from a e Σ of finiary morphim hen i an orhogonaliy conequence of Σ. Shorly: Σ implie Σ =. I i ufficien o check individually he oundne of he five deducion rule. Every objec X i clearly orhogonal o id A ; and i i orhogonal o 2 1 whenever X i orhogonal o 1 and 2. The oundne of he puhou rule i alo elemenary:! X Suppoe i a coequalizer of f, g : A B and le f = g. Whenever X i orhogonal o, i i orhogonal o. In fac, given a morphim p : B X, f A A B g p X hen from p f = p g i follow ha p f = p g (due o X ) and hu p uniquely facor hrough = coeq(f, g). Finally, le X be orhogonal o u and v u, A u B v C D q r p r w w X hen we how X. Given p : A X here exi q : C X wih p = q (u ). Then r = q u fulfil p = r. Suppoe r fulfil p = r. We have, ince X v u, a unique w : D X wih r = w v u and a unique w wih r = w v u. The equaliy w v u = w v u implie w v = w v, hu, B r = w v u = w v u = r Theorem. In locally finiely preenable caegorie he Finiary Orhogonaliy Logic i complee: Σ = implie Σ.
9 A LOGIC OF ORTHOGONALITY 317 for all e Σ {} of finiary morphim. Proof. Le be an orhogonaliy conequence of Σ in A ω and le Σ be he e of all finiary morphim ha can be proved from Σ; we have o verify ha Σ. Due o he fir four deducion rule, Σ clearly admi a lef calculu of fracion in A ω. Hence C Σ i, by Corollary 2.9, an iomorphim. Theorem 2.12 implie (due o weak cancellaion) ha Σ Example demonraing ha we canno, for he finiary orhogonaliy logic, work enirely wihin he full ubcaegory A ω : le u denoe by Σ = ω he aemen ha every finiely preenable objec X Σ i orhogonal o. Then i i in general no rue ha, given a e of finiary morphim Σ, hen Σ = ω implie Σ. Le A = Rel(2, 2) be he caegory of relaional rucure on wo binary relaion α and β. We denoe by he iniial (empy) objec, 1 a erminal objec (a ingle node which i a loop of α and β), T a one-elemen objec wih α = and β a loop and, for every prime p 3, by A p he objec on {0, 1,..., p 1} whoe relaion β i a clique (ha i, wo elemen are relaed by β iff hey are diinc) and he relaion α i a cycle of lengh p wih one addiional edge from 1 o 0: p p Conider he e Σ of finiary morphim given by Σ = {u, v} { A p ; p 3 a prime} where u : T 1 and v : are he unique morphim. Orhogonaliy of a relaional rucure X o Σ implie ha every loop of he relaion β i a join loop of boh relaion (due o u) and uch a loop i unique (due o v). Moreover, he given objec X ha a unique morphim from each A p. If X i finiely preenable (i.e., in hi cae, finie), hen one of hee morphim f : A p X i no monic; given i j wih f(i) = x = f(j), hen x i a loop of β in X (recall ha β i a clique in A p ), hu, X ha a unique join loop of α and β, in oher word, a unique morphim 1 X. Conequenly, X i orhogonal o 1. Thi prove Σ = ω ( 1).
10 318 J. ADÁMEK, M. HÉBERT, L. SOUSA However 1 canno be deduced from Σ in he Finiary Deducion Syem becaue he objec Y = p 3 p prime i orhogonal o Σ bu no o 1. In fac, Y ha no loop of β, hu, Y i orhogonal o u and v. Furhermore for every prime p 3 he coproduc injecion i p : A p Y i he only morphim in hom(a p, Y ). In fac, due o he added edge 1 0 a morphim f : A p Y necearily ake {0, 1} A p ono {0, 1} A q for ome q. Since p and q are prime and f reric o a mapping of a p-cycle ino a q-cycle, i i obviou ha p = q. And i i alo obviou ha A p ha no endomorphim mapping {0, 1} ino ielf excep he ideniy conequenly, f = i p. A p 3. General Orhogonaliy Logic 3.1. Remark. (i) Recall our anding aumpion ha A i a locally preenable caegory. We will now preen a (non-finiary) logic for orhogonaliy and prove ha i i alway ound, and ha for e of morphim i i alo complee. We will acually prove he compleene no only for e, bu alo for clae Σ of morphim which are preenable, i.e., for which here exi a cardinal λ uch ha every member : A B of Σ i a λ-preenable objec of he lice caegory A A. The compleene of our logic for all clae Σ of morphim i he opic of he nex ecion. (ii) We recall he concep of a ranfinie compoiion of morphim a ued in homoopy heory. Given an ordinal α (conidered, a uual, a he chain of all maller ordinal), an α-chain in A i imply a funcor C from α o A. I i called mooh provided ha C preerve direced colimi, i.e., if i < α i a limi ordinal hen C i = colim j<i C j Definiion. Le α be an ordinal. A morphim h i called an α-compoie of morphim h i (i < α), provided ha here exi a mooh (α + 1)-chain C i (i α) uch ha h i he connecing morphim C 0 C α and each h i i he connecing morphim C i C i+1 (i < α) Example. (1) An ω-compoie of a chain A 0 h 0 A 1 h 1 A 2 h 2... i, for any colimi cocone c i : A i C (i < ω) of he chain, he morphim c 0 : A 0 C. (2) A 2-compoie i he uual concep of a compoie of wo morphim. (3) Any ideniy morphim i he 0-compoie of a 0-chain.
11 A LOGIC OF ORTHOGONALITY Definiion. The Orhogonaliy Deducion Syem coni of he following deducion rule. i (i < α) ranfinie if i an α-compoie of he i compoiion puhou coequalizer weak cancellaion u v u if if f g i a puhou i a coequalizer and f = g We ay ha a morphim can be proved from a cla Σ of morphim in he Orhogonaliy Logic, in ymbol Σ provided ha here exi a formal proof of from Σ uing he above deducion rule Remark. (1) The deducion rule ranfinie compoiion i, in fac, a cheme of deducion rule: one for every ordinal α. (2) A proof of from Σ i a collecion of morphim i (i α) for ome ordinal α uch ha = α and for every i α eiher i Σ, or i i he concluion of one of he deducion rule above whoe aumpion lie in he e { j } j<i. (3) The λ-ary Orhogonaliy Deducion Syem i he deducion yem obained from 3.4 by rericing ranfinie compoiion o all ordinal α < λ. We obain he λ-ary Orhogonaliy Logic by applying hi deducion yem o λ-ary morphim, ee 2.1. In he λ-ary Orhogonaliy Logic he proof are alo rericed o hoe of lengh α < λ. Example: if λ = ω we ge preciely he Finiary Orhogonaliy Logic of Secion Example. Oher ueful ound rule for orhogonaliy conequence can be derived from he above deducion yem. Here are ome example: (i) The 2-ou-of-3 rule: in a commuaive riangle B A u C any morphim can be derived from he remaining wo. In fac {, u} {u, } by compoiion, by weak cancellaion (pu v = id),
12 320 J. ADÁMEK, M. HÉBERT, L. SOUSA and o prove {, } u by weak cancellaion (pu v = id) form a puhou of and : A B u C D r id C C We obain a unique morphim r a indicaed. Oberve ha due o r = id he diagram D r id D r C i a coequalizer wih he parallel pair equalized by. Thu we have r u = r puhou coequalizer compoiion (ii) A coproduc + : A + B A + B can be derived from and. Thi follow from he puhou along coproduc injecion (denoed by ): A A B B A + B +id B A + B A + B id A + A + B Thu we have puhou + id B id A + compoiion + = (id A + ) ( + id B ) (iii) More generally: i I i can be derived from { i } i I. Thi follow eaily from (ii) and ranfinie compoiion. (iv) Given wo parallel pair, a naural ranformaion wih componen 1, 2 beween hem and a colimi of ha naural ranformaion beween heir
13 A LOGIC OF ORTHOGONALITY 321 coequalizer: A 1 1 A 1 f g f A 2 2 g A 2 c C c C (where c = coeq(f, g) and c = coeq(f, g )), hen can be deduced from he componen of he naural ranformaion, { 1, 2 }. In fac, form a puhou P of 2 and c and denoe by u : P C he obviou facorizaion morphim: 1 A 1 A 1 f g f A 2 2 g A 2 c 2 C P q c Q u v Then u i a coequalizer of c f and c g. (In fac, given q : P Q merging ha pair, hen q c merge f, g, hu, here exi v wih q c = v c. Since c i an epimorphim, hi implie q = v u. The uniquene of v i clear: uppoe q = w u, hen w c = w u c = q c = v c, hu, w = v.) The above diagram how ha 1 equalize c f and c g : ( c f ) 1 = c 2 f = 2 c f = 2 c g = c 2 g = ( c g ) 1. Conequenly we have 1 2 u 2 coequalizer and puhou compoiion (v) More generally: For any mall caegory D, given diagram D 1, D 2 : D A and given a naural ranformaion beween hem c C X : D 1 X D 2 X for X objd hen i colimi : colim D 1 colim D 2 can be derived from i componen: { X } X objd.
14 322 J. ADÁMEK, M. HÉBERT, L. SOUSA Thi follow eaily from (iii) and (iv) by applying he andard conrucion of colimi by mean of coproduc and coequalizer ([11]). (vi) In a commuaive diagram A 1 1 f g A 1 p q A 2 A 3 3 A 3 2 A 2 q p ḡ P f P where he ouer and inner quare are puhou, he morphim (a colimi of he naural ranformaion wih componen 1, 2, 3 ) can be derived from { 1, 2, 3 }. Thi i (v) for he obviou D. (vii) The following (rong) cancellaion propery u hold for all epimorphim. In fac, he quare u u i a puhou, hu, from u we derive u via puhou, and hen we ue (i). (viii) A wide puhou = i i of morphim i (i I) A i can be derived from hoe morphim : i i id A B { i } i I
15 A LOGIC OF ORTHOGONALITY 323 If I i finie, hi follow eaily from puhou, ideniy and compoiion. For I infinie ue ranfinie compoiion. (viii) coequalizer ha he following generalizaion: given parallel morphim g j : A B (j J) uch ha a morphim : A A equalize he whole collecion, hen he join coequalizer : B B of he collecion fulfil. In fac, for every (j, j ) J J a coequalizer jj of g j and g j fulfil jj. By (viii), we have ince i a wide puhou of all jj Obervaion. In every cocomplee (no necearily locally preenable) caegory he Orhogonaliy Logic i ound: for every cla Σ of morphim a morphim which ha a proof from Σ i an orhogonaliy conequence of Σ: Σ implie Σ = The verificaion ha ranfinie compoiion i ound i rivial: given a mooh chain C : α A and an objec X orhogonal o h i : C i C i+1 for every i < α, hen X i orhogonal o he compoie h : C 0 C α of he h i. In fac, for every morphim u : C 0 X here exi a unique cocone u i : C i X of he chain C wih u 0 = u: he iolaed ep are deermined by X h i and he limi ep follow from he moohne of C. Conequenly u α : C α X i he unique morphim wih u = u α h Definiion (ee [9]). A morphim : A B of A i called λ-preenable if, a an objec of he lice caegory A A, i i λ-preenable Remark. (i) Thi i cloely relaed o a λ-ary morphim: i λ-ary (i.e., A and B are λ-preenable objec of A) iff i a λ-preenable objec of he arrow caegory A, ee [3]. (ii) Unlike he λ-ary morphim (which are he morphim of he mall caegory A λ, ee 2.1) he λ-preenable morphim form a proper cla: for example all ideniy morphim are λ-preenable. (iii) A imple characerizaion of λ-preenable morphim wa proved in [9]: f i λ-preenable f i a puhou of a λ-ary morphim (along an arbirary morphim). (iv) The λ-ary morphim are preciely he λ-preenable one wih λ-preenable domain (ee [9]). Tha i, given f : A B λ-preenable, hen A λ-preenable B λ-preenable. (v) For every objec A he cone of all λ-preenable morphim wih domain A i eenially mall. Thi follow from (iii), or direcly: ince A A i a locally preenable caegory, i ha up o iomorphim only a e of λ-preenable objec Example. A regular epimorphim which i he coequalizer of a pair of morphim wih λ-preenable domain i λ-preenable. Tha i, given a coequalizer diagram K f g A B
16 324 J. ADÁMEK, M. HÉBERT, L. SOUSA hen K i λ-preenable i λ-preenable. In fac, given a λ-filered diagram in A A wih objec d i : A D i and wih a colimi cocone c i : (d i, D i ) (d, D) = colim i I (d i, D i ), hen for every morphim h : (, B) (d, D) of A A we find an eenially unique facorizaion hrough he cocone a follow: K f g A B d d i D The morphim d = h merge f and g. Oberve ha c i merge d i f and d i g for any i I. Since K i λ-preenable and D = colimd i i a λ-filered colimi in A, i follow ha ome connecing map d ij : (d i, D i ) (d j, D j ) of our diagram merge d i f and d i g. Thi implie d j f = d j g, hence, d j facor hrough : h D i d j = k for ome k : B D j. Then k : (, B) (d j, D j ) i he deired facorizaion. I i unique becaue i an epimorphim Definiion. A cla Σ of morphim i called preenable provided ha here exi a cardinal λ uch ha every member of Σ i a λ-preenable morphim Example. Every mall cla i preenable. In hi cae here even exi λ uch ha all member are λ-ary morphim. Thi follow from he fac ha every objec of a locally preenable caegory i λ-preenable for ome λ, ee [3] Remark. We will prove ha he Orhogonaliy Logic i complee for preenable clae of morphim. Thi harply conra wih he following: if A i a locally finiely preenable caegory and Σ i a cla of finiely preenable morphim, he Finiary Orhogonaliy Logic need no be complee: Example (ee [4]). Le A be he caegory of algebra on counably many nullary operaion (conan) a 0, a 1, a 2,... Denoe by I = {a n } n N an iniial algebra, by 1 a erminal algebra, and by k he congruence on I merging ju a k and a k+1. The correponding quoien morphim c i e k : I I/ k i clearly finiely preenable, and o i he quoien morphim f : C 1 where C = {0, 1} i he algebra wih a 0 = 0 and a i = 1 for all i 1. I i obviou ha {e 1, e 2, e 3,... } {f} = e 0.
17 A LOGIC OF ORTHOGONALITY 325 Neverhele, a proved in [4], e 0 canno be proved from {e 1, e 2, e 3,... } {f} in he Finiary Orhogonaliy Logic. Oberve ha hi doe no conradic Theorem 2.17: he morphim f above i no finiary Conrucion of a Reflecion. Le Σ be a cla of λ-preenable morphim in a locally λ-preenable caegory A. For every objec A of A a reflecion r A : A Ā of A in he orhogonal ubcaegory Σ i conruced a follow: We form he diagram D A : D A A of all λ-preenable morphim : A A provable from Σ wih domain A. Le Ā be a colimi of D A wih he colimi cocone : A Ā. We how ha he morphim r A = : A Ā (independen of ) i he deired reflecion. The precie definiion of D A i a follow: we denoe by Σ λ he cla of all λ-preenable morphim wih Σ. Le D A be he full ubcaegory of he lice caegory A A on all objec lying in Σ λ. By 3.9 (v) he diagram i eenially mall. D A : D A A, D A ( A A ) = A Propoiion. For every objec A he diagram D A i λ-filered and r A : A Ā i a reflecion of A in Σ ; moreover, Σ r A. Proof. (1) The diagram D A i λ-filered: From coequalizer and 3.6(viii), Σ λ i cloed under weak coequalizer in he ene of 2.11(c) and under λ-wide puhou. Thi aure ha A Σ λ i cloed under λ-mall colimi in A A, hu he caegory D A i λ-filered. (2) We prove and Σ r A Σ for all in D A. Thi follow from 3.6(v) applied o he naural ranformaion from he conan diagram of value A o D A wih componen : A A : I colimi i r A. Now oberve ha he rule 2-ou-of-3, 3.6(i), alo yield ha Σ for all in D A.
18 326 J. ADÁMEK, M. HÉBERT, L. SOUSA (3) Given a morphim : R Q in Σ we prove ha every morphim f : R Ā ha a facorizaion hrough. R Q u v g R Q f f g A ˆ Ā ˆP q P By 3.9(iii) here exi a λ-ary morphim : R Q uch ha i a puhou of (along a morphim u). Due o (1) and ince R i a λ-preenable objec, he morphim f u : R Ā = colima facor hrough one of he colimi morphim: f u = g for ome : A A in D A and ome g : R A. We denoe by ˆ a puhou of along f u, and by a puhou of along g. Thi lead o he unique morphim q : P ˆP wih q = ˆ and q g = f v. By (2) we know ha Σ. Conequenly, compoiion yield Σ q ince q = ˆ, and Σ ˆ by puhou. Nex, we oberve ha Σ q by 3.6(vi): apply i o he puhou P and ˆP and he naural ranformaion wih componen id R, and id Q. Now he 2-ou-of-3 rule yield Σ. Moreover, i λ-preenable ince i λ-ary, ee 3.9(iii). Therefore, he morphim p = : A P i alo λ-preenable, and Σ p by compoiion. Thu, p : A P i an objec of D A. The correponding colimi morphim p : P Ā fulfil r A = p p. Furher, ince i a connecing morphim of he diagram D A from o p, i follow ha = p.
19 A LOGIC OF ORTHOGONALITY 327 Conequenly, ( p g) = p g = g = f u and he univeral propery of he puhou Q of and u yield a unique h : Q Ā wih f = h and p g = h v. Thi i he deired facorizaion of f hrough. (4) Ā lie in Σ : Given h, k : Q Ā equalized by, we prove h = k. R u R Q v h k Q c A w k c Ā C h Since Q i λ-preenable, he morphim h v, k v : Q Ā boh facor hrough ome of he colimi morphim of he λ-filered colimi Ā = colimd A: Form coequalizer h v = h and k v = k for ome h, k : Q A. From h = k coequalizer yield C c = coeq(h, k) and c = coeq(h, k ). Σ c and hen (2) above and compoiion yield Σ c. From he equaliy (c ) h = (c ) k we conclude ha c facor hrough c. Since c i an epimorphim, 3.6(vii) yield Σ c. Moreover, c i a λ-preenable morphim ince c = coeq(h, k ) and Q i λ- preenable, ee Example The morphim w = c : A C i hu alo a λ-preenable morphim wih Σ w, in oher word (w, C ) i an objec of D A, and c : (, A S ) (w, C ) i a morphim of D A. Thi implie ha he colimi map fulfil = w c. We are ready o prove h = k: by he univeral propery of he puhou Q we only need howing h v = k v: h v = h = w c h
20 328 J. ADÁMEK, M. HÉBERT, L. SOUSA and analogouly k v = w c k, hu c h = c k finihe he proof. (5) The univeral propery of r A : Le f : A B be a morphim wih B orhogonal o Σ. Thu B i orhogonal o all morphim wih Σ, ee 3.7. r A A f B f g Ā A For every objec : A A of D A le f : A B be he unique facorizaion of f hrough. Thee morphim clearly form a compaible cocone of D A, and he unique facorizaion g : Ā B fulfil, for any objec of D A, f = f = g = g r A. Converely, uppoe g r A = f, hen g = g becaue for every objec of D A we have g = f = g ; hi follow from B due o (g ) = f = f Theorem. The Orhogonaliy Logic i complee for all preenable clae Σ of morphim: every orhogonaliy conequence of Σ ha a proof from Σ in he Orhogonaliy Deducion Syem. Shorly, Σ = implie Σ. Proof. Given an orhogonaliy conequence : A B of Σ, form a reflecion r A : A Ā of A in Σ a in Then Σ = implie ha Ā i orhogonal o, hu we have u : B Ā wih r A = u. From 3.16 we know ha Σ u. Now we have ha Σ = u (= r A ) and Σ =, and hi rivially implie ha Σ = u. Thu by he ame argumen wih replaced by u here exi a morphim v uch ha Σ v u. The la ep i weak cancellaion : u v u Corollary. The Orhogonaliy Logic i complee for clae Σ of morphim of he form Σ = Σ 0 Σ 1, Σ 0 mall and Σ 1 RegEpi.
21 A LOGIC OF ORTHOGONALITY 329 Proof. Le λ be a regular cardinal uch ha A i locally λ-preenable, and all morphim of Σ 0 are λ-preenable. We will ubiue Σ 1 wih a cla Σ 1 of λ-preenable morphim a follow: for every member : A B of Σ 1 chooe a pair f, g : A A wih = coeq(f, g). Expre A a a λ-filered colimi of λ-preenable objec A i wih a colimi cocone a i : A i A (i I ). Form a coequalizer i : A B i of f a i, g a i : A i B for every i I. Then we obain a filered diagram wih he objec B i (i I ) and he obviou connecing morphim. The unique b i : B i B wih = b i i form a colimi of ha diagram. Moreover, an objec X i orhogonal o iff i i orhogonal o i for every i I : f A i a i A g u A B b i v v i i B i X Le Σ 1 be he cla of all morphim i for all Σ 1 and i I. Then he cla Σ = Σ 0 Σ 1 coni of λ-preenable morphim, ee Example 3.10, and Σ = Σ. Given an orhogonaliy conequence of Σ, we hu have a proof of from Σ, ee Theorem I remain o prove i for every Σ and i I ; hen Σ implie Σ. In fac, ince i i an epimorphim, apply 3.6(vii) o = b i i Remark. Since all λ-ary morphim form eenially a e (ince A λ i mall), he λ-ary Orhogonaliy Logic (ee 3.5) i complee for clae of λ-ary morphim he proof i analogou o ha of Theorem Vopěnka Principle 4.1. Remark. The aim of he preen ecion i o prove ha he Orhogonaliy Logic i complee (for all clae of morphim) in all locally preenable caegorie iff he following large-cardinal Vopěnka principle hold. Throughou hi ecion we aume ha he e heory we work wih aifie he Axiom of Choice for clae Definiion. Vopěnka Principle ae ha he caegory Rel(2) of graph (or binary relaional rucure) doe no have a large dicree full ubcaegory.
22 330 J. ADÁMEK, M. HÉBERT, L. SOUSA 4.3. Remark. (1) The following fac can be found in [3]: (i) Vopěnka Principle i a large-cardinal principle: i implie he exience of meaurable cardinal. Converely, he exience of huge cardinal implie ha Vopěnka Principle i conien. (ii) An equivalen formulaion of Vopěnka Principle i: he caegory Ord of ordinal canno be fully embedded ino any locally preenable caegory. (2) The following proof i analogou o he proof of Theorem 6.22 in [3] Theorem. Auming Vopěnka Principle, he Orhogonaliy Logic i complee for all clae of morphim (of a locally preenable caegory). Proof. (1) Every cla Σ can be expreed a he union of a chain Σ = Σ i (Σ i Σ j if i j) i Ord of mall ubclae hi follow from he Axiom of Choice. We prove ha every objec A ha a reflecion in Σ by forming reflecion r i (A) : A A i in Σ i for every i Ord, ee 2.2. Thee reflecion form a ranfinie chain in he lice caegory A A: for i j he fac ha Σ i Σ j implie he exience of a unique a ij : A i A j forming a commuaive riangle A r i(a) r j(a) A i a ij A j We prove ha hi chain i aionary, i.e., here exi an ordinal i 0 uch ha a i0j i an iomorphim for all j i 0 i will follow immediaely ha r A = r i0 (A) i a reflecion of A in Σ. (2) Auming he conrary, we have an objec A and ordinal i(k) for k Ord wih i(k) < i(l) for k < l uch ha none of he morphim a i(k),i(l) wih k < l i an iomorphim. We derive a conradicion o Vopěnka Principle: he lice caegory A A i locally preenable, and we prove ha he funcor E : Ord A A, k r i(k) (A) i a full embedding. In fac, for every morphim u uch ha he diagram r i(k) (A) A i(k) A u r i(l) (A) A i(l)
23 A LOGIC OF ORTHOGONALITY 331 commue, we have k l and u = a k,l. The laer follow from he univeral propery of r i(k) (A). Thu, i i ufficien o prove he former: auming k l we how k = l. In fac, he morphim u i invere o a i(l),i(k) becaue (u a i(l),i(k) ) r i(l) (A) = r i(l) (A) implie u a i(l),i(k) = id and analogouly for he oher compoie. Our choice of he ordinal i(k) i uch ha whenever a i(l),i(k) i an iomorphim, hen k = l. (3) Every orhogonaliy conequence : A B of Σ ha a proof from Σ. The argumen i now preciely a in Theorem 3.17: we ue he above reflecion r A and he fac ha Σ r A (ee Propoiion 3.16 and he above fac ha r A = r i0 (A) for ome i 0 ) Example (under he aumpion of he negaion of Vopěnka Principle). In he caegory Rel(2, 2) of relaional rucure on wo binary relaion α, β we preen a cla Σ of morphim ogeher wih an orhogonaliy conequence which canno be proved from Σ: Σ = bu Σ. We ue he noaion of Example The negaion of he Vopěnka Principle yield graph (X i, R i ) in Rel(2) for i Ord, forming a dicree caegory. For every i le A i be he objec of Rel(2,2) on X i whoe relaion α i R i and β i a clique (ee 2.18). Our cla Σ coni of he morphim u, v of 2.18 and We claim ha he morphim A i for all i Ord. : 1 i an orhogonaliy conequence of Σ. In fac, le B be an objec orhogonal o Σ and le i be an ordinal uch ha A i ha cardinaliy larger han B. We have a (unique) morphim h : A i B, and ince h canno be monic, he relaion β of B conain a loop (recall ha β i a clique in A i ). Thi implie ha B ha a unique join loop of α and β, herefore, B. To prove Σ i i ufficien o find a caegory A in which (i) Rel(2,2) i a full ubcaegory cloed under colimi and (ii) ome objec K of A i orhogonal o Σ bu no o. From (ii) we deduce ha canno be proved from Σ in he caegory A, ee Obervaion 3.7. However, (i) implie ha every formal proof uing he Orhogonaliy Deducion Syem 3.4 in he caegory Rel(2,2) i alo a valid proof in A. Togeher, hi implie Σ in Rel(2,2).
24 332 J. ADÁMEK, M. HÉBERT, L. SOUSA The imple approach i o chooe A = REL(2,2), he caegory of all poibly large relaional yem on wo binary relaion, i.e., riple (X, α, β) where X i a cla and α, β are ubclae of X X. Morphim are cla funcion preerving he binary relaion in he expeced ene. Thi caegory conain Rel(2, 2) a a full ubcaegory cloed under mall colimi, and he objec K = i Ord i no orhogonal o : 1 ince none of A i conain a join loop of α and β. However, i i eay o verify ha K i orhogonal o Σ. A more economical approach i o ue a A ju he caegory Rel(2,2) wih he unique objec K added o i, i.e., he full ubcaegory of REL(2,2) on {K} Rel(2,2) Corollary. Vopěnka Principle i equivalen o he aemen ha he Orhogonaliy Logic i complee for clae of morphim of locally preenable caegorie. A i 5. A counerexample The Orhogonaliy Logic can be formulaed in every cocomplee caegory, and we know ha i i alway ound, ee 3.7. Bu ouide of he realm of locally preenable caegorie he compleene can fail (even for finie e Σ): 5.1. Example. We ar wih he caegory CPO of ric CPO : objec are poe wih a lea elemen and wih direced join, morphim are ric coninuou funcion (preerving and direced join). Thi caegory i wellknown o be cocomplee. We form he caegory CPO (1) of all unary algebra on ric CPO : objec are riple (X,, α), where (X, ) i a ric CPO and α : X X i an endofuncion of X, morphim are he ric coninuou algebra homomorphim. I i eay o verify ha he forgeful funcor CPO (1) CPO i monoopological, hu, by and in [2] he caegory CPO (1) i cocomplee. We preen morphim 1, 2 and of CPO (1) uch ha an algebra A i orhogonal o (a) 1 iff i operaion α ha a mo one fixed poin (b) 2 iff i operaion α fulfil x αx for all x and (c) iff α ha preciely one fixed poin. We hen have { 1, 2 } = In fac, if an algebra A fulfil (b), we can define a ranfinie chain a i (i Ord) of i elemen by a o = a i+1 = αa i,
25 A LOGIC OF ORTHOGONALITY 333 and a j = i<j a i for all limi ordinal j. Thi chain canno be 1 1, hu, here exi i < j wih a i = a j and we conclude ha a i i a fixed poin of α. The fixed poin i unique due o (a), hu, A i orhogonal o. On he oher hand { 1, 2 } The argumen i analogou o ha in Example 4.5: The caegory A of poibly large CPO wih a unary operaion conain CPO (1) a a full ubcaegory cloed under mall colimi. And he following objec K i orhogonal o 1 and 2 bu no o : K = (Ord,, ucc) where i he uual ordering of he cla of all ordinald, and ucci = i + 1 for all ordinal i. Thu, i remain o produce he deired morphim 1, 2 and. The morphim 1 i he following quoien x α α y α α... 1 x=y α α α... where boh he domain and codomain are fla CP O (all elemen excep are pairwie incomparable). The morphim 2 i carried by he ideniy homomorphim x α α α... α... id x α α α... α... where he domain i fla and he codomain i fla excep for he unique comparable pair no involving being x < αx. Finally, i he embedding α α... wih boh he domain and he codomain fla. 6. Injeciviy Logic α α α... A menioned in he Inroducion, for he injeciviy logic he deducion yem coniing of ranfinie compoiion, puhou and cancellaion i ound and complee for e Σ of morphim. In conra o Theorem 4.4 hi deducion yem fail o be complee for clae of morphim in general, independenly of e heory: 6.1. Example. Le Rel(2) be he caegory of graph. For every cardinal n le C n denoe a clique (2.18) on n node. Then he morphim : 1
26 334 J. ADÁMEK, M. HÉBERT, L. SOUSA i an injeciviy conequence of he cla Σ = { C n ; n Card}. In fac, given a graph X injecive w.r.. Σ, chooe a cardinal n > cardx. We have a morphim f : C n X which canno be monomorphic. Conequenly, X ha a loop. Thi prove ha X i injecive w.r... The argumen o how ha canno be proved from Σ i compleely analogou o 5.1: he caegory REL(2) of poenially large graph conain Rel(2) a a full ubcaegory cloed under mall colimi. The objec K = C n i injecive n Card w.r.. Σ bu no injecive w.r... Therefore, doe no have a formal proof from Σ in he Injeciviy Deducion Syem above applied in REL(2). Conequenly, no uch formal proof exi in Rel(2). Inead of REL(2) we can, again, ue he full ubcaegory on Rel(2) {K} for our argumen. Reference [1] Adámek, J., Héber, M., Soua, L., A Logic of Injeciviy, Preprin of he Deparmen of Mahemaic of he Univeriy of Coimbra (2006). [2] Adámek, J., Herrlich, H., Srecker, G. E., Abrac and Concree Caegorie, John Wiley and Son, New York Freely available a dmb/acc.pdf [3] Adámek, J., Roický, J., Locally preenable and acceible caegorie, Cambridge Univeriy Pre, [4] Adámek, J., Sobral, M., Soua, L., A logic of implicaion in algebra and coalgebra, Preprin. [5] Borceux, F., Handbook of Caegorical Algebra I, Cambridge Univeriy Pre, [6] Caacubera, C., Frei, A., On auraed clae of morphim, Theory Appl. Caeg. 7, No. 4 (2000), [7] Freyd, P. J., Kelly, G. M., Caegorie of coninuou funcor I, J. Pure Appl. Algebra 2 (1972), [8] Gabriel, P., Ziman, M., Calculu of Fracion and Homoopy Theory, Springer Verlag [9] Héber, M., K-Puriy and orhogonaliy, Theory Appl. Caeg. 12, No. 12 (2004), [10] Héber, M., Adámek, J., Roický, J., More on orhogonoliy in locally preenable caegorie, Cahier Topologie Géom. Différenielle Caég. 62 (2001), [11] Mac Lane, S., Caegorie for he Working Mahemaician, Springer-Verlag, Berlin- Heidelberg-New York [12] Roşu, G., Complee caegorical equaional deducion, Lecure Noe in Compu. Sci (2001), Technical Univeriy of Braunchweig, Germany J.Adamek@u-b.de The American Univeriy of Cairo, Egyp mheber@aucegyp.edu Technical Univeriy of Vieu, Porugal oua@ma.ev.ipv.p
A Logic of Orthogonality
A Logic of Orhogonaliy J. Adámek, M. Héber and L. Soua Sepember 3, 2006 Thi paper wa inpired by he hard-o-believe fac ha Jiří Roický i geing ixy. We are happy o dedicae our paper o Jirka on he occaion
More informationIntroduction to SLE Lecture Notes
Inroducion o SLE Lecure Noe May 13, 16 - The goal of hi ecion i o find a ufficien condiion of λ for he hull K o be generaed by a imple cure. I urn ou if λ 1 < 4 hen K i generaed by a imple curve. We will
More informationFLAT CYCLOTOMIC POLYNOMIALS OF ORDER FOUR AND HIGHER
#A30 INTEGERS 10 (010), 357-363 FLAT CYCLOTOMIC POLYNOMIALS OF ORDER FOUR AND HIGHER Nahan Kaplan Deparmen of Mahemaic, Harvard Univeriy, Cambridge, MA nkaplan@mah.harvard.edu Received: 7/15/09, Revied:
More informationIntroduction to Congestion Games
Algorihmic Game Theory, Summer 2017 Inroducion o Congeion Game Lecure 1 (5 page) Inrucor: Thoma Keelheim In hi lecure, we ge o know congeion game, which will be our running example for many concep in game
More informationRandomized Perfect Bipartite Matching
Inenive Algorihm Lecure 24 Randomized Perfec Biparie Maching Lecurer: Daniel A. Spielman April 9, 208 24. Inroducion We explain a randomized algorihm by Ahih Goel, Michael Kapralov and Sanjeev Khanna for
More informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 31 Signal & Syem Prof. Mark Fowler Noe Se #27 C-T Syem: Laplace Tranform Power Tool for yem analyi Reading Aignmen: Secion 6.1 6.3 of Kamen and Heck 1/18 Coure Flow Diagram The arrow here how concepual
More informationA Guided Tour in the Topos of Graphs
A Guided Tour in he Topo of Graph Sebaiano Vigna Abrac In hi paper we urvey he fundamenal conrucion of a preheaf opo in he cae of he elemenary opo of graph. We prove ha he raniion graph of nondeerminiic
More informationAlgorithmic Discrete Mathematics 6. Exercise Sheet
Algorihmic Dicree Mahemaic. Exercie Shee Deparmen of Mahemaic SS 0 PD Dr. Ulf Lorenz 7. and 8. Juni 0 Dipl.-Mah. David Meffer Verion of June, 0 Groupwork Exercie G (Heap-Sor) Ue Heap-Sor wih a min-heap
More information, the. L and the L. x x. max. i n. It is easy to show that these two norms satisfy the following relation: x x n x = (17.3) max
ecure 8 7. Sabiliy Analyi For an n dimenional vecor R n, he and he vecor norm are defined a: = T = i n i (7.) I i eay o how ha hee wo norm aify he following relaion: n (7.) If a vecor i ime-dependen, hen
More informationProblem Set If all directed edges in a network have distinct capacities, then there is a unique maximum flow.
CSE 202: Deign and Analyi of Algorihm Winer 2013 Problem Se 3 Inrucor: Kamalika Chaudhuri Due on: Tue. Feb 26, 2013 Inrucion For your proof, you may ue any lower bound, algorihm or daa rucure from he ex
More informationLower and Upper Approximation of Fuzzy Ideals in a Semiring
nernaional Journal of Scienific & Engineering eearch, Volume 3, ue, January-0 SSN 9-558 Lower and Upper Approximaion of Fuzzy deal in a Semiring G Senhil Kumar, V Selvan Abrac n hi paper, we inroduce he
More informationGeneralized Orlicz Spaces and Wasserstein Distances for Convex-Concave Scale Functions
Generalized Orlicz Space and Waerein Diance for Convex-Concave Scale Funcion Karl-Theodor Surm Abrac Given a ricly increaing, coninuou funcion ϑ : R + R +, baed on he co funcional ϑ (d(x, y dq(x, y, we
More information18 Extensions of Maximum Flow
Who are you?" aid Lunkwill, riing angrily from hi ea. Wha do you wan?" I am Majikhie!" announced he older one. And I demand ha I am Vroomfondel!" houed he younger one. Majikhie urned on Vroomfondel. I
More informationFlow networks. Flow Networks. A flow on a network. Flow networks. The maximum-flow problem. Introduction to Algorithms, Lecture 22 December 5, 2001
CS 545 Flow Nework lon Efra Slide courey of Charle Leieron wih mall change by Carola Wenk Flow nework Definiion. flow nework i a direced graph G = (V, E) wih wo diinguihed verice: a ource and a ink. Each
More informationThe multisubset sum problem for finite abelian groups
Alo available a hp://amc-journal.eu ISSN 1855-3966 (prined edn.), ISSN 1855-3974 (elecronic edn.) ARS MATHEMATICA CONTEMPORANEA 8 (2015) 417 423 The muliube um problem for finie abelian group Amela Muraović-Ribić
More informationSyntactic Complexity of Suffix-Free Languages. Marek Szykuła
Inroducion Upper Bound on Synacic Complexiy of Suffix-Free Language Univeriy of Wrocław, Poland Join work wih Januz Brzozowki Univeriy of Waerloo, Canada DCFS, 25.06.2015 Abrac Inroducion Sae and ynacic
More informationClassification of 3-Dimensional Complex Diassociative Algebras
Malayian Journal of Mahemaical Science 4 () 41-54 (010) Claificaion of -Dimenional Complex Diaociaive Algebra 1 Irom M. Rihiboev, Iamiddin S. Rahimov and Wiriany Bari 1,, Iniue for Mahemaical Reearch,,
More informationNECESSARY AND SUFFICIENT CONDITIONS FOR LATENT SEPARABILITY
NECESSARY AND SUFFICIENT CONDITIONS FOR LATENT SEPARABILITY Ian Crawford THE INSTITUTE FOR FISCAL STUDIES DEPARTMENT OF ECONOMICS, UCL cemmap working paper CWP02/04 Neceary and Sufficien Condiion for Laen
More informationOn the Exponential Operator Functions on Time Scales
dvance in Dynamical Syem pplicaion ISSN 973-5321, Volume 7, Number 1, pp. 57 8 (212) hp://campu.m.edu/ada On he Exponenial Operaor Funcion on Time Scale laa E. Hamza Cairo Univeriy Deparmen of Mahemaic
More informationThe Residual Graph. 11 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationLaplace Transform. Inverse Laplace Transform. e st f(t)dt. (2)
Laplace Tranform Maoud Malek The Laplace ranform i an inegral ranform named in honor of mahemaician and aronomer Pierre-Simon Laplace, who ued he ranform in hi work on probabiliy heory. I i a powerful
More informationCHAPTER 7: SECOND-ORDER CIRCUITS
EEE5: CI RCUI T THEORY CHAPTER 7: SECOND-ORDER CIRCUITS 7. Inroducion Thi chaper conider circui wih wo orage elemen. Known a econd-order circui becaue heir repone are decribed by differenial equaion ha
More informationNotes on cointegration of real interest rates and real exchange rates. ρ (2)
Noe on coinegraion of real inere rae and real exchange rae Charle ngel, Univeriy of Wiconin Le me ar wih he obervaion ha while he lieraure (mo prominenly Meee and Rogoff (988) and dion and Paul (993))
More informationarxiv: v1 [cs.cg] 21 Mar 2013
On he rech facor of he Thea-4 graph Lui Barba Proenji Boe Jean-Lou De Carufel André van Renen Sander Verdoncho arxiv:1303.5473v1 [c.cg] 21 Mar 2013 Abrac In hi paper we how ha he θ-graph wih 4 cone ha
More information18.03SC Unit 3 Practice Exam and Solutions
Sudy Guide on Sep, Dela, Convoluion, Laplace You can hink of he ep funcion u() a any nice mooh funcion which i for < a and for > a, where a i a poiive number which i much maller han any ime cale we care
More information6.8 Laplace Transform: General Formulas
48 HAP. 6 Laplace Tranform 6.8 Laplace Tranform: General Formula Formula Name, ommen Sec. F() l{ f ()} e f () d f () l {F()} Definiion of Tranform Invere Tranform 6. l{af () bg()} al{f ()} bl{g()} Lineariy
More informationThe Residual Graph. 12 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationTypes are weak ω-groupoids
Proc London Mah Soc (3) 102 (2011) 370 394 C 2010 London Mahemaical Sociey doi:101112/plm/pdq026 Type are weak ω-groupoid Benno van den Berg and Richard Garner Abrac We define a noion of weak ω-caegory
More informationGroup C*-algebras A.K. Recall 1 that if G is a nonempty set, the linear space
Group C*-algebra A.K. Recall 1 ha if G i a nonempy e, he linear pace c oo (G) = {f : G C : upp f finie } ha a Hamel bai coniing of he funcion {δ : G} where { 1, = δ () = 0, Thu every f c oo (G) i a finie
More informationPhysics 240: Worksheet 16 Name
Phyic 4: Workhee 16 Nae Non-unifor circular oion Each of hee proble involve non-unifor circular oion wih a conan α. (1) Obain each of he equaion of oion for non-unifor circular oion under a conan acceleraion,
More informationDiscussion Session 2 Constant Acceleration/Relative Motion Week 03
PHYS 100 Dicuion Seion Conan Acceleraion/Relaive Moion Week 03 The Plan Today you will work wih your group explore he idea of reference frame (i.e. relaive moion) and moion wih conan acceleraion. You ll
More informationLet. x y. denote a bivariate time series with zero mean.
Linear Filer Le x y : T denoe a bivariae ime erie wih zero mean. Suppoe ha he ime erie {y : T} i conruced a follow: y a x The ime erie {y : T} i aid o be conruced from {x : T} by mean of a Linear Filer.
More informationBilal Khan Department of Mathematics and Computer Science, John Jay College of Criminal Justice, City University of New York, New York, NY 10019, USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A12 A GRAPHIC GENERALIZATION OF ARITHMETIC Bilal Khan Deparmen of Mahemaic and Compuer Science, John Jay College of Criminal Juice,
More informationString diagrams. a functorial semantics of proofs and programs. Paul-André Melliès. CNRS, Université Paris Denis Diderot.
Sring diagram a uncorial emanic o proo and program Paul-ndré Melliè CNRS, Univerié Pari Deni Didero Hop-in-Lux Luxembourg 17 July 2009 1 Connecing 2-dimenional cobordim and logic 2 Par 1 Caegorie a monad
More information2. VECTORS. R Vectors are denoted by bold-face characters such as R, V, etc. The magnitude of a vector, such as R, is denoted as R, R, V
ME 352 VETS 2. VETS Vecor algebra form he mahemaical foundaion for kinemaic and dnamic. Geomer of moion i a he hear of boh he kinemaic and dnamic of mechanical em. Vecor anali i he imehonored ool for decribing
More informationNetwork Flows: Introduction & Maximum Flow
CSC 373 - lgorihm Deign, nalyi, and Complexiy Summer 2016 Lalla Mouaadid Nework Flow: Inroducion & Maximum Flow We now urn our aenion o anoher powerful algorihmic echnique: Local Search. In a local earch
More informationMatrix Versions of Some Refinements of the Arithmetic-Geometric Mean Inequality
Marix Versions of Some Refinemens of he Arihmeic-Geomeric Mean Inequaliy Bao Qi Feng and Andrew Tonge Absrac. We esablish marix versions of refinemens due o Alzer ], Carwrigh and Field 4], and Mercer 5]
More informationTo become more mathematically correct, Circuit equations are Algebraic Differential equations. from KVL, KCL from the constitutive relationship
Laplace Tranform (Lin & DeCarlo: Ch 3) ENSC30 Elecric Circui II The Laplace ranform i an inegral ranformaion. I ranform: f ( ) F( ) ime variable complex variable From Euler > Lagrange > Laplace. Hence,
More informationGCD AND LCM-LIKE IDENTITIES FOR IDEALS IN COMMUTATIVE RINGS
GCD AND LCM-LIKE IDENTITIES FOR IDEALS IN COMMUTATIVE RINGS D. D. ANDERSON, SHUZO IZUMI, YASUO OHNO, AND MANABU OZAKI Absrac. Le A 1,..., A n n 2 be ideals of a commuaive ring R. Le Gk resp., Lk denoe
More informationStability in Distribution for Backward Uncertain Differential Equation
Sabiliy in Diribuion for Backward Uncerain Differenial Equaion Yuhong Sheng 1, Dan A. Ralecu 2 1. College of Mahemaical and Syem Science, Xinjiang Univeriy, Urumqi 8346, China heng-yh12@mail.inghua.edu.cn
More informationMathematische Annalen
Mah. Ann. 39, 33 339 (997) Mahemaiche Annalen c Springer-Verlag 997 Inegraion by par in loop pace Elon P. Hu Deparmen of Mahemaic, Norhweern Univeriy, Evanon, IL 628, USA (e-mail: elon@@mah.nwu.edu) Received:
More informationCSC 364S Notes University of Toronto, Spring, The networks we will consider are directed graphs, where each edge has associated with it
CSC 36S Noe Univeriy of Torono, Spring, 2003 Flow Algorihm The nework we will conider are direced graph, where each edge ha aociaed wih i a nonnegaive capaciy. The inuiion i ha if edge (u; v) ha capaciy
More informationT-Rough Fuzzy Subgroups of Groups
Journal of mahemaic and compuer cience 12 (2014), 186-195 T-Rough Fuzzy Subgroup of Group Ehagh Hoeinpour Deparmen of Mahemaic, Sari Branch, Ilamic Azad Univeriy, Sari, Iran. hoienpor_a51@yahoo.com Aricle
More informationAN ANALYTICAL METHOD OF SOLUTION FOR SYSTEMS OF BOOLEAN EQUATIONS
CHAPTER 5 AN ANALYTICAL METHOD OF SOLUTION FOR SYSTEMS OF BOOLEAN EQUATIONS 51 APPLICATIONS OF DE MORGAN S LAWS A we have een in Secion 44 of Chaer 4, any Boolean Equaion of ye (1), (2) or (3) could be
More information1 Motivation and Basic Definitions
CSCE : Deign and Analyi of Algorihm Noe on Max Flow Fall 20 (Baed on he preenaion in Chaper 26 of Inroducion o Algorihm, 3rd Ed. by Cormen, Leieron, Rive and Sein.) Moivaion and Baic Definiion Conider
More informationFUZZY n-inner PRODUCT SPACE
Bull. Korean Mah. Soc. 43 (2007), No. 3, pp. 447 459 FUZZY n-inner PRODUCT SPACE Srinivaan Vijayabalaji and Naean Thillaigovindan Reprined from he Bullein of he Korean Mahemaical Sociey Vol. 43, No. 3,
More informationu(t) Figure 1. Open loop control system
Open loop conrol v cloed loop feedbac conrol The nex wo figure preen he rucure of open loop and feedbac conrol yem Figure how an open loop conrol yem whoe funcion i o caue he oupu y o follow he reference
More informationBernoulli numbers. Francesco Chiatti, Matteo Pintonello. December 5, 2016
UNIVERSITÁ DEGLI STUDI DI PADOVA, DIPARTIMENTO DI MATEMATICA TULLIO LEVI-CIVITA Bernoulli numbers Francesco Chiai, Maeo Pinonello December 5, 206 During las lessons we have proved he Las Ferma Theorem
More informationCS4445/9544 Analysis of Algorithms II Solution for Assignment 1
Conider he following flow nework CS444/944 Analyi of Algorihm II Soluion for Aignmen (0 mark) In he following nework a minimum cu ha capaciy 0 Eiher prove ha hi aemen i rue, or how ha i i fale Uing he
More information5.2 GRAPHICAL VELOCITY ANALYSIS Polygon Method
ME 352 GRHICL VELCITY NLYSIS 52 GRHICL VELCITY NLYSIS olygon Mehod Velociy analyi form he hear of kinemaic and dynamic of mechanical yem Velociy analyi i uually performed following a poiion analyi; ie,
More information11!Hí MATHEMATICS : ERDŐS AND ULAM PROC. N. A. S. of decomposiion, properly speaking) conradics he possibiliy of defining a counably addiive real-valu
ON EQUATIONS WITH SETS AS UNKNOWNS BY PAUL ERDŐS AND S. ULAM DEPARTMENT OF MATHEMATICS, UNIVERSITY OF COLORADO, BOULDER Communicaed May 27, 1968 We shall presen here a number of resuls in se heory concerning
More informationDesigning Information Devices and Systems I Spring 2019 Lecture Notes Note 17
EES 16A Designing Informaion Devices and Sysems I Spring 019 Lecure Noes Noe 17 17.1 apaciive ouchscreen In he las noe, we saw ha a capacior consiss of wo pieces on conducive maerial separaed by a nonconducive
More informationGraphs III - Network Flow
Graph III - Nework Flow Flow nework eup graph G=(V,E) edge capaciy w(u,v) 0 - if edge doe no exi, hen w(u,v)=0 pecial verice: ource verex ; ink verex - no edge ino and no edge ou of Aume every verex v
More informationAlgorithms and Data Structures 2011/12 Week 9 Solutions (Tues 15th - Fri 18th Nov)
Algorihm and Daa Srucure 2011/ Week Soluion (Tue 15h - Fri 18h No) 1. Queion: e are gien 11/16 / 15/20 8/13 0/ 1/ / 11/1 / / To queion: (a) Find a pair of ube X, Y V uch ha f(x, Y) = f(v X, Y). (b) Find
More informationAverage Case Lower Bounds for Monotone Switching Networks
Average Cae Lower Bound for Monoone Swiching Nework Yuval Filmu, Toniann Piai, Rober Robere, Sephen Cook Deparmen of Compuer Science Univeriy of Torono Monoone Compuaion (Refreher) Monoone circui were
More information23.2. Representing Periodic Functions by Fourier Series. Introduction. Prerequisites. Learning Outcomes
Represening Periodic Funcions by Fourier Series 3. Inroducion In his Secion we show how a periodic funcion can be expressed as a series of sines and cosines. We begin by obaining some sandard inegrals
More informationFractional Ornstein-Uhlenbeck Bridge
WDS'1 Proceeding of Conribued Paper, Par I, 21 26, 21. ISBN 978-8-7378-139-2 MATFYZPRESS Fracional Ornein-Uhlenbeck Bridge J. Janák Charle Univeriy, Faculy of Mahemaic and Phyic, Prague, Czech Republic.
More informationInventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions
Muli-Period Sochasic Models: Opimali of (s, S) Polic for -Convex Objecive Funcions Consider a seing similar o he N-sage newsvendor problem excep ha now here is a fixed re-ordering cos (> 0) for each (re-)order.
More informationEE Control Systems LECTURE 2
Copyrigh F.L. Lewi 999 All righ reerved EE 434 - Conrol Syem LECTURE REVIEW OF LAPLACE TRANSFORM LAPLACE TRANSFORM The Laplace ranform i very ueful in analyi and deign for yem ha are linear and ime-invarian
More informationLet us start with a two dimensional case. We consider a vector ( x,
Roaion marices We consider now roaion marices in wo and hree dimensions. We sar wih wo dimensions since wo dimensions are easier han hree o undersand, and one dimension is a lile oo simple. However, our
More informationEnergy Equality and Uniqueness of Weak Solutions to MHD Equations in L (0,T; L n (Ω))
Aca Mahemaica Sinica, Englih Serie May, 29, Vol. 25, No. 5, pp. 83 814 Publihed online: April 25, 29 DOI: 1.17/1114-9-7214-8 Hp://www.AcaMah.com Aca Mahemaica Sinica, Englih Serie The Ediorial Office of
More informationCONTROL SYSTEMS. Chapter 10 : State Space Response
CONTROL SYSTEMS Chaper : Sae Space Repone GATE Objecive & Numerical Type Soluion Queion 5 [GATE EE 99 IIT-Bombay : Mark] Conider a econd order yem whoe ae pace repreenaion i of he form A Bu. If () (),
More informationAdmin MAX FLOW APPLICATIONS. Flow graph/networks. Flow constraints 4/30/13. CS lunch today Grading. in-flow = out-flow for every vertex (except s, t)
/0/ dmin lunch oday rading MX LOW PPLIION 0, pring avid Kauchak low graph/nework low nework direced, weighed graph (V, ) poiive edge weigh indicaing he capaciy (generally, aume ineger) conain a ingle ource
More informationarxiv: v2 [cs.cg] 30 Apr 2015
Diffue Reflecion Diameer in Simple Polygon arxiv:1302.2271v2 [c.cg] 30 Apr 2015 Gill Bareque Deparmen of Compuer Science Technion Haifa, Irael bareque@c.echnion.ac.il Eli Fox-Epein Deparmen of Compuer
More informationt is a basis for the solution space to this system, then the matrix having these solutions as columns, t x 1 t, x 2 t,... x n t x 2 t...
Mah 228- Fri Mar 24 5.6 Marix exponenials and linear sysems: The analogy beween firs order sysems of linear differenial equaions (Chaper 5) and scalar linear differenial equaions (Chaper ) is much sronger
More informationNetwork Flow. Data Structures and Algorithms Andrei Bulatov
Nework Flow Daa Srucure and Algorihm Andrei Bulao Algorihm Nework Flow 24-2 Flow Nework Think of a graph a yem of pipe We ue hi yem o pump waer from he ource o ink Eery pipe/edge ha limied capaciy Flow
More informationReminder: Flow Networks
0/0/204 Ma/CS 6a Cla 4: Variou (Flow) Execie Reminder: Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d
More informationMath 334 Fall 2011 Homework 11 Solutions
Dec. 2, 2 Mah 334 Fall 2 Homework Soluions Basic Problem. Transform he following iniial value problem ino an iniial value problem for a sysem: u + p()u + q() u g(), u() u, u () v. () Soluion. Le v u. Then
More informationExplicit form of global solution to stochastic logistic differential equation and related topics
SAISICS, OPIMIZAION AND INFOMAION COMPUING Sa., Opim. Inf. Compu., Vol. 5, March 17, pp 58 64. Publihed online in Inernaional Academic Pre (www.iapre.org) Explici form of global oluion o ochaic logiic
More information6.302 Feedback Systems Recitation : Phase-locked Loops Prof. Joel L. Dawson
6.32 Feedback Syem Phae-locked loop are a foundaional building block for analog circui deign, paricularly for communicaion circui. They provide a good example yem for hi cla becaue hey are an excellen
More informationNotes for Lecture 17-18
U.C. Berkeley CS278: Compuaional Complexiy Handou N7-8 Professor Luca Trevisan April 3-8, 2008 Noes for Lecure 7-8 In hese wo lecures we prove he firs half of he PCP Theorem, he Amplificaion Lemma, up
More informationWe just finished the Erdős-Stone Theorem, and ex(n, F ) (1 1/(χ(F ) 1)) ( n
Lecure 3 - Kövari-Sós-Turán Theorem Jacques Versraëe jacques@ucsd.edu We jus finished he Erdős-Sone Theorem, and ex(n, F ) ( /(χ(f ) )) ( n 2). So we have asympoics when χ(f ) 3 bu no when χ(f ) = 2 i.e.
More informationESTIMATES FOR THE DERIVATIVE OF DIFFUSION SEMIGROUPS
Elec. Comm. in Probab. 3 (998) 65 74 ELECTRONIC COMMUNICATIONS in PROBABILITY ESTIMATES FOR THE DERIVATIVE OF DIFFUSION SEMIGROUPS L.A. RINCON Deparmen of Mahemaic Univeriy of Wale Swanea Singleon Par
More informationLecture Notes 2. The Hilbert Space Approach to Time Series
Time Series Seven N. Durlauf Universiy of Wisconsin. Basic ideas Lecure Noes. The Hilber Space Approach o Time Series The Hilber space framework provides a very powerful language for discussing he relaionship
More information1 Review of Zero-Sum Games
COS 5: heoreical Machine Learning Lecurer: Rob Schapire Lecure #23 Scribe: Eugene Brevdo April 30, 2008 Review of Zero-Sum Games Las ime we inroduced a mahemaical model for wo player zero-sum games. Any
More informationOptimality Conditions for Unconstrained Problems
62 CHAPTER 6 Opimaliy Condiions for Unconsrained Problems 1 Unconsrained Opimizaion 11 Exisence Consider he problem of minimizing he funcion f : R n R where f is coninuous on all of R n : P min f(x) x
More informationAdditional Methods for Solving DSGE Models
Addiional Mehod for Solving DSGE Model Karel Meren, Cornell Univeriy Reference King, R. G., Ploer, C. I. & Rebelo, S. T. (1988), Producion, growh and buine cycle: I. he baic neoclaical model, Journal of
More informationMon Apr 2: Laplace transform and initial value problems like we studied in Chapter 5
Mah 225-4 Week 2 April 2-6 coninue.-.3; alo cover par of.4-.5, EP 7.6 Mon Apr 2:.-.3 Laplace ranform and iniial value problem like we udied in Chaper 5 Announcemen: Warm-up Exercie: Recall, The Laplace
More informationExponential Sawtooth
ECPE 36 HOMEWORK 3: PROPERTIES OF THE FOURIER TRANSFORM SOLUTION. Exponenial Sawooh: The eaie way o do hi problem i o look a he Fourier ranform of a ingle exponenial funcion, () = exp( )u(). From he able
More informationAn Excursion into Set Theory using a Constructivist Approach
An Excursion ino Se Theory using a Consrucivis Approach Miderm Repor Nihil Pail under supervision of Ksenija Simic Fall 2005 Absrac Consrucive logic is an alernaive o he heory of classical logic ha draws
More informationSOME MORE APPLICATIONS OF THE HAHN-BANACH THEOREM
SOME MORE APPLICATIONS OF THE HAHN-BANACH THEOREM FRANCISCO JAVIER GARCÍA-PACHECO, DANIELE PUGLISI, AND GUSTI VAN ZYL Absrac We give a new proof of he fac ha equivalen norms on subspaces can be exended
More informationU T,0. t = X t t T X T. (1)
Gauian bridge Dario Gabarra 1, ommi Soinen 2, and Eko Valkeila 3 1 Deparmen of Mahemaic and Saiic, PO Box 68, 14 Univeriy of Helinki,Finland dariogabarra@rnihelinkifi 2 Deparmen of Mahemaic and Saiic,
More informationSelfish Routing. Tim Roughgarden Cornell University. Includes joint work with Éva Tardos
Selfih Rouing Tim Roughgarden Cornell Univeriy Include join work wih Éva Tardo 1 Which roue would you chooe? Example: one uni of raffic (e.g., car) wan o go from o delay = 1 hour (no congeion effec) long
More informationMonochromatic Infinite Sumsets
Monochromaic Infinie Sumses Imre Leader Paul A. Russell July 25, 2017 Absrac WeshowhahereisaraionalvecorspaceV suchha,whenever V is finiely coloured, here is an infinie se X whose sumse X+X is monochromaic.
More informationLecture 21: Bezier Approximation and de Casteljau s Algorithm. and thou shalt be near unto me Genesis 45:10
Lecure 2: Bezier Approximaion and de Caeljau Algorihm and hou hal be near uno me Genei 45:0. Inroducion In Lecure 20, we ued inerpolaion o pecify hape. Bu inerpolaion i no alway a good way o decribe he
More informationChapter 6. Laplace Transforms
Chaper 6. Laplace Tranform Kreyzig by YHLee;45; 6- An ODE i reduced o an algebraic problem by operaional calculu. The equaion i olved by algebraic manipulaion. The reul i ranformed back for he oluion of
More informationOn the Benney Lin and Kawahara Equations
JOURNAL OF MATEMATICAL ANALYSIS AND APPLICATIONS 11, 13115 1997 ARTICLE NO AY975438 On he BenneyLin and Kawahara Equaion A Biagioni* Deparmen of Mahemaic, UNICAMP, 1381-97, Campina, Brazil and F Linare
More informationCHAPTER 7. Definition and Properties. of Laplace Transforms
SERIES OF CLSS NOTES FOR 5-6 TO INTRODUCE LINER ND NONLINER PROBLEMS TO ENGINEERS, SCIENTISTS, ND PPLIED MTHEMTICINS DE CLSS NOTES COLLECTION OF HNDOUTS ON SCLR LINER ORDINRY DIFFERENTIL EQUTIONS (ODE")
More informationCS 473G Lecture 15: Max-Flow Algorithms and Applications Fall 2005
CS 473G Lecure 1: Max-Flow Algorihm and Applicaion Fall 200 1 Max-Flow Algorihm and Applicaion (November 1) 1.1 Recap Fix a direced graph G = (V, E) ha doe no conain boh an edge u v and i reveral v u,
More informationCurvature. Institute of Lifelong Learning, University of Delhi pg. 1
Dicipline Coure-I Semeer-I Paper: Calculu-I Leon: Leon Developer: Chaianya Kumar College/Deparmen: Deparmen of Mahemaic, Delhi College of r and Commerce, Univeriy of Delhi Iniue of Lifelong Learning, Univeriy
More informationarxiv: v1 [math.ct] 5 Oct 2007
Ieraed diribuive law arxiv:0710.1120v1 [mah.ct] 5 Oc 2007 Eugenia Cheng Deparmen of Mahemaic, Univerié de Nice Sophia-Anipoli and Deparmen of Mahemaic, Univeriy of Sheffield E-mail: e.cheng@heffield.ac.uk
More informationFIXED POINTS AND STABILITY IN NEUTRAL DIFFERENTIAL EQUATIONS WITH VARIABLE DELAYS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 136, Number 3, March 28, Page 99 918 S 2-9939(7)989-2 Aricle elecronically publihed on November 3, 27 FIXED POINTS AND STABILITY IN NEUTRAL DIFFERENTIAL
More informationChapter 7: Inverse-Response Systems
Chaper 7: Invere-Repone Syem Normal Syem Invere-Repone Syem Baic Sar ou in he wrong direcion End up in he original eady-ae gain value Two or more yem wih differen magniude and cale in parallel Main yem
More informationFlow Networks. Ma/CS 6a. Class 14: Flow Exercises
0/0/206 Ma/CS 6a Cla 4: Flow Exercie Flow Nework A flow nework i a digraph G = V, E, ogeher wih a ource verex V, a ink verex V, and a capaciy funcion c: E N. Capaciy Source 7 a b c d e Sink 0/0/206 Flow
More informationNote on Matuzsewska-Orlich indices and Zygmund inequalities
ARMENIAN JOURNAL OF MATHEMATICS Volume 3, Number 1, 21, 22 31 Noe on Mauzewka-Orlic indice and Zygmund inequaliie N. G. Samko Univeridade do Algarve, Campu de Gambela, Faro,85 139, Porugal namko@gmail.com
More informationSample Final Exam (finals03) Covering Chapters 1-9 of Fundamentals of Signals & Systems
Sample Final Exam Covering Chaper 9 (final04) Sample Final Exam (final03) Covering Chaper 9 of Fundamenal of Signal & Syem Problem (0 mar) Conider he caual opamp circui iniially a re depiced below. I LI
More informationLinear Algebra Primer
Linear Algebra rimer And a video dicuion of linear algebra from EE263 i here (lecure 3 and 4): hp://ee.anford.edu/coure/ee263 lide from Sanford CS3 Ouline Vecor and marice Baic Mari Operaion Deerminan,
More informationSOLUTIONS TO ECE 3084
SOLUTIONS TO ECE 384 PROBLEM 2.. For each sysem below, specify wheher or no i is: (i) memoryless; (ii) causal; (iii) inverible; (iv) linear; (v) ime invarian; Explain your reasoning. If he propery is no
More informationEE202 Circuit Theory II
EE202 Circui Theory II 2017-2018, Spring Dr. Yılmaz KALKAN I. Inroducion & eview of Fir Order Circui (Chaper 7 of Nilon - 3 Hr. Inroducion, C and L Circui, Naural and Sep epone of Serie and Parallel L/C
More informationCHAPTER. Forced Equations and Systems { } ( ) ( ) 8.1 The Laplace Transform and Its Inverse. Transforms from the Definition.
CHAPTER 8 Forced Equaion and Syem 8 The aplace Tranform and I Invere Tranform from he Definiion 5 5 = b b {} 5 = 5e d = lim5 e = ( ) b {} = e d = lim e + e d b = (inegraion by par) = = = = b b ( ) ( )
More information