SearcharxivSearch

arXiv · 1011.1524

Productivity of sequences with respect to a given weight function

Abstract

Given a function f: N --> (omega+1)-{0}, we say that a faithfully indexed sequence {a_n: n in N} of elements of a topological group G is: (i) f-Cauchy productive (f-productive) provided that the sequence {prod_{n=0}^m a_n^{z(n)}: m in N} is left Cauchy (converges to some element of G, respectively) for each function z: N --> Z such that |z(n)| <= f(n) for every n in N; (ii) unconditionally f-Cauchy productive (unconditionally f-productive) provided that the sequence {a_{s(n)}: n in N\} is (f\circ s)-Cauchy productive (respectively, (f\circ s)-productive) for every bijection s: N --> N. (Bijections can be replaced by injections here.) We consider the question of existence of (unconditionally) f-productive sequences for a given "weight function" f. We prove that: (1) a Hausdorff group having an f-productive sequence for some f contains a homeomorphic copy of the Cantor set; (2) if a non-discrete group is either locally compact Hausdorff or Weil complete metric, then it contains an unconditionally f-productive sequence for every function f: N--> N; (3) a metric group is NSS if and only if it does not contain an f_omega-Cauchy productive sequence, where f_omega is the function taking the constant value omega. We give an example of an f_omega-productive sequence {a_n: n in N} in a (necessarily non-abelian) separable metric group H with a linear topology and a bijection s: N --> N such that the sequence {prod_{n=0}^m a_{s(n)}: m in N} diverges, thereby answering a question of Dominguez and Tarieladze. Furthermore, we show that H has no unconditionally f_omega-productive sequences. As an application of our results, we resolve negatively a question from C_p(-,G)-theory.

Explore related subjects

Keep this discovery

BibTeXRIS

Dikran Dikranjan, Dmitri Shakhmatov, Jan Spěvák. 2010-11-05. Productivity of sequences with respect to a given weight function. https://doi.org/10.1016/j.topol.2010.11.009

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

KEEP EXPLORING

Related papers

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.

math.GN

A continuous $3$-distributive frame that is not $\omega$-distributive

We give a negative answer to the question, posed by Ern\'e, whether every $3$-distributive lattice is $\omega$-distributive. More precisely, we exhibit a continuous frame that is $\kappa$-distributive for every integer $\kappa\geq 2$, but is not a wide coframe. The frame is the open-set lattice of a compact, locally compact, countably based $T_0$ topological meet-semilattice, obtained from Lawson's construction in the logarithmic form described by Goubault-Larrecq. The failure of $\omega$-distributivity is witnessed by an explicit matrix with countably many nonempty finite rows: all row joins are the same nonzero element, whereas every choice of one entry from each row has meet zero. The same space answers negatively Ern\'e's accompanying question whether every $4$-web space is a wide web space. All properties of the construction needed for these conclusions are proved directly.

math.GN

An overlooked weakening of perfect normality: Perfect regularity in spaces and locales

We introduce the notion of perfect regularity as an appropriate weakening of perfect normality, both for spaces and locales. Various characterizations are given, using Dedekind-MacNeille completions, injective hulls, and sublocales. We place the new class of perfectly regular frames among various well-studied classes of frames. We also introduce the construction of perfect regularization of a completely regular frame, compare it to Isbell's well-known booleanization construction, and argue that it is at least as important as the latter.

math.GN