arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.02039math.DSmath.CV
收藏

关于类多项式映射大熵测度支撑集的研究

On the support of measures of large entropy for polynomial-like maps

Sardor Bazarbaev, Fabrizio Bianchi, Karim Rakhimov

AI总结:

本文研究类多项式映射中熵大于阈值 $\log \sqrt{d_{k-1} d_t}$ 的遍历测度,证明其支撑集必为 Julia 集,并基于测度指数收敛性给出不依赖 Green 流的新证明。

摘要:

设 $f$ 是一个具有主导拓扑次数 $d_t\geq 2$ 的类多项式映射,并设 $d_{k-1}<d_t$ 为其 $k-1$ 阶动力学次数。我们证明,任何测度论熵严格大于 $\log \sqrt{d_{k-1} d_t}$ 的遍历测度,其支撑集都落在 Julia 集上,即唯一最大熵测度 $μ$ 的支撑集上。该证明基于测度 $d_t^{-n}(f^n)^*δ_a$ 向 $μ$ 的指数收敛速度,这一收敛速度对一般点 $a$ 成立,且带有依赖于 $a$ 的受控误差界。我们的证明还给出了在 $\mathbb P^k(\mathbb C)$ 自同态情形下同一结论的一个新证明——该结果最初由 de Thélin 和 Dinh 得到——并且这一新证明不依赖于 Green 流的存在性。

英文摘要:

Let $f$ be a polynomial-like map with dominant topological degree $d_t\geq 2$ and let $d_{k-1}<d_t$ be its dynamical degree of order $k-1$. We show that the support of every ergodic measure whose measure-theoretic entropy is strictly larger than $\log \sqrt{d_{k-1} d_t}$ is supported on the Julia set, i.e., the support of the unique measure of maximal entropy $μ$. The proof is based on the exponential speed of convergence of the measures $d_t^{-n}(f^n)^*δ_a$ towards $μ$, which is valid for a generic point $a$ and with a controlled error bound depending on $a$. Our proof also gives a new proof of the same statement in the setting of endomorphisms of $\mathbb P^k(\mathbb C)$ - a result due to de Thélin and Dinh - which does not rely on the existence of a Green current.

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

↑