Absolutely Indecomposable Modules

Rüdiger Göbel; Saharon Shelah

Home/Archive/arXiv

arXiv · 0711.3011

Absolutely Indecomposable Modules

Rüdiger Göbel·Saharon Shelah

View original source ↗Read source document ↗Export metadata ↓

Abstract

A module is called absolutely indecomposable if it is directly indecomposable in every generic extension of the universe. We want to show the existence of large abelian groups that are absolutely indecomposable. This will follow from a more general result about R-modules over a large class of commutative rings R with endomorphism ring R which remains the same when passing to a generic extension of the universe. It turns out that `large' in this context has the precise meaning, namely being smaller then the first omega-Erdos cardinal defined below. We will first apply result on large rigid trees with a similar property established by Shelah in 1982, and will prove the existence of related ` R_omega-modules' (R-modules with countably many distinguished submodules) and finally pass to R-modules. The passage through R_omega-modules has the great advantage that the proofs become very transparent essentially using a few `linear algebra' arguments accessible also for graduate students. The result gives a new construction of indecomposable modules in general using a counting argument.

Explore related subjects

math.LO math.GR

Keep this discovery

BibTeX RIS

Rüdiger Göbel, Saharon Shelah. 2007-11-20. Absolutely Indecomposable Modules. https://arxiv.org/abs/0711.3011

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