arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.06442math.SG
收藏

生成集与辛容度的可表示性

Generating sets and representability for symplectic capacities

Dušan Joksimović, Fabian Ziltener

摘要:

K.谢列巴克Hessel,J. Latschev,and F. Schlenk(CHLS)提出了在给定的辛范畴上寻找(辛)容量的最小生成集的问题。我们表明,如果类别包含一定的单参数家庭的对象,然后每一个可数Borel生成集(规范化)的能力有基数(严格)大于连续。这似乎是除D. McDuff关于4维椭球的分类。我们还证明了每个可微生成集的能力在一个给定的辛范畴是不可数的,如果该类别包含一个单参数家庭的辛流形是"严格的体积增加“和"嵌入容量明智常数”。由此可见,Ekeland-Hellman容度和体积容度并不可微地生成椭球范畴上的所有广义容度。这回答了CHLS问题的一个变体。此外,我们证明了,如果一个给定的辛范畴包含一定的单参数家庭的对象,那么几乎没有规范化的能力是域或目标表示。这为CHLS的两个核心问题提供了一些解决方案。

英文摘要:

K. Cieliebak, H. Hofer, J. Latschev, and F. Schlenk (CHLS) posed the problem of finding a minimal generating set for the (symplectic) capacities on a given symplectic category. We show that if the category contains a certain one-parameter family of objects, then every countably Borel-generating set of (normalized) capacities has cardinality (strictly) bigger than the continuum. This appears to be the first result regarding the problem of CHLS, except for two results of D. McDuff about the category of ellipsoids in dimension 4. We also prove that every finitely differentiably generating set of capacities on a given symplectic category is uncountable, provided that the category contains a one-parameter family of symplectic manifolds that is ``strictly volume-increasing'' and ``embedding-capacity-wise constant''. It follows that the Ekeland-Hofer capacities and the volume capacity do not finitely differentiably generate all generalized capacities on the category of ellipsoids. This answers a variant of a question of CHLS. In addition, we prove that if a given symplectic category contains a certain one-parameter family of objects, then almost no normalized capacity is domain- or target-representable. This provides some solutions to two central problems of CHLS.

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

↑