Cloak and Dagger

Total Page:16

File Type:pdf, Size:1020Kb

Cloak and Dagger Cloak and dagger Chris Heunen 1 / 34 Algebra and coalgebra Increasing generality: I Vector space with bilinear (co)multiplication I (Co)monoid in monoidal category I (Co)monad: (co)monoid in functor category I (Co)algebras for a (co)monad Interaction between algebra and coalgebra? 2 / 34 I Purpose of cloak is to obscure presence or movement of dagger I Dagger, a concealable and silent weapon: dagger categories I Cloak, worn to hide identity: Frobenius law Cloak and dagger I Situation involving secrecy or mystery 3 / 34 I Dagger, a concealable and silent weapon: dagger categories I Cloak, worn to hide identity: Frobenius law Cloak and dagger I Situation involving secrecy or mystery I Purpose of cloak is to obscure presence or movement of dagger 3 / 34 Cloak and dagger I Situation involving secrecy or mystery I Purpose of cloak is to obscure presence or movement of dagger I Dagger, a concealable and silent weapon: dagger categories I Cloak, worn to hide identity: Frobenius law 3 / 34 Dagger 4 / 34 y Dagger: functor Cop ! C with Ay = A on objects, f yy = f on maps f f y A −! BB −! A Dagger category: category equipped with dagger y −1 I Invertible computing: groupoid, f = f y op I Possibilistic computing: sets and relations, R = R I Partial invertible computing: sets and partial injections y T I Probabilistic computing: doubly stochastic maps, f = f y T I Quantum computing: Hilbert spaces, f = f y y I Second order: dagger functors F (f) = F (f ) I Unitary representations:[G; Hilb]y Dagger Method to turn algebra into coalgebra: self-duality Cop ' C 5 / 34 y −1 I Invertible computing: groupoid, f = f y op I Possibilistic computing: sets and relations, R = R I Partial invertible computing: sets and partial injections y T I Probabilistic computing: doubly stochastic maps, f = f y T I Quantum computing: Hilbert spaces, f = f y y I Second order: dagger functors F (f) = F (f ) I Unitary representations:[G; Hilb]y Dagger Method to turn algebra into coalgebra: self-duality Cop ' C y Dagger: functor Cop ! C with Ay = A on objects, f yy = f on maps f f y A −! BB −! A Dagger category: category equipped with dagger 5 / 34 y op I Possibilistic computing: sets and relations, R = R I Partial invertible computing: sets and partial injections y T I Probabilistic computing: doubly stochastic maps, f = f y T I Quantum computing: Hilbert spaces, f = f y y I Second order: dagger functors F (f) = F (f ) I Unitary representations:[G; Hilb]y Dagger Method to turn algebra into coalgebra: self-duality Cop ' C y Dagger: functor Cop ! C with Ay = A on objects, f yy = f on maps f f y A −! BB −! A Dagger category: category equipped with dagger y −1 I Invertible computing: groupoid, f = f 5 / 34 I Partial invertible computing: sets and partial injections y T I Probabilistic computing: doubly stochastic maps, f = f y T I Quantum computing: Hilbert spaces, f = f y y I Second order: dagger functors F (f) = F (f ) I Unitary representations:[G; Hilb]y Dagger Method to turn algebra into coalgebra: self-duality Cop ' C y Dagger: functor Cop ! C with Ay = A on objects, f yy = f on maps f f y A −! BB −! A Dagger category: category equipped with dagger y −1 I Invertible computing: groupoid, f = f y op I Possibilistic computing: sets and relations, R = R 5 / 34 y T I Probabilistic computing: doubly stochastic maps, f = f y T I Quantum computing: Hilbert spaces, f = f y y I Second order: dagger functors F (f) = F (f ) I Unitary representations:[G; Hilb]y Dagger Method to turn algebra into coalgebra: self-duality Cop ' C y Dagger: functor Cop ! C with Ay = A on objects, f yy = f on maps f f y A −! BB −! A Dagger category: category equipped with dagger y −1 I Invertible computing: groupoid, f = f y op I Possibilistic computing: sets and relations, R = R I Partial invertible computing: sets and partial injections 5 / 34 y T I Quantum computing: Hilbert spaces, f = f y y I Second order: dagger functors F (f) = F (f ) I Unitary representations:[G; Hilb]y Dagger Method to turn algebra into coalgebra: self-duality Cop ' C y Dagger: functor Cop ! C with Ay = A on objects, f yy = f on maps f f y A −! BB −! A Dagger category: category equipped with dagger y −1 I Invertible computing: groupoid, f = f y op I Possibilistic computing: sets and relations, R = R I Partial invertible computing: sets and partial injections y T I Probabilistic computing: doubly stochastic maps, f = f 5 / 34 y y I Second order: dagger functors F (f) = F (f ) I Unitary representations:[G; Hilb]y Dagger Method to turn algebra into coalgebra: self-duality Cop ' C y Dagger: functor Cop ! C with Ay = A on objects, f yy = f on maps f f y A −! BB −! A Dagger category: category equipped with dagger y −1 I Invertible computing: groupoid, f = f y op I Possibilistic computing: sets and relations, R = R I Partial invertible computing: sets and partial injections y T I Probabilistic computing: doubly stochastic maps, f = f y T I Quantum computing: Hilbert spaces, f = f 5 / 34 I Unitary representations:[G; Hilb]y Dagger Method to turn algebra into coalgebra: self-duality Cop ' C y Dagger: functor Cop ! C with Ay = A on objects, f yy = f on maps f f y A −! BB −! A Dagger category: category equipped with dagger y −1 I Invertible computing: groupoid, f = f y op I Possibilistic computing: sets and relations, R = R I Partial invertible computing: sets and partial injections y T I Probabilistic computing: doubly stochastic maps, f = f y T I Quantum computing: Hilbert spaces, f = f y y I Second order: dagger functors F (f) = F (f ) 5 / 34 Dagger Method to turn algebra into coalgebra: self-duality Cop ' C y Dagger: functor Cop ! C with Ay = A on objects, f yy = f on maps f f y A −! BB −! A Dagger category: category equipped with dagger y −1 I Invertible computing: groupoid, f = f y op I Possibilistic computing: sets and relations, R = R I Partial invertible computing: sets and partial injections y T I Probabilistic computing: doubly stochastic maps, f = f y T I Quantum computing: Hilbert spaces, f = f y y I Second order: dagger functors F (f) = F (f ) I Unitary representations:[G; Hilb]y 5 / 34 y I Evil: demand equality A = A of objects I Dagger category theory different beast: isomorphism is not the correct notion of `sameness' \Homotopy type theory" Univalent foundations program, 2013 Never bring a knife to a gun fight I Terminology after (physics) notation (but beats identity-on-objects-involutive-contravariant-functor) 6 / 34 I Dagger category theory different beast: isomorphism is not the correct notion of `sameness' Never bring a knife to a gun fight I Terminology after (physics) notation (but beats identity-on-objects-involutive-contravariant-functor) y I Evil: demand equality A = A of objects \Homotopy type theory" Univalent foundations program, 2013 6 / 34 Never bring a knife to a gun fight I Terminology after (physics) notation (but beats identity-on-objects-involutive-contravariant-functor) y I Evil: demand equality A = A of objects I Dagger category theory different beast: isomorphism is not the correct notion of `sameness' \Homotopy type theory" Univalent foundations program, 2013 6 / 34 −1 y I dagger isomorphism (unitary): f = f y I dagger monic (isometry): f ◦ f = id I dagger equalizer / kernel / biproduct y y y −1 y I monoidal dagger category: (f ⊗ g) = f ⊗ g , α = α What about monoids?? Way of the dagger Motto: \everything in sight ought to cooperate with the dagger" 7 / 34 I dagger equalizer / kernel / biproduct y y y −1 y I monoidal dagger category: (f ⊗ g) = f ⊗ g , α = α What about monoids?? Way of the dagger Motto: \everything in sight ought to cooperate with the dagger" −1 y I dagger isomorphism (unitary): f = f y I dagger monic (isometry): f ◦ f = id 7 / 34 y y y −1 y I monoidal dagger category: (f ⊗ g) = f ⊗ g , α = α What about monoids?? Way of the dagger Motto: \everything in sight ought to cooperate with the dagger" −1 y I dagger isomorphism (unitary): f = f y I dagger monic (isometry): f ◦ f = id I dagger equalizer / kernel / biproduct 7 / 34 What about monoids?? Way of the dagger Motto: \everything in sight ought to cooperate with the dagger" −1 y I dagger isomorphism (unitary): f = f y I dagger monic (isometry): f ◦ f = id I dagger equalizer / kernel / biproduct y y y −1 y I monoidal dagger category: (f ⊗ g) = f ⊗ g , α = α 7 / 34 Way of the dagger Motto: \everything in sight ought to cooperate with the dagger" −1 y I dagger isomorphism (unitary): f = f y I dagger monic (isometry): f ◦ f = id I dagger equalizer / kernel / biproduct y y y −1 y I monoidal dagger category: (f ⊗ g) = f ⊗ g , α = α What about monoids?? 7 / 34 Cloaks are worn 8 / 34 I algebra A with finitely many minimal right ideals I algebra A with nondegenerate A ⊗ A ! k with [ab; c] = [a; bc] I algebra A with comultiplication δ : A ! A ⊗ A satisfying (id ⊗ µ) ◦ (δ ⊗ id) = (µ ⊗ id) ◦ (id ⊗ δ) I algebra A with equivalent left and right regular representations \Theorie der hyperkomplexen Gr¨oßen I" Sitzungsberichte der Preussischen Akademie der Wissenschaften 504{537, 1903 \On Frobeniusean algebras II" Annals of Mathematics 42(1):1{21, 1941 Frobenius algebra Many definitions over a field k: I algebra A with functional A ! k, kernel without left ideals 9 / 34 I algebra A with nondegenerate A ⊗ A ! k with [ab; c] = [a; bc] I algebra A with comultiplication δ : A ! A ⊗ A satisfying (id ⊗ µ) ◦ (δ ⊗ id) = (µ ⊗ id) ◦ (id ⊗ δ) I algebra A with equivalent left and right regular representations \Theorie der hyperkomplexen Gr¨oßen I" Sitzungsberichte der Preussischen Akademie der Wissenschaften 504{537, 1903 \On Frobeniusean algebras II" Annals of Mathematics
Recommended publications
  • Information Geometry and Frobenius Algebra
    Information geometry and Frobenius algebra Ruichao Jiang, Javad Tavakoli, Yiqiang Zhao Oct 2020 Abstract We show that a Frobenius sturcture is equivalent to a dually flat sturcture in information geometry. We define a multiplication structure on the tangent spaces of statistical manifolds, which we call the statisti- cal product. We also define a scalar quantity, which we call the Yukawa term. By showing two examples from statistical mechanics, first the clas- sical ideal gas, second the quantum bosonic ideal gas, we argue that the Yukawa term quantifies information generation, which resembles how mass is generated via the 3-points interaction of two fermions and a Higgs boson (Higgs mechanism). In the classical case, The Yukawa term is identically zero, whereas in the quantum case, the Yukawa term diverges as the fu- gacity goes to zero, which indicates the Bose-Einstein condensation. 1 Introduction Amari in his own monograph [1] writes that major journals rejected his idea of dual affine connections on the grounds of their nonexistence in the mainstream Riemannian geometry. Later on, this dualistic structure turned out to be useful in information science, e.g. EM algorithms. The aim of this paper is to show the Frobenius algebra structure in information geometry and thus give a physical meaning for the Amari-Chentsov tensor. In information geometry, instead of the usual Levi-Civita connection, a non- metrical connections and its dual ∗ are used. Associated with these two connections is a mysterious∇ tensor, called∇ the Amari-Chentsov tensor (AC ten- arXiv:2010.05110v1 [math.DG] 10 Oct 2020 sor) and a one-parameter family of flat connections, called the α-connections.
    [Show full text]
  • A Subtle Introduction to Category Theory
    A Subtle Introduction to Category Theory W. J. Zeng Department of Computer Science, Oxford University \Static concepts proved to be very effective intellectual tranquilizers." L. L. Whyte \Our study has revealed Mathematics as an array of forms, codify- ing ideas extracted from human activates and scientific problems and deployed in a network of formal rules, formal definitions, formal axiom systems, explicit theorems with their careful proof and the manifold in- terconnections of these forms...[This view] might be called formal func- tionalism." Saunders Mac Lane Let's dive right in then, shall we? What can we say about the array of forms MacLane speaks of? Claim (Tentative). Category theory is about the formal aspects of this array of forms. Commentary: It might be tempting to put the brakes on right away and first grab hold of what we mean by formal aspects. Instead, rather than trying to present \the formal" as the object of study and category theory as our instrument, we would nudge the reader to consider another perspective. Category theory itself defines formal aspects in much the same way that physics defines physical concepts or laws define legal (and correspondingly illegal) aspects: it embodies them. When we speak of what is formal/physical/legal we inescapably speak of category/physical/legal theory, and vice versa. Thus we pass to the somewhat grammatically awkward revision of our initial claim: Claim (Tentative). Category theory is the formal aspects of this array of forms. Commentary: Let's unpack this a little bit. While individual forms are themselves tautologically formal, arrays of forms and everything else networked in a system lose this tautological formality.
    [Show full text]
  • Frobenius Algebras and Planar Open String Topological Field Theories
    Frobenius algebras and planar open string topological field theories Aaron D. Lauda Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Cambridge CB3 0WB UK email: [email protected] October 29, 2018 Abstract Motivated by the Moore-Segal axioms for an open-closed topological field theory, we consider planar open string topological field theories. We rigorously define a category 2Thick whose objects and morphisms can be thought of as open strings and diffeomorphism classes of planar open string worldsheets. Just as the category of 2-dimensional cobordisms can be described as the free symmetric monoidal category on a commutative Frobenius algebra, 2Thick is shown to be the free monoidal category on a noncommutative Frobenius algebra, hence justifying this choice of data in the Moore-Segal axioms. Our formalism is inherently categorical allowing us to generalize this result. As a stepping stone towards topological mem- brane theory we define a 2-category of open strings, planar open string worldsheets, and isotopy classes of 3-dimensional membranes defined by diffeomorphisms of the open string worldsheets. This 2-category is shown to be the free (weak monoidal) 2-category on a ‘categorified Frobenius al- gebra’, meaning that categorified Frobenius algebras determine invariants of these 3-dimensional membranes. arXiv:math/0508349v1 [math.QA] 18 Aug 2005 1 Introduction It is well known that 2-dimensional topological quantum field theories are equiv- alent to commutative Frobenius algebras [1, 16, 29]. This simple algebraic characterization arises directly from the simplicity of 2Cob, the 2-dimensional cobordism category. In fact, 2Cob admits a completely algebraic description as the free symmetric monoidal category on a commutative Frobenius algebra.
    [Show full text]
  • The Morita Theory of Quantum Graph Isomorphisms
    Commun. Math. Phys. Communications in Digital Object Identifier (DOI) https://doi.org/10.1007/s00220-018-3225-6 Mathematical Physics The Morita Theory of Quantum Graph Isomorphisms Benjamin Musto, David Reutter, Dominic Verdon Department of Computer Science, University of Oxford, Oxford, UK. E-mail: [email protected]; [email protected]; [email protected] Received: 31 January 2018 / Accepted: 11 June 2018 © The Author(s) 2018 Abstract: We classify instances of quantum pseudo-telepathy in the graph isomorphism game, exploiting the recently discovered connection between quantum information and the theory of quantum automorphism groups. Specifically, we show that graphs quantum isomorphic to a given graph are in bijective correspondence with Morita equivalence classes of certain Frobenius algebras in the category of finite-dimensional representations of the quantum automorphism algebra of that graph. We show that such a Frobenius algebra may be constructed from a central type subgroup of the classical automorphism group, whose action on the graph has coisotropic vertex stabilisers. In particular, if the original graph has no quantum symmetries, quantum isomorphic graphs are classified by such subgroups. We show that all quantum isomorphic graph pairs corresponding to a well-known family of binary constraint systems arise from this group-theoretical construction. We use our classification to show that, of the small order vertex-transitive graphs with no quantum symmetry, none is quantum isomorphic to a non-isomorphic graph. We show that this is in fact asymptotically almost surely true of all graphs. Contents 1. Introduction ................................. 2. Background ................................. 2.1 String diagrams, Frobenius monoids and Gelfand duality ......
    [Show full text]
  • Categories of Quantum and Classical Channels (Extended Abstract)
    Categories of Quantum and Classical Channels (extended abstract) Bob Coecke∗ Chris Heunen† Aleks Kissinger∗ University of Oxford, Department of Computer Science fcoecke,heunen,[email protected] We introduce the CP*–construction on a dagger compact closed category as a generalisation of Selinger’s CPM–construction. While the latter takes a dagger compact closed category and forms its category of “abstract matrix algebras” and completely positive maps, the CP*–construction forms its category of “abstract C*-algebras” and completely positive maps. This analogy is justified by the case of finite-dimensional Hilbert spaces, where the CP*–construction yields the category of finite-dimensional C*-algebras and completely positive maps. The CP*–construction fully embeds Selinger’s CPM–construction in such a way that the objects in the image of the embedding can be thought of as “purely quantum” state spaces. It also embeds the category of classical stochastic maps, whose image consists of “purely classical” state spaces. By allowing classical and quantum data to coexist, this provides elegant abstract notions of preparation, measurement, and more general quantum channels. 1 Introduction One of the motivations driving categorical treatments of quantum mechanics is to place classical and quantum systems on an equal footing in a single category, so that one can study their interactions. The main idea of categorical quantum mechanics [1] is to fix a category (usually dagger compact) whose ob- jects are thought of as state spaces and whose morphisms are evolutions. There are two main variations. • “Dirac style”: Objects form pure state spaces, and isometric morphisms form pure state evolutions.
    [Show full text]
  • Compact Inverse Categories 11
    COMPACT INVERSE CATEGORIES ROBIN COCKETT AND CHRIS HEUNEN Abstract. The Ehresmann-Schein-Nambooripad theorem gives a structure theorem for inverse monoids: they are inductive groupoids. A particularly nice case due to Jarek is that commutative inverse monoids become semilattices of abelian groups. It has also been categorified by DeWolf-Pronk to a structure theorem for inverse categories as locally complete inductive groupoids. We show that in the case of compact inverse categories, this takes the particularly nice form of a semilattice of compact groupoids. Moreover, one-object com- pact inverse categories are exactly commutative inverse monoids. Compact groupoids, in turn, are determined in particularly simple terms of 3-cocycles by Baez-Lauda. 1. Introduction Inverse monoids model partial symmetry [24], and arise naturally in many com- binatorial constructions [8]. The easiest example of an inverse monoid is perhaps a group. There is a structure theorem for inverse monoids, due to Ehresmann-Schein- Nambooripad [9, 10, 27, 26], that exhibits them as inductive groupoids. The latter are groupoids internal to the category of partially ordered sets with certain ex- tra requirements. By a result of Jarek [19], the inductive groupoids corresponding to commutative inverse monoids can equivalently be described as semilattices of abelian groups. A natural typed version of an inverse monoid is an inverse category [22, 6]. This notion can for example model partial reversible functional programs [12]. The eas- iest example of an inverse category is perhaps a groupoid. DeWolf-Pronk have generalised the ESN theorem to inverse categories, exhibiting them as locally com- plete inductive groupoids. This paper investigates `the commutative case', thus fitting in the bottom right cell of Figure 1.
    [Show full text]
  • Arxiv:Math/9805094V2
    FROBENIUS MANIFOLD STRUCTURE ON DOLBEAULT COHOMOLOGY AND MIRROR SYMMETRY HUAI-DONG CAO & JIAN ZHOU Abstract. We construct a differential Gerstenhaber-Batalin-Vilkovisky alge- bra from Dolbeault complex of any closed K¨ahler manifold, and a Frobenius manifold structure on Dolbeault cohomology. String theory leads to the mysterious Mirror Conjecture, see Yau [29] for the history. One of the mathematical predictions made by physicists based on this con- jecture is the formula due to Candelas-de la Ossa-Green-Parkes [4] on the number of rational curves of any degree on a quintic in CP4. Recently, it has been proved by Lian-Liu-Yau [15]. The theory of quantum cohomology, also suggested by physicists, has lead to a better mathematical formulation of the Mirror Conjecture. As explained in Witten [28], there are two topological conformal field theories on a Calabi-Yau manifold X: A theory is independent of the complex structure of X, but depends on the K¨aher form on X, while B theory is independent of the K¨ahler form of X, but depends on the complex structure of X. Vafa [25] explained how two quantum cohomology rings and ′ arise from these theories, and the notion of mirror symmetry could be translatedR R into the equivalence of A theory on a Calabi-Yau manifold X with B theory on another Calabi-Yau manifold Xˆ, called the mirror of X, such that the quantum ring can be identified with ′. For a mathematicalR exposition in termsR of variation of Hodge structures, see e.g. Morrison [19] or Bertin-Peters [2]. There are two natural Frobenius algebras on any Calabi-Yau n-fold, A(X)= n Hk(X, Ωk), B(X)= n Hk(X, Ω−k), ⊕k=0 ⊕k=0 where Ω−k is the sheaf of holomorphic sections to ΛkTX.
    [Show full text]
  • Frobenius Algebras and Their Quivers
    Can. J. Math., Vol. XXX, No. 5, 1978, pp. 1029-1044 FROBENIUS ALGEBRAS AND THEIR QUIVERS EDWARD L. GREEN This paper studies the construction of Frobenius algebras. We begin with a description of when a graded ^-algebra has a Frobenius algebra as a homo- morphic image. We then turn to the question of actual constructions of Frobenius algebras. We give a, method for constructing Frobenius algebras as factor rings of special tensor algebras. Since the representation theory of special tensor algebras has been studied intensively ([6], see also [2; 3; 4]), our results permit the construction of Frobenius algebras which have representa­ tions with prescribed properties. Such constructions were successfully used in [9]. A special tensor algebra has an associated quiver (see § 3 and 4 for defini­ tions) which determines the tensor algebra. The basic result relating an associated quiver and the given tensor algebra is that the category of represen­ tations of the quiver is isomorphic to the category of modules over the tensor algebra [3; 4; 6]. One of the questions which is answered in this paper is: given a quiver J2, is there a Frobenius algebra T such that i2 is the quiver of T; that is, is there a special tensor algebra T = K + M + ®« M + . with associated quiver j2 such that there is a ring surjection \p : T —> T with ker \p Ç (®RM + ®%M + . .) and Y being a Frobenius algebra? This question was completely answered under the additional constraint that the radical of V cubed is zero [8, Theorem 2.1]. The study of radical cubed zero self-injective algebras has been used in classifying radical square zero Artin algebras of finite representation type [11].
    [Show full text]
  • Most Human Things Go in Pairs. Alcmaeon, ∼ 450 BC
    Most human things go in pairs. Alcmaeon, 450 BC ∼ true false good bad right left up down front back future past light dark hot cold matter antimatter boson fermion How can we formalize a general concept of duality? The Chinese tried yin-yang theory, which inspired Leibniz to develop binary notation, which in turn underlies digital computation! But what's the state of the art now? In category theory the fundamental duality is the act of reversing an arrow: • ! • • • We use this to model switching past and future, false and true, small and big... Every category has an opposite op, where the arrows are C C reversed. This is a symmetry of the category of categories: op : Cat Cat ! and indeed the only nontrivial one: Aut(Cat) = Z=2 In logic, the simplest duality is negation. It's order-reversing: if P implies Q then Q implies P : : and|ignoring intuitionism!|it's an involution: P = P :: Thus if is a category of propositions and proofs, we C expect a functor: : op : C ! C with a natural isomorphism: 2 = 1 : ∼ C This has two analogues in quantum theory. One shows up already in the category of finite-dimensional vector spaces, FinVect. Every vector space V has a dual V ∗. Taking the dual is contravariant: if f : V W then f : W V ! ∗ ∗ ! ∗ and|ignoring infinite-dimensional spaces!|it's an involution: V ∗∗ ∼= V This kind of duality is captured by the idea of a -autonomous ∗ category. Recall that a symmetric monoidal category is roughly a category with a unit object I and a tensor product C 2 C : ⊗ C × C ! C that is unital, associative and commutative up to coherent natural isomorphisms.
    [Show full text]
  • On the Frobenius Manifold
    Frobenius manifolds and Frobenius algebra-valued integrable systems Dafeng Zuo (USTC) Russian-Chinese Conference on Integrable Systems and Geometry 19{25 August 2018 The Euler International Mathematical Institute 1 Outline: Part A. Motivations Part B. Some Known Facts about FM Part C. The Frobenius algebra-valued KP hierarchy Part D. Frobenius manifolds and Frobenius algebra-valued In- tegrable systems 2 Part A. Motivations 3 KdV equation : 4ut − 12uux − uxxx = 0 3 2 2 Lax pair: Lt = [L+;L];L = @ + 2 u tau function: u = (log τ)xx Bihamiltonian structure(BH): ({·; ·}2 =) Virasoro algebra) n o n o ( ) R R 3 f;~ ~g = 2 δf @ δg dx; f;~ ~g = −1 δf @ + 2u @ + 2 @ u δg dx: 1 δu @x δu 2 2 δu @x3 @x @x δu Dispersionless =) Hydrodynamics-type BH =) Frobenius manifold ······ 4 Natural generalization Lax pair/tau function/BH: KdV =) GDn / DS =) KP (other types) (N) {·; ·}2: Virasoro =) Wn algbra =) W1 algebra Lax pair/tau function/BH: dKdV =) dGDn =) dKP (N) {·; ·}2: Witt algebra =) wn algbra =) w1 algebra FM: A1 =) An−1 =) Infinite-dimensional analogue (?) 5 Other generalizations: the coupled KdV 4vt − 12vvx − vxxx = 0; 4wt − 12(vw)x − wxxx = 0: τ1 tau function: v = (log τ0)xx; w = ( )xx: τ0 R. Hirota, X.B.Hu and X.Y.Tang, J.Math.Anal.Appl.288(2003)326 BH: A.P.Fordy, A.G.Reyman and M.A.Semenov-Tian-Shansky,Classical r-matrices and compatible Poisson brackets for coupled KdV systems, Lett. Math. Phys. 17 (1989) 25{29. W.X.Ma and B.Fuchssteiner, The bihamiltonian structure of the perturbation equations of KdV Hierarchy.
    [Show full text]
  • The Way of the Dagger
    The Way of the Dagger Martti Karvonen I V N E R U S E I T H Y T O H F G E R D I N B U Doctor of Philosophy Laboratory for Foundations of Computer Science School of Informatics University of Edinburgh 2018 (Graduation date: July 2019) Abstract A dagger category is a category equipped with a functorial way of reversing morph- isms, i.e. a contravariant involutive identity-on-objects endofunctor. Dagger categor- ies with additional structure have been studied under different names in categorical quantum mechanics, algebraic field theory and homological algebra, amongst others. In this thesis we study the dagger in its own right and show how basic category theory adapts to dagger categories. We develop a notion of a dagger limit that we show is suitable in the following ways: it subsumes special cases known from the literature; dagger limits are unique up to unitary isomorphism; a wide class of dagger limits can be built from a small selection of them; dagger limits of a fixed shape can be phrased as dagger adjoints to a diagonal functor; dagger limits can be built from ordinary limits in the presence of polar decomposition; dagger limits commute with dagger colimits in many cases. Using cofree dagger categories, the theory of dagger limits can be leveraged to provide an enrichment-free understanding of limit-colimit coincidences in ordinary category theory. We formalize the concept of an ambilimit, and show that it captures known cases. As a special case, we show how to define biproducts up to isomorphism in an arbitrary category without assuming any enrichment.
    [Show full text]
  • Categories of Relations As Models of Quantum Theory
    Categories of relations as models of quantum theory Chris Heunen∗ and Sean Tull† fheunen,[email protected] University of Oxford, Department of Computer Science Categories of relations over a regular category form a family of models of quantum theory. Using regular logic, many properties of relations over sets lift to these models, including the correspon- dence between Frobenius structures and internal groupoids. Over compact Hausdorff spaces, this lifting gives continuous symmetric encryption. Over a regular Mal’cev category, this correspondence gives a characterization of categories of completely positive maps, enabling the formulation of quan- tum features. These models are closer to Hilbert spaces than relations over sets in several respects: Heisenberg uncertainty, impossibility of broadcasting, and behavedness of rank one morphisms. 1 Introduction Many features of quantum theory can be abstracted to arbitrary compact dagger categories [1]. Thus we can compare models of quantum theory in a unified setting, and look for features that distinguish the category FHilb of finite-dimensional Hilbert spaces that forms the traditional model. The category Rel of sets and relations is an alternative model. It exhibits many features considered typical of quantum theory [2], but also refutes presumed correspondences between them [15, 21]. However, apart from Rel and its subcategory corresponding to Spekkens’ toy model [14], few alternative models have been studied in detail. We consider a new family of models by generalizing to categories Rel(C) of relations over an arbi- trary regular category C, including any algebraic category like that of groups, any abelian category like that of vector spaces, and any topos like that of sets.
    [Show full text]