Categories and Quantum Informatics: Monoidal categories

Size: px
Start display at page:

Download "Categories and Quantum Informatics: Monoidal categories"

Transcription

1 Cateories and Quantum Inormatics: Monoidal cateories Chris Heunen Sprin 2018 A monoidal cateory is a cateory equipped with extra data, describin how objects and morphisms can be combined in parallel. This chapter introduces the theory o monoidal cateories, and shows how our example cateories Hilb, Set and Rel can be iven a monoidal structure. We also introduce a visual notation called the raphical calculus, which provides an intuitive and powerul way to work with them. 1.1 Monoidal structure Throuhout this book, we interpret objects o cateories as systems, and morphisms as processes. A monoidal cateory has additional structure allowin us to consider processes occurrin in parallel, as well as sequentially. In terms o our example cateories rom the introduction, one could interpret this in the ollowin ways: lettin independent physical systems evolve simultaneously; runnin computer alorithms in parallel; takin products or sums o alebraic or eometric structures; usin separate proos o P and Q to construct a proo o the conjunction (P and Q). It is perhaps surprisin that a nontrivial theory can be developed at all rom such simple intuition. But in act, some interestin eneral issues quickly arise. For example, let A, B and C be processes, and write or the parallel composition. Then what relationship should there be between the processes (A B) C and A (B C)? You miht say they should be equal, as they are dierent ways o expressin the same arranement o systems. But or many applications this is simply too stron: or example, i A, B and C are Hilbert spaces and is the usual tensor product o Hilbert spaces, these two composite Hilbert spaces are not exactly equal; they are only isomorphic. But we then have a new problem: what equations should that isomorphism satisy? The theory o monoidal cateories is ormulated to deal with these issues. Deinition 1.1. A monoidal cateory is a cateory C equipped with the ollowin data: a tensor product unctor : C C C; a unit object I Ob(C); an associator natural isomorphism (A B) C α A,B,C A (B C); a let unitor natural isomorphism I A λ A A; a riht unitor natural isomorphism A I ρ A A. 1

2 This data must satisy the trianle and pentaon equations, or all objects A, B, C and D: α A,I,B (A I) B A (I B) ρ A id B id A λ B (1.1) A B α A,B C,D ( A (B C) ) D A ( (B C) D ) α A,B,C id D ( (A B) C ) D id A α B,C,D A ( B (C D) ) (1.2) α A B,C,D α A,B,C D (A B) (C D) The naturality conditions or α, λ and ρ correspond to the ollowin equations: α A,B,C (A B) C A (B C) I A λ A A ρ A A I ( ) h ( h) I I (1.3) α A,B,C (A B ) C A (B C ) I B λ B B ρ B B I The tensor unit object I represents the trivial or empty system. This interpretation comes rom the unitor isomorphisms λ A and ρ A, which witness the act that the object A is just as ood as, or isomorphic to, the objects A I and I A. The trianle and pentaon equations each say that two particular ways o reoranizin a system are equal. Surprisinly, this implies that any two reoranizations are equal; this is the content o the Coherence Theorem. Theorem 1.2 (Coherence or monoidal cateories). Given the data o a monoidal cateory, i the pentaon and trianle equations hold, then any well-typed equation built rom α, λ, ρ and their inverses holds. In particular, the trianle and pentaon equation toether imply ρ I = λ I. To appreciate the power o the coherence theorem, try to show this yoursel. Coherence is the undamental motivatin idea o a monoidal cateory, and ives an answer to question we posed earlier in the chapter: the isomorphisms should satisy all possible well-typed equations. So while these morphisms are not trivial or example, they are not necessarily identity morphisms it doesn t matter how we apply them in any particular case. Our irst example o a monoidal structure is on the cateory Hilb. Deinition 1.3. The monoidal structure on the cateory Hilb, and also by restriction on FHilb, is deined in the ollowin way: 2

3 the tensor product : Hilb Hilb Hilb is the tensor product o Hilbert space; the unit object I is the one-dimensional Hilbert space C; associators (H J) K α H,J,K H (J K) are the unique linear maps satisyin (u v) w u (v w) or all u H, v J and w K; let unitors C H λ H H are the unique linear maps satisyin 1 u u or all u H; riht unitors H C ρ H H are the unique linear maps satisyin u 1 u or all u H. Althouh we call the unctor o a monoidal cateory the tensor product, that does not mean that we have to choose the actual tensor product o Hilbert spaces or our monoidal structure. There are other monoidal structures on the cateory that we could choose; a ood example is the direct sum o Hilbert spaces. However, the tensor product we have deined above has a special status, since it correctly describes the state space o a composite system in quantum theory. While Hilb is relevant or quantum computation, the monoidal cateory Set is an important settin or classical computation. Deinition 1.4. The monoidal structure on the cateory Set, and also by restriction on FSet, is deined as ollows or all a A, b B and c C: the tensor product is Cartesian product o sets, written, actin on unctions A B and C D as ( )(a, c) = ( (a), (c) ) ; the unit object is a chosen sinleton set { }; associators (A B) C α A,B,C A (B C) are the unctions iven by ( (a, b), c ) ( a, (b, c) ) ; let unitors I A λ A A are the unctions (, a) a; riht unitors A I ρ A A are the unctions (a, ) a. The Cartesian product in Set is a cateorical product. This is an example o a eneral phenomenon: i a cateory has products, then these can be used to ive a monoidal structure on the cateory. The same is true or coproducts, which in Set are iven by disjoint union. This hihlihts an important dierence between the standard tensor products on Hilb and Set: while the tensor product on Set comes rom a cateorical product, the tensor product on Hilb does not. We will discover many more dierences between Hilb and Set, which provide insiht into the dierences between quantum and classical inormation. There is a canonical monoidal structure on the cateory Rel. Deinition 1.5. The monoidal structure on the cateory Rel is deined in the ollowin way, or all a A, b B, c C and d D: the tensor product is Cartesian product o sets, written, actin on relations A R B and C S D by settin (a, c)(r S)(b, d) i and only i arb and csd; the unit object is a chosen sinleton set = { }; associators (A B) C α A,B,C A (B C) are the relations deined by ( (a, b), c ) ( a, (b, c) ) ; let unitors I A λ A A are the relations deined by (, a) a; riht unitors A I ρ A A are the relations deined by (a, ) a. The Cartesian product is not a cateorical product in Rel, so althouh this monoidal structure looks like that o Set, it is in act more similar to the structure on Hilb. 3

