Springer Monographs in Mathematics
This page intentionally left blank
Dietlinde Lau
Function Algebras on Finite Sets A Basic Course on Many-Valued Logic and Clone Theory
With 42 Figures and 46 Tables
123
Dietlinde Lau Institute for Mathematics University of Rostock Universitätsplatz 1 18055 Rostock, Germany e-mail:
[email protected]
Library of Congress Control Number: 2006929534
Mathematics Subject Classification (2000): 03B50, 08Axx, 08A40, 08A30, 08A05, 06A15 ISSN 1439-7382 ISBN-10 3-540-36022-0 Springer-Verlag Berlin Heidelberg New York ISBN-13 978-3-540-36022-3 Springer-Verlag Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable for prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springer.com © Springer-Verlag Berlin Heidelberg 2006 Printed in Germany The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Typesetting by the author using a Springer TEX macro package Production: LE-TEX Jelonek, Schmidt & Vöckler GbR, Leipzig Cover design: Erich Kirchner, Heidelberg Printed on acid-free paper
44/3100YL - 5 4 3 2 1 0
To my mother, Brigitte Lau
This page intentionally left blank
Preface
Functions (or operations), which are defined on finite sets, occur in almost all fields of mathematics. For more than 80 years, algebras (so-called function algebras), whose universes are such functions, have been studied. Particularly in Mathematical Logic, in Universal Algebra (more precise in the Clone Theory), and in parts of Computer Science, certain knowledge about these algebras are subject of the fundamental knowledge. Currently only one book has been published about function algebras, apart from certain monographs or dissertations of specific themes, survey articles and books that contain sections about function algebras or clones. This book has been written by R. P¨ oschel und L. A. Kaluˇznin in the German language and gives a very good overview about the results achieved up to 1979. During the last 26 years, many new results have been obtained; however, a new book about function algebras is overdue. The aim of the present book is to introduce the reader to the theory of function algebras and to give the latest state of research for some selected fields. The author would like to acquaint the reader with proof of the fundamental theorems and the different proof methods, to enable research in the field of the function algebras. This book is self-contained. All necessary fundamental concepts and facts are introduced, but some background knowledge about linear and abstract algebra would be helpful for readers. In the following Introduction, the reader finds short summaries of the 26 chapters of this book. The adjoined section Preliminaries explains abbreviations and some general symbols, which are more or less standard, and gives some facts from basic mathematics. Part I of this book introduces the reader to Universal Algebra to provide almost every knowledge concerning other fields of mathematics. Moreover, this part of Universal Algebra informs the reader that many of the following results
VIII
Preface
of function algebras reply to questions that arise upon studying an algebra. The structure of this book enables the reader to skip the first part and immediately start reading Part II Function Algebras. The author provides the reader with new proofs concerning classic results of the theory of function algebras. The remaining proofs are adapted to the style of the book. The theorems from Sections 14.10, 15.4, 18.2, 18.3, and from Chapter 17 have not yet been published. Small mistakes from the original papers (including the papers of the author) have been corrected in this book without referring to the original mistakes. During the writing process I have tried to solve open mathematics questions and problems, which I recognized during my study of the corresponding literature. In some cases colleagues helped me. In such a case their names are mentioned in the relevant places in the book. I would like to thank my colleagues as well as the authors of the articles I referred to in my book. Especially, I would like to thank my doctoral thesis supervisors, Prof. G. Burosch (R¨overshagen), and Prof. V. B. Kudrjavcev (Moscow). I received first information on the complexity of themes in this book from their lectures. I owe Prof. I. G. Rosenberg (Montreal) much gratitude, as I learned many proof methods while studying his papers. I thank my colleagues Prof. Dr. K. Denecke (Potsdam), Prof. Dr. L. Haddad (Kingston), and Prof. Dr. R. P¨ oschel (Dresden) for their fruitful cooperation during many years. In particular, Prof. Haddad was a very great aid during the finishing of the book. I also owe him the organization and the financing (by the Natural Sciences and Engineering Council of Canada) of a linguistic correction of my text by Ms Eryn Kirkwood (from RedInk Editors, Ottawa ON, Canada). Ms Kirkwood deserves my special thanks.
Rostock, June 2006
Dietlinde Lau
Contents
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1
Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 Part I Universal Algebra 1
Basic Concepts of Universal Algebra . . . . . . . . . . . . . . . . . . . . . . . 1.1 Universal Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2 Examples of Universal Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2.1 Gruppoids . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2.2 Semigroups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2.3 Monoids . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2.4 Groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2.5 Semirings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2.6 Rings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2.7 Fields . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2.8 Modules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2.9 Vector Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2.10 Semilattices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2.11 Lattices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2.12 Boolean Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2.13 Function Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.3 Subalgebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
25 25 27 27 28 28 28 28 28 29 29 29 29 30 30 30 31
2
Lattices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.1 Two Definitions of a Lattice . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.2 Examples for Lattices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.3 Isomorphic Lattices and Sublattices . . . . . . . . . . . . . . . . . . . . . . . . 2.4 Complete Lattices and Equivalence Relations . . . . . . . . . . . . . . .
35 35 39 39 41
X
Contents
3
Hull Systems and Closure Operators . . . . . . . . . . . . . . . . . . . . . . . 45 3.1 Basic Concepts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 3.2 Some Properties of Hull Systems and Closure Operators . . . . . . 46
4
Homomorphisms, Congruences, and Galois Connections . . . 4.1 Homomorphisms and Isomorphisms . . . . . . . . . . . . . . . . . . . . . . . . 4.2 Congruence Relations and Factor Algebras of Algebras . . . . . . . 4.3 Examples for Congruence Relations and Some Homomorphism Theorems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.3.1 Congruences on Groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.3.2 Congruences on Rings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4.4 Galois Connections . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
51 51 52 56 56 58 59
5
Direct and Subdirect Products . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 5.1 Direct Products . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 5.2 Subdirect Products . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66
6
Varieties, Equational Classes, and Free Algebras . . . . . . . . . . . 6.1 Varieties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6.2 Terms, Term Algebras, and Term Functions . . . . . . . . . . . . . . . . . 6.3 Equations and Equational Classes . . . . . . . . . . . . . . . . . . . . . . . . . 6.4 Free Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6.5 Connections Between Varieties and Equational Defined Classes 6.6 Deductive Closure of Equation Sets and Equational Theory . . . 6.7 Finite Axiomatizability of Algebras . . . . . . . . . . . . . . . . . . . . . . . .
71 71 73 76 78 81 82 84
Part II Function Algebras 1
Basic Concepts, Notations, and First Properties . . . . . . . . . . . 91 1.1 Functions on Finite Sets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91 1.2 Operations on PA , Function Algebras . . . . . . . . . . . . . . . . . . . . . . 94 1.3 Superpositions, Subclasses, and Clones . . . . . . . . . . . . . . . . . . . . . 96 1.4 Generating Systems for PA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98 1.5 Some Applications of the Function Algebras . . . . . . . . . . . . . . . . 104 1.5.1 Classification of Universal Algebras . . . . . . . . . . . . . . . . . . 104 1.5.2 Propositional Logic and First Order Logic . . . . . . . . . . . . 105 1.5.3 Many-Valued Logics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115 1.5.4 Information Transformer . . . . . . . . . . . . . . . . . . . . . . . . . . . 116 1.5.5 Classification of Combinatorial Problems . . . . . . . . . . . . . 118
2
The Galois-Connection Between Function- and Relation-Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125 2.1 Relations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125 2.2 Diagonal Relations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126
Contents
XI
2.3 Elementary Operations on Rk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127 2.4 Relation Algebras, Co-Clones, and Derivation of Relations . . . . 127 2.5 Some Operations on Rk Derivable from the Elementary Operations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 128 2.6 The Preserving of Relations; Pol, Inv . . . . . . . . . . . . . . . . . . . . . . 130 2.7 The Relations χn and Gn . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132 2.8 The Operator ΓA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 134 2.9 The Galois Theory for Function- and Relation-Algebras . . . . . . 135 2.10 Some Modifications of the P ol-Inv-Connection . . . . . . . . . . . . . . 137 2.10.1 Galois Theory for Finite Monoids and Finite Groups . . . 137 2.10.2 Galois Theory for Iterative Function Algebras . . . . . . . . . 139 2.11 Some Connections Between the Relation Operations . . . . . . . . . 142 3
The Subclasses of P2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145 3.1 Definitions of the Subclasses of P2 and Post’s Theorem . . . . . . . 145 3.2 A Proof for Post’s Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 149 3.2.1 The Subclasses A of P2 with A ⊆ L and A ⊆ S . . . . . . . . 149 3.2.2 The Subclasses of L . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 154 3.2.3 The Subclasses of S, Which Are Not Subsets of L . . . . . 155 3.2.4 A Completeness Criterion for P2 . . . . . . . . . . . . . . . . . . . . 156
4
The Subclasses of Pk Which Contain Pk1 . . . . . . . . . . . . . . . . . . . 159
5
The Maximal Classes of Pk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163 5.1 Introduction, a Rough Description of the Maximal Classes . . . . 163 5.2 Definitions of the Maximal Classes of Pk . . . . . . . . . . . . . . . . . . . 165 5.2.1 Maximal Classes of Type M (Maximal Classes of Monotone Functions) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 165 5.2.2 Maximal Classes of Type S (Maximal Classes of Autodual Functions) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 167 5.2.3 Maximal Classes of Type U (Maximal Classes of Functions, Which Preserve Non-Trivial Equivalence Relations) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 170 5.2.4 Maximal Classes of Type L (Maximal Classes of Quasi-Linear Functions) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 171 5.2.5 Maximal Classes of Type C (Maximal Classes of Functions, Which Preserve Central Relations) . . . . . . . . . 173 5.2.6 Maximal Classes of Type B (Maximal Classes of Functions, Which Preserve h-Universal Relations) . . . . . 174 5.3 Proof of the Maximality of the Classes Defined in Section 5.2 . 179 5.4 The Number of the Maximal Classes of Pk . . . . . . . . . . . . . . . . . . 183 5.5 Remarks to the Maximal Classes of Pk (l) . . . . . . . . . . . . . . . . . . . 188
6
Rosenberg’s Completeness Criterion for Pk . . . . . . . . . . . . . . . . 191 6.1 Proof of Completeness Criterion . . . . . . . . . . . . . . . . . . . . . . . . . . . 191
XII
Contents
7
Further Completeness Criteria . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 211 7.1 A Criterion for Sheffer-Functions . . . . . . . . . . . . . . . . . . . . . . . . . . 211 7.2 A Completeness Criterion for Surjective Functions . . . . . . . . . . . 216 7.3 Fundamental Sets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 217
8
Some Properties of the Lattice Lk . . . . . . . . . . . . . . . . . . . . . . . . . 219 8.1 Cardinality Statements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 219 8.2 On the Cardinalities of Maximal Sublattices of Lk . . . . . . . . . . . 224 8.3 Some Strategies for the Determination of Sublattices of Lk . . . . 229
9
Congruences and Automorphisms on Function Algebras . . . 233 9.1 Some Basic Concepts and First Properties . . . . . . . . . . . . . . . . . . 234 9.2 Congruences on the Subclasses of P2 . . . . . . . . . . . . . . . . . . . . . . . 235 9.3 Characterization of the Non-Arity Congruences . . . . . . . . . . . . . 238 9.4 About the Number of the Congruences on a Subclass of Pk . . . 243 9.5 A Criterion for the Proof of the Countability of Con A for Certain A ⊆ Pk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 248 9.6 Congruences on Some Classes of Linear Functions . . . . . . . . . . . 250 9.7 Congruences on the Maximal Classes of Pk . . . . . . . . . . . . . . . . . 256 9.8 Congruences on Subclasses of [Pk1 ] . . . . . . . . . . . . . . . . . . . . . . . . . 265 9.9 Congruences on Some Subclasses of Pk,l . . . . . . . . . . . . . . . . . . . . 273 9.10 Some Further General Properties of the Congruences and the l-Classes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 278 9.11 The Connection Between Clone Congruences and Fully Invariant Congruences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 282 9.12 Automorphisms of Function Algebras . . . . . . . . . . . . . . . . . . . . . . 285
10 The Relation Degree and the Dimension of Subclasses of Pk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291 10.1 The Definition of the Relation Degree and of the Dimension of a Subclass of Pk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 291 10.2 The Dimensions and Relation Degrees of Post’s Classes . . . . . . 293 10.3 Further Examples of the Dimension and Relation Degree of Classes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 301 11 On Generating Systems and Orders of the Subclasses of Pk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307 11.1 Some General Properties of Generating Systems and Bases . . . 308 11.2 The Orders and Sheffer-Functions of the Classes of Type C1 , S or U . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 310 11.3 Orders of the Classes of Type L, C, B . . . . . . . . . . . . . . . . . . . . . . 314 11.4 The Order of P olk for ∈ Mk and k ≤ 7 . . . . . . . . . . . . . . . . . . 319 11.5 A Maximal Clone of Monotone Functions That Is Not Finitely Generated . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 324 11.6 Classifications and Basis Enumerations in Pk . . . . . . . . . . . . . . . 332
Contents
XIII
12 Subclasses of Pk,2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 335 12.1 Notations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 336 12.2 Some Properties of the Inverse Images . . . . . . . . . . . . . . . . . . . . . 337 12.3 On the Number of the B-projectable Subclasses of Pk,2 , B ⊆ P2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 342 12.4 The Pl -projectable and the P oll {α}-projectable Subclasses of Pk,l . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 350 12.5 The Maximal and the Submaximal Classes of Pk,2 . . . . . . . . . . . 354 12.6 The Classes A with M ∩ T0 ∩ T1 ⊆ prA or L ∩ T0 ∩ S ⊆ prA or prA = M ∩ S . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 361 13 Classes of Linear Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 383 13.1 Some Properties of the Subclasses of Ud That Contain rd . . . . . 384 13.2 The Subclasses of Linear Functions of Pk with k ∈ P . . . . . . . . . 387 13.3 A Survey of Further Results on Linear Functions . . . . . . . . . . . . 390 14 Submaximal Classes of P3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 399 14.1 A Survey of the Submaximal Classes of P3 . . . . . . . . . . . . . . . . . . 400 14.2 Some Declarations and Lemmas for Sections 14.3–14.9 . . . . . . . 408 14.3 Proof of Theorem 14.1.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 410 14.4 Proof of Theorem 14.1.3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 412 14.5 Proof of Theorem 14.1.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 415 14.6 Proof of Theorem 14.1.5 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 418 14.7 Proof of Theorem 14.1.7 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 418 14.8 Proof of Theorem 14.1.8 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 421 14.9 Proof of Theorem 14.1.9 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 424 14.10On the Cardinality of L↓3 (A) for Submaximal Clones A . . . . . . . 425 15 Finite and Countably Infinite Sublattices of Depth 1 or 2 of L3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 433 15.1 The Lattice of Subclasses of P3 of Linear Functions . . . . . . . . . . 433 15.2 The Subsemigroups of (P31 ; ) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 434 15.3 Classes of Quasilinear Functions of P3 . . . . . . . . . . . . . . . . . . . . . . 456 15.3.1 Some Notations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 456 15.3.2 Subclasses of L0,1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 457 15.3.3 The Subclasses of L0,1 ∪ L0,2 That Are Not Subclasses of L0,1 or L0,2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 461 15.3.4 The Remaining Subclasses of L . . . . . . . . . . . . . . . . . . . . . 463 15.4 The Subclasses of [O1 ∪ {max}] . . . . . . . . . . . . . . . . . . . . . . . . . . . 464 15.4.1 Some Descriptions of the Class M . . . . . . . . . . . . . . . . . . . 464 15.4.2 Some Lemmas and a Rough Partition of the Subclasses of M . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 465 15.4.3 The Subclasses of [M 1 ] . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 470 15.4.4 The Subclasses of R . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 471 15.4.5 The Subclasses of M ∩ P ol3 {(0, 2)} . . . . . . . . . . . . . . . . . . 482
XIV
Contents
15.4.6 The Remaining Subclasses of M . . . . . . . . . . . . . . . . . . . . . 488 16 The Maximal Classes of a∈Q P olk {a} for Q ⊆ Ek . . . . . . . . . 499 16.1 Notations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 499 16.2 Results of Chapter 16 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 501 16.3 Some Lemmas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 502 16.4 Proof of Theorem 16.2.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 513 17 Maximal Classes of P olk El for 2 ≤ l < k . . . . . . . . . . . . . . . . . . . 515 17.1 Notations, Definitions, and Some Lemmas . . . . . . . . . . . . . . . . . . 515 17.2 Results of Chapter 17 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 519 17.3 Maximality Proofs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 520 17.4 Some Lemmas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 528 17.5 Not Through Relations of Rmax (Pl ) ∪ Rmax (Pk ) Describable Classes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 529 17.6 Classes Describable by Relations of Rmax (Pl ) ∪ Rmax (Pk ) . . . . 549 18 Further Submaximal Classes of Pk . . . . . . . . . . . . . . . . . . . . . . . . . 555 18.1 The Maximal Classes of P olk s for s ∈ Sk . . . . . . . . . . . . . . . . . 555 18.2 Some Maximal Classes of a Maximal Class of Type U . . . . . . . . 561 18.3 The Maximal Classes of P olk (Ek2-1 ∪ {(k-1, k-1)}) . . . . . . . . . . . . 573 18.3.1 Definitions of the U -Maximal Classes . . . . . . . . . . . . . . . . 573 18.3.2 Proof of the U -Maximality of the Classes Defined in 18.3.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 576 18.3.3 Proof of the Completeness Criterion for U . . . . . . . . . . . . 584 19 Minimal Classes and Minimal Clones of Pk . . . . . . . . . . . . . . . . 589 19.1 Minimal Classes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 589 19.2 The Five Types of Minimal Clones . . . . . . . . . . . . . . . . . . . . . . . . . 590 20 Partial Function Algebras . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 597 20.1 Basic Concepts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 598 20.2 One-Point Extension . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 600 20.3 Description of Partial Clones by Relations . . . . . . . . . . . . . . . . . . 604 3 . . . . . . . . . . . . . . . . . . 606 2 and P 20.4 The Maximal Partial Classes of P k . . . . . . . . . . . . . . . . . . . . . . . . 614 20.5 The Completeness Criterion for P k . . . . . . . . 616 20.6 Some Properties of the Maximal Partial Clones of P 20.7 Intervals of Partial Clones That Contain a Maximal Clone . . . . 619 20.8 Intervals of Boolean Partial Classes . . . . . . . . . . . . . . . . . . . . . . . . 627 20.9 On Congruences of Partial Clones . . . . . . . . . . . . . . . . . . . . . . . . . 628 References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 639 Glossary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 655 Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 663
Introduction
The present book deals with a subarea of the Discrete Mathematics. We study functions, which are defined on finite sets, and we study the composition of these functions. Such functions are used, for example, in Computer Science (in particular, in the Switching Theory and in the Theory of Automata), in Mathematical Logic, and in Universal Algebra (in particular, the Clone Theory).1 In other words, we choose an arbitrary finite set A and study an algebra, whose universe is the set PA
(or Pk := P{0,1,2,..,k−1} )
of all n-ary mappings (n ∈ N), which maps the Cartesian power An (of all ordered n-tuples of elements from A) into A, and whose operations are the so-called superposition operations that are described as follows:2 – permutation of variables – identification of variables – adding of fictitious variables and – substitution of variables of a function by functions Denote F (n) the set of all n-ary functions of F ⊆ PA . Moreover, let Ω be the set of all superposition operations described above. Then, PA := (PA ; Ω) is called (full) function algebra (on A). The universe of a subalgebra of PA is called closed set or a subclass (or briefly a class) of PA . If F is a subclass of Pk then F is also called a subclass of the k-valued logic. The set of all closed sets of Pk together with the set inclusion forms a lattice Lk . 1 2
See, for this purpose, also Section 1.5 of Part II. One finds an exact definition of these operations in Section 1.2 of Part II.
2
Introduction
The closed sets of P2 were already determined in the papers [Pos 20] and [Pos 41] by E. L. Post. For over 50 years, many papers have dealt with function algebras or closed sets of Pk for arbitrary k. One finds a survey of the essential articles, which were published up to the year 1978, on the topic in [P¨ os-K 79] with 730 references and in [Ros 77] with 464 references. To give the reader a first impression of the problems handled in the theory of the function algebras, some explanations are subsequently given to the completeness problem3 , which stood in the center of a line of investigations in many articles: One finds a criterion, to decide if a set of functions that belong to Pk is sufficient for the construction of any arbitrary other function of Pk (by means of the superposition operations). A general answer to that is given by the following criterion, which was formulated by E. L. Post in 1921, first, for Boolean functions, i.e., for functions of P2 : A set F ⊆ Pk is complete in Pk if and only if F is a subset of no maximal class of Pk . A closed set M ⊂ Pk is said to be maximal in Pk , if M can not be properly extended to a closed proper subset of Pk . With regard to such and similar question formulations, one naturally deals with the structure of the subclasses of Pk or with the lattice of the subclasses of Pk . The first and most important result in this direction is Post’s pioneering description of L2 ([Pos 41], see Figure 1), now known as Post lattice. One can describe the many Post’s classes with the aid of the classes P2 , M , S, L, Ta (1) Ta,µ , D ∪ C, K ∪ C, [P2 ], C, (a ∈ {0, 1}, µ ∈ N \ {1}) and through formation of certain intersections of these classes, where T0 , T1 , M , S, and L are exactly the maximal classes of P2 .4 For some time, it was thought that L3 is equally simple. Then, Ju. I. Janov and A. A. Muˇcnik showed in the year 1959 the existence of subclasses of Pk for k ≥ 3 with infinite and without basis, respectively, and this implies the existence of a non-countable infinite set of subclasses in Lk (see also [Ehr 55]). Thus, there are as many closed sets in Pk as there are subsets of Pk for k ≥ 3. In contrast to k = 2, therefore, it seems hard to give an effective description of Lk for k ≥ 3. Nevertheless, one could determine the maximal classes of Pk for arbitrary k. S. V. Jablonskij determined all 18 maximal classes of P3 in [Jab 54] and [Jab 58]. Moreover, he extended his results by describing several types of maximal classes of Pk . This work was continued by V. V. Martynyuk [Mar 60], E. Ju. Zacharova [Zac 67], R. A. Bairamov [Bai 67] ˇ ˇ 67]. In [Zac-K-J (some results incorrect) and V. L. Rvaˇcev/ L. I. Sljarov [Rva-S 71] it has been reported that late A. I. Mal’tsev had all 82 maximal sets of P4 . I. G. Rosenberg published the missing maximal classes for Pk in [Ros 65] and 3 4
In Section 1.5 of Part II, it is shown that this problem is a mathematical way to describe problems that occur during the construction of electronic circuits. See Chapter 3 of Part II for details.
Introduction
3
he proved in the book [Ros 70a] that there can not be any further maximal classes for arbitrary k, whereby the general completeness problem for Pk was solved. Rosenberg’s description of the maximal classes is based on the idea of a function preserving a relation; i.e., he could prove that every maximal class has the form P olk , where is a certain h-ary relation on Ek , 1 ≤ h ≤ k, k ≥ 3 and P olk is the set of all functions of Pk , which preserve the relation . To find the maximal ones among classes of the form P olk , he designed a sieve method, which eliminates at each step every relation for which a relation σ is found in the list such that P olk ⊆ P olk σ. The process terminates when the candidate list contains only relations such that P olk can be proved to be maximal. This approach was twofold in scope. To discover the maximal classes and, at the same time, to prove that one has a full list of them. The idea to describe classes through relations kept on being developed to a Galois-theory for function algebras and relation algebra by V. G. Bodnarˇcuk, L. A. Kaluˇznin, V.N. Kotov, B. A. Romov (in [Bod-K-K-R 69]). The interesting subclasses of Pk are not only the maximal ones, and so the Galois theory was and is an important aid for the study of subclasses of Pk . Namely, one can classify finite universal algebras and also combinatorial problems with the aid of the elements of Lk (see Section 1.5 of Part II). These and many other applications presuppose, however, precise knowledge about the subclasses of Pk . Therefore, the object of this book is to explain some methods to the finding of subclasses of Pk and to give a survey of subclasses and their properties, which were determined in the last years. To familiarize the reader from the beginning also with the algebraic side of the function algebras and to show that the concepts introduced for function algebras are only special cases of more general concepts mostly from the Universal Algebra, we begin with an introduction to the Universal Algebra in the first part of this book. One finds supplements to this short introduction to the Universal Algebra in the books [Bur-S 81], [Coh 65], [Gr¨ a 68], [Ihr 93] (or [Ihr 2003]), [McK-M-T 87], [Wer 78] and [Lau 2004], volume 2. In Part II, we deal only with the function algebras. The construction of the book is chosen in a way that one can immediately begin reading Part II and, if one needs concepts and facts from Part I, one can reference these. Unlike Part I, which is strongly linearly structured in that each chapter is based on the preceding chapter, after studying the first two chapters of Part II, all successive studies can also be studied. We concentrate in Part II on the following topics: • • • • •
Basic concepts and notations Galois-connection between function algebras and relation algebras Post’s results on the subclasses of P2 the maximal classes of Pk completeness criterions for Pk (in particular, the Rosenberg’s completeness criterion)
4
Introduction
• congruences on subclasses of Pk • complexity measures for generating systems (for example as order or relation degree and dimension) of certain subclasses of Pk • subclasses of linear functions of Pp (p prime number) • a survey on subclasses of Pk , whose functions have at most two different values • submaximal classes of P3 • the description of all finite and countably infinite sublattices of the depth 1 or 2 of the lattice of all subclasses of P3 • submaximal classes of Pk , which are subsets of maximal classes described by unary relations • a survey of results to maximal classes of Pk for arbitrary k • minimal clones • partial function algebras. One finds completions to this book and a survey on further topics of the function-algebras-theory in [P¨ os-K 79] and [Ros 84]. Subsequently the content of this text is described in brief without the necessary concepts and notations.
Part I Chapter 1 begins with the definition of a universal algebra (briefly: algebra) as a pair (A;F) consists of a nonempty set A and a set F of certain operations on A and gives numerous examples of algebras (among that also the function algebras). In addition, one finds the very important concept of the subalgebra in this chapter. Chapter 2 compiles needed order concepts within the framework of an introduction to the lattice theory. The usual definitions of a lattice are indicated, and the calculation in the lattice theory illustrates by means of the proof of a few classical theorems of the lattice theory. Chapter 3 generalizes observations, which one can make when one examines more closely such concepts as subalgebra or linear hull of subsets of a vector space (or another closure operators of the classical algebra), to the concepts hull system and closure operator. Then, it is shown that these concepts deliver, roughly, the same. In addition, certain combinations to the lattice theory are given, and the lattices, formed from the subalgebras of an algebra, are uniquely characterized through certain properties. Chapter 4 combines properties of such important concepts as the homomorphic and isomorphic mappings between universal algebras, which the readers surely know from the classical algebra here, and which are defined obviously for universal algebras. It is shown, how homomorphic mappings are
Introduction
5
ultimately determined by congruence relations (i.e., by equivalence relations, which are compatible with the operations of algebra). The (general) homomorphism theorem keeps on being proved and is shown by examples, as this theorem can be improved for concrete algebras. A section of Chapter 4 deals with Galois connections between set systems that are continued later for function algebras in Chapter 2 of the second part. Chapter 5 shows how one can form new algebras from given algebras through direct or subdirect products and how one can recognize whether a given algebra is isomorphic to an algebra formed in this way. More precisely: we deal with the following two questions: Which algebras are smallest constituents of given algebras? How can one reduce a given algebra to its smallest constituents? Answers to these questions are given by theorems found by G. Birkhoff. We prove these theorems in Chapter 5. In particular, we prove the representation theorems for algebras: Each finite algebra is isomorphic to a direct product of directly irreducible algebras. Each algebra is isomorphic to a subdirect product of subdirectly irreducible algebras. Chapter 6 deals with classes of algebras of the same type and some theorems on such classes, which were found also by G. Birkhoff. At first we introduce so-called varieties as classes of algebras, which are closed in respect to the formation of subalgebras, homomorphic images and direct products. We then come to a method for the construction of algebra classes that strongly differs from the first method at first sight: Based upon certain equations from variables and operation symbols of a certain type τ , we form the class of all algebras of type τ that these equations fulfill. The result is so-called equational classes. We will see, however, that there is a close connection between the two methods of the algebra class construction: class of algebras is equational defined if and only if it is a variety. In the section on equational classes, we will also treat such concepts as the conclusion of an equational set. In addition, we treat ways to receive such conclusions. In Chapter 9 of Part II, we show that the results on congruences of a subclass F ⊆ PA imply results on subvarieties of the variety, which is generated by the algebra (A; F ) and vice versa.
6
Introduction
Part II Chapter 1 begins with the precise definition of function algebras (PA ; Ω), where Ω is an infinite set of operations, which describe the above superposition operations exactly, on PA first. It is shown then how one can receive the operations of the set Ω through five elementary operations (so-called “Mal’tsevOperationen”) ζ, τ, ∆, ∇ and by means of composition. The basis of further investigations is, then, the (full iterative) function algebra PA := (PA ; ζ, τ, ∆, ∇, ) bzw. Pk := PEk mit Ek := {0, 1, ..., k − 1}. A universe of a subalgebra of Pk is called subclass (or more briefly, class) in the following. If [T ] denotes the set of all functions of PA , which one can form from the functions of T ⊆ PA by means of superposition operations, then we have [F ] = F for arbitrary subclass F of PA . (n) n A mapping defined by ei : EA −→ A, (x1 , x2 , ..., xn ) → xi , where i ∈ {1, 2, ..., n}, is called a projection. A clone is a subclass of PA , which contains all projections of PA . In Chapter 1 there are notations, concepts . . . that are used in the following chapters repeatedly. In addition, it is shown that the set PA and some subsets of PA can be formed from binary functions of PA by means of superposition operations. At the end of Chapter 1, we briefly show how one can use the results of this book and how certain investigations are motivated in the theory of function algebras. Chapter 2 provides tools (like the the concepts of “a function preserves a relation” and “a relation is an invariant for a function”) by which classes, dealt in later chapters, can be effectively described. The set Rk of all n-ary relations on Ek (n = 1, 2, 3, ...) is defined and operations over the set Rk so that Rk with these operations forms a relation algebra Rk . Each universe of a subalgebra of Rk is called a co-clone of Rk . The main result of Chapter 2 is the proof that the lattice of the clones of Pk is antiisomorphic to the lattice of all co-clones of Rk . The basis of this result is the Galois-connection (P ol, Inv), where P ol : P(Rk ) −→ P(Pk ) and Inv : P(Pk ) −→ P(Rk ) are mappings defined by P olk Q := {f ∈ Pk | f preserves each relation of Q}, Invk F := { ∈ Rk | is an invariant for each function f of F } for arbitrary Q ⊆ Rk and arbitrary F ⊆ Pk . The Galois-connection (P ol, Inv) makes it possible to consider the function algebras instead of relation algebras and vice versa. Moreover, one can handle function algebras and relation algebras with equal significance, as it happens in [P¨ os-K 79], for example. We deal, however, with the clones in this book and proceed only with the co-clones if the proof methods developed for function algebras are not sufficient.
Introduction T0 T0,2
T0,3
T0,∞
P2
M T 1
K
S∩M
K ∪C
S
C0
I
L [P21 ]
I C
D∪C
7
T1,2 T1,3
T1,∞
D
C1
∅
Fig. 1. The Post’s lattice
The connection between algebras and relations was introduced by M. Krasner ([Kra 46] and [Kra 68/69]). He has completely developed the special Galois-connection between subsets of the permutation groups Sn := {f ∈ (1) Pk | f is bijective} and subsets of Rk . Later, Krasner also developed a sim(1) ilar theory for subsemigroups of Pk . Krasner’s theory was generalized by V. G. Bodnarˇcuk, L. A. Kaluˇznin, V. N. Kotov, and B. A. Romov in [Bod-K-K-R 69]. Chapter 3 gives all subclasses from P2 (the so-called Post’s classes) and proves the completeness of the list. In addition, smallest generating systems (“bases”) and the orders of the Post’s classes are determined. The results of Chapter 3 were found by E. L. Post (see [Pos 20] and [Pos 41]). Figure 1 gives the Hasse-diagram of the lattice of the subclasses of P2 . A knot of the graph without denotation represents a class that can be described as an intersection of classes that lie above it. Chapter 4 describes all classes that contain all unary functions of Pk . There exist k + 1 of such classes, which form a chain in the lattice of all subclasses of Pk . The results of Chapter 4 were found by G. A. Burle (see [Bur 67]). Chapter 5 begins with a coarse description of the maximal classes of Pk . The idea to describe classes this way was indicated already in [Kuz 59] by
8
Introduction
A. V. Kuznecov. Then classes, from which we show later (in Section 5.3) that they are maximal classes of Pk , are defined. (In Chapter 6, the proof is all maximal classes are determined.) As in [Ros 70] the classes are divided in Section 5.2 into six types and characterized by their invariants (relations). We denote the relation sets needed in this case with with Mk , Sk , Uk , Lk , Ck and Bk . Subsequently a maximal class is called a maximal class of the type X, when it can be described with the aid of a relation from set Xk , where X ∈ {M, S, U, L, C, B}. Next to the definitions of the maximal classes of Pk one finds the proofs of some properties of the maximal classes needed in later chapters, and the derivation of a recursion formula for the number determination of the maximal classes of Pk . Chapter 6 gives the proof found by I. G. Rosenberg and published in [Ros 70a] that the classes defined in Section 5.2 are the only maximal classes of Pk for arbitrary k. In some parts, the original proof can be abbreviated by using proof ideas from some papers (for example from [Qua 82] and [P¨ os-K 79]). As already explained, there is also a solution of the completeness problem for Pk through the description of maximal classes of Pk . Chapter 7 shows how one can derive some further completeness criteria for specific question formulations from the Rosenberg’s completeness criterion 6.1. First of all we will handle a criterion for Sheffer functions which was found by G. Rousseau. 5 Then we will show how one can reduce the conditions from Theorem 6.1 if one considers only surjective functions. Finally, we deal with criteria indicate under which conditions a set (⊆ Pk ) consisting of certain unary functions and a Slupecki-function 6 is complete in Pk . Chapter 8 explains the qualitative differences between the lattice L2 of the subclasses of P2 and the lattice Lk of the subclasses of Pk for k ≥ 3. While L2 is countable-infinite, Lk has the cardinality of the continuum (denoted by c) for k ≥ 3. This results from the fact that, for every k ≥ 3, the set Pk has a subclass with an infinite basis. One finds examples of such classes not only in Chapter 8, but also in Sections 12.3 and 14.10. Moreover, we deal with cardinality statements about chains and antichains (in Lk ) and with the embedding of Lk into Lk in Chapter 8. Then the question is clarified, which cardinalities the lattices L↓k (A) 7 for maximal classes A of Pk have. In the last section of Chapter 8, the reader finds “strategies” for the determination of “manageable” sublattices of Lk . In addition, two examples of theorems prove how one can determine certain sections of Lk . Chapter 9 deals with homomorphic mappings from a subclass of Pk onto a 5 6 7
A Sheffer function is a function that every function of Pk can be formed from by means of the superposition operations. This is a function f ∈ Pk \ [Pk1 ] with Im(f ) = Ek . L↓k (A) denotes the set of all subclasses of A.
Introduction
9
subclass of Pk , As generally accepted,8 one can characterize every homomorphism from a class A through a certain congruence relation9 on A. After some basic concepts are defined, all congruences on the subclasses of P2 are determined in Chapter 9. It is the aim of the sections following then, to specify the general homomorphism theorem for function algebras and to find statements on the number of congruences on a subclass of Pk through determination of some general properties of the congruences on subclasses of Pk . Then, all congruences are determined for selected classes (among other things, these are the maximal classes of Pk and certain classes from linear functions). Criteria with which one can find out whether on a partial class of Pk only trivial congruences exist are in addition derived. A further section deals with the connection between clone congruences and the fully invariant congruences on free algebras. The theorem found in this case has interesting inferences and is a bridge between certain investigations in the Universal Algebra and certain investigations in the theory of the function algebras. At the end of this chapter, one can find some results on automorphisms. It is proven that Pk , the subclasses of P2 , and the maximal classes of Pk have only inner automorphisms. The starting point and the basis of subsequent results are derived from an article by A. I. Mal’tsev (see [Mal 66]). Important contributions to the topic of Chapter 9 are also performed by V. V. Gorlov and I. A. Mal’tsev. Chapter 10 deals with the relation degree and the dimension of subclasses A of Pk . The relation degree of A is the smallest number h so that the class A is unambiguously described by a relation set whose elements have the arity h at most. The dimension of A is the smallest arity of a relation that characterizes the class A unambiguously. Chapter 10 begins by investigating the connections between these two complexity measures of the relational description of classes. After that, the relation degrees and dimensions of the Post’s classes, which were found by G. N. Blochina in [Blo 70], are proven. In Section 10.3, one can find further classes for which one knows the relation degree or the dimension. Chapter 11 deals with a further measure (the so-called order of a class), with whose aid the complexity of a description of a subclass of Pk can be characterized. If the class A ⊆ Pk is finitely generated, we call the smallest number r with [A(n) ] = A the order of A. In the case that the subclass A ⊆ Pk is not finitely generated we write ord A = ∞. Section 11.1 shows that one can determine the order easily for a class, if one knows the subclasses of the treated class. Therefore, order statements are often the “by-products” of considerations, which were actually used for determining certain classes or 8 9
See also Chapter 4 of Part I. Those ones are the equivalence relations, which are compatible with the superposition operations on the considered class.
10
Introduction
sublattices of Pk . So, for example, the orders of the Post’s classes result from the considerations of Chapter 3 for verification of the Post’s lattice. Further order statements are found in Chapters 13 and 14. Therefore, in Chapter 11, only the statements on the maximal classes that are described in Chapter 5 are determined. It is proven that, for k ≥ 3, each maximal class of the type S, U, L, B or C1 has the order 2 and that, for the order of a class of the type Ch , where h ≥ 2, the arity h of the descriptive relation of this class is an upper bound. If M ⊂ Pk is a maximal class of the type M, we can only prove that M has the order 2 for the cases 2 ≤ k ≤ 7 and for case that the descriptive binary relation of M has certain properties. For k ≥ 8 there are maximal classes of the type M that do not have a finite order. To prove this fact, we give an example, published by G. Tardos in [Tar 86]. If one has a finite generating class A, it is an interesting problem to clarify which cardinalities are possible for the bases of this class A. In Section 11.2 we show that the proof for ord P olk ≤ 3, where ∈ C1k ∪ Uk ∪ Sk , implies the existence of functions f with [f ] = P olk . Following corresponding notation for functions from Pk , such function f is called a Sheffer function for P olk . The last section explains shortly, as one can determine the cardinalities of the possible bases of the class A, if ord A < ∞. Furthermore, some basic ideas of [Miy 71], [Miy-S-L-R 86], [Miy 88], and [Sto 87] are explained on basis classifications. For more information on the topic, we direct the reader to [Miy 88] and [Sto 87] of M. Miyakawa and I. Stojmenovic. Chapter 12 summarizes the subclasses of the class Pk,2 := {f ∈ Pk | f has only values of the set {0, 1} }, which were found by G. Burosch, J. Dassow, N. Gr¨ unwald, W. Harnau, and the author. When one restricts the domain of a function f (n) ∈ Pk,2 to the set E2n , a homomorphic mapping pr (“projection”) from Pk,2 onto P2 can be defined. Since the image prA of a subclass A of Pk,2 is a subclass of P2 and the subclasses of P2 are known, one can hope to find of certain properties of the inverse images (⊆ Pk,2 ) through the known properties of the images (⊆ P2 ). This hope confirmed itself in a certain sense (see, e.g., Theorem 12.2.5 and Theorem 9.7.6). Conversely, Pk,2 , k ≥ 3, also reflects the negative properties of Pk because the examples of classes from Section 8.1.1 with infinite and without bases are subclasses of Pk,2 . Further, the functions of Pk,2 are important since they can be interpreted as predicates. Chapter 12 is organized as follows: Section 12.1 contains the basic concepts and notations. Section 12.2 contains results on inverse images of subclasses of P2 (with respect to the above projection). The remaining sections deal with the determination of cardinality and with the determination of the elements
Introduction
11
Fig. 2. A survey on |Nk (B)| for B ∈ L2
of the set Nk (B) := {A | A is a subclass of Pk,2 with pr A = B} for arbitrary subclass B of P2 . In Section 12.3, one can find some structure statements about the lattice of all subclass of Pk,2 . It is also clarified in this section whether the set Nk (B) is finite or infinite or has the cardinality of continuum. Section 12.4 generalizes some statements from Section 12.3 for Pk,l with 2 ≤ l < k. In Section 12.5, the maximal and the submaximal classes of Pk,2 are determined. Then, the investigations are continued from Section 12.3 for k = 3, i.e., for many classes B ⊆ P2 with |N3 (B)| ≤ ℵ0 the elements of the set N3 (B) are determined. Figure 2 shows a survey of the obtained results. This figure shows the Post’s graph, where the knots of this graph are differently labeled. If a class B of P2 is marked in this graph through , this means that the set Nk (B) has the cardinality of the continuum. The second marker means that |Nk (B)| ≥ ℵ0 and |N3 (B)| = ℵ0 are valid. For the remaining classes B whose knots do not have any marker the set Nk (B) is finite for arbitrary k ∈ N. Chapter 13 deals with classes of linear functions of Pk , i.e., with closed subsets of the set
12
Introduction
Lk :=
n≥1
{f (n) ∈ Pk | ∃a0 , ..., an ∈ Ek : f (x) = a0 +
n
ai · xi (mod k)}.
i=1
The lattice of the subclasses of Lk belongs to the earliest and best investigated sublattices of Lk . For the case that k is a prime number, all subclasses, which are no subsets of [L1k ], were determined by A. A. Salomaa in [Sal 64]. The results of [Sal 64] were proven by J. Bagyinszki and J. Demetrovics in [Bag-D 82] and complemented with the remaining subclasses of [L1k ], p ∈ P. ´ Szendrei. For examMany results about linear functions were obtained by A. ple, she proved in [Sze 78] that Lk has only finitely many subclasses, if k is square-free. In addition, she showed that an arbitrary class has, at most, the order 2 (or 3), if k is quare-free and k is an odd number (or an even number), respectively. For the case that k is not square-free, one easily finds a class that does not have any finite basis, whereby the set Lk has infinitely-many subclasses in this case. Section 13.1 starts with properties of certain subclasses of the set (n) := ∈ Lk | ∃a0 , ..., an ∈ Ek ∃j ∈ {1, ..., n} : Ud n≥1 {f f (x) = a0 + aj · xj + d · i=1,i=j ai · xi }. This set is closed, if d is a divisor of k (notation: d | k). Then, with the aid of the results from the first section new proofs are indicated for the theorems of [Sal 64] and [Bag-D 82] in Section 13.2. Chapter 13 ends with a survey on further results about linear and quasi-linear functions. Chapter 14 is the first chapter in this book of this book that deals only with submaximal classes. A subclass (or a subclone) of Pk is called submaximal if it is covered by a maximal class (clone). The concept submaximal class was introduced by I. G. Rosenberg in [Ros 74]. In [Ros 74] one finds also the first results about submaximal classes of Pk (see Chapter 17 for details). The submaximal classes are interesting not only because of their position in the second layer below Pk , but also because further completeness criteria for Pk result from a list of all submaximal classes. For arbitrary k, the full list of the maximal classes of a maximal class A of Pk is only known if A has the type S ([Ros-S 84], see Section 18.1), C1 (see Chapters 16 and 17) or A = P olk , 2 ∪ {(k − 1, k − 1)} (see Section 18.3). There are, however, where := Ek−1 some papers, in which one finds submaximal classes for specific k or only such submaximal classes that contain certain functions. In Section 14.1, one finds a complete description of all submaximal classes of P3 and some remarks about generalizations of the indicated theorems. The following papers provide a basis for this description: [Mac 79], [Mar-D-H 80], [Sal 64], [Bag-D 82] and [Lau 82a]. The theorems from Section 14.1 are proven then in Sections 14.2 – 14.9. In Section 14.10, we will prove that there are 5 submaximal classes with finitely many subclasses; 7 have countably many
Introduction
13
subclasses, and the remaining 146 submaximal classes have uncountably many subclasses. All elements of the lattices L↓3 (A), where A is a submaximal class with|L↓3 (A)| ≤ ℵ0 are determined in Chapter 15. Chapter 15 gives all finite or countably infinite sublattices of depth 1 or 2 of the lattice of the subclasses of P3 , where the finite cases are easy conclusions from Chapter 13. We say that the lattice L↓k (A) of subclasses of A = [A] ⊆ Pk has the depth t, if t is the least integer for which there are some classes A1 , ..., At−1 ∈ Lk with A ⊂ A1 ⊂ A2 ⊂ ... ⊂ At−1 ⊂ Pk . For k = 3 by the Theorems 13.2.3 and 8.1.6 there exist finite and countably infinite sublattices of the depth 1 or 2. In Chapter 15 these sublattices shall be determined exactly. The finite lattices L↓3 (L3 ) of depth 1 are found in Section 15.1. This lattice is a conclusion from Chapter 13. In addition, by Section 14.10, this lattice is the only finite lattice of depth 1 and, further, this lattice contains all finite sublattices of L3 of depth 2. Because of Theorem 14.10.1, there are exactly 7 submaximal classes with |L↓3 (A)| = ℵ0 . One obtains these classes through formation of isomorphic pictures of the following two classes: (1) L3 = [P3 ] ∪ n≥1 {f (n) ∈ P3 | ∃f0 , f1 , ..., fn ∈ P31 : f (x1 , ..., xn ) = f0 (f1 (x1 ) + f2 (x2 ) + ... + fn (xn ) (mod 2))} and M :=
{f (n) ∈ P3 | ∃f1 , ..., fn ∈ O1 : f (x1 , ..., xn ) = f1 (x1 ) ∨ ... ∨ fn (x)},
n≥1
where O1 is the set of all unary monotonous functions (in respect to the total order 0 < 1 < 2) of P3 and x ∨ y := max{x, y}. Since L3 contains also all subclasses, which are generated from unary functions of P3 . First of all, the 1299 subsemigroups of the semigroup (P31 ; ) are determined in Section 15.2. The list of these semigroups is then an important aid in Section 15.3 during the determination of the remaining subclasses of L3 . In Section 15.4 one finds all subclasses of M. Chapter 16 supplies the description (coming from [Sze 91] or [Lau 82b, 95a]) of all maximal classes of the subclass P olk {a} TQ := a∈Q
of Pk for arbitrary Q with ∅ = Q ⊆ Ek , k ≥ 2. With the aid of these classes, a completeness criterion for TQ can be formulated easily. This criterion implies
14
Introduction
necessary and sufficient conditions for whether a finite algebra is semi-primal and has only trivial subalgebras. If |Q| = 1, then TQ is a maximal class of Pk and the maximal classes of TQ , given in Chapter 15, are submaximal classes of Pk . Moreover, if |Q| ≥ 2, we prove that every maximal class of TQ is an intersection of TQ with certain maximal classes of Pk or P olk {a} (a ∈ Q). Chapter 17 continues the investigations of Chapter 16 and generalizes Theorem 14.1.3. For arbitrary k, l ∈ N with 2 ≤ l ≤ k − 1 all maximal classes of P olk El are determined, where 9 relation sets are needed. It is important to note that, for the description of the maximal classes of P olk {a}, a ∈ Ek , one needs only 6 relation sets. With the help of the maximal classes of P olk El , one can easily give a completeness criterion for P olk El . The proofs given in Chapter 17 resemble those ones from Chapter 6, i.e., the results of this chapter were achieved with the means developed by I. G. Rosenberg in [Ros 70a]. Chapter 18 gives a survey (partial without proof) over further submaximal classes found until now. In supplement to Chapters 16 and 17, all submaximal classes of a maximal class of the type S are described in this chapter. It is shown, then, how one can prove the special case k ∈ P of this general description easily. The rest of this chapter deals with submaximal classes of Pk that lie below a maximal class of the type U. In Section 18.2, one can find some maximal classes of P olk , where ∈ Uk is arbitrary. Then, in Section 18.3, the list is completed from Section 18.2 to the list of all maximal classes 2 ∪ {(k − 1, k − 1)} . of P olk for = Ek−1 Chapter 19 Chapter 19 deals with classes of Lk , which are either direct predecessors of the empty set (so-called minimal classes) or which are direct predecessors of the set of all projections (so-called minimal clones). Consequently, it is not difficult to determine the minimal classes. However, for the minimal clones, only partial results can be given. In Chapter 19, one finds a description of all minimal classes. Moreover, Rosenberg’s classification of minimal clones is proven. At the end of Chapter 19, one finds a survey of further results about minimal clones and the description of all partial minimal clones. Chapter 20 deals with partial function algebras. A partial n-ary function k the set on Ek is a mapping from a subset of Ekn into Ek , n ∈ N. Let P of all such functions with n ∈ N. Then one can introduce certain modified k of all partial functions on Ek . Then, the Mal’tsev-operations over the set P set Pk , together with these operations, forms a so-called (full) partial function k ; τ, ζ, ∆, ∇, ), which can similarly be examined like the function algebra (P algebra (Pk ; τ, ζ, ∆, ∇, ). The choice of results on partial function algebras in this chapter focuses on questions already treated for Pk in previous chapters.
Introduction
15
After a composition of some basic concepts in Section 20.1, Section 20.2 shows k is isomorphic to a certain sublattice that the lattice of all partial clones of P of the lattice of all clones of Pk+1 . Thus, one gets many properties of the partial clones from the properties of the clones, which were already found. However many results on clones that may be helpful to find certain partial clones with the aid of the above-mentioned isomorphism are missing. One k with the help could, for example, not solve the completeness problem for P of an isomorphism. In Section 20.3, we show how to describe partial clones by relations. Sections 20.4 and 20.5 deal with the maximal partial clones, with whose help, as for Pk , the completeness problem of the partial logic is soluble. We will 3 has exactly 58 maximal partial clones. In 2 has exactly 8 and P prove that P k for arbitrary Section 20.5, there is a complete list of all maximal clones of P k ∈ N, found by L. Haddad and I. G. Rosenberg. The list is given without proof. In Section 20.6, we determine those descriptive relations of the maximal clones of Pk , which are also descriptive relations of the maximal partial clones k . In addition, we survey those papers that deal with the determination of of P the orders of maximal partial clones. Section 20.7 deals with the determinak | C = [C] ∧ C ∩ Pk = A}, tion of the cardinality of the set I(A) := {C ⊆ P where A is an arbitrary maximal clone of Pk . We will prove that, if A has the type U, S or C, I(A) is a finite set. On the other hand, the set I(A) has the cardinality of continuum if A has the type L or B. For the type M we can give only partial results. Section 20.8 surveys of the cardinalities of the sets I(A), where A is an arbitrary subclass of P2 . In the last section we determine the congruences on the maximal partial k has exactly 4 congruences, whereas clones. It is proven, particularly, that P a maximal partial clone has exactly 4, 8, or 10 pairwise distinct congruences. Finally, one can find some technical references: As already noted, the chapters of this book are not continuously numbered, except for the chapters of the first and second part. References to parts, chapters, sections, lemmas, theorems, ... are given through their numbers. If a reference of the first or second part is missing, then the part discussed is referred to. About the basics of Universal Algebra there are many publications and books. Therefore, only some references for the theorems are given in Part I of this text. In Part II of the book, references for a theorem are left out only if one can prove the theorem easily and if there are several references for this theorem. Normally, one finds references at the beginning of the chapters and with the theorems, whereby it is also clear that the lemmas appertaining to these theorems are based on considerations from the quoted references. For some few theorems, the proofs are taken over from the quoted references directly.
16
Introduction
However new and shorter proofs are presented particularly for theorems that come from older books. The end of a proof (or of a statement with easy proof) is marked by . Some book parts that can be ignored during the first reading differ from the remaining text through a smaller writing.
Preliminaries
We assume that the reader has some knowledge about the basic concepts from the set theory1 , linear algebra, classical algebraic structures and mathematical logic. The following is a list of terms to which we assume the reader is familiar. 1) Logical Symbols So that we can write down mathematical statements quickly and correctly, we use the following symbols from mathematical logic:
symbol
denotation for
∧
and
∨
or
¬
not
=⇒
implies; if - then
⇐⇒
if and only if; iff
:= :⇐⇒
equal by definition equivalent by definition
∃
there exists; it exists at least
∃!
it exists exactly
∀
for all
In order to save parentheses, we write instead of ∃x ( E ) (read: “There exists an x with the property E”) shortly ∃x : E. We arrange analogous one for 1
A naive theory of sets is sufficient for our purposes.
18
Preliminaries
formulas that contain the sign ∀. In addition, ∀x ∃y ... stands for ∀x (∃y (...)), and so forth. 2) Symbols and Concepts of the Set Theory In dealing with sets, we use the following standard notations: membership (∈), nonmembership (∈), set-builder notations ({.... | ...........} 2 ), the empty set (∅), (⊆), proper inclusion (⊂), intersection (∩ inclusion (⊆), noninclusion and ), union (∪ and ) and difference (\). The power set of a set A is the set {B | B ⊆ A} of all subsets of A. It is denoted by P(A). N, N0 , Z, Q, R, C denote respectively the set {1, 2, 3, ....} of all natural numbers, the set N ∪ {0}, the set of all integers, the set of all rational numbers, the set of all real numbers, and the set of all complex numbers. For n ∈ N, we write the order n-tuples (briefly n-tuples) in the form (x1 , x2 , ..., xn ). For two n-tuples x := (x1 , x2 , ..., xn ) and y := (y1 , y2 , ..., yn ) is x = y iff xi = yi for all i ∈ {1, 2, ..., n}. A × B is the set of all 2-tuples (a, b) with a ∈ A and b ∈ B and is called the (Cartesian or direct) product of the sets A and B. For n ∈ N, Π1n Ai (or Πi∈I Ai , where I := {1, 2, ..., n}) denotes the set of all (a1 , a2 , ..., an ) with ai ∈ Ai for all i ∈ I. 3 Further, let An := {(a1 , ..., an ) | ∀i ∈ {1, 2, ..., n} : ai ∈ A} be the direct n-powers of the set A, n ∈ N. A correspondence F of A into B is a subset of A × B, where D(f ) := {a ∈ A | ∃b ∈ B : (a, b) ∈ F } is the domain of F and Im(f ) := {b ∈ b | ∃a ∈ A : (a, b) ∈ F } is the image (or range) of F . If D(F ) = A, then F is a correspondence from F . If Im(F ) = B, then we say that F is a correspondence onto B. The inverse (or converse) F −1 of a correspondence F ⊆ A × B is given by F −1 := {(b, a) ∈ B × A | (a, b) ∈ F }. If F ⊆ A × B and G ⊆ B × C, then the correspondence product F G is defined by F G := {(a, c) ∈ A × C | ∃b ∈ B : (a, b) ∈ F ∧ (b, c) ∈ G}. We remark that (F G)−1 = G−1 F −1 and is associative. A mapping (or map) f from A into B is a subset of A × B such that for each a ∈ A there is exactly one b ∈ B with (a, b) ∈ f . If f is a mapping from A into B, then we write f : A −→ B and, if (a, b) ∈ f , f (a) = b, or a → b. A mapping f : A −→ B is called injective (or is an injection) iff f (a) = f (a ) implies a = a for all a, a ∈ A. The mapping f : A −→ B is surjective (or is a surjection) iff Im(f ) = B. The mapping f : A −→ B is bijective (or is a bijection) iff is both injective and surjective. Let A be a set and n ∈ N. Then, an n-ary relation on A (or an n-ary 2 3
For example, we write S := {x | x ∈ A ∧ P (x)} or briefly S := {x ∈ A | P (x)} instead of “S is the set of all x ∈ A with the property P (x)”. For arbitrary I, we will define Πi∈I Ai in Part I, Section 5.
Preliminaries
19
relation over A) is a subset of An . A 2-ary , 3-ary or 4-ary relation on A is called respectively a binary, ternary or quaternary relation on A. Two sets A and B have the same cardinality (in symbol |A| = |B|) iff there exists a bijection from A onto B. A set A is infinite, iff there is a subset B ⊂ A with |A| = |B|. A set A is called finite iff A is not infinite. If A is a finite set, then |A| denotes the number of elements of A, i.e., |∅| = 0 and |x ∪ {x}| = |x| + 1 (or n = |{0, 1, 2, ..., n − 1}| for all n ∈ N0 , where n is called a (finite) ordinal). We put ℵ0 := |N| and c := |R|. The set A is called countable if |A| = ℵ0 . If |A| = c, we say that A has the cardinality of the continuum. It is well-known that ℵ0 is the least infinite ordinal and that N and R do not have ∞ the same cardinality. Further, it holds |Q| = ℵ0 , |C| = c, |P(N)| = c and | n=1 An | = ℵ0 if |An | = ℵ0 for all n ∈ N.
This page intentionally left blank
Part I
Universal Algebra
This page intentionally left blank
Part I Universal Algebra
23
The Universal Algebra is a mathematical discipline, which examines so-called universal algebras, where the classic algebraic structures – such as groups, rings, and lattices – are special cases of such algebras. Roughly said, a universal algebra is nothing other than a nonempty set together with a family of finite-ary operations over this set. Although the concept universal algebra was used already at the end of the 19th century, the development of the theory Universal Algebra started only in the 1930’s. This development has two historical roots. The first root is the classical algebra and the studies of properties that have all algebraic structures (such as semigroups, groups, rings, etc.). The second root is the Mathematical Logic. In the last decades, the Universal Algebra has continued the classic examinations and has also developed new areas. An introduction to the bases of the Universal Algebra follows. The topic of the following six chapters is based on what is needed later, during the investigation of the function algebras. The first five chapters show that the Universal Algebra is a general theory of the algebraic partial disciplines. Chapter 6 treats problems with an impression of the mode of operation of the algebra and that have partial also contact points to the mathematical logic. 1 Additions to the topics can be found in [Lau 2004] 2 . In detail one can study the Universal Algebra with the aid of the following books [Bur-S 81], [Coh 65], [Den-T 96], [Den 2003], [Gr¨ a 68], [Ihr 2003], [McKM-T 87], [Wer 78]. The book [McK-M-T 87] can particularly be recommended. In the preface, we have already noted that to understand the second part of the text need not be read absolutely. Thus, readers can select for themselves the required terms and theorems from Part I, during the reading of Part II. One night notice, after reading Part II, that some examinations are special cases of general problems.
1 2
To realize this, reads [Bur-S 81] and [Ric 78]. There, one finds a continuation to the chapters of Universal Algebra of this book and additional chapters.
This page intentionally left blank
1 Basic Concepts of Universal Algebra
1.1 Universal Algebras First, we define the concept of an n-ary partial operation: Let A be a nonempty set, n ∈ N and ∅ ⊂ ⊆ An . An n-ary partial operation is a mapping f from into A. The number n is called arity of f and the arity of f is also denoted by af . To denote the arity of f we also write f (n) or briefly f n , since for content-related reasons, the interpretation is impossible of f n as Cartesian product in the following. If (a1 , ..., an ) ∈ then let f (a1 , ..., an ) be the image of (a1 , ..., an ) under an n-ary operation f . The set we call domain of f , and we denote the domain of f by D(f, A) or briefly by D(f ). Let Im(f ) be the set {f (a1 , ..., an ) | (a1 , ..., an ) ∈ D(f )}, which is called image or range of f . (n) (n) For n ∈ N let c∞ be the n-ary partial operation with D(c∞ ) = ∅.1 n If = A and n ≥ 1, then f is called an n-ary operation on A. If D(f (n) ) ⊂ An we call f (n) a proper partial operation. A nullary operation f on A is an element f of A with af := 0, D(f ) := ∅ and Im(f ) := {f }. Example The operation ◦ of a group (see also Section 1.2) is a binary operation. One can understand the formation of inverse elements in a group as a unary operation −1 and the identity e (unit element) of a group as a nullary operation. As is generally accepted, one can form compositions of mappings in the following manner: If f : M1 −→ M2 and g : M2 −→ M3 are mappings, then we denote the mapping 1
The necessity of such a definition is seen, if one forms superpositions of partial (1) functions (see Part II, Chapter 1). For example, it holds gf = c∞ for the unary operations f , g with D(f ) := {a} and a ∈ Im(g).
26
1 Basic Concepts of Universal Algebra
f g : M1 −→ M3 , x → g(f (x)) by f g. It is well-known (or it is easy to see) that is associative. Thus we can renounce the putting of brackets in the case of more than two compositions. Furthermore, we write g1 g2 ...gr instead of
g1 g2 ...gr (gi : Mi −→ Mi+1 , i = 1, ..., r),
if the operation follows from the context. We notice that the above definition of is a special case of the following definition, if one writes the mappings in the form of subsets of Cartesian products: Let R ⊆ A × B and Q ⊆ B × C. Then let RQ := {(a, c) | ∃b ∈ B : (a, b) ∈ R ∧ (b, c) ∈ Q}. With the help of the partial operations, we can define the following concepts: A partial algebra is an ordered pair A := (A; F ), where A is an arbitrary nonempty set and F is a set of partial operations on A. The set A is called universe (or underlying set) of A. The elements of F are called (partial) fundamental operations of A. A universal algebra or briefly an algebra is a partial algebra (A; F ), where every element of F is an operation, i.e., F does not have any proper partial operations. Here we usually only deal with algebras. Therefore, we often introduce the following concepts only for algebras. If F = {f1 , ..., fr } holds we write (A; F ) in the form (A; f1 , ..., fr ), where we often choose af1 ≥ af2 ≥ ... ≥ afr . We also use the notation (A; (fi )i∈I ), if F = {fi | i ∈ I} and I is a certain index set. A (partial) algebra (A; F ) is called finite, if A is a finite set, otherwise infinite. In order to receive a first classification of the algebras, it offers itself to carry out a classification according to the arities of the (partial) operations of the algebras. For this purpose, we define the concept type of an algebra (A; (fi )i∈I ) as a sequence
1.2 Examples of Universal Algebras
27
τ := (afi | i ∈ I) of the arities of their fundamental operations, if I is a finite or countable set. In the case that I is uncountable, we define as type of A the mapping τ : I −→ N, i → afi . If I is a finite set, then (A; (fi )i∈I ) is called of finite type. If A = (A; f1 , ..., fr ), af1 ≥ af2 ≥ ... ≥ afr , then let τ = (af1 , af2 , ..., afr ). Two (partial) algebras (A; F ), (B; G) are of same type, iff there is a bijection ϕ : F −→ G, f → g with af = ag. Examples2 1) A semigroup (H, ◦) is an algebra of type (2) (F := {◦}). 2) By the above remark, a group is an algebra of the type (2, 1, 0). 3) A lattice (see 1.2.11) is an algebra of type (2, 2). Because of existence of a bijection between the operations of two algebras A := (A; F ) and B := (B; G) of same type, we often denote the operation sets of A and of B with the same symbol (F or G). In analog mode we deal with the denotation of the elements. If it is necessary to denote the operations of two different algebras A and B of the same type differently, then we write f A or f B (or also fA or fB ), respectively. Before we deal with further basic terms from the theory of the algebras, let’s define some specific algebras. We will study some of these specific algebras in detail later.
1.2 Examples of Universal Algebras We start with some “classical algebras”. In defining these algebras, we try to use no existence quantor. 3 We call the equations, which are given for the definition of an algebra, axioms. As usual, we will try to use only a few (independent) axioms. We differ from this principle in the following only in few places (see e.q. the definition of a lattice). 1.2.1 Gruppoids An algebra (A; ◦) of type (2) is called gruppoid. Thus, a gruppoid is not a different one as a nonempty set together with a binary operation. 2 3
Section 1.2 contains the explanations to the concepts used. In Chapter 6, we see that this manner of description has interesting conclusions. In the following, we use the descriptions of the algebraic structures given in this section.
28
1 Basic Concepts of Universal Algebra
1.2.2 Semigroups A gruppoid (H; ◦) is called semigroup if the algebra (H; ◦) fulfills the following axiom: (A)
∀x, y, z ∈ H : (x ◦ y) ◦ z = x ◦ (y ◦ z)
(associativity).
A semigroup is called commutative, if it satisfies the following condition in addition: (C) ∀x, y ∈ H : x ◦ y = y ◦ x. 1.2.3 Monoids An algebra (M ; ◦, e) of type (2, 0) is called monoid, if (M ; ◦) is a semigroup and (E) ∀x ∈ M : e ◦ x = x ◦ e = x holds. The (nullary) operation e is the the neutral element of M . 1.2.4 Groups A group is an algebra (G; ◦,−1 , e) of type (2, 1, 0), which fulfills the above axioms (A), (E) for x, y, z, e ∈ G and (I)
∀x ∈ G : x ◦ x−1 = x−1 ◦ x = e .
x−1 is called the inverse element of x. A group, which (C) fulfills in addition, is called Abelian (or commutative). It is usual in Abelean groups to use +, −x, 0 instead of ◦, x−1 , e (the additive notation). 1.2.5 Semirings An algebra (R; +, ·) of type (2, 2) is called a semiring if (R; +) is a commutative semigroup, (R; ·) is a semigroup, and if the following distributive laws hold: ∀x, y, z ∈ R : x · (y + z) = (x · y) + (x · z), (D1 ) ∀x, y, z ∈ R : (x + y) · z = (x · z) + (y · z). (D2 ) 1.2.6 Rings An algebra (R; +, ·, −, 0) of type (2, 2, 1, 0) is called ring if (R; +, −, 0) is an Abelean group and (R; +, ·) is a semiring. In order to save parentheses, we use the known rule subsequently “The dot bill is carried out before the stroke bill”. A unitary ring (or a ring with a unit element) is an algebra (R; +, ·, −, 0, 1) of type (2, 2, 1, 0, 0), where (R; +, ·, −, 0) is a ring and (E) holds with e = 1 and ◦ = ·.
1.2 Examples of Universal Algebras
29
1.2.7 Fields A partial algebra (K; +, ·, −,−1 , 0, 1) is called field if the algebra (K; +, ·, −, 0, 1) is an unitary ring and (K\{0}; ·,−1 , 1) is an Abelean group. We remark that the operation −1 on K is only a partial operation, since 0−1 is not defined. 1.2.8 Modules Let R := (R; +, ·, −, 0) be a ring. An algebra (M ; F ) where F := {+, −, 0}∪R, + is binary, 0 is a nullary and − and all r ∈ R are unary operations is called a R-module (or module over the ring R), if (M ; +, −, 0) is an Abelean group and if for all r, s ∈ R the following equations hold: (M1 ) (M2 ) (M3 )
∀x, y ∈ M : r(x + y) = r(x) + r(y), ∀x, y ∈ M : (r + s)(x) = r(x) + s(x), ∀x ∈ M : (r · s)(x) = r(s(x)).
Let M := (M ; +, −, (r)r∈R , 0) be the short notation for the R-module defined above. Further, we say that M has the type (2, 1, (1)r∈R , 0). A module over a unitary ring (R; +, ·, −, 0, 1) is an above module that also satisfies the following condition: (M4 )
∀x ∈ M : 1(x) = x.
Three remarks to the above definitions: – Instead of the unary operations r ∈ R one can also define a mapping : R × M −→ M, (r, x) → r x, which fulfills the axioms. However, a module would then not be a universal algebra. – A module has infinite many operations if the ring R is infinite. – The operation symbols +, −, 0 have two different meanings: on the one hand, they describe the operations of the Abelean group (R; +, −, 0); on the other hand, they describe the operations of the Abelean group (M ; +, −, 0). 1.2.9 Vector Spaces Let K := (K; +, ·, −, 0, 1) be a field. Then every K-module (V ; +, −, (k)k∈K , 0) is called K-vector space (or vector space over the field K). 1.2.10 Semilattices A commutative semigroup (S; ◦), in which ∀x ∈ S : x ◦ x = x holds, is called semilattice.
30
1 Basic Concepts of Universal Algebra
1.2.11 Lattices A lattice is an algebra (L; ∨, ∧) of type (2, 2), in which for arbitrary x, y, z ∈ L it holds: (L1 ) x ∨ y = y ∨ x, x ∧ y = y ∧ x (L2 ) x ∨ (y ∨ z) = (x ∨ y) ∨ z, x ∧ (y ∧ z) = (x ∧ y) ∧ z (L3 ) x ∨ x = x, x ∧ x = x (L4 ) x ∨ (x ∧ y) = x, x ∧ (x ∨ y) = x
(commutativity), (associativity), (idempotency), (absorption).
A bounded lattice (or a lattice with 0 and 1) is an algebra (L; ∨, ∧, 0, 1) of type (2, 2, 0, 0) such that (L; ∨, ∧) is a lattice and furthermore the following equations hold for all x ∈ L: (L5 )
x ∧ 0 = 0, x ∨ 1 = 1.
A lattice is called distributive, if the following distributive laws hold: (DL1 ) (DL2 )
∀x, y, z ∈ L : x ∧ (y ∨ z) = (x ∧ y) ∨ (x ∧ z), ∀x, y, z ∈ L : x ∨ (y ∧ z) = (x ∨ y) ∧ (x ∨ z).
Remark: One can show (with the help of (L1 )–(L4 )) that (DL1 ) and (DL2 ) are equivalent; that is, it suffices to require either (D1 ) or (D2 ) in the definition of a distributive lattice. 1.2.12 Boolean Algebras An algebra (B; ∨, ∧,− , 0, 1) of type (2, 2, 1, 0, 0) is called Boolean algebra if (B; ∨, ∧, 0, 1) is a bounded distributive lattice and the following equalities hold for all x ∈ B: (B1 ) (B2 ) where x :=
−
x ∧ x = 0, x ∨ x = 1 x ∧ 0 = 0, x ∨ 1 = 1,
(x).
1.2.13 Function Algebras One can choose the set of all operations defined on A as a universe of an algebra and can then define operations on the operations on A. For the purpose of distinction we will subsequently replace the concept “operation (on the set A)” by the concept “function (on the set A)”. In Part II, the set A is always a finite set. Therefore, the following concepts become explained only for a specific k-element set Ek . Put Ek := {0, 1, ..., k − 1},
1.3 Subalgebras
31
k ∈ N\{1}. Let Pkn be the set of all n-ary functions f n , which map the n-fold n n Cartesian product Ek into Ek . Put Pk := n≥1 Pk . Elementary operations (called Mal’tsev-operations) over Pk are ζ, τ, ∆, ∇ (unary operations) and (a binary operation) defined by (ζf )(x1 , ..., xn ) := f (x2 , x3 , ..., xn , x1 ), (τ f )(x1 , ..., xn ) := f (x2 , x1 , x3 , ..., xn ), (∆f )(x1 , ..., xn−1 ) := f (x1 , x1 , x2 , ..., xn−1 ) if n ≥ 2, ζf = τ f = ∆f := f if n = 1, (∇f )(x1 , ..., xn+1 ) := f (x2 , x3 , ..., xn+1 ), (f g)(x1 , ..., xm+n−1 ) := f (g(x1 , ..., xm ), xm+1 , ..., xm+n−1 ) (f n , g m ∈ Pk ). It holds the following (see Part II, Chapter 1): With the help of the Mal’tsev-operations, one can form the following operations (for arbitrary functions and arbitrary variables of the functions): – permutation of variables – identification of variables – adding of fictitious variables and – substitution of variables of a function by functions The set of all functions that can be obtained by a finite number of applications of the above operations from the functions of F ⊆ Pk is called the closure of F , and is denoted by [F ]. If F = [F ], then we say that F is closed or F is a (sub)class of Pk . The algebra (Pk ; ζ, τ, ∆, ∇, ) of type (1, 1, 1, 1, 2) is called (full) iterative function algebra. If A is a subclass of Pk then (A; ζ, τ, ∆, ∇, ) is called function algebra.
1.3 Subalgebras Let A = (A; F ) be a (partial) algebra and let B be a nonempty subset of A. The (partial) algebra B = (B; F ) of the same type as A is called (partial) subalgebra of A (or A is an extension of B) iff it holds D(fB , B) ⊆ D(fA , A) for arbitrary f ∈ F and fA (x1 , ..., xaf ) = fB (x1 , ..., xaf ) for all (x1 , ..., xaf ) ∈ B af ∩ D(f, A). Then we write
32
1 Basic Concepts of Universal Algebra
B ≤ A. If A has a nullary operation f ∈ A and B is a subalgebra of A, then f also belongs to B. The following lemma summarizes easy consequences from the above definition of a subalgebra. Lemma 1.3.1 (a) A subset B of the universe A of an algebra (A; F ) together with the restrictions f|B of the operations f of A to B forms an algebra if and only if f (b1 , ..., baf ) ∈ B for all b1 , ..., baf , if af ≥ 1, and f ∈ B if af = 0 holds for arbitrary f ∈ F . (b) Let I bean arbitrary index set, Bi ≤ A for every i ∈ I and i∈I Bi = ∅. Then ( i∈I Bi ; F ) is a subalgebra of A. (c) For every nonempty subset T of the universe A of an algebra A = (A; F ) there exists exactly one smallest subalgebra T of A, which contains T and which one can describe as follows: T = (T ; F ) with T := {B | B ≤ A and T ⊆ B}.
The set T from Lemma 1.3.1, (c) is called generating system of the algebra T and the universe T of T is denoted by [T ]A or [T ]F or by [T ]f1 ,...,fr , if F = {f1 , ..., fr }, or simply by [T ]. Example For the algebra A = ({0, 1, 2, ..., k − 1}; f ) of the type (3) with f (x, y, z) = x + y − z (mod k) for arbitrary x, y, z ∈ A, it holds e.g. [{a}] = {a} for every a ∈ A and [{0, 1}] = A. If [T ] = T for a subset T ⊆ A of an algebra A = (A; F ), then we say that T is closed. The following lemma gives another possibility of the description of the set [T ], defined above. Lemma 1.3.2 Let A = (A; F ) be an algebra, T be a subset of A and F 0 be the set of all nullary operations of F . Then, for T we can define recursively the following subsets Tn of A as follows: T0 := T ∪ F 0 Tn+1 := Tn ∪ {f (g1 , ..., gaf ) | f ∈ F \F 0 and {g1 , ..., gaf } ⊆ Tn } (n ∈ N0 ).
1.3 Subalgebras
Then
[T ]A =
Tn .
n≥0
Proof. To prove “⊆” in (1.1), we have to show that
33
(1.1)
is the universe of n≥0 Tn a subalgebra of A. This would be shown if we have shown that n≥0 Tn is closed regarding the application of all operations of F \ F 0 . Now let f ∈ F \ F 0 and {g1 , ..., gaf } ⊆ n≥0 Tn be arbitrary. Since af ∈ N, there is an m ∈ N with {g1 , ..., gaf } ⊆ Tm . Consequently, f (g1 , ..., gaf ) belongs to Tm+1 , i.e., the set n≥0 Tn is closed. “⊇” follows from Tn ⊆ [T ]A for all n ≥ 0. This inclusion is easy to prove by induction on n, since [T ]A is the universe of a subalgebra of A.
The set
S(A) := {B | B is subalgebra of A} ∪ {∅}
we call briefly set of all subalgebras of A. Per definitionem (essentially for technical reasons) is also the empty set a subalgebra of each algebra. Then (as the reader can easily verify) S(A) together with the operations ∧ : S(A) × S(A) −→ S(A), B1 ∧ B2 = (B1 ∩ B2 ; F ) ∨ : S(A) × S(A) −→ S(A), B1 ∨ B2 = ([B1 ∪ B2 ]F ; F ) forms a lattice.4
4
This property would not hold for all algebras, if the empty set was not an algebra.
This page intentionally left blank
2 Lattices
Lattices arise often in algebraic investigations. In the following we see that the concept “lattice” is always needed, if the elements of sets are ordered in a certain meaning. In addition, the lattice theory is an interesting branch of the Universal Algebra. For space reasons, only the most important basis concepts and some proof ideas of the lattice theory can be indicated here. For a secondary study of the lattice theory, refer to the books on the Universal Algebra and to [Bir 48], [Ern 82], [Sko 73] and [Dav-P 90].
2.1 Two Definitions of a Lattice There are two standard ways of defining lattices. One of these ways was already given in Section 1.2.11: Definition (First Definition of a Lattice) Let L be a nonempty set on which the binary operations ∨ (called “join”) and ∧ (called “meet”) are defined. (L; ∨, ∧) is called lattice if for arbitrary x, y, z ∈ L the following identities hold: (L1 a) x ∨ y = y ∨ x, (L1 b) x ∧ y = y ∧ x
(commutativity),
(L2 a) x ∨ (y ∨ z) = (x ∨ y) ∨ z, (L2 b) x ∧ (y ∧ z) = (x ∧ y) ∧ z
(associativity),
(L3 a) x ∨ x = x, (L3 b) x ∧ x = x
(idempotency),
(L4 a) x ∨ (x ∧ y) = x, (L4 b) x ∧ (x ∨ y) = x
(absorption).
36
2 Lattices
Since one receives an axiom again by exchanging of ∨ and ∧ in above axioms, results from every equation, which the axioms imply, by exchanging of ∨ and ∧ a further valid equation. One names this procedure of deriving equations in lattices, using the duality principle of the lattice theory. In the following proofs we often use the equivalence x ∨ y = y ⇐⇒ x ∧ y = x,
(2.1)
which is a conclusion from the absorption laws and from the commutative laws. For the second definition of a lattice we need some concepts and notations: Definitions • A binary relation ≤ (⊆ A × A) is called a partial order on the set A, if it fulfills the following conditions: (O1 ) ∀a ∈ A : a ≤ a (reflexivity), (O2 ) ∀a, b ∈ A : (a ≤ b and b ≤ a) =⇒ a = b (antisymmetry), (O3 ) ∀a, b, c ∈ A : (a ≤ b and b ≤ c) =⇒ a ≤ c (transitivity). • The pair (A; ≤), where ≤ satisfies the above conditions, we call partially ordered set or, briefly, poset. In examples, we often declare the posets through order diagrams1 (or Hasse diagrams). • A poset P := (P ; ≤) with P ⊆ A × A, which besides fulfills the condition (O4 ) ∀a, b ∈ A : a ≤ b or b ≤ a , is called totally ordered set or linearly ordered set or, briefly, chain. We also use the notation a < b if a ≤ b and a = b is valid, where (L; ≤) is a poset and a, b ∈ L. We also write b ≥ a instead of a ≤ b. Definition Let Q be a subset of P , where P = (P ; ≤) is a poset. The element s ∈ P is said to be a supremum of Q (denoted by sup Q) iff s has the following properties: (S1 ) ∀q ∈ Q : q ≤ s; (S2 ) ∀p ∈ P ((∀q ∈ Q : q ≤ p) =⇒ s ≤ p). Remark The supremum of Q does not exist in general for every subset Q of a poset P . Let e.g. P = {0, 1, 2, 3, 4} and let ≤ defined by the following order diagram: 1
Here, the elements of the poset are represented as points in the plane and, if x < y and no z exists with x < z < y, we draw y higher up than x and connect x and y with a line segment.
2.1 Two Definitions of a Lattice
37
4 2 3 0 1 Fig. 2.1
Then, sup{0, 1} does not exist, since for p ∈ {2, 3} 0 ≤ p and 1 ≤ p are valid, the elements 2 and 3 are not comparable in respect to ≤. Definition Let Q be a subset of P , where P = (P ; ≤) is a poset. The element i ∈ P is said to be an infimum of Q (denoted by inf Q) iff i has the following properties: (I1 ) ∀q ∈ Q : i ≤ q; (I2 ) ∀p ∈ P ((∀q ∈ Q : p ≤ q) =⇒ p ≤ i). Definition (Second Definition of a Lattice) A poset L := (L; ≤) is called lattice iff for arbitrary a, b ∈ L both sup{a, b} and inf{a, b} in L exist. Some elementary properties of sup and inf in a lattice are summarized in the following lemma: Lemma 2.1.1 Let (P ; ≤) be a lattice by the second definition. Then, for arbitrary x, y, z, u, v ∈ P it holds: (a) x ≤ y =⇒ sup{x, z} ≤ sup{y, z}, (b) x ≤ y =⇒ inf{x, z} ≤ inf{y, z}, (c) (x ≤ y and u ≤ v) =⇒ sup{x, u} ≤ sup{y, v}, (d) (x ≤ y and u ≤ v) =⇒ inf{x, u} ≤ inf{y, v}. Proof. (a) and (b) are easy to check. (c): Let x ≤ y and u ≤ v. Then by (a) it holds sup{x, u} ≤ sup{y, u} and sup{y, u} ≤ sup{y, v}. Since ≤ is transitive, by this (c) follows. One can prove (d) analogously to (c). The next theorem shows how the two lattice definitions are associated. Theorem 2.1.2 It holds: (a) If (L; ∨, ∧) is a lattice by the first definition, then one can define by a ≤ b :⇐⇒ a = a ∧ b
(2.2)
a partial order ≤, which together with L forms a lattice by the second definition.2
38
2 Lattices
(b) Conversely, if (L; ≤) is a lattice by the second definition, then one can define two binary operations ∨, ∧ by a ∨ b := sup{a, b} a ∧ b := inf{a, b}
and
and (L; ∨, ∧) is a lattice by the first definition. Proof. (a): Let (L; ∨, ∧) be a lattice and ≤ is defined by (2.2). Then a ∧ a = a
holds and thus a ≤ a for every a ∈ A. Hence ≤ is reflexive. If a ≤ b and b ≤ a, we have a = a ∧ b and b = b ∧ a. This and (L1 b) imply a = b. Thus ≤ is antisymmetric. Let now a ≤ b and b ≤ c. Then it holds a = a ∧ b and b = b ∧ c by definition of ≤. By this and by (L2 b) we have a = a ∧ (b ∧ c) = (a ∧ b) ∧ c = a ∧ c. Hence a ≤ c and thus ≤ is transitive. It remains to show that there exist sup{a, b} and inf{a, b} for all a, b ∈ L. For these let a, b ∈ L be arbitrary. By (L4 a) and (L4 b) then we have a = a ∧ (a ∨ b) and b = b ∧ (a ∨ b). Thus a ≤ a ∨ b and b ≤ a ∨ b. Let now a ≤ u and b ≤ u for a certain u ∈ L. Then the following equations hold: a = a ∧ u, b = b ∧ u, a ∨ u = (a ∧ u) ∨ u = u, b ∨ u = (b ∧ u) ∨ u = u, and (a ∨ b) ∨ u = (a ∨ u) ∨ (b ∨ u) = u ∨ u = u. If one uses the equation (a ∨ b) ∨ u = u, which just was proven, then one gets: (a ∨ b) ∧ u = (a ∨ b) ∧ ((a ∨ b) ∨ u) = a ∨ b. Therefore, we have a ∨ b ≤ u and sup{a, b} = a ∨ b holds by definition of sup. Analogously, one can show a ∧ b = inf{a, b}. For this, one mixed up ∧ in above considerations by ∨ and one replaced ≤ by ≥. Thus (L; ≤) is a lattice. (b): Let (L; ≤) be a lattice, a ∨ b := sup{a, b} and a ∧ b := inf{a, b}. Obviously, the so defined operations ∨ and ∧ are commutatively and idempotent. To show the validity of the associative law sup{x, sup{y, z}} = sup{sup{x, y}, z} one can prove (under use of Lemma 2.1.1) sup{x, sup{y, z}} ≤ sup{sup{x, y}, z} and sup{x, sup{y, z}} ≥ sup{sup{x, y}, z}. Analogously, one can show the associativity of inf. Because of sup{x, inf{x, y}} ≥ x and sup{x, inf{x, y}} ≤ x it holds obvious sup{x, inf{x, y}} = x. Analogously, one can show another absorption law. Consequently, (L; ∨, ∧) is a lattice by the first definition. 2
Because of (2.1) one also could have defined the following: a ≤ b :⇐⇒ a ∨ b = b.
2.3 Isomorphic Lattices and Sublattices
39
Because of Theorem 2.1.2 we can use the first or the second definition of an lattice subsequently according to requirement, where the statements of the Theorem 2.1.2 are used where appropriate. If one wants the above-mentioned duality principle on inequalities of the form ... ≤ ... enlarge, one has to define the exchanging of ≤ through ≥ as an additional replacement rule. In addition the implication (x ≤ y and u ≤ v) =⇒ (x ∨ u ≤ y ∨ v and x ∧ u ≤ y ∧ v),
(2.3)
resulting from Lemma 2.1.1 and from Theorem 2.1.2, will be an important aid in the below-given proofs.
2.2 Examples for Lattices 2.2.1 Let L := {0, 1}. Further, let ∨ be the conjunction on L and let ∧ be the disjunction on L. Obviously, (L; ∨, ∧) is a lattice. 2.2.2 Let L := N0 , let a ∨ b be the least common multiple and let a ∧ b be greatest common divisor of the integers a, b ∈ N0 . In this case, it is also easy to check that (L; ∨, ∧) is a lattice. 2.2.3 Examples for lattices by the second definition are: (P(A); ⊆), where A is an arbitrary nonempty set; (R; ≤), where ≤ is the usual order on R. One finds further examples in Section 2.4 and in the following chapters.
2.3 Isomorphic Lattices and Sublattices Definition Two lattices L1 , L2 are called isomorphic, iff there exists a bijective mapping α from L1 onto L2 such that for arbitrary a, b ∈ L1 the following two equations hold: α(a ∨ b) = α(a) ∨ α(b)
and
α(a ∧ b) = α(a) ∧ α(b). The mapping α is also called an isomorphism. Definition Let (P1 , ≤) and (P2 ; ≤) be posets. A mapping α from P1 onto P2 is called order-preserving, if the following holds: ∀a, b ∈ P1 : a ≤ b =⇒ α(a) ≤ α(b). Figure 2.2 gives an example of an order-preserving mapping between the lattices L1 and L2 :
40
2 Lattices
L2
L1 Fig. 2.2
Theorem 2.3.1 Two lattices L1 and L2 are isomorphic iff there is a bijective mapping α from L1 onto L2 such that both α and α−1 are order-preserving. Proof. “=⇒”: Let α be an isomorphism from L1 onto L2 . Then for all a, b ∈ L1
it holds:
a ≤ b =⇒ a = a ∧ b =⇒ α(a) = α(a ∧ b) = α(a) ∧ α(b).
Consequently, we have α(a) ≤ α(b), i.e., α is order-preserving. Let now c, d ∈ L2 arbitrary with c ≤ d. Then there exist a, b ∈ L1 with α(a) = c and α(b) = d. That α−1 is also order-preserving follows then from c ≤ d =⇒ α(a) ≤ α(b) =⇒ α(a) ∧ α(b) = α(a) =⇒ α(a ∧ b) = α(a) =⇒ a ∧ b = a =⇒ a ≤ b. “⇐=”: Let now α be a bijective mapping from L1 onto L2 with the property that both α and α−1 are order-preserving. Then for arbitrary a, b ∈ L1 we have a ≤ a ∨ b and b ≤ a ∨ b. Thus, α(a) ≤ α(a ∨ b) and α(b) ≤ α(a ∨ b). From this, it follows α(a) ∨ α(b) ≤ α(a ∨ b). Further, for arbitrary u ∈ L2 it holds α(a) ∨ α(b) ≤ u =⇒ α(a) ≤ u and α(b) ≤ u =⇒ a ≤ α−1 (u) and b ≤ α−1 (u) =⇒ a ∨ b ≤ α−1 (u) =⇒ α(a ∨ b) ≤ u. Consequently, α(a ∨ b) = sup{α(a), α(b)} and therefore α(a) ∨ α(b) = α(a ∨ b). Analogously, one can prove α(a) ∧ α(b) = α(a ∧ b).
Remark Figure 2.2 shows that one cannot leave the condition “α−1 orderpreserving” from Theorem 2.3.1.
2.4 Complete Lattices and Equivalence Relations
41
Theorem 2.3.2 For every poset (P ; ≤) there is a set system MP such that (P ; ≤) and (MP ; ⊆) are isomorphic; i.e., there exists a bijective mapping α from P onto MP with the property that α and α−1 are order-preserving. Proof. For every p ∈ P let M (p) := {x ∈ P | x ≤ p}. Then the set MP := {M (p) | p ∈ P } is a set system with the properties claimed in the theorem. To show this, we study the mapping α : P −→ MP . α is surjective by definition. From M (a) = M (b) it follows a ∈ M (b) and b ∈ M (a). Hence a ≤ b and b ≤ a, i.e., a = b. Thus α is injective. α is order-preserving, since a ≤ b and x ∈ M (a) imply x ≤ a ≤ b. Therefore, a ≤ b implies M (a) ⊆ M (b). Furthermore, M (a) ⊆ M (b) implies a ≤ b, i.e., α−1 is also order-preserving and thus α is an isomorphism. The following definition is a special case of a definition from Section 1.3: Definition
If L is a lattice and L is a subset of L with the property ∀x, y ∈ L : x ∨ y ∈ L and x ∧ y ∈ L ,
then (L ; ∨, ∧) is called a sublattice of (L; ∨, ∧). Remark Let (P ; ≤) and (Q; ≤) be posets with Q ⊆ P . Then, it is not valid in general that (Q; ∨, ∧) is a sublattice of the lattice (P ; ∨, ∧), where ∨, ∧ are defined in Theorem 2.1.2. An example is the poset ({0, 1, 2, 3, 4}; ≤) defined by the following order diagram: 4 3 2 1 0 Fig. 2.3
Obviously, ({0, 1, 2, 4}; ≤) is a poset, but ({0, 1, 2, 4}; ∨, ∧) is not a sublattice of ({0, 1, 2, 3, 4}; ∨, ∧), since 1 ∨ 2 = 3 ∈ {0, 1, 2, 4}. Definition A lattice L1 can be embedded into a lattice L2 , if there is a sublattice of L2 isomorphic to L1 .
2.4 Complete Lattices and Equivalence Relations Definition A poset is called complete iff for every subset A of P both sup A (denoted by A) and inf A (denoted by A) exist.
42
2 Lattices
A lattice which is complete as poset is a complete lattice. Examples 1) Obviously, each complete poset is also a lattice. 2) Every finite lattice is complete. 3) (R; ≤) is not complete. One can find further examples in Theorems 2.4.3 and 2.4.5. Theorem 2.4.1 For an arbitrary poset (L; ≤) with a greatest and a least element it holds:
∀A ⊆ L ∃ A ⇐⇒ ∀A ⊆ L ∃ A. Proof. “=⇒”: Let Ao := {x ∈ L | ∀a ∈ A : a ≤ x}. Since L has a greatest element,
we have Ao = ∅. It is easy to check that then can prove “⇐=”.
A=
Ao holds. Analogously, one
Theorem 2.4.2 Let A be an algebra. Then the lattice (S(A); ⊆) of all subalgebras of A is a complete lattice. Proof. The proof follows from Theorem 2.4.1 and the fact that every intersection of subalgebras of A is also a subalgebra of A (see Lemma 1.3.1, (b)). The following is a short summary of the equivalence relations: Definitions A binary relation is called an equivalence relation on a (nonempty) set A, if fulfills the following conditions: (E1 ) {(a, a) | a ∈ A} ⊆ (reflexivity); (E2 ) ∀a, b ∈ A : (a, b) ∈ =⇒ (b, a) ∈ (symmetry); (E3 ) ∀a, b, c ∈ A : ((a, b) ∈ and (b, c) ∈ ) =⇒ (a, c) ∈ (transitivity). Let Eq(A) be the set of all equivalence relations on A. By defining of the operation
−1
: P(A × A) −→ P(A × A), → −1 by
−1 := {(b, a) | (a, b) ∈ } and of the binary operation : P(A × A) × P(A × A) −→ P(A × A), (, ) → ◦ by
:= {(a, c) | ∃b ∈ A : (a, b) ∈ and (b, c) ∈ },
one can also write down the above conditions (E2 ) and (E3 ) as follows: (E2 ) −1 = , (E3 ) ⊆ .
2.4 Complete Lattices and Equivalence Relations
43
Instead of (a, b) ∈ we often write ab or (a, b) or a = b (mod ) or a ∼ b (mod ) (one say: a is equals (or equivalent) to b modulo ). For every set A there are two trivial equivalence relations: ∇A (:= κ1 ) := A2 (all relation)
and
∆A (:= κ0 ) := {(a, a) | a ∈ A} (identity or diagonale). Theorem 2.4.3 (Eq(A); ⊆) is a complete lattice for every nonempty set A. One can determine the infimum and the supremum of an arbitrary subset T := {i | i ∈ I} of Eq(A) as follows: T = i∈I i , T = i0 ,...,it ∈I;t<ℵ0 i0 i1 ...it . In particular, it holds for the equivalence relations κ and µ: κ ∨ µ = κ ∪ (κµ) ∪ (κµκ) ∪ (κµκµ) ∪ ... (i.e., (a, b) ∈ κ∨µ ⇐⇒ ∃c1 , ..., cn ∈ A : (∀i ∈ {1, 2, ..., n − 1} : (ci , ci+1 ) ∈ κ or (ci , ci+1 ) ∈ µ) and (a, b) = (c1 , cn )). Proof. The statement “(Eq(A); ⊆) is a complete lattice” follows from Theorem
2.4.1 and from the easily verifiable fact that the intersection of arbitrarily many equivalence relations on A is an equivalence relation on A again. The remaining statements one can easily check.
Definitions Let ∈ Eq(A) and a ∈ A. The set [a] (:= a/) := {x ∈ A | (a, x) ∈ } is called equivalence class of . The set A/ := {a/ | a ∈ A} of all equivalence classes of is called factor set of A by . The proof of the following theorem can be found in many books with sections on basic mathematics concepts. Theorem 2.4.4 Let A be a nonempty set. Then, for arbitrary ∈ Eq(A) and arbitrary a, b ∈ A: (a) A = a∈A a/; (b) a/ = b/ ⇐⇒ a/ ∩ b/ = ∅.
44
2 Lattices
Definitions A partition π of the set A is a set of nonempty subsets Ai (i ∈ I) of A (called blocks of π) with the properties: (Z1 ) i∈I Ai = A and (Z2 ) ∀i, j ∈ I : Ai ∩ Aj = ∅ or Ai = Aj . Let Π(A) be the set of all partitions of A. Regarding the contents, the following theorem, written with the help of concepts of the lattice theory, is identical to the well-known Main Theorem over equivalence relations. Theorem 2.4.5 If the partial order ≤ on Π(A) is defined by π ≤ π :⇐⇒ ∀b ∈ π ∃b ∈ π : b ⊆ b , then the lattices (Eq(A); ⊆) and (Π(A); ≤) are isomorphic. An order-preserving mapping α of Eq(A) auf Π(A) can be defined as follows: Let κ ∈ Eq(A) and π := {bi | i ∈ I} ∈ Π(A). Then α(κ) := {x/κ | x ∈ A} and
α−1 (π) := {(x, y) | ∃i ∈ I : {x, y} ⊆ bi }.
3 Hull Systems and Closure Operators
This chapter generalized observations that can be made when examining such similar concepts as subalgebra or linear hull of subsets of a vector space (or another closure operators of the classical algebra), to the concepts hull system and closure operator. Then, it is shown that these concepts deliver roughly the same.
3.1 Basic Concepts Definitions Let A be a nonempty set and let P(A) be the power set of A. A subset H of P(A) is a hull system (or a closed set system) on the set A if and only if (i) A ∈ H, and (ii) B := {b | b ∈ B} ∈ H for every nonempty subset B of H.1 The elements of H are called hulls. Examples 1) The set of all closed subsets of an algebra A is a hull system on A. 2) The set systems P(A), {A} and {A} ∪ {E ∈ P(A) | E finite} are hull systems on A for every nonempty set A. 3) The set of all equivalence relations Eq(A) is a hull system on A2 , A = ∅. Definitions A mapping C : P(A) −→ P(A) is called closure operator on A if and only if the following three conditions hold for all X, Y ⊆ A: (i) X ⊆ C(X) (extensivity), (ii) X ⊆ Y =⇒ C(X) ⊆ C(Y ) (monotony), (iii) C(C(X)) = C(X) (idempotency). 1
Let
{b | b ∈ B} :=
b∈B
b := {x | ∀b ∈ B : x ∈ b}.
46
3 Hull Systems and Closure Operators
Sets of the form C(X) are called closed, and we say that C(X) is generated of X. Example By Section 1.3, for every algebra, the operator [...]A is a closure operator. Definition If a closure operator C fulfills the following condition in addition (iv) ∀X ⊆ A : C(X) = {C(Y ) | Y ⊆ X and Y is finite}, then it is called algebraic closure operator.
3.2 Some Properties of Hull Systems and Closure Operators Hull systems and closure operators are generally the same: Theorem 3.2.1 (Main Theorem on Hull Systems and Closure Operators) (a) Let H be a hull system on A. For all X ⊆ A let CH (X) := {h ∈ H | X ⊆ h}. Then
(3.1)
CH : P(A) −→ P(A), X → CH (X)
is a closure operator on A, and the closed sets of CH are exactly the hulls of H. (b) Conversely, let C be a closure operator on A. Then HC := {C(X) | X ⊆ A}
(3.2)
is a hull system on A, and the hulls of HC are exactly the closed sets of A. (c) For every hull system H on A it holds H(CH ) = H,
(3.3)
and for every closure operator C on A it holds C(HC ) = C.
(3.4)
Proof. (a): The extensivity of the operator defined by (3.1) follows directly from the definition of CH (X). If X ⊆ Y , we have U := {h ∈ H | X ⊆ h} ⊇ V := {h ∈
3.2 Some Properties of Hull Systems and Closure Operators
47
H | Y ⊆ h}. Thus, CH (X) = {h ∈ H | X ⊆ h} ⊆ CH (Y ) = {h ∈ H | Y ⊆ h}. Therefore CH is monotone. To prove the idempotency of CH , first we show Y ⊆ CH (Z) =⇒ CH (Y ) ⊆ CH (Z).
(3.5)
Y ⊆ CH (Z) implies {h ∈ H | Z ⊆ h} ⊆ {h ∈ H | Y ⊆ h} and from this CH (Y ) ⊆ CH (Z), i.e., (3.5) holds. Choosing in (3.5) Y = CH (Z), then CH (CH (Z)) ⊆ CH (Z) follows from (3.5). By the extensivity of CH we have CH (Z) ⊆ CH (CH (Z)). Thus, CH is also idempotent and therefore CH is a closure operator. Next we prove (3.6) X ∈ H ⇐⇒ CH (X) = X. The statement “=⇒” in (3.6) follows directly from the definition of CH . “⇐=” follows from the definition of CH and the assumption (ii) (see Section 3.1). Thus (a) is proven. (b): Let C : P(A) −→ P(A) be a closure operator and HC is defined as in (3.2). The following equivalences are easy to check: ∀X ⊆ A (X ∈ HC ⇐⇒ C(X) = X).
(3.7)
The definition of C implies ⊆ A, i.e., A = C(A) ∈ HC . For arbitrary A ⊆ C(A) B∈B B ⊆ HC we have further B (= X∈B X) ∈ HC to show. Since for every we have B = C(B) and X∈B X ⊆ B, the extensivity ofC implies C( X∈B X) ⊆ C(B) = B for every B ∈ B. Then, by this we have C( X∈BX) ⊆ B∈B B. On the other hand X∈B X ⊆ C( X∈B X) also holds. Thus, C( B) = B ∈ HC is valid. (c): By using (3.7) and (3.6) it follows H(CH ) = H from X ∈ H(CH ) ⇐⇒ CH (X) = X ⇐⇒ X ∈ H. To prove C(HC ) = C, let Y ⊆ A be arbitrary. We have C(HC ) (Y ) = C(Y ) to show. By definition it holds that C(HC ) (Y ) = {Z | Z ∈ HC , Y ⊆ Z}. Consequently, by (3.7), C(HC ) (Y ) = {Z | C(Z) = Z, Y ⊆ Z}. Because of C(Y ) = C(C(Y )), we have {Z | C(Y ) = Z, Y ⊆ Z} ⊆ C(Y ). On the other hand it follows from Y ⊆ Z = C(Z) that C(Y ) ⊆ C(Z) = Z. This implies {Z | C(Z) = Z, Y ⊆ Z} ⊇ C(Y ). By summarizing, we obtain {Z | C(Y ) = Z, Y ⊆ Z} = C(Y ).
Theorem 3.2.2 (a) For every algebra A = (A; F ), [...]A is an algebraic closure operator on A. (b) Conversely, for every algebraic closure operator C on the set A there is a set F of operations on A such that {C(X) | X ⊆ A} is the set of all subalgebras of A = (A; F ). Proof. (a) follows from the description of the closure [T ]A of an arbitrary set T ⊆ A (see Lemma 1.3.1).
48
3 Hull Systems and Closure Operators
(b): Let C be an algebraic closure operator. We have to define a certain set of operations F on A such that C(X) = [X]F holds for arbitrary X ⊆ A. For every finite n-element subset E := {e1 , ..., en } of A and for every e ∈ C(E) we define fE;e as follows: e, if {x1 , ..., xn } = E, n (x1 , ..., xn ) := fE;e x1 otherwise. We summarize the functions of type fE;e to the set F : n {fE;e | |E| = n, E ⊆ A, e ∈ C(E)}. F := n∈N
Then, by construction, we have C(E) = [E]F . Since C is an algebraic closure operator, from this C(X) = [X]F follows for every subset X ⊆ A.
Theorem 3.2.3 (a) Let C be a closure operator on A and let LC := {X ⊆ A | C(X) = X}. Then LC is a complete lattice with
C(Ai ) = C(Ai ) i∈I
and
i∈I
C(Ai ) = C(
i∈I
Ai ).
i∈I
(b) Every complete lattice is isomorphic to the lattice LC of all closed subsets of a certain set A with a closure operator C. Proof. (a) is easy to check. (b) Let L be a complete lattice. For X ⊆ L we define C(X) := {a ∈ L | a ≤ sup X}. Then C is a closure operator on L and the mapping α : L −→ LC , a → {b ∈ L | b ≤ a} is an isomorphic mapping from L into LC .
Definitions Let X, Y ⊆ A, let H be a hull system on A and let h ∈ H. • X is called a generating system (or a generating set) of h, if h = CH (X) holds. • h is finitely generated, if there is a finite set E ⊆ h with h = CH (E).
3.2 Some Properties of Hull Systems and Closure Operators
49
• X is CH -independent (or briefly: independent), if for all x ∈ X it holds x ∈ CH (X\{x}). • X is called a CH -basis (or briefly: basis) of h, if X is a CH -independent generating set of h. From general theorems about hull systems and closure operators, one gets the following statements (about algebras), which we will prove, only for the concrete hull system S(A) and the corresponding closure operator [...]A . Theorem 3.2.4 (a) Let A be a finitely generated algebra. Then, for every generating set T of A, there is a finitely generating set T ⊆ T of A. (b) Every finitely generated algebra has a finite basis. (c) Every algebra, which has not a basis, is not finitely generated. (d) Let A be an algebra that has a subalgebra A1 with countable infinite basis. Then S(A) has a cardinality that is greater than or equal to the cardinality of the continuum. Proof. (a): Let A = (A; F ) be finitely generated. Then, there is a finite generating set B0 = {b1 , b2 , ..., br } ⊆ A of the universe A with [B0 ]A = A. Now let T ⊆ A be an arbitrary generating set of the algebra A. Because of [T ] = A and because of Lemma 1.3.2, one can get an arbitrary element a ∈ A from elements of T by successively applying the operations of F . In particular, this also holds for the elements b1 , ..., br of B0 . Obviously, the set of all elements of T needed for this is a finitely generating set T ⊆ T of A. (b): Let A = (A; F ) be a finitely generated algebra. Then by (a) there exists with every generating set T of A a finite subset T ⊆ T that is already a generating set for the given algebra. If t ∈ [T \{t}] for all t ∈ T , then T is a finite basis. Otherwise, if t1 ∈ [T \{t1 }], T := T \ {t1 } is a generating set for A. If now for all t ∈ T it holds t ∈ [T \{t}], then T is basis for A. In opposite case, we deal with T like with T by going over to T , etc. By the finiteness of T , this process breaks off with the construction of a basis for A, whereby (b) is proven. (c) follows from (b). (d): Let T := {t1 , t2 , ...} be a countable infinite basis of the subalgebra A1 of A. By definition, for all subsets T ⊂ T , we have, then, that a ∈ T \T implies a ∈ [T ]. Therefore, different subsets T and T of T define different subalgebras [T ] and [T ]. Consequently, the cardinality of the set S(A) is not less than the cardinality of the set P(T ). Now, it is well-known that P(T ) has the cardinality of continuum. Thus (c) holds.
This page intentionally left blank
4 Homomorphisms, Congruences and Galois Connections
It is clear that abstract algebraic properties of an algebra do not change if the elements and the operations of the algebra get other names. One can describe this fact mathematically using the concept isomorphism or isomorphic mapping. A generalization of this concept is homomorphism (or homomorphic mapping), with which one can describe similarities of algebras. Congruences and factor algebras are aids to determine homomorphisms. A Galois connection is a pair of mappings (σ, τ ) between two power sets P(A) and P(B), where the mappings τ and σ are antitone and extensive (see Section 4.4). With the aid of these mappings, one can define hull operators on A and on B. Then, these operators define closed set systems (⊆ P(A) or ⊆ P(B), respectively). Part of the usefulness of such Galois connections resides in the possibility of drawing conclusions about a closed set system on the basis of information about the other system. The Galois connection between function algebras and relation algebras, which we study in Chapter 2 of Part II, is an important aid in the solution of the completeness problem of the many-valued logic (see Part II, Chapter 5 and 6).
4.1 Homomorphisms and Isomorphisms Definitions Let (A; F ) and (B; G) be two universal algebras of the same type and F = {fi | i ∈ I} and G = {gi | i ∈ I} with afi = agi for every i ∈ I. We call the mapping ϕ : A −→ B a homomorphism or a homomorphic mapping from A into B, if ϕ is compatible with all f ∈ F , g ∈ G; i.e., it holds for all i ∈ I and all a1 , ..., aafi ∈ A: ϕ(fi (a1 , ..., aafi )) = gi (ϕ(a1 ), ϕ(a2 ), ..., ϕ(aafi )), if afi > 0, and ϕ(fi ) = gi for all fi ∈ F with afi = 0.
52
4 Homomorphisms, Congruences, and Galois Connections
If ϕ in addition is bijective from A onto B, then ϕ is called an isomorphism or an isomorphic mapping from A onto B. A homomorphism from an algebra A into A is called an endomorphism of A. An isomorphism from A onto A is an automorphism of A. Obviously, ϕ−1 is an isomorphism from B onto A, if ϕ is an isomorphism from A onto B. Therefore, we can say: “A and B are isomorphic”, we write in this case A∼ =B (read: “A isomorphic B”) for the identification of this fact. It is easy to see that the composition of homomorphic mappings ϕ1 ϕ2 (ϕ1 : A1 −→ A2 , ϕ2 : A2 −→ A3 ) is a homomorphism from A1 = (A1 ; F1 ) into A3 = (A3 ; F3 ). With the help of this property, one can show that the relation “∼ =” is an equivalence relation on sets of algebras. The following lemma summarizes further elementary properties of homomorphic mappings. Lemma 4.1.1 Let ϕ be a homomorphic mapping from A = (A; F ) into B = (B; G). Then it holds: (a) ϕ(A) is closed in respect to B; i.e., (ϕ(A); G) is a subalgebra of B, which is called homomorphic image of A by ϕ. (b) If A is a subalgebra of A, then (ϕ(A ); G) is a subalgebra of (ϕ(A); G). (c) If T ⊆ A is a generating system of A, then ϕ(T ) is a generating system of ϕ(A). (d) If (B ; G) is a subalgebra of (ϕ(A); G), then the so-called inverse image (ϕ−1 (B ); F ) with ϕ−1 (B ) := {a ∈ A | ϕ(a) ∈ B } is a subalgebra of A. (e) Let ψ be a homomorphism from A into B, which is identical with ϕ on a generating system of A. Then, ϕ(a) = ψ(a) for each a ∈ A.
4.2 Congruence Relations and Factor Algebras of Algebras Definitions A congruence relation (briefly: congruence) or a kernel of a homomorphic mapping ϕ of an algebra A = (A; F ) is an equivalence relation κϕ on A that is induced by the homomorphism ϕ from A into B, that is, for all a, a ∈ A it holds: (a, a ) ∈ κϕ :⇐⇒ ϕ(a) = ϕ(a ). In the following, we also denote the relation κϕ with Ker ϕ. Let Con(A) be the set of all congruences of A. Examples The identity mapping idA with idA : A −→ A, a → a
4.2 Congruence Relations and Factor Algebras of Algebras
53
and the mapping ϕC with ϕC : A −→ {c}, a → c from A onto the 1-element algebra of the same type ({c}; G), where g(c, c, ..., c) = c for all g ∈ G, if ag > 0, and g = c, if ag = 0 holds, induce two so-called trivial congruences, the zero-congruence κ0 and the all-congruence (or one-congruence) κ1 : κ0 := {(a, a) | a ∈ A}, κ1 := A × A. Definition An algebra, which has only both congruences κ0 and κ1 , is called simple. Examples for simple algebras are groups of prime order and the fields. As the following lemma demonstrates, it is possible to describe the concept “congruence” without use of the concept “homomorphism”. Lemma 4.2.1 An equivalence relation κ on A is a congruence on the algebra A = (A; F ) if and only if it is compatible with all not nullary operations of F ; i.e., if for all f n ∈ F with n = af > 0 and arbitrary a1 , ..., an , a1 , ..., an ∈ A it holds: {(a1 , a1 ), ..., (an , an )} ⊆ κ =⇒ (f (a1 , ..., an ), f (a1 , ..., an )) ∈ κ. Proof. Let
F := {fini | i ∈ I},
where I denotes a certain index set. “=⇒”: Let κ be a congruence on A. Then, by the definition of a congruence, there exists an algebra B := (B; G), where G := {gini | i ∈ I}, and a homomorphic mapping with the property
ϕ : A −→ B
κ = {(a, a ) | ϕ(a) = ϕ(a )}.
We have to show that κ is compatible with all f ∈ F \ F 0 . To show this let f := fini ∈ F \F 0 be arbitrary. For the purpose of simplification, we put n := ni and g := gini . Furthermore, let (a1 , a1 ), ..., (an , an ) ∈ κ be arbitrary. Since ϕ is a homomorphism, then we have
54
4 Homomorphisms, Congruences, and Galois Connections ϕ(f (a1 , ..., an )) = g(ϕ(a1 ), ..., ϕ(an )) = g(ϕ(a1 ), ..., ϕ(an )) = ϕ(f (a1 , ..., an )).
Consequently, (f (a1 , ..., an ), f (a1 , ..., an )) ∈ κ. “⇐=”: Conversely, let the equivalence relation κ on A be compatible with all operations of the algebra A = (A; F ). We have to show: There is an algebra B = (B; G) of the same type as A and a homomorphic mapping ϕ : A −→ B with the property {(x, y) | ϕ(x) = ϕ(y)} = κ. To construct the algebra B, we define: a/κ := {x ∈ A | (x, a) ∈ κ}
(a ∈ A)
(i.e., a/κ is the notation of the equivalence class in which lies a) and B := A/κ := {a/κ | a ∈ A} (i.e., B is the set of all equivalence classes of κ). Now, we are able to define the operations gini on the set B as follows: gini (a1 /κ, ..., ani /κ) := fini (a1 , ..., ani )/κ
(4.1)
(i.e., gini (a1 /κ, ..., ani /κ) is exactly the equivalence class in which fini (a1 , ..., ani ) lies). The above definition is possible, since fi is compatible with κ. Detailed: Choosing (a1 , a1 ), ..., (ani , ani ) ∈ κ, then it holds (a1 /κ, ..., ani /κ) = (a1 /κ, ..., ani /κ) and fini (a1 , ..., ani )/κ = fini (a1 , ..., ani )/κ. We put G := {gini | i ∈ I}. Then the mapping
ϕ : A −→ B, a → a/κ
is a homomorphic mapping from A onto B := (B; G), since by definition of κ ϕ(fini (a1 , ..., ani )) = fini (a1 , ..., ani )/κ holds and (by the compatibility of κ with fini and by the definition (4.1) of gi ∈ G further fini (a1 , ..., ani )/κ = gini (a1 /κ, ..., ani /κ) = gini (ϕ(a1 ), ..., ϕ(ani )) holds, which implies ϕ(fini (a1 , ..., ani )) = gini (ϕ(a1 ), ..., ϕ(ani )). Furthermore, by definition of ϕ and by the properties of an equivalence relation, it holds: {(x, y) ∈ A × A | ϕ(x) = ϕ(y)} = {(x, y) ∈ A × A | x/κ = y/κ} = κ.
4.2 Congruence Relations and Factor Algebras of Algebras
Definitions Lemma 4.2.1,
55
The above algebra, which was designed in the proof of the (A/κ; G)
of the so-called congruence classes of A modulo κ is called factor algebra of (A; F ) (or quotient algebra). The homomorphic mapping ϕ : A −→ A/κ, a → a/κ, defined in the proof of Lemma 4.2.1, is called natural homomorphism (or quotient homomorphism) from A onto A/κ. We make following use of our agreement from the first chapter according to which the operations of algebras of the same type are described equal. Only then, if distinctions are necessary at the denotation, do we indicate the operations. After these preparations, we can prove the following theorem (in generalization of analogous theorems over groups, rings, ...): Theorem 4.2.2 (General Homomorphism Theorem) For each homomorphism ϕ from an algebra A := (A; F ) into an algebra of the same type B := (B; F ) the algebra ϕ(A) := (ϕ(A); F ) is isomorphic to the factor algebra A/κϕ := (A/κϕ ; F ), where κϕ = {(a, a ) ∈ A × A | ϕ(a) = ϕ(a )}. Proof. It suffices to check that α : ϕ(A) −→ A/κϕ , ϕ(a) → a/κϕ is an isomorphism. Since a/κϕ = a /κϕ =⇒ (a, a ) ∈ κϕ =⇒ ϕ(a) = ϕ(a ), α is a mapping. Obviously, by definition, α is a surjection. The injectivity of α follows from the following: α(ϕ(a)) = α(ϕ(a )) =⇒ a/κϕ = a /κϕ =⇒ (a, a ) ∈ κϕ =⇒ ϕ(a) = ϕ(a ) (a, a ∈ A). Thus, α is bijective. To prove that α is a homomorphism, let f n ∈ F and let ϕ(a1 ), ..., ϕ(an ) ∈ ϕ(A) be arbitrary. Then it holds:
56
4 Homomorphisms, Congruences, and Galois Connections α(fϕ(A) (ϕ(a1 ), ..., ϕ(an ))) = α(ϕ(fA (a1 , ..., an )))
(since ϕ is a homomorphism)
= f (a1 , ..., an )/κϕ
(by definition of α)
= fA/κϕ (a1 /κϕ , ..., an /κϕ )
(since κϕ is compatible with f )
= fA/κϕ (α(ϕ(a1 )), ..., α(ϕ(an ))) (by definition of α), Thus our bijective mapping α is an isomorphism. The next lemma summarizes some elementary properties of congruences. The proof for this lemma is left to the reader. Lemma 4.2.3 It holds: (a) The intersection of arbitrary many congruences of an algebra A is also a congruence on A. (b) If κ is a congruence on (A; F ) and ϕ is a homomorphism defined over A with κϕ ⊆ κ, then ϕ(κ) := {(ϕ(a), ϕ(a )) | (a, a ) ∈ κ} is a congruence on (ϕ(A); F ). (c) If π is a congruence on (ϕ(A); F ) and ϕ is a homomorphism defined on (A; F ), then ϕ−1 (π) := {(a, a ) ∈ A × A | (ϕ(a), ϕ(a )) ∈ π} is a congruence on (A; F ), which κϕ includes. (d) If κ is a congruence on A = (A; F ) and B = (B; F ) is a subalgebra of A, then κ|B := {(b, b ) ∈ κ | b, b ∈ B} is a congruence on B. (e) The set ConA of all congruence relations of an algebra A is a complete lattice in respect to the inclusion ⊆ with inf{κj | j ∈ J} = j∈J κj , sup{κj | j ∈ J} =< j∈J κj >ConA , where {κj | j ∈ J} ⊆ ConA and < j∈J κj >ConA is the intersection of all congruences which contain j∈J κj .
4.3 Examples for Congruence Relations and Some Homomorphism Theorems In the following, we characterize the congruence relations by groups and rings more closely. In addition, we give the special homomorphism theorems that follow from these characterizations. 4.3.1 Congruences on Groups Let G = (G; ◦,−1 , e) be a group. A subgroup N of G is called a normal subgroup iff
4.3 Examples for Congruence Relations and Some Homomorphism Theorems
57
∀x ∈ G : x ◦ N = N ◦ x holds. Let NG be the set of all normal subgroups of G. If N is a normal subgroup of G, one also writes N G. The following connections between normal subgroups and congruences on G can easily be checked: (a) For every κ ∈ ConG, e/κ is a normal subgroup of G, and for arbitrary a, b ∈ G it holds: (a, b) ∈ κ ⇐⇒ a ◦ b−1 ∈ e/κ. (b) If N is a normal subgroup then one can obtain by κN := {(a, b) | a ◦ b−1 ∈ N } a congruence on G with e/κ = N . Consequently, the mapping α : ConG −→ NG, κ → e/κ is an order-preserving bijection. Since for every homomorphism ϕ from G into a group G the neutral element e is mapped to the neutral element of G , the properties (a), (b), and Theorem 4.2.2 imply the following Theorem 4.3.1.1 (Homomorphism Theorem for Groups) For every homomorphism ϕ from a group G into a group G there exists as so-called kernel (notation: ker ϕ) a normal subgroup K of G, which consists of all the elements of G which are mapped to the neutral element of G . The group G is isomorphic to the factor group G/K = ({x ◦ K | x ∈ G}; ◦,−1 , K)), where
(x ◦ K) ◦ (y ◦ K) := (x ◦ y) ◦ K
for arbitrary x, y ∈ G. Conversely, if K is a normal subgroup of G, then K is the kernel of the natural homomorphism from G onto the factor group G/K (∀x ∈ G : x → x ◦ K). We notice that the concept kernel of a group homomorphism differs from the general term kernel of a homomorphism. The corresponding is valid for the concept kernel from Theorem 4.3.2.1.
58
4 Homomorphisms, Congruences, and Galois Connections
4.3.2 Congruences on Rings Let R = (R; +, −, 0, ·) be a ring. A subgroup I of (R; +, −, 0) is called an ideal of R iff ∀x ∈ R : x · I ⊆ I ∧ I · x ⊆ I holds. Let IR be the set of all ideals of R. Connections between congruences on R and ideals of R are the following: For every κ ∈ ConR, 0/κ is an ideal of R and we have for arbitrary a, b ∈ R: (a, b) ∈ κ ⇐⇒ a − b ∈ 0/κ. If I is an ideal of R then one can obtain by κI := {(a, b) | a − b ∈ I} a congruence on R with 0/κI = I. Consequently, the mapping ConR −→ IR, κ → 0/κ is an order-preserving bijection. Further it holds: Theorem 4.3.2.1 (Homomorphism Theorem for Rings) For every homomorphism ϕ from a ring R into a ring R belongs as a kernel (notation: ker ϕ) an ideal I of R, which consists of all the elements of R which are mapped to the zero element of R . The ring R is isomorphic to the residue class ring R/I = ({x + I | x ∈ R}; +, −, I, ·), where (x + I) + (y + I) := (x + y) + I and (x + I) · (y + I) := (x · y) + I for arbitrary x, y ∈ R. Conversely, if I is an ideal of R then I is the kernel of the natural homomorphism from R onto R/I (∀x ∈ R : x → x + I). It is obvious idea, according to a homomorphism theorem for rings, to find also a homomorphism theorem for fields. The next theorem shows, however, that such a theorem is only a trivial and special case of the general homomorphism theorem. Theorem 4.3.2.2 A ring R, which is also a field, has only the two trivial ideals {0} and R. In other words: A field has only the trivial congruences κ0 and κ1 . Proof. Let R be a field and let κ be a congruence of R, which is different from
κ0 . Denote I the ideal belonging to κ. Since κ = κ0 , there is certain a, b ∈ R with a = b and (a, b) ∈ κ. Consequently, we have (c, 0) := (a − b, b − b) ∈ κ. Hence, I contains the invertable element c. Since I also contains all elements r · c for every r ∈ R (specially, r = r · c−1 with arbitrary r ∈ R) we have I = R. Thus, κ = κ1 .
4.4 Galois Connections
59
4.4 Galois Connections Definitions A Galois connection (or a Galois correspondence) between the sets A and B is a pair (σ, τ ) of mappings σ : P(A) −→ P(B) and
τ : P(B) −→ P(A),
such that for all X, X ⊆ A and all Y, Y ⊆ B the following conditions are fulfilled:
X ⊆ X =⇒ σ(X) ⊇ σ(X ) (antitony) (GC1) Y ⊆ Y =⇒ τ (Y ) ⊇ τ (Y ) X ⊆ τ (σ((X))) (GC2) (extensivity). Y ⊆ σ(τ ((Y ))) Let (P ; ≤) be a poset. The dual order ≤δ to the order ≤ is defined by x ≤δ y :⇐⇒ y ≤ x. (P ; ≤) is called dual isomorphic (or antiisomorphic) to (Q; ≤), iff (P ; ≤) is isomorphic to (Q; ≤δ ). The bijective mapping appertaining to this fact is called dual isomorphism (or antiisomorphism) . Theorem 4.4.1 Let the pair (σ, τ ) of mappings σ: P(A) −→ P(B) and τ : P(B) −→ P(A) be a Galois connection between A and B. Then it holds: (a) The mappings and
στ := στ : P(A) −→ P(A) τ σ := τ σ : P(B) −→ P(B)
are hull operators on A or B, respectively. (b) The στ -closed sets are exactly the sets of the form τ (Y ), Y ⊆ B. The τ σ-closed sets are exactly the sets of the form σ(X), X ⊆ A. (c) Let Hστ and Hτ σ be the hull systems that are assigned to στ and τ σ, respectively. Then the lattices (Hστ ; ⊆) and (Hτ σ ; ⊆) are dual isomorphic, and σ and τ are inversely dual isomorphisms to each other of these lattices. Proof. (a): The extensivity and the monotony of στ and τ σ immediately follow from (GC1) and (GC2), respectively. Thus, for all X ⊆ A we have X ⊆ τ (σ(X)) and therefore σ(X) ⊇ σ(τ (σ(X))). On the other hand, σ(X) ⊆ (τ σ)(σ(X)) = σ(τ (σ(X))) follows from (GC2). Consequently, we have
60
4 Homomorphisms, Congruences, and Galois Connections
and analogously Then the equations and
σ(X) = σ(τ (σ(X)))
(4.2)
τ (Y ) = τ (σ(τ (Y ))).
(4.3)
τ (σ(X)) = τ (σ(τ (σ(X)))) σ(τ (Y )) = σ(τ (σ(τ (Y ))))
follow from these. Thus, στ and τ σ are idempotent. (b): For a στ -closed set X we have X = τ (σ(X)); that is, X has the form X = τ (Y ) with Y := σ(X) ⊆ B. Conversely, a set of the form X := τ (Y ), Y ⊆ B, is στ -closed by (4.3). Analogously, one can prove the assertion for τ σ-closed sets. (c): Because of (b) and Theorem 3.2.1 it holds Hστ = {τ (Y ) | Y ⊆ B} and Hτ σ = {σ(X) | X ⊆ A}. Thus, we have σ(Hστ ) := {σ(τ (Y )) | Y ⊆ B} = Hτ σ and τ (Hτ σ ) := {τ (σ(X)) | X ⊆ A} = Hστ . By (GC1) σ and τ are antitone, and therefore the restrictions of these mappings to Hστ and Hτ σ have also this property. It follows from the idempotence of στ that στ on Hστ is the identical mapping. Analogously, one can see that τ σ is also the identical mapping on Hτ σ . Therefore, the mappings σ : Hστ −→ Hτ σ and τ : Hτ σ −→ Hστ are bijective mappings and it holds σ −1 = τ . Consequently, σ, τ are isomorphisms of the lattices (Hστ ; ⊆) and (Hτ σ ; ⊆δ )
An example of a Galois connection concludes this section. Further examples can be found in [Den-E-W 2004]. Theorem 4.4.2 Let A, B be nonempty sets and let R ⊆ A × B with R = ∅. The mappings σ : P(A) −→ P(B), τ : P(B) −→ P(A) are defined by σ(X) := {y ∈ B | ∀x ∈ X : (x, y) ∈ R}, τ (Y ) := {x ∈ A | ∀y ∈ Y : (x, y) ∈ R}. Then the pair (σ, τ ) is a Galois connection between A and B. Proof. Because of symmetry of the assumptions, it suffices to show that σ is an antitone and τ σ is an extensive mapping. Let X ⊆ X ⊆ A. Then for every y ∈ σ(X ) we have: (x, y) ∈ R for all x ∈ X . Thus (by X ⊆ X ) we have also (x, y) ∈ R for all x ∈ X. Therefore σ(X ) ⊆ σ(X) holds. The inclusion X ⊆ τ (σ(X)) follows directly from τ (σ(X)) = {x ∈ A | ∀y ∈ σ(X) : (x, y) ∈ R} and from the definition of σ(X).
5 Direct and Subdirect Products
With the help of direct and subdirect products, it is possible to form new algebras with larger universes from given algebras. Of these constructions one immediately asks the following questions: Which algebras are smallest “constituents” of given algebras? How can one reduce a given algebra to its smallest “constituents”? First, we will show that every finite algebra is isomorphic to a direct product of directly irreducible algebras. Then, we prove that every algebra is isomorphic to a subdirect product of subdirectly irreducible algebras.
5.1 Direct Products First, we consider direct products of two algebras. Definitions Let B = (B; F ) and C = (C; F ) be algebras of the same type τ. The algebra A := B × C of type τ is called direct product of the algebras B and C, iff B × C is the universe of the algebra A and the operations of A are defined as follows: If f ∈ F is nullary, then let fA := (fB , fC ). If af ≥ 1, let fA defined as follows: fB×C ((b1 , c1 ), (b2 , c2 ), ..., (baf , caf )) := (fB (b1 , ..., baf ), fC (c1 , ..., caf )). Obviously, B and C are homomorphic images of the algebra B × C, since the (so-called projection-)mappings pr1 : B × C −→ B, (b, c) → pr1 (b, c) := b and pr2 : B × C −→ C, (b, c) → pr2 (b, c) := c are homomorphisms from B × C onto B or C, respectively. The kernels of these projection mappings (congruences on B × C)
62
5 Direct and Subdirect Products
Ker pri := {((b, c), (b , c )) ∈ (B × C)2 | pri (b, c) = pri (b , c )} (i = 1, 2) are distinguished from other congruences by certain properties (see Theorem 5.1.2). We can describe these properties with the help of the following Definition Two equivalence relations κ, µ ∈ Eq(A) are called permutable, if κµ = µκ holds; i.e., ∀x, z ∈ A : (∃y ∈ A : (x, y) ∈ κ ∧ (y, z) ∈ µ) ⇐⇒ (∃y ∈ A : (x, y ) ∈ µ ∧ (y , z) ∈ κ). The following lemma gives some other definition possibilities for the above concept. In this lemma and in the following theorems, (Eq; ⊆), by Theorem 2.4.3, is a complete lattice and operations ∧ = ∩ (“infimum”) and ∨ (“supremum”) are defined on Eq (see Chapter 2). Lemma 5.1.1 For κ, µ ∈ Eq(A) the following statements are equivalent: (a) (b) (c) (d) (e)
κ and µ are permutable κµ ⊆ µκ µκ ⊆ κµ κ ∨ µ = κµ µ ∨ κ = κµ
Proof. Because of the commutativity of ∨, we have (d)⇐⇒(e). The equivalence (b)⇐⇒(c) is a conclusion from (a)⇐⇒(b). Thus, we have to show that (a)⇐⇒(b) and (a)⇐⇒(e) holds. (a)=⇒(b) is trivial. (b)=⇒(a): Let κµ ⊆ µκ. Then (by (κµ)−1 = µ−1 κ−1 and by the symmetry of κ and µ): (κµ)−1 ⊆ (µκ)−1 =⇒ µ−1 κ−1 ⊆ κ−1 µ−1 . =µκ
=κµ
Hence, κµ = µκ. (a)=⇒(e): Let κµ = µκ. (e) is shown, if it is proven that κµ is the smallest equivalence relation on A, which contains κ ∪ µ. Because of ∀(x, y) ∈ κ (( (x, y) ∈ κ ∧ (y, y) ∈ µ) =⇒ (x, y) ∈ κµ), ∀(x, y) ∈ µ (( (x, x) ∈ κ ∧ (x, y) ∈ µ) =⇒ (x, y) ∈ κµ) we have κ ∪ µ ⊆ κµ. κµ is reflexive, since κ (or µ) is reflexive. The symmetry of κµ follows from (κµ)−1 = µ−1 κ−1 = µκ = κµ. Because of (κµ)(κµ) = κ (µκ) µ = (κκ) (µµ) ⊆ κµ =κµ
⊆κ
⊆µ
κµ is also transitive. Thus, κµ is an equivalence relation on A. κµ is the smallest equivalence relation of Eq(A), which contains κ ∪ µ, since every
5.1 Direct Products
63
other equivalence relation, which contains κ ∪ µ, also contains the transitive closure of κ ∪ µ and therefore contains κµ. (e)=⇒(a): Let κ ∨ µ = κµ. Since κ ∨ µ is an equivalence relation, the compatibility of κ and µ follows from κµ = κ ∨ µ = (κµ)−1 = µ−1 κ−1 = µκ.
Theorem 5.1.2 For algebras B and C of the same type and the projection mappings pr1 : B × C −→ B and pr2 : B × C −→ C it holds: (a) Ker pr1 ∧ Ker pr2 = κ0 (b) Ker pr1 ∨ Ker pr2 = κ1 (c) Ker pr1 and Ker pr2 are permutable Proof. Let ((b, c), (b , c )) ∈ Ker pr1 ∩ Ker pr2 be arbitrary. Then, pri (b, c) =
pri (b , c ) for i = 1, 2. This means, however, that b = b and c = c . Therefore, (a) is shown. For arbitrary b, b ∈ B, c, c ∈ C we have ( (b, c), (b, c ) ) ∈ Ker pr1 ∧ ( (b, c ), (b , c ) ) ∈ Ker pr1 . Hence, ( (b, c), (b , c ) ) ∈ κµ for all b, b ∈ B and c, c ∈ C and thus (Ker pr1 )(Ker pr2 ) = κ1 . With the help of Lemma 5.1.1, the assertions (b) and (c) follow from this.
Now we will examine the conditions under which an algebra is a direct product of two other smaller algebras. Theorem 5.1.2 provides instructions on how to proceed. Theorem 5.1.3 Let A = (A; F ) be an algebra and let κ, µ ∈ ConA be two congruence relations with the following three properties: (a) κ ∧ µ = κ0 (b) κ ∨ µ = κ1 (c) κ and µ are permutable Then A is isomorphic to the direct product of A/κ and A/µ. An isomorphism ϕ: A −→ A/κ × A/µ is defined by ∀a ∈ A : ϕ(a) := (a/κ, a/µ). Proof. ϕ is injective: Let ϕ(a) = ϕ(b). Then, a/κ = b/κ and a/µ = b/µ. From these (a, b) ∈ κ ∧ µ follows. Thus a = b by (a). ϕ is surjective: By (b) and (c) for every pair a, b there is a c ∈ A with (a, c) ∈ κ and (c, b) ∈ µ. Consequently, (a/κ, b/µ) = (c/κ, c/µ) = ϕ(c). ϕ is an isomorphism: For all fA ∈ F (afA =: n) and arbitrary a1 , ..., an ∈ A it holds ϕ(fA (a1 , ..., an )) = (fA (a1 , ..., an )/κ, fA (a1 , .., an )/µ) = (fA/κ (a1 /κ, ..., an /κ), fA/µ (a1 /µ, ..., an /µ)) = fA/κ×A/µ (ϕ(a1 ), ..., ϕ(an )).
64
5 Direct and Subdirect Products
Definition An algebra A is called directly irreducible, iff A ∼ = B×C implies |B| = 1 or |C| = 1 for all algebras B and C. Example Obviously, every finite algebra A with |A| ∈ P is directly irreducible. One finds further examples after Theorem 5.1.4. Theorem 5.1.4 An algebra A is directly irreducible iff κ0 and κ1 are the only one pair of congruences of ConA, which satisfy the conditions (a)–(c) of Theorem 5.1.3. Proof. Let A be directly irreducible. Further, κ, µ ∈ ConA fulfill the conditions (a)–(c) of Theorem 5.1.3. Then, by Theorem 5.1.3, we have A ∼ = A/κ × A/µ. Thus, w.l.o.g., |A/κ| = 1. From this, κ = κ1 follows, and then µ = κ0 by (a). Conversely, Let κ0 and κ1 be the only one pair of congruences of A with the properties (a)–(c) of Theorem 5.1.3, and let A ∼ = B × C. Obviously, then κ0 and κ1 are the only one pair of congruence relations on B × C with (a)–(c). By Theorem 5.1.2 the kernels of the projection mappings pr1 and pr2 fulfill (a)–(c). Thus Ker pr1 = κ0 or Ker pr2 = κ0 holds and we have |C| = 1 or |B| = 1, respectively.
With the help of Theorem 5.1.4, one can prove the following statements:1 (a) Every simple algebra A; i.e., every algebra A with Con A = {κ0 , κ1 }, is directly irreducible. (b) If A is a Boolean algebra then A is directly irreducible ⇐⇒ |A| ≤ 2. (c) The residue class group (Zn ; +, −, 0) is directly irreducible iff n is a prime number power. (d) A vector space V := (V ; +, −, K, 0) over the field K is directly irreducible iff |V | = 1 or V is 1-dimensional. One can generalize our definition of the direct product of two algebras in an obvious way for finite many algebras of the same type. As the next definitions demonstrate, it is also possible to form direct products of arbitrarily many algebras of the same type. Definitions The Cartesian product Πj∈J Aj of the sets Aj (j ∈ J) is the set of all mappings α from J into j∈J Aj with α(j) ∈ Aj for all j ∈ J. We write down the elements of Πj∈J Aj in the form (xj | j ∈ J). In analog mode too, one can define then the algebra (Πj∈J Aj ; (fi )i∈I ) as a direct product Πj∈J Aj of the algebras Aj (j ∈ J), where 1
The proof for the statements can be found in [Lau 2004], volume 2.
5.1 Direct Products
65
fi ((aj1 |j ∈ J), (aj2 |j ∈ J), ..., (aj,afi |j ∈ J)) := (fji (aj1 , aj2 , ..., aj,afi )|j ∈ J) for arbitrary ((aj1 |j ∈ J), ..., (aj,afi |j ∈ J) ∈ Πj∈J Aj , if afi > 0, and fi = (fji |j ∈ J), if afi = 0. If J = ∅, then let Πj∈J Aj be the 1-element algebra of the corresponding type. If Aj = A for all j ∈ J, we write AJ instead of Πj∈J Aj . If J = {1, 2, .., n}, one also uses the denotation A1 × ... × An for the direct product of the algebras Aj . Theorem 5.1.5 Every finite algebra is isomorphic to a direct product of direct irreducible algebras. Proof. Induction over the cardinality of the universes of the algebras:
Obviously, every algebra A with |A| = 1 is directly irreducible. Now, let A be a finite algebra with |A| ≥ 2, and assume that the assertion is proven for all algebras A with |A | < |A|. If A is directly irreducible, we have to show nothing more. If, however, A ∼ = B × C with |B| > 1, |C| > 1 is valid, then we have |B| < |A| and |C| < |A|; i.e., one can find direct irreducible algebras B1 , ..., Bm , C1 , ..., Cn with B∼ = B1 × ... × Bm , C∼ = C1 × ... × Cn .
Thus A ∼ = B1 × ... × Bm × C1 × ... × Cn .
The direct products of more than two algebras have similar properties, like the direct products of only two algebras. For example, the j0 -th projection prj0 from Πj∈J Aj onto Aj with (aj | j ∈ J) → aj0 is a homomorphism for every j0 ∈ J. One can easily check the following property of direct products. Theorem 5.1.6 For every family2 ϕi : B −→ Ai , i ∈ I, of homomorphisms one can form a homomorphism ϕ: B −→ Πi∈I Ai by (ϕ(b))i := ϕi (b).
2
A family (ai | i ∈ I) of elements of a set A is a mapping ϕ : I → A, i → ai . This denotation is used around a certain selection of (not necessarily different) elements from A to characterize. Then, I is called index set of the family (ai | i ∈ I).
66
5 Direct and Subdirect Products
5.2 Subdirect Products Unlike finite algebras, infinite algebras cannot always be represented by direct products of directly irreducible algebras. Example As we already noticed above, a Boolean algebra A is directly irreducible iff |A| ≤ 2. Furthermore, one can easily prove that every 2-element Boolean algebra is isomorphic to the algebra B = ({0, 1}; ∨, ∧,− , 0, 1). An infinite direct product of B is not countable. Consequently, the countable Boolean algebra C = (C; ∨ , ∧ , ¬) with C := {(a1 , a2 , ...) ∈ {0, 1}N | |{i ∈ N | ai = 0}| < ℵ0 or |{i ∈ N | ai = 1}| < ℵ0 }, (a1 , a2 , ...) ◦ (b1 , b2 , ...) := (a1 ◦ b1 , a2 ◦ b2 , ...) for ◦ ∈ {∨, ∧} and ¬(a1 , a2 , ...) := (a1 , a2 , ...) is not isomorphic to a direct product of directly irreducible algebras, however, it is a subalgebra of the direct product BN . In generalizing this example, we get the following new product concept: Definition Let the algebras Ai , i ∈ I, be of the same type. A subalgebra B of Πi∈I Ai is called a subdirect product of the Ai iff prj (B) = Aj holds for all j ∈ I. Example
Obviously, every direct product is also a subdirect product.
Theorem 5.2.1 For a subdirect product B of the algebras Ai , i ∈ I, and the projection mappings prj : Πi∈I Ai −→ Aj it holds Ker(prj )|B = κ0 . j∈I
Proof. a = b.
If (a, b) ∈
j∈I
Ker(prj )|B , then aj = bj follows for all j ∈ I and therefore
By the above theorem and by the fact that all prj|B are surjective, the subdirect products are already characterized: Theorem 5.2.2 Let A be an algebra. For certain congruences κi ∈ ConA, i ∈ I, let κi = κ0 . i∈I
Then A is isomorphic to a subdirect product of the algebras A/κi , i ∈ I. By ϕ(a) := (a/κi | i ∈ I) an injective homomorphism ϕ: A −→ Πi∈I (A/κi ) is defined, and ϕ(A) is a subdirect product of the algebras A/κi .
5.2 Subdirect Products
67
Proof. By Theorem 5.1.6 ϕ is a homomorphism. ϕ is also injective: Let ϕ(a) = ϕ(b). This implies a/κi = b/κi and thus (a, b) ∈ κi for all i ∈ I. Therefore, (a, b) ∈ κ i∈I i = κ0 ; i.e., a = b. Consequently, A and ϕ(A) are isomorphic. Further, by definition of ϕ we have prj (ϕ(A)) = A/κj for all j ∈ I. Hence, ϕ(A) is a subdirect product of the algebras A/κi . Definition An injective homomorphism (a so-called embedding) ϕ: A −→ Πi∈I Ai is called a subdirect representation of A, if ϕ(A) is a subdirect product of the algebras Ai . Example The mapping ϕ of Theorem 5.2.2 is a subdirect representation. Definition An algebra A is called subdirectly irreducible, if for every subdirect representation ϕ : A −→ Πi∈I Ai there exists a j ∈ I such that the mapping ϕprj : A −→ Aj is an isomorphism. Thus, an algebra is subdirectly irreducible if and only if one gets by with a single component in every subdirect representation. Theorem 5.2.3 An algebra A is subdirectly irreducible, if and only if the universe of A contains at most an element, or if (ConA\{κ0 }) = κ0 holds. The latter holds obviously iff κ0 exactly has an upper neighbor in ConA: ConA :
κ1
(ConA\{κ0 })
κ0 Proof. W.l.o.g. let |A| ∈ {0, 1} in the following. Suppose, (ConA\{κ0 }) = κ0 . Put I := ConA\{κ0 }. Then, with the help of Theorem 5.2.2, one obtains a subdirect representation ϕ: A −→ Πκ∈I (A/κ). For every mapping prκ (κ ∈ I) and all a ∈ A it holds (ϕprκ )(a) = a/κ. By κ0 ∈ I, therefore ϕprκ : A −→ A/κ is not injective (i.e., is not an isomorphism). Thus, A is not subdirectly irreducible. Let now µ := (ConA\{κ0 }) = κ0 ; i.e., there exists (a, b) ∈ µ \ κ0 , and denote ϕ: A −→ Πi∈I Ai a subdirect representation of A. We have to show that there exists an
68
5 Direct and Subdirect Products
i ∈ I so that ϕpri is an isomorphism from A onto Ai . Since ϕ is injective and a = b, there exists a j ∈ I with prj (ϕ(a)) = prj (ϕ(b)), whereby (a, b) ∈ Ker(ϕprj ). Thus, by (a, b) ∈ µ, we have µ ⊆ Ker(ϕprj ). Then, by definition of µ, Ker(ϕprj ) = κ0 holds; i.e., ϕprj is injective. Since ϕ(A) is a subdirect product, ϕprj is surjective. Therefore, ϕprj is an isomorphism. Consequently, A is subdirectly irreducible. With the help of Theorems 5.2.3 and 5.1.4, one can easily prove the following connection between the direct and the subdirectly irreducible algebras: A is subdirectly irreducible =⇒ A is directly irreducible.
(5.1)
The reversal of the statement (5.1) is not valid, because one can prove with the help of a 3-element lattice which is directly irreducible but which is not subdirectly irreducible. An essential aid for proving the following Theorem is Zorn’s Lemma which is indicated without proof here. This lemma is equivalent to the axiom of choice (see e.g. [Her 55]). Lemma 5.2.4 (Zorn’s Lemma) In every set system M with the property ∀T ⊆ M ((∀X, Y ∈ T ∃Z ∈ T : X ∪ Y ⊆ Z) =⇒
X ∈ M)
X∈T
(i.e., M is an inductively set system) there is a maximal element3 ; i.e., an element M ∈ M that is not contained in any proper subset of M. After these preparations we can prove the following theorem, published by G. Birkhoff in 1944. Theorem 5.2.5 Every algebra is isomorphic to a subdirect product of subdirectly irreducible algebras. Proof. Let A be an algebra. One can easily see that, for every pair a, b ∈ A with a = b, the set Ma,b := {κ ∈ ConA | (a, b) ∈ κ} is an inductive set system. By Lemma 5.2.4 Ma,b has a maximal element Φ(a, b). In the lattice ConA the element Φ(a, b) has exactly an upper neighbor, namely Φ(a, b) ∨ Ω(a, b), where Ω(a, b) is the congruence relation generated by (a, b). It is easy to check that the factor algebra A/Φ(a, b) is isomorphic to an interval [Φ(a, b), κ1 ] := {κ ∈ ConA | Φ(a, b) ⊆ κ ⊆ κ1 } 3
Let (B; ≤) be a poset. A maximal element of the set A ⊆ B is then an element a ∈ A with a < x =⇒ x ∈ A for all x ∈ B.
5.2 Subdirect Products
69
of ConA. By Theorem 5.2.3 the algebra A/Φ(a, b) is subdirectly irreducible. From {Φ(a, b) | a, b ∈ A ∧ a = b} = κ0 and from Theorem 5.2.2, it follows that A is isomorphic to a subdirect product of subdirectly irreducible algebras (namely of the algebras A/Φ(a, b)).
This page intentionally left blank
6 Varieties, Equational Classes, and Free Algebras
In this Chapter, only certain classes1 of algebras of the same type shall be regarded. First we introduce so-called varieties as classes of algebras, which are closed in respect to formation of subalgebras, homomorphic images, and direct products. We then come to a method for constructing algebra classes that strongly differs from the first method at first sight: Starting from certain equations from variables and operation symbols of a certain type τ , we form the class of all algebras of type τ that fulfill these equations. The result is an equational class. We will see, however, that there is a close connection between the two methods of algebra class construction: A class of algebras is equationally definable if and only if it is a variety. Free algebras are “the most general” algebras within a variety or an equational class (or an equationally definable class). In the section on equational classes, we will also address such concepts such as conclusion of an equational set. In addition, we investigate methods to receive such conclusions.
6.1 Varieties The following operators S, H, P , I map a class K of algebras of type τ to a class of algebras of the same type. Let S(K) be the class of all subalgebras of algebras aus K, H(K) be the class of all homomorphic images of algebras of K, P (K) be the class of all direct products of families of algebras of K, I(K) be the class of all algebras which are isomorphic to algebras of K. 1
The concept “class” is a generalization of the concept “set”. Informally speaking, a class is a collection so large that subjecting it to the operations admissible for sets would lead to logical contradictions.
72
6 Varieties, Equational Classes, and Free Algebras
We denote the composition of the operators Y, X ∈ {H, S, P, I} by XY ; i.e., it holds XY (K) := X(Y (K)). It is easy to check that S, H and IP are hull operators; i.e., for all classes K and L of algebras of the same type we have: ∀X ∈ {S, H, IP } : K ⊆ X(K) ∧ (K ⊆ L =⇒ X(K) ⊆ X(L)) ∧ X(K) = X(X(K)). The operator P is not idempotent: For all A, B, C ∈ K it holds (A×B)×C ∈ P (P (K)), but (A×B)×C ∈ P (K) generally does not hold. However, (A × B) × C ∼ = A × B × C ∈ P (K) is right; i.e., (A × B) × C ∈ IP (K). Definitions • A class K of algebras of the same type is called under X ∈ {S, H, P } closed, if X(K) ⊆ K holds. • If the class K of algebras of the same type is closed under the three operators S, H and P , then the class K is called a variety. Examples (1) It is easy to see that the class of all groups is a variety. (2) Since the direct product of the field Z2 with the field Z2 because of ∀x, y ∈ Z2 : (0, 1) · (x, y) = (0 · x, 1 · y) = (0, y) = (1, 1) is not a field, the class of all fields is not a variety. Lemma 6.1.1 For every class K of algebras of the same type it holds: (a) SH(K) ⊆ HS(K), (b) P S(K) ⊆ SP (K), (c) P H(K) ⊆ HP (K). Proof. (a): Let A ∈ SH(K); i.e., there is an algebra B ∈ H(K) with A ≤ B and B is homomorphic image of an algebra C ∈ K. Let ϕ: C −→ B be a surjective homomorphism. Then, for the subalgebra ϕ−1 (A) of C it holds ϕ(ϕ−1 (A)) = A. Consequently, we have A ∈ HS(K). (b): Let A ∈ P S(K). Then it holds A = Πi∈I Bi with Bi ≤ Ci ∈ K for all i ∈ I. Since obviously Πi∈I Bi is a subalgebra of Πi∈I Ci , we have A ∈ SP (K). (c): Let A ∈ P H(K). Then, A = Πi∈I Bi , where for every i ∈ I there are an algebra Ci and a surjective homomorphism ϕi : Ci −→ Bi . If prj : Πi∈I Ci −→ Cj is the projection mapping, then prj ϕj : Πi∈I Ci −→ Bj is a surjective homomorphism. By Theorem 5.1.6 we get by ϕ(c)j := (prj ϕj )(c) a homomorphism ϕ: Πi∈I Ci −→ Πi∈I Bi , which is also surjective. Consequently, we have A ∈ HP (K).
Theorem 6.1.2 A class K of algebras of the same type is a variety if and only if HSP (K) = K holds.
6.2 Terms, Term Algebras, and Term Functions
73
Proof. If K is a variety, then obviously HSP (K) = K.
Let now HSP (K) = K. We have to show H(K) ⊆ K, S(K) ⊆ K and P (K) ⊆ K. It holds: H(K) = H(HSP (K)) = HSP (K), since H is idempotent. Thus,
H(K) = K
by assumption. Further we have: S(K) = S(HSP (K)) = SH(SP (K)) ⊆ HS(SP (K)) ⊆ HSP (K) by Lemma 6.1.1, (a) and since S is idempotent. Therefore, S(K) ⊆ K holds. Furthermore, P (K) = P HSP (K) ⊆ HP SP (K) ⊆ HSP P (K) ⊆ HSIP IP (K) = HSIP (K) ⊆ HSHP (K) ⊆ HHSP (K) = HSP (K) by Lemma 6.1.1 and since the operators IP and H are idempotent. Thus, P (K) ⊆ K holds. Consequently, K is a variety.
Every variety is exactly determined by its elements, which are subdirect irreducible algebras: Theorem 6.1.3 Every algebra of a variety K is isomorphic to a subdirect product of subdirect irreducible algebras of K. Proof. By Theorem 5.2.5, every algebra A is isomorphic to a subdirect product of
subdirect irreducible algebras Ai , where every Ai is isomorphic to a factor algebra of A; i.e., it holds Ai ∈ H(A). If A belongs to a variety K, then Ai ∈ H(K) ⊆ K.
6.2 Terms, Term Algebras, and Term Functions In Section 1.1, we had agreed to describe the operations of algebras of the same type by the same notations, if it is clearly from the context to which algebra a given operation belongs. Since we will often make use of this convention, we generalize the concept “type of an algebra” as follows: Definitions A type of algebras is an ordered pair (F, τ ), where F is a set, whose elements are called operation symbols, and τ : F −→ N0 is a mapping, which assigns the arity af to every operation f ∈ F. Then, the algebra A = (A; F ) with F := {fA | f ∈ F} is called algebra of type (F, τ ). Let Fn be the set of the n-ary operation symbols of F . Now let (F, τ ) be a type of algebras and let X
74
6 Varieties, Equational Classes, and Free Algebras
be a finite or countable infinite set, whose elements are called variables, where X ∩ F0 = ∅. T (X) denotes the smallest set with the following two properties: (1) X ∪ F0 ⊆ T (X), (2) (f ∈ Fn ∧ {t1 , ..., tn } ⊆ T (X)) =⇒ f (t1 , ..., tn ) ∈ T (X). One observes that f (t1 , ..., tn ) is a syntactic expression (a symbol sequence) and not a function value. The elements of T (X) are called terms of type (F, τ ) over the alphabet X. Example Let F := {e, f }, τ (e) := 0, τ (f ) := 2 and X := {x, y, z}. Then T (X) = {e, x, y, z, f (e, e), f (e, x), ..., f (z, y), f (f (e, e), e), f (f (x, e), e), ..., f (f (x, z), f (z, y)), ........}. We agree that (u ◦ v) := f (u, v) for arbitrary u, v ∈ T (X) and, furthermore, we do without outer brackets. Then the set T (X) can be also written down as follows: {e, x, y, z, e ◦ e, e ◦ x, ..., z ◦ y, (e ◦ e) ◦ e, (x ◦ e) ◦ e, ..., (x ◦ z) ◦ (z ◦ y), ...}. T (X) is the universe of the so-called term algebra T(X) := (T (X); F ) of type (F, τ ), where for every f ∈ Fn (n ∈ N ∪ {0}) the operations of this algebra are defined as follows: fT(X) := f, if n = 0, and ∀t1 , ..., tn ∈ T (X) : fT(X) (t1 , ..., tn ) := f (t1 , ..., tn ) for n ≥ 1. A part of the operation table of the operation fT(X) from the above example then looks as follows: u e e x ◦ (y ◦ e)
v e e◦x (x ◦ x) ◦ z
fT(X) (u, v) e◦e e ◦ (e ◦ x) (x ◦ (y ◦ e)) ◦ ((x ◦ x) ◦ z)
The following lemma follows directly from the definition of T(X):
6.2 Terms, Term Algebras, and Term Functions
75
Lemma 6.2.1 The term algebra T(X) is generated by X; i.e., it holds [X] = T (X). The following theorem gives an important property of the algebra T(X): Theorem 6.2.2 Let T(X) be the term algebra of type (F, τ ) over X. Then, for every algebra A of type (F, τ ) and for every mapping ϕ: X −→ A there is exactly one homomorphism ϕ : T(X) −→ A, which ϕ continues, i.e., for which ϕ| X = ϕ holds. Proof. For a given algebra A of type (F, τ ) and for a given mapping ϕ: X −→ A let ϕ: T (X) −→ A be a mapping with the properties: ∀x ∈ X : ϕ(x) := ϕ(x) and
∀f (t1 , ..., tn ) ∈ T (X)\X : ϕ(f (t1 , ...tn )) := fA (ϕ(t 1 ), ..., ϕ(t n )).
Obviously, ϕ is defined over T (X) by the above conditions, and it is the only possible continuation of ϕ over T (X).
Using the concepts from Part II, Chapter 1, we can briefly define the following Definition The term functions of an algebra A = (A; F ) of type (F, τ ) are operations over A that can be formed by superposition from the fundamental operations of F and from the projections. Without using concepts from Part II, Chapter 1, we can define the term functions an algebra A of type (F, τ ) as follows: Let t be a term of type (F, τ ) over X = {x1 , ..., xn }, and for a1 , ..., an ∈ A let ϕa1 ,...,an : T(X) −→ A be the unique homomorphism with xi → ai , i = 1, 2, ..., n. Then we can define an n-ary operation tA : An −→ A by
∀a1 , ..., an ∈ A : tA (a1 , ..., an ) := ϕa1 ,...,an (t).
These operations are identical with the term functions already defined above. If t and TA are defined as above, we say that the term t induces the term function tA . Let T F (A) be the set of all term functions of A. One can prove the next two lemmas with properties of T F (A) easily. Lemma 6.2.3 Let [..] be the subalgebra-hull-operator (see Chapter 3). Then for every algebra A and every subset B of A it holds: [B] = {tA (b1 , ..., bn ) | n ∈ N ∧ t ∈ T ({x1 , ..., xn }) ∧ {b1 , ..., bn } ⊆ B}.
76
6 Varieties, Equational Classes, and Free Algebras
Lemma 6.2.4 The algebras A, B and the n-ary term t have the same type. Then, for every homomorphism ϕ: A −→ B and all a1 , ..., an ∈ A it holds: ϕ(tA (a1 , ..., an )) = tB (ϕ(a1 ), ..., ϕ(an )); i.e., the term functions react just like the fundamental operations in respect to homomorphisms.
6.3 Equations and Equational Classes In this section, let T (X) be the set of all terms of type (F, τ ). To show that the variables of the term t ∈ T (X) are of the set {x1 , ..., xn } ⊆ X, we write t < x1 , ..., xn > and set
t = t < x1 , ..., xn > .
The notation
s := t < t1 , ..., tn >
meant that the term s was formed from the term t by substituting every variable xi (1 ≤ i ≤ n) by ti in every place the variable xi in t appeared. We agree on an analogous notation for term functions. Definitions • The elements of T (X) × T (X) are called equations (or identities) over X and we write s ≈ t :⇐⇒ (s, t) ∈ T (X) × T (X). • An algebra A of type (F, τ ) fulfills the equation s < x1 , ..., xn >≈ t < x1 , ..., xn > (or the equation s ≈ t holds in A), if for all a1 , ..., an ∈ A sA < a1 , ..., an >= tA < a1 , ..., an > is right. In this case, we also write A |= s ≈ t. Further, we set IdX (A) := {(s, t) ∈ T (X) × T (X) | A |= s ≈ t}.
6.3 Equations and Equational Classes
77
• Let be for Σ ⊆ T (X) × T (X) and classes K of algebras of the same type (F, τ ): A |= Σ :⇐⇒ (∀s ≈ t ∈ Σ : A |= s ≈ t). • The class
M od(Σ) := {A | A |= Σ}
is called the set of all models of Σ. • Conversely, for every class K of algebras of type (F, τ ) let IdX (K) := {(s, t) ∈ T (X) × T (X) | ∀A ∈ K : A |= s ≈ t} be the class of all equations over X that hold in all algebras of K. • A class K of algebras is equationally definable, if there exists a Σ ⊆ T (X) × T (X) with M od(Σ) = K. • A set Σ ⊆ T (X) × T (X) is called equational theory over X, if there is a class K of algebras with Σ = IdX (K). • An equation s ≈ t is called a conclusion of Σ ⊆ T (X) × T (X), if A |= s ≈ t holds for all A ∈ M od(Σ). Let ConsX (Σ) be the set of all conclusions of Σ; i.e., it holds ConsX (Σ) := IdX (M od(Σ)). Instead of Y (Z(..)), where Y, Z ∈ {M od, IdX , ConsX }, we write briefly Y Z(..). The following theorem summarizes elementary properties of the sets defined above and connections between the concepts just defined. Theorem 6.3.1 For arbitrary Σ, Σ ⊆ T (X) × T (X) and arbitrary classes K, K of algebras of type F it holds: (1) Σ ⊆ Σ =⇒ M od(Σ ) ⊆ M od(Σ), K ⊆ K =⇒ IdX (K ) ⊆ IdX (K); (2) Σ ⊆ IdX M od(Σ), K ⊆ M odIdX (K); (3) M odIdX M od(Σ) = M od(Σ), IdX M odIdX (K) = IdX (K); (4) Σ ⊆ ConsX (Σ), Σ ⊆ Σ =⇒ ConsX (Σ) ⊆ ConsX (Σ ), ConsX ConsX (Σ) = ConsX (Σ); (5) K ⊆ M odIdX (K), K ⊆ K =⇒ M odIdX (K) ⊆ M odIdX (K ), M odIdX M odIdX (K) = M odIdX (K); (6) Σ is equational theory ⇐⇒ Σ = ConsX (Σ), K is equationally definable ⇐⇒ K = M odIdX (K).
78
6 Varieties, Equational Classes, and Free Algebras
Proof. (1) and (2) immediately follow from the definitions of M od and IdX . (3): By (2) Σ ⊆ IdX M od(Σ) =: Σ holds. Thus, by means of (1), we have M odIdX M od(Σ) ⊆ M od(Σ). Conversely, we have also by (2): K := M od(Σ) ⊆ M odIdX M od(Σ). Therefore, M od(Σ) = M odIdX M od(Σ). Analogously, one can show IdX M odIdX (K) = IdX (K). (4) and (5) one can easily prove by means of (1)–(3). (6): Let Σ be an equational theory; i.e., there is a class K of algebras of type (F, τ ) with Σ = IdX (K). Then ConsX (Σ) = IdX M od(Σ)
assumption
=
(3)
IdX M odIdX (K) = IdX (K)
assumption
=
Σ.
Conversely, let Σ = ConsX (Σ). Then we have Σ = IdX M od(Σ); i.e., Σ is an equational theory. The statement over equational definable classes can be proven analogously.
If we neglect that the objects formed by classes need an exact definition, 2 then the following theorem is an immediate conclusion of the above theorem and of Theorem 4.4.1. Theorem 6.3.2 Let X be a countable infinite set, Alg(F, τ ) the class of all algebras of type (F, τ ) over X and let T (X) be the set of all terms of type (F, τ ). Then the pair (IdX , M od) forms a Galois connection between P(T (X) × T (X)) and P(Alg(F, τ )). Furthermore, the lattice of all equational classes of Alg(F, τ ) is antiisomorphic to the lattice of all equational theories of type (F, τ ).
6.4 Free Algebras To define a free algebra, we need the following properties of T(X): Theorem 6.4.1 Let K be a class of algebras of type (F, τ ), and let T(X) be the term algebra of the same type over the alphabet X. Then (a) IdX (K) = {Ker ϕ | ∃A ∈ K : ϕ : T(X) −→ A is a homomorphic mapping}, (b) IdX (K) ∈ ConT(X). Proof. (a): Let s, t ∈ T (X ) with X := {x1 , ..., xn } ⊆ X. For every algebra A ∈ K and all a1 , ..., an ∈ A there is by Theorem 6.2.2 a homomorphism ϕ: T(X) −→ A with ϕ(xi ) = ai , i = 1, ..., n. For every ϕ it holds ϕ(s) = sA (a1 , ..., an ) and ϕ(t) = tA (a1 , ..., an ). Therefore we have (s, t) ∈ Ker ϕ for all ϕ : T(X) −→ A with A ∈ K if and only if for all A ∈ K and all a1 , .., an ∈ A the equation sA (a1 , ..., an ) = tA (a1 , ..., an ) holds. But this is equivalently with A |= s ≈ t for all A ∈ K. (b) follows directly from (a), since the intersection of congruences of an algebra is a congruence of the algebra, as is well-known. 2
See, for example, [Sch 74], Chapter II.
6.4 Free Algebras
79
By the above theorem, we can form the factor algebra: T(X)/IdX (K)
(6.1)
for an arbitrary class K of algebras of the same type and of a set X of variables. Definitions If the factor algebra (6.1)belongs to K, then T(X)/IdX (K) is called the free algebra of K with free generating set X. If (6.1) belongs to K, we describe (6.1) with FK (X). In case X = {x1 , ..., xn } we also write FK (x1 , ..., xn ) or briefly FK (n), and, if X = {xi | i ∈ N}, we write FK (x1 , x2 , ...) or FK (ℵ0 ) (or FK (ω)). We notice, that, strictly speaking, the free algebra FK (X) is not generated by the set X but by the congruence classes x/IdX (K), x ∈ X. Nevertheless, one often writes x instead of x/IdX (K), since in a nontrivial class K of algebras (i.e., K contains not only 0- or 1-element algebras), the equation x/IdX (K) = y/IdX (K) implies x = y. The importance of the free algebras results from the following theorems with whose aid the main theorems to the equational theory are proven in Section 6.5. The factor algebra T(X)/IdX (K), in respect to the class K, has the same property as T(X) in respect to the class of all algebras of type (F, τ ) (see Theorem 6.2.2): Theorem 6.4.2 Let K be a class of algebras of type (F, τ ) and T(X) be the term algebra of the same type. Furthermore, let x := x/IdX (K) and X := {x | x ∈ X}. Then there is for every algebra A ∈ K and every mapping ϕ : X −→ A exactly one homomorphism ϕ : T(X)/IdX (K) −→ A, which continues ϕ; i.e., for which ϕ|X = ϕ holds. Proof. Let α : X −→ A be a mapping defined by α(x) := ϕ(x). Then, by Theorem 6.2.2 there is a homomorphism α : T(X) −→ A, which continues α. For the homomorphism π : T(X) −→ T(X)/IdX (K) with Ker π = IdX (K) we have by Theorem 6.4.1, (a) that Ker π ⊆ Ker α holds; i.e., it holds: π(s) = π(t) =⇒ α(s) = α(t). By ϕ(π(t)) := α(t) one receives a well-defined mapping ϕ : T (X)/IdX (K) −→ A. It is easy to see that ϕ is a homomorphism and that ϕ(x) = ϕ(x) for all x ∈ X holds. Because of [X] = [π(X)] = π[X] = π(T (X)) = T (X)/IdX (K) the mapping ϕ is uniquely defined through the definition over X. Theorem 6.4.3 For every class K of algebras of the same type and every variable set X it holds T(X)/IdX (K) ∈ ISP (K). Proof. Let T := T (X) and κ := IdX (K). By Theorem 6.4.1 (a) and with the help of Lemma 17.4.1 from [Lau 2004], volume 2 one can prove {(Ker ϕ)/κ | ∃A ∈ K : ϕ : T −→ A is a homomorphic mapping} = ∆T /κ (= κ0 on T /κ). Because of Theorem 5.2.2, the algebra T/κ is isomorphic to a subdirect product of the algebras (T/κ)/((Ker ϕ)/κ)
80
6 Varieties, Equational Classes, and Free Algebras
with ϕ : T −→ A, A ∈ K. For every such ϕ it holds (by the First Isomorphism Theorem 3 ) (T/κ)/((Ker ϕ)/κ) ∼ = T/(Ker ϕ) ∼ = ϕ(T) ∈ S(K). Therefore one gets altogether T/κ ∈ ISP (IS(K)) ⊆ ISP (S(K)) ⊆ ISP (K), where, obviously, the first inclusion is valid and the second inclusion follows from Lemma 6.1.1, (b). An immediate conclusion from Theorem 6.4.3 is as follows: Theorem 6.4.4 For every class K of algebras of the same type (in particular for a variety K) which is closed in respect to the operators I, S and P , it holds T(X)/IdX (K) ∈ K; i.e., K contains a free algebra FK (X). Lemma 6.4.5 Every free algebra FK (X) of a variety is isomorphic to a subdirect product of certain algebras FK (E), where E ⊆ X is finite and E = ∅. Proof. For x ∈ X let x := x/IdX (K). Further, for every E ⊆ X let E := {e ∈ FK (X) | e ∈ E}. Denote U(E) the subalgebra of FK (X) which is generated by E. It is easy to check that U(E) and FK (E) are isomorphic. Therefore, it is sufficient to show that FK (X) is isomorphic to a subdirect product of the algebras U(E), where E ⊆ X is nonempty and finite. For every such E, one chooses a surjective mapping ϕE : X −→ E with (ϕE )|E = idE . Then, the homomorphic continuation ϕE is surjective, and it holds (ϕE )|U (E) = idU (E) . Every term has only finite many variables. Thus for every pair s, t ∈ FK (X), there is a finite subset E ⊆ X with = t we have even (s, t) ∈ Ker (ϕE ) because of ϕE (s) = s s, t ∈ U (E). In the case s and ϕE (t) = t. Therefore {Kern(ϕE ) | ∅ ⊂ E ⊆ X ∧ E is finite} = κ0 . By Theorem 5.2.2 FK (X) is also isomorphic to an subdirect product of FK (x)/Kern(ϕE ). Because of FK (X)/Kern(ϕE ) ∼ = U(E), the assertion follows. Theorem 6.4.6 For every variety K it holds K = HSP ({FK (n) | n ∈ N}) = HSP ({FK (ω)}). Proof. Every algebra A ∈ K is a homomorphic image of FK (X), if |X| ≥ |A| (one chooses a mapping ϕ : X −→ A and then one uses Theorem 6.4.2). Thus, the first equality sign in our theorem follows from Lemma 6.4.5, and the second equality sign follows from the fact that FK (n) is isomorphic to a subalgebra of FK (ω) for all n ∈ N.
3
See for example [Wec 92], p. 140 or [Den-W 2002], Theorem 3.2.2 or Theorem 17.4.2 from [Lau 2004], volume 2.
6.5 Connections Between Varieties and Equational Defined Classes
81
6.5 Connections Between Varieties and Equational Defined Classes We need the following statement. Lemma 6.5.1 Let K be a class of algebras of the same type. Then it holds for an arbitrary alphabet X that: (a) ∀Op ∈ {H, S, P } : Op(K) ⊆ M odIdX (K); (b) M odIdX (K) is a variety. Proof. (a): Let Op = H. First, we will show that IdX (K) ⊆ IdX (H(K)) is right. Let s < x1 , ..., xn >≈ t < x1 , ..., xn > be an equation of IdX (K) with {x1 , ..., xn } ⊆ X. Then, this equation also holds in an arbitrary algebra B ∈ H(K): If namely ϕ(A) = B for a certain algebra A ∈ K and a surjective homomorphism ϕ, then for arbitrary b1 , ..., bn ∈ B there are a1 , ..., an ∈ A with the property sB < b1 , ..., bn > = sB < ϕ(a1 ), ..., ϕ(an ) > = ϕ(sA < a1 , ..., an >) = ϕ(tA < a1 , ..., an >) = tB < ϕ(a1 ), ..., ϕ(an ) > = tB < b1 , ..., bn >, i.e., s ≈ t ∈ IdX ({B}) holds, and thus we have IdX (K) ⊆ IdX (H(K)). Now, if one uses Theorem 6.3.1, (1), then one gets M odIdX (H(K)) ⊆ M odIdX (K). Furthermore, by Theorem 6.3.1, (2), we have H(K) ⊆ M odIdX (H(K)). Thus H(K) ⊆ M odIdX (K). Analogously one can prove (a) for Op ∈ {S, P }. (b): Let K ∗ = M odIdX (K). Then, by (a) and with the help of Theorem 6.3.1, (3) it holds for every Op ∈ {H, S, P }: Op(K ∗ ) ⊆ M odIdX (K ∗ ) = M od(IdX M odIdX (K)) = M odIdX (K) = K ∗ . Therefore, K ∗ is a variety.
Theorem 6.5.2 (First Main Theorem of the Equational Theory; [Bir 35]) A class K of algebras of the same type is a variety iff it is equationally definable; i.e., it holds (by Theorem 6.3.1, (6) and Theorem 6.1.2): K = HSP (K) ⇐⇒ ∃X : K = M odIdX (K). Proof. “⇐=”: By Lemma 6.5.1, (a) it holds Op(K) ⊆ M odIdX (K) for every Op ∈ {H, S, P }. If now K = M odIdX (K), then this implies Op(K) ⊆ K. Thus K is a variety. “=⇒”: Let K be a variety. By Lemma 6.5.1, (b) the class K ∗ := M odIdX (K) is also a variety and we have for an arbitrary alphabet X:
82
6 Varieties, Equational Classes, and Free Algebras FK∗ (X) = T(X)/IdX (K∗ ) (by definition) = T(X)/IdX (K)
(since by Theorem 6.3.1, (3) : IdX (K ∗ ) = IdX M odIdX (K) = IdX (K))
= FK (X)
(by definition).
From that (with the aid of Theorem 6.4.6 and X := {x1 , x2 , ...}) we get the equations K = HSP ({FK (ω)}) = HSP ({FK∗ (ω)}) = K ∗ Therefore, K is equationally definable.
6.6 Deductive Closure of Equation Sets and Equational Theory With the following definition of the deductive closure, we generalize the usual procedure of deriving equations from already proven equations. At the end of this section, we will be able to prove that the deductive closure of an equation sets Σ is identical with the set of all conclusions of Σ. Definitions Let (F, τ ) be a type of algebras, T (X) is defined as in Section 6.2 and Σ ⊆ T (X) × T (X). Then, the deductive closure D(Σ) of Σ is the smallest subset of T (X) × T (X) containing Σ such that the following five conditions hold: (R1) ∀p ∈ T (X) : p ≈ p ∈ D(Σ); (R2) ∀p, q ∈ T (X) : p ≈ q ∈ D(Σ) =⇒ q ≈ p ∈ D(Σ); (R3) ∀p, q, r ∈ T (X) : (p ≈ q ∈ D(Σ) ∧ q ≈ r ∈ D(Σ) =⇒ p ≈ r ∈ D(Σ)); (Rep) ∀f n ∈ F ∀{s1 ≈ t1 , ...., sn ≈ tn } ⊆ D(Σ) : f (s1 , ..., sn ) ≈ f (t1 , ..., tn ) ∈ D(Σ); (“replacement rule”); (Sub) ∀s < x1 , ..., xn >≈ t < x1 , ..., xn >∈ D(Σ) ∀t1 , ..., tn ∈ T (X) : s < t1 , ..., tn >≈ t < t1 , ..., tn >∈ D(Σ) (“substitution rule”). Σ ⊆ T (X) × T (X) is called deductively closed if D(Σ) = Σ holds. Obviously, every set Σ of equations with Σ = IdX (K), where K denotes a class of algebras of type (F, τ ), is deductively closed. In other words, if Σ is an equational theory of a class of algebras, then Σ is deductively closed. Furthermore, it holds that D(Σ) ⊆ ConsX (Σ). The aim of the following considerations is the proof that the reversals of the above two statements are also right. Exacter: It shall be shown that every deductively closed set of equations is
6.6 Deductive Closure of Equation Sets and Equational Theory
83
the equational theory of a certain class of algebras and that for every set Σ of equations, it holds ConsX (Σ) ⊆ D(Σ). Obviously, a deductively closed set Σ ⊆ T (X) × T (X) can also be characterized as follows: Because of (R1)–(R3) Σ is an equivalence relation, because of (Rep) Σ is a congruence on T (X), and because of (Sub) Σ is compatible with every endomorphism of T(X) (this is a homomorphism from T(X) into T(X)) (Proof: Let t1 , ..., tn ∈ T (X) be arbitrary. Then there exists an endomorphism ϕ of T(X) with ϕ(x1 ) = t1 , ϕ(x2 ) = t2 , ..., ϕ(xn ) = tn , and for every such endomorphism, it holds that ϕ(s) = s < t1 , ..., tn > and ϕ(t) = t < t1 , ..., tn >.). Definition A congruence relation κ of an algebra A is called fully invariant, if it is compatible with all endomorphisms of A; i.e., if for every endomorphism ϕ of A, (a, b) ∈ κ implies (ϕ(a), ϕ(b)) ∈ κ. The following two lemmas follow immediately from this definition and the above considerations. Lemma 6.6.1 A set Σ ⊆ T (X) × T (X) is deductively closed iff Σ is a fully invariant congruence on T(X). Lemma 6.6.2 For every class K of algebras of the same type and every variable set X, IdX (K) is a fully invariant congruence on T(X). The reversal of Lemma 6.6.2 is also valid: Lemma 6.6.3 For every fully invariant congruence κ over T(X) it holds that IdX ({T(X)/κ}) = κ, i.e., for arbitrary s, t ∈ T (X) we have: (s, t) ∈ κ ⇐⇒ T(X)/κ |= s ≈ t. In other words, an arbitrary fully invariant congruence κ on T(X) is an equational theory of the algebra T(X)/κ. Proof. “=⇒”: Let s = s < x1 , ..., xn >, t = t < x1 , ..., xn > and (s, t) ∈ κ. For arbitrary t1 , ..., tn ∈ T (X) it holds because of full invariance of κ: (s < t1 , ..., tn >, t < t1 , ..., tn >) ∈ κ. Consequently, we have: sT(X)/κ < t1 /κ, ..., tn /κ >= tT(X)/κ < t1 /κ, ..., tn /κ >, i.e., the equation s ≈ t holds in T(X)/κ. “⇐=”: Let s ≈ t ∈ IdX (T(X)/κ). Then it holds sT(X)/κ < x1 /κ, ..., xn /κ >= tT(X)/κ < x1 /κ, ..., xn /κ > . Thus (sT(X) , tT(X) ) ∈ κ and (s, t) ∈ κ.
The following theorem is a conclusion from the Lemmas 6.6.2 and 6.6.3:
84
6 Varieties, Equational Classes, and Free Algebras
Theorem 6.6.4 (Second Main Theorem of the Equational Theory; [Bir 35]) A set Σ ⊆ T (X) × T (X) is an equational theory iff Σ is a fully invariant congruence on T (X). Because of Theorem 6.3.1, (6) and Lemma 6.6.1, one can also write Theorem 6.6.4 as follows: Theorem 6.6.5 (Completeness Theorem for the Equational Logic; [Bir 35]) For an arbitrary alphabet X and an arbitrary Σ ⊆ T (X) × T (X) it holds: (a) Σ = ConsX (Σ) ⇐⇒ D(Σ) = Σ; (b) D(Σ) = ConsX (Σ). Proof. (a): “=⇒”: Let Σ = ConsX (Σ). Then, we have D(Σ) ⊆ ConsX (Σ) = Σ and Σ ⊆ D(Σ). Thus D(Σ) = Σ. “⇐=”: Let D(Σ) = Σ. Then, by Theorem 6.6.1, Σ is a fully invariant congruence on T (X). With the help of Theorem 6.6.4 it follows from this that Σ is an equational theory. Therefore, by Theorem 6.3.1, (6) Σ = ConsX (Σ). (b): Let Σ1 := D(Σ). Then we have D(Σ1 ) = Σ1 , Σ ⊆ Σ1 and D(Σ) ⊆ ConsX (Σ) ⊆ ConsX (Σ1 ).
(6.2)
By D(Σ1 ) = Σ1 it follows from (a): ConsX (Σ1 ) = Σ1 . Then, because of the idempotency of D, we have: D(Σ) = D(D(Σ)) = D(Σ1 ) = ConsX (Σ1 ). This and (6.2) imply D(Σ) = ConsX (Σ).
6.7 Finite Axiomatizability of Algebras The reader needs knowledge of the other sections of this chapter, as well as some knowledge of Part II for this section. An old question in universal algebra is whether, for given algebra A of finite type, there is a finite set Σ ⊆ IdX (A) with D(Σ) = IdX (A), where X := {x1 , x2 , x3 , ...}. For the case that D(Σ) = IdX (A) holds for a finite set Σ, we say that A is finitely axiomatizable or finitely based. The following theorem is easy to prove.
6.7 Finite Axiomatizability of Algebras
85
Theorem 6.7.1 ([Lyn 51]) Let A := (A; F ), B := (B; G) be finite and equivalent algebras of finite types; i.e., |A| < ℵ0 , A = B, |F | < ℵ0 , |G| < ℵ0 and T F (A) = T F (B) 4 . Then A is finitely axiomatizable if and only if B is.
The next theorem was founded by G. Birkhoff. Theorem 6.7.2 Let A be a finite algebra of finite type (F, τ ) and let Xn := {x1 , x2 , ..., xn } be a finite set of variables. Then IdXn (A) is finitely axiomatizable. Proof. Let κ := {(s, t) ∈ T (Xn )×T (Xn ) | A |= s ≈ t}. Then κ ∈ ConT(Xn ) by Theorem 6.4.2, (b). The congruence κ has only a finitely many equivalence classes ε1 , ..., εq , since A, F and Xn are finite, and since (s, t) ∈ κ iff the induced term functions sA , tA satisfy sA = tA . For t ∈ T (X) we denote by #t the number of operation symbols (∈ F) occurring in t. In particular, if t ∈ X then #t = 0. Now, from each equivalence class εi (i ∈ {1, ..., q}) of κ, we choose one representative ri with #ri ≤ #t for all terms t ∈ εi . Set M := {r1 , ..., rq }∪{f (ri1 , ri2 , ..., riaf ) | f ∈ F\F0 , {ri1 , ..., riaf } ⊆ {r1 , ..., rq }}, m := max{#ϕ | ϕ ∈ M } and Σ := {s ≈ t ∈ IdXn (A) | #s ≤ m ∧ # t ≤ m}. By induction on α we prove that ∀α ∈ N0 : (s ≈ t ∈ IdXn (A) ∧ #s ≤ α ∧ #t ≤ α) =⇒ s ≈ t ∈ D(Σ) . =:S(α)
(6.3) (I) If α ≤ m, then the statement S(α) is obviously valid. (II) Assume, S(β) holds for certain β ≥ m. Let s ≈ t ∈ IdXn (A) be arbitrary with #s ≤ β + 1 and #t ≤ β + 1. First, we consider the case s := f (s1 , s2 , ..., saf ), t := g(t1 , t2 , ..., tag ),
(6.4)
where f, g ∈ F and s1 , ..., saf , t1 , ...tag ∈ T (Xn ). Then #s1 +...+#saf ≤ β and #t1 + ... + #tag ≤ β. By definition of r1 , ..., rq there exist u1 , u2 , ...., uaf , v1 , v2 , ..., vag , w ∈ {1, ..., q} with [s1 ]κ = [ru1 ]κ , ..., [saf ]κ = [ruaf ]κ , [t1 ]κ = 4
In other words, the operations of algebra A can be represented as superpositions over the operations of algebra B and vice versa (see Part II, Section 1.5.1).
86
6 Varieties, Equational Classes, and Free Algebras
[rv1 ]κ , ...., [tag ]κ = [rvag ]κ , [f (s1 , ..., saf )]κ = [rw ]κ = [g(t1 , ..., tag )]κ . Then, by assumption, we have si ≈ rui , tj ≈ rvj ∈ D(Σ) and (by definition of Σ) f (ru1 , ..., ruaf ) ≈ rw , g(rv1 , ..., rvag ) ≈ rw ∈ Σ. With the aid of these equations and the rules (R1)–(R3), (Rep) and (Sub) we get Σ f (s1 , ..., saf ) ≈ f (s1 , ..., sn ) =⇒ Σ f (s1 , ..., saf ) ≈ f (ru1 , ..., ruaf ) =⇒ Σ f (s1 , ..., saf ) ≈ rw =⇒ Σ f (s1 , ..., saf ) ≈ g(rv1 , ..., rvag ) =⇒ Σ f (s1 , ..., saf ) ≈ g(t1 , ..., tag ), i.e., (s, t) ∈ D(Σ) in case (6.4). In the remaining cases (i.e., {s, t}∩Xn = ∅), one can prove the above in analog mode as well. Thus, (6.3) is right, whereby IdXn (A) is finitely axiomatizable. Remark: The above proof shows that one can choose, instead of Σ, the following finite set Σ : Σ := {x ≈ y | x, y ∈ Xm ∧ (x, y) ∈ κ}∪ {x ≈ r | x ∈ Xn ∧ r ∈ {r1 , ..., rq } ∧ (x, r) ∈ κ}∪ {f (g1 , ..., gaf ) ≈ g | f ∈ F ∧ {g1 , ..., gaf , g} ⊆ {r1 , ..., rq } ∧ (f (g1 , ..., gaf ), g) ∈ κ} As a conclusion of Theorems 6.7.1 and 6.7.2 we get: Theorem 6.7.3 Let A := (A; F ) be a finite algebra of finite type with [A] ⊆ (1) [PA ], i.e, the operations of F have at most an essential variable (see Part II, Chapter 1). Then A is finitely axiomatizable. The equational theory and parts of the mathematical logic deal with similar problems. Therefore, one can use sometimes results of the one theory for the other and vice versa. For this purpose, the next theorem provides an example. Because of the better survey, we agree with the following notation: If A = ({0, 1}; F ), f ∈ F defined by f (x) := ¬x or f (x, y) := x ◦ y
(6.5)
(◦ ∈ {∨, ∧, ⇒}) and t is a term, whose operation symbols belong to F , then tˆ denotes a formula of P rop (see Part II, Section 1.5.2), which one obtains by (6.5).
6.7 Finite Axiomatizability of Algebras
87
Theorem 6.7.4 ([Lyn 51]) Let A = ({0, 1}; 0, 1, f1 , f2 , f3 , g) be an algebra of the type (0, 0, 1, 2, 2, 2) with f1 (x) := ¬x, f2 (x, y) := x ∧ y, f3 (x, y) := x ∨ y and g(x, y) := x ⇒ y (see Table 1.2 of Part II). Further, let T be a set of tautologies (⊆ P rop) with the property that every tautology has a derivation from T with the help of sub and modus ponens. 5 Then, the equations (1) x ⇒ x ≈ 1 ( g(x, x) ≈ 1 ), (2) 1 ⇒ x ≈ x ( g(1, x) ≈ x ), (3) (x ⇒ y) ⇒ y ≈ (y ⇒ x) ⇒ x ( g(g(x, y), y) ≈ g(g(y, x), x) ) and the equations of the type (4) t ≈ 1 f¨ ur every t ∈ T form a system Σ of equations with D(Σ) = IdX (A) (more precise: D(Σ) = {ˆ α | α ∈ IdX (A)}). Proof. First, we show that (ϕ ∈ P rop is a tautology) implies ( ϕ ≈ 1 ∈ D(Σ) ).
(6.6)
By assumption, we can derive a tautology ϕ from T with the aid of sub and modus ponens. Consequently, we have to prove that it is possible to copy the modus ponens through the rules (R1)–(R3), (Rep) and (Sub). Let σ ≈ 1, σ ⇒ τ ≈ 1 ∈ D(Σ). Then τ ≈ 1 ∈ D(Σ) follows from (2)
Sub
σ ≈ 1, σ ⇒ τ ≈ 1 1 ⇒ τ ≈ 1 τ ≈ 1. Thus (6.6) holds. Now, let α ≈ β ∈ IdX (A) be arbitrary; i.e., α ⇒ β and β ⇒ α are tautologies. We show α ≈ β ∈ D(Σ). By (6.6) we have that α ⇒ β ≈ 1 and β⇒α≈1
(6.7)
belong to D(Σ). Furthermore, by (3) and (Rep): (β ⇒ α) ⇒ α ≈ (α ⇒ β) ⇒ β ∈ D(Σ). Thus (β ⇒ α) ⇒ α ≈ (α ⇒ β) ⇒ β
(Sub),(6.7)
1⇒α≈1⇒β
(2),(Sub)
α ≈ β,
whereby α ≈ β ∈ D(Σ) is shown. R. L. Lyndon proven the following basic result with the aid of Theorem 6.7.1 and Post’s theorem (see Part II, Theorem 3.1.1): 5
see Part II, Section 1.5.2.
88
6 Varieties, Equational Classes, and Free Algebras
Theorem 6.7.5 ([Lyn 51], without proof ) Every two-element algebra of finite type is finitely axiomatizable. Notice that J. Berman gave a short proof for the above theorem in [Ber 80] with the aid of theorems by Baker ([Bak 77]) and McKenzie ([McK 78]). R. C. Lyndon constructed a 7-element algebra of type (0, 2) whose equations are not finitely based (see [Lyn 54]). The smallest such example was found by V. L. Murskij: Theorem 6.7.6 ([Mur 65]; without proof ) The algebra ({0, 1, 2}; ◦), where ◦ is defined by ◦ 0 1 2 0 0 0 0 , 1 0 0 1 2 0 2 2 is not finitely axiomatizable. Notice that all finite groups, rings and lattices are finitely axiomatizable (see [Oat-P 65], [Kru 73], and [McK 70], respectively). The result for lattices was considerably generalized by K. Baker ([Bak 77]), who proven that every finite algebra whose generated variety is congruence distributive is finitely axiomatizable. In [Per 69] was proven that the multiplicative semigroup of all 2 × 2matrices over a 2-element field has a 6-element subsemigroup with no finite basis. One can find further important results on the topic in [McK 78] and [Wil 2001].
Part II
Function Algebras
This page intentionally left blank
1 Basic Concepts, Notations, and First Properties
In this chapter, we begin by investigating multi-digit operations, which are defined on a finite set A. We define some operations on the set of these operations. For the purpose of distinction, we subsequently replace the concept “operation (on the set A)” by the concept “function (on the set A)”.
1.1 Functions on Finite Sets Let A be a finite set with at least two elements. Often we choose the set Ek := {0, 1, 2, ..., k − 1}, k ≥ 2 instead of A in the following. We say that f is an n-ary (n-digit) function on A (or an n-ary function of the |A|-valued logic1 ), if f a mapping from the n-fold Cartesian product An into A, n ≥ 1. For technical reasons (see Section 1.3), we renounce that, in this section, we consider also nullary functions. Otherwise, we use the concepts introduced in Chapter 1 of Part I for operations: af , f n , D(f ), ... . Let PAn be the set of all n-ary functions on A 2 , n ≥ 1. Instead of PEnk we write also Pkn . Further let
1 2
One finds an explanation for this notation in Section 1.5. A confusion with the direct product is not possible for content-related reasons.
92
1 Basic Concepts, Notations, and First Properties
PA :=
n≥1
PAn ,
F n := F ∩ PAn for every subset F of PA , Pk := n≥1 Pkn , PA,B := {f ∈ PA | Im(f ) ⊆ B}, Pk,l := PEk ,El , PA (l) := {f ∈ PA | |Im(f )| ≤ l}, Pk (l) := PEk (l), PA [l] := {f ∈ PA | |Im(f )| = l} and Pk [l] := PEk [l] (2 ≤ l ≤ k). With (x1 , ..., xn ) (briefly x(n) ) or x we denote an arbitrary n-tuple of An or Ekn and usually we say that the xi (i = 1, 2, ..., n) are variables. If n = 2 or n = 3 we also write (x, y) or (x, y, z) instead of (x1 ..., xn ), respectively. We will define, subsequently, specific functions f n from Pk either through a table of the form Table 1.1 x1 x2 0 0 0 0 . . a1 a2 . . k−1 k−1
... xn ... 0 ... 1 ... . ... an ... . ... k − 1
f (x1 , x2 , ..., xn ) f (0, 0, ..., 0) f (0, 0, ..., 1) . f (a1 , a2 , ..., an ) . f (k − 1, k − 1, ..., k − 1)
or through formulas, for example, of the form ∀x ∈ Ekn : f (x1 , ..., xn ) := x1 + ... + xn (mod k),
(1.1)
on the (variable-) alphabet {x, y, z, x1 , x2 , ...}. We write often instead of (1.1) briefly (1.2) f (x1 , ..., xn ) := x1 + ... + xn (mod k) or (if the arity of f is clear from the context or is without importance) we write still more briefly “f is defined by x1 + ... + xn (mod k) ”;
(1.3)
i.e., we do not distinguish between a function and the formula (or term) defining it.3 3
One finds the concept “term” explained in Part I, Section 6.2.
1.1 Functions on Finite Sets
93
Two functions f n , g m ∈ PA are identical (we write f n = g m ) iff n = m and f (x) = g(x) for all x ∈ An hold. Let f n ∈ PA and i ∈ {1, 2, ..., n}. Then we say that the i-th variable (or the i-th place) of the function f ∈ PA is essential, iff there are n-tuples a = (a1 , ..., ai−1 , b, ai+1 , ..., an ) and a = (a1 , ..., ai−1 , c, ai+1 , ..., an ) such that b = c and f (a) = f (a ) hold. In the opposite case, one calls the i-th variable (or i-th place) of f fictitious (or non-essential). If the i-th variable of f is not fictitious, we say that f depends on the i-th variable. The function eni defined by eni (x1 , ..., xn ) := xi (i ∈ {1, ..., n}) is called projection or also selector. Let JA (or Jk ) be the set of all projections of PA (or Pk ), respectively. A constant function (briefly, constant) is a function cna defined by cna (x1 , ..., xn ) := a, where a ∈ A. Notations for certain functions of P2 , the Boolean functions, are given in the following table, where it is defined, as usual ◦(x, y) := x ◦ y if ◦ ∈ {∧, ∨, +, ⇒, ⇐⇒} and
−
(x) := x.
Table 1.2
x x x y x ∧ y x ∨ y x + y x ⇒ y x ⇐⇒ y 0 1 0 0 0 0 0 1 1 1 0 0 1 0 1 1 1 0 1 0 0 1 1 0 0 1 1 1 1 0 1 1 Instead of x ∧ y we also write x · y or we write xy briefly. It can easily be shown that the above functions have the following properties: Theorem 1.1.1 It holds: (a) ∀◦ ∈ {∨, ∧, ⇐⇒, +} : x ◦ (y ◦ z) = (x ◦ y) ◦ z; (b) x ∨ x = x, x ∧ x = x, x ⇐⇒ x = 1, x ⇒ x = 1, x + x = 0, x ∨ 0 = x, x ∧ 1 = x, x ∨ 1 = 1, x ∧ 0 = 0;
94
1 Basic Concepts, Notations, and First Properties
(c) ∀◦ ∈ {∨, ∧, +, ⇐⇒} : x ◦ y = y ◦ x; (d) x ∧ x = 0, x ∨ x = 1, x = x, x ∨ y = x ∧ y, x ∧ y = x ∨ y (“de Morgan’s laws”); (e) x ⇒ y = x ∨ y, x ⇒ y = x ∧ y; (f ) x ∧ (y ∨ z) = (x ∧ y) ∨ (x ∧ z), x ∨ (y ∧ z) = (x ∨ y) ∧ (x ∨ z); (g) x ∧ (x ∨ y) = x, x ∨ (x ∧ y) = x.
1.2 Operations on PA, Function Algebras The “formula notation” of our functions from the first section motivates the determination of the following operations on PA : – permutation of variables, – identification of variables, – adding of fictitious variables and – substitution of variables of a function by functions; which are called superposition operations on PA and which one can describe in different way exactly. We give only two possibilities here. First we want describe the above operations through the following (infinite many) partial operations: πs : PAn −→ PAn ∆t : PAn −→ PAr (r < n) ∇q : PAn −→ PAu (u > n) i : PAn × PAm −→ PAn+m−1 Let f n , g m be functions of PA , let s be a permutation on the set {1, 2, ..., n}, let t be a mapping from {1, 2, ..., n} onto {1, 2, ..., r} (r < n), let q be an injective mapping from {1, 2, ..., n} into {1, 2, ..., u} (u > n) and let i ∈ {1, 2, ..., n}. Then, πs f ∈ PAn , ∆t f ∈ PAr , ∇q f ∈ PAu , f i g ∈ PAm+n−1 are defined by (πs f )(x1 , ..., xn ) := f (xs(1) , xs(2) , ..., xs(n) ) (“permutation of variables of f ”), (∆t f )(x1 , ..., xr ) := f (xt(1) , xt(2) , ..., xt(n) ) (“identification of certain variables of f ”), (∇q f )(x1 , x2 , ..., xu ) := f (xq(1) , xq(2) , ..., xq(n) ) (“adding of certain fictitious variables”)
1.2 Operations on PA , Function Algebras
and
95
(f i g)(x1 , ..., xm+n−1 ) := f (x1 , ..., xi−1 , g(xi , ..., xi+m−1 ), xi+m , ..., xm+n−1 ) (“the replacement of the i-th variable of f through the function g and the changing of the denotation of variables of f ”).
For partial operations α ∈ {πs , ∆t , ∇q , i } defined above, one can continue to certain operations α on PA . For later investigations, however, it is better that we choose the minimal number of the operations on PA . Therefore, next we consider that there are five elementary operations (or Mal’tsevoperations) ζ, τ, ∆, ∇, on PA , with which we can form certain continuations of the partial operations πs , ∆t , ∇q , i for arbitrary s, t, q, i, n, m through composition. These operations were published by A. I. Mal’tsev in [Mal 66], and one can define these operations as follows for arbitrary f n , g m ∈ PA : max{1,n−1}
ζf n ∈ PAn , τ f n ∈ PAn , ∆f n ∈ PA
, ∇f n ∈ PAn+1 , f n g m ∈ PAm+n−1
and (ζf )(x1 , ..., xn ) := f (x2 , x3 , ..., xn , x1 ), (τ f )(x1 , ..., xn ) := f (x2 , x1 , x3 , ..., xn ), (∆f )(x1 , ..., xn−1 ) := f (x1 , x1 , x2 , ..., xn−1 ) if n ≥ 2, ζf = τ f = ∆f = f if n = 1, (∇f )(x1 , ..., xn+1 ) := f (x2 , x3 , ..., xn+1 ), (f g)(x1 , ..., xm+n−1 ) := f (g(x1 , ..., xm ), xm+1 , ..., xm+n−1 ). To prove that one can describe the operation πs (over PAn ) by means of operations ζ, τ (over PA ), it suffices to show that the set Sn of all permutations on the set {1, 2, ..., n} is generating by the permutations (12...n) and (12) (given in cyclic description); that is, that [{(12...n), (12)}] = Sn holds, where (ss )(x) := s (s(x)) for all s, s ∈ Sn . But, this follows from the fact that every permutation s ∈ Sn is a product of pairwise disjunct cycles: s = (i1 ...ip )(j1 ...jq )..., that every cycle is a product of transpositions (i1 ...ip ) = (i1 i2 )(i1 i3 )...(i1 ip ), and that
(ij) = (1i)(1j)(i1) for arbitrary i > j, i > 1, (1i) = (12)(23)...(i − 1i)(i − 1, i − 2)...(21) and (i, i + 1) = (12...n)n−i+1 (12)(12...n)i−1
96
1 Basic Concepts, Notations, and First Properties
are valid. Evidently, then, the operations ∆t or ∇q or i can be created (in respect to ) through the operations πs (s ∈ Sn ), ∆ or πs (s ∈ Sn ), ∇ or πs (s ∈ Sn ), respectively. Thus we proven the following lemma. Lemma 1.2.1 It holds: (a) For every permutation s ∈ Sn there exists an operation π ∈ [{ζ, τ }] with πs f = π s f for all f ∈ PAn . (b) For every mapping t from {1, 2, ..., n} onto {1, 2, ..., r} (r < n) there ex ∈ [{ζ, τ, ∆}] with ∆t f = ∆ t f for arbitrary f ∈ P n . ists an operation ∆ A (c) For every injective mapping q from {1, 2, ..., n} into {1, 2, ..., u} there ex q f for arbitrary f ∈ P n . q ∈ [{ζ, τ, ∇}] with ∇q f = ∇ ists an operation ∇ A (d) For every i ∈ {1, 2, ..., n}, there exists an operation i ∈ [{ζ, τ, }] with i g for arbitrary f ∈ PAn and arbitrary g ∈ PAm . f i g = f By means of the operations ζ, τ, ∆, ∇, we can describe the subject of investigation of this chapter. PA together with the operations e21 , ζ, τ, ∆, forms an algebra (PA ; e21 , ζ, τ, ∆, ) of the type (0, 1, 1, 1, 2), which is called (full) function algebra on A. A little changed form of the full function algebra is the so-called iterative (full) function algebra (PA ; ζ, τ, ∆, ∇, ) of the type (1, 1, 1, 1, 2). Since ∇f = f (τ e21 ) is valid, however, both algebras can be regarded as equivalent in a certain sense: If (S; e21 , ζ, τ, ∆, ) is a subalgebra of (PA ; e21 , ζ, τ, ∆, ), then (S; ζ, τ, ∆, ∇, ) is also a subalgebra of (PA ; ζ, τ, ∆, ∇, ). Conversely, if (T ; ζ, τ, ∆, ∇, ) is a subalgebra of (PA ; ζ, τ, ∆, ∇, ), then (T ∪JA ; e21 , ζ, τ, ∆, ) is a subalgebra of (PA ; e21 , ζ, τ, ∆, ). Therefore, we often deal only with the algebra PA = (PA ; ζ, τ, ∆, ∇, ).
1.3 Superpositions, Subclasses, and Clones A function f ∈ PA is called a superposition over F (⊆ PA ), if f can be obtained by a finite number of applications of the operations ζ, τ, ∆, ∇, from the functions of F . We describe a superposition f over F in the rarest cases f through a term over certain function symbols, ζ, τ, ∆, ∇, and parentheses. We use the variable alphabet {x, y, z, x1 , x2 , ...},
1.3 Superpositions, Subclasses, and Clones
97
certain function symbols, commas, and parenthesis instead of this. In some cases, where an equation for the precise definition of the function would be necessary formally, we are satisfied with the the right side of the defining equation if the remaining information on the function results from the context. Further, if f ∈ Pkn , g1 , ...gn ∈ Pkm and the m-ary function h ∈ Pk is defined by h(x1 , ..., xm ) := f (g1 (x1 , ..., xm ), g2 (x1 , ..., xm ), ..., gn (x1 , ..., xm )), then, we write briefly
h := f (g1 , ..., gn ).
The set of all superpositions over F (⊆ PA ) is called hull or closure of F and it is denoted by [F ]. Obviously, [..] is a hull operator on the set PA . A set F ⊆ PA satisfying [F ] = F is called a closed set or a subclass or briefly class of PA . We define that the empty set is also a closed set, i.e., ∅ = [∅]. One can form many examples of closed sets with the aid of the following concept: Let T ⊆ Pkm and f ∈ Pkn . Then we say that f preserves the set T iff ∀g1 , ..., gn ∈ T : f (g1 , ..., gn ) ∈ T. It is easy to see that a projection preserves every set T ⊆ Pkm and that the set of all functions, which preserve the set T , is closed. The set F ⊆ PA is called a clone of PA , if F is closed and JA ⊆ F holds.4 Obviously, the subclasses of PA are exactly the universes of subalgebras of (PA ; ζ, τ, ∆, ∇, ) and clones are exactly the universes of subalgebras of (PA ; e21 , ζ, τ, ∆, ). Let LA be the set of all closed subsets of PA . Put Lk := LEk . (LA ; ⊆) is a lattice (see Part I, Chapter 2). Further, let L↓A (F ) := {F ∈ LA | F ⊆ F } and
L↑A (F ) := {F ∈ LA | F ⊆ F }.
Analogously, one can define L↑k (F ) and L↓k (F ) for A = Ek . Further, let LA (F ; G) := L↑A (F ) ∩ L↓A (G), where F, G ∈ LA and F ⊂ G. 4
If F is a class of PA , then JA ⊆ F iff e11 ∈ F .
98
1 Basic Concepts, Notations, and First Properties
If [G] = F (⊆ PA ), then G is called complete in F . In particular, if F = PA , we say, G is complete or G is a complete set. A closed set F is called a maximal subclass of the closed set F , if F ⊂ F and [F ∪ {f }] = F for every f ∈ F \F . If F = PA then, we say briefly, F is a maximal class. The maximal classes of the maximal classes of PA are called submaximal classes. As usual, we call a subset F of F a generating system of F , if [F ] = F . A generating system F of F is called basis of the closed set F , if every proper subset of F is not a generating system of F . If a subclass F of PA has a finite generating system, then the order of F we denote with ord F . We understand from that, the smallest number with [F r ] = F . If F does not have any finite generating system, we write ord F = ∞.
1.4 Generating Systems for PA For the purpose of determining of generating systems for the set PA , we consider some descriptions (so-called “normal forms”) for an arbitrary function f n ∈ PA . These descriptions are superpositions over certain functions of PA , which are to be described easily and which have small arities. We use the following notations: 1 if x = a, ja (x) := 0 otherwise (a ∈ A) and
ja (x1 , ..., xn ) :=
1 if (x1 , ..., xn ) = a, 0 otherwise
(a ∈ An , n ∈ N). Theorem 1.4.1 (Representation Theorem for Functions of PA ) Let 0, 1 ∈ A and let ∧, ∨ be two binary associative5 operations on A with a ∧ 1 = a, 0 ∨ a = a ∨ 0 = a and a ∧ 0 = 0
(1.4)
for each a ∈ A. Then, for every function f n ∈ PA it holds: f (x) = (
m
fai (x) := )fa1 (x) ∨ fa2 (x) ∨ ... ∨ fam (x),
i=1
where An := {a1 , ..., am }, m := |A|n and
(1.5)
1.4 Generating Systems for PA
99
fai (x) := cf (ai ) (x1 ) ∧ jai (x) (i = 1, ..., m). Furthermore: jai (x) = jai1 (x1 ) ∧ jai2 (x2 ) ∧ ... ∧ jain (xn ), where ai := (ai1 , ..., ain ). Proof. The correctness of the equation (1.5) can be assured by checking that on both the left side and the right side of the formula, the same value stands for every x. If A = {0, 1}, the functions ∨, ∧ (= ·) are defined as in Table 1.2, j0 (x) = x and j1 (x) = x, then one receives the disjunctive normal form (or DNF) of an arbitrary Boolean function f n ∈ P2 as an conclusion from (1.5): f (x1 , ..., xn ) = f (a1 , ..., an ) · xa1 1 · xa2 2 · ... · xann , (1.6) a∈E2n
where
α
x :=
x if α = 0, x if α = 1
(α ∈ E2 ). If f = cn0 , then we can write f (x1 , ..., xn ) =
xa1 1 · xa2 2 · ... · xann
(1.7)
a∈E2n ,f (x)=1
instead of (1.6). For example, f (x, y, z) = x · y · z ∨ x · y · z ∨ x · y · z is the DNF for the ternary function f defined by Table 1.3. Table 1.3
x 0 0 0 0 1 1 1 1 5
y 0 0 1 1 0 0 1 1
z f (x, y, z) 0 0 1 0 0 1 1 0 0 1 1 0 0 0 1 1
The associativity can be renounced if the necessary parentheses are put in the following formulas.
100
1 Basic Concepts, Notations, and First Properties
If A is an arbitrary finite set, then one can choose ∧ and ∨ as lattice operations with 0 = A and 1 = A. Then, by Theorem 2.1.2 of Part I, we have ∨(x, y) = sup {x, y} and ∧(x, y) = inf {x, y}, where is the partial order (appertaining to the lattice) over A with the greatest element 1 and the least element 0. If A = Ek , then the functions ∨ := + (mod k) and ∧ := · (mod k) also fulfill (1.4) and we get the following normal form for an arbitrary function f n ∈ Pk : f (a1 , ..., an ) · ja1 (x1 ) · ... · jan (xn ) (mod k) (1.8) f (x) = a∈Ekn
The following theorem results from the above considerations immediately: Theorem 1.4.2 It holds: (a) Let ∨ and ∧ be binary operations on A, which (1.4) fulfill. Then, {∨, ∧}∪ {c1a , ja1 | a ∈ A} is a generating system for PA . In particular, if A = E2 , then [{∨, ∧,− }] = P2 and (because of Theorem 1.1.1, (d)) [{∨,− }] = [{∧,− }] = P2 . (b) ord PA = 2.
Theorem 1.4.3 Let A = Ek and let k = pm be a prime number power. Then one can define operations + and · on Ek so that (Ek ; +, ·) is a field with the neutral element o in respect to + and the neutral element e of the group (Ek \{o}; ·). Then, one can represent an arbitrary function f n ∈ Pk with the aid of these field operations as follows: ai1 i2 ...in · xi11 · xi22 · ... · xinn (1.9) f (x) = (i1 ,...,in )∈Ekn
(x0 := e; ai1 i2 ...in ∈ Ek ). This representation is unique except the order of addends, i.e., the equality of the corresponding coefficients results from the equality of two functions ∈ Pkn . Proof. The existence of a field (Ek ; +, ·) for k = pm , p ∈ P and m ∈ N is well-known. (see for example [Lid-N 87] or [Lau 2004], volume 2).
1.4 Generating Systems for PA
101
Every polynomial of the form (1.9) is uniquely represented through the sen quence of coefficients. Thus there are k (k ) different formulas of the form (1.9). n (kn ) , our theorem is proven if Since |Pk | = k f (x) = (i1 ,...,in )∈E n ai1 i2 ...in xi11 xi22 ...xinn and k f (x) = (i1 ,...,in )∈E n bi1 i2 ...in xi11 xi22 ...xinn k
implies ai1 ...in = bi1 ...in for all (i1 , ..., in ) ∈ Ekn . This is clear for (i1 , ..., in ) = (o, o, ..., o) (one forms f (o, ..., o)!). Let I := {xij | ij = o ∧ j ∈ {1, ..., n}} for the proof of ai1 ...in = bi1 ...in in the case (i1 , ..., in ) ∈ Ekn \{o}. If one identifies now the variables in f from I with x and one replaces the remaining variables through c0 (x), then one receives a unary function f that can be represented as follows: (1.10) f (x) = a0 + a1 · x + a2 · x2 + ... + ar−1 · xr−1 or
f (x) = b0 + b1 · x + b2 · x2 + ... + br−1 · xr−1
(1.11)
with r−1 := |I|, ar−1 = ai1 ...in and br−1 = bi1 ...in for certain a0 , ..., ar−2 , b0 , ..., br−2 . If one forms now in (1.10) and (1.11) f (α1 ), f (α2 ), ..., f (αr ) for pairwise distinct α1 , α2 , ..., αr ∈ Ek , then one sees that both (a0 , ..., ar−1 )T as also (b0 , ..., br−1 )T is a solution of the matrix equation A · x = (f (α1 ), ..., f (αr ))T with ⎛ ⎞ 1 α1 α12 ... α1r−1 ⎜ 1 α2 α2 ... αr−1 ⎟ 2 2 ⎟ A := ⎜ ⎝ ................. ⎠. 1 αr αr2 ... αrr−1 But, because of det A = o,6 this is only possible for a0 = b0 , ..., ar−1 = br−1 . The next property of functions of Pk for k ≥ 3 is not only useful while determining from generating systems for Pk ; it also has interesting consequences, which we will deal with later. We need the following denotation:7 ιhk := {(a1 , ..., ah ) ∈ Ekh | |{a1 , ..., ah } | ≤ h − 1} (h ≥ 2), 3 δ{α,β} := {(a1 , a2 , a3 ) ∈ Ek3 | aα = aβ } (α, β ∈ {1, 2, 3}) and 3 δ{1,2,3} := {(x, x, x) | x ∈ Ek }. 6 7
This follows from the fact that A is a Vandermonde matrix (see for example [Lau 2004], volume 1). See also Chapter 2.
102
1 Basic Concepts, Notations, and First Properties
Furthermore, for arbitrary ri := (r1i , r2i , ..., rhi ) ∈ Ekh , i = 1, 2, .., n, and f ∈ Pkn we put: f (r1 , ..., rn ) := (f (r11 , r12 , ..., r1n ), f (r21 , r22 , ..., r2n ), .., f (rh1 , rh2 , ..., rhn )). Theorem 1.4.4 Let f be an n-ary function of Pk , which is essentially dependent of at least two variables (w.l.o.g. of x1 and x2 ) and which has q pairwise distinct values. Then: 3 3 (a) q ≥ 3 =⇒ ∃r1 , ..., rn ∈ δ{1,2} ∪ δ{2,3} : f (r1 , ..., rn ) ∈ Ek3 \ι3k
(“Fundamental Lemma of Jablonskij”); (Jab 58]) (b) q ≥ 3 =⇒ ∃r1 , ..., rn ∈ ιqk : f (r1 , ..., rn ) ∈ Ekq \ιqk ; 3 3 3 3 ∪ δ{2,3} : f (r1 , ..., rn ) ∈ δ{1,3} \δ{1,2,3} . (c) q = 2 =⇒ ∃r1 , ..., rn ∈ δ{1,2}
Proof. (a), (c): Since f depends on the variable x1 essentially, there is an a := (a2 , ..., an ) ∈ Ekn−1 , so that Ta := {f (x, a2 , ..., an ) | x ∈ Ek } has at least two different elements. We distinguish two cases: Case 1: |Ta | < q. In this case, one can find a tuple c = (c1 , ..., cn ) with γ := f (c) ∈ Ta . Consequently, we have ⎞ ⎛ ⎞ ⎞ ⎛ ⎛ α f (a1 , a2 , ..., an ) a1 a2 ... an f ⎝ c1 a2 ... an ⎠ := ⎝ f (c1 , a2 , ..., an ) ⎠ = ⎝ β ⎠ c1 c2 ... cn γ f (c1 , c2 , ..., cn ) and |{α, β, γ}| = 3 for certain a1 ∈ Ek . Case 2: |Ta | = q. Since f also depends on x2 essentially, the function f1 (x1 , ..., xn−1 ) := f (d, x1 , ..., xn−1 ) is not a constant function for certain d ∈ Ek . Let now β := f (d, a2 , ..., an ). Because of f1 = cβ there are certain c2 , ..., cn and a γ with γ := f (d, c2 , ..., cn ) = β . Since |Ta | = q, then one can find an a1 ∈ Ek with γ if q = 2, α := f (a1 , a2 , ..., an ) = α ∈ {β , γ } if q ≥ 3. Consequently, we have ⎞ ⎛ ⎞ α a1 a2 ... an f ⎝ d a2 ... an ⎠ = ⎝ β ⎠ . d c2 ... cn γ ⎛
1.4 Generating Systems for PA
103
(b) follows easy from (a). From the many conclusions from this theorem, we provide only the following, first. Lemma 1.4.5 Let f n be a function of Pk , which is essentially dependent on two variables and which has q ≥ 3 distinguish values. Then: Pk,Im(f ) ⊆ [{f } ∪ Pk (q − 1)]. Proof. W.l.o.g. let Im(f ) = Eq . By Theorem 1.4.4, (b) there exist r1 , ..., rn ∈ ιqk with f (r1 , ..., rn ) = (0, 1, ..., q − 1)T and ⎞ ⎛ a02 ... a0n a01 ⎜ a11 a12 ... a1n ⎟ ⎟ (r1T , ..., rnT ) = ⎜ ⎝ ....................... ⎠. aq−1,1 aq−1,2 ... aq−1,n For an arbitrary function g m ∈ Pk,Im(f ) let gj (x1 , ..., xm ) = aij :⇐⇒ ∃i : g(x1 , ..., xm ) = i, (j = 1, 2, ..., n). Obviously, the functions g1 , ..., gn belong to Pk (q − 1) and it holds: g(x1 , ..., xm ) = f (g1 (x1 , ..., xm ), ..., gn (x1 , ..., xm )). Thus g ∈ [{f } ∪ Pk (q − 1)]. Subsequently, we declare another possibility of the characterization of functions of Pk that we need later during the description of a certain type of maximal classes of Pk . Lemma 1.4.6 Let Ai (i ∈ Ek ) be a partition of the set Ek and ai ∈ Ai (i ∈ Ek ). Furthermore, let y if ∃i ∈ Ek : x = ai and y ∈ Ai , x y := x otherwise. Then, an arbitrary function f n of Pk is a superposition over the functions z, gf , fi (i ∈ Ek ) defined by z(x, y) := x y, ai ⇐⇒ f (x1 , ..., xn ) ∈ Ai , gf (x1 , ..., xn ) := f (x1 , ..., xn ) if f (x1 , ..., xn ) ∈ Ai , fi (x1 , ..., xn ) := otherwise ai (i ∈ Ek ), and
f (x) = ((...((gf (x) f0 (x)) f1 (x)) ...) fk −1 (x)) n
is a representation of f .
(1.12)
104
1 Basic Concepts, Notations, and First Properties
1.5 Some Applications of the Function Algebras It is the aim of this section to show by examples how results in function algebras can be used in other mathematical disciplines. In addition, some problems that motivate certain investigations with function algebras are explained. 1.5.1 Classification of Universal Algebras In Part I, Chapter 1, we introduced the concept of the type of an algebra, and in Chapter 6 combinations (classes) of algebras of the same type, which fulfill certain equations. Such a decomposition of the algebras is, however, very coarse. The set MA of all finite algebras on the same universal A can be more finely decomposed with the aid of the following equivalence relation RA : The algebras (A; F ) and (A; G) with F, G ⊆ PA are called equivalent in respect to RA , iff [F ] = [G] holds, i.e., iff the operations of the one algebra can be represented as superpositions over the operations of the other algebra and vice versa. The equivalence classes (blocks) of the relation RA form a partition of the set MA , where the set of all algebras (A; F ) with F ∈ LA is a representative system of these equivalence classes. Reducts of (A; F ) are defined to be algebras of the form (A; G) with G ⊆ [F ]. An algebra (A; F ) with [F ] = PA is called primal ([Fos 59]). For example, by Theorem 1.4.2, the two-element Boolean algebra is primal. The Rosenberg’s completeness criterion from Chapter 6 can be used to obtain further examples of primal algebras (see also Chapter 7). An algebra (A; F ) is called preprimal iff [F ] is a maximal clone of PA ([Den 82], [Kno 85]). For a description of further generalizations of “primal algebras”, we need some concepts and results of Chapter 2 and the notations S(A) (the set of all subalgebras of the algebra A), Aut(A) (the set of all automorphisms on A), SubIso(A) (the set of all isomorphisms between subalgebras of A) and Con(A) (the set of all congruences of A). Let A := (A; F ) be an algebra, for which there is a relation set Q on A with [F ] = P olA Q. Then A is called • semiprimal iff Q ⊆ Rk1 , i.e., iff Q = S(A) (or with other words: iff every operation on A which preserves all subalgebras of A belongs to [F ]) [Fos-P 64]; • demiprimal iff Q = Aut(A) ([Qua 71]); • infraprimal (or demisemiprimal) iff Q = S(A) ∪ Aut(A) [Qua 71]; • quasiprimal iff Q = SubIso(A) ([Pix 71]); • hemiprimal iff Q = Con(A) ([Fos 70]);
1.5 Some Applications of the Function Algebras
105
For further concepts and properties of the above-defined algebras, refer to [Den 82], [Den-W 2002] and [Sze 86]. Since the present book describes many clones, one finds properties of the above-defined algebras, in many places in this book. 1.5.2 Propositional Logic and First Order Logic A proposition is a “sentence” (of a natural or artificial language) for which it makes sense to ask whether it false (notation: 0) or true (notation: 1). At the basis of the concept “proposition” we have the two-value principle (also called principle of the excluded middle). This means that each proposition must be either false or true, there is no other possibility “in between”. The following are propositions: – Rostock is a city in Germany. – There are infinite many prime numbers. – 2 · 3 = 5. – There exists extra-terrestrial life. The following are not propositions: – Two chickens on the way after the day before yesterday. – Everything that I say is false. – It is a beautiful day. – Be quiet! Propositions will be denoted by capital letters A, B, .... Instead of “A is an arbitrary proposition” we say “A is a proportional variable”. Therefore, a propositional variable takes the values 0 and 1. One can associate propositions (“sentences”) in the informal language in multiple ways with each other (for example through such conjunctions as “and”, “or”, “if – then”, ...). The result of this connection is normally, again, a proposition, whose value (0 or 1) is dependent from the values of associated single propositions. In the propositional logic, a part of the colloquial connections is modelled and defined exactly (unlike the informal language). Since we abstract from the content of a proposition during the consideration of a proposition (i.e., we have interest only in the so-called truth value 0 or 1 of the proposition), proposition combinations are multi-digit functions on {0, 1}, i.e., Boolean functions (or function of the 2-valued logic). Interpretations of the Boolean functions that are defined in Table 1.2 are, for example, • The negation of the proposition A: A (“not A”). A is true if and only if A is false. • The conjunction of the propositions A, B: A ∧ B (“A and B”). A ∧ B is true if and only if A as well as B are true. • The disjunction of the propositions A, B: A ∨ B (“A or B”). A ∨ B is true if and only if either A or B or both are true.
106
1 Basic Concepts, Notations, and First Properties
• contravalence: A + B (“either A or B”). A + B is true if and only if either A or B is true. • equivalence: A ⇐⇒ B (“A if and only if B”). A ⇐⇒ B is true if and only if A and B have the same truth value. • implication: A ⇒ B (“A implies B”; “If A, then B”). A ⇒ B is false if and only if A has the value 1 and B has the value 0. To provide mathematics with a precise language, the mathematical logic creates an artificial, formal language. Next, we give a short introduction on proportional logic; that is, the logic that deals only with propositions. Later, we extend our treatment to the first order logic, which also takes properties of individuals into account. The process of formalization of proportional logic consists of two stages: (i) present a formal language (ii) specify a procedure for obtaining valid or true propositions. The language of propositional logic has an alphabet consisting of • the set of proposition symbols At := {A, B, C, ..., A1 , B1 , C1 , ..., An , Bn , Cn , ...} (the elements of At are called atoms or atomic propositions) • the set of connectives J0 := {∧, ∨, ¬, ⇒, ⇔} • the set of auxilliary symbols {(, )} The set P rop is the smallest set X with the following three properties: • At ∪ {0, 1} ⊆ X • if α, β ∈ X, then (α ◦ β) ∈ X for all ◦ ∈ J0 • if α ∈ X, then (¬α) ∈ X Notice that P rop = T (At) (see Part I, Section 6.2). A mapping v : P rop −→ {0, 1} is called a valuation if v(0) = 0, v(1) = 1, v(¬α) = ¬v(α) and v(α ◦ β) = v(α) ◦ v(β) for all α, β ∈ P rop and all ◦ ∈ J0 . 8 If v(α) = 1 (or v(α) = 0) then α is true (or false) under v, respectively. If α = (β) ∈ P rop, then we only write β instead of α in the following. Obviously, we have: If v0 : At −→ {0, 1}, then there exists a unique valuation v such that v(α) = v0 (α) for all α ∈ At. α ∈ P rop is a tautology if v(α) = 1 for all valuations v. We write |= α (or ∅ |= α) for “α is a tautology”. If Σ ⊆ P rop and α ∈ P rop, then 8
Notice that the right sides of the equations are determined by Table 1.2.
1.5 Some Applications of the Function Algebras
107
Σ |= α iff for all valuations v: v(σ) = 1 for all σ ∈ Σ implies v(α) = 1. If Σ |= α then α is called a consequence of Σ. Further, set Cons(Σ) := {α ∈ P rop | Σ |= α}. It is a classical problem of the propositional logic to find a system of axioms and rules with which one can determine all tautologies and all consequences from a set of propositions. In books about mathematical logic, one finds many solutions for this purpose. We declare a solution with proof here. The proof is chosen so that it can be used as proof for a corresponding theorem of the predicate logic as a basic idea. It is normal to write down the rule “R: if α1 , ..., αr ∈ P rop are derivable, then αr+1 is derivable” in the following form: α1 , ..., αr R αr+1 As an example, we give the substitution rule sub: Let α ∈ P rop, which contains x ∈ At (in symbol: α(..., x, ...) ). If α is a tautology, then one can form a tautology by replacing every occurrence of x by β ∈ P rop in α: α(..., x, ...); β ∈ F orm sub . α(..., β, ...) The Hilbert-type-calculus for the classical proportional logic is defined by the following 13 axioms and a rule, where α, β, γ, σ, τ are arbitrary elements of P rop: (I) Axioms are all formulas of the form (A1) α ⇒ α (A2) α ⇒ (β ⇒ α) (A3) (α ⇒ β) ⇒ ((β ⇒ γ) ⇒ (α ⇒ γ)) (A4) (α ⇒ (β ⇒ γ)) ⇒ ((α ⇒ β) ⇒ (α ⇒ γ)) (A5) α ⇒ (α ∨ β), β ⇒ (α ∨ β) (A6) (α ⇒ γ) ⇒ ((β ⇒ γ) ⇒ ((α ∨ β) ⇒ γ)) (A7) (α ∧ β) ⇒ α, (α ∧ β) ⇒ β (A8) (γ ⇒ α) ⇒ ((γ ⇒ β) ⇒ (γ ⇒ (α ∧ β))) (A9) ((α ∧ β) ∨ γ) ⇒ ((α ∨ γ) ∧ (β ∨ γ)), ((α ∨ γ) ∧ (β ∨ γ)) ⇒ ((α ∧ β) ∨ γ) (A10) ((α ∨ β) ∧ γ) ⇒ ((α ∧ γ) ∨ (β ∧ γ)), ((α ∧ γ) ∨ (β ∧ γ)) ⇒ ((α ∨ β) ∧ γ) (A11) (α ⇒ β) ⇒ (¬β ⇒ ¬α) (A12) (α ∧ ¬α) ⇒ β (A13) β ⇒ (α ∨ ¬α). 9 (II) Rules: There is only one rule: “from σ and σ ⇒ τ conclude τ ”, written as 9
One can also choose α, β, γ as three different variables and the substitution rule sub as an additional rule.
108
1 Basic Concepts, Notations, and First Properties
σ, σ ⇒ τ (“modus ponens”) τ A derivation of ϕ from Σ (⊆ P rop) is a finite sequence (ϕ1 , ϕ2 , ..., ϕn ) of formulas with ϕn = ϕ, where each ϕi (1 ≤ i ≤ n) is an axiom or is an element of Σ or is the result of the application of modus ponens on ϕu , ϕv (u, v < i). Let be the derivation operator defined in this way, i.e., we write Σϕ iff there is a derivation of ϕ from Σ. Put cons(Σ) := {ϕ | Σ ϕ} (the set of all derivation consequences from Σ). It is easy to check that cons(Σ) ⊆ Cons(Σ), since the axioms are tautologies and since, for each valuation v, v(σ) = 1 and v(σ ⇒ τ ) = 1 imply v(τ ) = 1. For proof that cons(Σ) ⊂ Cons(Σ) is false, we need the following notations and facts: Since P rop is a set of terms, one can form the term algebra Prop := (P rop; ∨, ∧, ⇒, ¬, 0, 1) of the type (2, 2, 2, 1, 0, 0). For arbitrary α, β ∈ P rop let α ≈Σ β iff (Σ α ⇒ β and Σ β ⇒ α). Theorem 1.5.2.1 The relation ≈Σ has the following properties for arbitrary Σ: (a) (b) (c) (d)
≈Σ is a congruence of the algebra Prop. The factor algebra (P rop/≈Σ ; ∨, ∧, ¬, 0, 1) is a Boolean algebra. The set cons(Σ) is the 1 of the Boolean algebra (P rop/≈Σ ; ∨, ∧, ¬, 0, 1). There exists a homomorphic mapping ν from Prop onto Prop/≈Σ with ν(ϕ) = 1 iff Σ ϕ.
Proof. (a): First we show that ≈Σ is an equivalence relation. By Σ α ⇒ α (see (A1)) is ≈Σ reflexive. The symmetry of ≈Σ follows from the definition of ≈Σ . One can prove the transitivity of ≈Σ with the aid of (A3) and the modus ponens as follows: Let α ≈Σ β and β ≈Σ γ be arbitrary, i.e., it holds: Σ α ⇒ β, Σ β ⇒ α, Σ β ⇒ γ, Σ γ ⇒ β. By means of the modus pones ( σ := α ⇒ β, σ ⇒ τ := (A3) ) and (A3) one obtains Σ (β ⇒ γ) ⇒ (α ⇒ γ). When one uses the modus pones (σ := β ⇒ γ) again, one receives Σ α ⇒ γ. Analogously, one can show Σ γ ⇒ α. Thus, ≈Σ is an equivalence relation. To prove the compatibility of ≈Σ with ⇒ we consider
1.5 Some Applications of the Function Algebras
109
ϕ ≈Σ ϕ , ψ ≈Σ ψ , ( ϕ, ϕ , ψ, ψ ∈ P rop), i.e., it holds Σ ϕ ⇒ ϕ , Σ ϕ ⇒ ϕ, Σ ψ ⇒ ψ , Σ ψ ⇒ ψ. (ψ ⇒ ψ ) ⇒ (ϕ ⇒ (ψ ⇒ ψ )) (α = ψ ⇒ ψ and τ = β in (A2)) and the modus ponens imply Σ ϕ ⇒ (ψ ⇒ ψ ). Furthermore, by (A4), we have ((ϕ ⇒ (ψ ⇒ ψ )) ⇒ ((ϕ ⇒ ψ) ⇒ (ϕ ⇒ ψ )). Hence we get Σ ((ϕ ⇒ ψ) ⇒ (ϕ ⇒ ψ )) with the aid of modus ponens. Analogously, one can show Σ ((ϕ ⇒ ψ ) ⇒ (ϕ ⇒ ψ)). Consequently,
ϕ ⇒ ψ ≈Σ ϕ ⇒ ψ .
(1.13)
By (A3) we have Σ (ϕ ⇒ ϕ) ⇒ ((ϕ ⇒ ψ ) ⇒ (ϕ ⇒ ψ )), whereby Analogously, and therefore, Then
Σ (ϕ ⇒ ψ ) ⇒ (ϕ ⇒ ψ ). Σ (ϕ ⇒ ψ ) ⇒ (ϕ ⇒ ψ ), ϕ ⇒ ψ ≈Σ ϕ ⇒ ψ .
(1.14)
ϕ ⇒ ψ ≈Σ ϕ ⇒ ψ ,
since ≈Σ is transitive and (1.13) and (1.14) are valid. Hence, ≈Σ is compatible with ⇒. To prove that ≈Σ is compatible with ¬ we assume α ≈Σ β; i.e., we have Σ α ⇒ β and Σ β ⇒ α. Then, by (A11) and the modus ponens, we get Σ ¬β ⇒ ¬α and Σ ¬α ⇒ ¬β, whereby ¬α ≈Σ ¬β. Because of this property of ≈Σ , we can define a partial order on Prop/≈Σ as follows: [ϕ]≈Σ ≤ [ψ]≈Σ iff Σ ϕ ⇒ ψ, where [ϕ]≈Σ = [ψ]≈Σ means that ϕ ≈Σ ψ (i.e., Σ ϕ ⇒ ψ and Σ ψ ⇒ ϕ) holds. (By (A1) is ≤ reflexive; (A3) implies the transitivity of ≤. The antisymmetry follows from the definition of ≈Σ : I If Σ ϕ ⇒ ψ and Σ ψ ⇒ ϕ, then we have ϕ ≈Σ ψ.) Now (A5) shows that [α]≈Σ ≤ [α ∨ β]≈Σ and [β]≈Σ ≤ [α ∨ β]≈Σ .
110
1 Basic Concepts, Notations, and First Properties
Assume there is a γ with [α]≈Σ ≤ [γ]≈Σ and [β]≈Σ ≤ [γ]≈Σ . By (A6) and the modus ponens, this implies [α ∨ β]≈Σ ≤ [γ]≈Σ , whereby
sup([α]≈Σ , [β]≈Σ ) = [α]≈Σ ∨ [β]≈Σ = [α ∨ β]≈Σ
holds. Analogously, inf ([α]≈Σ , [β]≈Σ ) = [α]≈Σ ∧ [β]≈Σ = [α ∧ β]≈Σ follows from (A7), (A8) and the modus ponens. Thus ≈Σ is also compatible with the operations ∨ and ∧. (b): (a) implies that Prop/≈Σ is a lattice. Because of the axioms (A9) and (A10) this lattice is distributive. Assume Σ ϕ and Σ ψ. Then [ϕ]≈Σ = [ψ]≈Σ , since Σ ψ ⇒ ϕ and Σ ϕ ⇒ ψ follows from this with the aid of (A2) and the modus ponens. Because of (A2), we have Σ (β ⇒ α) for all β ∈ P rop and all α ∈ P rop with Σ α, i.e., β ≤ α. Therefore, {α | Σ α} is the greatest element of the lattice Prop/≈Σ . By (A12) the smallest element is the equivalence class [α ∧ ¬α]≈Σ . Consequently, the algebra Prop/≈Σ also fulfills the axioms (B1 ) (see Section 1.2.12). (B2 ) follows from the fact that ≈Σ is compatible with ∧, ∨ and ¬ with the aid of (A13) as follows: [α]≈Σ ∧ (¬[α]≈Σ ) = [α ∧ (¬α)]≈Σ = 0 (see above), [α]≈Σ ∨ (¬[α]≈Σ ) = [α ∨ (¬α)]≈Σ = 1 (because of [β]≈Σ ≤ [α ∨ ¬α]≈Σ for each β ∈ P rop by (A13)). Hence, Prop/≈Σ is a Boolean algebra. (c): We have shown above that the 1 of P rop/≈Σ contains all formulas derivable from Σ. Further, if α ∈ P rop belongs to the equivalence class 1 of P rop/≈Σ , then we get Σ ϕ ⇒ α for each ϕ with Σ ϕ by the above shown. Thus (by modus ponens) we have Σ α. Hence, (c) is proven. (d) By Part I, Section 4.1, the natural homomorphism ϕ : P rop −→ P rop/≈Σ , α → [α]/≈Σ fulfills (d). Theorem 1.5.2.2 (Completeness Theorem of Proportional Logic) Let Σ ⊆ P rop. Then cons(Σ) = Cons(Σ).
1.5 Some Applications of the Function Algebras
111
Proof. Obviously, cons(Σ) ⊆ Cons(Σ). Assume there exists an α ∈ Cons(Σ) \ cons(Σ). Then [α]/≈Σ = [1]/≈Σ by Theorem 1.5.2.1, whereby α is an element of a certain prime ideal (maximal ideal) of the Boolean algebra Prop/≈Σ .10 Consequently, there exists a homomorphism µ from Prop/≈Σ onto the two-element Boolean algebra {0, 1} with µ([α]/≈Σ ) = 0. Then, with the aid of Theorem 1.5.2.1, (d), it is easy to see that v := νµ is a valuation with v(α) = 0 and v(σ) = 1 for all σ ∈ Σ. But, this is a contradiction to α ∈ Cons(Σ). Next is a short introduction to predicate logic (or first order logic). Predicate logic is a language to describe statements about algebraic structures (to given signature). A signature is a pair δ := ((ni )i∈I , (mj )j∈J ) with ni ∈ N0 , mj ∈ N for all i ∈ I and j ∈ J. A := (A; (fiA )i∈I , (RjA )j∈J ) is called a structure of signature δ, if (A; (fiA )i∈I ) an algebra of the type (ni )i∈I and RjA ⊆ Amj holds for all j ∈ J. We say “fiA is the interpretation of fi ” and “RjA is the interpretation of Rj ”. With the aid of a mapping P from Ah into {0, 1}, one can describe an h-ary relation R on a set A (i.e., R ⊆ Ah ) as follows: P (a1 , .., ah ) = 1 iff (a1 , ..., ah ) ∈ R. Such a mapping P is called an h-ary predicate. Let P, Q be predicates on A. Then one can understand the predicates as propositions and form (¬P ) and (P ◦ Q) for each ◦ ∈ J0 . m Therefore, let Pj j be the mj -ary predicate with mj
Pj (a1 , .., amj ) = 1 iff (a1 , ..., amj ) ∈ Rj
in the following. The alphabet of the first order logic consists of the following symbols: • • • •
the set V ar := {x0 , x1 , x2 , ...} of variables m the set {Pj j | j ∈ J} of predicate symbols the set {fini | i ∈ I} of operation symbols the set of connectives J := {∧, ∨, ¬, ⇒, ⇔, ∃, ∀} (∃ and ∀ are called the existential and universal quantifier) • the set of auxilliary symbols {(, )} As described in Part I, Section 6.2, we form the set of all terms T erm := T (V ar) and the term algebra Term = (T erm; (fi )i∈I ). Then, F ORM is the smallest set X with the following four properties:
10
See books on Boolean algebras or universal algebras.
112
1 Basic Concepts, Notations, and First Properties
• Pj (t1 , ..., tmj ) ∈ X for all j ∈ J and all t1 , ..., tmj ∈ T erm (Pj (t1 , ..., tmj ) is called an atom); • if α, β ∈ X , then (α ◦ β) ∈ X for all ◦ ∈ J0 • if α ∈ X then (¬α) ∈ X • if α ∈ X then (∃xk α) ∈ X and (∀xk α) ∈ X for all k ∈ N0 If t ∈ T erm, then V ar(t) denotes the set of all elements of X, which occur in T . For ϕ ∈ F ORM the set V ar(ϕ) of all variables of ϕ is defined by • V ar(Pj (t1 , ..., tmj )) := V ar(t1 ) ∪ ... ∪ V ar(tmj ) • V ar(¬α) := V ar(α) and V ar(α ◦ β) := V ar(α) ◦ V ar(β) for all ◦ ∈ J0 • V ar(∃xk α) = V ar(∀xk α) := V ar(α) ∪ {xk } (α, β ∈ F ORM ). The set f r(ϕ) of free variables of ϕ is defined by • f r(ϕ) := V ar(ϕ) if ϕ is an atom • f r(¬α) := f r(α) and f r(α ◦ β) := f r(α) ◦ f r(β) for all ◦ ∈ J0 • f r(∀xk α) = f r(∃xk α) := f r(α)\{xk } (α, β ∈ F ORM ). The set bd(ϕ) of bound variables of ϕ is defined by • bd(ϕ) := ∅ if ϕ is an atom • bd(¬α) := bd(α) and bd(α ◦ β) := bd(α) ◦ bd(β) for all ◦ ∈ J0 • bd(∀xk α) = bd(∃xk α) := bd(α) ∪ {xk } (α, β ∈ F ORM ). – ϕ is called open formula if bd(ϕ) = ∅. ϕ is a sentence or is closed, if f r(ϕ) = ∅. Obviously, V ar(ϕ) = f r(ϕ) ∪ bd(ϕ), but f r(α) ∩ bd(ϕ) need not be empty. Let u, u be mappings from V ar into A. Then we write u =xk u iff u(xj ) = u (xj ) for all j = k. Let A := (A; (fi )i∈I , (Rj )j∈J ) be a structure of signature δ and let u : V ar −→ A be a mapping. For u, there is exactly one homomorphism u : T(Var) −→ (A; (fi )i∈I ), which u continues (see Part I, Theorem 6.2.2). In the following manner, one can interpret the elements of F ORM with the aid of A, u and u : An interpretation function (or valuation) is a mapping vA,u from F ORM into {0, 1} defined by • vA,u (Pj (t1 , ..., tmj )) = 1 iff ( u(t1 ), ..., u (tmj )) ∈ RjA • vA,u (¬α) := ¬(vA,u (α)) and vA,u (α ◦ β) := vA,u (α) ◦ vA,u (β) for all ◦ ∈ J0 • vA,u (∀xk ϕ) = 1 iff v A,u (ϕ) = 1 for all u with u =xk u (i.e., vA,u (∀xk ϕ) = u , u=x u vA,u (ϕ)) k • vA,u (∃xk ϕ) = 1 iff there is a u with u =xk u and vA,u (ϕ) = 1 (i.e., vA,u (∃xk ϕ) = u , u=x u vA,u (ϕ) ) k
1.5 Some Applications of the Function Algebras
113
ϕ ∈ F ORM is satisfied by u : V ar −→ A iff vA,u (ϕ) = 1. ϕ is true (or valid) in A, iff vA,u (ϕ) = 1 for all u : V ar −→ A. A |= ϕ stands for “ϕ is true in A”. A |= ϕ stands for “ϕ is not true (or false) in A”. If A |= ϕ, we call A a model of ϕ. In general, if A |= σ for all σ ∈ Σ ⊆ F ORM , we call A a model of Σ. Notice that a closed formula of F ORM is either true or false in A. Formulas α, β ∈ F ORM are equivalent (in symbol α ≡ β) iff vA,u (α) = vA,u (β) for every structure A and for every u : V ar −→ A. The following theorem is easy to prove: Theorem 1.5.2.3 Let ϕ, ψ ∈ F ORM . Then: (1) ¬∀xk ϕ ≡ ∃xk ¬ϕ, ¬∃xk ϕ ≡ ∀xk ¬ϕ; (2) if xk ∈ f r(ψ) then (Qxk ϕ ◦ ψ) ≡ Qxk (ϕ ◦ ψ) for all Q ∈ {∃, ∀} and ◦ ∈ {∧, ∨}; (3) (∀xk ϕ ∧ ∀xk ψ) ≡ ∀xk (ϕ ∧ ψ), (∃xk ϕ ∨ ∃xk ψ) ≡ ∃xk (ϕ ∨ ψ); (4) ∀xk ∀xl ϕ ≡ ∀xl ∀xk ϕ, ∃xk ∃xl ϕ ≡ ∃xl ∃xk ϕ. Next, we define the mappings repτ , tutτ and subτ from F ORM into F ORM , where τ is a mapping from V ar into T erm. With repτ , one can describe the replacement of variables by some terms in a formula from F ORM . The mapping tutτ renames the bound variables of a formula so that there are no variables of the formula anymore, which is free and bound. subτ is a combination of repτ and tutτ . Let τ : V ar −→ T erm be an arbitrary mapping and τ : T erm −→ T erm the unique homomorphic continuation of τ . Then the mapping repτ : F ORM −→ F ORM is defined by • repτ (Pj (t1 , ..., tmj )) := Pj ( τ (t1 ), ..., τ(tmj )) • repτ (¬α) := ¬repτ (α) and repτ (α ◦ β) := repτ (α) ◦ repτ (β) for all ◦ ∈ J0 • if ϕ = Qxk α with Q ∈ {∀, ∃}, then repτ (ϕ) := Qxk repτ (α), where xk if xi = xk , τ (xi ) := τ (xi ) if xi = xk . For the mapping τ : V ar −→ T erm and ϕ ∈ F ORM let n(τ, ϕ) be the smallest number j0 ∈ N0 with xj ∈ f r(ϕ) ∪ V ar(τ (x)) for all x ∈ f r(ϕ). Let tutτ : F ORM −→ F ORM be defined by • tutτ (ϕ) = ϕ if ϕ is an atom • tutτ (¬ϕ) = ¬(tutτ (ϕ)) and tutτ (ϕ ◦ ψ) = tutτ (ϕ) ◦ tutτ (ψ) for all ◦ ∈ J0 ; • for Q ∈ {∀, ∃} let tutτ (Qxk ϕ) = Qxj tutτ (repτk,j (ϕ)) with j := n(τ, ϕ) and xj if k = l, τk,j (xl ) := xl otherwise.
114
1 Basic Concepts, Notations, and First Properties
For τ : V ar −→ T erm and arbitrary ϕ ∈ F ORM set subτ (ϕ) := repτ (tutτ (ϕ)). The following lemma gives some properties of the above mappings: Lemma 1.5.2.4 (without proof ) Let A be a structure of signature δ, u : V ar −→ A a mapping with the homomorphic continuation u : T erm −→ A. Then: (a) vA,u (ϕ) = vA,u (tutτ (ϕ)); (b) f r(ϕ) = f r(tutτ (ϕ)); (c) vA,τ u (ϕ) = vA,u (subτ (ϕ)). With the aid of the above mapping, we can describe the Hilbert-typecalculus for the classical predicative logic, which consists of following axioms and rules: (I) axioms are: (a) the axioms (A1) - (A13) of the classical propositional logic; (b) all formulas of the form (A14) (∀xk ϕ) ⇒ subτ (ϕ), where τ =xk id (i.e, τ replaces something at most for the variable xk ); (A15) ∃xk ϕ ⇒ ¬∀xk ¬ϕ, ¬∀xk ¬ϕ ⇒ ∃xk ϕ; (A16) subid (ϕ) ⇒ ϕ. (II) rules are: (a) the modus ponens; (b)
ϕ ⇒ subτk,l (ψ) ϕ ⇒ ∀xk ψ,
where
τk,l (xj ) :=
xl if j = k, xj otherwise
and xl ∈ V ar(ψ) ∪ f r(ϕ) (“∀-introductory-rule”); (c) ϕ subτ (ϕ) for all τ . Analogously to the proportional logic, one can define and cons(Σ) for Σ ∈ F ORM in respect to the above calculus. The completeness theorem of the first order logic says that = |= holds, i.e., cons(Σ) = Cons(Σ) is valid for all Σ ⊆ F ORM and that there are axioms and rules, so that = |= was proven for the first time by K. G¨ odel in his dissertation 1929. For the above calculus one can prove the completeness theorem for first order
1.5 Some Applications of the Function Algebras
115
logic similar to Theorem 1.5.2.2, where the Rasiowa-Sikorski-Tarski-Lemma is needed (see [Ric 78] for details). The famous incompleteness theorems of G¨odel say that second order logic 11 does not have a completeness theorem in general.
1.5.3 Many-Valued Logics The above considerations can be generalized when one assigns the “sentences” certain values from the set Ek (k ≥ 3). We receive then a so-called k-valued logic or many-valued logic. One finds a full introduction to the logic for example in [Got 89] or [Kre-G-S 88]. From a mathematical perspective it doesn’t matter which interpretations have the elements of Ek . Nevertheless, it is shown which interpretations of the elements of Ek , for example, are possible. According to these interpretations, one can select certain functions of Pk , with which one can form many-valued logics. For reasons of space limitations, we have excluded information. These functions can be found in [Men 85], where literature on the topic is also provided. 1.5.2.1 The three values of a three-valued logic can be interpreted as follows: “false”, “indefinite”, “true”; “false”, “possible”, “true”; “false”, “undecidable”, “true” or “invalid”, “in part valid”, “full-valid”. Legally relevant actions can be divided in “punishable”, “prohibited but not punishable”, “allowed”. 1.5.2.2 The 4-valued logic seems particularly suitable for analyzing problem areas logically, in which there are two different kinds of truth (or validity) and two different kinds of falsehood (or nullity). Examples: “fact falsehood”, “legal nullity”, “legal validity”, “fact truth” ; “knowledge falsehood”, “belief falsehood”, “belief truth”, “knowledge truth”. 1.5.2.3 A legal interpretation of the 6-valued logic is, for example, 0: “logically false”, 1: “legally invalid”, 2: “false according to facts”, 3: “true according to facts”, 4: “legally valid”, 5: “logically true”. 11
In this logic, quantifications over elements of a structure as well at quantifications over partial sets and relations of the structure are allowed.
116
1 Basic Concepts, Notations, and First Properties
1.5.2.4 Instead of Ek , one can also choose a finite subset of the real numbers x with 0 ≤ x ≤ 1. Then, with the aid of such a set, a probability logic can be formed: The value 1 corresponds to the certainty of the truth; the value 0.5 corresponds to the uncertainty, whether true or false; the value 0 corresponds to the certainty of the falsehood (or the impossibility); values between 1 and 0.5 correspond to degrees of higher probability; values between 0.5 and 0 correspond to degrees of low probability. We notice that one could also have chosen the interpretation of the Fuzzy Logic instead of the above-mentioned probability logic (see for example [BanG 90] or [Til 92]). The problems of all the above-mentioned logics correspond basically to those of the propositional logic. 1.5.4 Information Transformer The functions f n ∈ PA can be understood simply as mathematical models of objects that process information (see Figure 1.1). The “object” from Figure 1.1 receives the information x1 , ..., xn ∈ A at the entries, processed to the information f (x1 ..., xn ) ∈ A. In this case, we neglect the time which is needed for the workmanship. x1 x2 ... xn
f
x ) f (x1 , ..., n Fig. 1.1
Superpositions over functions of PA correspond with this model to the “assembling” of such objects. For example, one can describe the diagram x1
x2
x3
f
g
g(f (x1 , x2 ), x3 , x3 ) Fig. 1.2
1.5 Some Applications of the Function Algebras
117
through the formula g(f (x1 , x2 ), x3 , x3 ). In particular, Boolean functions are used for the mathematical description of electrical circuits or components in computers. This mathematical description is independent of the concrete technical realization (as, for example, relay contact circuits or transistors). Naturally, one receives the so-called completeness problem from these interpretations of the functions from PA : A necessary and sufficient criterion is searched in order to be able to decide whether a system of certain selected functions (which correspond to certain elementary elements) produces all functions from PA by means of superposition. One way of finding this criterion indicates the following theorem: Theorem 1.5.4.1 Let A be a subclass of Pk with the property that to every proper subclass A of A there exists a certain maximal class M of A with A ⊆ M . Furthermore, denote M the set of all maximal classes of A. Then for an arbitrary subset T of A it holds: [T ] = A ⇐⇒ ∀M ∈ M : T ⊆ M.
(1.15)
Proof. “=⇒”: Let [T ] = A. Suppose there is an M ∈ M with T ⊆ M . Then, a contradiction results; however, from that, immediately, A = [T ] ⊆ [M ] = M ⊂ A. “⇐=”: Let T ⊆ Pk be no subset of a maximal class of A. Suppose, [T ] ⊂ A. Then, by assumption, one can find a certain maximal class M ∈ M with [T ] ⊆ M , a contradiction to the supposition. By Theorem 11.1.1, every finitely generated class fulfills the conditions of Lemma 1.5.3.1 and has only finitely many maximal classes, whereby (1.15) supplies a criterion of the wanted kind if one knows the maximal classes of A. Further problems that result from interpreting the functions of PA as information transformers are the following: • Find minimal generating systems, where “minimal” is related to the number of the generating system’s functions or to the arities of the generating system’s functions. • Find algorithms to construct a minimal realization of a given function by certain elementary functions. One can find further problems and their solutions in [Rin 84] and [P¨ os-K 79].
118
1 Basic Concepts, Notations, and First Properties
1.5.5 Classification of Combinatorial Problems In this section, we need some notations (Rk , P olk , Invk , ...) of Chapter 2. Further, we need some concepts of the algorithm theory:12 Algorithms are techniques for solving problems, wherein the word “problem” is used in a very general sense: A problem class consists of infinitely many instances having a common structure. A problem, whose solution is either “yes” or “no”, is called a decision problem. Often, finding a solution algorithm for the solution of a mathematical problem does not suffice. Statements about the complexity of the algorithms are important for the applicability of algorithms in particular. The complexity of an algorithm is a function f (n), which gives the number of the arithmetic steps (e.g. value assignments, elementary arithmetic operations, comparison operations, ...) which are necessary to the estimating of a solution of a given problem with n master data. For g : N −→ R+ let O(g(n)) := {f (n) | (f : N −→ R+ ) ∧ (∃c > 0 ∀n ∈ N : f (n) ≤ c · g(n))} We say that the algorithm has the complexity O(g(n)), if the complexity f (n) of the algorithm belongs to O(g(n)). Generally one holds algorithms with a complexity O(nt ) for “good” and these algorithms are called polynomial algorithms. A decision problem with the complexity O(nt ), where n, t ∈ N, is called tractable. Let P be the class of all tractable problems. L denotes the class of all problems with the complexity O(log n). The class of decision problems for which a positive answer can be verified in polynomial time is denoted by NP (for “non-deterministic polynomial”). That is, we do not only require the answer “yes” or “no”, but the explicit specification of a certificate which allows to verify the correctness of a positive answer. LP denotes the class of decision problems for which a positive answer can be verified in logarithmic time. Obviously, P ⊆ NP. Further, we know that L ⊆ NL ⊆ P. It is the greatest problem of the algorithm theory to decipher whether P = NP is valid. Most people believe, however, that P = NP. A problem is called NP-complete if is in NP and if the polynomial solvability of this problem would imply that all problems in NP are solvable in polynomial time as well. In other words: Each problem in NP can be “transformed” (in polynomial time) to the given NP-complete problem, such that 12
See e.g. [Pap 94] and [Jun 2005].
1.5 Some Applications of the Function Algebras
119
a solution of the NP-complete problem also gives a solution to that other problem in NP. Therefore, if one finds a polynomial algorithm for an NPcomplete problem, this would imply that P = NP. Next, is a short introduction to some papers that deal with classifications of combinatorial problems. Definition A CSP (or a “constraint satisfication problem”) is a triple (V, D, C), where • V is a set of variables • D is a set of values which can take the variables • C := {C1 , C2 , ..., Cq } with Ci := (si , τi ) for i = 1, ..., q, where si is an mi -ary tuple of variables and τi is an mi -ary relation on D (Ci is called constraint). A solution of the CSP is a mapping f : V −→ D with the property ∀ Ci := ((xi1 , xi2 , ..., ximi ), τi ) ∈ C : (f (xi1 ), f (xi2 ), ..., f (ximi )) ∈ τi . Many combinatorial problems can be described as CSP (see [Jea 97] 13 ) Example The problem SAT as CSP An instance of the standard propositional satisfiability problem is specified by giving a formula on propositional logic, and asking whether there are values for the variables that make the formula true. For example, consider the formula t(x1 , x2 , x3 , x4 ) := (x1 ∨ x2 ∨ x3 ∨ x4 ) ∧ (x1 ∨ x2 ∨ x3 )∧ (x3 ∨ x4 ∨ x1 ) ∧ (x3 ∨ x2 ∨ x4 ) ∧ (x1 ∨ x3 ). The question is whether there are a1 , a2 , a3 , a4 ∈ {0, 1} with t(a1 , a2 , a3 , a4 ) = 1. This problem can be expressed as the CSP as follows: Put V := {x1 , x2 , x3 , x4 }, D := {0, 1}, C1 C2 C3 C4 C5 C
:= := := := := :=
((x1 , x2 , x3 , x4 ), D4 \ {(0, 0, 0, 0)}), ((x1 , x2 , x3 ), D3 \ {(1, 1, 0)}), ((x3 , x4 , x1 ), D3 \ {(1, 1, 0)}), ((x3 , x2 , x4 ), D3 \ {(1, 1, 0)}), ((x1 , x3 ), D2 \ {(1, 1)}), {C1 , c2 , C3 , C4 }.
The solutions of the above problem are 13
In this paper are 20 combinatorial problems expressed as CSP.
120
1 Basic Concepts, Notations, and First Properties
x1 x2 x3 x4 f1 f2 f3 f4 f5 f6
: : : : : :
0 0 0 0 1 1
0 0 1 1 0 0
0 1 0 0 0 0
1 0 0 1 0 1
It is also possible to describe a CSP with the aid of the following notations: Definitions Let V be a nonempty set and let τ1 , τ2 , ..., τt be relations on V . Then, (V ; τ1 , τ2 , ..., τt ) is called relational structure. The mapping : {1, 2, ..., t} −→ N is the rank functions of the relational structure (V ; τ1 , τ2 , ..., τt ) if (i) is the arity of the relation τi (i = 1, 2, ..., t). A relational structure Σ is similar to a relational structure Σ if they have the same rank function. Let Σ := (V ; τ1 , ..., τt ) and Σ := (V ; τ1 , ..., τt ) be two similar relational structure, and let be their common rank function. A homomorphism from Σ into Σ is a mapping h : V −→ V such that ∀i ∈ {1, ..., t} : (a1 , .., ahi ) ∈ τi =⇒ (h(a1 ), ..., h(ahi )) ∈ τi . Let Hom(Σ, Σ ) be the set of all homomorphisms from Σ into Σ . Obviously, it holds that Theorem 1.5.5.1 ([Jea-C-P 98]) (a) Let P := (V, D, C) be a CSP with C := {(s1 , τ1 ), (s2 , τ2 ), ..., (sq , τq )}. Then, the set of all solutions of P is the set Hom(Σ, Σ ), where Σ := (V ; {s1 }, {s2 }..., {sq }) and Σ := (D; τ1 , τ2 , ..., τq ). Conversely: Let Σ := (V ; τ1 , ..., τt ) and Σ := (D; τ1 , ..., τt ) be two similar relational structures. Then, Hom(Σ, Σ ) is the set of all solutions of the CSP (V, D, S) with C :=
t
{(s, τi ) | s ∈ τi }.
i=1
The following theorem is our first example of an application of P ol and Inv (see Chapter 2) in algorithm theory.
1.5 Some Applications of the Function Algebras
121
Theorem 1.5.5.2 Let D := Ek , Γ := {1 , ..., q } ⊆ Rk , V := {x1 , ..., xn } and let M be a set of mappings from V into Ek . Then it holds: There exists a CSP (V , D, C), where V ⊆ V and C = {(c1 , 1 ), ..., (cq , q )}, with the solution set S and S|V = M if and only if := {(f (x1 ), ..., f (xn )) | f ∈ M } ∈ Invk (P olk Γ ). The proof of the above theorem is explained by subsequent examples: We choose: D := E2 , 1 := {(0, 1, 1), (1, 0, 0), (1, 1, 1)}, 2 := {(0, 0), (1, 0)}, 3 := {(1, 1)}, Γ := {1 , 2 , 3 }, V := {x1 , x2 , x3 , x4 } and M := {f1 , f2 }, where x f1 (x) f2 (x) x1 0 1 x2 1 0 x3 1 1 x4 1 1 “⇐=”: Assume, := {(f (x1 ), ..., f (xn )) | f ∈ M } ∈ Invk (P olk Γ ). Then can be obtained by a finite number of applications of the elementary operations 3 (see Section 2.3). For example: ζ, τ, pr, ∧ and × from and δk;{1,2} = {(x1 , x2 , x3 , x4 ) ∈ E24 | ∃x5 ∈ E2 : (x1 , x5 , x3 ) ∈ 1 ∧ (x5 , x2 ) ∈ 2 ∧ (x5 , x4 ) ∈ 3 }. Therefore, V = {x1 , x2 , x3 , x4 , x5 } and (V , D, C), where C := {((x1 , x5 , x3 ), 1 ), ((x5 , x2 ), 2 ), ((x5 , x4 ), 3 )}, is a CSP with the solution set S = {f1 , f2 }, where x f1 (x) f2 (x) x1 0 1 x2 1 0 x3 1 1 x4 1 1 x5 1 1 and S|V = M = {f1 , f2 }. “=⇒”: Choose V := {x1 , x2 } and M := {g1 , g2 }, where x g1 (x) g2 (x) x1 0 1 x2 0 0 ({x1 , x2 , x3 , x4 , x5 }, E2 , C) with C := {((x1 , x5 , x3 ), 1 ), ((x5 , x2 ), 2 ), ((x5 , x4 ), 3 )} is a CSP and it holds S|V = M = {g1 , g2 }. Then
122
1 Basic Concepts, Notations, and First Properties
= {(0, 0), (1, 0)} = {(x1 , x2 ) ∈ E22 | ∃x3 ∈ E2 ∃x4 ∈ E2 ∃x5 ∈ E2 : (x1 , x5 , x3 ) ∈ 1 ∧ (x5 , x2 ) ∈ 2 ∧ (x5 , x4 ) ∈ 3 } Thus ∈ Invk P olk Γ (see Chapter 2). Next we show how one can use the above theorem for solving the following task: Put D := E2 , Γ
:= { ⊆ E22 | = ∅} =: {1 , ..., 15 },
x f1 (x) f2 (x) f3 (x) x1 0 0 0 M := {f1 , f2 , f3 }, where x2 0 0 1 x3 0 1 0 x4 1 0 0 Is there a CSP (V , E2 , C) with V ⊆ V , C = {((c1 , 1 )), ..., (c1515 )} and the solution set S which ones S|V = M is valid for? Because of the above theorem, this question is equivalent for the following question: := {(f (x1 , ..., f (x4 ))) | f ∈ M } = {(0, 0, 0, 1), (0, 0, 1, 0), (0, 1, 0, 0)} ∈ Inv2 P ol2 Γ ? With the help of the results of Chapter 3, it is easy to prove that P ol2 Γ =
15
P ol2 i = [h2 ],
i=1
where h2 (x, y, z) := (x ∧ y) ∨ (x ∧ z) ∧ (y ∨ z). Then, because of ⎛ ⎞ ⎛ ⎞ 0 0 0 0 ⎜0 0 1⎟ ⎜0⎟ ⎟ ⎜ ⎟ h2 ⎜ ⎝0 1 0⎠=⎝0⎠ 1 0 0 0 we have ∈ Inv2 P ol2 ; i.e., there is no CSP with the above properties. Definitions The general combinatorial problem (GCP) is the decision problem with: Instance: A pair (Σ1 , Σ2 ) of similar finite relational structures Σ1 and Σ2 . Question: Is there a homomorphism from Σ1 to Σ2 ? For any GCP instance P := (Σ1 , Σ2 ) a homomorphism from Σ1 to Σ2 will be called a solution of P .
1.5 Some Applications of the Function Algebras
123
The GCP (or CSP) is known to be NP-complete. However, certain restrictions may affect the complexity of GCP (or CSP). One of the natural possibilities for restricting CSP is by limiting the relations that can appear in constraints (or relational structures). Definition Let Γ be a set of relations on the set D. Denote by CSP(Γ ) the subclass of CSP defined by the following property: any constraint relation in any instance must belong to Γ . The next theorem is the basis for the following theorems. Theorem 1.5.5.3 ([Jea 98]; without proof ) Let Γ and Ψ be finite sets of relation on D (w.l.o.g. we put D := Ek ). If Ψ ⊆ Invk (P olk Γ ) then GCP(Ψ ) can be reduced in polynomial time to GCP(Γ ). In other words: For any finite set Γ ⊆ Rk , the complexity of GCP(Γ ) is determined, up to polynomial-time reductions, by P olk Γ . Theorem 1.5.5.4 ([Jea 98]; without proof ) Let D := Ek , k ≥ 2 and Γ ⊆ Rk . Then (1) GCP(Γ ) ⊆ P, if one of the following conditions is valid: (a) P olk Γ contains a constant function. (b) P olk Γ contains a binary function which is associative, commutative and idempotent. (c) r ∈ P olk Γ , where r(x, y, z) := x + y + z and (Ek ; +) is Abelian 2group. (2) If P olk Γ contains a ternary function ϕ defined by y if y = z, ϕ(x, y, z) := x otherwise, then GCP(Γ ) ⊆ NL. (3) If each function of P olk Γ is either a projection or a semiprojection, then GCP(Γ ) is NP-complete. With the aid of the above theorem and Post’s description of all closed sets of Boolean functions, one can prove the following: Theorem 1.5.5.5 ([Sch 78]) For arbitrary Γ ⊆ R2 it holds: GCP(Γ ) is NP-complete, if P ol2 Γ ⊆ [P21 ]; in all other cases we have GCP(Γ ) ⊆ P. More can be found on the topic in [Jea 98], [Jea-C-P 98], [Bul-K-J 2000] and [Coh-J-G 2003].
This page intentionally left blank
2 The Galois-Connection Between Function- and Relation-Algebras
This section aims to develop a “suitable” means to describe function algebras or clones. I mean, suitable in the sense that “big” function algebras (or clones) can be described with an “expenditure” as small as possible. Analogously to other fields of algebra we introduce invariants for our function algebras. The two papers [Bod-K-K-R 68/69] of V. G. Bodnarˇcuk, L. A. Kaluˇznin, V. N. Kotov and B. A. Romov are basis of this so-called Pol-Inv theory (or Galois theory for function- and relation-algebras). These articles generalize results by M. Krasner on a Galois theory for groups (see [Kra 45], [Kra 68/69]). A full representation of the Pol-Inv theory with many applications can be found in the monograph [P¨ os-K 79] by R. P¨ oschel and L. A. Kaluˇznin.
2.1 Relations An h-ary relation on Ek is a subset of the h-fold Cartesian product Ekh of the set Ek , h ∈ N. The elements (a1 , a2 , ..., ah ) of (we say “h-tuple”) are written as columns ⎞ ⎛ a1 ⎜ a2 ⎟ ⎟ ⎜ ⎝ ... ⎠ , ah and then we also write
⎛
⎞ a1 ⎜ a2 ⎟ ⎜ ⎟ ⎝ ... ⎠ ∈ . ah
The relation is written often as a matrix whose columns are the elements of the relation. For example,
126
2 The Galois-Connection Between Function- and Relation-Algebras
⎞ a1 a1 a1 := ⎝ ... ... ... ⎠ ah ah ah ⎛
instead of := {(a1 , ..., ah ), (a1 , ..., ah ), (a1 , ..., ah )}. We think of this matrix representation of if we subsequently talk about the length h and the width || of the relation as well as about rows from . Denote Rkh the set of all h-ary relations on Ek and let Rk := Rkh . h≥1
We remark that the empty set is an element of Rk . If Q ⊆ Rk then let Qh := Q ∩ Rkh .
2.2 Diagonal Relations The simplest relations, in a certain sense1 , are the diagonal relations (or diagonals) defined as follows: For an arbitrary equivalence relation ε on {1, 2, ..., h} let h δk,ε := {(a1 , ..., ah ) ∈ Ekh | (i, j) ∈ ε =⇒ ai = aj }.
If h or k follows from the context, then we write only δε or δεh or δk,ε . Every element of the set h Dkh := { δk,ε | ε is an equivalence relation on {1, 2, ..., h} }.
is called a diagonal h-ary relation. Let Dk := {∅} ∪
Dkh
h≥1
be the set of all diagonal relations. h , we often declare this For the purpose of a more simple description of δk,ε relation in the form h δk;ε 1 ,...,εr or, briefly, by δε1 ,...,εr , where ε1 , ..., εr are exactly the equivalence classes of ε, which have at least two elements. In particular, we have h δk; = Ekh
and 1
See Theorem 2.5.1.
h = {(x, x, ..., x) ∈ Ekh | x ∈ Ek }. δk;E k
2.4 Relation Algebras, Co-Clones, and Derivation of Relations
127
2.3 Elementary Operations on Rk We define in this section some operation ζ, τ, pr, ∧ and × on Rk with whose aid we can form later more “complex” operations on Rk . We call, therefore, the operations ζ, τ, pr, ∧ and × the elementary operations on Rk .
Let ∈ Rkh and ∈ Rkh , where h, h ∈ N. Then, if = ∅ and = ∅, let ζ ∈ Rkh , τ ∈ Rkh , pr ∈ Rkh−1 for h ≥ 2 and pr = ∅ for h = 1, × ∈ Rkh+h and ∧ ∈ Rkh (only for h = h ) defined by: ζ := {(a2 , a3 , ..., ah , a1 ) | (a1 , a2 , ..., ah ) ∈ } (cyclical exchanging of the rows), τ := {(a2 , a1 , a3 , ..., ah ) | (a1 , a2 , ..., ah ) ∈ } (exchange of the first two rows) for h ≥ 2 and ζ = τ = for h = 1 or = ∅; pr := {(a2 , ..., ah ) | ∃a1 ∈ Ek : (a1 , a2 , ..., ah ) ∈ } (projection onto the 2th,..., h-th coordinate or the strike of the first row) for h ≥ 2, × := {(a1 , ..., ah , b1 , ..., bh ) | (a1 , a2 , ..., ah ) ∈ ∧ (b1 , b2 , ..., bh ) ∈ } (Cartesian product of and ) and ∧ := {(a1 , ..., ah ) | (a1 , ..., ah ) ∈ ∩ } (intersection of the relations and ).
2.4 Relation Algebras, Co-Clones, and Derivation of Relations The algebra
3 , ζ, τ, pr, ∧, ×) Rk := (Rk ; δk;{1,2}
of type (0, 1, 1, 1, 2, 2) is called full relation algebra on Ek . Every subalgebra Q of Rk (in symbol Q ≤ Rk ) is a relation algebra on Ek . Let Q ⊆ Rk . Then, [Q] denotes the set of all relations of Rk that can be obtained by a finite number of applications of the elementary operations 3 ,i.e., [Q] is the universe of ζ, τ, pr, ∧ and × from the relations of Q and δk;{1,2} the smallest relation algebra, which contains Q. If [Q] = Q (⊆ Rk ) we say that Q is closed or Q is a co-clone of Rk . Further, we say a relation can be derived from the relation (or is -derivable), if ∈ [{}]. In this case we also write: .
128
2 The Galois-Connection Between Function- and Relation-Algebras
2.5 Some Operations on Rk Derivable from the Elementary Operations We say that an operation on Rk is derivable from the elementary operations ζ, τ, pr, ∧ and × (or {ζ, τ, pr, ∧, ×}-derivable), if their effect on an arbitrary relation ∈ Rk can also be described by the effect of a finite com3 on . position of the elementary operations and δk;{1,2} The following is a small list of such derivable operations. In this case, always describes an h-ary and an h -ary relation of Rk . (O1 ): Permutation of coordinates (or permutations of rows). As is known, the permutations 1 2 ... h − 1 h 1 2 3 ... h and 2 3 ... h 1 2 1 3 ... h form a generating system for the symmetric group Sh (i.e., for the set of all permutations on {1, 2, ..., h} with the operation ). Consequently one can realize all rearrangements of the rows of with the aid of ζ and τ . Thus, for every s ∈ Sh , σs () := {(as(1) , ..., as(h) ) | (a1 , ..., ah ) ∈ } is a {ζ, τ, pr, ∧, ×}-derivable operation. (O2 ): Projection onto the α1 -th, ..., αt -th coordinates (or deleting of rows). For {α1 , ..., αt } ⊆ {1, 2, .., h} it holds: prα1 ,...,αt () := {(aα1 , ..., aαt ) | (a1 , .., ah ) ∈ } = pr(pr(...(pr (σs ()))...)), h−t times where s ∈ Sh and s(α1 ) = h − t + 1, s(α2 ) = h − t + 2, ..., s(αt ) = h. In particular, we have prs(1),...,s(n) () = σs (). We remark that, in the case where is given in the form {(a0 , a1 , ..., ah−1 ) | ....}, we choose {α1 , ..., αt } ⊆ {0, 1, 2, .., h − 1} and define prα1 ,...,αt () in analog manner, as above.
2.5 Some Operations on Rk Derivable from the Elementary Operations
129
(O3 ): Identification of coordinates. For i, j ∈ {1, 2, ..., h} and i = j let ∆i,j () := {(a1 , ..., aj−1 , aj+1 , ..., ah ) | (a1 , ..., aj−1 , ai , aj+1 , ..., ah ) ∈ } and ∆ := ∆1,2 . ∆i,j can be formed as follows: 3 ) = Ek and It is easy to prove that pr1 (δk;{1,2} h δk;{i,j} = pr1,...,i−1,h+1,i+1,...,j−1,h+2,j+1,...,k (1 ), 3 and i < j. Consequently, ∆i,j is where 1 := Ek × ... × Ek ×pr1,2 δk;{1,2} h−2 times derivable because of h ∆i,j = pr1,...,j−1,j+1,...,h ( ∧ δk,{i,j} ).
(O4 ): Doubling of coordinates (rows). One receives a doubling of the i-th row of as follows: νi () := {(a1 , ..., ai−1 , ai , ai , ai+1 , ..., ah ) | (a1 , ..., ah ) ∈ } 3 = pr1,...,i−1,h,h+1,,i,...,h−1 (∆i,h+1 ( × pr(δk;{2,3} )).
(O5 ): Adding of fictitious coordinates. Let ∇ := {(a1 , ..., ah+1 )|a1 ∈ Ek ∧ (a2 , ..., ah+1 ) ∈ }. The first coordinate of ∇ is a so-called fictitious coordinate. Then, with the aid of (O1 ) one can derive the relation ∇i := {(a1 , ..., ai−1 , ai , ai+1 , ..., ah+1 ) ∈ Ekh+1 | (a1 , ..., ai−1 , ai+1 , ..., ah+1 ) ∈ } for i ∈ {1, ..., h + 1}. (O6 ): General composition (relation product). Let ◦t := {(a1 , ..., ah−t , bt+1 , ..., bh ) | ∃u1 , ..., ut ∈ Ek : (a1 , ..., ah−t , u1 , ..., ut ) ∈ ∧ (u1 , ..., ut , bt+1 , ..., bh ) ∈ } for t ∈ N with t ≤ h and t ≤ h . In particular, o := o1 . For h = h = 2, ◦ is the well-known relation product . The following theorem results from the above considerations.
130
2 The Galois-Connection Between Function- and Relation-Algebras
Theorem 2.5.1 Every co-clone Q of Rk contains all diagonal relations and is closed in respect to – permutation of coordinates (rows), – projection onto coordinates (or deleting of rows), – identification of coordinates (rows), – doubling of coordinates (rows), – adding of fictitious coordinates, – (finite) intersection formation, – Cartesian products and – general composition.
2.6 The Preserving of Relations; Pol, Inv We say that a function f n ∈ Pk preserves the relation ∈ Rkh (or is invariant for f or is a invariant for f ), if ⎛ ⎛ ⎞ ⎞ f (a11 , a12 , ..., a1n ) a11 a12 ... a1n ⎜ f (a21 , a22 , ..., a2n ) ⎟ ⎜ a21 a22 ... a2n ⎟ ⎜ ⎟ ⎟ f⎜ ⎝ . . . . . . . . . . . . . . . ⎠ := ⎝ . . . . . . . . . . . . . . . . . . ⎠ ∈ ah1 ah2 ... ahn f (ah1 , ah2 , ..., ahn ) for all
⎛
⎞ ⎛ a11 a12 ⎜ a21 ⎟ ⎜ a22 ⎜ ⎟ ⎜ ⎝ ... ⎠ , ⎝ ... ah1 ah2
⎞
⎛
⎞ a1n ⎟ ⎜ ⎟ ⎟ , ..., ⎜ a2n ⎟ ∈ . ⎠ ⎝ ... ⎠ ahn
The empty set ∅ is preserved by every function f ∈ PA . Note that f preserves iff is the universe of a subalgebra (A; f )h . By P olk or, briefly, P ol we denote the set of all functions f ∈ Pk that preserve the relation . For Q ⊆ Rk , we put P olk . P olk Q := ∈Q
P olk or P olk Q is a short-cut of polymorphisms of or Q, respectively. The set of all relations ∈ Rk that are preserved from the function f ∈ Pk is Invk f. For A ⊆ Pk let
2.6 The Preserving of Relations; Pol, Inv
Invk A :=
131
Invk f
f ∈A
be the set of all invariants of A and let (Invk A)n := (Invk A) ∩ Rkh be the set of all n-ary invariants of A. If k can be seen from the context, we write Inv instead of Invk . Further notations used by us are P oln Q := (P ol Q)n (Q ⊆ Rk or Q ∈ Rk ) and
Inv n A := (Inv A)n (A ⊆ Pk or A ∈ Pk )
for n ∈ N. Elementary connections between P ol and Inv are summarized in the following theorem. Theorem 2.6.1 For arbitrary A, B ⊆ Pk and arbitrary S, T ⊆ Rk , it holds: (a) A ⊆ B =⇒ Inv B ⊆ Inv A, S ⊆ T =⇒ P ol T ⊆ P ol S; (b) A ⊆ P ol Inv A, S ⊆ Inv P ol S; ((a) and (b) mean that the pair (P ol, Inv) of mappings P ol : P(Pk ) −→ P(Rk ), A → P olk A and P ol : P(Rk ) −→ P(Pk ), Q → Invk Q is a Galois connection (see Part I, 4.4) between the sets Pk and Rk .) (c) Inv P ol Inv A = Inv A, P ol Inv P ol S = P ol S; (d) A ⊆ P ol S ⇐⇒ S ⊆ Inv A; (e) P ol (S ∪ T ) = P ol S ∩ P ol T , Inv A ∪ B = Inv A ∩ Inv B. Proof. (a), (b), (d), and (e) are direct conclusions from the definitions of P ol and Inv. (c): Let S := Inv A. By (b) we have S ⊆ Inv P ol S. Conversely, it holds A ⊆ P ol Inv A and thus by (a): Inv P ol Inv A ⊆ Inv A. Therefore, Inv P ol Inv A = Inv A. Analogously, one can show that P ol Inv P ol S = P ol S holds.
132
2 The Galois-Connection Between Function- and Relation-Algebras
Theorem 2.6.2 For every A ⊆ Pk and every Q ⊆ Rk the sets Inv A and P ol Q are closed (in respect to the operations defined above, respectively); i.e., P ol Q is a clone of Pk and Inv A is a co-clone of Rk . Furthermore, it holds: Inv [A] = Inv A and P ol [Q] = P ol Q. In particular we have: Inv [{e21 }] = Rh and P ol Dk = Pk . Proof. Let , ∈ Inv A and f ∈ A be arbitrary. Then, f preserves the -derivable relations ζ, τ , pr, ∧ and × obviously. Thus {ζ, τ , pr, ∧ , × } ⊆ Inv A, whereby Inv A is closed. Now let f n , g m ∈ P ol Q and ∈ Q be arbitrary. Clear that, then the functions ζf, τ f and ∆f also preserve . Further, the relation is also an invariant of f g, because f (g(r1 , ..., rm ), rm+1 , ..., rm+n−1 ) ∈ holds for all r1 , ..., rm+n−1 ∈ , since g(r1 , .., rm ) ∈ . Inv [A] = Inv A follows from Inv [A] ⊆ Inv A (because of A ⊆ [A] and Theorem 2.6.1, (a)) and Inv A ⊆ Inv [A]. (By Theorem 2.6.1, (a) we have A ⊆ P ol Inv A indeed. Since P ol Inv A is closed, this implies [A] ⊆ P ol Inv A. If one uses Theorem 2.6.1, (a) again and then 2.6.1, (c), one receives Inv P ol Inv A = Inv A ⊆ Inv [A].) Analogously, one can prove P ol [Q] = P ol Q. One can easily checks the remaining statements of the theorem. A conclusion of Theorem 2.6.1, (a) and of the definition of (see Section 2.4) is the following Theorem 2.6.3 For arbitrary relations , ∈ Rk it holds: =⇒ P ol ⊆ P ol .
2.7 The Relations χn and Gn For arbitrary n ∈ N and k ∈ N\{1} denote χk;n or – if k can be seen from the context – χn the k n -ary relation, whose rows are just all (x1 , ..., xn ) ∈ Ekn that are arranged (we say “lexicographical”) unambiguously according to the following regulation:
2.7 The Relations χn and Gn
133
The tuple (x1 , ..., xn ) is before the tuple (y1 , ..., yn ), if the integer x1 · k n−1 + x2 · k n−2 + ... + xn−1 · k + xn is smaller than y1 · k n−1 + y2 · k n−2 + ... + yn−1 · k + yn . For example, the following is valid:
χ2;3
⎛
0 ⎜0 ⎜ ⎜0 ⎜ ⎜0 := ⎜ ⎜1 ⎜ ⎜1 ⎜ ⎝1 1
0 0 1 1 0 0 1 1
⎞ 0 1⎟ ⎟ 0⎟ ⎟ 1⎟ ⎟. 0⎟ ⎟ 1⎟ ⎟ 0⎠ 1
We denote the columns of χn with χ(1), ..., χ(n). Obviously, there is exactly a function fr ∈ Pkn with f (χn ) = r to every column n r ∈ Ekk . The relation n Gn (A) := {r ∈ Ekk |fr ∈ An }, which one can form with the aid of the functions fr , is called n-th graphic of A ⊆ Pk . The following theorem summarizes elementary properties of the relation Gn (A). Theorem 2.7.1 For an arbitrary clone A ⊆ Pk it holds: (a) ∀n ∈ N : Gn (A) ∈ Inv A; (b) f n ∈ An ⇐⇒ f n ∈ P ol Gn (A); (c) A ⊆ ... ⊆ P ol Gn (A) ⊆ P ol Gn−1 (A) ⊆ ... ⊆ P ol G2 (A) ⊆ P ol G1 (A); (d) A = n≥1 P ol Gn (A); (e) ∀ ∈ Inv A : ∈ [ n≥1 {Gn (A)}]; (f ) Inv A = [ n≥1 {Gn (A)}]. Proof. (a): Let g m ∈ A and r1 , ..., rm ∈ Gn (A) be arbitrary. Then g(r1 , ..., rm ) = g(fr1 , ..., frm ) = h(χn ), where
134
2 The Galois-Connection Between Function- and Relation-Algebras
h(x1 , ..., xn ) := g(fr1 (x1 , ..., xn ), ..., frm (x1 , ..., xn )). Since h belongs to An , we obtain h(χn ) ∈ Gn (A). (b): If f n ∈ A, we have f n ∈ P ol for every ∈ Inv A. Consequently, f n ∈ P ol Gn (A) because of (a). On the other hand, f n ∈ Gn (A) implies the existence of a certain r ∈ Gn (A) with f n (χn ) = r; thus f = fr ∈ An is valid. (c) and (d) follow from (b) and from the clone properties. (e): Let ∈ Inv h A be arbitrary and t := ||. We show that can be derived from Gt (A) using the operation prα1 ,...,αh . Since Jk ⊆ A, we have χt ⊆ Gt (A). For every j ∈ {1, ..., h}, one can find an αj so that the j-th row of is identical with the αj -th row of χt . Because of ∈ Inv h A, it follows prα1 ,...,αh Gt (A) = ∈ [{Gt (A)}]. (f): By (e) we have Inv A ⊆ [ n≥1 {Gn (A)}]. Further, because of (a) and Theorem 2.6.2, we have [ n≥1 {Gn (A)}] ⊆ Inv A. Hence, (f) is valid.
2.8 The Operator ΓA For arbitrary A ⊆ Pk denote ΓA a mapping from Rk into Rk , which is defined for σ ∈ Rkh as follows: (2.1) ΓA (σ) := { ∈ Rk | ∈ Inv A ∧ σ ⊆ }. In the language of the Universal Algebra, ΓA (σ) is a subalgebra of (Ek ; A)h , which is generated by σ, or ΓA (σ) is the universe of the smallest subalgebra of the algebra (Ek ; A)h , which contains the set σ. Obviously, ΓA is a hull operator. Theorem 2.8.1 For an arbitrary clone A ⊆ Pk and every n ∈ N it holds: (a) ΓA (χn ) ∈ Inv A; (b) ΓA (χn ) = Gn (A); (c) An = {fr |r ∈ ΓA (χn )}. Proof. (a) follows from [Inv A] = Inv A (see Theorem 2.6.2) and the definition of ΓA (χn ). (b): Since every projection eni belongs to An , we have χn ⊆ Gn (A). Denote now an arbitrary k n -ary relation of Rk with χn ⊆ . If ∈ Inv A, then f (χn ) ∈ for every f ∈ An , i.e., Gn (A) ⊆ . Consequently, we have shown that Gn (A) ⊆ ΓA (χn ) holds. ΓA (χn ) ⊆ Gn (A) follows from Gn (A) ∈ Inv A (see Theorem 2.7.1, (a)). (c) is an easy conclusion from (b) and the definition of Gn (A).
2.9 The Galois Theory for Function- and Relation-Algebras
135
2.9 The Galois Theory for Function- and Relation-Algebras Theorem 2.9.1 Let A be a clone of Pk . Then A = P ol Inv A. Proof. By Theorem 2.6.1, (b) we have A ⊆ P ol Inv A. To prove that P ol Inv A ⊆ A let f n ∈ P ol Inv A be arbitrary. Because of Theorem 2.7.1, (a) we have that f ∈ P ol Gn (A) holds and (by Theorem 2.7.1, (b)) f ∈ An . Thus A = P ol Inv A. Theorem 2.9.2 Let Q be a co-clone of Rk . Then Q = Inv P ol Q. Proof. Let A := P ol Q. Because of Theorem 2.6.1, (b) we have Q ⊆ Inv A. To prove that Inv A ⊆ Q it is sufficient to show that Γ (χt ) ∈ Q for arbitrary t ∈ N, since [ t≥1 {ΓA (χt )}] = Inv A (see Theorem 2.7.1, (f) and Theorem 2.8.1, (b)). Let now γ := { ∈ Q|χt ⊆ }. t
Because of Ekk ∈ Q and the fact that Q is closed in respect to ∩, we have t χt ⊆ γ and γ is the smallest relation (∈ Qk ), which contains χt , in respect to cardinality. Further, we have ΓA (χt ) ⊆ γ, since γ ∈ Q ⊆ Inv A (see (2.1)). Consequently, our theorem is proven, if we can show ΓA (χt ) = γ. Suppose, ΓA (χt ) ⊂ γ. Then, there is a column r ∈ γ\ΓA (χt ). Because of At = {fs |s ∈ ΓA (χt )} (see Theorem 2.8.1, (c)) we have fr ∈ At . Consequently, there exists an m-ary relation β ∈ Inv A and certain columns r1 , ..., rm ∈ β with f (r1 , ..., rm ) ∈ β. Every row of the matrix (r1 , ..., rm ) is also a row of the matrix χt . Denote ij the number of a row of χt , which agrees with the j-th row of (r1 , ..., rm ) (j = 1, 2, ..., m). Let now t
k +m γ := pr1,2,...,kt (γ × β) ∩ δ{i . t t t 1 ,k +1},{i2 ,k +2},...,{im ,k +m}
Since Q is closed, γ belongs to Q, and by construction of γ we have χt ⊆ γ ⊆ γ. Furthermore, we have r ∈ γ\γ , since r1 , ...., rt ∈ β, fr (r1 , ..., rt ) ∈ β and fr (χt ) = r ∈ γ. With γ we received a contradiction to the choice of γ. Thus, γ = ΓA (χt ). With the aid of Theorems 2.9.1 and 2.9.2, we can prove the important properties of the P ol-Inv-connection:
136
2 The Galois-Connection Between Function- and Relation-Algebras
Theorem 2.9.3 (Theorem of V. G. Bodnarˇ cuk, L. A. Kaluˇ znin, V. N. Kotov and B. A. Romov; [Bod-K-K-R 68/69]) indextheorem of Bodnarˇcuk, Kaluˇznin,. Kotov and Romov Let L(Pk ) (or L(Rk )) be the set of all clones (or co-clones) of Pk (or Rk ) respectively. Then the mappings Inv : L(Pk ) −→ L(Rk ), A → Inv A and
P ol : L(Rk ) −→ L(Pk ), Q → P ol Q
are bijective mappings, which reverse the partial order ⊆, i.e., it holds ∀A, B ∈ L(Pk ) : A ⊆ B =⇒ Inv B ⊆ Inv A and
∀S, T ∈ L(Rk ) : S ⊆ T =⇒ P ol T ⊆ P ol S.
In other words: The lattices (L(Pk ), ⊆) and (L(Rk ), ⊆) are antiisomorphic. Pk
Rk
= P ol Inv A B A Inv
P ol T
B
S = Inv P ol S
Inv A
P ol S
T
Jk
Dk
Fig. 2.1
Proof. By Theorem 2.6.2, the mappings Inv and P ol are mappings from L(Pk ) (or L(Rk )) into L(Rk ) (or L(Pk )), respectively. The surjectivity and the injectivity (and then the bijectivity) of these mappings are easy conclusions from Theorem 2.9.1 and Theorem 2.9.2 (with the help of Theorem 2.6.2). The “reversal property” of P ol and Inv (in respect to ⊆) was already given in Theorem 2.6.1, (a).
2.10 Some Modifications of the P ol-Inv-Connection
137
2.10 Some Modifications of the P ol-Inv-Connection 2.10.1 Galois Theory for Finite Monoids and Finite Groups It is well-known that every finite semigroup H = (H; ◦) is isomorphic to a 1 certain subsemigroup of (P|H| ; ) and every finite group G = (G; ◦) is isomorphic to a certain subgroup of the group (S|G| ; ), where Sk := Pk1 [k] for k ∈ N. 2
Furthermore we have Lemma 2.10.1.1 For an arbitrary subset A of [Pk1 ], the set A is a clone of [Pk1 ] if and only if A = [A]∇ holds and (A1 ; ) is a subsemigroup of (Pk1 ; ) with the unit element e. In other words, a clone A ⊆ [Pk1 ] is completely determined by the monoid (A1 ; ). Because of the above properties, it is possible to derive a Galois theory for semigroups and groups from the Galois theory for function algebras (see Section 2.9). For this purpose, we define two new operations ∨ and ¬ on Rk : For arbitrary , ∈ Rkh and h ∈ N we set ∨ := ∪ (union) and
¬ := Ekh \ (negation, complement).
The following lemma supplies a reason for these new relation operations. Lemma 2.10.1.2 It holds: (a) ∀H ⊆ Pk1 : , ∈ Inv h H =⇒ ∨ ∈ Inv h H; (b) ∀G ⊆ Sk : ∈ Inv h G =⇒ ¬ ∈ Inv h G. Proof. (a): If f ∈ H ⊆ Pk1 , {, } ⊆ Inv H and r ∈ ∨ , then we have obvious r ∈ or r ∈ , whereby f (r) ∈ ∨ , since f preserves the relations and . Consequently, ∨ is also an invariant of f . (b): Let f ∈ G ⊆ Sk , ∈ Inv G and r ∈ ¬ be arbitrary. Set r := f (r). Then r belongs to ¬, since f −1 (r ) = r, f −1 ∈ [G] and Inv G = Inv [G] (see Theorem 2.6.2). Consequently, f preserves the relation ¬. An algebra of the form 3 (Q; δk;{1,2} , ζ, τ, pr, ×, ∧, ∨) 2
For proof, one can assume w.l.o.g. H = G = {0, 1, ..., k − 1}. Let now fa (x) := a ◦ x ∈ Pk1 for arbitrary a ∈ Ek . Then, the mapping α : Ek −→ Pk1 , a → fa is an isomorphic mapping from H (or G) onto the semigroup (or group) (A)
({f0 , f1 , ..., fk−1 }; ), since α(a ◦ b)(x) = fa◦b (x) = (a ◦ b) ◦ x = a ◦ (b ◦ x) = fa (fb (x)) = (fa fb )(x).
138
2 The Galois-Connection Between Function- and Relation-Algebras
with Q ⊆ Rk is called Krasner-algebra of first kind and an algebra of the form 3 , ζ, τ, pr, ×, ∧, ∨, ¬) (Q; δk;{1,2} with Q ⊆ Rk Krasner-algebra of second kind. In Theorem 2.10.1.4, we will see that the algebras just defined are the right partners for semigroups (or groups) for a Galois-correspondence. Following our terminology from Section 2.4, we call this a clone, which is also closed, concerning the operation ∨, a co-monoid. Moreover, a co-monoid, which is closed concerning the operation ¬, is a co-group. The following lemma summarizes all auxiliary statements that are necessary to prove Theorem 2.10.1.4. Lemma 2.10.1.3 Let H, G ⊆ Pk1 and Q, T ⊆ Rk . Further, let H := (H; ) be a monoid, G := (G; ) be a group, Q be a co-monoid, and T be a co-group. Then (a)
H = P ol1 Inv H
(a’)
G = P ol1 Inv G
(b)
P ol Q ⊆ [Pk1 ]
(b’)
P ol T ⊆ [Sk ]
(c)
Q = Inv P ol1 Q
(c’)
T = Inv P ol1 T .
Proof. (a), (a’): Let A be a monoid of Pk1 (or a group of Sk ). Then, by Lemma 2.10.1.1, [A]∇ is a clone of Pk and, because of Theorem 2.6.2, we have [A]∇ = P ol Inv [A]∇ = P ol Inv A. Consequently, A = [A]1 = P ol1 Inv A. (b): Since the diagonal relations belong to Q and since Q is closed in respect to ∨, the relation 3 3 ∪ δk;{2,3} γ := δk;{1,2} belongs to Q. With the help of Theorem 1.4.4, it can easily be shown that the relation is preserved of no function of Pk , which depends on at least two variables essentially. Thus, P ol Q ⊆ [Pk1 ]. (b’): Through (b) we already proven P ol T ⊆ [Pk1 ]. Further, the diagonal relation ι2k := {(x, x)|x ∈ Ek } belongs to Q, whereby also ¬ι2k ∈ Q. Obviously the relation ¬ι2k = {(x, y)|x = y} is preserved, however, only from the permutations of Pk1 . Consequently, we have P ol T ⊆ [Sk ]. (c), (c’): If Q is a co-monoid (or is a co-group) of Rk , then Q is also a co-clone of Rk and it is valid (because of P ol1 Q ⊆ P ol Q, Theorem 2.6.1, (a) and Theorem 2.9.2): Q = Inv P ol Q ⊆ Inv P ol1 Q. By (b) (or (b’)) we have in addition P ol Q ⊆ [P ol1 Q], whereby Inv [P ol1 Q] ⊆ Inv P ol Q and (because of Inv P ol1 Q = Inv [P ol1 Q] by Theorem 2.6.2 and Inv P ol Q = Q by Theorem 2.9.2) Inv P ol1 Q ⊆ Q follow. One obtains the following theorem as an easy conclusion in analogy to the above theorem from Lemmas 2.10.1.2 and 2.10.1.3.
2.10 Some Modifications of the P ol-Inv-Connection
139
Theorem 2.10.1.4 ([Kra 45], [Kra 68/69]) Let M be the set of all monoids of the form (M ; ) with M ⊆ Pk1 and G be the set of all groups of the form (G; ) with G ⊆ Sk . Further, let K1 be the set of all co-monoids of Rk and K2 be the set of all co-groups of Rk . Then, the lattices (M; ⊆) and (K1 ; ⊆) and the lattices (G; ⊆) and (K2 ; ⊆) are antiisomorphic. In particular, for i ∈ {1, 2}, L1 := M and L2 := G are valid: The mappings P ol1 : Ki −→ Li , Q → P ol1 Q and
Inv : Li −→ Ki , H → Inv H
are bijective mappings, which reverse the partial order ⊆, i.e., it holds ∀H, G ⊆ Li : H ⊆ G =⇒ Inv G ⊆ Inv H and
∀S, T ⊆ Ki : S ⊆ T =⇒ P ol1 T ⊆ P ol1 S.
2.10.2 Galois Theory for Iterative Function Algebras Iterative function algebras are algebras of the form (Pk ; ζ, τ, ∆, ∇; ). The universes of subalgebras of these algebras Pk (k ∈ N\{1}) are called subclasses or, briefly, classes of Pk . Unlike clones of Pk , there are classes of Pk that do not contain the projections. Nevertheless, for the classes of Pk , one can also find certain relation algebras as partners for a Galois-correspondence. Subsequently, two possibilities for this purpose will be presented. For the first possibility, we choose a certain class A of Pk that does not contain the function e11 and which, therefore, is not a clone. Let L↓k (A) be the lattice of all subclasses of A and let Lk (Jk , Jk ∪ A) be the lattice of all subclasses of Jk ∪ A, which have Jk as a subset. Moreover, let Lk (Inv(Jk ∪ A), Rk ) be the set of all co-clones C of Rk with Inv(Jk ∪ A) ⊆ C. Obviously, the mapping α : L↓k (A) −→ Lk (Jk , Jk ∪ A), T → Jk ∪ T is an isomorphism from L↓k onto Lk (Jk , Jk ∪ A). Since the elements of Lk (Jk , Jk ∪ A) are clones of Pk , the lattice Lk (Jk , Jk ∪ A) is antiisomorphic to the lattice Lk (Inv(Jk ∪ A), Rk ) by Theorem 2.9.3. Consequently, we have
140
2 The Galois-Connection Between Function- and Relation-Algebras
Theorem 2.10.2.1 Let A be a subclass of Pk . Further, put P olA Q := A ∩ P olk Q for arbitrary Q ⊆ Rk . Then the mappings Inv : L↓k (A) −→ Lk (Inv(Jk ∪ A)), T → Inv T, and
P olA : Lk (Inv(Jk ∪ A), Rk ) −→ L↓k (A), Q → P olA Q
are bijective mappings, and the lattices L↓k (A) and Lk (Inv(Jk ∪ A), Rk ) are antiisomorphic. As W. Harnau in [Har 83] was pointing, another possibility to characterize subclasses of Pk consists that one establishes relation pairs and relation-pairalgebras. Let Rphk := {(, ) ∈ Rkh × Rkh | ⊆ } and
Rpk :=
Rphk .
h≥1
The elements of Rpk are called relation pairs. We say that f n ∈ Pk preserves the relation pair (, ) ∈ Rpk , if f (r1 , ..., rn ) ∈ for arbitrary r1 , ..., rn ∈ . By definition, each function of Pk preserves the pair (∅, ∅). If = , then the fact “f preserves the relation pair (, )” is identical with the fact “f preserves ”. Let F ⊆ Pk and Q ⊆ Rpk . Then, denote Invpk F the set of all relation pairs of Rpk , which are preserved from every function of F . Further, let P olpk Q be the set of all functions of Pk , which preserve each relation pair of Q. It can easily be shown that the following lemma holds: Lemma 2.10.2.2 ([Har 83]) (a) ∀Q ⊆ Rpk : P olpk Q = [P olpk Q]ζ,τ,∆,∇, ; (b) ∀(, ) ∈ Rpk : ([P ol(, )]e21 ,ζ,τ,∆, = P ol(, ) ⇐⇒ = ). Analogous to Section 2.3, one can define certain operations on the set Rpk : h+1 (“the doubling For α ∈ {ζ, τ, ∆, pr, ∼} (see Section 2.3, ∼ h := ∇ ∧ δ{1,2} of the first row of ”)) and (, ), (µ, µ ) ∈ Rpk we set: α(, ) := (α, α ), (∇, ∇ ), if = ∅, ∇(, ) := (∇, ∅), if = ∅, and
2.10 Some Modifications of the P ol-Inv-Connection
141
(, ) × (µ, µ ) := ( × µ, × µ ).
Further, put E := h≥1 Ekh in the following. For each a ∈ E one can define two operations on Rpk as follows: (\{a}, ), if ⊆ \{a}, ν1,a (, ) := otherwise, (, ) and ν2,a (, ) :=
(, ∪ {a}), if a ∈ , otherwise (, )
((, ) ∈ Rpk ). 3 The importance of the above-defined operations results from the following lemma, which one can easily check. Lemma 2.10.2.3 Let (, ) be a relation pair which is derivable from Q (⊆ Rpk ) by means of the operations ζ, τ, ∆, ∇, ∼, pr, ×, ν1,a , ν2,a (a ∈ E). Then P olpk Q ⊆ P olpk (, ). The algebra Rpk := (Rpk ; (∅, ∅), ζ, τ, ∆, pr, ∼, ×, (ν1,a )a∈E , (ν2,a )a∈E ) of the type (0,1,1,1,1,1,2,1,1,1,...) is called full relation-pair algebra on Ek . A relation-pair algebras is a subalgebra of this algebra. Further, a universe of a relation-pair algebra is called co-class. Then, the following theorem can be proven with some expenditure (ultimately similar to the proof of Theorem 2.9.3): Theorem 2.10.2.4 ([Har 83]) Let L(Pk ) (or L(Rpk )) be the set of all classes (or co-classes) of Pk (or Rpk ), respectively. Then the mappings Invk : L(Pk ) −→ L(Rpk ), A → Invk A and P olpk : L(Rpk ) −→ L(Pk ), Q → P olpk Q 3
In [Har 83] so-called multi-operators dh and dv are first defined instead of the operations ν1,a , ν2,a (a ∈ E): dh (, ) := {(, µ) ∈ Rpk | ⊆ µ ⊆ }, dv (, ) := {(µ, ) ∈ Rpk | ⊆ µ ⊆ }. Then, relation-matrix-algebras, in which these multi-operators are describable through two operations, are introduced. It is shown how one can repair the “lack” with the multi-operators by going over to the relation-matrix-algebras with finite many operations.
142
2 The Galois-Connection Between Function- and Relation-Algebras
are bijective mappings with the properties ∀A, B ∈ L(Pk ) : A ⊆ B =⇒ Invk B ⊆ Invk A, ∀S, T ∈ L(Rpk ) : S ⊆ T =⇒ P olpk T ⊆ P olpk S; i.e., the lattices (L(Pk ); ⊆) and (L(Rpk ); ⊆) are antiisomorphic.
2.11 Some Connections Between the Relation Operations In this last section of Chapter 2, we want to clarify the order in which one can use the relation operations given in Section 2.3, to obtain all relations from the set [Q] (⊆ Rk ) as effectively as possible. Let ∆ := {(x1 , x2 , ..., xh ) ∈ | x1 = x2 } ( ∈ Rkh ). This relation is obvious derivable from our elementary operations. For arbitrary α, α1 , ..., αt ∈ {ζ, τ, ∆, ∆ , ∇, pr} we use the following notations: α1 := α(), αi := α(αi−1 ) for i ∈ N, α1 α2 ...αt := α1 (...(αt−1 (αt ())...) ( ∈ Rk ). It can easily be shown that the Lemma 2.11.1 holds.
Lemma 2.11.1 For arbitrary relations ∈ Rkh , ∈ Rkh and ∈ Rkh it is valid:
(a) × = (ζ h ∆h ) ∩ (∇h ); 3 (b) ∅ = prh , δk;{1,2} = ∆ ∇3 ∅;
(c) ζ(pr) = pr(ζ(τ ())), τ (pr) = pr(ζ h−1 (τ (ζ()))), ∆ (pr) = pr(ζ h−1 (∆ (ζ()))), ∇(pr) = pr(τ ((∇()))); (d) ζ( ∧ ) = (ζ) ∧ (ζ ), τ ( ∧ ) = (τ ) ∧ (τ ), ∆ ( ∧ ) = (∇) ∧ (∇ ), if h = h ; (e) ( ∨ ) ∧ = ( ∧ ) ∨ ( ∧ ), if h = h = h .
2.11 Some Connections Between the Relation Operations
143
3 Theorem 2.11.2 Let Ω := {δk;{1,2} , ζ, τ, pr, ×, ∧}. Then for all Q ⊆ Rk it is valid:
(a) [Q]Ω = [Q]ζ,τ,∆ ,∇,pr,∧ ; (b) [Q]ζ,τ,∆ ,∇,pr,∧ = [ [[Q]ζ,τ,∆ ,∇ ]∧ ]pr ; (c) [Q]Ω∪{∨} = [Q]ζ,τ,∆ ,∇,pr,∧,∨ ; (d) [Q]ζ,τ,∆ ,∇,pr,∧,∨ = [ [ [ [Q]ζ,τ,∆ ,∇ ]∧ ]∨ ]pr . Proof. (a): Since ∆ and ∇ are Ω-derivable operations, we have [Q]ζ,τ,∆ ,∇,pr,∧ ⊆ [Q]Ω . The reversed inclusion [Q]Ω ⊆ [Q]ζ,τ,∆ ,∇,pr,∧ follows from Lemma 2.11.1, (a), (b). (b) follows from Lemma 2.11.1, (c), (d). One proves the statements (c) and (d) analogously to (a) and (b) using Lemma 2.11.1, (e). A translation of these observations into the language of mathematical logic can be found in [P¨ os-K 79], p. 63–68.
This page intentionally left blank
3 The Subclasses of P2
A basic result of many-valued logic is the description of all closed sets of Boolean functions given by E. L. Post in [Pos 20] and [Pos 41]. Since Post’s proof is long and rather complicated, revisions (for instance [Jab-G-K 70] and [Ugo 88]) and new proofs (for instance [Ber 80], [McK-M-T 87] and [Res-D 89] or [Den-W 2002]) have been published. The new proof methods of the last years mainly result from the fact that parts of Post’ results are special cases or conclusions of certain theorems of many-valued logic or universal algebra. In this chapter, we tried to verify Post’s results in an elementary way by working out some essential basic ideas.
3.1 Definitions of the Subclasses of P2 and Post’s Theorem We need some notations introduced in Chapter 1 to define the subclasses of P2 and to describe certain generated sets of this subclasses. We shall define functions of P2 by formulae over the alphabet {x, y, z, x1 , x2 , ...} and we use the usual symbols ∧ (“conjunction” or “multiplication modulo 2”), ∨ (“disjunction”), + (“addition modulo 2”) and − (“negation”). By ◦ ∈ {∧, ∨, +},
−
, cna (a ∈ E2 ), eni (1 ≤ i ≤ n), m3 , t2 , q 3 , r3 , hµ+1 (µ ∈ N) µ
we denote functions of P2 given by
146
3 The Subclasses of P2
◦(x, y) := x ◦ y, −
(x) := x,
cna (x1 , ..., xn ) := a, eni (x1 , ..., xn ) := xi , m(x, y, z) := x ∧ (y ∨ z), t(x, y) := x ∧ y, q(x, y, z) := x ∧ (y ∨ z), r(x, y, z) := x + y + z, µ+1 hµ (x1 , ..., xµ+1 ) := i=1 (x1 ∧ x2 ∧ ... ∧ xi−1 ∧ xi+1 ∧ ... ∧ xµ+1 ) = 1 if ∃i ∈ {1, ..., µ + 1} : x1 = ... = xi−1 = xi+1 = ... = xµ+1 = 1, 0 otherwise (h1 = ∨), respectively. We write x for (x1 , ..., xn ), α for (α, α, ..., α) (α ∈ E2 ) and often xy instead of x ∧ y. Finally, let x, if σ = 0, xσ := x, if σ = 1. The mapping
δ : P2 −→ P2 , f n −→ (f δ )n
with
f δ (x1 , ..., xn ) := f (x1 , x2 , ..., xn )
is known to be an automorphism from P2 , which we shall use to describe isomorphic closed subsets of P2 (see Section 9.11), where Aδ := {f δ | f ∈ A}. We remark that δ is the unique non-trivial isomorphism from a subalgebra of P2 to a subalgebra of P2 (see Theorem 9.12.5). In the following, we define some closed subsets of P2 with the help of which we can describe all subclasses of P2 with the applications of ∩ and ∪: 0 0 1 • M := P ol 0 1 1 = n≥1 {f n ∈ P2 | ∀a, b ∈ E2n : a ≤ b =⇒ f (a) ≤ f (b)} (set of all non-decreasing monotone functions), • S := P ol =
0 1 1 0
n≥1 {f
n
∈ P2 | f (x1 , ..., xn ) = f (x1 , x2 , ..., xn )}
(set of all self-dual functions),
3.1 Definitions of the Subclasses of P2 and Post’s Theorem
• L :=
n≥1 {f
n
147
n ∈ P2 | ∃a0 , ..., an ∈ E2 : f (x) = a0 + Σn=1 ai · xi }
(set of all linear functions), • T0,µ := P olE2µ \{1} if µ ∈ N ( f n ∈ T0,µ ⇐⇒ (∀a1 , ..., aµ ∈ E2µ : (∀i ∈ {1, ..., µ} : f (ai ) = 1 and ai = (ai1 , ..., ain )) =⇒ ∃ j ∈ {1, ..., n} : a1j = a2j = ... = aµj = 1) ⇐⇒ (∀a1 , ..., aµ ∈ E2n ∃ j ∈ {1, ..., n} : ∀x ∈ {a1 , ..., aµ } : f (x) = xj ∧ f (x))), δ T1,µ := T0,µ = P olE2µ \{0},
Ta := Ta,1 , where a ∈ E2 , T0,∞ := µ≥1 T0,µ =
n≥1 {f
n
∈ P2 | ∃j ∈ {1, ..., n}∃f ∈ P2 : f (x) = xj ∧ f (x)},
δ , T1,∞ := T0,∞
• K := [∧] (set of all conjunctions), • D := K δ = [∨] (set of all disjunctions), • C := [c0 , c1 ] (set of all constant functions), • Ca := [ca ], a ∈ E2 , • I := [e11 ] (set of all projections), • I := [− ].
148
3 The Subclasses of P2
Theorem 3.1.1 (Post’s Theorem; [Pos 41]) (1) The set of all subclasses of P2 is countably infinite. (2) The non-empty subclasses of P2 are P2 , S, M, L, Ta,µ , Ta,µ ∩ Ta , Ta,µ ∩ M, Ta,µ ∩ M ∩ Ta , K ∪ C, K ∪ Ca , K, D ∪ C, D ∪ Ca , D, S ∩ T0 , S ∩ M, S ∩ L, S ∩ L ∩ T0 , L ∩ Ta , I ∪ C, I ∪ C, I, I ∪ Ca , I, C, Ca , where a ∈ E2 and µ ∈ {1, 2, ..., ∞}. (The Hasse-diagram of these classes is given in Figure 3.1.) (3) In the set P2 , there exists exactly (a) 9 closed subsets of order 1: [P21 ], I ∪ C, I, I ∪ C0 , I ∪ C1 , I, C, C0 , C1 ; (b) 20 closed subsets of order 2: P2 , T0 , T1 , M, L, M ∩ T0 , M ∩ T1 , L ∩ T0 , L ∩ T1 , M ∩ T0 ∩ T1 , K ∪ C, K ∪ C0 , K ∪ C1 , K, D ∪ C, D ∪ C0 , D ∪ C1 , D, T0,∞ , T1,∞ ; (c) 20 closed subsets of order 3: S, S ∩ T0 , S ∩ M, S ∩ L, S ∩ L ∩ T0 , T0,2 , T1,2 , T0,2 ∩ T1 , T1,2 ∩ T0 , T0,2 ∩ M, T1,2 ∩ M, T0,2 ∩ M ∩ T1 , T1,2 ∩ T0 ∩ M, T0,∞ ∩ T1 , T1,∞ ∩ T0 , T0,∞ ∩ M, T1,∞ ∩ M, T0,∞ ∩ M ∩ T1 , T1,∞ ∩ M ∩ T0 , T0 ∩ T1 ; (d) 8 closed subsets of order µ + 1 (µ ≥ 3): Ta,µ , Ta,µ ∩ Ta , Ta,µ ∩ M, Ta,µ ∩ M ∩ Ta (a ∈ E2 ).
3.2 A Proof for Post’s Theorem T0 T0,2
T0,3
T0,∞
P2
M T 1
K
S∩M
K ∪C
S
C0
L
[P21 ]
I
I C
D∪C
149
T1,2 T1,3
T1,∞
D
C1
∅
Fig. 3.1. The Post Lattice
3.2 A Proof for Post’s Theorem For any subclass A of P2 , the following three cases are possible: Case 1: A ⊆ L and A ⊆ S, Case 2: A ⊆ L, Case 3: A ⊆ L and A ⊆ S. By following this case distinction, all subclasses of P2 and minimal generating subsets of these classes are determined as follows. The orders of the subclasses given are easy conclusions from the proven statements about generating sets of the subclasses. We start with: 3.2.1 The Subclasses A of P2 with A ⊆ L and A ⊆ S Theorem 3.2.1.1 The following holds: P2 = [◦,− ] for ◦ ∈ {∧, ∨}, M = [∨, ∧, c0 , c1 ], T0,µ = [hµ , t], T0,µ ∩T1 = [hµ , q], T0,µ ∩ M = [hµ , m, c0 ] ( T0 ∩ M = [∨, ∧, c0 ] ), T0,µ ∩ M ∩ T1 = [hµ , m], T0,∞ = [t], T0,∞ ∩ T1 = [q], T0,∞ ∩ M = [m, c0 ] and T0,∞ ∩ M ∩ T1 = [m], where µ ∈ N.
150
3 The Subclasses of P2
Proof. Let be f n ∈ P2 , for which µ + 1 distinct tuples a1 , ..., aµ+1 exist with f (a1 ) = ... = f (aµ+1 ) = 1. Then, we have f (x) = hµ (fa1 (x), fa2 (x), ..., faµ+1 (x)), where
fai (x) :=
(3.1)
0 if x = ai , f (x) otherwise
(i = 1, 2, ..., µ + 1). We call every function f n of a subclass A of P2 with {hµ , fa1 , ..., faµ+1 } ⊆ A and
f (a1 ) = ... = f (aµ+1 ) = 1
for certain a1 , ..., aµ+1 ∈ E2n a reducible function. We denote by NA the set of all not reducible functions f of a class A. Obviously, the set NA ∪ {hµ } is a generating set for the class A, if hµ ∈ A and A ∩ {h1 , ..., hµ−1 } = ∅ for certain µ ≥ 1. The Table 3.1 gives an easily verifiable description of the set (NA )n for A ∈ {P2 , T0,m , M, T0,m ∩ M, T0,m ∩ T1 , T0,m ∩ M ∩ T1 }, m ∈ N, and the minimal µ with hµ ∈ A. 1 The functions gJ and mJ for J ⊆ E2n from Table 3.1 are defined by 1 if x ∈ J, gJ (x) := 0 otherwise and
mJ (x) :=
1 if ∃a ∈ J : x ≥ a, 0 otherwise. Table 3.1
A
NAn
P2
{gJ | |J| ≤ 1}
1
M
{mJ | |J| ≤ 1}
1
T0,µ
{gJ | |J| ≤ µ and ∃t : gJ (x) = xt ∧ gJ (x)}
µ
T0,µ ∩ T1
{gJ ∈ NTn0,µ | 1 ∈ J}
µ
T0,µ ∩ M
{mJ | |J| ≤ µ and ∃t : mJ (x) = xt ∧ mJ (x)}
µ
T0,µ ∩ M ∩ T1 {mJ ∈ NTn0,µ ∩M | 1 ∈ J} 1
a minimal µ with hµ ∈ A
µ
One possible proof of Table 3.1 is as follows: We start with a ”partition” of an arbitrary f ∈ A in functions fai by (3.1), then we repeat this construction for the functions fai instead of f , if fai ∈ NA , etc. In case A ⊆ M be let all tuples ai minimal with respect to ≤ by this fai ∈ M .
3.2 A Proof for Post’s Theorem
151
Since g∅n = mn∅ = cn0 , n g{(a (x) = xσ1 1 ∧ xσ2 2 ∧ ... ∧ xσnn , 1 ,...,an )}
mn{0} = cn1 , mn{(a1 ,...,an )} (x) = xi1 ∧ xi2 ∧ ... ∧ xiν if {i1 , ..., iν } = {i | ai = 1} = ∅, we have
NP2 ⊆ [∧,− ],
NT0 ⊆ [c0 , ∧, t], = [t],
NM ⊆ [∧, c0 , c1 ], NM ∩T0 ⊆ [∧, c0 ] and NM ∩T0 ∩T1 ⊆ [∧]. Consequently, P2 = [∨, ∧,− ] (and P2 = [◦,− ] for ◦ ∈ {∨, ∧} by Morgan’s laws), T0 = [∨, t], M = [∨, ∧, c0 , c1 ], M ∩ T0 = [∨, ∧, c0 ] and M ∩ T0 ∩ T1 = [∨, ∧]. Furthermore, Table 3.1 implies the following: if A = T0,µ ∩ B with B ∈ T0,∞ ∩ B = {P 2 , T1 , nM, T1 ∩ M } and µ ≥ 2, then A = [{hnµ } ∪ (T0,∞ ∩ B)] and {f ∈ P | ∃i ∈ {1, 2, ..., n} ∃ f ∈ B : f (x) = x ∧ f (x)}. By this 2 i n≥1 fact, from a generating subset {f n , g m , ...} of B, we get a generating subset of the form {∧ f, ∧ g, ...} for the class T0,∞ ∩ B. Thus, T0,∞ = [t], since t(x, t(x, y)) = x ∧ y and P2 = [∧,− ]. T0,∞ ∩ T1 = [q] follows from T1 = T0δ = [∧, tδ ], tδ (x, y) = x ∨ y and ∧ ∧, ∧ tδ ∈ [q]. By T1 ∩ M = [∧, ∨, c1 ] and {∧ ∧, ∧ ∨, ∧ c11 = e22 } ⊆ [m] is T0,∞ ∩ T1 ∩ M = [m]. Finally, T0,∞ ∩ M = [m, c0 ], since T0,∞ ∩ M = (T0,∞ ∩ M ∩ T1 ) ∪ [c0 ]. Lemma 3.2.1.2 If A = [A] ⊆ P2 , ca ∈ A for certain a ∈ E2 and A ⊆ L, then A contains a binary non-linear function. Proof. By x◦y+x+y = x◦ y for {◦, ◦ } = {∧, ∨}, ∆(+c1 ) =− and Theorem 1.4.2 we have [◦, +, c1 ] = P2 for ◦ ∈ {∧, ∨}, i.e., every function g n ∈ P2 has a description of the form ai1 i2 ...iν ◦ xi1 ◦ xi2 ◦ ... ◦ xiν g(x) = a0 + {i1 ,i2 ,...,iν }⊆{1,2,...,n}
for some a0 , ai1 i2 ...iν ∈ E2 (see Theorem 1.4.3). Therefore, because A ⊆ L, there exists a function f n ∈ A with f (x) = a0 + x1 ◦ x2 ◦ ... ◦ xr +
n i=1
where r ≥ 2 and
ai ◦ xi +
ai1 ...iν ◦ xi1 ◦ ... ◦ xiν ,
i1 , ..., iν ∈ {1, 2, ..., n}, ν ≥ r, {i1 , ..., iν } ⊆ {1, 2, ..., r}
152
3 The Subclasses of P2
◦ :=
∨ if a = 1, ∧ if a = 0.
Our statement follows from f (x, y, y, ..., y , ca , ...., ca ) = b + x ◦ y + c ◦ x + d ◦ y ∈ A\L (r−1) times for some b, c, d ∈ E2 . Lemma 3.2.1.3 Let A be a subclass of P2 , which is not a subset of L and not a subset of S. Then, the function ∧ or the function ∨ belongs to A. Proof. It is easy to verify that ∨ or ∧ is a superposition over a binary nonlinear function of P2 . Thus, we have to show A2 ⊆ L. Since A ⊆ S, there exists an f ∈ A with 0 1 a f = , 1 0 a a ∈ E2 , i.e., f ∈ {f1 , f2 , ..., f8 } (see Table 3.2). x 0 0 1 1
y f1 0 0 1 0 0 0 1 0
f2 1 1 1 1
Table 3.2
f3 1 0 0 1
f4 0 1 1 0
f5 0 0 0 1
f6 1 0 0 0
f7 0 1 1 1
f8 1 1 1 0
The functions f5 , ..., f8 are non-linear. If f ∈ {f1 , ..., f4 } then ∆f is a constant function and A2 ⊆ L follows from Lemma 3.2.1.2. Lemma 3.2.1.4 Let A be a subclass of P2 with ∧ ∈ A. Then the following implications hold: (a) (∃a ∈ E2 : A ⊆ Ta ) =⇒ ca ∈ A, (b) (A ⊆ M and A ⊆ K ∪ C) =⇒ m ∈ A, (c) A ⊆ M =⇒ q ∈ A, (d) (A ⊆ K ∪ C and A ⊆ T0 ) =⇒ ∨ ∈ A, (e) (∃µ ∈ N : A ⊆ T0,µ and A ⊆ T0,µ+1 ) =⇒ hµ ∈ A. Proof. (a): If A ⊆ Ta there exists a g 1 ∈ A with g(a) = a, i.e., g ∈ {ca ,− }. ca ∈ A follows from ∧ ∈ A, x ∧ x = 0 and 0 = 1. (b): f denotes an n-ary function of A\(K ∪ C). Then there exist two tuple a = (a1 , ..., an ) and b = (b1 , ..., bn ) with the following properties: f (a) = f (b) = 1, a ≤ b, b ≤ a and f (c) = 0 for every c with c < a or c < b . Defining functions gi3 ∈ A by
3.2 A Proof for Post’s Theorem
gi (x, y, z) :=
⎧ ⎪ ⎪ x ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ y ⎪ ⎨
if if
ai bi ai bi
=
=
1 1 0 1
153
, ,
ai 1 ⎪ ⎪ z if = , ⎪ ⎪ b 0 ⎪ i ⎪ ⎪ ⎪ ⎪ ⎪ ai 0 ⎪ ⎪ = ⎪ ⎩ yz if bi 0
(i = 1, 2, ..., n) we obtain x ∧ f (g1 (x, y, z), ..., gn (x, y, z)) = m(x, y, z) ∈ A, since f ∈ M . (c): By A ⊆ M we have a function h3 in A with 1 0 0 1 h = . 1 0 1 0 Consequently, h (x, y, z) := x ∧ h(x, y, z) ∈ A and h (x, y, z) ∈ {x ∧ y ∧ z, x(y+z+1), x∧z, x(y∨z)}. Since x∧(y∧z) = x(y∨z) and x(yz+z+1) = x(y∨z), it holds q ∈ A. (d): By (a), (b), (c) and m(x, y, z) = q(x, y, q(x, y, z)) it holds {c1 , m} ⊆ A and hence ∆(m c11 ) = ∨ ∈ A. (e): If A ⊆ T0,µ+1 , there is an f ∈ A with f (E2µ+1 \{1}) = 1, i.e., w.l.o.g.: ⎛ ⎞ ⎛ ⎞ 1 0 1 1 ... 1 0 0 0 ... 0 ...... 0 ⎜1⎟ ⎜ 1 0 1 ... 1 0 1 1 ... 0 ...... 0 ⎟ ⎜ ⎟ ⎜ ⎟ ⎜ ⎟ ⎟ f⎜ ⎜ 1 1 0 ... 1 1 0 1 ... 0 ...... 0 ⎟ = ⎜ 1 ⎟ . ⎝.⎠ ⎝ ................................ ⎠ 1 1 1 1 ... 0 1 1 1 ... 1 ...... 0 (µ+1) times Since ∧ ∈ A, we have f (x1 , ..., xµ+1 ) := f (x1 , ..., xµ+1 , x1 x2 , x1 x3 , ..., x1 x2 x3 , ..., x1 x2 ...xµ+1 ) ∈ A. By f ∈ T0,µ we have
f (x) =
hµ (x) if x = 1, a if x = 1
for a certain a ∈ E2 . If a = 1 then f = hµ ∈ A. If a = 0 and µ ≥ 2 then f (x1 , ..., xµ−1 , xµ xµ+1 , f (x1 , ..., xµ+1 )) = hµ (x) ∈ A. Finally, if a = 0 and µ = 1, we have f = + and h1 (x, y) = xy + x + z ∈ A.
154
3 The Subclasses of P2
Theorem 3.2.1.5 The subclasses A of P2 with A ⊆ S and A ⊆ L are P2 , M, Ta,µ , Ta,µ ∩ B, K, K ∪ Ca , K ∪ C, D, D ∪ Ca , D ∪ C, where a ∈ E2 , µ ∈ {∞, 1, 2, ...} and B ∈ {Ta , M, M ∩ Ta }. Proof. Denote A a subclass of P2 with A ⊆ S and A ⊆ L. By Lemma 3.2.1.3, we have that A obtains K or D. W.l.o.g. [∧] = K ⊆ A. If A ∈ {K, K ∪ C0 , K ∪ C1 , K ∪ C} then we can distinguish 8 cases, which are given in Table 3.3. Using Lemma 3.2.1.4 and Theorem 3.2.1.1, we see that A is a certain class, which is given in the last column of Table 3.3. Table 3.3
∃µ ∈ A ⊆ T1 A ⊆ M {∞, 1, 2, ...} : A ⊆ T0,µ ∧ A ⊆ T0,µ+1 − − − − − + − + − − + + + − − + − + + + − + + +
conclusions from the assumptions
A
{c1 , c0 , q} ⊆ A {c1 , c0 , m} ⊆ A {c1 , q} ⊆ A ⊆ T1 {c1 , m} ⊆ A ⊆ T1 ∩ M {hµ , c0 , q} ⊆ A ⊆ T0,µ {hµ , c0 , m} ⊆ A ⊆ T0,µ ∩ M {hµ , q} ⊆ A ⊆ T0,µ ∩ T1 {hµ , m} ⊆ A ⊆ T0,µ ∩ T1 ∩ M
P2 M T1 T1 ∩ M T0,µ T0,µ ∩ M T0,µ ∩ T1 T0,µ ∩ T1 ∩ M
(+ stands for the truth of the assertion in the first row, − for the truth of the negated assertion. Furthermore, let T0,∞+1 := ∅ and h∞ := e11 ) 3.2.2 The Subclasses of L Obviously, all subclasses of [P21 ] [P21 ], I ∪ C, I, I ∪ C0 , I ∪ C1 , C, C0 , C1 , I, ∅ are also subclasses of L. With the help of these sets, we can determine all subclasses of L with the following. Lemma 3.2.2.1 Let L be subclass of L with L ⊆ [P21 ]. Then L = [L1 ∪ {r}] (r(x, y, z) = x + y + z). Proof. Let L = [L] ⊆ L and L ⊆ [P21 ]. Then, there is a function g ∈ L with g(x, y, z) = a + x + y + bz for some a, b ∈ E2 . Thus g(g(x, y, z), z, z) = r(x, y, z) ∈ L. By forming of the functions of the type r r ... r and by n identifying of variables in these functions, we get that every function i=1 bi xi
3.2 A Proof for Post’s Theorem
155
with b1 + ... + bn = 1 belongs to [r] ⊆ A. Now, denote f an n-ary function of n L and let f (x) = a0 + i=1 ai xi . Then, we have f (x, x1 , ..., xn ) := x + (a2 + ... + an )x1 +
n
ai xi ∈ [r]
i=2
and
f (x) = f (f (x1 , ..., x1 ), x1 , ..., xn ).
Therefore f ∈ [{r} ∪ L1 ] and [{r} ∪ L1 ] = L is proven. Looking for subsemigroups of (P21 ; ), which have the property to be preserved by r, we get the following Theorem 3.2.2.2 All subclasses of L are L, L ∩ T0 = [c0 , +], L ∩ T1 , L ∩ S = [− , r], L ∩ T0 ∩ S = [r], [P21 ], I ∪ C, I, I ∪ C0 , I ∪ C1 , I, C, C0 , C1 , ∅. 3.2.3 The Subclasses of S, Which Are Not Subsets of L Obviously, a function f n ∈ P2 (n ≥ 2) belongs to S iff there exists a function F n−1 ∈ P2 with the property f (x1 , ..., xn ) = x1 F (x2 , ..., xn ) ∨ x1 F (x2 , ..., xn ), where
(3.2)
F (x2 , ..., xn ) := f (0, x2 , ..., xn ).
Consequently, we can define a bijective mapping α of S := S\S 1 onto P2 as follows: α : f −→ F. Lemma 3.2.3.1 The mapping α has the following properties: τ, ∆, ∇ and (a) For the operations ζ, , defined by )(x1 , ..., xn ) := f (x1 , x3 , x4 , ..., xn , x2 ), (ζf ( τ f )(x1 , ..., xn ) := f (x1 , x3 , x2 , x4 , ..., xn ), )(x1 , ..., xn−1 ) := f (x1 , x2 , x2 , x3 , ..., xn−1 ), (∆f (∇f )(x1 , ..., xn+1 ) := f (x1 , x3 , x4 , ..., xn+1 ) and (f g)(x1 , ..., xm+n−2 ) := f (x1 , g(x1 , ..., xm ), xm+1 , ..., xm+n−2 ) (n, m ≥ 2), it holds α( γ f ) = γ(α(f )) for every γ ∈ {ζ, τ, ∆, ∇} and α(f g) = α(f ) α(g), i.e., the algebra (S ; ζ, τ, ∆, ∇, ) is isomorphic to the algebra (P2 ; ζ, τ, ∆, ∇, ). (b) For every subclass A (= ∅) of S, α(A) is a subclass of P2 , and it holds α(A) ⊆ S, A ⊆ α(A) and α(A) ∩ S = A.
156
3 The Subclasses of P2
Proof. (a) is easy to check. (b): Let A be a subclass of S. By (a) we have that α(A) is also a closed set. Assume α(A) ⊆ S. Then F (x2 , ..., xn ) = F (x2 , ..., xn ) for every f n ∈ A. Thus by (3.2) we get that the variable x1 is fictitious for every function f n ∈ A. However, this is not possible. Hence α(A) ⊆ S holds. Let f n ∈ A. Then ∇f ∈ A and therefore α(∇f ) = f ∈ α(A), i.e., A ⊆ α(A). If f n ∈ S ∩ α(A), we have ∆(α−1 f ) = f ∈ A and thus S ∩ α(A) ⊆ A. From this, it follows that A = S ∩ α(A), since A ⊆ α(A) and A ⊆ S. With the help of Lemma 3.2.3.1 and Theorem 3.2.1.5, it is not difficult to determine the missing subclasses of S. It holds Theorem 3.2.3.2 (a) The sets S ∩ M and S ∩ T0 are the only proper subclasses of S, which are not subsets of L. (b) It holds that S = [h2 ,− ], S ∩ T0 = [h2 , r], S ∩ M = [h2 ]. Proof. (a): Let A be a subclass of S with A ⊆ L. Then it holds α(A) ⊆ L. By Lemma 3.2.1.2 and Lemma 3.2.1.3, we have {∨, ∧} ∩ α(A) = ∅. Consequently, the function h2 (= xyz ∨ x(y ∨ z)) or the function g(x, y, z) := x(y ∨ z) ∨ xyz belong to A. Since it holds g(g(x, y, z), y, z) = h2 (x, y, z), h2 ∈ A. Further, the functions α(h2 ) = ∧, x ∧ h2 (x, y, z) = x(y ∨ z) and c10 = α(e21 ) are elements of α(A). Thus, T0,2 ∩M ⊆ α(A) and by Lemma 3.2.3.1, (b) we have T0,2 ∩M ∩S ⊆ A. By Theorem 3.2.1.5, there exists only the following possibilities for A: S ∩ T0,2 , S ∩ M = S ∩ M ∩ T0 , S ∩ T0 and (a) follows from S ∩ T0,2 = S ∩ M . (This fact is easy to prove, for example, with the help of the relation product and theproperty P ol ∩ P ol ⊆P ol : 1 0 0 0 1 0 0 1 Let 1 := , 2 := and 3 := , Then 2 1 = 3 0 1 0 1 0 0 1 1 and thus S ∩ T0,2 ⊆ S ∩ M . Conversely, S ∩ M ⊆ S ∩ T0,2 holds, since 3 1 = 2 .) (b) follows from Theorem 3.2.1.1 and Lemma 3.2.3.1. 3.2.4 A Completeness Criterion for P2 The following is a conclusion from Theorem 3.1.1: Theorem 3.2.4.1 (Completeness Criterion for P2 ) Let A ⊆ P2 . Then [A] = P2 ⇐⇒ ∀X ∈ {T0 , T1 , M, S, L} : A ⊆ X.
3.2 A Proof for Post’s Theorem
157
Without using of Theorem 3.1.1, one can prove Theorem 3.2.4.1 with the help of Theorem 1.5.4.1 and the following: Theorem 3.2.4.2 P2 has exactly five maximal classes: T0 , T1 , M, S, and L. Proof. It is easy to see that the sets T0 , T1 , M, S, L are pairwise distinct proper subclasses of P2 . Therefore, proof of the following suffices for the proof of our theorem: ∀A ⊆ P2 : ((∀K ∈ {T0 , T1 , M, S, L} : A ⊆ K) =⇒ [A] = P2 ) Let now A ⊆ P2 with {f0 , f1 , fM , fS , fL } ⊆ A, where f0 ∈ T0 , f1 ∈ T1 , fM ∈ M, fS ∈ S and fL ∈ L. If one identifies all variables of f0 with each other, then one gets an unary function f0 ∈ [A] with f0 (0) = 1, i.e., f0 ∈ {c1 , e11 }. Case 1: f0 = c1 . In this case, it holds that f1 (c1 (x), ..., c1 (x)) = c0 (x) ∈ [A]. Since fM ∈ A\M , there are some (ai , bi ) ∈ {(0, 0), (0, 1), (1, 1)} (i = 1, 2, ..., n) with f (a1 , ..., an ) > f (b1 , ..., bn ). Consequently, the function e11 is a superposition over {fM , c0 , c1 } ⊆ [A]. Thus P21 belongs to [A]. By the proof of Lemma 3.2.1.2 (see also Theorem 1.4.3), we can describe the function fLn with the help of a so-called Shegalkin polynom. Since fL does not belong to L, we can assume w.l.o.g. that fL (x) = a0 + x1 · x2 · ... · xr +
n i=1
ai · xi +
ai1 ...iν · xi1 · ... · xiν ,
i1 , ..., iν ∈ {1, ..., n}, ν ≥ r, {i1 , ..., iν } ⊆ {1, ..., r}
holds for r ≥ 2. Now, we consider the function fL (x, y) := fL (x,
y, ..., y , c0 (x), ..., c0 (x)) (r−1) times
which has the form fL (x, y) = a + b · x + c · y + x · y for some a, b, c ∈ {0, 1}. It is easy to check that x · y is a superposition over {fL } ∪ P21 (⊆ A). Consequently, by Theorem 1.4.2, we have [A] = P2 . Case 2: f0 = e11 . Since fSn ∈ S, there exist some a1 , ..., an ∈ {0, 1} with fS (a1 , ..., an ) = fS (a1 , ..., an ). Thus, c1 is a superposition over {fS , e11 } and the Case 2 is put down to the Case 1.
This page intentionally left blank
4 The Subclasses of Pk Which Contain Pk1
We start with the definitions of some subclasses of Pk . We show later that these classes are all classes A of Pk with Pk1 ⊆ A. Let Ut := Pk (t) ∪ [Pk1 ] for t = 2, 3, ..., k. In particular, Uk = Pk . Further, let Lk be the set 1 {f n ∈ Pk | ∃a ∈ E2 ∃f0 ∈ Pk1 ∃f1 , ..., fn ∈ Pk,2 : [Pk1 ]∪ n≥1
f (x) = f0 (a + f1 (x1 ) + f2 (x2 ) + ... + fn (xn ) (mod 2))}.
For k = 2 Lk is the set L, already defined in Chapter 3. The sets Ut and Lk can be described with the help of relations: Lemma 4.1 Let ιhk := {(a0 , ..., ah−1 ) ∈ Ekh | ∃i, j ∈ Ek : i = j ∧ ai = aj } and
λk := {(a, a, b, b), (a, b, a, b), (a, b, b, a) | a, b ∈ Ek }.
Then (a) Ut = P ol ιt+1 for each t ∈ {2, 3, ..., k − 1} k and (b) Lk = P ol λk . t+1 Proof. (a): Obviously, Ut is a subset of P ol ιt+1 k . The inclusion Ut ⊂ P ol ιk t+1 (i.e., there is a function (∈ P ol ιk ) that essentially depends on at least two variables and which has at least t + 1 different values) is false because of
160
4 The Subclasses of Pk Which Contain Pk1
Theorem 1.4.4, (b). Thus, Ut = P ol ιt+1 k . (b): It is easy to check that Lk ⊆ P ol λk . For the proof of P ol λk ⊆ Lk , denote f n an arbitrary function from Pk,2 ∩ (P ol λk ). First, we will show that then f (x1 , 0, ..., 0) + f (0, x2 , ..., xn ) + f (0, 0, ..., 0) = f (x1 , ..., xn ) (mod 2)
(4.1)
holds. Suppose, for some x1 = a1 , ..., xn = an is this false. Then, we have ⎞ ⎛ ⎛ ⎞ a a a a1 0 ... 0 ⎜ 0 a2 ... an ⎟ ⎜ a b b ⎟ ⎟ ⎜ ⎟ f⎜ ⎝ 0 0 ... 0 ⎠ ∈ ⎝ b a b ⎠ a1 a2 ... an b b a for arbitrary a, b ∈ E2 . However, this is a contradiction to f ∈ P ol λk . Therefore, (4.1) holds and this implies: f (x1 , ..., xn ) = a + f1 (x1 ) + ... + fn (xn ) (mod 2), where a := (n − 1) · f (0, 0, ..., 0) (mod 2) and fi (x) := f (0, ..., 0,
x , 0, ..., 0). i-th place
Because of pr1,2,3 λk = ι3k , an arbitrary function g from (P ol λk )\[Pk1 ] has exactly only two different values. Consequently, there exists a certain permutation s ∈ Sk with s(Im(g)) = {0, 1} such that g has the description s−1 (s g) and s g belongs to Pk,2 ∩ P ol λk . It is obvious then that g ∈ Lk . Definition Let E ⊆ Ek with |E| ≥ 2. Then we can define a mapping prE from Pk,E into PE as follows: prE f n = g m :⇐⇒ (n = m ∧ ∀a ∈ E n : f (a) = g(a)) (f n ∈ Pk,E , g m ∈ PE ). Lemma 4.2 Let f 2 be a function from Lk with f (x, y) = x + y (mod 2) for all x, y ∈ E2 , let g m be a function from Pk,2 with prE2 g ∈ L2 and let h ∈ Ut \Ut−1 . Then, (a) Lk = [Pk1 ∪ {f }], (b) U2 = [Pk1 ∪ {g}] and (c) ∀t ∈ {3, 4, ..., k} : Ut = [Ut−1 ∪ {h}]. Proof. (a) follows directly from the definition of Lk . 1 ] = P2 . Therefore, some binary (b): By Theorem 3.2.4.1, [{prE2 g} ∪ prE2 Pk,2
4 The Subclasses of Pk Which Contain Pk1
161
functions ∧ , + with prE2 ∧ = ∧ and prE2 + = + belong to [Pk1 ∪ {g}] and an arbitrary function ut of Pk,2 is a superposition over Pk1 ∪ {∧ , + }: u(a1 , ..., at ) · ja1 (x1 ) · ... · jat (xt ) (mod 2) u(x1 , ..., xt ) = (a1 , ..., at ) ∈ Ekt
(see (1.8) from Section 1.4). This implies (b). (c) is a consequence from Lemma 1.4.5.
Theorem 4.3 (Burle’s Theorem, [Bur 67]) The classes with
[Pk1 ], Lk , U2 , U3 , ..., Uk−1 , Pk [Pk1 ] ⊂ Lk ⊂ U2 ⊂ U3 ⊂ ... ⊂ Uk−1 ⊂ Pk
are the only subclasses of Pk which contain Pk1 . Proof. Suppose there exists a class A of Pk with Pk1 ⊂ A, which is different from the classes of the above theorem. Then A contains a certain function f n , which has at least two essentially variables and at least l ≥ 2 different values. Consequently, by Theorem 1.4.4, (a), (c), there exists some a1 , ..., an , b1 , ..., bn , α, β, γ ∈ Ek with ⎛ ⎞ ⎛ ⎞ a1 a2 a3 ...an α f ⎝ a1 b2 b3 ...bn ⎠ = ⎝ β ⎠ , b1 b2 b3 ...bn γ where |{α, β, γ}| = 3 for l ≥ 3 and α = γ and α = β for l = 2. Then, a binary function f with f (x, y) := g0 (f (g1 (x), g2 (y), ..., gn (y))) and ⎛ ⎞ ⎛ ⎞ 0 0 0 f ⎝ 0 1 ⎠ = ⎝ 1 ⎠ 1 1 0 is a superposition over f and some g0 , ..., gn ∈ Pk1 . We distinguish two cases: Case 1: f (1, 0) = 0. In this case, the function prE2 f is nonlinear. Thus, by Lemma 4.2, (b) it holds U2 ⊆ A. Since we have assumed, however, A = Ut for each t ∈ {2, ..., k}, we obtain a contradiction with the aid of Lemma 4.2, (c). Case 2: f (1, 0) = 1. In this case, by Lemma 4.2, (a) Lk is a subset of A and, because of A = Lk , there is a function g ∈ A, which does not preserve λk . Then, one can form a function g ∈ A ∩ Pk,2 with prE2 g ∈ L2 as a superposition over g and some functions of Lk . Thus, by Case 1, we get a contradiction.
162
4 The Subclasses of Pk Which Contain Pk1
Consequently, the classes given in our theorem are the only subclasses of Pk that contain Pk1 . The claimed chain property is an immediate conclusion from the definitions of these classes. The claimed chain property is a direct conclusion from the definitions of these classes.
5 The Maximal Classes of Pk
5.1 Introduction, a Rough Description of the Maximal Classes A subclass A of Pk is maximal in Pk (or A is called maximal class)1 if and only if no further classes of Pk exist between A and Pk . In other words: A = [A] ⊆ Pk is maximal in Pk if and only if A = Pk and [A ∪ {f }] = Pk for each f ∈ Pk \A. One is interested in these classes not only for structural reasons, but particularly because one can solve a central problem of the Many-Valued Logic (the so-called Completeness Problem) with the aid of these classes (see Theorem 1.5.4.1). Inter alia, the following papers dealt with the determination and description of maximal classes: [Pos 41], [Jab 54], [Jab 58], [Ros 70;a], [Mart 60], [Lo 63;a– ˇ 70;b]. c], [Lo 64], [Zac 67], [Zac-K-J 69], [Bai 67] and [Sai One knows the maximal classes T0 , T1 , M, S, and L of P2 (see Theorem 3.2.4.2) through the papers [Pos 20], [Pos 41] by E. L. Post. Efforts to determine all maximal classes of Pk for k ≥ 3 began more than 50 years ago. S. V. Jablonskij determined all 18 maximal classes of P3 in [Jab 54]. A. I. Mal’tsev proved how in the paper [Zac-K-J 69] was mentioned that P4 has exactly 82 maximal classes. I. G. Rosenberg was the first that succeeded in the description of all maximal classes of Pk for each k ∈ N \ {1} (see [Ros 65]), and he proved in [Ros 70a] that the list of the given classes is complete. Rosenberg defined six relation sets, which are subsequently denoted by us with Uk , Mk , Sk , Lk , Ck and Bk , and he proved that the set {P olk | ∈ Uk ∪ Mk ∪ Sk ∪ Lk ∪ Ck ∪ Bk } 1
One uses instead of “maximal class” the concept “precomplete class” in older papers.
164
5 The Maximal Classes of Pk
is exactly the set of all maximal classes of Pk . He could use that some other authors had shown already the maximality of some classes P ol . For example, for classes of the form P ol 1 with 1 ∈ Uk ∪ Sk ∪ C1k and ∈ Lk , where k is a prime number, it was proven in [Jab 58] that these classes are maximal classes. In [Mart 60], one finds maximal classes of the form P ol 2 with 2 ∈ Mk . For further details, we refer the reader to [Ros 70;a]. In Section 5.2, we will describe the maximal classes of Pk in the manner found from Rosenberg.2 Further, we give first properties of the maximal classes, where these properties are consequences from the definitions more or less. Then, in Section 5.3, the maximality of the classes described in the theorem is proven. It turns out, in this case, that one manages with three basic ideas in the proof. Chapter 6 is dedicated to the proof of the completeness of the given set of maximal classes then. This most difficult part of the determination of maximal classes orientates itself strongly onto the proof given in [Ros 70;a]. One could abbreviate, however, the proof through transfer and modification of some ideas from the papers [Qua 82], [P¨ os- K 79] (p. 126-129) and [Lau 92a]. A first coarse description of the maximal classes supplies the following theorem basically already proven by A. V. Kuznezov in 1959. Theorem 5.1.1 ([Kuz 59], [Ros 70;a] (3.2.5), [But 60]) The class Lk for k = 2 or Uk−1 (= P olk ιkk ) for k ≥ 3 is the only maximal class of Pk , which contains Pk1 . For every maximal class A of Pk , which is different from L2 and Uk−1 , is valid: A = P olk G1 (A). Proof. Let A be an arbitrary maximal class of Pk . Then, the following two cases are possible: Case 1: A1 = Pk1 . Then, by Theorem 4.3, A is the set L2 for k = 2 or the set Uk−1 for k ≥ 3. Case 2: A1 ⊂ Pk1 . In this case, (A1 ; ) is a proper subsemigroup of (Pk1 ; ) which e := e11 contains, what one can prove as follows: Suppose, e ∈ A1 . Then A1 ∩ [Pk1 [k]] = ∅, since sk = e for all s ∈ Pk1 [k]. Consequently, we have A ⊂ Jk ∪ A = [Jk ∪ A] ⊂ Pk , which contradicts the presupposed maximality of A. Thus A is a clone, for which, by Theorem 2.7.1, (c) A ⊆ P olk G1 (A) ⊆ Pk 2
This is not the only means to describe maximal classes. In [Den-P 88] one can find descriptions of maximal classes of Pk through hyperidentities. One finds more about hyperidentities in the book [Den-W 2000] of K. Denecke and S. L. Wismath.
5.2 Definitions of the Maximal Classes of Pk
165
holds. Because of A1 = Pk1 and the maximality of A, this is possible only for A = P olk G1 (A).
5.2 Definitions of the Maximal Classes of Pk The maximal classes are defined with the aid of the relation sets Mk , Sk , Uk , Lk , Ck and Bk . Indeed, by Theorem 5.1.1, one can describe every maximal class of Pk for k ≥ 3 with the aid of a certain k-ary relation in the form P ol . If P ol is a maximal class, then, P ol = P ol isvalid for all -derivable non-diagonal k relation . Therefore, the elements of h=1 Rkh \Dkh are possible descriptive relations for a maximal class P olk . The subsequently defined relations of Mk , Sk , Uk , Lk , Ck and Bk are (with few exceptions), with respect to the arity, minimally chosen relations, which one can use to describe the maximal classes (see Chapter 10). We say that a maximal class A is a class of type X, if there exist an X ∈ {M, S, U, L, C, B} and a ∈ Xk with A = P olk . 5.2.1 Maximal Classes of Type M (Maximal Classes of Monotone Functions) Let Mk be the set of all partial orders on Ek with a greatest and a least element. More exactly, a binary relation ∈ Rk belongs to Mk if and only if has the following four properties: 1) is reflexive (i.e., ι2k ⊆ ); 2) is antisymmetric (i.e., ∩ −1 = ι2k ); 3) is transitive (i.e., ◦ = ) and 4) there exist elements o (”least element”) and e (”greatest element”) in Ek with {(o , x), (x, e ) | x ∈ Ek } ⊆ . It can easily be shown (see proof of Lemma 6.1.6) that the elements o and e are uniquely determined. We write a ≤ b instead of (a, b) ∈ and a < b, if (a, b) ∈ \ι2k . Furthermore, for a, b ∈ Ekn we put a ≤ b :⇐⇒ ∀i ∈ {1, ..., n} : ai ≤ bi . Obviously, a function f n ∈ Pk preserves the relation ∈ Mk if and only if the following holds: ∀a, b ∈ Ekn : a ≤ b =⇒ f (a) ≤ f (b). Thus the functions of P ol are (non-decreasing) monotone functions. Obviously, we have:
166
5 The Maximal Classes of Pk
Lemma 5.2.1.1 ∀, ∈ Mk : (P ol = P ol ⇐⇒ = τ ∨ = ).
For k ∈ {2, 3} all classes of type M are 0 0 1 M = P ol2 , 0 1 1 0 1 2 0 0 1 P ol3 0 1 2 1 2 2 0 1 2 0 0 2 P ol3 0 1 2 2 1 1 0 1 2 2 2 0 P ol3 0 1 2 0 1 1
(0 < 1 < 2), (0 < 2 < 1) and (2 < 0 < 1).
For larger k it is better to give the Hasse diagram, which characterizes the relation in unambiguous way, instead of the elements of . Figures 5.1 and 5.2 give the possible “basic diagrams” (i.e., diagrams without node names) for k = 4 and k = 5; hence (Ek ; ≤ ) is a lattice for k ≤ 5. k=4:
Fig. 5.1 k=5:
Fig. 5.2
For k ≥ 6 there are, however, ∈ Mk , so that (Ek , ) is not a lattice. Figure 5.3 is an example.
5.2 Definitions of the Maximal Classes of Pk
167
Fig. 5.3
5.2.2 Maximal Classes of Type S (Maximal Classes of Autodual Functions) For an arbitrary permutation s ∈ Sk , let s := {(x, s(x)) | x ∈ Ek }. Functions, which preserve a relation of the form s , are called autodual (in respect to s). Let Sk be the set of all relations of the form s , where s is an arbitrary permutation on Ek with k/p cycles of the same prime length p. Some examples for maximal classes of type S are the following: 0 1 P ol2 , 1 0 0 1 2 , P ol3 1 2 0 0 1 2 3 4 5 , P ol6 1 0 3 2 5 4 0 1 2 3 4 5 . P ol6 1 2 0 4 5 3 Subsequently, we assume that an arbitrary permutation s with s ∈ Sk is defined as follows: If k = l · p (p a prime number, l ≥ 1) and {a1,0 , ..., a1,p−1 , a2,0 , ..., a2,p−1 , ..., al,0 , ..., al,p−1 } = Ek , we put s(ar,i ) := ar,i+1 (mod p) (r = 1, 2, ..., l; i = 0, 1, ..., p − 1). Then, it holds
168
5 The Maximal Classes of Pk
sa (ar,i ) = ar,i+a (mod p) if a = 0, 1, .... By definition of s , we have for arbitrary function f n ∈ P ol s : s(f (x1 , x2 , ..., xn )) = f (s(x1 ), s(x2 ), ..., s(xn ))
(5.1)
or f (x1 , x2 , ..., xn ) = si (f (sp−i (x1 ), sp−i (x2 ), ..., sp−i (xn ))) (i = 0, 1, ..., p − 1). (5.2) This implies that f (ar,i , x2 , ..., xn ) = si (f (ar,0 , sp−i (x2 ), ..., sp−i (xn ))) (i = 0, 1, ..., p − 1; r = 1, 2, ..., l).
(5.3)
Let Skn be the set of all n-ary functions f ∈ Pk , for which there exists some (n − 1)-ary functions F1 , F2 , ..., Fl ∈ Pk ∪ Ek such that f (x) =
p−1 l
jar,i (x1 ) · si (Fr (sp−i (x2 ), ..., sp−i (xn ))),
(5.4)
r=1 i=0
where + is the addition modulo k, · is the multiplication modulo k and ja is defined by 1 if x = a, ja (x) := 0 otherwise, for a ∈ E2 . We call the function Fr r-th component of f . Theorem 5.2.2.1 It holds: P ol s =
n≥1
Skn .
Proof. For every function f ∈ Pkn there exists a description of the form f (x) =
k−1
ji (x1 ) · f (i, x2 , ..., xn ) (mod k).
(5.5)
i=0
If f ∈ P ol s then it follows from (5.5) with the aid of (5.3): f (x) =
p−1 l
jar,i (x1 ) · si (f (ar,0 , sp−i (x2 ), ..., sp−i (xn ))).
r=1 i=0
Consequently, P ol s ⊆ Let now g ∈ Pkn with g(x) =
p−1 l r=1 i=0
n≥1
Skn .
jar,i (x1 ) · si (Gr (sp−i (x2 ), ..., sp−i (xn ))) ∈ Skn ,
(5.6)
5.2 Definitions of the Maximal Classes of Pk
169
where G1 , G2 , ..., Gl are some (n − 1)-ary functions of Pk . We have to show that g ∈ P olk s . For i ∈ Ep and 1 ≤ r ≤ l it holds: g(s(ar,i ), s(x2 ), ..., s(xn )) = g(ar,i+1 mod p , s(x2 ), ..., s(xn )) = si+1 (Gr (sp−(i+1) (s(x2 )), ..., sp−(i+1) (s(xn )))) = s(si (Gr (sp−i (x2 ), ..., sp−i (xn )))) = s(g(ar,i , x2 , ..., xn )), i.e., g ∈ P olk s . Thus, n≥1 Skn = P olk s . We will need the following lemma to determine the number of maximal classes of Pk later. Lemma 5.2.2.2 ∀s , s ∈ Sk : P olk s = P olk s ⇐⇒ ∃i ∈ {1, ..., k} : si = s . Proof. “=⇒”: Let s, s ∈ Sk and P olk s = P olk s . Then we have Im(s) = Im(s ) = Ek and s, s ∈ P olk s . Therefore, by Lemma 5.2.2.1, we can de are nullary functions, i.e., elscribe s in the form (5.4), where S0 , ..., Sp−1 ements of Ek . Thus, s is unique determined by s (ar,0 ) (r = 1, 2, ..., l). For every r ∈ {1, 2, ..., l}, s (ar,0 ) belongs to {ar,0 , ar,1 , ..., ar,p−1 }, since one receives a contradiction in choosing s in the opposite case, as follows:Suppose we have s (ar,0 ) = as,i with r = s for certain r, s, i. Set V := {as,i , s(ar,i ), ..., sp−1 (ar,i )}. Then, the permutation t with t(x) := s(x) for all x ∈ V and t(x) := x for x ∈ Ek \V belongs to P ol s and, therefore, also to P ol s . Because of s (ar,0 ) = as,i we have (ar,0 , as,i ) ∈ s and, by definition of t, this implies ar,0 ar,0 . = t as,i s(as,i ) Thus, (because of t ∈ P ol s ) as,i = s(as,i ), in contradiction to s ∈ Sk . Let now s (a1,0 ) = a1,i for certain i ∈ Ep . We have to show that s (ar,0 ) = ar,i for all r ∈ {2, 3, ..., l} holds. Suppose s (ar,0 ) = ar,j for certain j ∈ Ep \{i} and r ∈ {2, 3, ..., l}. Then, a function g 2 with g(a1,0 , ar,0 ) = g(a1,0 , ar,j−i (mod p) ) = ar,0 belongs to P olk s , for which we have, by (5.3), a1,0 ar,0 ar,0 g = ∈ s . a1,i ar,j ar,i Hence, the function g does not preserve the relation s , contrary to the assumption P olk s = P olk s . Thus we have s (ar,0 ) = ar,i for all r ∈ {1, 2, ..., l} and si = s holds. “⇐=”: If s, s ∈ Sk and si = s then s s and s s. Hence P olk s ⊆ P olk s and P olk s ⊆ P olk s by Theorem 2.6.3. Thus, P olk s = P olk s .
170
5 The Maximal Classes of Pk
5.2.3 Maximal Classes of Type U (Maximal Classes of Functions, Which Preserve Non-Trivial Equivalence Relations) Let Uk be the set of all non-trivial equivalence relations on Ek , i.e., for an arbitrary binary relation ∈ Rk we have: ∈ Uk ⇐⇒ (ι2k ⊆ ∧ −1 = ∧ ◦ = ∧ ∈ {ι2k , Ek2 }). For k = 2, classes of the type U do not occur. For k = 3 there are exactly three classes of the form P ol with ∈ U3 : 0 1 2 0 1 , P ol3 0 1 2 1 0 0 1 2 0 2 and P ol3 0 1 2 2 0 0 1 2 1 2 . P ol3 0 1 2 2 1 In the following, let be an arbitrary relation of Uk . Further, let Ai (i ∈ Ek ) be the equivalence classes (blocks) of this relation. By Lemma 1.4.6, an arbitrary function f n ∈ Pk is representable in the form (1.12). Since, in this case, the used functions fi (i ∈ Ek ) and the function z belong to P ol , the function f preserves the relation if and only if gf ∈ P ol is valid. One can easily show that the functions of the form gf (∈ P ol ) are completely determined through their values on the set {ai | i ∈ Ek }n . Hence, ({gf | f ∈ P ol }; ζ, τ, ∆, ∇, ) is isomorphic to
(Pk ; ζ, τ, ∆, ∇, ).
Let now q a unary function of Pk defined by ∀i ∈ Ek : q(x) = ai :⇐⇒ x ∈ Ai . Then, the following lemma results from our above considerations. Lemma 5.2.3.1 ∀f n ∈ Pk : f ∈ P ol ⇐⇒ ∃hn ∈ P{a0 ...,ak −1 } : gf (x) = h(q(x1 ), ..., q(xn )).
In addition, the following is obviously valid: Lemma 5.2.3.2 ∀, ∈ Uk : P ol = P ol ⇐⇒ = .
5.2 Definitions of the Maximal Classes of Pk
171
5.2.4 Maximal Classes of Type L (Maximal Classes of Quasi-Linear Functions) The maximal classes, which are treated in this section, only occur if k is a prime number power pm . Therefore, we assume k = pm with p ∈ P in this section. Let G be the set of all p-elementary Abelean groups of the form (Ek , ⊕). All elements of such groups, which are different from the neutral element, have the order p, i.e., if o denotes the neutral element of the group (Ek , ⊕) ∈ G, then p is the smallest number with x ⊕ x ⊕ ... ⊕ x = o p times for all x ∈ Ek \ {o}. Let Lk be the set of all relations λG with G := (Ek ; ⊕) ∈ G and λG := {(a, b, c, d) ∈ Ek4 | a ⊕ b = c ⊕ d}. If k is not a prime number power, we set Lk = ∅. One can also describe the maximal classes of the form P ol λG as follows: Since k is a prime number power, it is well-known that one can define certain operations + and · on Ek , so that the algebra GF (pm ) := (Ek ; +, ·) is a field, where the additive group of this field belongs to G. If one now chooses a suitable field with the operations + := ⊕ and · to a group G := (Ek , ⊕) ∈ G, then (by Theorem 1.4.3) every function f n ∈ Pk is uniquely definable through a formula of the form f (x) = ai1 ...in · xi11 · ... · xinn (i1 ...,in )∈Ekn
with the aid of the chosen field operations. A function g n , which is defined through a formula of the specific form g(x) = a0 +
n m−1 i=1 j=0
j
aij · xpi ,
(5.7)
is called quasi-linear. In particular, if m = 1 (i.e., k is a prime number), then g is called a linear function as usual. The set of all quasi-linear functions g n (n = 1, 2, ...) of the form (5.7) is a closed set, as one can easily check with aid of the well-known fact i
i
i
∀i ∈ {0, 1..., m} : (x + y)p = xp + y p , where x, y ∈ GF (pm ). Further, it holds that
172
5 The Maximal Classes of Pk
Lemma 5.2.4.1 The following statements are equivalent: (a) f n ∈ P ol λG ; (b) f n is quasi-linear; (c) f (x1 + y1 , x2 + y2 , ..., xn + yn ) = f (x1 , ..., xn ) + f (y1 , ..., yn ) + f (o, ..., o). Proof. (a) ⇐⇒ (c): Because of (x, y, x + y, o) ∈ λG every f n ∈ P ol λG satisfies the condition (c). Conversely, if (c) holds and (xi , yi , ui , vi ) ∈ λG (i = 1, 2, ..., n), then f (x1 , ..., xn ) + f (y1 , ..., yn ) = f (x1 + y1 , ..., xn + yn ) + f (o, ..., o) = f (u1 + v1 , ..., un + vn ) + f (o, ..., o) = f (u1 , ..., un ) + f (v1 , ..., vn ). Thus f ∈ P ol λG . (a) ⇐⇒ (b): Since every quasi-linear function is obviously a superposition i over B := {x + y, xp , a · x, ca | i ∈ {1, .., m − 1} ∧ a ∈ Ek }, and by (5.8) all functions of B preserve the relation λG , the implication (b) =⇒ (a) is valid. In Theorem 5.3.6, we show that the set of all quasi-linear functions is maximal in Pk . Therefore, (a) =⇒ (b) is right. Lemma 5.2.4.2 Let G := (Ek ; +) and G := (Ek , + ) be elements of G. Then, the following statements are equivalent: (a) P ol λG = P ol λG . (b) There exists an element c ∈ Ek such that die mapping α : Ek −→ Ek , x → x + c is an isomorphism from G onto G. (c) λG = λG . Proof. Denote o and o the neutral elements of G and G , respectively. (a) =⇒ (b): Let P ol λG = P ol λG . Then, the function g 2 with g(x, y) = x + y belongs to P ol λG . Because of (x, o , o , x), (o , y, o , y) ∈ λG this implies g(x, y) = g(x, o ) + g(o , y) − g(o , o ) or
x + y = x + y − o .
(5.8)
With the aid of (5.8), one can verify that α(x) := x − o is an isomorphic mapping from G onto G. (b) =⇒ (a): Let α be an isomorphism from G onto G with α(x) := x + c for certain c ∈ Ek . Then, for arbitrary f n ∈ P ol λG by Lemma 5.2.4.1, we have f (o) = f (o + c) = f (o ) + f (c) − f (o) and
f (x + y) = f (x) + f (y) + f (c) − f (c) − f (o) − f (o).
It results from (5.9) and (5.10):
(5.9) (5.10)
5.2 Definitions of the Maximal Classes of Pk
173
f (x + y) = f (x) + f (y) − f (o ). Thus
α(f (x + y)) = (f (x) + c) + (f (y) + c) − (f (o ) + c) = α(f (x)) + α(f (y)) − α(f (o )) = α(f (x) + f (y) − f (o ))
holds because α is an isomorphism. Consequently, by Lemma 5.2.4.1, f preserves the relation λ; hence P ol λG ⊆ P ol λG . Since α−1 is also an isomorphism (from G onto G ), we have also P ol λG ⊆ P ol λG . Thus (a) holds. (a) ⇐⇒ (c) follows easily by means of (a) ⇐⇒ (b). The following representation of quasi-linear functions is better suited for some purposes (for example, determining subclasses of P ol λG ) than the above definition. It is well-known that every group G = (Ek ; +) of G is isomorphic to (W ; ⊕), where W := Epm and (x1 , ..., xm ) ⊕ (y1 , ..., ym ) := (x1 + y1 (mod p), ..., xm + ym (mod p)) for arbitrary (x1 , ..., xm ), (y1 , ..., ym ) ∈ Epm . One can assign a function F n ∈ PW to every function f n ∈ Pk (k = pm ) by means of the isomorphism α, as follows: F n (α(x1 ), ..., α(xn )) := α(f (x1 , ..., xn )). Let LnW be the set of all n-ary functions of PW , for which there are an a ∈ W and some matrices A1 , ..., An ∈ Epm×m such that F (X1 , ..., Xn ) = a + X1 · A1 + ... + Xn · An ,
(5.11)
where + and · are the usual matrix operations and Xi := (xi1 , ..., xin ) ∈ Epm (i = 1, ..., n). Then, we have: Lemma 5.2.4.3 ([Ros 70;a], 7.3.3) LW := n≥1 LnW is isomorphic to P ol λG for all G ∈ G. Proof. It is easy to check that each function of the form (5.11) fulfills the condition (c) of Lemma 5.2.4.1, whereby LW is isomorphic to a subset of P ol λG . 2 LW ∼ = P ol λG follows from the fact that |LnW | = pm+n·m = (pm )1+n·m = k 1+n·m = |(P ol λG )n |. 5.2.5 Maximal Classes of Type C (Maximal Classes of Functions, Which Preserve Central Relations) An h-ary relation γ (1 ≤ h ≤ k − 1) auf Ek is called central, iff γ has the three following properties:
174
5 The Maximal Classes of Pk
1) γ is totally reflexive and non-diagonal, i.e., it holds ιhk ⊆ γ = Ekh (ι1k := ∅); 2) γ is totally symmetric, i.e., for every permutation s on {1, 2, ..., h} it holds: (a1 , ..., ah ) ∈ γ =⇒ (as(1) , ..., as(h) ) ∈ γ; 3) there exists at least a central element c ∈ Ek , i.e., (a1 , ..., ah−1 , c) ∈ γ for all a1 , ..., ah−1 ∈ Ek . Let Chk be the set of all central h-ary relations on Ek and Ck := Chk . h≥1
Notice that
C1k = { | ∅ ⊂ ⊂ Ek }.
For k ∈ {2, 3}, only the following classes are defined by central relations: P ol2 (0), P ol2 (1), P ol3 (a) (a ∈ E3 ), P ol3 (a b) if {a, b} ⊆ E3 and a = b, 0 1 2 a b a c if {a, b, c} = E3 . P ol3 0 1 2 b a c a Because of total reflexivity and total symmetry of the relations of Ck , Pk,{a1 ,...,ah } is a subset of P ol γ for every γ ∈ Ck and (a1 , ..., ah ) ∈ γ. With the aid of this property, one can easily prove that the following lemma holds: Lemma 5.2.5.1 ∀γ, γ ∈ Ck : P ol γ = P ol γ ⇐⇒ γ = γ . 5.2.6 Maximal Classes of Type B (Maximal Classes of Functions, Which Preserve h-Universal Relations) In the literature, one finds two possibilities for describing the defining relations of the maximal classes of the type B. Both possibilities go back to papers from I. G. Rosenberg. We begin with the definition from [Ros 65]. At the end of this section, the reader finds the second description for classes of the type B, which uses so-called h-regular relation sets defined in [Ros 70c]. One can represent every a ∈ Ehm (h ≥ 3, m ≥ 1) unique in the form a = a(m−1) · hm−1 + a(m−2) · hm−2 + ... + a(1) · h + a(0) ,
(5.12)
where a(m−1) , a(m−2) , ..., a(0) ∈ Eh are suitably chosen. h ⊆ Ehhm is called h-ary elementary, if it holds: The h-ary relation ξm (i)
(i)
(i)
h (a0 , ..., ah−1 ) ∈ ξm :⇐⇒ ∀i ∈ Em : (a0 , a1 , ..., ah−1 ) ∈ ιhk .
In particular, ξ1h = ιhk for m = 1. An h-ary relation on Ek is a homomorphic inverse image of an h-ary
5.2 Definitions of the Maximal Classes of Pk
175
relation on Ek , if there exists a mapping q from Ek onto Ek , such that, for all a1 , ..., ah ∈ Ek , it holds: (a1 , a2 , ..., ah ) ∈ ⇐⇒ (q(a1 ), q(a2 ), ..., q(ah )) ∈ . Let Bhk be the set of all homomorphic inverse images of the h-ary elementary h and put relation ξm k Bhk . Bk := h=3
Bhk
The elements of are also called h-universal relations. For k = 3 we have B = {ι33 }. To derive a description of the functions from the clone P ol with ∈ Bk without using relations, we assume that is an h-ary relation on Ek which h ⊆ Ehm in is a homomorphic inverse image of the h-ary elementary relation ξm m the following. In addition, let q be the mapping from Ek onto Eh which belongs to this relation because of definition. This mapping defines a partition on Ek in the blocks Ai := {x ∈ Ek | q(x) = i}, i ∈ Ehm . We select a representative ai from every one of these blocks Ai . Further, let r be a unary function with r(i) = ai for all i ∈ Ehm . As already given in Lemma 1.4.6, an arbitrary function f n from Pk is as a superposition over the functions z, gf , fi (i ∈ Ehm ), defined by z(x, y) := xy ( xy = y if ∃i ∈ Ek : x = ai and y ∈ Ai ; xy = x otherwise), gf (x1 , ..., xn ) := ai ⇐⇒ f (x1 , ..., xn ) ∈ Ai , f (x1 , ..., xn ) if f (x1 , ..., xn ) ∈ Ai , fi (x1 , ..., xn ) := otherwise ai (i ∈ Ek ), represents as follows: f (x) = ((...((gf (x)f0 (x))f1 (x))...)fhm −1 (x)).
(5.13)
Since an arbitrary function tn ∈ Phm is describable in the form t(x) = (t(x))(m−1) · hm−1 + (t(x))(m−2) · hm−2 + ... + ((t(x))(0)
(5.14)
(see also (5.12)), we can describe the function from (5.13) with the aid of (5.14) as follows: gf (x) = r(fm−1 (x) · hm−1 + fm−2 (x) · hm−2 + ... + f1 (x) · h + f0 (x)), (5.15)
where fi (x1 , ..., xn ) := (q(f (x1 , ..., xn )))(i) for i ∈ Ehm . Now, one can describe the functions of P ol without using relations, as follows:
176
5 The Maximal Classes of Pk
Theorem 5.2.6.1 ([Lau 78;a]) An n-ary function f ∈ Pk belongs to the class P ol if and only if for the function gf (see (5.15)) is valid: ∀ i ∈ {0, 1, . . . , m − 1} : either (|Im(fi )| ≤ h − 1) or there are j ∈ {1, . . . , n}, v ∈ Em , a permutation s on Eh
(5.16)
such that fi (x1 , . . . , xn ) = s((q(xj ))(v) ) . Proof. Obviously, every function with the properties of the above theorem belongs to the class P ol . We must prove that an arbitrary n-ary function f , which does not fulfill the conditions of the theorem, does not belong to P ol . Case 1: In the description (5.15), for gf , there is an i so that fi is dependent at least of two variables essentially and it holds Im(fi ) = Eh . Then, by Theorem 1.4.4, (b) there exists some h−tuples r1 , ..., rn ∈ ιhk with fi (r1 , ..., rn ) ∈ Ekh \ιhk . Consequently, f (r1 , ..., rn ) ∈ . Case 2: In the description (5.15), for gf , there is an i, so that fi is dependent essentially only of the variable xj (1 ≤ j ≤ n), |Im(fi )| = Eh and fi can not be described in the form fi (x1 , . . . , xn ) = s((q(xj ))(v) ). h 1 ) with fi (x1 , ..., xn ) = F (q(xj )) exists. Case 2.1: No function F ∈ (P ol ξm In this case, there are tuples a = (a1 , ..., an ), b = (b1 , ..., bn ) ∈ Ekn with fi (a) = fi (b) and (q(a1 ), q(a2 ), ..., q(an )) = (q(b1 ), ..., q(bn )). By Im(fi ) = Eh there exist tuples c2 , c3 , ..., ch−1 ∈ Ekn with {fi (a), fi (b), fi (c2 ), ..., fi (ch−1 )} = Eh . Consequently, (f (a), f (b), f (c2 ), ..., f (ch−1 )) ∈ . This and the fact that the columns of the matrix ⎞ ⎛ a ⎟ ⎜b ⎟ ⎜ ⎜ c2 ⎟ ⎟ ⎜ ⎠ ⎝ ... ch−1 belong to imply f ∈ P ol . h 1 Case 2.2: There exists a function F ∈ (P ol ξm ) with fi (x1 , ..., xn ) = F (q(xj )). With the aid of function F , one can define an m-ary function F ∗ ∈ Ph as follows: F ∗ (a(m−1) , a(m−2) , ..., a(0) ) := F (a(m−1) · hm−1 + a(m−2) · hm−2 + ... + a(0) ). If one can not describe the function fi as it is given in the theorem, then the function F ∗ must depend on at least two variables, essentially. With the aid
5.2 Definitions of the Maximal Classes of Pk
177
of Theorem 1.4.4, (b) this implies that f does not preserve . We illustrate the above theorem with the following Examples Let h = 3, m = 2, k = 11, q : E11 −→ E9 be defined by q(x) := x + 1 (mod 9) for x ∈ E9 , q(9) = 4 and q(10) = 1. Further, let the two permutations s1 and s2 be defined by x s1 (x) s2 (x) 0 1 2 1 0 0 2 2 1 For x = x(1) · 3 + x(0) ∈ E9 , let g(x) := s1 (x(0) ) and g (x) := s2 (x(1) ), i.e., x x(1) x(0) g(x) g (x) 0 0 0 1 2 1 0 1 0 2 2 0 2 2 2 3 1 0 1 0 4 1 1 0 0 5 1 2 2 0 6 2 0 1 1 7 2 1 0 1 8 2 2 2 1 Then, the ternary functions f, h ∈ P9 defined by f (x1 , x2 , x3 ) := g(x1 ) · 3 + g (x3 ) (1)
(0)
(here f0 (x1 , x2 , x3 ) = g (x3 ) = s2 (x3 ) and f1 (x1 , x2 , x3 ) = g(x1 ) = s1 (x1 )) and h(x1 , x2 , x3 ) := g(x2 ) · 3 + f (x1 , x2 , x3 ), where Im(f ) ⊂ {0, 1, 2} and |Im(f )| ≤ 2, both belong to Pol ζ2 . The following is an example of a unary function f ∈ P11 (see last column below) that preserves the relation : x q(x) (q(x))(1) (q(x))(0) s1 ((q(x))(1) ) r(x) q(f (x)) f (x) 0 1 0 1 1 1 4 3 1 2 0 2 1 1 4 9 2 3 1 0 0 1 1 10 3 4 1 1 0 1 1 0 4 5 1 2 0 0 0 8 5 6 2 0 2 0 6 5 6 7 2 1 2 0 6 5 7 8 2 2 2 1 7 6 8 0 0 0 1 1 4 3 9 4 1 1 0 1 1 0 10 1 0 1 1 1 4 9
178
since
5 The Maximal Classes of Pk
q(f (x)) = s1 ((q(x))[1] ) · 3 + r(x).
Lemma 5.2.6.2 follows from the definition of the classes of the form P ol with ∈ Bk : Lemma 5.2.6.2 ∀, ∈ Bk : P ol = P ol ⇐⇒ = . Finally, we declare another possibility for describing of h-universal relations. We need the following concepts and notations: Let 3 ≤ h ≤ k, m ≥ 1, hm ≤ k, let ϑi for i ∈ Em be an equivalence relation on Ek and T := {ϑ0 , ..., ϑm−1 }. Then, T is called h-regular if T fulfills the following two conditions: 1) For every i ∈ Em , the equivalence relation ϑi has exactly h equivalence classes. 2) Choosing for every i ∈ Em an equivalence class εi of the relation ϑi m−1 arbitrary, then i=0 εi = ∅. An h-ary relation ⊆ Ekh is called h-regular if there exists an h-regular set T := {ϑ0 , ..., ϑm−1 } such that for arbitrary a0 , ..., ah−1 ∈ Ek it holds: (a0 , ..., ah−1 ) ∈ ⇐⇒ (∀i ∈ Em ∃ {r, s} ⊂ Eh : r = s ∧ (ar , as ) ∈ ϑi ). Lemma 5.2.6.3 ([Ros 70c]) Let 3 ≤ h ≤ k, m ≥ 1, hm ≤ k and ∈ Ekh . Then, is h-universal iff is h-regular. Proof. “=⇒”: Let be h-universal; i.e., there exists a surjective mapping q : Ek −→ Ehm with h (a0 , ..., ah−1 ) ∈ ⇐⇒ (q(a0 ), ..., q(ah−1 )) ∈ ξm .
With the aid of , one can define equivalence relations ϑi ⊆ Ek2 with i ∈ Em as follows: (a, b) ∈ ϑi :⇐⇒ (q(a))(i) = (q(b))(i) . It is easy to check that T := {ϑ0 , ..., ϑm−1 } is h-regular and the h-regular relation T defined with the aid of T is identical with . “⇐=”: Let be h-regular and T := {ϑ0 , ..., ϑm−1 } denotes the corresponding h-regular set. Let εi,0 , εi,1 , ..., εi,h−1 be the equivalence classes of the equivalence relation ϑi for i ∈ Em . Every x ∈ Ek belongs to exactly one equivalence class of ϑi , which we describe with εi,ai (x) . With the help of the numbers ai (x) ∈ Eh one can define a mapping q as follows:
5.3 Proof of the Maximality of the Classes Defined in Section 5.2
q : Ek −→ Ehm , x →
m−1
179
ai (x) · hi .
i=0
Obviously, q is surjective. Furthermore, we have (x0 , ..., xh−1 ) ∈ if and only if ({ai (x0 ), ..., ai (xh−1 )) ∈ ιhh for all i ∈ Em . Consequently, q is a mapping from Ek onto Ehm with h , (x0 , ..., xh−1 ) ∈ ⇐⇒ (q(x0 )), ..., q(xh−1 ) ∈ ξm
i.e., is h-universal.
5.3 Proof of the Maximality of the Classes Defined in Section 5.2 An h-ary relation is called a strong relation iff it fulfills the following two conditions: 1 ∈ P ol : fr,s (r) = s \ιhk = ∅ and ∀r ∈ \ιhk ∀s ∈ ∃fr,s
(5.17)
(ιhk := ∅ for h = 1). A set T ⊆ Ekq is called -independent if for arbitrary pairwise different tuples a1 , a2 , ..., ah of T (ai := (ai1 , ai2 , ..., aiq ) for i = 1, ..., h) there is an j ∈ {1, 2, ..., q} with (a1j , a2j , ..., ahj ) ∈ . Lemma 5.3.1 Let be an h-ary relation with the properties: (a) is a strong relation. (b) For every q ∈ N and for every -independent set T := {a1 , ..., a|T| } ⊆ Ekq it holds
|T |
{(f (a1 ), ..., f (a|T| )) | f ∈ (P ol)q } = Ek .
(5.18)
(c) (h = 1) ∨ (h = 2 ∧ ∩ ιhk ∈ {∅, ιhk }) ∨ (h ≥ 3 ∧ (∃A ⊆ Ek : |A| = h ∧ PEk ,A ⊆ P olk ). Then P ol is maximal in Pk . Proof. Let g m ∈ Pk \P ol be arbitrary; i.e., there are some s1 , ..., sm ∈ with g(s1 , ..., sm ) ∈ . Because of (a) for every r ∈ \ιhk there exists a function fr,si with fr,si (r) = si (i = 1, 2, ..., m). Consequently, the function hr defined by hr (x) := g(fr,s1 (x), ..., fr,sm (x)) has the following properties: hr (r) ∈ and hr ∈ [P ol ∪ {g}]. Let {h1 , h2 , ..., ht } := {hr | r ∈ \ιhk }. It is easy to check that for h ∈ {1, 2} and for every n ∈ N the set Tn := {(x1 , ..., xn , h1 (x1 ), h1 (x2 ), ..., h1 (xn ), h2 (x1 ), h2 (x2 ), ..., n·(t+1)
h2 (xn ), ..., ht (x1 ), ht (x2 ), ..., ht (xn )) | x1 , ..., xn ∈ Ek } ⊆ Ek
180
5 The Maximal Classes of Pk
is -independent. Then, by (b), for every n-ary function f ∈ Pk one can find an n · (t + 1)-ary function f with f (x1 , ..., xn ) = f (x1 , ..., xn , h1 (x1 ), ..., h1 (xn ), ..., ht (x1 ), ..., ht (xn )). Consequently, we have [P ol ∪ {g}] = Pk in the case h ∈ {1, 2}. One can handle the case h ≥ 3 in analog mode when one uses the -independent set Tn := {(x1 , ..., xn , h1 (g1 ), ..., h1 (gu )) | x1 , ..., xn ∈ Ek } with {g1 , ..., gu } := PEnk ,A and suitably chosen h1 instead of Tn . Theorem 5.3.2 ([Jab 58], [Mart 60], [Ros 70;a]) For every ∈ Mk ∪ Uk ∪ Sk ∪ Ck the clone P ol is maximal in Pk . Proof. Obviously, every ∈ Mk ∪ Uk ∪ Sk ∪ Ck satisfies the condition (c) of Lemma 5.3.1. In the following, we show that such relation also fulfills the conditions (a) and (b). For this purpose, hn 1 (n1 ∈ {1, n}) denotes a function of Pk , which either fulfills h (r) = s for arbitrary r (∈ \ιhk ) and s ∈ (see (5.17)), or which can take arbitrary values on an arbitrary -independent set T ⊆ Ekn (see (5.18)). If ∈ Uk ∪Sk ∪Ck , one can consider easily determination for h , so that h ∈ P ol is valid. (For example, if ∈ Ck and h (x) is not yet defined, one sets h (x) = c, where c is a central element of . For ∈ Uk ∪ Sk one can use Lemma 5.2.3.1 and Theorem 5.2.2.1.) If h is a function of the form fr,s with r = Let ∈ Mk in thefollowing. α a ∈ and s = ∈ , then β b a if x < α, h := b otherwise, is a function of P ol. If h is supposed to be determined in the above manner through a -independent set T and (5.18), we put for all x ∈ Ekn \T : o if ∃a ∈ T : x < a, h := e otherwise, where o is the least element and e is the greatest element of Ek in respect to . The function h defined in this way belongs to P ol, as one can prove as follows: Suppose h ∈ P ol. Then, there exists some a, b ∈ Ekn with {a, b} ⊆ T , a < b and t := (h (a), h (b)) ∈ {(α, o), (e, α), (e, o)} ⊆ Ek2 \ for a certain α ∈ Ek \{o, e}. If t = (α, o), we have a ∈ T and thus b ∈ T . Because of h (b) = o, this implies (by the definition of h ) the existence of a c ∈ T with b < c, whereby a < c for a, c ∈ T , in contradiction to the construction of
5.3 Proof of the Maximality of the Classes Defined in Section 5.2
181
T . In similar way one can show that t ∈ {(e, α), (e, o)} is also not possible: If t = (e, α), then b ∈ T and a ∈ T ; hence h (a) = o by the definition of h , in contradiction to h (a) = e. If t = (e, o) then the following three cases are possible: Case 1: a ∈ T and b ∈ T . Because of b ∈ T and h (b) = o there exists a c ∈ T with b < c. By a < b; however, this implies a < c, what was impossible for tuples a, c ∈ T . Case 2: a ∈ T and b ∈ T . This case contradicts the definition of the function h : h (a) = o, since a ∈ T and a < b ∈ T . Case 3: a ∈ T and b ∈ T . Because of h (b) = o and b ∈ T there exists a c ∈ T with b < c. Then a < c is also valid, however; hence h (a) = o, in contradiction to the assumption h (a) = e. Thus our assertion results from Lemma 5.3.1. Theorem 5.3.3 ([Ros 70;a]) For every ∈ Bk the clone P ol is a maximal class of Pk . Proof. Let be defined as in Section 5.2.6. Then, one can represent an arbitrary function f n ∈ Pk \P ol in the form (4.14), (5.15) (see also Lemma 1.4.6), where, by Theorem 5.2.6.1, there exists a function fi that takes all values of {0, 1, ..., h − 1} on some tuples r1 , ..., rn ∈ (see also the proof of Theorem 5.2.6.1). Since g(x) := (q(x))(i) ∈ P ol and Pk,B ⊆ P ol for all B := {b1 , .., bh } with (b1 , ..., bh ) ∈ , the function g f = fi and a function of Pk,h are superpositions over f and some functions of Pk,B ⊂ [P ol ∪ {f }]. Therefore, by Lemma 1.4.5, Pk,h ⊆ [P ol ∪ {f }]; hence all functions of Pk are superpositions over P ol ∪ {f } (see Lemma 1.4.6 and Theorem 5.2.6.1). Now, we come to the proof of the maximality of the classes of type L. For this purpose, let k = pm (p prime, m ≥ 1) and let G := (Ek ; +, ·) be a field with (w.l.o.g.) the zero element 0 and the unit element 1. Let QG be the set of all quasi-linear functions (in respect to G) of Pk . We need two lemmas for proof of the Pk -maximality of QG . Lemma 5.3.4 ([Ros 70;a], 7.2.19) Let f n ∈ Pk \QG (k = pm ). Then [QG ∪ {f }] contains a function of the form h(x, y) =
m p −1
aij · xi · y j ,
i,j=0
which has at least a coefficient ast = 0 with 0 < s, t ≤ pm−1 . Proof. By Theorem 1.4.3, one can represent f in the form (1.9). Because of f ∈ Pk \QG , the following two cases are possible:
182
5 The Maximal Classes of Pk
Case 1: There exists at least a coefficient ai1 ...in with |{i1 , i2 , ..., in }\{0}| ≥ 2. Obviously, in this case, one receives the function h from the function f by identifying some variables and by substituting variables through c1 . Case 2: Each addend different of zero in the formula (1.9) has the form i a0...0ij 0...0 · xjj and there exists a q with g(x) := f (c0 , ..., c0 ,
x , c0 , ..., c0 ) ∈ Pk \QG . q -th place
pm −1 Since c0 ∈ QG , we have g ∈ [QG ∪ {f }]. Now let g(x) := i=0 bi · xi and let d be the greatest index in such kind that d is not a power of p and bd = 0 holds. Then one can also write d in the form d = d1 · pt , where t ≥ 0 and d1 > 0 is relatively prime to p. pm −1 When one forms the function w(x, y) := g(x + y) = i,j=0 aij xi y j , so surrent
t
ders with the aid of the binomial of xd−p y p is theorem that the coefficient d d identical with ad−pt ,pt = · bd . Next, we show that is relatively pt pt prime to p. Obviously, we have: d1 pt (d1 pt − 1)..(d1 pt − p)..(d1 pt − p2 )..(d1 pt − pt + 1) d d 1 pt . = = t t p p pt (pt − 1)......(pt − p)....(pt − p2 )...(pt − pt + 1)
In the numerator and denominator of the above number, some factors, which one can divide by a power of p, stand. When one divides the above fraction by corresponding powers of p, one receives! a"fraction whose factors have the form a + b with p|a and p |b. Therefore, pdt is relatively prime to p. Hence (by bd = 0) ad−pt ,pt = 0. Lemma 5.3.5 ([Ros 70;a], 7.2.11) pm −1 Let h(x, y) = i,j=0 aij xi y j with ast = 0 for some 0 < s, t ≤ pm − 1. Then the function r(x, y) = xs · y t belongs to [QG ∪ {f }]. Proof. Let (u, v) ∈ Ep2m with (u, v) = (s, t). W.l.o.g. we can assume u = s. For a primitive element α of Ek (i.e. for an α ∈ Ek with {αi | 1 ≤ i ≤ pm − 1} = Ek \{0}, see e.g. [Lid-N 87]) we form the superposition g(x, y) := αu · h(x, y) − h(α · x, y) over {h(x, y), αu · x − y, α · x} ⊆ QG ∪ {f }. Then it holds g(x, y) :=
m p −1
(αu − αi ) · aij · xi · y j ,
i,j=0
and we put aij := (αu − αi ) · aij . Obviously, auj = 0. By the properties of a primitive element and because of u = s we have αu = αs and thus ast = 0.
5.4 The Number of the Maximal Classes of Pk
183
Furthermore, aij = 0, if aij = 0. Through repeated use of this construction for every (u, v) = (s, t), one obtains a function d with d(x, y) = dst xs y t and dst = 0. Let b ∈ Ek \{0} be the inverse element of dst . Since b · x ∈ QG , we have b · dst · xs · y t = xs · y t ∈ [QG ∪ {h}]. Theorem 5.3.6 ([Ros 70;a], 7.2.12) Let k = pm (p prime, m ≥ 1). Then, for every λG ∈ Lk (G := (Ek ; +, ·) is a field) the clone P olk λG is maximal in Pk . Proof. W.l.o.g. let 0 be the zero element and let 1 be the unit element of G. In the proof of Lemma 5.2.4.1 we saw that QG ⊆ P olλG . Since P olλG = Pk and QG = [QG ] are also valid, we have only to show the Pk -maximality of QG . Let f ∈ Pk \QG be arbitrary. Then, by Lemmas 5.3.4 and 5.3.5, a function r(x, y) = xs · y t belongs to [QG ∪ {f }], where 0 < s, t ≤ pm − 1. One can also give s and t in the form s = h · pu and t = l · pv , where u, v ≥ 0 and i m h, l are relatively prime to p. Since xp ∈ QG (i ∈ Em ) and xp = x holds, m−u m−v we have w(x, y) := r(xp , yp ) = xh · y l ∈ [QG ∪ {f }]. If one forms now the superposition q(x, y) := w(x + 1, y + 1) over QG ∪ {f }, then one gets the following with the aid of the binomial theorem: h
l
(x + 1) · (y + 1) =
m p −1
aij · xi · y j .
i,j=0
It is easy to check that a11
h l = · = h · l. 1 1
Since h and l are relatively prime to p, this implies a11 = 0 and, therefore, x · y belongs to [P olG ∪ {f }] because of Lemma 5.3.5, Thus, {x · y, x + y, a · x, ca (x) | a ∈ Ek } ⊆ [QG ∪ {f }] holds. Obviously, [QG ∪ {f }] = Pk results from that then because of Theorem 1.4.3.
5.4 The Number of the Maximal Classes of Pk Let
Rmax (Pk ) := Mk ∪ Sk ∪ Uk ∪ Lk ∪ Ck ∪ Bk .
Because of Lemmas 5.2.1.1 and 5.2.2.2 the following relation ∼ is an equivalence relations on Mk ∪ Sk : ∼ :⇐⇒ ∃X ∈ {M, S} : {, } ⊆ Xk ∧ P olk = P olk . When one selects exactly a representative from every equivalence class of ∼, ∼ one receives the relation sets M∼ k ⊆ Mk and Sk ⊆ Sk .
184
5 The Maximal Classes of Pk
Theorem 5.4.1 ([Ros 69]) Let ∼ ∼ (Pk ) := M∼ Rmax k ∪ Sk ∪ Uk ∪ Lk ∪ Ck ∪ Bk . ∼ Then for all , ∈ Rmax it holds:
P olk = P olk ⇐⇒ = .
∼
(5.19) ∼
Proof. Let ∈ Xk and ∈ Yk with X, Y ∈ {M , S , U, L, C, B}. If X = Y, then one can easily prove the assertion (by constructing functions f , g with f ∈ P olk \P olk and f ∈ P olk \P olk ). In the case X = Y the assertion (5.20) follows from Lemmas 5.2.1.1, 5.2.2.2, 5.2.3.2, 5.2.4.3, 5.2.5.1 and 5.2.6.2.
Theorem 5.4.2 ([Ros 73]) For k ≥ 2 there is exactly ∼ ∼ |Rmax | = |M∼ k | + |Sk | + |Uk | + |Lk | + |Ck | + |Bk |
(5.20)
maximal classes of Pk and it is valid: • |M∼ k|=
k·(k−1) 2
· o(k − 2),
where o(i) denotes the number of all different partial order relations on an i-element set (o(0) := 1); 1 k! • |S∼ k|= k=m·p, p prime p−1 · m!·pm ; • |Uk | = z(k) − 2, where z(i) denotes the number of all partitions on a k-element set, which one can calculate as follows: k i=0
• |Lk | = • |Ck | =
(−1)i ·
(k−1)!
i t=0
p( 2 ) ·(p−1)·(p2 −1)·...·(pm −1) m
0
1≤h
− 1,
(−1)t ·
tk ; t! · (i − t)! k = pm , p prime,
, if otherwise;
! " ! " ! " k−1 k−2 0 where ch (k) := k1 · 2( h ) − k2 · 2( h ) + ... + (−1)k−1 · kk · 2(h) and !x" h := 0, if x < h); • |Bk | = 3≤h≤k b(k, h), where b(k, h) :=
m≥0,hm ≤k
for h ≥ 3.
m h h 1 t · ( (−1) · · (hm − t)k ) m! · (h!)m t=0 t m
5.4 The Number of the Maximal Classes of Pk
185
(Specific numbers are given in the following tables.3 )
k 2 3 4 5 6 7 8 ∼ |Rmax | 5 18 82 643 15 182 7 848 984 549 761 933 169 k |M∼ k| |S∼ k| |Uk | |Lk | |Ck | |Bk |
2 1 1 0 1 2 0
3 3 1 3 1 9 1
4 18 3 13 1 40 7
5 6 7 8 9 10 190 3285 88 851 3 640 644 6 35 120 105 1120 19 089 50 201 875 4398 6 0 120 30 840 0 355 11490 7 758 205 549 758 283 980 36 171 813 4012
∼ Proof. In Chapter 6, we prove that {P olk | ∈ Rmax } is the set of all maximal classes of Pk . Because of Theorem 5.4.1, we have to determine the numbers |Xk | with X ∈ {M∼ , S∼ , U, L, C, B}. Case 1: X = M∼ . Obviously, there are k · (k − 1) possibilities to choose a greatest element and a smallest element of a relation ∈ Mk . Consequently, we have |Mk | = k·(k−1) · o(k − 2). k · (k − 1) · o(k − 2); with the aid of Lemma 5.2.1.1: |M∼ k|= 2 Case 2: X = S∼ . Let k = p · m, p prime, m ≥ 1. Then k k−p k − 2p p k! · · · ... · = p p p p m! · pm
is the number of the possible permutations s on Ek , which have exactly m cycles of the length p. Because of Lemma 5.2.2.2 the p − 1 permutations exactly the same maximal class P olk s . Therefore, s, s2 , ..., sp−1 determine k! 1 | = we have |S∼ k k=m·p, p prime p−1 · m!·pm . Case 3: X = U. Obviously, |Uk | = z(k) − 2, where z(k) denotes the number of the possible partitions of a k-element set. Case 4: X = L. Let k = pm , p prime, m ≥ 1. First, we determine |G|, where (as in Section 5.2.4) G is the set of all elementar Abelean p-groups of the form (Ek ; ⊕). As is generally known, every group G ∈ G is isomorphic to an m-fold direct product V := (Zpm ; +) of the group (Zp ; + (mod p)). If s : Zpm −→ Ek is a bijective mapping, then one can define Gs := (Ek ; +s ) as follows: 3
To |M∼ 8 | see also [Com 66], [Rad 83] and [Roz 85].
186
5 The Maximal Classes of Pk
∀x, y ∈ Ek : x +s y := s(s−1 (x) + s−1 (y)). It is easy to check that Gs = Gt ⇐⇒ s−1 t is an automorphism holds for arbitrary bijective mappings s, t from Zpm onto Ek . Consequently, we have k! , |G| = |A| where A denotes the set of all automorphisms on V . Since |A| is identical with the number of the bases of V , we obtain |A| = (pm − 1) · (pm − p) · (pm − p2 ) · ... · (pm − pm−1 ) = p · p2 · ... · pm−1 · (pm − 1) · (pm−1 − 1) · ...(p2 − 1) · (p − 1) m = p( 2 ) · (pm − 1) · (pm−1 − 1) · ... · (p − 1). Furthermore, by Lemma 5.2.4.2, we have |Lk | = |G| k . This implies our assertion about |Lk |. Case 5: X = C. Let Ah be the set of all h-element subsets of Ek , 1 ≤ h ≤ k. Then one can assign an element a of P(Ah ) as follows to every totally reflexive, totally symmetric, h-ary relation in unique manner: {a0 , a1 , ..., ah−1 } ∈ a ⇐⇒ (a0 , a1 , ..., ah−1 ) ∈ \ιhk .
(5.21)
Consequently, if belongs to Chk and the set of all central elements of contains the set C, then by means of (5.21), the relation is unambiguously definite through a subset a of Th,C := {A ∈ Ah | A ∩ C = ∅}. Because of |Th,C | = !k−|C|" k−|C| and |P(T )| = 2( h ) one obtains the number of elements of Ch ∪ h,C
h
{Ekh } through use of the principle of the inclusion and exclusion: k−1 k−2 0 k k k · 2( h ) + ... + (−1)k−1 · · 2( h ) − · 2(h) , ch (k) := 2 1 k
where
!x" h
:= 0 for x < h. Consequently, we have |Ck | =
k−1
h=1 ch (k)
k
− 1.
Case 6: X = B. Let h ≥ 3 and m ≥ 1. A bijective mapping s from Ehm onto Ehm is called an automorphism of ξm , if ∀(a0 , a1 , ..., ah−1 ) ∈ ξm : (s(a0 ), s(a1 ), ..., s(a0 )) ∈ ξm . Let and be relations of Bhk ; i.e., there exists certain mappings q or q from Ek onto Ehm or Ehm with = q −1 (ξm ) and = q −1 (ξm ), respectively (see Section 5.2.6). Next, we show that the equivalence
5.4 The Number of the Maximal Classes of Pk
187
= ⇐⇒ m = m ∧ (5.22) (∃ automorphism s on ξm : ∀x ∈ Ek : q (x) = s(q(x)) ) holds. “=⇒”: If = , then it follows from the definition of the relations = q −1 (ξm ) or = q −1 (ξm ) that the mapping equivalences κα := {(x, y) ∈ Ek2 | α(x) = α(y)} for α ∈ {q, q } are identical. Then, κq = κq implies the right side of the equivalence (5.22). “⇐=” follows from (a0 , a1 , ..., ah−1 ) ∈ ⇐⇒ ⇐⇒ ⇐⇒ ⇐⇒
(q(a0 ), q(a1 ), ..., q(ah−1 )) ∈ ξm (s(q(a0 )), s(q(a1 )), ..., s(q(ah−1 ))) ∈ ξm (q (a0 ), q(a1 ), ..., q (ah−1 )) ∈ ξm (a0 , a1 , ..., ah−1 ) ∈ .
Denote b1 (k, h) the number of the mappings from Ek onto Ehm and denote b2 (h, m) the number of the automorphisms on ξm . Because of (5.22), we have |Bhk | =
b1 (k, h) . b2 (h, m)
(5.23)
With the aid of the principle of the inclusion and exclusion, one can calculate the number b1 (k, h) as follows: m
h
hm b1 (k, h) = (−1) · t t=0 t
· (hm − t)k .
(5.24)
For the purpose of determining b2 (h, m) the following considerations follows directly from the definition of the automorphisms of ξm that these are some functions of P olk ξm . Then, we have (because of the bijectivity of the automorphisms and by Theorem 5.2.6.1) that each automorphism s of ξm has a representation of the form s(x) =
m−1
si (x( tx ) ) · hi ,
(5.25)
i=0
where s0 , s1 , ..., sm−1 are some permutations on Eh and {t0 , t1 , ..., tm−1 } = Em holds. Therefore, (5.26) b2 (h, m) = m! · (h!)m . Then, (5.23)–(5.26) imply our assertion. We notice that there are also asymptotic estimates for the number of all maximal classes of Pk . One can take further information on that from the book [P¨ os- K 79] (p. 111) or the original papers [Kuz 59] and [Zac K J 64].
188
5 The Maximal Classes of Pk
5.5 Remarks to the Maximal Classes of Pk(l) For A ⊆ Pk , l ∈ N, l ≤ k, ∈ Rk put A(l) := {f ∈ A | |Im(f )| ≤ l}, P ol := (P olk )(l), λk := {(a, a, b, b), (a, b, a, b), (a, b, b, a) | a, b ∈ Ek }. Let Mk (l) be the set of all partial orders on Ek with the property that every l-element subset of Ek has a least and a greatest element with respect to . Notice that Mk (k) = Mk . We say that the h-ary relation on Ek is an l-central relation if = Ekh is totally reflexive, totally symmetric, and for every l-element subset E of Ek there exists an element cE ∈ E with (a1 , ..., ah−1 , cE ) ∈ for all a1 , ..., ah−1 ∈ E. The element cE is called a central element of ∩ E h . Let Chk (l) be the set of all h-ary l-central relations on Ek and let Ck (l) := l−1 h h=1 Ck (l). Notice that Ck (k) = Ck . Since any unary relation is totally reflexive and totally symmetric, we have C1k (l) = { ⊂ Ek | k − l + 1 ≤ || < k}. For the next definition, we need some notations of Section 5.2.6 and χ() := {α1 , ..., ah } ⊆ Ek | (a1 , ..., ah ) ∈ }. Notice that a totally reflexive and totally symmetric h-ary relation is completely determined by the set χ(). Bhk (l) denotes the set of all h-ary non-diagonal relations with the following three properties: (1) ∀E ⊆ Ek : |E| = l =⇒ ∩ E h ∈ Bhk ∪ {E h }, (2) ∀E ⊆ Ek : |E| = l =⇒ (∃idE ∈ (P ol)1 : ∀x ∈ E : idE (x) = x); (3) ∀A, B ∈ χ() : (A = B =⇒ ∃gA,B ∈ (P ol)1 : gA,B (A) = B). Example: Let be k = 5, l = 4 and h = 3. Then, the totally reflexive and totally symmetric h-ary relation with χ() := {A1 , A2 , A3 }, A1 := {0, 1, 2}, A2 := {1, 2, 3}, A3 := {1, 2, 4} is an element of Bhk (l), since ∩ {0, 2, 3, 4}4 = {0, 2, 3, 4}4 , ∩ {0, 1, 3, 4}4 = {0, 1, 3, 4}4 and ∩ {1, 2, 3, 4}4 , ∩ {0, 1, 2, 4}4 and ∩ {0, 1, 2, 3}4 are homomorphic inverse images of the relation ι33 and the functions idt := idE5 \{t} (t ∈ E5 ) and gpq := gAp ,Aq (p = q, p, q ∈ {1, 2, 3}) satisfy the conditions (2) and (3) (see the below indicated tables).
5.5 Remarks to the Maximal Classes of Pk (l)
x 0 1 2 3 4 x 0 1 2 3 4 Put
id0 id1 id2 id3 id4 3 0 0 0 0 1 0 1 1 1 2 2 0 2 2 3 3 3 4 3 4 4 4 4 3
g12 g13 g21 g23 g31 g32 1 1 2 4 2 3 2 2 0 1 0 1 3 4 1 2 1 2 1 1 2 4 2 3 1 1 2 4 2 3 l−1
Bk (l) :=
189
h=3
∅
Bhk (l) if
l > 3,
otherwise.
Let Hk (l) be the set of all l-ary totally reflexive and totally symmetric relations = Ekh that satisfy the above condition (3). Examples for such relations are, as follows: 1) ιlk ; 2) E := Ekl \ {(as(0) , as(1) , ..., as(l−1) ) | s permutation on El }, where E := {a0 , ..., ah−1 } and |E| = l; 3) every relation of Blk (see [Lau 88d]). For l = 2 we define Hk (2) := {Ek2 \ {(a, b), (b, a)} | (a, b) ∈ Ek2 \ ι2k }. Theorem 5.5.1 ([Lau 92a]; without proof ) Let A ⊆ Pk (l), 2 ≤ l < k and Rk (l) := Mk (l) ∪ Uk ∪ Ck (l) ∪ Bk (l) ∪ Hk (l). Then (a) [A] = Pk (l) ⇐⇒ ((∀ ∈ Rk (l) : A ⊆ P ol) ∧ (l = 2 =⇒ A ⊆ P olλk )). (b) P ol is Pk (l)-maximal for every ∈ Rk (l) and (P olλk )(2) is Pk (2)maximal. (c) The maximal classes of Pk (2) are sets of the form (P ol )(2) with ∈ C1k (2) ∪ Mk (2) ∪ Uk ∪ Hk (2) ∪ {λk }; i.e., every maximal class of P olk (l), which is not equal (P olk λ)(2), is a intersection of Pk (2) with a certain maximal class of Pk .
190
5 The Maximal Classes of Pk
We remark that for l ≥ 3 not every Pk (l)-maximal class is an intersection of Pk (l) with a certain maximal class of Pk . An example for this fact is the relation {(a, b, c) ∈ E53 | {a, b, c} ∈ {{0, 3, 4}, {1, 2, 3}}} ∈ C35 (4). Notice that the Pk (l)-maximality of the class P ol for ∈ Mk (l) was proven by V. Kolpakov in [Kol 74].
6 Rosenberg’s Completeness Criterion for Pk
Since Pk is finitely generated, every proper subclass of Pk belongs to a certain maximal class of Pk ; therefore, by Theorem 1.5.3.1, it follows that a subset T of Pk is complete (i.e., it holds [T ] = Pk ) if and only if T is not a subset of a maximal subclass of Pk . The aim of this chapter is to prove that the classes of Chapter 5 are all maximal classes of Pk :
Theorem 6.1 (Rosenberg’s Completeness Criterion for Pk ; [Ros 65], [Ros 70;a]) For an arbitrary subset T of Pk it holds: [T ] = Pk ⇐⇒ ∀ ∈ Mk ∪ Uk ∪ Sk ∪ Lk ∪ Ck ∪ Bk : T ⊆ P ol.
(6.1)
6.1 Proof of Completeness Criterion By Section 4.9, the equivalence (6.1) follows from (6.2), which we still must prove: A is maximal in Pk =⇒ (6.2) ∃γ ∈ Mk ∪ Uk ∪ Sk ∪ Lk ∪ Ck ∪ Bk : A ⊆ P olγ. Denote A an arbitrary maximal class of Pk in the following. To simplify the proof of (6.2), some assumptions over A are given. These assumptions result from the following considerations: • We show in Chapter 4 that there is exactly a Pk -maximal class that contains Pk1 . In addition, were shown that every other Pk -maximal class has k the form P ol, where ∈ h=1 Rkh .
192
6 Rosenberg’s Completeness Criterion for Pk
• For every -derivable relation ’, which is not diagonal, we have by Theorem 2.6.3 that P ol ⊆ P ol ⊂ Pk . Obviously, if P ol is Pk -maximal then for an arbitrary -derivable non-diagonal relation ’ it holds: P ol = P ol . • Every unary non-diagonal relation ∈ Rk (i.e., ∅ ⊂ ⊂ Ek ) describes a maximal class of Pk (see Theorem 5.3.2). Thus, w.l.o.g. we can assume that our maximal class A of Pk can be described by a certain h-ary relation : A = P ol (1 ≤ h ≤ k). Further, we assume w.l.o.g. that fulfills the three conditions (I) P ol is Pk -maximal and (P ol)1 = Pk1 ;
k (II) For every -derivable h -ary relation ∈ h=1 Rkh it holds: (a) ∈ InvPk =⇒ h ≥ h (i.e., is a relation with minimal arity which describes the maximal class P ol); (b) (h = h = 2 ∧ = ∩ (τ )) =⇒ ∈ Dk2 ∪ {} (i.e., by ∩ (τ ) no other relation which describes P ol either is derivable. With other words: If possible, we choose a symmetrical relation for the description of P ol; (c) (h = h ≥ 2 ∧ ιhk ⊆ ⊆ ∧ ( is totally symmetric ∨ (h = 2 ∧ is antisymmetric) )) =⇒ ∈ {, Ekh } (i.e., if is totally reflexive and totally symmetric or reflexive and antisymmetric, then for the description of the class P ol we choose a binary relation which has the greatest cardinality.); (III) is not a unary relation, i.e., h ≥ 2. Now, we want to prove: If fulfills the obove conditions (I)–(III), then or a -derivable relation belongs to Mk ∪ Uk ∪ Sk ∪ Lk ∪ Ck ∪ Bk . (6.3) (6.3) implies (6.2) and our Theorem 6.1 follows from (6.2), which was already mentioned. For k = 2 it is easy to check that only the relations 0 1 0 0 1 and 1 0 0 1 1 satisfy (I)–(III); hence (6.1) is clearly for k = 2. Therefore, let k≥3 be in the following. In the proof of (6.1) for k ≥ 3 we use the notations for relations and relation
6.1 Proof of Completeness Criterion
193
operations from Sections 2.1–2.5. In particular, ◦ denotes the relation product and let i := ◦ ◦ ...o .1 i times An h-tuple a from Ekh with h ≤ k we often give in the form (a0 , a1 , ..., ah−1 ), i.e., we also choose the indices from Ek . Remember that a relation ’ is called -derivable iff can be obtained by a finite number of applications of the relation operations (see 2.3) from and the diagonal relations. The following lemma is easy to check (see also Theorem 2.11.2): Lemma 6.1.1 ([Ros 70;a], 4.1.2) Each relation of the form C := {(a0 , ..., at−1 ) | ∃at , ..., am·h−1 ∈ Ek : (∀i : (aci1 , ..., acih ) ∈ )}, where C := (cij )m,h is a matrix of type (m, h) with elements from Em·h , is a -derivable relation. We remark that every one of the following claims on -derivability of a certain relation almost follows from the above lemma. For the proof of (6.1), we distinguish two cases:
Case 1: h = 2. Figure 6.1 gives a survey on the possible subcases and on the following lemmas. For 2 ≤ i ≤ k, the relation σi () := {(a1 , ..., ai ) | ∃u ∈ Ek : {(a1 , u), ..., (ai , u)} ⊆ } is a -derivable relation and it holds: Lemma 6.1.2 σ2 () = Ek2 =⇒ (∀i ∈ {2, 3, ..., k} : σi () = Eki ). Proof. We prove the statement by induction on i ≥ 2. For i = 2 the statement holds by assumption. Assume, σt−1 = Ekt−1 is valid for certain t−1 ∈ {2, ..., k− 1}. Then, by definition of σt (), we have ιtk ⊆ σt (). If ιtk ⊆ σt () ⊂ Ekt , then σt () is no invariant of Pk and hence (by (I)) P ol = P olσt () holds. This is, however, a contradiction of the fact that Pk (2) ⊆ P olσt (), whereby P olσt () does not have any description by a binary relation. Therefore, σt () = Ekt . Lemma 6.1.3 Either is reflexive (i.e., ι2k ⊆ ) or there exists a -derivable relation ’ which belongs to Sk . 1
For content-related reasons, it is not possible to confuse the index i with the arity of .
194
6 Rosenberg’s Completeness Criterion for Pk
is reflexive
is not reflexive
6.1.4 is symmetric 6.1.5
6.1.3
is antisymmetric 6.1.6 6.1.7
∈ Uk ∪ C2k
∈ Mk
∈ Sk
Fig. 6.1. A survey about the proof in Case 1
Proof. The relation 1 := ∩ ι2k is -derivable. If we have ∅ ⊂ 1 ⊂ ι2k , then pr1 is a non-diagonal -derivable unary relation, in contradiction to (IIa). Thus, is reflexive or areflexive. Now, let be areflexive. Since pr0 = pr1 = Ek holds by (II), we have ι2k ⊆ ◦ ζ =: . Because of this, (I) and the fact that P ol does not contain any constants, it follows that ∈ {ι2k , Ek2 }. If = Ek2 , then by ◦ ζ = σ2 () and by Lemma 6.1.2, we get a contradiction to the areflexivity of . Therefore, = ι2k holds, i.e., is a fixed-point free permutation on Ek . If has not k/t cycles of the same length, then there is an i with ∅ ⊂ i ∩ ι2k ⊂ Ek2 and we have pr(i ∩ ι2k ) ∈ C1k , in contradiction to (IIa). Thus, the permutation has cycles of the same length t. The length t is a prime number, since for t = p · q (p prime, q ≥ 2), the -derivable relation := q has only cycles of prime length p. Therefore ’ belongs to Sk . Lemma 6.1.4 Let be reflexive. Then is either symmetric (i.e., ∩ζ = ) or antisymmetric (i.e., ∩ ζ = ι2k ). Proof. Since ι2k ⊆ , ι2k ⊆ ∩ ζ ⊆ holds, and by (IIb) we have ∩ ζ = ι2k or ∩ ζ = . Lemma 6.1.5 Let be reflexive and symmetric. Then ∈ Uk ∪ C2k . Proof. It is easy to check that ι2k ⊂ ⊆ ◦ . Then by (IIc) the following three cases are possible: Case 1: ◦ = . Obviously, in this case, is transitive and ∈ Uk .
6.1 Proof of Completeness Criterion
195
Case 2: ◦ = Ek2 . Since ◦ = σ2 (), σk () = Ekk follows from Lemma 6.1.2. Hence, for Ek there is a u ∈ Ek with {(e, u) | e ∈ Ek } ⊆ . Thus the relation belongs to C2k . Lemma 6.1.6 Let be reflexive and antisymmetric. Then, for Ek , there exists (with respect to ) a greatest element e ∈ Ek and (with respect to ) a least element o ∈ Ek , i.e., it holds: {(x, e ), (o , x) | x ∈ Ek } ⊆ , and these elements are uniquely determined. Proof. Since is reflexive, we have ι2k ⊆ ⊆ σ2 (). It is obvious that the relation σ2 () is symmetric and thus ⊂ σ2 (). This and (IIc) imply σ2 () = Ek2 . Then, because of k ≥ 3 and with the aid of Lemma 6.1.2, we have σk () = Ekk . Hence we find an e ∈ Ek with {(x, e ) | x ∈ Ek } ⊆ . Then e is a greatest element of Ek . The uniqueness of e is to see as follows: Assume there are two greatest elements a, a ∈ Ek . Then we have (a, a ) ∈ and (a , a) ∈ and thus a = a by the antisymmetry of . The existence of a unique least element can be shown analogously starting with the -derivable relation σi (ζ) instead of σi (). Lemma 6.1.7 Let be a reflexive and antisymmetric relation with the property that Ek has a (unique) least and a (unique) greatest element with respect to . Then is transitive, i.e., ∈ Mk . Proof. We consider the -derivable relation 2 . Since ⊆ 2 , by (IIc) only the cases 2 = (i.e., is transitive) or 2 = Ek2 are possible. Let’s assume ◦ = Ek2 and let o be least element of Ek with respect to . Then we have (a, o ) ∈ for a ∈ Ek \{o }, (a, o ) ∈ ◦ and there is a b ∈ Ek with (a, b) ∈ and (b, o ) ∈ . However, this cannot hold by the antisymmetry of and by the choose of o . Thus the case 2 = Ek2 cannot occur and 2 = holds. Summing up, we have in Case 1: ∈ Uk ∪ Mk ∪ C2k ∪ Sk .
Case 2: h ≥ 3. Figure 6.2 gives a survey about the proof in this case.
196
6 Rosenberg’s Completeness Criterion for Pk
h=3
h≥4
6.1.8
is not totally reflexive
satisfies (*)
is totally reflexive
6.1.9
6.1.10
6.1.11 ... 6.1.15
a relation λ ∈ Lk is -derivable and k = pm , p prime
is totally symmetric
6.1.16
∈ Ck
is strongly homogeneous 6.1.17 ... 6.1.22 ∈ Bk
Fig. 6.2. A survey about the proof in Case 2
First, we give some conclusions of the assumptions (I)–(III) over .
(IV )
∀r ≤ h − 1 ∀i1 , ..., ir ∈ Eh : pri1 ,...,ir = Ekr .
Since, if ∩ ιhk = ∅, pr1,2 is not an invariant of Pk , we have by (IIa) (V )
∩ ιhk = ∅.
Obviously, it follows from (IIa):
6.1 Proof of Completeness Criterion
(V I)
197
∀δ ∈ Dkh \{Ekh } : ∩ δ ∈ Dkh .
If \ιhk = ∅, then, by (V I), the relation is an primitive relation (i.e., a union of certain diagonal relations), which is preserved by all unary functions of Pk . Hence it follows from (I): (V II) \ιhk = ∅. Lemma 6.1.8 If 4 ≤ h ≤ k, then either is totally reflexive or satisfies the following condition: (*): h = 4 ∧ | | = k 3 ∧ 4 4 4 ∪ δ{0,2},{1,3} ∪ δ{0,3},{1,2} ⊆ . δ{0,1},{2,3} Proof. First, note that for every (a, b), (b, c), (c, d) ∈ Eh2 \ι2h with |{a, b, c, d}| = 4, the implications
and
(h ≥ 4 ∧ (x0 , ..., xh−1 ) ∈ ∧ xa = xb ) =⇒ xb = xc
(6.4)
(h ≥ 5 ∧ (x0 , ..., xh−1 ) ∈ ∧ xa = xb ) =⇒ xc = xd
(6.5)
do not hold by (IV ). Next we will prove (∃(a, b) ∈ Eh2 \ι2h : δ{a,b} ⊆ ) =⇒ (∀(c, d) ∈ Eh2 \ι2h : δ{c,d} ⊆ ).
(6.6)
For this, it is sufficient to show that δ{0,1} ⊆ =⇒ δ{1,2} ⊆
(6.7)
holds. Let δ{0,1} ⊆ . Then we have δ{0,1,2} ⊆ ∩ δ{1,2} . Furthermore, by (V I) ∩ δ{1,2} is diagonal. Thus ∩ δ{1,2} ∈ {δ{0,1,2} , δ{1,2} }. Since an implication of form (6.4) follows from ∩ δ{1,2} = δ{0,1,2} , δ{1,2} ⊆ holds and therefore (6.7) and (6.6). For the proof of the total reflexivity of , we consider the relation 1 := ∩ δ{0,1} , which by (V ) and (V I) is a nonempty diagonal relation. Since the implications (6.4) and (6.5) are not true for , we have if h ≥ 5, = δ{0,1} 1 ∈ {δ{0,1},{2,3} , δ{0,1} } if h = 4.
198
6 Rosenberg’s Completeness Criterion for Pk
By (6.6) we have only to examine the case h = 4 and δ{0,1},{2,3} ∪ δ{0,2},{1,3} ∪ {0,3},{1,2} ⊆ . Obviously, either satisfies the condition (*) and our proof is closed or it holds || > k 3 . Let || > k 3 . Therefore w.l.o.g. there exists certain ai ∈ Ek (i = 0, 1, 2, 3) with (a0 , a1 , a2 , a3 ) ∈ , (a0 , a1 , a2 , a3 ) ∈ , a3 = a3 .
(6.8)
Then the -derivable relation 2 := {(a1 , a2 , a3 , a3 ) | ∃a0 : (a0 , a1 , a2 , a3 ) ∈ ∧ (a0 , a1 , a2 , a3 ) ∈ } has the properties (since pr1,2,3 =
2 ∩ δ{2,3} = δ{2,3}
(6.9)
Ek3 ), δ{2,3} ⊂ 2 (by (6.8)) and 2 ⊂ Ek4 .
Thus 2 is not an invariant of Pk . Further, is totally reflexive by (6.9) and (6.6). Then, by definition of 2 , we have now ∩ δ{0,1} = δ{0,1},{2,3} , a contradiction to our assumptions on . Lemma 6.1.9 If is totally reflexive, then is totally symmetric. Proof. The total symmetry of follows from (IIb) via ιhk ⊆ s∈Sh s ⊆ , where Sh denotes the set of all permutations on Eh and s denotes the relation {(as(0) , ..., as(h−1) ) | (a0 , ..., ah−1 ) ∈ }. Consequently, for the proof of (6.1), it is sufficient to examine the following cases: 2.1. satisfies (*) or it holds: h = 3 and is not totally reflexive and 2.2. h ≥ 3 and is totally symmetric and totally reflexive.
Case 2.1: satisfies (*) or h = 3 and ∩ ιhk = ιhk . W.l.o.g. we can assume that there does not exist a -derivable relation which is non-diagonal and totally reflexive.
6.1 Proof of Completeness Criterion
199
Lemma 6.1.10 The ternary relation is either of the form (a) = σ ∪ δ{0,1,2} with the properties ∅ ⊂ σ ⊆ Ek3 \ι3k and for any a, b ∈ Ek there are exactly a c1 , exactly a c2 and exactly a c3 with (c1 , a, b), (a, c2 , b), (a, b, c3 ) ∈ ; or of the form (b) = σ ∪ δ{a,b} ∪ δ{a,c} with ∩ s = δ{a,b} , where ∅ ⊂ σ ⊆ Ek3 \ι3k , {a, b, c} = {0, 1, 2}, s(a) := b, s(b) := a, s(c) := c and s := {(as(0) , as(1) , as(2) ) | (a0 , a1 , a2 ) ∈ }. Proof. By (V I) and (V II) it is sufficient to examine w.l.o.g. the following cases: = σ ∪ δ{0,1,2} (6.10) = σ ∪ δ{0,1}
(6.11)
= σ ∪ δ{0,1} ∪ {0,2}
(6.12)
Ek3 \ι3k .
where ∅ ⊂ σ ⊆ First let be of the form (6.11). A -derivable relation in this case is the totally symmetric relation i := {(a1 , ..., ai ) | ∃a, b : (∀i : (ai , a, b) ∈ )} (i = 2, 3, ..., k). Obviously, this relation has the property ∀i ∈ {2, ..., k − 1} : i = Eki =⇒ i+1 totally reflexive.
(6.13)
By our assumption in Case 2.1 and by (I) it follows from the total symmetry and total reflexivity of i+1 that i+1 = Eki+1 . However, this cannot occur, since for i = k − 1 it holds (0, 1, ..., k − 1) ∈ k =⇒ ∃a, b ∈ Ek : {(0, a, b), ..., (b, a, b), ..., (k − 1, a, b)} ⊆ } and ∩ ι3k = δ{0,1} is not possible. Thus our relation is not of the form (6.11), since we can show that 2 = Ek2 : δ{0,1} ⊆ implies ι2k ⊆ 2 . By pr0,1 = Ek2 there are certain a, b (a = b) and c with (a, b, c) ∈ . Furthermore we have (b, b, c) ∈ . Thus (a, b) ∈ 2 and 2 = Ek2 by (IIa). If = σ ∪ δ{0,1,2} and assumed does not fulfill the condition of (a) (w.l.o.g. for c3 ), then the -derivable relation := {(b, c, c ) | ∃a : (a, b, c) ∈ ∧ (a, b, c ) ∈ } is a non-diagonal relation of the form (6.11), of which we have shown that it cannot describe a maximal class of Pk . If has the form (6.12), it must hold ∩ (τ ) = δ{0,1} , since, in the opposite case, the -derivable relation ∩ (τ ) has the form (6.11). Thus by Lemma 6.1.10, we can assume w.l.o.g. that is either of the form (6.10) or (6.12) and fulfills the conditions of Lemma 6.1.10.
200
6 Rosenberg’s Completeness Criterion for Pk
Lemma 6.1.11 It is possible to derive from a quaternary non-diagonal relation λ with the following 8 properties: 1) λ ∩ δ{0,2} = δ{0,2},{1,3} = λ ∩ δ{1,3} 2) λ ∩ δ{0,3} = δ{0,3},{1,2} = λ ∩ δ{1,2} 3) ∩ ι3k = δ{0,1} ∪ δ{0,2} ⇒ δ{0,1},{2,3} ⊆ λ 4) λ ∩ (τ λ) = λ, where τ λ := {(b, a, c, d) | (a, b, c, d) ∈ λ} 5) λ ∩ (λ)s = λ, where (λ)s := {(d, c, b, a) | (a, b, c, d) ∈ λ} 6) ∀x, y, z, z , o ∈ Ek : (x, y, z, o) ∈ ∧ (x, y, z , o) ∈ =⇒ z = z 7) pr0,1,3 λ = Ek3 8) pr0,2,3 λ = Ek3 . Proof. If the condition (*) fulfills, it is easy to check that the -derivable relation λ := ∩ τ () ∩ {(d, c, b, a) | (a, b, c, d) ∈ } has the properties 1)–8), since it is possible in the opposite case to derive a non-diagonal totally reflexive, ternary relation from λ, in contradiction to the assumptions in Case 2.1. Let now h = 3 and let be a relation of the form (6.10) or (6.12) in the following. A -derivable relation is λ11 if has the form (6.10), λ1 := λ12 if has the form (6.12), where λ11 := {(a, b, c, d) | ∃u, v : {(u, d, a), (d, v, b), (u, v, c)} ⊆ } and λ12 := {(a, b, c, d) | ∃u1 , ..., u4 , v1 , ..., v4 : {(u1 , a, c), (u2 , b, d), (u3 , a, d), (u4 , b, c), (v1 , a, c), (v2 , b, d), (v3 , a, d), (v4 , b, c), (b, d, u1 ), (a, c, u2 ), (b, c, u3 ), (a, d, u4 ), (d, b, v1 ), (c, a, v2 ), (c, b, v3 ), (d, a, v4 )} ⊆ }. With the help of the properties of , which are given in Lemma 6.10, it is easy to see that λ1 fulfills the conditions 1)–3). Since δ{0,2},{1,3} ∪ δ{0,3},{1,2} ⊆ λ11 ∩ (τ λ11 ) ∩ (λ11 )s and
δ{0,2},{1,3} ∪ δ{0,3},{1,2} ∪ δ{0,1},{2,3} ⊆ λ12 ∩ (τ λ12 ), ∩(λ12 )s
6.1 Proof of Completeness Criterion
201
the non-diagonal relation λ := λ1 ∩ (τ λ1 ) ∩ (λ1 )s has the properties 1)–5). Furthermore, for any i, j ∈ E4 , i = j, it holds pri λ = Ek and pri,j λ = Ek2 .
(6.14)
If λ does not fulfill 6), we can derive the non-diagonal relation λ := {(c, c , a) | ∃b, d : (a, b, c, d) ∈ λ ∧ (a, b, c , d) ∈ λ} from λ. However λ is of the form σ ∪ δ{0,1} with ∅ ⊂ σ ⊆ Ek3 \ι3k (by 1) and 2)), what is not possible by the proof of Lemma 6.1.10. Thus λ fulfills 1)–6). If = σ∪δ{0,1,2} , the properties 7) and 8) follow from (6.14), from the property (a) of Lemma 6.1.10 and from the definition of λ1 . If has the form σ ∪ δ{0,1} ∪ δ{0,2} , then we have ι3k ⊆ pr0,α,3 λ (α ∈ {1, 2}) by 1)–3) and hence pr0,α,3 λ = Ek3 , since the case pr0,α,3 λ ⊂ Ek3 is a contradiction to our assumptions over . By Lemma 6.1.11( 6), 7)) with the aid of λ, we can define for a fixed o ∈ Ek an operation +o on Ek as follows: x +o y = z :⇐⇒ (x, y, z, o) ∈ λ.
(6.15)
Lemma 6.1.12 The operation +o has the following properties: 1) (Ek ; +o ) is an Abelean group with the identity element o. 2) There exists a prime number p so that every element of Ek \ {o} has the order p and it holds k = pm for certain m ≥ 1. Proof. 1): All properties of +o (except the associativity), which we have to show, follow directly from Lemma 6.1.11. By 1) of Lemma 6.1.11 o is the identity element of (Ek , +o ). Because of 4)–8) for every a ∈ Ek there exists an inverse element a ∈ Ek with a +o a = o. The operation +o is kommutative by 4). For proof of the associativity of +o , we consider the λ-derivable relation λ := {(a, b, c) | (a +o b) +o c = a +o (b +o c)} = {(a, b, c) | ∃u, v, w : {(a, b, u, o), (u, c, v, o), (b, c, w, o), (a, w, v, o)} ⊆ λ}, which is totally reflexive by {(o, a, a), (a, o, a), (a, a, o) | a ∈ Ek } ⊆ λ and (II). However, this is only possible if λ = Ek3 by our assumptions over . Thus +o is associative. 2): A λ-derivable relation is µn := {(x, o) | x +o x +o ... +o x = o} n times = {(x, o)|∃ui : {(x, x, u1 , o), (u1 , x, u2 , o), ..., (un−2 , x, o, o)} ⊆ λ}.
202
6 Rosenberg’s Completeness Criterion for Pk
By o +o o = o for all o ∈ Ek this relation is reflexive. Assume there exists two elements of Ek \{o} with the orders n and m (= n) respectively. Then we have ι2k ⊂ µn ⊂ Ek2 , in contradiction to our assumptions over . Thus all elements (= o) of (Ek , +o ) have the same order. Now it is easy to show that this order is a certain prime number p: If n > 1 is not a prime number, there exist r, s ∈ N with n = r · s, 1 < r < n and 1 < s < n. For a b ∈ Ek \ {0} we set c := s · b := b +o b +o ... +o b = o. Then we have c = o and r · c = n · b = o, s times a contradiction to the above-proven fact that the order of b is n. k = pm for a certain m is a conclusion from well-known theorems about Abelian groups. Lemma 6.1.13 For every x, y, o, o1 ∈ Ek it holds: 1) x +o1 x = x +o x −o o1 2) x +o1 o = x −o o1 3) k ≥ 4 =⇒ x +o1 y = x +o y −o o1 . Proof. To prove i) (i ∈ {1, 2, 3}) we consider certain λ-derivable relations λi : λ1 := {(x, o1 , o) | x +o1 x = x +o x −o o1 } = {(x, o1 , o) | ∃u, v, w : {(x, x, u, o1 ), (x, x, v, o), (o1 , w, o, o), (v, w, u, o)} ⊆ λ}, λ2 := {(x, o, o1 ) | x +o1 o = x −o o1 } and
= {(x, o, o1 ) | ∃u, v : {(x, o, u, o1 ), (o1 , v, o, o), (x, v, u, o)} ⊆ λ}
λ3 := {(x, y, o, o1 ) | x +o1 y = x +o y −o o1 } = {(x, y, o, o1 ) | ∃u, v, w : {(x, y, u, o1 ), (o1 , v, o, o), (x, y, w, o), (w, v, u, o)} ⊆ λ}. If we can show that λ1 , λ2 and λ3 are totally reflexive relations, then we have λ1 = λ2 = Ek3 and λ3 = Ek4 for k ≥ 4 by our assumptions in Case 2.1 and the statements of Lemma 6.1.13 are proven. For all x, o ∈ Ek we have: – (x, x, o) ∈ λ1 , since x +x x = x = x +o x −o x. – (x, o1 , x) ∈ λ1 , because for v = x, w = u and Lemma 6.1.11, 5) the conditions of definition of λ1 hold. – (x, o, o) ∈ λ1 , since x +o x = x +o x −o o. Thus 1) is proven. For all x, o, o1 ∈ Ek it holds: – (o, o, o1 ) ∈ λ2 , because o +o1 o = o +o o −o o1 = o −o o1 by 1). – (o1 , o, o1 ) ∈ λ2 , since o1 +o1 o = o = o1 −o o1 . – (x, o, o) ∈ λ2 by x +o o = x = x −o o.
6.1 Proof of Completeness Criterion
203
Thus b) is proven). 3) follows from – (x, x, o, o1 ) ∈ λ3 by 1); – (o, y, o, o1 ) ∈ λ3 , since o +o1 y = y +o1 o = y −o o1 = o +o y −o o1 by 2); – (o1 , y, o, o1 ) ∈ λ3 by o1 +o1 y = y = o1 +o y −o o1 ; – (x, o, o, o1 ) ∈ λ3 , since (by 2)) x +o1 o = x −o o1 = x +o o −o o1 ; – (x, o1 , o, o1 ) ∈ λ3 since x +o1 o1 = x = x +o o1 −o o1 ; – (x, y, o, o) ∈ λ3 , since x +o y = x +o y −o o. Lemma 6.1.14 For every o ∈ Ek and all a, b, c, d ∈ Ek the following equivalence holds: (a, b, c, d) ∈ λ ⇐⇒ a +o b = c +o d. Proof. If k ≥ 4 then we have by definition of +o and by Lemmas 6.1.12 and 6.1.13: (a, b, c, d) ∈ λ ⇐⇒ a +d b = c ⇐⇒ a +d b = a +o b −o d = c ⇐⇒ a +o b = c +o d. For k = 3 our statement follows from Lemma 6.1.11, 1), 2), 5) and Lemma 6.1.13, 1). Then the following lemma is a conclusion from the Lemmas 6.1.11, 6.1.12, and 6.1.14: Lemma 6.1.15 The -derivable relation λ belongs to Lk . Proof. If k ≥ 4, then λ ∈ Lk (k = pm , p prime, m ≥ 1) follows from the Lemmas 6.1.9, 6.1.10 and 6.1.12. For k = p = 3 the relation λ := {(a, b, c, d) | ∃α : a +o b = α +o α ∧ c +o d = α +o α} is -derivable and belongs to Lk . Summing up: Our Case 2.1 is only possible if k is a prime power. Furthermore, we have for k = pm : P ol = P olλ for certain λ ∈ Lk .
Case 2.2: is totally reflexive and totally symmetric. Since Pk (h − 1) ⊆ P ol for every totally reflexive h -ary relation (h ≥ 2), it is not possible to find a totally reflexive h -ary relation with P ol = P ol and h > h. Thus we can assume the following property for : (V III)
∀ ∈ [{} ∪ InvPk ]h : h < h ≤ k ∧ ιhk ⊆ =⇒ = Ekh .
204
6 Rosenberg’s Completeness Criterion for Pk
An h-ary, totally reflexive, and totally symmetric relation γ we will call strongly homogeneous, if the following holds: (∃v0 , ..., vh−1 ∈ Ek : (v0 , ..., vh−1 ) ∈ γ ∧ ∀i ∈ Eh ∀j ∈ Eh \{i} : (a0 , ..., aj−1 , vi , aj+1 , ..., ah−1 ) ∈ γ) =⇒ (a0 , a1 , ..., ah−1 ) ∈ γ.
(6.16)
Lemma 6.1.16 Either is central or strongly homogeneous. Proof. First we consider the -derivable relation t := {(a0 , ..., at−1 ) | ∃c : (∀i0 , ..., ih−2 ∈ Et : (ai0 , ..., aih−2 , c) ∈ ))}, for t ∈ {h, h + 1, ..., k}. The total symmetry of implies that t is totally symmetric. By choosing c = a0 for t = h, we see that ⊆ h . Thus by our assumption (IIc), only the following two cases are possible: Case 1: h = Ekh . Then we have h < k since, in the opposite case, = Ekk holds by definition of . Obviously, for h < k, the -derivable relation h+1 is totally reflexive and thus, by (V III), h+1 = Ekh+1 . By induction, it is easy to see that i = Eki for all i ∈ {h + 1, ..., k}. Then, ∈ Ck follows from k = Ekk . Case 2: = h . In this case, is homogeneous, i.e., has the property (∃v : ∀i ∈ Eh : (a0 , ..., ai−1 , v, ai+1 , ..., ah−1 ) ∈ ) =⇒ (a0 , a1 , ..., ah−1 ) ∈ . for arbitrary a0 , a1 , ..., ah−1 ∈ Ek . We consider the -derivable relation γt := {(a0 , ..., at−1 ) | ∃v0 , v1 , ..., vt−1 : (∀i1 , ..., ih ∈ Et : (vi1 , ..., vih ) ∈ ) ∧ (∀n ∈ Et ∀j1 , ..., jh−2 ∈ Et \{n} : (aj1 , ..., ajh−2 , an , vn ) ∈ )} (t ∈ {h, h + 1, ..., k}). Obviously, γt is totally symmetric and, if γt−1 = Ekt−1 , is totally reflexive. Furthermore, ⊆ γh for h = t. (This follows from the definition of γh by setting vα = aα for all α ∈ Eh .) = γh implies that is strongly homogeneous. Now by (IIc) we have γh ∈ {, Ekh }. Thus our lemma is proven if we can show that γh = Ekh cannot occur. Assume γh = Ekh and h < k. Then γh+1 is totally reflexive. Thus, γh+1 = Ekh+1 by (V III) and γk = Ekk via induction. Hence, for every a0 , ..., ah−1 ∈ Ek there exists certain v0 , ..., vh−1 ∈ Ek with (v0 , v1 , ..., vh−1 ) ∈
(6.17)
6.1 Proof of Completeness Criterion
205
and ∀n ∈ Eh ∀α1 , ..., αh−2 ∈ Ek \{an } : (α1 , ..., αh−2 , an , vn ) ∈ .
(6.18)
With the help of this and by induction, we can show that ∀t ≥ 0 ∀a0 , ..., at−1 ∈ Ek : (a0 , ..., at−1 , vt , vt+1 , ..., vh−1 ) ∈
(6.19)
holds: For t = 0, (6.19) follows from (6.17). Assume (6.19) holds for t = n. Then (6.19) for t = n + 1 is a conclusion from the induction hypothesis, the homogeneity of , the totally symmetry of and from (6.18) putting v = vn in (6.16) for the tuple (a0 , ..., an , vn+1 , ..., vh−1 ). By (6.19) and t = h, we get a contradiction to ⊂ Ekh : ∀a0 , ..., ah−1 ∈ Ek : (a0 , ..., ah−1 ) ∈ . Hence γh = Ekh cannot occur and thus γh = , i.e., is strongly homogeneous. By Lemma 6.1.16, we have to show for the proof of our theorem that, if is strongly homogeneous, the relation or a -derivable relation belongs to Bk . Thus we can assume that is subsequently a strongly homogeneous relation. For this relation, we will prove first that is a homomorphic inverse image of a certain relation ξ and then that the relation ξ is isomorphic to a certain elementary h-ary relation ξm .2 Lemma 6.1.17 The relation ε := {(a, b) ∈ Ek2 | ∀a0 , ..., ah−3 ∈ Ek : (a0 , a1 , ..., ah−3 , a, b) ∈ } is an equivalence relation on Ek . Proof. By the total reflexivity and total symmetry of , it follows directly the reflexivity and symmetry of ε. To prove the transitivity of ε, let {(a, b), (b, c)} ⊆ ε. Choosing v0 = α0 , v1 = α1 , ..., vh−3 = αh−3 , vh−2 = b and vh−1 = b in (6.16) for the tuple (α0 , α1 , ..., αh−3 , a, c), we get (α0 , ...., αh−3 , a, c) ∈ for arbitrary α0 , ..., αh−3 ∈ Ek . Hence, (a, c) ∈ ε. By the equivalence relation ε, the set Ek is partitioned into certain (nonempty) equivalence classes Ai (i = 1, 2, ...., r), from which we choose a representative αi . With the help of the representative set V := {α1 , ..., αr } we can define a mapping F : Ek −→ V by F (a) = αi :⇐⇒ {a, αi } ⊆ Ai . 2
See Lemma 6.1.22 to the concept “isomorphic”.
206
6 Rosenberg’s Completeness Criterion for Pk
Lemma 6.1.18 Let be strongly homogeneous. Then (a) (a0 , ...., ah−1 ) ∈ ⇐⇒ (F (a0 ), ..., F (ah−1 )) ∈ (b) ((∀a0 , ..., ah−3 ∈ V : (a0 , ..., ah−3 , a, b) ∈ ) ∧ {a, b} ⊆ V ) =⇒ a = b. Proof. (a): First, we show that the equivalence (a, a1 , ..., ah−1 ) ∈ ⇐⇒ (b, a1 , ..., ah−1 ) ∈
(6.20)
holds for (a, b) ∈ ε and for all a0 , ..., ah−1 ∈ Ek . If (a, a1 , ..., ah−1 ) ∈ then (b, a1 , ...., ah−1 ) ∈ follows from the strong homogeneity of , choosing v0 = v1 = .... = vh−1 = a. Since ε is symmetric, we have also proven “⇐=” of (6.20). Now (a) follows from (6.20) because of (ai , F (ai )) ∈ ε (i ∈ Eh ), Lemma 6.1.17 and of the total symmetry of : (a0 , ...., ah−1 ) ∈ ⇐⇒ ⇐⇒ ⇐⇒ ⇐⇒
(F (a0 ), a1 , ..., ah−1 ) ∈ (F (a0 ), F (a1 ), a2 , ..., ah−1 ) ∈ ... (F (a0 ), ..., F (ah−1 )) ∈ .
(b) is a conclusion from the definitions of ε and V and from (a). Now put ξ := F () := {(F (a0 ), ..., F (ah−1 )) | (a0 , ..., ah−1 ) ∈ }. By Lemma 6.1.18, (a) is a homomorphic inverse image of this relation, i.e., = {(a0 , ..., ah−1 ) ∈ Ekh | (F (a0 ), ..., F (ah−1 )) ∈ ξ} holds. Since = Ekh , ζ = V h . Thus w.l.o.g. we can assume V = Er and (0, 1, ..., h − 1) ∈ V h \ξ. To show that ξ is isomorphic to a certain h-ary elementary relation ξm (⊆ Ehhm ), i.e., that there is a bijective mapping ϕ of Ehm onto V with the property ξ = {(ϕ(a0 ), ..., ϕ(ah−1 )) | (a0 , ..., ah−1 ) ∈ ξm } we consider the -derivable hi -ary graphic i
Ghi (P ol) := χhi ∪ {f (κ1 , ..., κhi ) | f ∈ (P ol)h }, where χhi := (κ1 , ..., κhi ) is the hi -ary abscissa over Ek (in matrix form; see Section 2.7), i ∈ {h, h + 1, ..., k}. Let j1 , ..., ji be the numbers of those rows of χhi for which Ai := prj1 ,...,ji χhi is a matrix form of the relation Ehi . Further, let µi := prj1 ,...,ji Ghi (P ol).
6.1 Proof of Completeness Criterion
207
Lemma 6.1.19 If is strongly homogeneous and (0, 1, 2, ..., h − 1) ∈ , then µi = Eki for every i ∈ {h, h + 1, ..., k}, i.e., the functions of P ol can take every value of Ek on every row of the matrix Ai . Proof. First, we remark that = Ekh \{(a0 , ..., ah−1 ) | {a0 , ..., ah−1 } = Eh } because of ∈ Ck . Further, if (b0 , ..., bh−1 ) ∈ , all functions g with Im(g) = {b0 , ..., bh−1 } belong to P olk . Suppose the lemma is false for i = h. Then, we can form an h-ary relation with ⊂ ⊂ Ekh with the help of the hi -th graphic of P ol by projection, contradicting (IIc). Since all functions of P ol, which have at most hi essential variables, belong i+1 it is easy to show by induction that it holds: to (P ol)h ∀i ∈ {h, ..., k − 1} : µi = Eki =⇒ ιi+1 ⊆ µi+1 . k Consequently, our lemma follows from (V III). By Lemma 6.1.19, we can find an hk -ary function f ∈ P ol with the properties Im(f ) = V and
⎛
⎞ F (0) ⎜ F (1) ⎟ ⎟. f (Ak ) = ⎜ ⎝ ⎠ ... F (k − 1)
Next we will give some properties of this function f , from which will follows ∈ Bk . k Recall, f ∈ P ol means on tuples of Ehh that f preserves the relation ιhh . k The elements z of Ehh we also give in the form (z[1], z[2], ..., z[hk ]) k
and, for every z ∈ Ehh , denote z t,a (t ∈ {1, 2, ..., hk }, a ∈ Eh ) k
an element of Ehh , which is defined by a, if i = t, z t,a [i] := z[i] otherwise (i ∈ {1, 2, ..., hk }). k
Lemma 6.1.20 Let t ∈ {1, 2, ..., hk }, z ∈ Ehh and (f (z t,0 ), ..., f (z t,h−1 )) ∈ ξ. Then (a) f (z t,0 ) = ... = f (z t,h−1 ), k
(b) ∀w ∈ Ehh : f (wt,0 ) = ... = f (wt,h−1 ).
208
6 Rosenberg’s Completeness Criterion for Pk
Proof. (a): For proof, it is sufficient to show that (w.l.o.g.) f (z t,h−2 ) = f (z t,h−1 ). First, we prove k
∀b0 , ..., bh−3 ∈ Ehh : (f (b0 ), ..., f (bh−3 ), f (z t,h−2 ), f (z t,h−1 )) ∈ ξ.
(6.21)
If {b0 [t], b1 [t], ..., bh−3 [t]} = {0, 1, ..., h − 3}, then (6.21) holds, since in this case, all columns of the matrix ⎛ ⎞ b0 ⎜ b1 ⎟ ⎜ ⎟ ⎜ ... ⎟ ⎜ ⎟ B := ⎜ ⎟ h−3 ⎟ ⎜ bt,h−2 ⎝z ⎠ z t,h−1 belong to ιhh and f preserves . Let w.l.o.g. bi [t] = i for i ∈ Eh−2 . Substituting the i-th row of B by z t,j , where i = j, we obtain a matrix Bi,j whose columns belong to ιhh . Hence f (Bi,j ) ∈ ξ holds. Consequently, by the strong homogeneity of , choosing vj = f (z t,j ) (j ∈ Eh ) for the tuple (f (b0 ), ..., f (bh−3 ), f (z t,h−2 ), f (z t,h−1 )), we get (6.21). k Since {f (α) | α ∈ Ehh } = V , for all a0 , ..., ah−3 ∈ V there are certain k b0 , ..., bh−3 ∈ Ehh with f (bi ) = ai (i ∈ Eh−2 ). Thus by (6.21) we have ∀a0 , ..., ah−2 ∈ V : (a0 , ..., ah−3 , f (z t,h−2 ), f (z t,h−1 )) ∈ ξ. Then, with the help of Lemma 6.1.18, (b) it follows f (z t,h−2 ) = f (z t,h−1 ). (b): Because of (a) it is sufficient to show that (f (wt,0 ), ...., f (wt,h−1 )) ∈ ξ
(6.22)
holds. By (6.21), it follows (f (wt,0 ), ..., f (wt,h−3 ), f (z t,h−2 ), f (z t,h−1 )) ∈ ξ. It is easy to check that every exchange of an i-th row in ⎞ ⎛ wt,0 ⎜ wt,1 ⎟ ⎟ ⎜ ⎝ ... ⎠ wt,h−1 by wt,j for i ∈ Eh−3 or by z t,j for i ∈ {h − 2, h − 1} and i = j, gives a matrix M, whose columns belong to ιhh , and it holds f (M) ∈ ξ. Hence by the strong homogeneity of , choosing v0 = f (wt,0 ), ..., vh−3 = f (wt,h−3 )), vh−2 = f (z t,h−2 ) and vh−1 = f (z t,h−1 ), we get (6.22). Lemma 6.1.21 For the function f , there exists certain digits t1 , ..., tm , which k are exactly the essential digits of f|E hk (restriction of f to Ehh ), and f has h
k
different values on any two different tuples of Ehh , i.e., it holds
6.1 Proof of Completeness Criterion k
∀z, w ∈ Ehh : f (z) = f (w) ⇐⇒ ∀i ∈ {t1 , ..., tm } : z[i] = w[i].
209
(6.23)
Further, f has the properties |Im(f )| = hm and ∀r1 , ..., rhk ∈ Ehh : ({rt1 , ..., rtm } ⊆ ιhh =⇒ f (r1 , ..., rhk ) ∈ )
(6.24)
Proof. For every t ∈ {1, 2, ..., hk }, we have either f (z t,0 ) = f (z t,1 ) = ... = k f (z t,h−1 ) for every z ∈ Ehh or (f (z t,0 ), f (z t,1 ), ..., f (z t,h−1 )) ∈ for all z ∈ k Ehh by Lemma 6.1.20. Let T := {t1 , ..., tm } be the set of all t ∈ {1, 2, ..., hk }, for which (f (z t,0 ), ..., f (z t,h−1 )) ∈ holds. Now, we will show that the digits ti ∈ T have the properties of Lemma 6.1.21. First, let f (z) = f (w) for certain k z, w ∈ Ehh and assume there exists an i ∈ T with α := z[i] = w[i]. Then, the columns of the matrix ⎛ i,0 ⎞ z ⎜ ... ⎟ ⎜ i,α−1 ⎟ ⎜z ⎟ ⎜ ⎟ ⎜ A := ⎜ w ⎟ ⎟ ⎜ z i,α+1 ⎟ ⎜ ⎟ ⎝ ... ⎠ z i,h−1 belong to ιhh . Thus f (A) ∈ ξ and by f (w) = f (z) = f (z i,α ) it follows (f (z i,0 ), ..., f (z i,h−1 )) ∈ ξ, a contradiction to i ∈ T and to the definition of T . Therefore “=⇒” in (6.23) holds. Let now z[i] = w[i] for every i ∈ T and w.l.o.g. T = {1, 2, ..., m}. f (w) = f (z) is proven, if we can show that f (un−1 ) = f (un )
(6.25) k
holds for every tuple un := (z[1], ..., z[n], w[n + 1], w[n + 2], ..., w[h ]) and all n ∈ {m + 1, m + 2, ..., hk }, since f (um ) = f (w) and f (uhk ) = f (z). By n > m n,j and the definition of T , we have f (un,i n−1 ) = f (un−1 ) for every i, j ∈ Eh . As n,w[n] n,z[n] un−1 = un−1 and un−1 = un we have (6.25) and (6.23) is proven. k (6.23) and {f (x) | x ∈ Ehh } = V imply |V | = hm . Finally, we prove (6.24). Assume (6.24) is false. Then there exists certain k z0 , z1 , ..., zh−1 ∈ Ehh with (f (z0 ), f (z1 ), ..., f (zh−1 )) ∈ ξ and (w.l.o.g.) zi [1] = k i for all i ∈ Eh and 1 ∈ T . Let w ∈ Ehh . Then, all columns of the matrix ⎛ ⎞ w1,0 ⎜ ... ⎟ ⎜ 1,j−1 ⎟ ⎜w ⎟ ⎜ ⎟ 1,i ⎜ ⎟ Ci,j := ⎜ zj ⎟ ⎜ w1,j+1 ⎟ ⎜ ⎟ ⎝ ... ⎠ w1,h−1
210
6 Rosenberg’s Completeness Criterion for Pk
belong to ιhh for i = j. Thus f (Ci,j ) ∈ ξ. By choosing vi = f (zi ), for the tuple (f (w1,0 ), ..., f (w1,h−1 )) and i ∈ Eh from this and the strong homogeneity of it follows (f (w1,0 ), ..., f (w1,h−1 )) ∈ ξ. But this contradicts the definition of T and 1 ∈ T . Lemma 6.1.22 If is strongly homogeneous, then there exists for certain m, a bijective mapping ϕ from Ehm onto V with ξ = ϕ(ξm ) := {(ϕ(a0 ), ..., ϕ(ah−1 )) | (a0 , ..., ah−1 ) ∈ ξm } and it holds that = {(a0 , ..., ah−1 ) ∈ Ekh | (ϕ−1 (F (a0 )), ..., ϕ−1 (F (ah−1 ))) ∈ ξm }, i.e., ∈ Bhk . Proof. With the function f in Lemma 6.1.21, we can define a bijective mapping from Ehm onto V as follows: ϕ(a(m−1) hm−1 + a(m−2) hm−2 + ... + a(1) h + a(0) ) = f (z) :⇐⇒ (z[t1 ], z[t2 ], ..., z[tm ]) = (a(m−1) , a(m−2) , ..., a(0) )), where a ∈ Ehm . Let (a0 , ..., ah−1 ) ∈ ξm . Then there are certain z0 , ..., zh−1 ∈ k Ehh , where (z0 [i], ..., zh−1 [i]) ∈ ιhh for all i ∈ {1, 2, ..., hk }, with the property (ϕ(a0 ), ϕ(a1 ), ..., ϕ(ah−1 )) = (f (z0 ), f (z1 ), ..., f (zh−1 )). Since f ∈ P ol, this implies (ϕ(a0 ), ..., ϕ(ah−1 )) ∈ ξ. Hence ϕ(ξm ) ⊆ ξ. Assume, there exists a tuple (a0 , ..., ah−1 ) ∈ ξ\ϕ(ξm ). By definition of ϕ, we k find certain z0 , ..., zh−1 ∈ Ehh with (f (z0 ), ..., f (zh−1 )) = (a0 , ..., ah−1 ), where (z0 [i], ..., zh−1 [i]) ∈ ιhh for certain i ∈ {t1 , ..., tm }. But this is contrary to (6.24). Thus ξ = ϕ(ξm ). The other statements follow from Lemma 6.1.18, (a) and the definition of ξ. To sum up, we have in Case 2.2: ∈ Ck ∪ Bk , and Theorem 6.1 is proven.
7 Further Completeness Criteria
In the literature, one finds many articles which deal with complete sets. With the aid of complete sets, it is easy to obtain completeness criteria. In this chapter, we discuss only three types of such criteria. First we handle a criterion for Sheffer functions, which was found by G. Rousseau. Then, we show how one can reduce the conditions from Theorem 6.1 if one considers only surjective functions. Finally, we deal with criteria that indicate under which conditions a set (⊆ Pk ) which consists of certain unary functions and a Slupecki-function is complete in Pk .
7.1 A Criterion for Sheffer-Functions Definitions A function f ∈ Pk is called a Slupecki-function, if f ∈ P olk ιkk , i.e., if f depends on at least two variables essentially and takes k different values. A function f is called a Sheffer-function of Pk , if every g ∈ Pk is a superposition over f , i.e., if (7.1) [f ] = Pk holds. Obviously, every Sheffer-function is a Slupecki-function. The function x | y := x ∨ y which fulfills (7.1) for k = 2 was published by H. M. Sheffer (in [She 13]). This function and the function x ∧ y, which is dual to this function, are the only binary functions of P2 , which generate P2 (cf. [Zyl 25]). One can easily prove this with the aid of the following theorem.
212
7 Further Completeness Criteria
Theorem 7.1.1 Let f n ∈ P2 . Then [f ] = P2 ⇐⇒ (f ∈ T0 ∧ f ∈ T1 ∧ f ∈ S).
(7.2)
Proof. “=⇒” is trivial. “⇐=”: Because off (0, ..., 0) = 1 and f (1, ..., 1) = 0, we have f ∈ M . Since f 0 1 does not preserve , there are some a1 , ..., an ∈ E2 with f (a1 , ..., an ) = 1 0 f (a1 , ..., an ). Consequently, (f (0, ..., 0), f (a1 , ..., an ), f (a1 , ..., an ), f (1, ..., 1)) does not belong to α := {(a, b, c, d) ∈ E24 | a + b = c + d (mod 2)}, although (0, ai , ai , 1) ∈ α for every i ∈ {1, ..., n} is valid. Thus, we have also f ∈ P ol2 α. With the aid of Theorem 3.3.1, this implies [f ] = P2 . Lemma 7.1.2 Let f n ∈ Pk be a Slupecki-function which preserves a certain h-ary relation ∈ Rk . Then (a) (∃s ∈ Sk \{e11 } : = {(a, s(a)) | a ∈ Ek }) =⇒ (∃γ ∈ Sk ∪ C1k : f ∈ P olγ); (or: (∃s ∈ Sk \{e11 } : f (x1 , ..., xn ) = s−1 (f (s(x1 ), ..., s(xn ))) ) =⇒ ∃γ ∈ Sk ∪ C1k : f ∈ P olγ; (b) ∈ Mk =⇒ ∃γ ∈ C1k : f ∈ P olγ; (c) (2 ≤ h ≤ k − 1 ∧ ∈ Chk ) =⇒ ∃γ ∈ C1k : f ∈ P olγ; (d) (k = pm (p prime, m ≥ 1) ∧ ∈ Lk ) =⇒ ∃γ ∈ Uk ∪ Sk : f ∈ P olγ; (e) ∈ Bk =⇒ ∃γ ∈ Uk ∪ Sk : f ∈ P olγ. Proof. (a): In the proof of Lemma 6.1.3, we had shown that, from the relation s := {(a, s(a)) | a ∈ Ek } (s ∈ Sk \{e11 }), either a relation of C1k (in the case s ∩ ι2k = ∅) or a relation of Sk (in the case s ∩ι2k = ∅) are derivable, whereby we have f ∈ P olγ for a certain γ ∈ C1k ∪Sk . (b): Let o ∈ Ek be the least element in respect to ∈ Mk . Because of Im(f ) = Ek and f ∈ P ol, f (o, ..., o) = o holds. Thus we have f ∈ P ol{o}. (c): Let C be the set of all central elements of the relation ∈ Chk , 2 ≤ h ≤ k − 1. Then, because of (a0 , ..., ah−2 , c) ∈ for every c ∈ C and arbitrary a0 , ..., ah−2 ∈ Ek , it results from f ∈ P ol and Im(f ) = Ek that f (c1 , ..., cn ) ∈
7.1 A Criterion for Sheffer-Functions
213
C is valid for all c1 , ..., cn ∈ C. Consequently, f preserves a relation of C1k . (d): Let k = pm (p prime, m ≥ 1) and let f n be a quasi-linear function. By Lemma 5.2.4.3, f is isomorphic to a certain function fˆn ∈ PA , where A := Epm . One can describe this function fˆn as follows: fˆ(x1 , ..., xn ) = a + x1 · A1 + ... + xn · An , where a, x1 , ..., xm ∈ Epm , A1 , ..., An are some matrices of the type (m, m) over Ep and + and · are the usual matrix operations over the field (Ep ; + (mod p), · (mod p)). We form fˆ1 (x) := fˆ(x, x, ..., x) = a + x · A, where A := A1 + ... + An , and distinguish two cases for A: Case 1: det(A − I) = 0. 1 Then there exists b ∈ Epm with b · (A − I) = −a or a + b · A = b. Consequently, we have fˆ(b, ..., b) = b and f preserves a relation of C1k . Case 2: det(A − I) = 0. In this case, there is a d ∈ Epm \{o}, o := (0, ..., 0), with d · (A − I) = o and it holds: fˆ(x1 + d, x2 + d, ..., xn + d) − d = a + (x1 + d) · A1 + ... + (xn + d) · An − d = a + d · (A1 + ... + An ) −d +x1 · A1 + ...xn · An =A = fˆ(x1 , ..., xn ).
o
Thus, fˆ preserves the relation {(x, s(x)) | x ∈ Epm } with s(x) := x + d. With the help of (a), this implies f ∈ P olγ for certain γ ∈ Sk . (e): Let ∈ Bk . Then, by definition, there exists a mapping q from Ek onto Ehm (m ≥ 1) with (a0 , ..., ah−1 ) ∈ =⇒ (q(a0 ), ..., q(ah−1 )) ∈ ξm , where ξm is the h-ary elementary relation on Ehm . Because of Theorem 5.2.6.1, one can describe f ∈ P ol with Im(f ) = Ek in the form (5.14), where gf has the form m−1 si ((q(xji ))α(i)) · hi (7.3) gf (x1 , ..., xn ) = i=0
with {j0 , ..., jm−1 } ⊆ {1, 2, ..., n}, s0 , s1 , ..., sm−1 are some permutations on Ek and α is a certain mapping from Em into Em . By means of (7.3), one can prove that the function f preserves the equivalence relation 1
I denotes the identity matrix of the type (m, m).
214
7 Further Completeness Criteria
{(a, b) ∈ Ek2 | q(a) = q(b)}.
(7.4)
Consequently, f belongs to P olγ for a certain γ ∈ Uk , if q is not bijective. We still have to examine the case that q is bijective. W.l.o.g. let q be the identical mapping in the following. Thus our function f has the form f (x1 , ..., xn ) =
m−1
si ((xji )(α(i)) ) · hi
(7.5)
i=0
and we have k = hm and m ≥ 2 (because of f ∈ P olk ιkk ). For the mapping α, two cases are possible: Case 1: α is not a permutation. In this case, there is a proper subset A of Ek , which is preserved from α. Then, by means of (7.5), it is easy to check that f preserves the non-trivial equivalence relation {(a, b) ∈ Ek2 | ∀i ∈ A : a(i) = b(i) }; hence f ∈ P olγ holds for a certain γ ∈ Uk . Case 2: α is a permutation. We form f1 (x) := f (x, x, ..., x) and set α1 x := α(x), αi x := α(αi−1 x), i ≥ 2. Then we have by assumption and (7.5): g(x) := (f1 f1 ... f1 ) = m times m
where x(α
i)
m
si (sαi (...(sαm−1 i (x(α
i)
))...)) · hi ,
i=0
= x(i) . The function g has the properties g −1 (x) =
m−1 i=1
and
m−1
−1 −1 (i) i s−1 αm−1 i (sαm−2 i (...(si (x ))...)) · h
g −1 (f (g(x1 ), g(x2 ), ..., g(xn ))) = f (x1 , x2 , ..., xn ).
Thus, if g = e11 then by (a) f preserves a certain relation of Sk and (e) was proven. If g = e11 then for every a ∈ Ek the function f preserves the element m−1
sαi (sα2 i (...(sαm−1 i (a(i) ))...)) · hi
i=0
of Ek , whereby f preserves a relation of C1k . The following generalization of Theorem 7.1.1 was found by G. Rousseau.
7.1 A Criterion for Sheffer-Functions
215
Theorem 7.1.3 (Characterization Theorem for Sheffer-Functions; [Rou 67]) Let f n ∈ Pk . Then [f ] = Pk ⇐⇒ ∀ ∈ C1k ∪ Uk ∪ S∼ k : f ∈ P ol.
(7.6)
Proof. Obviously, “=⇒” is valid. “⇐=”: Let f ∈ Pk be a function that does not preserve any relation of the set C1k ∪ S∼ k ∪ Uk . Then f is a Slupecki-function and, because of Theorem 6.1, it is sufficient to show for the proof of “⇐=” of (7.6) that ∀ ∈ Mk ∪ Lk ∪ Bk ∪
k−1
Chk : f ∈ P olk
(7.7)
h=2
holds. From the assumption that (7.7) is false, contradictions to the assumption result with the aid of the statements (b) - (e) from Lemma 7.1.2 in all cases to be scrutinized for . Theorem 7.1.4 ([Sch 69]) One can not reduce the conditions from Theorem 7.1.3; that is, these conditions are independent of each other. Proof. It was shown in [Sch 69] by P. Schofield that every class of the form P olk with ∈ C1k ∪ Sk ∪ Uk can be generated by one function (see Section 11.2). With the help of this property, one can easily prove that our assertion is valid: Assume there is a relation α ∈ C1k ∪ S∼ k ∪ Uk with [f ] = Pk ⇐⇒ ∀ ∈ (C1k ∪ Uk ∪ S∼ k ) \ {α} : f ∈ P ol. Furthermore, let f be a function of A with [f ] = A. Since A is not complete in Pk , there exists a maximal class B = A of Pk with f ∈ B. Then, f belongs to A ∩ B and we get A = [f ] ⊆ A ∩ B ⊆ B. Because of A = B, however, this is contradictory to the Pk -maximality of A.
The literary about concrete Sheffer-functions is very extensive. One finds a bibliography for this purpose for example in [P¨ os-K 79], p. 135, and in [Ros 77] (or [Ros 84]). The following theorem gives only one of the classical examples for Sheffer-functions, which was published in 1936. Theorem 7.1.5 (Theorem of Webb; [Web 36]) The function f (x, y) := min(x, y) + 1 (mod k) is a Sheffer-function for Pk .
216
7 Further Completeness Criteria
Proof. A possible proof is the construction of a known generating system os-K 79]. We prove the for Pk over the function f , which one can look up [P¨ assertion here with the aid of (7.6). Superpositions over f are the functions f1 := ∆f with f1 (x) = x + 1 (mod k) and min := f1 f1 ... f1 f . k−1 times Obviously, the function f1 does not preserve any relation ∈ C1k . Thus we have f ∈ P olk for all ∈ C1k . 0 b Let ∈ Sk . Then there are a, b ∈ Ek with {(0, a), (b, 0)} ⊆ and f = a 0 1 . Consequently, f does not preserve any relation ∈ Sk . 1 Since f1 ∈ P olk is false for every ∈ Uk , we assume that f1 ∈ P olk for certain ∈ Uk is valid. Then, the equivalence classes of are equipotent, and there exist two equivalence classes [a] and [a + 1] of with the following properties: [a] = [a + 1] , b ∈ [a] , a < b, k − 1 ∈ [a] . a b+1 a Then (a, b), (a + 1, b + 1) ∈ and min = ∈ . Conseb a+1 a+1 quently, the function f does not preserve any relation of Uk . By means of Theorems 7.1.3, it is already recognizable that the number of Sheffer-functions is quite great. The next theorem summarizes some statements about concrete numbers and certain convergence. Theorem 7.1.6 Let ϕn (k) be the number of all n-ary Sheffer-functions of Pk . Then (a) ϕn (2) = 22 (b) limn→∞
n
−2
ϕn (2) 2 2n
− 22
n−1
−1
;
= 14 ;
(c) ϕ2 (3) = 3774 ([Mar 54]); (d) limk→∞
ϕn (k) k kn
= limn→∞
ϕn (k) k kn
=
1 e
for k ≥ 3, [Bai 67a].
(e) For a large k, given a randomly selected f one can decide whether f ∈ Pkn , n ≥ 2, is a Sheffer-function with probability almost 1 by testing the condition f (x, x, ..., x) = x for every x ∈ Ek only; [Dav 68]. Proof. (a) and (b) are easy to check. One can find proofs for (c) –(e) in [Mar 54] and [Dav 68].
7.2 A Completeness Criterion for Surjective Functions For the case that one only considers subsets A ⊆ Pk of functions with the range of values Ek (i.e., surjective functions), our general completeness criterion (7.1) can be simplified. It holds:
7.3 Fundamental Sets
217
Theorem 7.2.1 ([Ros 70c], [Ros 75]) For k = hm with h ≥ 3 and m ≥ 1 let B∗k := { ∈ Bk | ∃n : is isomorphic to ξn }. Then, for arbitrary A ⊆ Pk [k] we have: [A] = Pk ⇐⇒ ∀ ∈ C1k ∪ Sk ∪ Uk ∪ Lk ∪ B∗k : A ⊆ P olk .
(7.8)
Proof. “=⇒” is trivial. “⇐=”: Our theorem follows from