arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/9401218math.LO
收藏

Baire 1类函数的连续函数分解

Decomposing Baire class 1 functions into continuous functions

Saharon Shelah, Juris Steprāns

摘要:

设dec是使第一Baire类的每个函数都能分解为kappa连续函数的最小基数kappa。Cichon,Morayne,Pawlikowski和Solecki证明了cov(Meager)<= dec <= d,并询问这些不等式是否可以始终严格。cov(Meager)表示覆盖实数线所需的最少数量的闭无处稠密集,d表示Ω ^Ω中的控制族的最小基数。Steprans证明了cov(Meager)不= dec是一致的。本文证明了第二个不等式也可以严格化。dec不同于d的模型是通过将ω_2 Miller -有时称为超完美或理性完美实数添加到连续统假设的模型中获得的模型。有些令人惊讶的是,用于建立另一个不等式cov(Meager)not= dec的一致性的模型是对超完美强迫迭代的轻微修改。

英文摘要:

Let dec be the least cardinal kappa such that every function of first Baire class can be decomposed into kappa continuous functions. Cichon, Morayne, Pawlikowski and Solecki proved that cov(Meager) <= dec <= d and asked whether these inequalities could, consistently, be strict. By cov(Meager) is meant the least number of closed nowhere dense sets required to cover the real line and by d is denoted the least cardinal of a dominating family in omega^omega. Steprans showed that it is consistent that cov(Meager) not= dec. In this paper we show that the second inequality can also be made strict. The model where dec is different from d is the one obtained by adding omega_2 Miller - sometimes known as super-perfect or rational-perfect - reals to a model of the Continuum Hypothesis. It is somewhat surprising that the model used to establish the consistency of the other inequality, cov(Meager) not= dec, is a slight modification of the iteration of super-perfect forcing.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