arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0608106cs.CC
收藏

Lp可计算函数与Fourier级数

Lp Computable Functions and Fourier Series

Philippe Moser

摘要:

本文研究如何以及可计算的功能可以近似的傅立叶级数。为此,我们配备了LP-可计算函数(可计算Lebesgue可积函数)的空间与大小的概念,通过引入LP-可计算Baire范畴。我们证明了Lp-可计算Baire范畴满足以下三个基本性质。单例集{f}(其中f是Lp-可计算的)是贫乏的,合适的贫乏集的无限并集是贫乏的,并且Lp-可计算函数的整个空间不是贫乏的。我们通过Banach Mazur游戏给出了另一种特征的微薄集。本文研究了Lp-可计算函数的Fourier级数的收敛性,证明了对任意p>1,每个Lp-可计算函数f的Fourier级数在Lp范数下收敛于f,而Fourier级数几乎处处不发散的L1-可计算函数的集合是贫乏的.

英文摘要:

This paper studies how well computable functions can be approximated by their Fourier series. To this end, we equip the space of Lp-computable functions (computable Lebesgue integrable functions) with a size notion, by introducing Lp-computable Baire categories. We show that Lp-computable Baire categories satisfy the following three basic properties. Singleton sets {f} (where f is Lp-computable) are meager, suitable infinite unions of meager sets are meager, and the whole space of Lp-computable functions is not meager. We give an alternative characterization of meager sets via Banach Mazur games. We study the convergence of Fourier series for Lp-computable functions and show that whereas for every p>1, the Fourier series of every Lp-computable function f converges to f in the Lp norm, the set of L1-computable functions whose Fourier series does not diverge almost everywhere is meager.

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

↑