The theory of separable mixed abelian groups

On the computational complexity of the theory of Abelian groups

We shall characterize the complete first order theories of torsion free abelian groups having algebraically prime models, elementarily prime models, minimal models, etc., using the well known invariants from [9], [3]. This study was suggested by the questions raised in [2]. Group here will always mean abelian group. For reference on groups see Fuchs [5], [6], for model theory Chang-Keisler [1]. All theories considered are theories in the first order language of group theory. A group G is minimal (strictly minimal) if H < G implies H = G (H-= G), and elementarily prime (algebraically prime) if G is elementarily (algebraically) embeddable in every H G. p, q always denote prime numbers, P the set of all primes. The p-rank of a group G, p-rk(G), is the dimension of G/pG as a vector space over Z/pZ. We define tf(p, G): = min {p-rk(G), ~o}. By the results of [9], [3], two nontrivial torsion free abelian groups G and H are elementarily equivalent iff for all primes p tf(p, G) = tf(p, H). This gives a natural 1-1 correspondence between the complete theories of nontrivial torsion free abelian groups and the functions /3 : P --~ ~o + 1. /3 will always stand for such a function, and the corresponding complete theory will be denoted by T 0. S o is the set of primes p for which/3(p) ~ 0. For more definitions see section 3. Let 13 be a function from P to o) + 1. We shall study the following questions: Does T o have an elementarily (algebraically) prime model? Does T o have a minimal (strictly minimal) model, and if this is the case, how many such models does T o have? Do the minimal and strictly minimal models of T o coincide? These questions have been studied for the special case of the theory of the

The design of decision procedures for combinations of theories sharing some arithmetic fragment is a challenging problem in verification. One possible solution is to apply a combination method à la Nelson-Oppen, like the one developed by Ghilardi for unions of non-disjoint theories. We show how to apply this non-disjoint combination method with the theory of abelian groups as shared theory. We consider the completeness and the effectiveness of this non-disjoint combination method. For the completeness, we show that the theory of abelian groups can be embedded into a theory admitting quantifier elimination. For achieving effectiveness, we rely on a superposition calculus modulo abelian groups that is shown complete for theories of practical interest in verification.

All groups herein are assumed to be abelian. It was not until the 1940's that it was known that a subgroup of an infinite direct sum of finite cyclic groups is again a direct sum of cyclics. This result rests on a general criterion due to Kulikov [7] for a primary abelian group to be a direct sum of cyclic groups. If G is p-primary, Kulikov's criterion presupposes that G has no elements (other than zero) having infinite p-height. For such a group G, the criterion is simply that G be the union of an ascending sequence of subgroups Hn where the heights of the elements of Hn computed in G are bounded by some positive integer λ(n). The theory of abelian groups has now developed to the point that totally projective groups currently play much the same role, at least in the theory of torsion groups, that direct sums of cyclic groups and countable groups played in combination prior to the discovery of totally projective groups and their structure beginning with a paper by R. Nunke [11] in 1967.

In the theory of abelian groups, the study of relations between an abelian group and its endomorphism group is an important problem. The question arises on conditions under which an abelian group and its endomorphism group are isomorphic ([1], Problem 31). The answer to this question has been obtained in the classes of completely decomposable abelian groups [2], vector groups [3], in the classes of periodic abelian groups, divisible abelian groups, nonreduced abelian groups, reduced algebraically compact abelian groups [4]. A group A is called an E+-group if it is isomorphic to its endomorphism group End(A). Clearly, if an abelian group A is an E+-group, then its endomorphism group End(A) is also an E+-group. In this paper, we show that the converse statement holds not always. A group A is called an End-group if the following implication takes place:

The construction of torsion-free abelian groups with prescribed endomorphism rings starting with Corner’s seminal work (see Corner, 1963) is a well-studied subject in the theory of abelian groups. Usually these construction work by adding elements from a (topological) completion in order to get rid of (kill) unwanted homomorphisms. The critical part is to actually prove that every unwanted homomorphism can be killed by adding a suitable element. We will demonstrate that some of those constructions can be significantly simplified by choosing the elements at random. As a result, the endomorphism ring will be almost surely prescribed, i.e., with probability one.

In this article we prove a theorem on the definitional embeddability into first-order predicate logic without equality of such well-known mathematical theories as group theory and the theory of Abelian groups. This result may seem surprising, since it is generally believed that these theories have a non-logical content. It turns out that the central theory of general algebra are purely logical. Could this be the reason that we find them in many branches of mathematics? This result will be of interest not only for logicians and mathematicians but also for philosophers who study foundations of logic and its relation to mathematics.

In 1996, the first author defined analogs of the concepts of complete (divisible), reduced, and periodic abelian groups, well-known in the theory of abelian groups, for arbitrary varieties of algebras. In 2021, the first author proposed a modification of the concepts of completeness and reducibility, which is more natural in the case of associative rings. The paper studies the modification of these concepts for associative rings. Artinian \(\mathbf{M}\)-complete, \(\mathbf{M}\)-reduced rings, and minimally \(\mathbf{M}\)-complete associative nilpotent rings, simple rings with unity, and finite rings are characterized.

A method to derive multi-dimensional theta constant identities using theory of Abelian groups is given. The method is applied to classical examples and is used to generalize the results of [3, 4].