4 Example 1.6. I C is a monoidal cateory, then so is its opposite C op. The tensor unit I in C op is the same as that in C, whereas the tensor product A B in C op is iven by B A in C, the associators in C op are the inverses o those morphisms in C, and the let and riht unitors o C swap roles in C op. Monoidal cateories have an important property called the interchane law, which overns the interaction between the cateorical composition and tensor product. Theorem 1.7 (Interchane). Any morphisms A B, B C, D h E and E j F in a monoidal cateory satisy the interchane law: ( ) (j h) = ( j) ( h) (1.4) Proo. This holds because o properties o the cateory C C, and rom the act that : C C unctor: C is a ( ) (j h) (, j h) = ( (, j) (, h) ) (composition in C C) = ( (, j) ) ( (, h) ) (unctoriality o ) = ( j) ( h) Recall that the unctoriality property or a unctor F says that F ( ) = F () F (). 1.2 Graphical calculus A monoidal structure allows us to interpret multiple processes in our cateory takin place at the same time. For morphisms A B and C D, it thereore seems reasonable, at least inormally, to draw their tensor product A C B D like this: B A The idea is that and represent processes takin place at the same time on distinct systems. Inputs are drawn at the bottom, and outputs are drawn at the top; in this sense, time runs upwards. This extends the one-dimensional notation or cateories. Whereas the raphical calculus or ordinary cateories was onedimensional, or linear, the raphical calculus or monoidal cateories is two-dimensional or planar. The two dimensions correspond to the two ways to combine morphisms: by cateorical composition (vertically) or by tensor product (horizontally). One could imaine this notation bein a useul short-hand when workin with monoidal cateories. This is true, but in act a lot more can be said: the raphical calculus ives a sound and complete lanuae or monoidal cateories. The (identity on the) monoidal unit object I is drawn as the empty diaram: D C (1.5) (1.6) The let unitor I A λ A A, the riht unitor A I ρ A A and the associator (A B) C α A,B,C A (B C) 4

5 are also simply not depicted: A A A B C (1.7) λ A ρ A α A,B,C The coherence o α, λ and ρ is thereore important or the raphical calculus to unction: since there can only be a sinle morphism built rom their components o any iven type (see Section??), it doesn t matter that their raphical calculus encodes no inormation. Now consider the raphical representation o the interchane law (1.4): C F C F j j B E = B E (1.8) h h A D A D We use brackets to indicate how we are ormin the diarams on each side. Droppin the brackets, we see the interchane law is very natural; what seemed to be a mysterious alebraic identity becomes clear rom the raphical perspective. The point o the raphical calculus is that all the supericially complex aspects o the alebraic deinition o monoidal cateories the unit law, the associativity law, associators, let unitors, riht unitors, the trianle equation, the pentaon equation, the interchane law melt away, allowin us to make use o the theory o monoidal cateories in a direct way. These alebraic eatures are still there, but they are absorbed into the eometry o the plane, o which our species has an excellent intuitive understandin. The ollowin theorem is the ormal statement that connects the raphical calculus to the theory o monoidal cateories. Theorem 1.8 (Correctness o the raphical calculus or monoidal cateories). A well-typed equation between morphisms in a monoidal cateory ollows rom the axioms i and only i it holds in the raphical lanuae up to planar isotopy. Two diarams are planar isotopic when one can be deormed continuously into the other within some rectanular reion o the plane, with the input and output wires terminatin at the lower and upper boundaries o the rectanle, without introducin any intersections o the components. For this purpose, we assume that wires have zero width, and morphism boxes have zero size. 5

6 Example 1.9. Here are examples o isotopic and non-isotopic diarams: h iso = h not iso h As we have done here, we will oten allow the heihts o the diarams to chane, and allow input and output wires to slide horizontally alon their respective boundaries, althouh they must never chane order. The third diaram here is not isotopic to the irst two, since or the h box to move to the riht-hand side, it would have to pass throuh one o the wires, which is not allowed. The box cannot pass over or under the wire, since the diarams are conined to the plane that is what is meant by planar isotopy. You should imaine that the components o the diaram are trapped between two pieces o lass. The correctness theorem is really sayin two distinct thins: that the raphical calculus is sound, and that it is complete. To understand these concepts, let and be morphisms such that the equation = is well-typed, and consider the ollowin statements: P (, ): under the axioms o a monoidal cateory, = ; Q(, ): the raphical representations o and are planar isotopic. Soundness is the assertion that or all such and, P (, ) Q(, ). Completeness is the reverse assertion, that Q(, ) P (, ) or all such and. Provin soundness is straihtorward: there are only a inite number o axioms, and one just has to check that they are all valid in terms o planar isotopy o diarams. Completeness is much harder, and beyond the scope o this book: one must analyze the deinition o planar isotopy, and show that any planar isotopy can be built rom a small set o moves, each o which independently leave the value o the morphism in the monoidal cateory unchaned. Let s take a closer look at the condition that the equation = must be well-typed. Firstly, and must have the same source and the same taret. For example, let = id A B, and = ρ A id B. Then their types are A B A B and (A I) B A B. These have dierent source objects, and so the equation is not well-typed, even thouh their raphical representations are planar isotopic. Also, suppose that our cateory happened to satisy A B = (A I) B; then althouh and would have the same type, the equation = would still not be well-typed, since it would be makin use o this accidental equality. For a careul examination o the well-typed property. The notation iso = to denote isotopic diarams, whose interpretations as morphisms in a monoidal cateory are thereore equal, will be used throuhout this book, to indicate an application o the correctness property o the raphical calculus. 1.3 States and eects I a mathematical structure lives as an object o a cateory, and we want to learn somethin about its internal structure, we must ind a way to do it usin the morphisms o the cateory only. For example, consider a set A Ob(Set) with a chosen element a A: we can represent this with the unction { } A deined by a. This inspires the ollowin deinition, which ives us a eneralized cateorical notion o state. 6

7 Deinition In a monoidal cateory, a state o an object A is a morphism I also called points. A. States are sometimes Since the monoidal unit object represents the trivial system, a state I a way or the system A to be brouht into bein. A o a system can be thouht o as Example We now examine what the states are in our three example cateories: in Hilb, states o a Hilbert space H are linear unctions C by considerin the imae o 1 C; H, which correspond to elements o H in Set, states o a set A are unctions { } imae o ; A, which correspond to elements o A by considerin the in Rel, states o a set A are relations { } R A, which correspond to subsets o A by considerin all elements related to. Deinition A monoidal cateory is well-pointed i or all parallel pairs o morphisms A, B, we have = when a = a or all states I a A. A monoidal cateory is monoidally well-pointed i or all, parallel pairs o morphisms A 1 A n B, we have = when (a1 a n ) = (a 1 a n ) or all states I a1 A 1,..., I an A n. The idea is that in a well-pointed cateory, we can tell whether or not morphisms are equal just by seein how they aect states o their domain objects. In a monoidally well-pointed cateory, it is even enouh to consider product states to veriy equality o morphisms out o a compound object. The cateories Set, Rel, Vect, and Hilb are all monoidally well-pointed. For the latter two, this comes down to the act that i {d i } is a basis or H and {e j } is a basis or K, then {d i e j } is a basis or H K. To emphasize that states I a A have the empty picture (1.6) as their domain, we will draw them as trianles instead o boxes. A a (1.9) 1.4 Product states and entanled states For objects A and B o a monoidal cateory, a morphism I c it raphically in the ollowin way. A B c A B is a joint state o A and B. We depict (1.10) Deinition A joint state I c or I a A and I b B: A B is a product state when it is o the orm I λ 1 I A B A B I I a b A B = (1.11) c a b Deinition A joint state is entanled when it is not a product state. 7

