Search arXivSearch

arXiv · 2012.04389

Generating ideals by additive subgroups of rings

Abstract

We obtain several fundamental results on finite index ideals and additive subgroups of rings as well as on model-theoretic connected components of rings, which concern generating in finitely many steps inside additive groups of rings. Let $R$ be any ring equipped with an arbitrary additional first order structure, and $A$ a set of parameters. We show that whenever $H$ is an $A$-definable, finite index subgroup of $(R,+)$, then $H+RH$ contains an $A$-definable, two-sided ideal of finite index. As a corollary, we positively answer Question 3.9 of [Bohr compactifications of groups and rings, J. Gismatullin, G. Jagiella and K. Krupi\'nski]: if $R$ is unital, then $(\bar R,+)^{00}_A + \bar R \cdot (\bar R,+)^{00}_A + \bar R \cdot (\bar R,+)^{00}_A = \bar R^{00}_A$, where $\bar R \succ R$ is a sufficiently saturated elementary extension of $R$, and $(\bar R,+)^{00}_A$ [resp. $\bar R^{00}_A$] is the smallest $A$-type-definable, bounded index additive subgroup [resp. ideal] of $\bar R$. This implies that $\bar R^{00}_A=\bar R^{000}_A$, where $\bar R^{000}_A$ is the smallest invariant over $A$, bounded index ideal of $\bar R$. If $R$ is of finite characteristic (not necessarily unital), we get a sharper result: $(\bar R,+)^{00}_A + \bar R \cdot (\bar R,+)^{00}_A = \bar R^{00}_A$. We obtain similar results for finitely generated (not necessarily unital) rings and for topological rings. The above results imply that the simplified descriptions of the definable (so also classical) Bohr compactifications of triangular groups over unital rings obtained in Corollary 3.5 of the aforementioned paper are valid for all unital rings. We analyze many examples, where we compute the number of steps needed to generate a group by $(\bar R \cup \{1\}) \cdot (\bar R,+)^{00}_A$ and study related aspects, showing "optimality" of some of our main results and answering some natural questions.

Explore related subjects

Keep this discovery

BibTeXRIS

Krzysztof Krupiński, Tomasz Rzepecki. 2020-12-08. Generating ideals by additive subgroups of rings. https://doi.org/10.1016/j.apal.2022.103119

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO