SearcharxivSearch

arXiv · 2203.05609

Locally compact models for approximate rings

Abstract

By an approximate subring of a ring we mean an additively symmetric subset $X$ such that $X\cdot X \cup (X +X)$ is covered by finitely many additive translates of $X$. We prove that each approximate subring $X$ of a ring has a locally compact model, i.e. a ring homomorphism $f \colon \langle X \rangle \to S$ for some locally compact ring $S$ such that $f[X]$ is relatively compact in $S$ and there is a neighborhood $U$ of $0$ in $S$ with $f^{-1}[U] \subseteq 4X + X \cdot 4X$ (where $4X:=X+X+X+X$). This $S$ is obtained as the quotient of the ring $\langle X \rangle$ interpreted in a sufficiently saturated model by its type-definable ring connected component. The above theorem can be seen as a general structural result about approximate subrings: every approximate subring $X$ can be recovered up to additive commensurability as the preimage by a locally compact model $f \colon \langle X \rangle \to S$ of any relatively compact neighborhood of $0$ in $S$. It also leads to more precise structural or even classification results. For example, we deduce that every [definable] approximate subring $X$ of a ring of positive characteristic is additively commensurable with a [definable] subring contained in $4X + X \cdot 4X$. This implies that for any given $K,L \in \mathbb{N}$ there exists $C(K,L)$ such that every $K$-approximate subring $X$ (i.e. $K$ additive translates of $X$ cover $X \cdot X \cup (X+X)$) of a ring of positive characteristic $\leq L$ is additively $C(K,L)$-commensurable with a subring contained in $4X + X \cdot 4X$. We also deduce a classification of finite approximate subrings of rings without zero divisors: for every $K \in \mathbb{N}$ there exists $N(K) \in \mathbb{N}$ such that for every finite $K$-approximate subring $X$ of a ring without zero divisors either $|X| <N(K)$ or $4X + X \cdot 4X$ is a subring which is additively $K^{11}$-commensurable with $X$.

Explore related subjects

Keep this discovery

BibTeXRIS

Krzysztof Krupiński. 2022-03-10. Locally compact models for approximate rings. https://arxiv.org/abs/2203.05609

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