8 Entanled states represent preparations o A B which cannot be decomposed as a preparation o A alonside a preparation o B. In this case, there is some essential connection between A and B which means that they cannot have been prepared independently. Example Joint states, product states, and entanled states look as ollows in our example cateories: in Hilb: joint states o H and K are elements o H K; product states are actorizable states; entanled states are elements o H K which cannot be actorized; in Set: joint states o A and B are elements o A B; product states are elements (a, b) A B comin rom a A and b B; entanled states don t exist; in Rel: joint states o A and B are subsets o A B; product states are subsets U A B such that, or some V A and W B, (v, w) U i and only i v V and w W ; entanled states are subsets o A B that are not o this orm. This hints at why entanlement can be diicult to understand intuitively: classically, in the processes encoded by the cateory Set, it cannot occur. However, i we allow nondeterministic behaviour as encoded by Rel, then an analoue o entanlement does appear. 1.5 Eects An eect represents a process by which a system is destroyed, or consumed. Deinition In a monoidal cateory, an eect or costate or an object A is a morphism A I. Given a diaram constructed usin the raphical calculus, we can interpret it as a history o events that have taken place. I the diaram contains an eect, this is interpreted as the assertion that a measurement was perormed, with the iven eect as the result. For example, an interestin diaram would be this one: A x (1.12) a This describes a history in which a state a is prepared, and then a process is perormed producin two systems, the irst o which is measured ivin outcome x. This does not imply that the eect x was the only possible outcome or the measurement; just that by drawin this diaram, we are only interested in the cases when the outcome x does occur. An eect can be thouht o as a postselection: we run our entire experiment repeatedly, only acceptin the result when we ind that our measurement had the speciied outcome. Overall our history is a morphism o type I A, which is a state o A. The postselection interpretation tells us how to prepare this state, iven the ability to perorm its components. 8

9 Example These statements are at a very eneral level. To say more, we must take account o the particular theory o processes described by the monoidal cateory in which we are workin. In quantum theory, as encoded by Hilb, we require a, and x to be partial isometries. The rules o quantum mechanics then dictate that the probability or this history to take place is iven by the square norm o the resultin state. So in particular, the history described by this composite is impossible exactly when the overall state is zero. In nondeterministic classical physics, as described by Rel, we need put no particular requirements on a, and x they may be arbitrary relations o the correct types. The overall composite relation then describes the possible ways in which A can be prepared as a result o this history. I the overall composite is empty, that means this particular sequence o a state preparation, a dynamics step, and a measurement result cannot occur. Thins are very dierent in Set. The monoidal unit object is terminal in that cateory, meanin Set(A, I) has only a sinle element or any object A. So every object has a unique eect, and there is no nontrivial notion o measurement. 1.6 Braidin and symmetry In many theories o processes, i A and B are systems, the systems A B and B A can be considered essentially equivalent. While we would not expect them to be equal, we miht at least expect there to be some special process o type A B B A that switches the systems, and does nothin more. Developin these ideas ives rise to braided and symmetric monoidal cateories, which we now investiate. We irst consider braided monoidal cateories. Deinition A braided monoidal cateory is a monoidal cateory equipped with a natural isomorphism A B σ A,B B A (1.13) satisyin the ollowin hexaon equations: α 1 A,B,C A (B C) σ A,B C (B C) A α 1 B,C,A (A B) C σ A,B id C B (C A) id B σ A,C (1.14) (B A) C B (A C) α B,A,C σ A B,C (A B) C C (A B) α A,B,C α C,A,B A (B C) id A σ B,C A (C B) α 1 A,C,B (A C) B (C A) B σ A,C id B (1.15) 9

10 We include the braidin in the raphical notation like this: (1.16) A B σ A,B B A B A σ 1 A,B A B Invertibility then takes the ollowin raphical orm: = = (1.17) This captures part o the eometric behaviour o strins. Naturality o the braidin and the inverse braidin have the ollowin raphical representations: = = (1.18) The hexaon equations have the ollowin raphical representations: = = (1.19) Each o these equations has two strands close to each other on the let-hand side, to indicate that we are treatin them as a sinle composite object or the purposes o the braidin. We see that the hexaon equations are sayin somethin quite straihtorward: to braid with a tensor product o two strands is the same as braidin separately with one then the other. Since the strands o a braidin cross over each other, they are not lyin on the plane; they live in threedimensional space. So while cateories have a one-dimensional or linear notation, and monoidal cateories have a two-dimensional or planar raphical notation, braided monoidal cateories have a three-dimensional notation. Because o this, braided monoidal cateories have an important connection to three-dimensional quantum ield theory. Braided monoidal cateories have a sound and complete raphical calculus, as established by the ollowin theorem. The notion o isotopy it uses is now three-dimensional; that is, the diarams are assumed to lie in a cube, with input wires terminatin at the lower ace and output wires terminatin at the upper ace. This is also called spatial isotopy. Theorem 1.19 (Correctness o raphical calculus or braided monoidal cateories). A well-typed equation between morphisms in a braided monoidal cateory ollows rom the axioms i and only i it holds in the raphical lanuae up to spatial isotopy. 10

11 Given two isotopic diarams, it can be quite nontrivial to show they are equal usin the axioms o braided monoidal cateories directly. So as with ordinary monoidal cateories, the coherence theorem is quite powerul. For example, try to show that the ollowin two equations hold directly usin the axioms o a braided monoidal cateory: = (1.20) = (1.21) Equation (1.21) is called the Yan Baxter equation, which plays an important role in the mathematical theory o knots. We now ive some examples o braided monoidal cateories. For each o our main example cateories there is a naive notion o a swap process, which in each case ives a braided monoidal structure. Deinition Our example cateories Hilb, Set and Rel can all be equipped with a canonical braidin: in Hilb, H K σ H,K in Set, A B σ A,B in Rel, A B σ A,B K H is the unique linear map extendin a b b a or all a H and b K; B A is deined by (a, b) (b, a) or all a A and b B; B A is deined by (a, b) (b, a) or all a A and b B. In act these are all symmetric monoidal structures, which we explore in Section Symmetric monoidal cateories In our example cateories Hilb, Rel and Set, the braidins satisy an extra property that makes them very easy to work with. Deinition A braided monoidal cateory is symmetric when or all objects A and B, in which case we call σ the symmetry. Graphically, condition (1.22) has the ollowin representation. σ B,A σ A,B = id A B (1.22) = (1.23) Intuitively: the strins can pass throuh each other, and nontrivial knots cannot be ormed. 11

