Structural Co~Pleteness in Algebra and Logic

Total Page:16

File Type:pdf, Size:1020Kb

Structural Co~Pleteness in Algebra and Logic COLLOQUIA MATHEMATICA SOCIETATIS JANOS BOLYAI 54, ALGEBRAIC LOGIC, BUDAPEST (HUNGARY), 1988 Structural Co~pleteness in Algebra and Logic CLIFFORD BERGMAN A number of authors, particularly those studying "intermediate" intu­ it\onistjc logic, have asked whether a given logic is structurally complete. See [14] and [12] for example. Roughly speaking, a logic is structurally com­ plete if every proper extension must contain new logical axioms (as opposed to nothing but new rules of inference). In particular, structural complete­ ness can be seen as a kind of maximality condition on a logic. Using techniques of algebraic logic, it is possible to study many log­ ics by finding an appropriate class of algebras in which various (algebraic) properties reflect the logical ones of interest. The property corresponding to structural completeness turns out to be quite interesting algebraically, and can be studied independently of any connections to logic. This has been done in a number of papers such as [7], [2] and [9]. In this paper we will briefly consider the notion of structural complete­ ness in its original logical context. We then go on to define and study the algebraic analog, as well as a hereditary version, called deductiveness. Unlike the situation in universal algebra, there is not yet any general agreement in algebraic logic on the definition of basic concepts (such as a logic!) or even on the motivating examples. Since our intent in section 1 is ' primarily motivational, we do not feel it is necessary to completely specify what we mean by a "logic". Instead we give what we hope is a minimal set of conditions that will hold in any reasonable definition of the term. For a rigorous treatment of the subject, the reader can consult [1], [3], or [5]. Research partially supported by National Science Foundation grant DMS-8701643 60 CLIFFORD BERGMAN The drawback of this approach is that we will not be able to establish any real connection between the definitions in .section 1 and the theorems ,, in section 2. We leave that to others with more expertise in the field. 1. The Logical Version Structural completeness arises naturally when considering the "deduc­ tive power" of a logic. Informally, one can think of a logic £, over a set Fm (the set of formulas), as being composed of a set !1 of logical axioms, and a set R of rules of inference. For any set r of formulas, the consequences of r are those formulas derivable from r together with all instances of formulas from !1 by means of the rules in R. In particular, a tautology is a formula derivable directly from !1 via R. We can write ,C = (!1, R) to denote the logic determined by those axioms and rules of inference, and r 1--c<p to indicate that <pis a consequence of r in £. For our purposes, it suffices to focus on the consequence operator Cc of ,C, defined by In fact, we identify a logic with its consequence operator, so that two logics ,C and £' are considered equal if Cc = CC'. The only assumptions we make of Cc is that it be an algebraic closure operator on the set Fm. That is, for all r,~ <;;Fm (cl) r <;;G(r) (c2) G(G(r)) <;;G(r) (c3) r <;;~ =* c(r) <;;c(~) (c4) G(r) <;;LJ { G(ro) : ro is a finite subset of r}. For the remainder .of this section, one can take (cl)-( c4) as the definition of a logic.1 However, the naive conception of a logic as a pair (!1,R) provides a more intuitive basis for the notions we will discuss. 1 Most modern conceptions of a logic diverge from this definition. For example, [3] requires that every set C .c(r) be closed under substitution. One can easily check that our results remain true under that particular assumption. On the other hand, in [1], condition (c4) defines the special case of compact logics. It is not clear that Proposition 1.2 holds in the failure of (c4). STRUCTURAL COMPLETENESS IN ALGEBRA AND LOGIC 61 We write £, < £', (and say that £,' is an extension of C) if £,' is a stronger logic in the sense that we can "derive more things". Furthermore, write £, =o £,' if £, and £,' have the same tautologies. In terms of the ,, consequence operator: ' c,:::;C' = (\7T <;;;Fm) Cc (r) <;;;Cc, (r) C =o C' = Cc (0) = Cc, (0). Definition 1. 1. A logic £, is structurally complete if for every logic £,', C < C' =* C.,to C'. In other words, £, is structurally complete if it is not possible to extend £, without creating new tautologies. Do structurally complete logics generally exist? The answer is 'yes' as long as we assume that (cl)-(c4) constitutes a definition of a consequence operator. Proposition 1.2. Every logic C, has a unique, structurally complete ex­ tension C', such that C, =o C'. Proof. Let x = {GM:£,:::; M & C, =o M }. x can be thought of as a subset of the monoid of self-maps of Sb(Fm) (the power set) under the operation of function-composition. Let x be the submonoid generated by x, Define a new operator D by D(r) = u{ G(r): CE x} for r <;;;Fm. We claim that DE x. The axioms(cl)-(c4) are all easily verified, with the exception of (c2). For this, we make the following two observations. First, every member ofx satisfies axiom (c4). Second, the family { G(r): CE x} is upper-directed by set-theoretic union. Now, if 'Y E D(D(r)), then for some C E x, 'Y E G(D(r)). Therefore, (by the first observation), there is ·1~" a finite subset A <;;;D(r) such that 'Y E C(A), and by upper-directedness, there is C' E x su_ch that A <;;;C'(r). Hence, 'Y E C(C'(r)) <;;;D(r), proving ( c2). Let £,' be the logic with consequence operator D. (In terms of logical axioms and rules of inference, those of £,' are obtained by taking the union 62 CLIFFORD BERGMAN over all of the logics referenced in x.) Then we clearly have £ :S £' =o .C, so that. D E x. To see that .C' is structurally complete, let £' :S M. 1° If £' =o M, then CM E x, from which it follows that M :S £'. The uniqueness is similar. I From the proposition, one sees that the structurally complete logics are precisely the, maximal members of the =a-equivalence classes. It is in this sense that structural completeness is a maximality condition. We now introduce the hereditary version of the same concept. Definition 1.3. A logic £ is deductive if every (not necessarily proper) extension of £ is structurally complete. Proposition 1.4. Let £ be a logic. The following are equivalent. (1) £ is deductive; (2) For each M c".£, and r <;;Fm, CM (r) = Cc (r u A), where A=CM(0) Proof. (1) * (2): First note that A<;; Cc (A) <;;CM (A)= A. Now define a consequence operator D by D(r) = Cc (AU r). That D satisfies (cl)-(c4) is straightforward. For any set r, (*) D(r) = Cc (Au r) <;;CM (Au r) <;; CM (Au CM (r)) = CM (CM (r)) = CM (r). In other words, if £' denotes the logic with consequence operator D, then £ :S £' :S M. Also, by taking r = 0 in (*), A = D(0) <;; CM (0) = A. Therefore,£' =o M. Now by the deductiveness of£, D = CM. (2) * (1): To show £ is deductive, let £ :S M :S N and assume M =o N. We must show M = N. Since M =o N, A= CM (0) = CN (0). Therefore CN (r) = C;:.(r U A)= CM (F), as desired. I According to the above proposition, dedcutiveness can be interpreted in the following way: Every new rule of inference can be replaced by a set of logical axioms. For if £ = (!1, R) is a deductive logic, and r is a new rule, let M = (!1,RU {r} ). The logic £' constructed in the proposition, is (!1U A, R), and th~ proof of 1.4 demonstrates that£'= M (more precisely, they have the same consequence operator). One of the goals of algebraic logic is to establish a correspondence be­ tween individual logics and classes of algebras. In the best of all possible STRUCTURAL COMPLETENESS IN ALGEBRA AND LOGIC 63 worlds, each logic£ would correspond to a quasivariety, £,Q, Under this correspondence £ :::;M {cc=} £q =2Mq ( t) £ =o M {cc=} V(£Q) = V(Mq). In other words, logical axioms correspond to identities ( on the associated algebra~) and rules of inference to quasi-identities. It is on this intuitive idea that the definitions of section 2 are based. Whether or not the relationships in ( t) are realized is a subject of debate in Algebraic Logic. In any case, the algebraic notions turn out to be quite interesting in their own right. Because it is not particularly natural from an algebraic standpoint, it is unlikely that the concept of a structurally ,: complete variety would ever have been considered if not for this intuitive I correspondence between algebras and logics. ' 2. The Algebraic Version By applying the idealized translation ( t) of section 1 to the notions of structural completeness and deductiveness, we produce corresponding notions for classes of algebraic structures (Definition 2.1, below). In order to proceed, we briefly review the relevant notions from universal algebra. A class ICof algebras is a quasivariety if it is defined by a set of quasi-identities, i.e. universal· sentences of the form 1 rn (f\o-i(x) cs Ti(x)) -->. µ(x) cs v(x) i=O in which n and tare natural numbers, and each <Ti, Ti,µ, v is a term in the variables x = xo,x1, ..
Recommended publications
  • Algebras in Which Every Subalgebra Is Noetherian
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 142, Number 9, September 2014, Pages 2983–2990 S 0002-9939(2014)12052-1 Article electronically published on May 21, 2014 ALGEBRAS IN WHICH EVERY SUBALGEBRA IS NOETHERIAN D. ROGALSKI, S. J. SIERRA, AND J. T. STAFFORD (Communicated by Birge Huisgen-Zimmermann) Abstract. We show that the twisted homogeneous coordinate rings of elliptic curves by infinite order automorphisms have the curious property that every subalgebra is both finitely generated and noetherian. As a consequence, we show that a localisation of a generic Skylanin algebra has the same property. 1. Introduction Throughout this paper k will denote an algebraically closed field and all algebras will be k-algebras. It is not hard to show that if C is a commutative k-algebra with the property that every subalgebra is finitely generated (or noetherian), then C must be of Krull dimension at most one. (See Section 3 for one possible proof.) The aim of this paper is to show that this property holds more generally in the noncommutative universe. Before stating the result we need some notation. Let X be a projective variety ∗ with invertible sheaf M and automorphism σ and write Mn = M⊗σ (M) ···⊗ n−1 ∗ (σ ) (M). Then the twisted homogeneous coordinate ring of X with respect to k M 0 M this data is the -algebra B = B(X, ,σ)= n≥0 H (X, n), under a natu- ral multiplication. This algebra is fundamental to the theory of noncommutative algebraic geometry; see for example [ATV1, St, SV]. In particular, if S is the 3- dimensional Sklyanin algebra, as defined for example in [SV, Example 8.3], then B(E,L,σ)=S/gS for a central element g ∈ S and some invertible sheaf L over an elliptic curve E.WenotethatS is a graded ring that can be regarded as the “co- P2 P2 ordinate ring of a noncommutative ” or as the “coordinate ring of nc”.
    [Show full text]
  • Lie Group Homomorphism Φ: → Corresponds to a Linear Map Φ: →
    More on Lie algebras Wednesday, February 14, 2018 8:27 AM Simple Lie algebra: dim 2 and the only ideals are 0 and itself. Have classification by Dynkin diagram. For instance, , is simple: take the basis 01 00 10 , , . 00 10 01 , 2,, 2,, . Suppose is in the ideal. , 2. , , 2. If 0, then X is in the ideal. Then ,,, 2imply that H and Y are also in the ideal which has to be 2, . The case 0: do the same argument for , , , then the ideal is 2, unless 0. The case 0: , 2,, 2implies the ideal is 2, unless 0. The ideal is {0} if 0. Commutator ideal: , Span,: , ∈. An ideal is in particular a Lie subalgebra. Keep on taking commutator ideals, get , , ⊂, … called derived series. Solvable: 0 for some j. If is simple, for all j. Levi decomposition: any Lie algebra is the semi‐direct product of a solvable ideal and a semisimple subalgebra. Similar concept: , , , , …, ⊂. Sequence of ideals called lower central series. Nilpotent: 0 for some j. ⊂ . Hence nilpotent implies solvable. For instance, the Lie algebra of nilpotent upper triangular matrices is nilpotent and hence solvable. Can take the basis ,, . Then ,,, 0if and , if . is spanned by , for and hence 0. The Lie algebra of upper triangular matrices is solvable but not nilpotent. Can take the basis ,,,, ,,…,,. Similar as above and ,,,0. . So 0. But for all 1. Recall that any Lie group homomorphism Φ: → corresponds to a linear map ϕ: → . In the proof that a continuous homomorphism is smooth. Lie group Page 1 Since Φ ΦΦΦ , ∘ Ad AdΦ ∘.
    [Show full text]
  • Gauging the Octonion Algebra
    UM-P-92/60_» Gauging the octonion algebra A.K. Waldron and G.C. Joshi Research Centre for High Energy Physics, University of Melbourne, Parkville, Victoria 8052, Australia By considering representation theory for non-associative algebras we construct the fundamental and adjoint representations of the octonion algebra. We then show how these representations by associative matrices allow a consistent octonionic gauge theory to be realized. We find that non-associativity implies the existence of new terms in the transformation laws of fields and the kinetic term of an octonionic Lagrangian. PACS numbers: 11.30.Ly, 12.10.Dm, 12.40.-y. Typeset Using REVTEX 1 L INTRODUCTION The aim of this work is to genuinely gauge the octonion algebra as opposed to relating properties of this algebra back to the well known theory of Lie Groups and fibre bundles. Typically most attempts to utilise the octonion symmetry in physics have revolved around considerations of the automorphism group G2 of the octonions and Jordan matrix representations of the octonions [1]. Our approach is more simple since we provide a spinorial approach to the octonion symmetry. Previous to this work there were already several indications that this should be possible. To begin with the statement of the gauge principle itself uno theory shall depend on the labelling of the internal symmetry space coordinates" seems to be independent of the exact nature of the gauge algebra and so should apply equally to non-associative algebras. The octonion algebra is an alternative algebra (the associator {x-1,y,i} = 0 always) X -1 so that the transformation law for a gauge field TM —• T^, = UY^U~ — ^(c^C/)(/ is well defined for octonionic transformations U.
    [Show full text]
  • Notes on Mathematical Logic David W. Kueker
    Notes on Mathematical Logic David W. Kueker University of Maryland, College Park E-mail address: [email protected] URL: http://www-users.math.umd.edu/~dwk/ Contents Chapter 0. Introduction: What Is Logic? 1 Part 1. Elementary Logic 5 Chapter 1. Sentential Logic 7 0. Introduction 7 1. Sentences of Sentential Logic 8 2. Truth Assignments 11 3. Logical Consequence 13 4. Compactness 17 5. Formal Deductions 19 6. Exercises 20 20 Chapter 2. First-Order Logic 23 0. Introduction 23 1. Formulas of First Order Logic 24 2. Structures for First Order Logic 28 3. Logical Consequence and Validity 33 4. Formal Deductions 37 5. Theories and Their Models 42 6. Exercises 46 46 Chapter 3. The Completeness Theorem 49 0. Introduction 49 1. Henkin Sets and Their Models 49 2. Constructing Henkin Sets 52 3. Consequences of the Completeness Theorem 54 4. Completeness Categoricity, Quantifier Elimination 57 5. Exercises 58 58 Part 2. Model Theory 59 Chapter 4. Some Methods in Model Theory 61 0. Introduction 61 1. Realizing and Omitting Types 61 2. Elementary Extensions and Chains 66 3. The Back-and-Forth Method 69 i ii CONTENTS 4. Exercises 71 71 Chapter 5. Countable Models of Complete Theories 73 0. Introduction 73 1. Prime Models 73 2. Universal and Saturated Models 75 3. Theories with Just Finitely Many Countable Models 77 4. Exercises 79 79 Chapter 6. Further Topics in Model Theory 81 0. Introduction 81 1. Interpolation and Definability 81 2. Saturated Models 84 3. Skolem Functions and Indescernables 87 4. Some Applications 91 5.
    [Show full text]
  • Borel Subgroups and Flag Manifolds
    Topics in Representation Theory: Borel Subgroups and Flag Manifolds 1 Borel and parabolic subalgebras We have seen that to pick a single irreducible out of the space of sections Γ(Lλ) we need to somehow impose the condition that elements of negative root spaces, acting from the right, give zero. To get a geometric interpretation of what this condition means, we need to invoke complex geometry. To even define the negative root space, we need to begin by complexifying the Lie algebra X gC = tC ⊕ gα α∈R and then making a choice of positive roots R+ ⊂ R X gC = tC ⊕ (gα + g−α) α∈R+ Note that the complexified tangent space to G/T at the identity coset is X TeT (G/T ) ⊗ C = gα α∈R and a choice of positive roots gives a choice of complex structure on TeT (G/T ), with the holomorphic, anti-holomorphic decomposition X X TeT (G/T ) ⊗ C = TeT (G/T ) ⊕ TeT (G/T ) = gα ⊕ g−α α∈R+ α∈R+ While g/t is not a Lie algebra, + X − X n = gα, and n = g−α α∈R+ α∈R+ are each Lie algebras, subalgebras of gC since [n+, n+] ⊂ n+ (and similarly for n−). This follows from [gα, gβ] ⊂ gα+β The Lie algebras n+ and n− are nilpotent Lie algebras, meaning 1 Definition 1 (Nilpotent Lie Algebra). A Lie algebra g is called nilpotent if, for some finite integer k, elements of g constructed by taking k commutators are zero. In other words [g, [g, [g, [g, ··· ]]]] = 0 where one is taking k commutators.
    [Show full text]
  • Topoi for a Super-Noetherian Subalgebra Equipped with a Riemannian Number
    Topoi for a Super-Noetherian Subalgebra Equipped with a Riemannian Number M. Lafourcade, Q. Germain and H. D´escartes Abstract Let λ be a Gaussian, integrable, canonically Hadamard modulus. Re- cent developments in dynamics [32] have raised the question of whether V 2 i. We show that jm^j ∼ P. Now in this setting, the ability to char- acterize categories is essential. It is not yet known whether ξ 6= −∞, although [4, 4, 10] does address the issue of minimality. 1 Introduction In [33], the authors address the separability of Weierstrass, stochastically anti- hyperbolic graphs under the additional assumption that every subset is measur- able. Is it possible to compute Clifford sets? The work in [36] did not consider the meromorphic case. This could shed important light on a conjecture of Sylvester. Is it possible to characterize stable subgroups? It is well known that z ≥ !(f). In [32], the authors address the admissibility of sets under the additional assumption that every Fourier, contra-Gauss, contra-stable set is smoothly Lobachevsky and simply Bernoulli. This could shed important light on a con- jecture of Clairaut. The work in [29] did not consider the null case. The ground- breaking work of D. Anderson on regular homomorphisms was a major advance. 1 It is well known that 0p ∼ 1 . Recently, there has been much interest in the description of ultra-discretely tangential equations. It would be interesting to apply the techniques of [32] to prime vector spaces. In [23], the main result was the extension of unique monoids. In [27], the authors address the admissibility of intrinsic matrices under the additional assumption that there exists an orthogonal, stochastically pseudo- minimal and simply super-separable super-Artinian, almost everywhere intrin- sic, conditionally semi-onto random variable.
    [Show full text]
  • Chapter 5 Subalgebras and Unions
    CHAPTER 5 SUBALGEBRAS AND UNIONS §a Weak and relative subalgebras The subalgebra concept has two very natural weakenings. The first of these concerns the algebraic structure that is inherited by arbitrary subsets of the universe of an algebra, as opposed to subuniverses; one of the more compel- ling ways in which partial algebras arise in the study of total algebras. The second corresponds with the algebraic structure necessary for a mapping from another algebra to be a homomorphism. a1 Definition. Let A = 〈A, I〉 and B = 〈B, J〉 be algebras such that A ⊆ B. (a) A is a relative subalgebra of B, notation A ⊆ B, and B a outer extension of A, if Dom(I) = Dom(J), and for every symbol S ∈ Dom(J), I(S) = J(S)A. (b) A is a weak subalgebra of B, notation A ⊆w B, if Dom(I) = Dom(J), and for every symbol S ∈ Dom(I), I(S) ⊆ J(S). Observe that any subset A of the universe of an algebra B determines a unique relative subalgebra of B that has A for universe. We denote it by AB. On the other hand, there may be many weak subalgebras of B that have A for a universe. In particular, there may be many weak subalgebras of B that have B for a universe; we shall call them weakenings of B. If A is a weakening of B, then B is an inner extension of A. If B is a total algebra, and A is dense in B, we say that B is a completion of AB.
    [Show full text]
  • The Space of Measurement Outcomes As a Spectrum for Non-Commutative Algebras
    The space of measurement outcomes as a spectrum for non-commutative algebras Bas Spitters Bohrification defines a locale of hidden variables internal in a topos. We find that externally this is the space of partial measurement outcomes. By considering the ::-sheafification, we obtain the space of measurement outcomes which coincides with the spectrum for commutative C*-algebras. 1 Introduction By combining Bohr’s philosophy of quantum mechanics, Connes’ non-commutative geometry [Con94], constructive Gelfand duality [BM00b, BM00a, Coq05, CS09] and inspiration from Doering and Isham’s spectral presheaf [DI08], we proposed Bohrification as a spatial quantum logic [HLS09a, HLS09b]. Given a C*-algebra A, modeling a quantum system, consider the poset of Bohr’s classical concepts C (A) := fC j C is a commutative C*-subalgebra of Ag: In the functor topos SetsC (A) we consider the Bohrification A: the trivial functor C 7! C. This is an internal C*-algebra of which we can compute the spectrum, an internal locale S in the topos SetsC (A). This locale, or its externalization, is our proposal for an intuitionistic quantum logic [HLS09a, HLS09b]. In the present paper we explore a possible refinement of this proposal motivated by what happens for commutative algebras and by questions about maximal subalgebras. In section 4 we compute the externalization of this locale. It is the space of partial measurement outcomes: the points are pairs of a C*-subalgebra together with a point of its spectrum. This construction raises two natural questions: • Can we restrict to the maximal commutative subalgebras, i.e. total measurement frames? • Are we allowed to use classical logic internally? In section 5 we will see that, in a sense, the answers to both of these questions are positive.
    [Show full text]
  • LIE ALGEBRAS 1 Definition of a Lie Algebra K Is a Fixed Field. Let L Be a K-Vector Space (Or Vector Space). We Say That L Is
    LIE ALGEBRAS 1 Definition of a Lie algebra k is a fixed field. Let L be a k-vector space (or vector space). We say that L is a k-algebra (or algebra) if we are given a bilinear map L×L −! L denoted (x; y) 7! xy. If L; L0 are algebras, an algebra homomorphism f : L −! L0 is a linear map such that f(xy) = f(x)f(y) for all x; y. We say that f is an algebra isomorphism if it is an algebra homomorphism and a vector space isomorphism. In this case f −1 : L0 −! L is an algebra isomorphism. If L is an algebra, a subset L0 ⊂ L is a subalgebra if it is a vector subspace and x 2 L0; y 2 L0 =) xy 2 L0. Then L0 is itself an algebra in an obvious way. If L is an algebra, a subset I ⊂ L is an ideal if it is a vector subspace; x 2 L; y 2 I =) xy 2 I; x 2 I; y 2 L =) xy 2 I. Then I is a subalgebra. Moreover, the quotient vector space V=I is an algebra with multiplication (x + I)(y + I = xy + I. (Check that this is well defined.) The canonical map L −! L=I is an algebra homomorphism with kernel I. Conversely, if f : L −! L0 is any algebra homomorphism then ker(f) = f −1(0) is an ideal of L. We say that the algebra L is a Lie algebra if (a) xx = 0 for all x; (b) x(yz) + y(zx) + z(xy) = 0 for all x; y; z.
    [Show full text]
  • (Universal Algebra And) Category Theory in Foundations of Computer Science
    (Universal Algebra and) Category Theory in Foundations of Computer Science Andrzej Tarlecki Institute of Informatics Faculty of Mathematics, Informatics and Mechanics University of Warsaw http://www.mimuw.edu.pl/~tarlecki office: 4750 [email protected] phone: (48)(22)(55) 44475, 20443 This course: http://www.mimuw.edu.pl/~tarlecki/teaching/ct/ Andrzej Tarlecki: Category Theory, 2018 - 1 - Universal algebra and category theory: basic ideas, notions and some results • Algebras, homomorphisms, equations: basic definitions and results • Categories; examples and simple categorical definitions • Limits and colimits • Functors and natural transformations • Adjunctions • Cartesian closed categories • Monads • Institutions (abstract model theory, abstract specification theory) BUT: Tell me what you want to learn! Andrzej Tarlecki: Category Theory, 2018 - 2 - Literature Plenty of standard textbooks But this will be roughly based on: • D.T. Sannella, A. Tarlecki. Foundations of Algebraic Specifications and Formal Program Development. Springer, 2012. − Chap. 1: Universal algebra − Chap. 2: Simple equational specifications − Chap. 3: Category theory Andrzej Tarlecki: Category Theory, 2018 - 3 - One motivation Software systems (modules, programs, databases. ): sets of data with operations on them • Disregarding: code, efficiency, robustness, reliability, . • Focusing on: CORRECTNESS Universal algebra Category theory from rough analogy A language to further abstract away from the standard notions of univer- module interface ; signature sal algebra, to deal with their numer- module ; algebra ous variants needed in foundations of module specification ; class of algebras computer science. Andrzej Tarlecki: Category Theory, 2018 - 4 - Signatures Algebraic signature: Σ = (S; Ω) • sort names: S • operation names, classified by arities and result sorts: Ω = hΩw;siw2S∗;s2S Alternatively: Σ = (S; Ω; arity; sort) with sort names S, operation names Ω, and arity and result sort functions arity :Ω ! S∗ and sort :Ω ! S.
    [Show full text]
  • Quasi-Hermitian Locally Compact Groups Are Amenable
    1 QUASI-HERMITIAN LOCALLY COMPACT GROUPS ARE AMENABLE EBRAHIM SAMEI AND MATTHEW WIERSMA Abstract. A locally compact group G is Hermitian if the spectrum SpL1(G)(f) ⊆ R for every 1 ∗ f ∈ L (G) satisfying f = f , and quasi-Hermitian if SpL1(G)(f) ⊆ R for every f ∈ Cc(G) satisfying f = f ∗. We show that every quasi-Hermitian locally compact group is amenable. This, in particular, confirms the long-standing conjecture that every Hermitian locally compact group is amenable, a problem that has remained open since the 1960s. Our approach involves introducing the theory of “spectral interpolation of triple Banach ∗-algebras” and applying ∗ it to a family PFp(G) (1 ≤ p ≤ ∞) of Banach ∗-algebras related to convolution operators 1 ∗ ∗ that lie between L (G) and Cr (G), the reduced group C -algebra of G. We show that if ∗ ∗ G is quasi-Hermitian, then PFp(G) and Cr (G) have the same spectral radius on Hermitian elements in Cc(G) for p ∈ (1, ∞), and then deduce that G must be amenable. We also give an alternative proof to Jenkin’s result in [19] that a discrete group containing a free sub-semigroup on two generators is not quasi-Hermitian. This, in particular, provides a dichotomy on discrete elementary amenable groups: either they are non quasi-Hermitian or they have subexponential growth. Finally, for a non-amenable group G with either rapid decay or Kunze-Stein property, ∗ we prove the stronger statement that PFp(G) is not “quasi-Hermitian relative to Cc(G)” unless p = 2. 1. Introduction Let A be a Banach ∗-algebra, i.e.
    [Show full text]
  • Analytic Group Kernels and Lie Algebra Kernels^)
    ANALYTIC GROUP KERNELS AND LIE ALGEBRA KERNELS^) BY R. A. MACAULEY 1. Introduction. In this paper we develop a kernel theory for analytic groups (that is, connected Lie groups) analogous to the kernel theory de- veloped for discrete groups by Eilenberg and MacLane in [3]. Although the methods employed in this paper are necessarily somewhat more delicate than those in [3], our development in §4 and the early part of §3 is modeled after that given by Eilenberg and MacLane. The initial difficulty encountered is in suitably defining an "analytic" kernel. This situation is complicated by the fact that the group of inner auto- morphisms of an analytic group need not be a closed subgroup of the group of all continuous and open automorphisms of the given analytic group. How- ever, we are able to circumvent this latter obstacle and we show in the early portion of §3 that we may indeed form the group Ker(C, H, d) of equivalence classes of analytic Tf-kernels with centers C and inducing H operators on C identical with those given by the continuous homomorphism d: H^>A(C) = group of continuous automorphisms of C. We recall that in the discrete case Ker(C, H, d) is the standard interpretation for the three dimensional cohomology group of H in C. In the following our notation is that X' denotes the Lie algebra of a Lie group X and if / is an analytic homomorphism, then /' is the induced Lie algebra homomorphism. We associate with each analytic i7-kernel a corresponding Lie algebra 77'-kernel and show that this association induces a homomorphism of Ker(C, H, d) into the group Ker(C, H', d') of equivalence classes of finite dimensional Lie algebra i7'-kernels with centers C and inducing H' operators on C identical with those given by d': H'—*D(C) =algebra of derivations of C.
    [Show full text]