scholarly journals More on bases of uncountable free abelian groups

2020 ◽  
Author(s):  
Noam Greenberg ◽  
Linus Richter ◽  
Saharon Shelah ◽  
Daniel Turetsky

We extend results found by Greenberg, Turetsky, and Westrick in [7] and investigate effective properties of bases of uncountable free abelian groups. Assuming V = L, we show that if κ is a regular uncountable cardinal and X is a ∆11(Lκ) subset of κ, then there is a κ-computable free abelian group whose bases cannot be effectively computed by X. Unlike in [7], we give a direct construction.

2020 ◽  
Author(s):  
Noam Greenberg ◽  
Linus Richter ◽  
Saharon Shelah ◽  
Daniel Turetsky

We extend results found by Greenberg, Turetsky, and Westrick in [7] and investigate effective properties of bases of uncountable free abelian groups. Assuming V = L, we show that if κ is a regular uncountable cardinal and X is a ∆11(Lκ) subset of κ, then there is a κ-computable free abelian group whose bases cannot be effectively computed by X. Unlike in [7], we give a direct construction.


2018 ◽  
Vol 167 (02) ◽  
pp. 229-247
Author(s):  
TAKAO SATOH

AbstractIn this paper, we study “the ring of component functions” of SL(2, C)-representations of free abelian groups. This is a subsequent research of our previous work [11] for free groups. We introduce some descending filtration of the ring, and determine the structure of its graded quotients.Then we give two applications. In [30], we constructed the generalized Johnson homomorphisms. We give an upper bound on their images with the graded quotients. The other application is to construct a certain crossed homomorphisms of the automorphism groups of free groups. We show that our crossed homomorphism induces Morita's 1-cocycle defined in [22]. In other words, we give another construction of Morita's 1-cocyle with the SL(2, C)-representations of the free abelian group.


2015 ◽  
Vol 14 (10) ◽  
pp. 1550139 ◽  
Author(s):  
José L. Rodríguez ◽  
Lutz Strüngmann

In this paper, we first show that for every natural number n and every countable reduced cotorsion-free group K there is a short exact sequence [Formula: see text] such that the map G → H is a cellular cover over H and the rank of H is exactly n. In particular, the free abelian group of infinite countable rank is the kernel of a cellular exact sequence of co-rank 2 which answers an open problem from Rodríguez–Strüngmann [J. L. Rodríguez and L. Strüngmann, Mediterr. J. Math.6 (2010) 139–150]. Moreover, we give a new method to construct cellular exact sequences with prescribed torsion free kernels and cokernels. In particular we apply this method to the class of ℵ1-free abelian groups in order to complement results from the cited work and Göbel–Rodríguez–Strüngmann [R. Göbel, J. L. Rodríguez and L. Strüngmann, Fund. Math.217 (2012) 211–231].


Author(s):  
Oteo Mutzbauer

AbstractA composition sequence for a torsion-free abelian group A is an increasing sequenceof pure subgroups with rank 1 quotients and union A. Properties of A can be described by the sequence of types of these quotients. For example, if A is uniform, that is all the types in some sequence are equal, then A is complete decomposable if it is homogeneous. If A has finite rank and all permutations ofone of its type sequences can be realized, then A is quasi-isomorphic to a direct sum of uniform groups.


2018 ◽  
Vol 18 (01) ◽  
pp. 1850002
Author(s):  
Alexander G. Melnikov