12 Lemma In a symmetric monoidal cateory σ A,B = σ 1 B,A, with the ollowin raphical representation: = (1.24) Proo. Combine (1.17) and (1.23). A symmetric monoidal cateory thereore makes no distinction between over- and under-crossins, and so we simpliy our raphical notation, drawin (1.25) or the sinle type o crossin. The raphical calculus with the extension o braidin or symmetry is still sound: i the two diarams o morphisms can be deormed into one another, then the two morphisms are equal. Suppose we imaine our diarams as curves embedded in our-dimensional space. Then we can smoothly deorm one crossin into the other, in the manner o equation (1.24), by makin use o the extra dimension. In this sense, symmetric monoidal cateories have a our-dimensional raphical notation. The ollowin correctness theorem thereore uses the our-dimensional version o isotopy. Theorem 1.23 (Correctness o the raphical calculus or symmetric monoidal cateories). A well-typed equation between morphisms in a symmetric monoidal cateory ollows rom the axioms i and only i it holds in the raphical lanuae up to our-dimensional isotopy. 12

Categorical Background (Lecture 2)

Categorical Background (Lecture 2) Cateorical Backround (Lecture 2) February 2, 2011 In the last lecture, we stated the main theorem o simply-connected surery (at least or maniolds o dimension 4m), which hihlihts the importance o the sinature

More information

Category Theory 2. Eugenia Cheng Department of Mathematics, University of Sheffield Draft: 31st October 2007

Category Theory 2. Eugenia Cheng Department of Mathematics, University of Sheffield   Draft: 31st October 2007 Cateory Theory 2 Euenia Chen Department o Mathematics, niversity o Sheield E-mail: echen@sheieldacuk Drat: 31st October 2007 Contents 2 Some basic universal properties 1 21 Isomorphisms 2 22 Terminal objects

More information

Introduction to Categorical Quantum Mechanics. Chris Heunen and Jamie Vicary

Introduction to Categorical Quantum Mechanics. Chris Heunen and Jamie Vicary Introduction to Categorical Quantum Mechanics Chris Heunen and Jamie Vicary February 20, 2013 ii Preace Physical systems cannot be studied in isolation, since we can only observe their behaviour with respect

More information

UMS 7/2/14. Nawaz John Sultani. July 12, Abstract

UMS 7/2/14. Nawaz John Sultani. July 12, Abstract UMS 7/2/14 Nawaz John Sultani July 12, 2014 Notes or July, 2 2014 UMS lecture Abstract 1 Quick Review o Universals Deinition 1.1. I S : D C is a unctor and c an object o C, a universal arrow rom c to S

More information

The Category of Sets

The Category of Sets The Cateory o Sets Hans Halvorson October 16, 2016 [[Note to students: this is a irst drat. Please report typos. A revised version will be posted within the next couple o weeks.]] 1 Introduction The aim

More information

COARSE-GRAINING OPEN MARKOV PROCESSES. John C. Baez. Kenny Courser

COARSE-GRAINING OPEN MARKOV PROCESSES. John C. Baez. Kenny Courser COARE-GRAINING OPEN MARKOV PROCEE John C. Baez Department o Mathematics University o Caliornia Riverside CA, UA 95 and Centre or Quantum echnoloies National University o inapore inapore 7543 Kenny Courser

More information

A Peter May Picture Book, Part 1

A Peter May Picture Book, Part 1 A Peter May Picture Book, Part 1 Steve Balady Auust 17, 2007 This is the beinnin o a larer project, a notebook o sorts intended to clariy, elucidate, and/or illustrate the principal ideas in A Concise

More information

Categorical quantum mechanics

Categorical quantum mechanics Categorical quantum mechanics Chris Heunen 1 / 76 Categorical Quantum Mechanics? Study of compositional nature of (physical) systems Primitive notion: forming compound systems 2 / 76 Categorical Quantum

More information

RELATIVE GOURSAT CATEGORIES

RELATIVE GOURSAT CATEGORIES RELTIVE GOURST CTEGORIES JULI GOEDECKE ND TMR JNELIDZE bstract. We deine relative Goursat cateories and prove relative versions o the equivalent conditions deinin reular Goursat cateories. These include

More information

THE GORENSTEIN DEFECT CATEGORY

THE GORENSTEIN DEFECT CATEGORY THE GORENSTEIN DEFECT CATEGORY PETTER ANDREAS BERGH, DAVID A. JORGENSEN & STEFFEN OPPERMANN Dedicated to Ranar-Ola Buchweitz on the occasion o his sixtieth birthday Abstract. We consider the homotopy cateory

More information

Towards a Flowchart Diagrammatic Language for Monad-based Semantics

Towards a Flowchart Diagrammatic Language for Monad-based Semantics Towards a Flowchart Diagrammatic Language or Monad-based Semantics Julian Jakob Friedrich-Alexander-Universität Erlangen-Nürnberg julian.jakob@au.de 21.06.2016 Introductory Examples 1 2 + 3 3 9 36 4 while

More information

CLASSIFICATION OF GROUP EXTENSIONS AND H 2

CLASSIFICATION OF GROUP EXTENSIONS AND H 2 CLASSIFICATION OF GROUP EXTENSIONS AND H 2 RAPHAEL HO Abstract. In this paper we will outline the oundations o homoloical alebra, startin with the theory o chain complexes which arose in alebraic topoloy.

More information

Categories and Natural Transformations

Categories and Natural Transformations Categories and Natural Transormations Ethan Jerzak 17 August 2007 1 Introduction The motivation or studying Category Theory is to ormalise the underlying similarities between a broad range o mathematical

More information

FORMAL CATEGORY THEORY

FORMAL CATEGORY THEORY FORML TEGORY THEORY OURSE HELD T MSRYK UNIVERSITY IVN DI LIERTI, SIMON HENRY, MIKE LIEERMNN, FOSO LOREGIN bstract. These are the notes o a readin seminar on ormal cateory theory we are runnin at Masaryk

More information

CONVENIENT CATEGORIES OF SMOOTH SPACES

CONVENIENT CATEGORIES OF SMOOTH SPACES TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 363, Number 11, November 2011, Paes 5789 5825 S 0002-9947(2011)05107-X Article electronically published on June 6, 2011 CONVENIENT CATEGORIES OF

More information

BECK'S THEOREM CHARACTERIZING ALGEBRAS

BECK'S THEOREM CHARACTERIZING ALGEBRAS BEK'S THEOREM HARATERIZING ALGEBRAS SOFI GJING JOVANOVSKA Abstract. In this paper, I will construct a proo o Beck's Theorem characterizin T -alebras. Suppose we have an adjoint pair o unctors F and G between

More information

Graphs: ubiquitous and beautiful. Graphical Reasoning in Symmetric Monoidal Categories for Quantum Information. Graphs: UML

Graphs: ubiquitous and beautiful. Graphical Reasoning in Symmetric Monoidal Categories for Quantum Information. Graphs: UML Graphs: ubiquitous and beautiul Graphical Reasonin in Smmetric Monoidal Cateories or Quantum Inormation Lucas Dion, Universit o Edinburh (Joint ork Ross Duncan and Aleks Kissiner) Abstracts over detail

More information

INTERSECTION THEORY CLASSES 20 AND 21: BIVARIANT INTERSECTION THEORY

INTERSECTION THEORY CLASSES 20 AND 21: BIVARIANT INTERSECTION THEORY INTERSECTION THEORY CLASSES 20 AND 21: BIVARIANT INTERSECTION THEORY RAVI VAKIL CONTENTS 1. What we re doin this week 1 2. Precise statements 2 2.1. Basic operations and properties 4 3. Provin thins 6

