On the refinement and countable refinement numbers
type: Item
instance of: scholarly article
zbMATH Open document ID: 0966.03046
author: Jörg Brendle
author: Winfried Just
author: Claude Laflamme
publication date: 2001-07-24T00:00:00Z
Mathematics Subject Classification ID: 03E17
Mathematics Subject Classification ID: 03E35
Mathematics Subject Classification ID: 03E05
zbMATH DE Number: 1570972
zbMATH Keywords: cardinal invariants
zbMATH Keywords: refinement number
zbMATH Keywords: countable refinement number
zbMATH Keywords: dominating number
MaRDI profile type: Publication
Recommended article: A Comment on “ 𝔭 < t”
Recommended article: Almost Disjoint Families and Diagonalizations of Length Continuum
Recommended article: The linear refinement number and selection theory
Recommended article: General topology meets model theory, on 𝔭 and 𝔱
Recommended article: Q4732462
Recommended article: The cofinality of cardinal invariants related to measure and category
Recommended article: A proof of morley's conjecture
Recommended article: Adding eventually different reals
Recommended article: Cofinality spectrum theorems in model theory, set theory, and general topology
Recommended article: The ultrafilter and almost disjointness numbers
title: On the refinement and countable refinement numbers
published in: Questions and Answers in General Topology
review text: In his paper ``More on set-theoretic characteristics of summability of sequences by regular (Toeplitz) matrices'' [Commentat. Math. Univ. Carolinae 29, 97-102 (1988; Zbl 0653.40002)], \textit{P. Vojtaš} defined \(\mathfrak t\) and \(\mathfrak t_\sigma\), two cardinal invariants of the continuum called the refinement number and countable refinement number, respectively. From their definition it is immediate that \(\mathfrak t\leq\mathfrak t_\sigma\). Vojtaš asked whether they are actually equal. NEWLINENEWLINENEWLINEThe authors of this paper investigate the possibility that \(\mathfrak t <\mathfrak t_\sigma\) is consistent with ZFC. The smallest size of an ultrafilter base on the natural numbers and the dominating number play a role in their investigation. A typical result is: \(\mathfrak t <\mathfrak t_\sigma\) cannot be obtained by a countable support iteration of length \(\omega_2\) of proper posets of continuum size over a model of CH. The authors conclude that current forcing machinery may be insufficient to the establish the consistency of \(\mathfrak t <\mathfrak t_\sigma\). Of course, as they point out, it may be the case that \(\mathfrak t =\mathfrak t_\sigma\) is a theorem of ZFC.
reviewed by: J. M. Plotkin
description: scientific article