Unification in monoidal theories

The aim of this chapter is to give a very brief review of the basic algebraic techniques which form the foundation of invariant theory and of algebraic geometry generally. Beginning in Section 2.1 we introduce Noetherian rings, taking as our point of departure Hilbert's Basis Theorem, which was discovered in the search for a proof of finite generation of rings of invariants. (This result will appear in Chapter 4). In Section 2.2 we prove unique factorisation in polynomial rings, by induction on the number of variables using Gauss's lemma. In Section 2.3 we prove the important fact that in a finitely generated algebra over a field an element contained in all maximal ideals is nilpotent. As we will see in Chapter 3, this observation is really nothing other than Hilbert's Nullstellensatz. A power series ring in one variable is an example of a valuation ring, and we discuss these in Section 2.4. A valuation ring (together with its maximal ideal) is characterised among subrings of its field of fractions as a maximal element with respect to the dominance relation. This will be used in Chapter 3 for proving the Valuative Criterion for completeness of an algebraic variety. In the final section we discuss Nagata's example of a group action under which the ring of invariants which is not finitely generated – that is, his counterexample to Hilbert's 14th problem. This is constructed by taking nine points in general position in the projective plane and considering the existence and non-existence of curves of degree d with assigned multiplicity m at each of the points, and making use of Liouville's Theorem on elliptic functions. Hilbert's Basis Theorem We begin with a discussion of the Basis Theorem, which is the key to Hilbert's theorem of finite generatedness that we will meet in Chapter 4. In Hilbert's original paper [19] the word ideal is not used; and we would like to state the Basis Theorem in a form close to that expressed by Hilbert.

A compactness property of the k-abelian monoids

Noetherian Semigroup Rings with Several Objects

The surprising fact that Hilbert's basis theorem in algebra shows identifiabilty of ideals of polynomials in the limit from positive data is derived by the correspondence between ideals and languages in the context of machine learning. This correspondence also reveals the difference between the two and raises new problems to be solved in both of algebra and machine learning. In this article we solve the problem of providing a concrete form of the characteristic set of a union of two polynomial ideals. Our previous work showed that the finite basis of every polynomial ideal is its characteristic set, which ensures that the class of ideals of polynomials is identifiable from positive data. Union or settheoretic sum is a basic set operation, and it could be conjectured that there is some effective method which produces a characteristic set of a union of two polynomial ideals if both of the basis of ideals are given. Unfortunately, we cannot find a previous work which gives a general method for how to find characteristic sets of unions of languages even though the languages are in a class identifiable from positive data. We give methods for computing a characteristic set of the union of two polynomial ideals.