More information

(C) The rationals and the reals as linearly ordered sets. Contents. 1 The characterizing results

(C) The rationals and the reals as linearly ordered sets. Contents. 1 The characterizing results (C) The rationals and the reals as linearly ordered sets We know that both Q and R are something special. When we think about about either o these we usually view it as a ield, or at least some kind o

More information

Oriented Bivariant Theories, I

Oriented Bivariant Theories, I ESI The Erwin Schrödiner International Boltzmannasse 9 Institute or Mathematical Physics A-1090 Wien, Austria Oriented Bivariant Theories, I Shoji Yokura Vienna, Preprint ESI 1911 2007 April 27, 2007 Supported

More information

Objectives. By the time the student is finished with this section of the workbook, he/she should be able

Objectives. By the time the student is finished with this section of the workbook, he/she should be able FUNCTIONS Quadratic Functions......8 Absolute Value Functions.....48 Translations o Functions..57 Radical Functions...61 Eponential Functions...7 Logarithmic Functions......8 Cubic Functions......91 Piece-Wise

More information

STRONGLY GORENSTEIN PROJECTIVE MODULES OVER UPPER TRIANGULAR MATRIX ARTIN ALGEBRAS. Shanghai , P. R. China. Shanghai , P. R.

STRONGLY GORENSTEIN PROJECTIVE MODULES OVER UPPER TRIANGULAR MATRIX ARTIN ALGEBRAS. Shanghai , P. R. China. Shanghai , P. R. STRONGLY GORENSTEIN PROJETIVE MODULES OVER UPPER TRINGULR MTRIX RTIN LGERS NN GO PU ZHNG Department o Mathematics Shanhai University Shanhai 2444 P R hina Department o Mathematics Shanhai Jiao Ton University

More information

Work It, Wrap It, Fix It, Fold It

Work It, Wrap It, Fix It, Fold It 1 Work It, Wrap It, Fix It, Fold It NEIL SCULTHORPE University o Kansas, USA GRAHAM HUTTON University o Nottinham, UK Abstract The worker/wrapper transormation is a eneral-purpose technique or reactorin

More information

arxiv: v3 [quant-ph] 27 May 2016

arxiv: v3 [quant-ph] 27 May 2016 arxiv:1510.05468v3 [quant-ph] 27 May 2016 Cateorical Quantum Mechanics I: Causal Quantum Processes ob Coecke 1 and leks Kissiner 2 1 Department o Computer Science, Oxord. coecke@cs.ox.ac.uk 2 icis, Radboud

More information

CS 361 Meeting 28 11/14/18

CS 361 Meeting 28 11/14/18 CS 361 Meeting 28 11/14/18 Announcements 1. Homework 9 due Friday Computation Histories 1. Some very interesting proos o undecidability rely on the technique o constructing a language that describes the

More information

Prerequisite material for thinking about fermionic topological phases

Prerequisite material for thinking about fermionic topological phases Prerequisite material or thinkin about ermionic topoloical phases Ethan Lake October 30, 2016 These notes are a collection o remarks on various thins needed to start doin real work on ermionic topoloical

More information

are well-formed, provided Φ ( X, x)

are well-formed, provided Φ ( X, x) (October 27) 1 We deine an axiomatic system, called the First-Order Theory o Abstract Sets (FOTAS) Its syntax will be completely speciied Certain axioms will be iven; but these may be extended by additional

More information

Math 216A. A gluing construction of Proj(S)

Math 216A. A gluing construction of Proj(S) Math 216A. A gluing construction o Proj(S) 1. Some basic deinitions Let S = n 0 S n be an N-graded ring (we ollows French terminology here, even though outside o France it is commonly accepted that N does

More information

arxiv:quant-ph/ v2 2 Mar 2004

arxiv:quant-ph/ v2 2 Mar 2004 The oic o Entanlement Bob Coecke Oxord University Computin aboratory, Wolson Buildin, Parks Road, OX QD Oxord, UK. coecke@comlab.ox.ac.uk arxiv:quant-ph/000v Mar 00 Abstract. We expose the inormation low

More information

arxiv:math/ v1 [math.ct] 16 Jun 2006

arxiv:math/ v1 [math.ct] 16 Jun 2006 arxiv:math/0606393v1 [math.ct] 16 Jun 2006 Strict 2-toposes Mark Weber bstract. 2-cateorical eneralisation o the notion o elementary topos is provided, and some o the properties o the yoneda structure

More information

The inner automorphism 3-group of a strict 2-group

The inner automorphism 3-group of a strict 2-group The inner automorphism 3-roup o a strict 2-roup Dav Roberts and Urs Schreiber July 25, 2007 Abstract or any roup G, there is a 2-roup o inner automorphisms, INN(G). This plays the role o the universal

More information

5. Network Analysis. 5.1 Introduction

5. Network Analysis. 5.1 Introduction 5. Network Analysis 5.1 Introduction With the continued rowth o this country as it enters the next century comes the inevitable increase in the number o vehicles tryin to use the already overtaxed transportation

More information

Basic properties of limits

Basic properties of limits Roberto s Notes on Dierential Calculus Chapter : Limits and continuity Section Basic properties o its What you need to know already: The basic concepts, notation and terminology related to its. What you

More information

SPLITTING OF SHORT EXACT SEQUENCES FOR MODULES. 1. Introduction Let R be a commutative ring. A sequence of R-modules and R-linear maps.

SPLITTING OF SHORT EXACT SEQUENCES FOR MODULES. 1. Introduction Let R be a commutative ring. A sequence of R-modules and R-linear maps. SPLITTING OF SHORT EXACT SEQUENCES FOR MODULES KEITH CONRAD 1. Introduction Let R be a commutative rin. A sequence o R-modules and R-linear maps N M P is called exact at M i im = ker. For example, to say

More information

Western University. Imants Barušs King's University College, Robert Woodrow

Western University. Imants Barušs King's University College, Robert Woodrow Western University Scholarship@Western Psycholoy Psycholoy 2013 A reduction theorem or the Kripke-Joyal semantics: Forcin over an arbitrary cateory can always be replaced by orcin over a complete Heytin

More information

Triangulated categories and localization

Triangulated categories and localization Trianulated cateories and localization Karin Marie Jacobsen Master o Science in Physics and Mathematics Submission date: Januar 212 Supervisor: Aslak Bakke Buan, MATH Norweian University o Science and

More information

The excess intersection formula for Grothendieck-Witt groups

The excess intersection formula for Grothendieck-Witt groups manuscripta mathematica manuscript No. (will be inserted by the editor) Jean Fasel The excess intersection ormula or Grothendieck-Witt roups Received: date / Revised version: date Abstract. We prove the

More information

1 Categories, Functors, and Natural Transformations. Discrete categories. A category is discrete when every arrow is an identity.

1 Categories, Functors, and Natural Transformations. Discrete categories. A category is discrete when every arrow is an identity. MacLane: Categories or Working Mathematician 1 Categories, Functors, and Natural Transormations 1.1 Axioms or Categories 1.2 Categories Discrete categories. A category is discrete when every arrow is an

More information

8.4 Inverse Functions

8.4 Inverse Functions Section 8. Inverse Functions 803 8. Inverse Functions As we saw in the last section, in order to solve application problems involving eponential unctions, we will need to be able to solve eponential equations

More information

SEPARATED AND PROPER MORPHISMS

SEPARATED AND PROPER MORPHISMS SEPARATED AND PROPER MORPHISMS BRIAN OSSERMAN The notions o separatedness and properness are the algebraic geometry analogues o the Hausdor condition and compactness in topology. For varieties over the

More information

Central Limit Theorems and Proofs

Central Limit Theorems and Proofs Math/Stat 394, Winter 0 F.W. Scholz Central Limit Theorems and Proos The ollowin ives a sel-contained treatment o the central limit theorem (CLT). It is based on Lindeber s (9) method. To state the CLT

More information

Problem Set. Problems on Unordered Summation. Math 5323, Fall Februray 15, 2001 ANSWERS

Problem Set. Problems on Unordered Summation. Math 5323, Fall Februray 15, 2001 ANSWERS Problem Set Problems on Unordered Summation Math 5323, Fall 2001 Februray 15, 2001 ANSWERS i 1 Unordered Sums o Real Terms In calculus and real analysis, one deines the convergence o an ininite series

More information

Petri Nets, Discrete Physics, and Distributed Quantum Computation

Petri Nets, Discrete Physics, and Distributed Quantum Computation Petri Nets, Discrete Physics, and Distributed Quantum Computation Samson bramsky Oxord University Computin Laboratory This paper is dedicated to Uo Montanari on the occasion o his 65th birthday. bstract.

More information

SEPARATED AND PROPER MORPHISMS

SEPARATED AND PROPER MORPHISMS SEPARATED AND PROPER MORPHISMS BRIAN OSSERMAN Last quarter, we introduced the closed diagonal condition or a prevariety to be a prevariety, and the universally closed condition or a variety to be complete.

More information

From Loop Groups To 2-Groups

From Loop Groups To 2-Groups From Loop Groups To 2-Groups John C. Baez Joint work with: Aaron Lauda Alissa Crans Danny Stevenson & Urs Schreiber 1 G f 1 f D 2 More details at: http://math.ucr.edu/home/baez/2roup/ 1 Hiher Gaue Theory

More information

arxiv: v7 [cs.db] 24 Jul 2015

arxiv: v7 [cs.db] 24 Jul 2015 Relational oundations or unctorial Data Miration David I. Spivak, Ryan Wisnesky Massachusetts Institute o Technoloy {dspivak, wisnesky}@math.mit.edu arxiv:1212.5303v7 [cs.db] 24 Jul 2015 July 28, 2015

More information

A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract)

