An inner automorphism is only an inner automorphism, but an inner endomorphism can be something strange

The inner automorphisms of a group G can be characterized within the category of groups without reference to group elements: they are precisely those automorphisms of G that can be extended, in a functorial manner, to all groups H given with homomorphisms G --> H. Unlike the group of inner automorphisms of G itself, the group of such extended systems of automorphisms is always isomorphic to G. A similar characterization holds for inner automorphisms of an associative algebra R over a field K; here the group of functorial systems of automorphisms is isomorphic to the group of units of R modulo units of K. If one substitutes "endomorphism" for "automorphism" in these considerations, then in the group case, the only additional example is the trivial endomorphism; but in the K-algebra case, a construction unfamiliar to ring theorists, but known to functional analysts, also arises. Systems of endomorphisms with the same functoriality property are examined in some other categories; other uses of the phrase "inner endomorphism" in the literature, some overlapping the one introduced here, are noted; the concept of an inner {\em derivation} of an associative or Lie algebra is looked at from the same point of view, and the dual concept of a "co-inner" endomorphism is briefly examined. Several questions are posed.Comment: 20 pages. To appear, Publicacions Mathem\`{a}tiques. The 1-1-ness result in the appendix has been greatly strengthened, an "Overview" has been added at the beginning, and numerous small rewordings have been made throughou

An Algebraic Characterisation of Concurrent Composition

We give an algebraic characterization of a form of synchronized parallel composition allowing for true concurrency, using ideas based on Peter Landin's "Program-Machine Symmetric Automata Theory".Comment: This is an old technical report from 1981. I submitted it to a special issue of HOSC in honour of Peter Landin, as explained in the Prelude, added in 2008. However, at an advanced stage, the handling editor became unresponsive, and the paper was never published. I am making it available via the arXiv for the same reasons given in the Prelud

Universal Constructions for (Co)Relations: categories, monoidal categories, and props

Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic interpretation for diagrams is given in terms of relations or corelations (generalised equivalence relations) of some kind. In this paper we show how semantic categories of both relations and corelations can be characterised as colimits of simpler categories. This modular perspective is important as it simplifies the task of giving a complete axiomatisation for semantic equivalence of string diagrams. Moreover, our general result unifies various theorems that are independently found in literature and are relevant for program semantics, quantum computation and control theory.Comment: 22 pages + 3 page appendix, extended version of arXiv:1703.0824

Extensions of C*-dynamical systems to systems with complete transfer operators

Starting from an arbitrary endomorphism $\alpha$ of a unital C*-algebra $A$ we construct a bigger C*-algebra $B$ and extend $\alpha$ onto $B$ in such a way that the extended endomorphism $\alpha$ has a unital kernel and a hereditary range, i.e. there exists a unique non-degenerate transfer operator for $(B,\alpha)$, called the complete transfer operator. The pair $(B,\alpha)$ is universal with respect to a suitable notion of a covariant representation and depends on a choice of an ideal in $A$. The construction enables a natural definition of the crossed product for arbitrary $\alpha$.Comment: Compressed and submitted version, 9 page

The Last Scientific Revolution

Critically growing problems of fundamental science organisation and content are analysed with examples from physics and emerging interdisciplinary fields. Their origin is specified and new science structure (organisation and content) is proposed as a unified solution

Automated Synthesis of Dynamically Corrected Quantum Gates

We address the problem of constructing dynamically corrected gates for non-Markovian open quantum systems in settings where limitations on the available control inputs and/or the presence of control noise make existing analytical approaches unfeasible. By focusing on the important case of singlet-triplet electron spin qubits, we show how ideas from optimal control theory may be used to automate the synthesis of dynamically corrected gates that simultaneously minimize the system's sensitivity against both decoherence and control errors. Explicit sequences for effecting robust single-qubit rotations subject to realistic timing and pulse-shaping constraints are provided, which can deliver substantially improved gate fidelity for state-of-the-art experimental capabilities.Comment: 5 pages; further restructure and expansio

Regulators of canonical extensions are torsion: the smooth divisor case

In this paper, we prove a generalization of Reznikov's theorem which says that the Chern-Simons classes and in particular the Deligne Chern classes (in degrees $>1$) are torsion, of a flat bundle on a smooth complex projective variety. We consider the case of a smooth quasi--projective variety with an irreducible smooth divisor at infinity. We define the Chern-Simons classes of Deligne's canonical extension of a flat vector bundle with unipotent monodromy at infinity, which lift the Deligne Chern classes and prove that these classes are torsion