The Theory of Abelian Groups With the Quantifier (≦ <i>x</i>)

Instead of the axiom of choice, we assume that every set of reals has the Baire property. It is shown that under this condition the concept of slenderness known from the theory of abelian groups becomes meaningful for vector spaces.

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.

Major progress in group theory occurred in the nineteenth century but the evolution of group theory began already in the latter part of 18th century. Some characteristic features of 19th century mathematics which had crucial impact on this evolution are concern for rigor and abstraction and the view that mathematics is a human activity without necessarily referring to physical situations. In 1770, Joseph Louis Lagrange (1736-1813) wrote his seminal memoir Reflections on the solution of algebraic equations. He considered ‘abstract’ questions like whether every equation has a root and, if so, how many were real/complex/positive/negative? The problem of algebraically solving 5th degree equations was a major preoccupation (right from the 17th century) to which Lagrange lent his major efforts in this paper. His beautiful idea (now going under the name of Lagrange’s resolvent) is to ‘reduce’ a general equation to auxiliary (resolvent) equations which have one degree less. Later, the theory of finite abelian groups evolved from Carl Friedrich Gauss’s famous “Disquisitiones Arithmeticae”. Gauss (1777-1855) established many of the important properties though he did not use the terminology of group theory. In his work, finite abelian groups4 Math Unlimitedappeared in different forms like the additive group Zn of integers modulo n, the multiplicative group Z∗n of integers modulo n relatively prime to n, the group of equivalence classes of binary quadratic forms, and the group of n-th roots of unity. In 1872, Felix Klein delivered a famous lecture A Comparative Review of Recent Researches in Geometry. The aim of his (so-called) Erlangen Program was the classification of geometry as the study of invariants under various groups of transformations. So, the groups appear here “geometrically” as groups of rigid motions, of similarities, or as the hyperbolic group etc. During the analysis of the connections between the different geometries, the focus was on the study of properties of figures invariant under transformations. Soon after, the focus shifted to a study of the transformations themselves. Thus the study of the geometric relations between figures got converted to the study of the associated transformations. In 1874, Sophus Lie introduced his “theory of continuous transformation groups” what we basically call Lie groups today. Poincaré and Klein began their work on the so-called automorphic functions and the groups associated with them around 1876. Automorphic functions are generalizations of the circular, hyperbolic, elliptic, and other functions of elementary analysis. They are functions of a complex variable z, analytic in some domain, and invariant under the group of transformations x′ = ax+b(a, b, c, d real or complex and ad − bc 0), or under some subgroup of this group. We end this introduction with the ancient problem of finding all those positive integers (called congruent numbers) which are areas of right-angled triangles with rational sides. To this date, the general result describing all of them precisely is not proved. However, the problem can be re-stated in terms of certain groups called elliptic curves and this helps in getting a hold on the problem and in obtaining several partial results. Indeed, if n is a positive integer, then the rational numbers x, y satisfying y2 = x3 − n2x form a group law which can be described geometrically. Then, n is a congruent number if and only if, this group is infinite!

Stable theories were introduced in [1] for constructing classification theory and are a generalization of the concept of a totally transcendental theory as defined in [2]. In [3], it was proved that the property of being stable for a theory is equivalent to being definable for every complete type of the theory. This property plays a fundamental part in research on stable theories. In [4], the notion of E∗-stability (generalized stability) was introduced, and it was proved that types for E∗-stable theories are definable. A consequence of that result was stating, along with definability of types for stable theories (see [3]), that types over any P -sets in P -stable theories likewise are definable (which had been established in [5] for types over P -models). The notion of E∗-stability is a new stability scale, whose basic parameter is a mapping of types of a complete theory into types of another theory. An interesting example of E∗-stability is (P, a)-stability, defined by adding to a language a unary predicate symbol and adding to types the condition of being algebraically closed for that predicate. In this paper, we work to prove a (P, a)-stability theorem for theories of torsion-free Abelian groups. In so doing, use is made of quantifier elimination down to positive primitive formulas in Abelian groups with a predicate distinguishing a subgroup. By virtue of this fact, the question of being (P, a)-stable for a theory reduces to asking if a system of linear equations with integer coefficients has a solution in the algebraic closure of constants involved in the system. To ∗Supported by RFBR (project No. 09-01-00336-a).

It is well known that assuming Martin’s axiom and the negation of the continuum hypothesis (MA+−1CH) has a dramatic effect on Abelian group theory. One only has to think of Shelah’s resolution of the Whitehead problem (cf[S1] or [E1]). MA+−NCH has certain drawbacks. It is not strong enough to resolve questions about the structure of ω1-separable groups which can be resolved by an extension and it is not consistent with the continuum hypothesis. In this paper I shall talk about generalizations due to Shelah of MA+−ICH, the proper forcing axioms, and their relation to Abelian group theory. (From hereon “group” will mean “Abelian group”.) Section I is devoted to some preliminaries and the statement of the proper forcing axioms. In section II a useful result about choosing a cub almost disjoint from a ladder system assuming PFA(ω1) is proved in order to illustrate how the axiom works. Proper posets are redefined in section III using elementary submodels. This section simplifies the task of writing the remainder of the paper. But it is explained for the reader who is unversed in logic how to ignore this section.KeywordsDirect SummandDense SubsetContinuum HypothesisPure SubgroupMaximal AntichainThese 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.