A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract) A linear-non-linear model or a computational call-by-value lambda calculus (extended abstract) Peter Seliner 1 and Benoît Valiron 2 1 Dalhousie University, seliner@mathstat.dal.ca 2 University o Ottawa,

More information

On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity

On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity Acta Cybernetica 22 (2016) 687 701. On Nonpermutational Transormation Semiroups with an Application to Syntactic Complexity Szabolcs Iván and Judit Nay-Györy Abstract We ive an upper bound o n((n 1)! (n

More information

Math 248B. Base change morphisms

Math 248B. Base change morphisms Math 248B. Base change morphisms 1. Motivation A basic operation with shea cohomology is pullback. For a continuous map o topological spaces : X X and an abelian shea F on X with (topological) pullback

More information

Quantum computing with relations. Outline. Dusko Pavlovic. Quantum. programs. Quantum. categories. Classical interfaces.

Quantum computing with relations. Outline. Dusko Pavlovic. Quantum. programs. Quantum. categories. Classical interfaces. Outline Wat do quantum prorammers do? Cateories or quantum prorammin Kestrel Institute and Oxord University or cateorical quantum QI 009 Saarbrücken, Marc 009 ll tat in te cateory o Outline Wat do quantum

More information

CATEGORIES. 1.1 Introduction

CATEGORIES. 1.1 Introduction 1 CATEGORIES 1.1 Introduction What is category theory? As a irst approximation, one could say that category theory is the mathematical study o (abstract) algebras o unctions. Just as group theory is the

More information

9.3 Graphing Functions by Plotting Points, The Domain and Range of Functions

9.3 Graphing Functions by Plotting Points, The Domain and Range of Functions 9. Graphing Functions by Plotting Points, The Domain and Range o Functions Now that we have a basic idea o what unctions are and how to deal with them, we would like to start talking about the graph o

More information

( ) x y z. 3 Functions 36. SECTION D Composite Functions

( ) x y z. 3 Functions 36. SECTION D Composite Functions 3 Functions 36 SECTION D Composite Functions By the end o this section you will be able to understand what is meant by a composite unction ind composition o unctions combine unctions by addition, subtraction,

More information

Synchronous Machines: a Traced Category

Synchronous Machines: a Traced Category Synchronous Machines: a Traced Cateory Marc anol, Guatto drien To cite this version: Marc anol, Guatto drien. Synchronous Machines: a Traced Cateory. [Research Report] 2012. HL Id: hal-00748010

More information

VALUATIVE CRITERIA BRIAN OSSERMAN

VALUATIVE CRITERIA BRIAN OSSERMAN VALUATIVE CRITERIA BRIAN OSSERMAN Intuitively, one can think o separatedness as (a relative version o) uniqueness o limits, and properness as (a relative version o) existence o (unique) limits. It is not

More information

TOPOLOGY FROM THE CATEGORICAL VIEWPOINT

TOPOLOGY FROM THE CATEGORICAL VIEWPOINT TOOLOGY FROM THE CATEGORICAL VIEWOINT KYLE ORMSBY One o the primary insihts o twentieth century mathematics is that obects should not be studied in isolation. Rather, to understand obects we must also

More information

The concept of limit

The concept of limit Roberto s Notes on Dierential Calculus Chapter 1: Limits and continuity Section 1 The concept o limit What you need to know already: All basic concepts about unctions. What you can learn here: What limits

More information

Diagrammatic logic applied to a parameterization process

Diagrammatic logic applied to a parameterization process Diarammatic loic applied to a parameterization process César Domínuez Dominique Duval Auust 25., 2009 Abstract. This paper provides an abstract deinition o some kinds o loics, called diarammatic loics,

More information

Categories and Quantum Informatics: Hilbert spaces

Categories and Quantum Informatics: Hilbert spaces Categories and Quantum Informatics: Hilbert spaces Chris Heunen Spring 2018 We introduce our main example category Hilb by recalling in some detail the mathematical formalism that underlies quantum theory:

More information

STAT 801: Mathematical Statistics. Hypothesis Testing

STAT 801: Mathematical Statistics. Hypothesis Testing STAT 801: Mathematical Statistics Hypothesis Testing Hypothesis testing: a statistical problem where you must choose, on the basis o data X, between two alternatives. We ormalize this as the problem o

More information

What types of isometric transformations are we talking about here? One common case is a translation by a displacement vector R.

What types of isometric transformations are we talking about here? One common case is a translation by a displacement vector R. 1. Planar Defects Planar defects: orientation and types Crystalline films often contain internal, -D interfaces separatin two reions transformed with respect to one another, but with, otherwise, essentially,

More information

The Clifford algebra and the Chevalley map - a computational approach (detailed version 1 ) Darij Grinberg Version 0.6 (3 June 2016). Not proofread!

The Clifford algebra and the Chevalley map - a computational approach (detailed version 1 ) Darij Grinberg Version 0.6 (3 June 2016). Not proofread! The Cliord algebra and the Chevalley map - a computational approach detailed version 1 Darij Grinberg Version 0.6 3 June 2016. Not prooread! 1. Introduction: the Cliord algebra The theory o the Cliord

More information

Another possibility is a rotation or reflection, represented by a matrix M.

Another possibility is a rotation or reflection, represented by a matrix M. 1 Chapter 25: Planar defects Planar defects: orientation and types Crystalline films often contain internal, 2-D interfaces separatin two reions transformed with respect to one another, but with, otherwise,

More information

arxiv: v1 [math.gt] 1 May 2018

arxiv: v1 [math.gt] 1 May 2018 GENERALIZED KUPERBERG INVARIANTS OF 3-MANIFOLDS arxiv:180500413v1 [mathgt] 1 May 2018 RINAT KASHAEV AND ALEXIS VIRELIZIER Abstract In the 90s, based on presentations o 3-maniolds by Heeaard diarams, Kuperber

More information

BARYCENTRIC SUBDIVISION AND ISOMORPHISMS OF GROUPOIDS

BARYCENTRIC SUBDIVISION AND ISOMORPHISMS OF GROUPOIDS BARYCENTRIC SUBDIVISION AND ISOMORPHISMS OF GROUPOIDS JASHA SOMMER-SIMPSON Abstract Given roupoids G and H as well as an isomorpism Ψ : Sd G = Sd H between subdivisions, we construct an isomorpism P :

More information

ASSOCIATIVITY DATA IN AN (, 1)-CATEGORY

ASSOCIATIVITY DATA IN AN (, 1)-CATEGORY ASSOCIATIVITY DATA IN AN (, 1)-CATEGORY EMILY RIEHL A popular sloan is tat (, 1)-cateories (also called quasi-cateories or - cateories) sit somewere between cateories and spaces, combinin some o te eatures

More information

Finite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract)

Finite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract) Electronic Notes in Theoretical Computer Science 270 (1) (2011) 113 119 www.elsevier.com/locate/entcs Finite Dimensional Hilbert Spaces are Complete or Dagger Compact Closed Categories (Extended bstract)