We prove that for any computable successor ordinal of the form [Formula: see text] [Formula: see text] limit and [Formula: see text] there exists computable torsion-free abelian group [Formula: see text]TFAG[Formula: see text] that is relatively [Formula: see text] -categorical and not [Formula: see text] -categorical. Equivalently, for any such [Formula: see text] there exists a computable TFAG whose initial segments are uniformly described by [Formula: see text] infinitary computable formulae up to automorphism (i.e. it has a c.e. uniformly [Formula: see text]-Scott family), and there is no syntactically simpler (c.e.) family of formulae that would capture these orbits. As far as we know, the problem of finding such optimal examples of (relatively) [Formula: see text]-categorical TFAGs for arbitrarily large [Formula: see text] was first raised by Goncharov at least 10 years ago, but it has resisted solution (see e.g. Problem 7.1 in survey [Computable abelian groups, Bull. Symbolic Logic 20(3) (2014) 315–356]). As a byproduct of the proof, we introduce an effective functor that transforms a [Formula: see text]-computable worthy labeled tree (to be defined) into a computable TFAG. We expect that this technical result will find further applications not necessarily related to categoricity questions.


1989 ◽  
Vol 39 (1) ◽  
pp. 21-24 ◽  
Author(s):  
H.P. Goeters ◽  
C. Vinsonhaler ◽  
W. Wickless

Let G be a torsion-free abelian group of finite rank n and let F be a full free subgroup of G. Then G/F is isomorphic to T1 ⊕ … ⊕ Tn, where T1 ⊆ T2 ⊆ … ⊆ Tn ⊆ ℚ/ℤ. It is well known that type T1 = inner type G and type Tn = outer type G. In this note we give two characterisations of type Ti for 1 < i < n.


2012 ◽  
Vol 77 (4) ◽  
pp. 1067-1100 ◽  
Author(s):  
Brooke M. Andersen ◽  
Asher M. Kach ◽  
Alexander G. Melnikov ◽  
Reed Solomon

AbstractWe show, for each computable ordinal α and degree a > 0(α), the existence of a torsion-free abelian group with proper αth jump degree a.


1997 ◽  
Vol 17 (4) ◽  
pp. 757-782 ◽  
Author(s):  
SERGEY I. BEZUGLYI ◽  
VALENTIN YA. GOLODETS

The notion of dynamical entropy for actions of a countable free abelian group $G$ by automorphisms of $C^*$-algebras is studied. These results are applied to Bogoliubov actions of $G$ on the CAR-algebra. It is shown that the dynamical entropy of Bogoliubov actions is computed by a formula analogous to that found by Størmer and Voiculescu in the case $G={\bf Z}$, and also it is proved that the part of the action corresponding to a singular spectrum gives zero contribution to the entropy. The case of an infinite number of generators has some essential differences and requires new arguments.


2013 ◽  
Vol 25 (5) ◽  
pp. 967-1038
Author(s):  
Saharon Shelah

Abstract. We deal with some pcf (possible cofinality theory) investigations mostly motivated by questions in abelian group theory. We concentrate on applications to test problems but we expect the combinatorics will have reasonably wide applications. The main test problem is the “trivial dual conjecture” which says that there is a quite free abelian group with trivial dual. The “quite free” stands for “-free” for a suitable cardinal , the first open case is . We almost always answer it positively, that is, prove the existence of -free abelian groups with trivial dual, i.e., with no non-trivial homomorphisms to the integers. Combinatorially, we prove that “almost always” there are which are quite free and have a relevant black box. The qualification “almost always” means except when we have strong restrictions on cardinal arithmetic, in fact restrictions which hold “everywhere”. The nicest combinatorial result is probably the so-called “Black Box Trichotomy Theorem” proved in ZFC. Also we may replace abelian groups by R-modules. Part of our motivation (in dealing with modules) is that in some sense the improvement over earlier results becomes clearer in this context.


1969 ◽  
Vol 12 (4) ◽  
pp. 475-478 ◽  
Author(s):  
J. D. Tarwater ◽  
R. C. Entringer

The number of elements in the sum A + B of two complexes A and B of a group G which have multiple representations a + b = a '+ b' has been investigated by Scherk and Kemperman [1]. Kemperman [2] appealed to transfinite techniques (to order G) to prove:If G is a torsion-free abelian group with finite subsets A and B with | B | ≥ 2, then at least two elements c of A + B admit exactly one representation c = a + b.


Sign in / Sign up

Export Citation Format

Share Document