Bernoulli coding map and almost sure invariance principle for endomorphisms of $\mathbb{P}^k$
Christophe Dupont

TL;DR
This paper establishes an almost sure invariance principle for holomorphic endomorphisms of projective space, using a Bernoulli coding map, which leads to statistical properties and a new proof of measure absolute continuity.
Contribution
It introduces a Bernoulli coding map for endomorphisms of projective space and proves an almost sure invariance principle for a broad class of observables, including unbounded functions.
Findings
Proves an almost sure invariance principle for $(P^k,f,)$.
Establishes the Central Limit Theorem and statistical properties for the class of observables.
Provides a direct proof of measure absolute continuity when Pesin's formula holds.
Abstract
Let be an holomorphic endomorphism of and be its measure of maximal entropy. We prove an Almost Sure Invariance Principle for the systems . Our class of observables includes the H\"older functions and unbounded ones which present analytic singularities. The proof is based on a geometric construction of a Bernoulli coding map . We obtain the invariance principle for an observable on by applying Philipp-Stout's theorem for on . The invariance principle implies the Central Limit Theorem as well as several statistical properties for the class . As an application, we give a \emph{direct} proof of the absolute continuity of the measure when it satisfies Pesin's formula. This approach relies on the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Computability, Logic, AI Algorithms · Mathematical and Theoretical Analysis