More information

LIMITS AND COLIMITS. m : M X. in a category G of structured sets of some sort call them gadgets the image subset

LIMITS AND COLIMITS. m : M X. in a category G of structured sets of some sort call them gadgets the image subset 5 LIMITS ND COLIMITS In this chapter we irst briely discuss some topics namely subobjects and pullbacks relating to the deinitions that we already have. This is partly in order to see how these are used,

More information

( x) f = where P and Q are polynomials.

( x) f = where P and Q are polynomials. 9.8 Graphing Rational Functions Lets begin with a deinition. Deinition: Rational Function A rational unction is a unction o the orm ( ) ( ) ( ) P where P and Q are polynomials. Q An eample o a simple rational

More information

VALUATIVE CRITERIA FOR SEPARATED AND PROPER MORPHISMS

VALUATIVE CRITERIA FOR SEPARATED AND PROPER MORPHISMS VALUATIVE CRITERIA FOR SEPARATED AND PROPER MORPHISMS BRIAN OSSERMAN Recall that or prevarieties, we had criteria or being a variety or or being complete in terms o existence and uniqueness o limits, where

More information

Roberto s Notes on Differential Calculus Chapter 8: Graphical analysis Section 1. Extreme points

Roberto s Notes on Differential Calculus Chapter 8: Graphical analysis Section 1. Extreme points Roberto s Notes on Dierential Calculus Chapter 8: Graphical analysis Section 1 Extreme points What you need to know already: How to solve basic algebraic and trigonometric equations. All basic techniques

More information

Mixture Behavior, Stability, and Azeotropy

Mixture Behavior, Stability, and Azeotropy 7 Mixture Behavior, Stability, and Azeotropy Copyrihted Material CRC Press/Taylor & Francis 6 BASIC RELATIONS As compounds mix to some deree in the liquid phase, the Gibbs enery o the system decreases

More information

Extreme Values of Functions

Extreme Values of Functions Extreme Values o Functions When we are using mathematics to model the physical world in which we live, we oten express observed physical quantities in terms o variables. Then, unctions are used to describe

More information

Notes on Serre fibrations

Notes on Serre fibrations Notes on Serre ibrations Stehen A. Mitchell Auust 2001 1 Introduction Many roblems in tooloy can be ormulated abstractly as extension roblems A i h X or litin roblems X h Here the solid arrows reresent

More information

INTERSECTION THEORY CLASS 17

INTERSECTION THEORY CLASS 17 INTERSECTION THEORY CLASS 17 RAVI VAKIL CONTENTS 1. Were we are 1 1.1. Reined Gysin omomorpisms i! 2 1.2. Excess intersection ormula 4 2. Local complete intersection morpisms 6 Were we re oin, by popular

More information

arxiv: v1 [math.rt] 12 Nov 2017

arxiv: v1 [math.rt] 12 Nov 2017 TRIANGULATED CATEGORIES WITH CLUSTER TILTING SUBCATEGORIES WUZHONG YANG, PANYUE ZHOU, AND BIN ZHU Dedicated to Proessor Idun Reiten on the occasion o her 75th birthday arxiv:7.0490v [math.rt] Nov 07 Abstract.

More information

Functions. Introduction

Functions. Introduction Functions,00 P,000 00 0 y 970 97 980 98 990 99 000 00 00 Fiure Standard and Poor s Inde with dividends reinvested (credit "bull": modiication o work by Prayitno Hadinata; credit "raph": modiication o work

More information

Relaxed Multiplication Using the Middle Product

Relaxed Multiplication Using the Middle Product Relaxed Multiplication Usin the Middle Product Joris van der Hoeven Département de Mathématiques (bât. 425) Université Paris-Sud 91405 Orsay Cedex France joris@texmacs.or ABSTRACT In previous work, we

More information

9.1 The Square Root Function

9.1 The Square Root Function Section 9.1 The Square Root Function 869 9.1 The Square Root Function In this section we turn our attention to the square root unction, the unction deined b the equation () =. (1) We begin the section

More information

1.5 Function Arithmetic

1.5 Function Arithmetic 76 Relations and Functions.5 Function Aritmetic In te previous section we used te newly deined unction notation to make sense o epressions suc as ) + 2 and 2) or a iven unction. It would seem natural,

More information

CLASS NOTES MATH 527 (SPRING 2011) WEEK 6

