arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2607.08064math.FAmath.GNmath.LO

可分巴拿赫格的波兰空间

Polish spaces of separable Banach lattices

Jagiellonian University(雅盖隆大学)

Mariusz Niwiński

AI总结:

研究可分巴拿赫格类的描述复杂性,引入两种波兰空间编码,证明相关空间是波兰子空间,还证明理想编码上的弗雷姆林射影张量积运算的可测性及图的性质。

摘要:

我们研究可分巴拿赫格类的描述复杂性。基于可分巴拿赫空间的编码空间理论,我们引入可分巴拿赫格的两种波兰空间编码:一种通过通用格\(\mathcal{C}=C(\Delta;L_1)\)的闭子格,另一种通过自由巴拿赫格\(\operatorname{FBL}[\ell_1]\)的闭序理想。我们证明,对于每个可分巴拿赫格\(E\),\(E\)的闭子格空间和闭序理想空间是\(E\)的闭子集超空间的波兰子空间。我们还证明理想编码上的弗雷姆林射影张量积运算为\(\boldsymbol{\Sigma}^0_2\)-可测且具有\(G_\delta\)图。

英文摘要:

We study the descriptive complexity of classes of separable Banach lattices. Building on the theory of coding spaces for separable Banach spaces, we introduce two Polish space encodings of separable Banach lattices: one via closed sublattices of the universal lattice $\mathcal{C}=C(Δ;L_1)$, and one via closed order ideals of the free Banach lattice $\operatorname{FBL}[\ell_1]$. We prove that, for every separable Banach lattice $E$, the spaces of closed sublattices and of closed order ideals of $E$ are Polish subspaces of the hyperspace of closed subsets of $E$. We also prove that the Fremlin projective tensor-product operation on ideal codes is $\boldsymbolΣ^0_2$-measurable and has a $G_δ$ graph.

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

↑