SearcharxivSearch

arXiv · math/0003164

Some Nasty Reflexive Groups

Abstract

In "Almost Free Modules, Set-theoretic Methods", Eklof and Mekler raised the question about the existence of dual abelian groups G which are not isomorphic to Z+G. Recall that G is a dual group if G ~ D^* for some group D with D^*=Hom(D,Z). The existence of such groups is not obvious because dual groups are subgroups of cartesian products Z^D and therefore have very many homomorphisms into Z. If p is such a homomorphism arising from a projection of the cartesian product, then D^* ~ ker(p)+Z. In all `classical cases' of groups D of infinite rank it turns out that D^* ~ ker(p). Is this always the case? Also note that reflexive groups G in the sense of H.Bass are dual groups because by definition the evaluation map s:G-->G^{**} is an isomorphism, hence G is the dual of G^*. Assuming the diamond axiom for aleph_1 we construct a reflexive torsion-free abelian group of cardinality aleph_1 which is not isomorphic to Z+G. The result is formulated for modules over countable principal ideal domains which are not field.

Explore related subjects

Keep this discovery

BibTeXRIS

Ruediger Goebel, Saharon Shelah. 2000-03-25. Some Nasty Reflexive Groups. https://arxiv.org/abs/math/0003164

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