CLASS NOTES MATH 527 (SPRING 2011) WEEK 6 CLASS NOTES MATH 527 (SPRING 2011) WEEK 6 BERTRAND GUILLOU 1. Mon, Feb. 21 Note that since we have C() = X A C (A) and the inclusion A C (A) at time 0 is a coibration, it ollows that the pushout map i

More information

On High-Rate Cryptographic Compression Functions

On High-Rate Cryptographic Compression Functions On High-Rate Cryptographic Compression Functions Richard Ostertág and Martin Stanek Department o Computer Science Faculty o Mathematics, Physics and Inormatics Comenius University Mlynská dolina, 842 48

More information

Descent on the étale site Wouter Zomervrucht, October 14, 2014

Descent on the étale site Wouter Zomervrucht, October 14, 2014 Descent on the étale site Wouter Zomervrucht, October 14, 2014 We treat two eatures o the étale site: descent o morphisms and descent o quasi-coherent sheaves. All will also be true on the larger pp and

More information

The Deutsch-Jozsa Problem: De-quantization and entanglement

The Deutsch-Jozsa Problem: De-quantization and entanglement The Deutsch-Jozsa Problem: De-quantization and entanglement Alastair A. Abbott Department o Computer Science University o Auckland, New Zealand May 31, 009 Abstract The Deustch-Jozsa problem is one o the

More information

Proof nets for additive linear logic with units

Proof nets for additive linear logic with units Proo nets or additive linear loic with units Willem Heijltjes LFCS, School o Inormatics, University o Edinburh bstract dditive linear loic, the rament o linear loic concernin linear implication between

More information

Categories and Quantum Informatics

Categories and Quantum Informatics Categories and Quantum Informatics Week 6: Frobenius structures Chris Heunen 1 / 41 Overview Frobenius structure: interacting co/monoid, self-duality Normal forms: coherence theorem Frobenius law: coherence

More information

Review of Prerequisite Skills for Unit # 2 (Derivatives) U2L2: Sec.2.1 The Derivative Function

Review of Prerequisite Skills for Unit # 2 (Derivatives) U2L2: Sec.2.1 The Derivative Function UL1: Review o Prerequisite Skills or Unit # (Derivatives) Working with the properties o exponents Simpliying radical expressions Finding the slopes o parallel and perpendicular lines Simpliying rational

More information

GENERALIZED ABSTRACT NONSENSE: CATEGORY THEORY AND ADJUNCTIONS

GENERALIZED ABSTRACT NONSENSE: CATEGORY THEORY AND ADJUNCTIONS GENERALIZED ABSTRACT NONSENSE: CATEGORY THEORY AND ADJUNCTIONS CHRIS HENDERSON Abstract. This paper will move through the basics o category theory, eventually deining natural transormations and adjunctions

More information

PHY 133 Lab 1 - The Pendulum

PHY 133 Lab 1 - The Pendulum 3/20/2017 PHY 133 Lab 1 The Pendulum [Stony Brook Physics Laboratory Manuals] Stony Brook Physics Laboratory Manuals PHY 133 Lab 1 - The Pendulum The purpose of this lab is to measure the period of a simple

More information

THE AXIOMS FOR TRIANGULATED CATEGORIES

THE AXIOMS FOR TRIANGULATED CATEGORIES THE AIOMS FOR TRIANGULATED CATEGORIES J. P. MA Contents 1. Trianulated cateories 1 2. Weak pusouts and weak pullbacks 4 3. How to prove Verdier s axiom 6 Reerences 9 Tis is an edited extract rom my paper

More information

Logic Design 2013/9/26. Introduction. Chapter 4: Optimized Implementation of Logic Functions. K-map

Logic Design 2013/9/26. Introduction. Chapter 4: Optimized Implementation of Logic Functions. K-map 2/9/26 Loic Desin Chapter 4: Optimized Implementation o Loic Functions Introduction The combinin property allows us to replace two minterms that dier in only one variable with a sinle product term that

More information

1991 Mathematics Subject Classification. 68N18, 03B70, 03G30.

1991 Mathematics Subject Classification. 68N18, 03B70, 03G30. Theoretical Inormatics and Applications Inormatique Théorique et Applications Will be set by the publisher TRACED PREMONOIDAL CATEGORIES Nick Benton 1 and Martin Hyland 2 Abstract. Motivated by some examples

More information

SOLUTIONS TO PRACTICE PROBLEMS FOR MIDTERM I

SOLUTIONS TO PRACTICE PROBLEMS FOR MIDTERM I University of California, Berkeley Physics 7A Sprin 009 (Yury Kolomensky) SOLUTIONS TO PRACTICE PROBLEMS FOR MIDTERM I Maximum score: 100 points 1. (15 points) Race Stratey Two swimmers need to et from

More information

Differentiation. The main problem of differential calculus deals with finding the slope of the tangent line at a point on a curve.

Differentiation. The main problem of differential calculus deals with finding the slope of the tangent line at a point on a curve. Dierentiation The main problem o dierential calculus deals with inding the slope o the tangent line at a point on a curve. deinition() : The slope o a curve at a point p is the slope, i it eists, o the

More information

Abstract structure of unitary oracles for quantum algorithms

Abstract structure of unitary oracles for quantum algorithms Abstract structure o unitary oracles or quantum algorithms William Zeng 1 Jamie Vicary 2 1 Department o Computer Science University o Oxord 2 Centre or Quantum Technologies, University o Singapore and

More information

Investigation of ternary systems

Investigation of ternary systems Investiation of ternary systems Introduction The three component or ternary systems raise not only interestin theoretical issues, but also have reat practical sinificance, such as metallury, plastic industry

More information

University of Cape Town

University of Cape Town The copyright o this thesis rests with the. No quotation rom it or inormation derived rom it is to be published without ull acknowledgement o the source. The thesis is to be used or private study or non-commercial

More information

REVIEW: Going from ONE to TWO Dimensions with Kinematics. Review of one dimension, constant acceleration kinematics. v x (t) = v x0 + a x t

REVIEW: Going from ONE to TWO Dimensions with Kinematics. Review of one dimension, constant acceleration kinematics. v x (t) = v x0 + a x t Lecture 5: Projectile motion, uniform circular motion 1 REVIEW: Goin from ONE to TWO Dimensions with Kinematics In Lecture 2, we studied the motion of a particle in just one dimension. The concepts of

More information

Math Review and Lessons in Calculus

Math Review and Lessons in Calculus Math Review and Lessons in Calculus Agenda Rules o Eponents Functions Inverses Limits Calculus Rules o Eponents 0 Zero Eponent Rule a * b ab Product Rule * 3 5 a / b a-b Quotient Rule 5 / 3 -a / a Negative

More information

DERIVED CATEGORIES AND THEIR APPLICATIONS

DERIVED CATEGORIES AND THEIR APPLICATIONS REVISTA DE LA UNIÓN MATEMÁTICA ARGENTINA Volumen 48, Número 3, 2007, Páinas 1 26 DERIVED CATEGORIES AND THEIR APPLICATIONS Abstract In this notes we start with the basic deinitions o derived cateories,

More information