DOCSLIB.ORG

On Congruences and Homomorphisms on Some Non-Deterministic Algebras

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
On Congruences and Homomorphisms on Some Non-Deterministic Algebras ON CONGRUENCES AND HOMOMORPHISMS ON SOME NON-DETERMINISTIC ALGEBRAS I. P. Cabrera, P. Cordero, G. Gutierrez,´ J. Mart´ınez and M. Ojeda-Aciego Dept. Applied Mathematics, University of Malaga,´ Spain Keywords: L-fuzzy sets, Non-deterministic algebra, Congruence, Homomorphism. Abstract: Starting with the underlying motivation of developing a general theory of L-fuzzy sets where L is a multilat- tice (a particular case of non-deterministic algebra), we study the relationship between the crisp notions of congruence, homomorphism and substructure on some non-deterministic algebras which have been used in the literature, i.e. hypergroups, and join spaces. Moreover, we provide suitable extensions of these notions to the fuzzy case. 1 INTRODUCTION and its relationships with other logics of uncertainty. More focused on the theoretical aspects of Computer This paper follows the trend of developing fuzzy Science, some authors (Belohlˇ avek,´ 2002),(Petkovic,´ versions of crisp concepts in mathematics. Specif- 2006) have pointed out the relation between congru- ically, we focus on congruence relations, substruc- ences, fuzzy automata and determinism. tures and homomorphisms in the framework of sev- More on the practical side, applications of the con- eral hyperstructures, which are non-deterministic al- cept of congruence can be seen in the World Wide gebraic structures in the sense that the operations are Web. Concerning web applications, some authors not single-valued but set-valued. have argued on the convenience of using Answer Set The study of congruence relations and homomor- Programming (ASP) in the Semantic Web. Congru- phisms between given hyperstructures plays an im- ence relations have been used in the study of modu- portant role in the general theory of algebraic fuzzy larization of ASP as a way to structure and ease the systems. The underlying idea here is to apply meth- program development process. Specifically, compo- ods of the algebraic theory of ordinary congruences sition of modules has been formalized in(Oikarinen and homomorphisms between classical structures in and Janhunen, 2008; Janhunen et al., 2007) in terms studying suitable extensions for specific hyperstruc- of equivalence relations which are proper congruence tures, such as hypergroups, and join spaces. relations. One can find a number of extensions of classical The previous paragraphs have shown the useful- algebraic structures to a fuzzy framework in the liter- ness of the theory of (crisp) congruences regarding ature, all of them based more or less in similar ideas. practical applications. At this point, it is important to However, the fuzzy extension of the notion of func- recall that the problem of providing suitable fuzzifi- tion has been studied from several standpoints, and cations of crisp concepts is an important topic which this fact complicates the choice of the most suitable has attracted the attention of a number of researchers. definition of fuzzy homomorphism: the most conve- Since the inception of fuzzy sets and fuzzy logic, nient definition seems to depend on particular details there have been approaches to consider underlying of the underlying algebraic structure under consider- sets of truth-values more general than the unit inter- ation. val; for instance, consider the L-fuzzy sets introduced The study of congruences is important both from by Goguen in (Goguen, 1967), where L is a complete a theoretical standpoint and for its applications in the lattice. field of logic-based approaches to uncertainty. Re- There are more general structures than a com- garding applications, the notion of congruence is in- plete lattice which could host a suitable extension timately related to the foundations of fuzzy reasoning of the notion of fuzzy set, for instance, the multi- 59 Cabrera I., Cordero P., Gutiérrez G., Martínez J. and Ojeda-Aciego M. (2009). ON CONGRUENCES AND HOMOMORPHISMS ON SOME NON-DETERMINISTIC ALGEBRAS. In Proceedings of the International Joint Conference on Computational Intelligence, pages 59-67 DOI: 10.5220/0002313300590067 Copyright c SciTePress IJCCI 2009 - International Joint Conference on Computational Intelligence lattices and other general hyperstructures. The con- • Associativity: (ab)c = a(bc) for all a;b;c 2 A. cepts of ordered and algebraic multilattice were in- • Reproductivity: aA = Aa = A for all a 2 A. That troduced in (Benado, 1954): a multilattice is an alge- is, for all a;b 2 A, the equations ax = b y xa = b braic structure in which the restrictions imposed on a have solutions. (complete) lattice, namely, the “existence of least up- per bounds and greatest lower bounds” are relaxed to (A;·) is said to be a join space if it satisfies associa- the“existence of minimal upper bounds and maximal tivity, reproductivity and, moreover, the two following lower bounds”. An alternative algebraic definition of properties hold: multilattice was proposed in (Medina et al., 2005), • Commutativity: ab = ba for all a;b;c 2 A. which is more closely related to that of lattice, allow- • Transposition Property: for all a;b;c;d 2 A, ing for natural definitions of related structures such a=b \ c=d 6= ? implies ad \ bc 6= ? where a=b = that multisemilattices and, in addition, is better suited fx j a 2 xbg. for applications. For instance, a general approach to fuzzy logic programming based on a multilattice as It is remarkable that in the context of multilattices underlying set of truth-values was presented in (Med- it is admissible to consider the empty set in the range ina et al., 2007). of the hyperoperation, hence interest arises in devel- A number of papers have been published on the oping a suitable extension of the concept of hyper- lattice of fuzzy congruences on different classical al- groupoid, the so-called nd-groupoid. Despite of the gebraic structures, and even in some hyperstructures, small change regarding the empty set, it is noticeable for instance (Cordero et al., 2008) studies congru- that the resulting theory differs substantially. ences on a multilattice. In this paper, we will focus Definition 3. An nd-groupoid is a pair (A;·) con- on congruences and homomorphisms in the more gen- sisting of a non-empty set A together with an nd- eral setting of hyperstructures (Corsini and Leoreanu, operation · : A × A ! 2A. 2003). The structure of the paper is as follows: in Sec- Remark 4. As usual, if a 2 A and X ⊆ A then aX will tion 2, we introduce the definitions of some hyper- denote fax j x 2 Xg and Xa will denote fxa j x 2 Xg. structures, together with some notational convention In particular, a? = ?a = ?. to be used in the rest of the paper; then, in Sec- Note, as well, that in the rest of the paper we will tion 3, we concentrate on the definition of homo- frequently write singletons without braces. morphism between nd-groupoids and how it preserves the different subhyperstructures. Later, in Section 4, the relation between the introduced notion of nd- homomorphism and (crisp) congruence on a hyper- 3 ON THE DEFINITION OF structure is investigated. It is in Section 5 where the ND-GROUPOID notion of fuzzy homomorphism is defined and the HOMOMORPHISM canonical decomposition theorem is presented. Fi- nally, we present some conclusions and prospects for This section introduces the extension of the existing future work. results about homomorphisms to the more general framework of nd-grupoids. Firstly, we begin by dis- cussing the different versions of the concept of ho- 2 PRELIMINARY DEFINITIONS momorphism on hypergroupoids (also called multi- groupoids) appearing in the literature. They are usu- Firstly, let us introduce the preliminary concepts used ally associated to particular classes of hypergroupoids in this paper: such as those of hypergroups and join spaces. Definition 1. A hypergroupoid is a pair (A;·) con- Some authors that deal with these and other hy- sisting of a non-empty set A together with a hyperop- perstructures use the following definitions of homo- A eration · : A × A ! 2 r ?. morphism (Corsini, 2003). Traditionally, authors working with hyperstruc- Definition 5. Let (A;·) and (B;·) be hypergroupoids. tures have considered the natural restriction of the A map h: A ! B is said to be: images of the operation to be non-empty sets, for instance, the structures of hypergroup or join • Benado-homomorphism if h(ab) ⊆ h(a)h(b), for space (Corsini and Leoreanu, 2003). all a;b 2 A. Definition 2. A hypergroupoid (A;·) is said to be a • Algebraic-homomorphism if h(ab) = h(a)h(b), hypergroup if the following properties hold: for all a;b 2 A. 60 ON CONGRUENCES AND HOMOMORPHISMS ON SOME NON-DETERMINISTIC ALGEBRAS (B;·) Recall that this definition extends without modifi- (A;·) cation to the framework of nd-groupoids. · a b c d · a b c Regarding the terminology, we depart here a bit a a b b;c A a a b c from the usual one. The first one was the original def- b b b a;c A b b b c inition by Benado (Benado, 1954), which has been c c;d c;d a;c A c c c c used in several recent papers (Davvaz, 2000; Gen- d A A A A tile, 2006; Corsini, 2003). However, it is noticeable that, finally, the authors concentrate mostly on the (i(A);·) equality-based definition. This choice is partly due to · a b c the excessive generality of Benado’s definition, which a a b b;c limits the possibility of obtaining interesting theoreti- b b b a;c cal results. The terminology used in those papers is to c c c a;c call homomorphism to Benado’s ones and call good The initial hypergrupoid (A;·) is commutative, idem- (or strong) homomorphism to algebraic ones. potent and associative. However (i(A);·) is neither We have adopted the term algebraic instead of commutative nor idempotent nor associative (for in- good or strong because this type of homomorphism stance, note that (ab)c = fa;cg 6= a(bc) = fa;b;cg).
Load more