The purpose of this paper is not to give an overview of the state of art in unification theory. It is intended to be a short introduction into the area of equational unification which should give the reader a feeling for what unification theory might be about. The basic notions such as complete and minimal complete sets of unifiers, and unification types of equational theories are introduced and illustrated by examples. Then we shall describe the original motivations for considering unification (in the empty theory) in resolution theorem proving and term rewriting. Starting with Robinson's first unification algorithm it will be sketched how more efficient unification algorithms can be derived.We shall then explain the reasons which lead to the introduction of unification in non-empty theories into the above mentioned areas theorem proving and term rewriting. For theory unification it makes a difference whether single equations or systems of equations are considered. In addition, one has to be careful with regard to the signature over which the terms of the unification problems can be built. This leads to the distinction between elementary unification, unification with constants, and general unification (where arbitrary free function symbols may occur). Going from elementary unification to general unification is an instance of the so-called combination problem for equational theories which can be formulated as follows: Let E, F be equational theories over disjoint signatures. How can unification algorithms for E, F be combined to a unification algorithm for the theory E ∪ F.KeywordsFunction SymbolEquational TheoryVariable NodeUnification AlgorithmCritical PairThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This thesis presents some contributions in additive combinatorics and arithmetic Ramsey theory. More specifically, it deals with the interaction between combinatorics, number theory and additive combinatorics. This area saw a great improvement with the Szemerédi Regularity Lemma and some of the results that followed. The Regularity Lemma and its consequences have become a widely used tool in graph theory, combinatorics and number theory. Furthermore, its language and point of view has deeply changed the face of additive number theory, a fact universally acknowledged by the Abel award given to Szemerédi in 2012. One of the main reasons for the prize has been Szemerédi's theorem, a result regarding the existence of arbitrarily long arithmetic progressions in dense sets of the integers, the proof of which uses the Regularity Lemma in a key step. One of the earlier consequences of the Regularity Lemma was the Removal Lemma for graphs that was used by Ruzsa and Szemerédi to show Roth theorem, regarding the existence of 3-term arithmetic progressions in dense sets of the integers, in a combinatorial way. The Removal Lemma states that in any graph K with few copies of a subgraph, say a triangle, we can remove few edges from K so that the result contains no copy of the subgraph. This has become a key tool in the applications of the so-called Regularity Method, which has extensive literature in combinatorics, graph theory, number theory and computer science. In 2005 Green introduced a regularity lemma for Abelian groups as well as an algebraic removal lemma. The removal lemma for groups states that, for a given finite Abelian group G, if there are o(|G|^3) solution to x+y+z+t=0 with the variables taking values in S, a subset of G, then we can remove o(|G|) elements from S to make the set S solution-free. The main contributions of this work corresponds to extensions of the removal lemma for groups to either more general contexts, like non-necessary Abelian finite groups, or to linear systems of equations for finite Abelian groups. The main goal is to give a comprehensive and more general framework for many results in additive number theory like Szemerédi Theorem. In particular, we show that the removal lemma for groups by Green can be extended to non-necessary Abelian finite groups. Moreover, we prove a removal lemma for linear systems on finite fields: for every e>0 there exists a d>0 such that if A is a (k x m) linear system of equations with coefficients in a finite field F and the number of solutions to Ax=b, where each variable takes values from a subset Si in F is less than d times |F| raised to m-k, then by removing less than e|F| elements in each Si we can make the resulting sets solution-free, thus solving a conjecture by Green to that respect. Even more, if A is an integer linear system, G is a finite Abelian group, and the determinantal of A and |G| are coprime, then a similar statement holds. Let us mention that the last result allows us to characterize those linear systems where any set S with size proportional to G has a nontrivial solution in S, provided |G| is large enough. This extends the validity of Szmerédi's theorem to finite Abelian groups. These extensions of the removal lemma have been used in arithmetic Ramsey theory to obtain counting results for the number of monochromatic solutions of linear systems. The main result from a work by Frankl, Graham and Rödl in '88 states that the number of monochromatic solutions of regular systems in integer intervals is in fact a positive proportion of the total number of solutions. We give analogous results for solutions in Abelian groups with bounded exponent, for which the main tool in the torsion-free case cannot be applied. Density versions of these counting results are also obtained, in this case with a full characterization.

It is shown that the cohomological dimension of an abelian monoid is equal to that of its group reflection provided that the monoid is either finitely generated or cancellative.Let M be a monoid and let bea nonzero ring with identity.We shall denote the monoid ring of M over R by RM.The R-homological dimension of M is defined by hdRM = wd R and, similarly, the R-cohomological dimension of M is defined by cdRM = pd R where R is considered as a trivial Af-module (i.e.x r = r for x M, r R) and where wd, pd denote weak and projective dimension respectively.Clearly hdRM < cdRM and the equality holds when RM is noetherian (e.g. when R is noetherian and M is finitely generated abelian).If there is a ring homomorphism S -> R then cd M < cds M and hdR M < hds M. In particular, cd M < cd M and hd M < hd M where we omit the subscript when R = Z.Recall that a group M is said to have -torsion if there exists an element of M whose order is not invertible in R. In this case cdRM = oo.If M is an Nn-generated abelian group (n > -1) with no -torsion, then hd M = rank M and cd M = n + 1 + rank M (see, for example, [1], [4] and [10]).In this paper we prove the following.Theorem A. // M is an abelian monoid then hdRM = hdRM.Theorem B. // M is an abelian monoid which is either cancellative or finitely generated, then cd M = cd M.Here M denotes the group reflection of M.An example of Nico [8] shows that Theorem B does not hold for arbitrary abelian monoids.1. Homological dimension of an abelian monoid.The group reflection M of a monoid M is defined to be the image of M under the left adjoint of the forgetful functor from Groups to Monoids.It is not hard to show that M is isomorphic to the quotient of the free group of M by the normal subgroup generated by elements

