Pith. sign in

REVIEW 1 cited by

An inverse of Furstenberg's correspondence principle and applications to nice recurrence

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.19444 v1 pith:KGK5O6SR submitted 2024-07-28 math.DS

classification math.DS
keywords correspondencefurstenberginverseleftmathbbprinciplerightsubset
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We prove an inverse of Furstenberg's correspondence principle stating that for all measure preserving systems $(X,\mu,T)$ and $A\subset X$ measurable there exists a set $E \subset \mathbb{N}$ such that \[ \mu\left( \bigcap_{i=1}^k T^{-n_i}A\right) = \lim_{N\to \infty} \frac{\left|\left( \bigcap_{i=1}^k (E-n_i) \right)\cap \{0,\dots,N-1\}\right|}{N}\] for all $k,n_1,\dots,n_k \in \mathbb{N}$. As a corollary we show that a set $R\subset \mathbb{N}$ is a set of nice recurrence if and only if it is nicely intersective. Together, the inverse of Furstenberg's correspondence principle and it's corollary partially answer two questions of Moreira.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Undecidability in the Ramsey theory of polynomial equations and Hilbert's tenth problem

    math.LO 2024-12 accept novelty 8.0 of 10

    Partition regularity of polynomial equations over Z is undecidable if Hilbert's tenth problem over Q is undecidable, and over function fields it is unconditionally Pi_2^0-complete.

Pith tools