Recommended publications
  • Relations on Semigroups
    International Journal for Research in Engineering Application & Management (IJREAM) ISSN : 2454-9150 Vol-04, Issue-09, Dec 2018 Relations on Semigroups 1D.D.Padma Priya, 2G.Shobhalatha, 3U.Nagireddy, 4R.Bhuvana Vijaya 1 Sr.Assistant Professor, Department of Mathematics, New Horizon College Of Engineering, Bangalore, India, Research scholar, Department of Mathematics, JNTUA- Anantapuram [email protected] 2Professor, Department of Mathematics, SKU-Anantapuram, India, [email protected] 3Assistant Professor, Rayalaseema University, Kurnool, India, [email protected] 4Associate Professor, Department of Mathematics, JNTUA- Anantapuram, India, [email protected] Abstract: Equivalence relations play a vital role in the study of quotient structures of different algebraic structures. Semigroups being one of the algebraic structures are sets with associative binary operation defined on them. Semigroup theory is one of such subject to determine and analyze equivalence relations in the sense that it could be easily understood. This paper contains the quotient structures of semigroups by extending equivalence relations as congruences. We define different types of relations on the semigroups and prove they are equivalence, partial order, congruence or weakly separative congruence relations. Keywords: Semigroup, binary relation, Equivalence and congruence relations. I. INTRODUCTION [1,2,3 and 4] Algebraic structures play a prominent role in mathematics with wide range of applications in science and engineering. A semigroup
    [Show full text]
  • 8.6 Modular Arithmetic
    “mcs” — 2015/5/18 — 1:43 — page 263 — #271 8.6 Modular Arithmetic On the first page of his masterpiece on number theory, Disquisitiones Arithmeticae, Gauss introduced the notion of “congruence.” Now, Gauss is another guy who managed to cough up a half-decent idea every now and then, so let’s take a look at this one. Gauss said that a is congruent to b modulo n iff n .a b/. This is j written a b.mod n/: ⌘ For example: 29 15 .mod 7/ because 7 .29 15/: ⌘ j It’s not useful to allow a modulus n 1, and so we will assume from now on that moduli are greater than 1. There is a close connection between congruences and remainders: Lemma 8.6.1 (Remainder). a b.mod n/ iff rem.a; n/ rem.b; n/: ⌘ D Proof. By the Division Theorem 8.1.4, there exist unique pairs of integers q1;r1 and q2;r2 such that: a q1n r1 D C b q2n r2; D C “mcs” — 2015/5/18 — 1:43 — page 264 — #272 264 Chapter 8 Number Theory where r1;r2 Œ0::n/. Subtracting the second equation from the first gives: 2 a b .q1 q2/n .r1 r2/; D C where r1 r2 is in the interval . n; n/. Now a b.mod n/ if and only if n ⌘ divides the left side of this equation. This is true if and only if n divides the right side, which holds if and only if r1 r2 is a multiple of n.
    [Show full text]
  • Math 327, Solutions to Hour Exam 2
    Math 327, Solutions to Hour Exam 2 1. Prove that the function f : N × N ! N defined by f(m; n) = 5m10n is one-to-one. Solution: Begin by observing that we may rewrite the formula for f as f(m; n) = 5m+n2n. Suppose f(m1; n1) = f(m2; n2), then 5m1+n1 2n1 = 5m2+n2 2n2 = k for some common integer k. By the fundamental theorem of arithmetic, the exponents in the prime decomposition of k are unique and hence m1 + n1 = m2 + n2 and n1 = n2: Substituting the second equality into the first we have m1 +n1 = m2 +n1 and hence m1 = m2. Therefore, (m1; n1) = (m2; n2), which shows that the function is one-to-one. 2a. Find all integers x, 0 ≤ x < 10 satisfying the congruence relation 5x ≡ 2 (mod 10). If no such x exists, explain why not. Solution: If the relation has an integer solution x, then there exists an integer k such that 5x − 2 = 10k, which can be rewritten as 2 = 5x − 10k = 5(x − 2k). But since x − 2k is an integer, this shows that 5 2, which is false. This contradiction shows that there are no solutions to the relation. 2b. Find all integers x, 0 ≤ x < 10 satisfying the congruence relation 7x ≡ 6 (mod 10). If no such x exists, explain why not. Solution: By Proposition 4.4.9 in the book, since 7 and 10 are relatively prime, there exists a unique solution to the relation. To find it, we use the Euclidean algorithm to see that 21 = 7(3) + 10(−2), which means that 7(3) ≡ 1(mod 10).
    [Show full text]
  • Congruence Relations and Fundamental Groups
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOURNAL OF ALGEBRA 75, 44545 1 (1982) Congruence Relations and Fundamental Groups YASUTAKA IHARA Department of Mathematics, Faculty of Science, University of Tok.vo, Bunkyo-ku, Tokyo 113, Japar? Communicated by J. Dieudonne’ Received April 10, 1981 1 In the arithmetic study of fundamental groups of algebraic curves over finite fields, the liftings of the Frobeniuses play an essential role. Let C be a smooth proper irreducible algebraic curve over a finite field F;I and let II (resp. n’) be the graphs on C x C of the qth (resp. q-‘th) power correspon- dences of C. In several interesting cases, C admits a lifting to characteristic 0 together with its correspondence T = 17 U P. It will be shown that in such a case the quotient of the algebraic fundamental group xi(C) modulo its normal subgroup generated by the Frobenius elements of “special points” (see below) is determined by the homomorphisms between the topological fundamental groups of the liftings of C and of T. The main result of this paper, which generalizes [2a, b] (Sect. 4), is formulated roughly as follows. Suppose that there exist two compact Riemann surfaces 31, 93’ that Yift” C, and another one, go, equipped with two finite morphisms p: 91°+ 93, o’: 93’ -+ 3’ such that 9 x @: ‘3’ --P 3 X 3’ is generically injective and (o X 4~‘) (‘3”) lifts T. Call an F,,rational point x of C special if the point (x, x9) of T (which lies on the crossing of 17 and n’) does not lift to a singular point of (u, x rp’)(l#‘).
    [Show full text]
  • Bisimple Semigroups
    /-BISIMPLE SEMIGROUPS BY R. J. WARNE Let S be a semigroup and let Es denote the set of idempotents of S. As usual Es is partially ordered in the following fashion: if e,feEs, efíf if and only if ef=fe = e. Let /denote the set of all integers and let 1° denote the set of nonnegative integers. A bisimple semigroup Sis called an 7-bisimple semigroup if and only if Es is order isomorphic to 7 under the reverse of the usual order. We show that S is an 7-bisimple semigroup if and only if S^Gx Ixl, where G is a group, under the multiplication (g, a, b)(h, c, d) = (gfb-}c.chab-cfb-c.d, a,b + d-c) if b ^ c, = (fc~-\,ag<xc~''fc-b,bh,a+c-b, d) if c ^ b, where a is an endomorphism of G, a0 denoting the identity automorphism of G, and for me Io, ne I, /o,n=e> the identity of G while if m>0, fim.n = un + i"m~1un + 2am-2- ■ -un + (m.X)aun + m, where {un : ne/} is a collection of elements of G with un = e, the identity of G, if n > 0. If we let G = {e}, the one element group, in the above multiplication we obtain S=IxI under the multiplication (a, b)(c, d) = (a + c —r, b + d—r). We will denote S under this multiplication by C*, and we will call C* the extended bicyclic semigroup. C* is the union of the chain I of bicyclic semigroups C.
    [Show full text]
  • UNIVERSAL ALGEBRA Abstract Approved _____MMEMIIIMI Norman Franzen
    AN ABSTRACT OF THE THESIS OF JUNPEI SEKINO for the MASTER OF SCIENCE (Name) (Degree) ,, in MATHEMATICS presented on () t ,{, i >_: ¡ ``¡2 (Major) (Date) Title: UNIVERSAL ALGEBRA Abstract approved _____MMEMIIIMI Norman Franzen In this paper, we are concerned with the very general notion of a universal algebra. A universal algebra essentially consists of a set A together with a possibly infinite set of finitary operations on. A. Generally, these operations are related by means of equations, yield- ing different algebraic structures such as groups, groups with oper- ators, modules, rings, lattices, etc. This theory is concerned with those theorems which are common to all these various algebraic sys- tems. In particular, the fundamental isomorphism and homomorphism theorems are covered, as well as, the Jordan- Holder theorem and the Zassenhaus lemma. Furthermore, new existence proofs are given for sums and free algebras in any primitive class of universal algebras. The last part treats the theory of groups with multi- operators in a manner essentially different from that of P. J. Higgins. The ap- proach taken here generalizes the theorems on groups with operators as found in Jacobson's "Lectures in Abstract Algebra, " vol. I. The basic language of category theory is used whenever conven- ient. Universal Algebra by Junpei Sekino A THESIS submitted to Oregon State University in partial fulfillment of the requirements for the degree of Master of Science June 1969 APPROVED: Assistant Professor of Mathematics in charge of major Acting Chairman of Department of Mathematics Dean of ra uate c ool Date thesis is presented ( ;( Typed by Clover Redfern for JUNPEI SEKINO ACKNOWLEDGMENT I wish to acknlowledge my gratitude to Mr.
    [Show full text]
  • Structures and Congruences
    Structures and Congruences Oliver Kullmann Mathematical structures Equivalence Structures and Congruences relations Subspaces and quotients Oliver Kullmann Isomorphisms theorems Computer Science Department Congruences for Swansea University groups and rings MRes Seminar Swansea, November 10, 2008 Structures and Introduction Congruences Oliver Kullmann This lecture tries to convey some key concepts from Mathematical mathematics in general, relevant for our investigations structures Equivalence into boolean algebra and Stone duality: relations First we reflect upon “mathematical structures”. Subspaces and quotients Of fundamental importance is the concept of an Isomorphisms equivalence relation “compatible” with the structure, theorems Congruences for which enables us to derive a “quotient”. groups and rings We discuss this concept in general, and especially for the algebraic structures here. Basically no proofs are given, but emphasise is put on the definitions and properties, leaving the proofs as relatively straightforward exercises. You must fill the gaps yourself!! Structures and Overview Congruences Oliver Kullmann Mathematical structures 1 Mathematical structures Equivalence relations Subspaces and quotients 2 Equivalence relations Isomorphisms theorems Congruences for 3 Subspaces and quotients groups and rings 4 Isomorphisms theorems 5 Congruences for groups and rings Structures and Three major mathematical structures Congruences Oliver Kullmann Bourbaki introduced “structuralism” to mathematics (and Mathematical the world), distinguishing
    [Show full text]
  • A Study of Universal Algebras in Fuzzy Set Theory
    RHODES UNIVERSITY DEPARTMENT OF MATHEMATICS A STUDY OF UNIVERSAL ALGEBRAS IN FUZZY SET THEORY by V. MURAU A thesis submitted in fulfilment of the requirements for the degree of DOCTOR OF PHILOSOPHY in Mathematics. February 1987 ( i ) ABSTRACT This thesis attempts a synthesis of two important and fast developing branches of mathematics, namely universal algebra and fuzzy set theory. Given an abstract algebra [X,F] where X is a non-empty set and F is a set of finitary operations on X, a fuzzy algebra [IX,F] is constructed by extending operations on X to that on IX, the set of fuzzy subsets of X (I denotes the unit interval), using Zadeh's extension principle. Homomorphisms between fuzzy algebras are defined and discussed. Fuzzy subalgebras of an algebra are defined to be elements of a fuzzy algebra which respect the extended algebra operations under inclusion of fuzzy subsets. The family of fuzzy subalgebras of an algebra is an algebraic closure system in IX. Thus the set of fuzzy subalgebras is a complete lattice. A fuzzy equivalence relation on a set is defined and a partition of such a relation into a class of fuzzy subsets is derived . Using these ideas, fuzzy functions between sets, fuzzy congruence relations, and fuzzy homomorphisms are defined. The kernels of fuzzy homomorphisms are proved to be fuzzy congruence relations, paving the way for the fuzzy isomorphism theorem. Finally, we sketch some ideas on free fuzzy subalgebras and polynomial algebras. In a nutshell, we can say that this thesis treats the central ideas of universal algebras, namely subalgebras, homomorphisms, equivalence and congruence relations, isomorphism theorems and free algebra in the fuzzy set theory setting.
    [Show full text]
  • Congruences 1 the Congruence Relation 2 Congruence Classes
    Congruences 1 The congruence relation The notion of congruence modulo m was invented by Karl Friedrich Gauss, and does much to simplify arguments about divisibility. Definition. Let a; b; m 2 Z, with m > 0. We say that a is congruent to b modulo m, written a ≡ b (mod m); if m j (a − b). We call m a modulus in this situation.If m - (a − b) we say that a is incongruent to b modulo m, written a 6≡ b (mod m): Example. • m = 11. We have −1 ≡ 10 (mod 11), since 11 j (−1 − 10) = −11. We have 108 6≡ 7 (mod 11) since 11 - (108 − 7) = 101. • m = 2. When do we have a ≡ b (mod 2)? We must have 2 j (a − b).In other words, a − b must be even. This is true iff a and b have the same parity: i.e., iff both are even or both are odd. • m = 1. Show that for any a and b we have a ≡ b (mod 1). • When do we have a ≡ 0 (mod m)? This is true iff m j (a − 0) iff m j a. Thus the connection with divisibility: m j a iff a ≡ 0 (mod m). Congruence is meant to simplify discussions of divisibility, and yet in our examples we had to use divisi- bility to prove congruences. The following theorem corrects this. Theorem. Let a; b; m 2 Z with m > 0. Then a ≡ b (mod m) if and only if there is a k 2 Z such that b = a + km.
    [Show full text]
  • The Agda Universal Algebra Library and Birkhoff's Theorem In
    The Agda Universal Algebra Library and Birkhoff’s Theorem in Dependent Type Theory William DeMeo a S Department of Algebra, Charles University in Prague Abstract The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) we developed to formalize the foundations of universal algebra in Martin-Löf-style dependent type theory using the Agda programming language and proof assistant. This paper describes the UALib and demonstrates that Agda is accessible to working mathematicians (such as ourselves) as a tool for formally verifying nontrivial results in general algebra and related fields. The library includes a substantial collection of definitions, theorems, and proofs from universal algebra and equational logic and as such provides many examples that exhibit the power of inductive and dependent types for representing and reasoning about general algebraic and relational structures. The first major milestone of the UALib project is a complete proof of Birkhoff’s HSP theorem. To the best of our knowledge, this is the first time Birkhoff’s theorem has been formulated and provedin dependent type theory and verified with a proof assistant. 2012 ACM Subject Classification Theory of computation → Constructive mathematics; Theory of com- putation → Type theory; Theory of computation → Logic and verification; Computing methodologies → Representation of mathematical objects; Theory of computation → Type structures Keywords and phrases Universal algebra, Equational logic, Martin-Löf Type Theory, Birkhoff’s HSP Theorem, Formalization of mathematics, Agda, Proof assistant Supplementary Material Documentation: ualib.org Software: https://gitlab.com/ualib/ualib.gitlab.io.git Acknowledgements The author wishes to thank Hyeyoung Shin and Siva Somayyajula for their contri- butions to this project and Martin Hötzel Escardo for creating the Type Topology library and teaching a course on Univalent Foundations of Mathematics with Agda at the 2019 Midlands Graduate School in Computing Science.
    [Show full text]
  • Some Aspects of Semirings
    Appendix A Some Aspects of Semirings Semirings considered as a common generalization of associative rings and dis- tributive lattices provide important tools in different branches of computer science. Hence structural results on semirings are interesting and are a basic concept. Semi- rings appear in different mathematical areas, such as ideals of a ring, as positive cones of partially ordered rings and fields, vector bundles, in the context of topolog- ical considerations and in the foundation of arithmetic etc. In this appendix some algebraic concepts are introduced in order to generalize the corresponding concepts of semirings N of non-negative integers and their algebraic theory is discussed. A.1 Introductory Concepts H.S. Vandiver gave the first formal definition of a semiring and developed the the- ory of a special class of semirings in 1934. A semiring S is defined as an algebra (S, +, ·) such that (S, +) and (S, ·) are semigroups connected by a(b+c) = ab+ac and (b+c)a = ba+ca for all a,b,c ∈ S.ThesetN of all non-negative integers with usual addition and multiplication of integers is an example of a semiring, called the semiring of non-negative integers. A semiring S may have an additive zero ◦ defined by ◦+a = a +◦=a for all a ∈ S or a multiplicative zero 0 defined by 0a = a0 = 0 for all a ∈ S. S may contain both ◦ and 0 but they may not coincide. Consider the semiring (N, +, ·), where N is the set of all non-negative integers; a + b ={lcm of a and b, when a = 0,b= 0}; = 0, otherwise; and a · b = usual product of a and b.
    [Show full text]
  • Congruence Monoids
    ACTA ARITHMETICA 112.3 (2004) Congruence monoids by Alfred Geroldinger and Franz Halter-Koch (Graz) 1. Introduction. The simplest examples of congruence monoids are the multiplicative monoids 1 + 4N0, 1 + pN0 for some prime number p, and 2N 1 . They are multiplicative submonoids of N, and they appear in the literature[ f g as examples for non-unique factorizations (see [19, Sect. 3.3], [28] and [29]). A first systematic treatment of congruence monoids (defined by residue classes coprime to the module) was given in [20] and in [21], where it was proved that these congruence monoids are Krull monoids. Congruence monoids defined by residue classes which are not necessarily coprime to the module were introduced in [18] as a tool to describe the analytic theory of non-unique factorizations in orders of global fields. In this paper, we investigate the arithmetic of congruence monoids in Dedekind domains satisfying some natural finiteness conditions (finiteness of the ideal class group and of the residue class rings). The main examples we have in mind are multiplicative submonoids of the naturals defined by congruences (called• Hilbert semigroups); (non-principal) orders in algebraic number fields. • The crucial new idea is to use divisor-theoretic methods. As usual in algebraic number theory, the global arithmetical behavior is determined by the structure of the semilocal components and the class group. The class groups of congruence monoids in Dedekind domains are essentially ray class groups (and thus they are well studied objects in algebraic number theory). The semilocal components are congruence monoids in semilocal principal ideal domains.
    [Show full text]