In this article analogues of the Hilbert Basis Theorem, the Artin-Rees Lemma and the Krull Intersection Theorem are shown for modules with ascending chain condition for finite matrix subgroups. The generalized Hilbert Basis Theorem yields an interesting construction principle of C-pure-injective modules over polynomial rings.

Chapter 7 continues to develop the theory of rings and studies chain conditions for ideals of a ring. The motivation came from an interesting property of the ring of integers Z that its every ascending chain of ideals terminates. This interesting property of Z was first recognized by the German mathematician Emmy Noether (1882–1935). This property leads to the concept of Noetherian rings. On the other hand, Emil Artin (1898–1962) showed that there are some rings in which every infinite descending chain of ideals terminates. Such rings are called Artinian rings. The ring Z has an infinite descending chain of ideals. This property of Z shows that Z is not an Artinian ring. In this chapter special classes of rings are also studied and deeper results on ideal theory are proved. Some finiteness condition for ideals is imposed and Noetherian rings are introduced which are versatile. The most convenient equivalent formulation of the Noetherian requirement is that the ideals of the ring satisfy the ascending chain condition. A connection between a Noetherian domain and a factorization domain is established. Moreover, the Hilbert Basis Theorem is proved. This theorem has made a revolution and has given an extensive class of Noetherian rings. Its application to algebraic geometry is also discussed. The study in this chapter culminates in rings with a descending chain condition for ideals, which determines their ideal structure.

On the number of steps in proofs

Unification is an important concept. It is used in Prolog, resolution, term rewriting and natural language understanding. As the use of formal methods increases, unification will be part of formally developed systems. Hence a theory of unification is desirable. This paper demonstrates the use of VDM to develop a theory of unification. Substitution application is defined recursively, a theory of non-circular substitutions is developed, and an implicit specification of unification is written. A proof of a particular unification algorithm is outlined with respect to this specification. The algorithm considered is more space-efficient than that which Manna and Waldinger prove correct. The theory developed is also compared with that of Manna and Waldinger.

Equational unification is a generalization of syntactic unification in which semantic properties of function symbols are taken into account. For example, assume that the function symbol '+' is known to be commutative. Given the unication problem x + y ≐ a + b (where x and y are variables, and a and b are constants), an algorithm for syntactic unification would return the substitution {x ↦ a; y ↦ b} as the only (and most general) unifier: to make x + y and a + b syntactically equal, one must replace the variable x by a and y by b. However, commutativity of '+' implies that {x ↦ b; y ↦ b} also is a unifier in the sense that the terms obtained by its application, namely b + a and a + b, are equal modulo commutativity of '+'. More generally, equational unification is concerned with the problem of how to make terms equal modulo a given equational theory, which specifies semantic properties of the function symbols that occur in the terms to be unified.

Unification in a combination of arbitrary disjoint equational theories

Proximity-based unification theory

We study two-way tree automata modulo equational theories. We deal with the theories of Abelian groups (ACUM), idempotent commutative monoids (ACUI), and the theory of exclusive-or (ACUX), as well as some variants including the theory of commutative monoids (ACU). We show that the one-way automata for all these theories are closed under union and intersection, and emptiness is decidable. For two-way automata the situation is more complex. In all these theories except ACUI, we show that two-way automata can be effectively reduced to one-way automata, provided some care is taken in the definition of the so-called push clauses. (The ACUI case is open.) In particular, the two-way automata modulo these theories are closed under union and intersection, and emptiness is decidable. We also note that alternating variants have undecidable emptiness problem for most theories, contrarily to the non-equational case where alternation is essentially harmless.KeywordsEquational TheoryPredicate SymbolFunctional TermTree AutomatonFunctional SupportThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.