{'fraction_non_alphanumeric': 0.06292736101476563, 'fraction_numerical': 0.00693687444257259, 'mean_word_length': 3.6293577981651377, 'pattern_counts': {'":': 0, '<': 1, '<?xml version=': 0, '>': 7, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 4, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Correspondence Principle for the Gowers Norms

We give a variation of the Furstenberg Correspondence which preserves the Gowers uniformity norms.


Introduction
Informally speaking, the Furstenberg Correspondence [5,6] shows that the "local behavior" of a dynamical system is controlled by the behavior of sufficiently large finite systems. By the local behavior of a dynamical system (X, B, µ, G), we mean the properties which can be stated using finitely many actions of G and the integral given by µ 1 . By a finite system, we just mean (S, P(S), c, G) where G is a infinite group, S is a finite quotient of G, and c is the counting measure c(A) := |A| |S| . The most well known example of such a property is the ergodic form of Szemerédi's Theorem: For every k, every ǫ > 0, and every L ∞ function f , if f dµ ≥ ǫ then there is some n such that k−1 j=0 T −jn f dµ > 0.
The Furstenberg Correspondence shows that this is equivalent to the following statement of Szemerédi's Theorem: For every k and every ǫ > 0, there is an N and a δ > 0 such that if m ≥ N and f : [0, m − 1] → [− 1,1] is such that f dc ≥ ǫ then there is some n such that k−1 j=0 f (x + jn)dc(x) ≥ δ.
In general, the Furstenberg Correspondence states that, given a sequence of functions on increasingly large finite systems, a single function on a single infinite system can be given with the property that suitable calculations are controlled by the limit of the value of analogous calculations in the finite systems.
Recent work [9,1,3,4,11,12] has extended this correspondence both to other specific properties and to more general formulations. These methods are not adequate, however, for the study of the uniformity norms introduced for finite systems by Gowers in [7] and for infinite systems by Host and Kra in [8]. While the are strong reasons for believing that functions on finite systems with small Gowers norm should correspond to functions on infinite systems with small Gowers-Host-Kra norm, these norms are not local. In particular, the ordinary correspondence may place a sequence of highly k-uniform functions (that is, functions with || · || U k going to zero) in correspondence with a function with large U k norm.
In [10], Tao and Ziegler give a variant of the correspondence principle which preserves the U k norms when the group G is vector space over a finite field, F ω p . Their argument, however, takes advantage of group theoretic properties of F p , and does not immediately extend to other groups.
In this paper we give a similar correspondence for arbitrary countable Abelian groups. While there is no theoretical obstacle to giving the construction explicitly in a style similar to [10], the resulting argument would be quite unwieldy. Roughly speaking, where Tao and Ziegler can choose representative transformations randomly and expect that almost all choices suffice, here we have to choose particular transformations. It is much more convenient to do the work of choosing the correct transformations in an infinitary ergodic setting; the price is that we use an argument from nonstandard analysis to give a highly infinitary system acted on by a very large group, and then use ergodic methods to reduce the group down to something more manageable. For the sake of readers unfamiliar with nonstandard analysis, we isolate its use in a single lemma.
In Section 2 we lay the ergodic-theoretic groundwork for the correspondence, and in Section 3 we give the correspondence argument itself.

Choosing a Good Subgroup
Because of the nature of the intermediate object which will be produced by the nonstandard argument in Section 3, we want to work with a fairly general notion of a dynamical system. Definition 2.1. A dynamical system consists of a probability measure space (X, B, µ) together with an Abelian group G, an action of G on X such that for each g ∈ G, the action T g : X → X is measurable, and a finitely additive G-invariant probability measure space (G, C, λ).
Usually G is taken to be countable and C is taken to be the powerset of G, which is possible since λ is only required to be finitely additive. Here, however, we need to include the case where G is uncountable and C is not the full powerset of G. We do not require that the action of G on X be a measurable function from G × X to X, since we need actions where this is not true. Instead we only ask for the weaker condition that Fubini's Theorem holds.

Definition 2.2.
Given a bounded function f and a group G, define F (f, G) to be the collection of functions containing f and the function constantly equal to 1, and closed under pairwise sums, pairwise multiplication, scalar multiplication by a rational, and shifts from G.
Clearly F (f, G) is countable as long as G is.

Definition 2.3. We say a bounded, measurable function
The requirement that the condition hold for every x could be weakened to almost every x without much trouble.
In this context, the Mean Ergodic Theorem can be taken to be the following: It will be convenient to extend groups by a single element while preserving the Fubini property.

Definition 2.4. Let H be a subgroup of G and suppose f is Fubini for
Note that the choice of measure on H ′ g is not canonical, but the Mean Ergodic Theorem tells us that the choice will not matter. Proof.
Since h → f (T h x) is measurable on H, it is also measurable on H ′ g (since we have taken the product with a discrete set). Measurability of The following definition and the basic properties of such norms are taken from [8]. For any L ∞ function f , define Proof. We show by induction on k that For k = 0, this is immediate. Assume the claim holds for k. Then The following property is easily seen by induction: It will be convenient to use a slight generalization of the U k norm, in which a different group is used at the top-most level.

Proof.
Note that a similar claim for the U 0 norm would be trivial, since the premise could never hold (the U 0 norm is independent of Γ). Observe that H)), this quantity is equal to Suppose that for every g ∈ Γ, ||f ′ − T [k] contradicting the assumption. Proof. We will construct H so that there is a natural map π : Z ω → H. Then we may chose an ordering of order-type ω of pairs (ǫ, F ) where F is a code for an element of F (f, H). We set H 0 := G, and for each n, set H n+1 := (H n ) ′ g where g is chosen so that ||F n || U k (Γ,Hn+1) ≤ ||F n || U k (Γ) + ǫ n (where (ǫ n , F n ) is the n-th element in our ordering). Take H := n<ω H n . Then for every F ∈ F(f, H) and every ǫ > 0, for sufficiently large n, ||F || U k (Γ,Hn) ≤ ||F || U k (Γ) + ǫ. H is a subgroup of Γ, so ||F || U k (Γ) ≤ ||F || U k (Γ,H) , and therefore ||F || U k (Γ) = ||F || U k (Γ,H) . (X, B, µ), (Γ, C, λ) be a dynamical system, let G be a countable subgroup of Γ, and let f be bounded and Fubini. Then there is a discrete subgroup H of Γ containing G such that ||F || U k (H) = ||F || U k (Γ) for every F ∈ F(f, H).

Theorem 2.2. Let
Proof. Let H be as given in the preceeding lemma and proceed by induction on k. For k = 0, this is trivial. Assume the result holds for k. Then For any ǫ > 0, we may choose i so that this is within ǫ of But for sufficiently large i, ||F || 2 k+1 U k+1 (Γ,Hi) is arbitrarily close to ||F || 2 k+1 U k+1 (Γ) . So, taking the limit as i → ∞, we have

A Correspondence Principal
To set up the appropriate analogy between different dynamical systems, we need the notion of a representative of an element of F (·, G).

Definition 3.1. Let F (G) be a set of symbols defined inductively by:
• c ∈ F(G) • 1 ∈ F(G) • If f, g ∈ F(G) then f + g and f · g belong to F (G) • If h ∈ G and f ∈ F(G) then T h f ∈ F(G) • If f ∈ F(G) and q is a rational then qf ∈ F(G) If f ∈ F(G) and f is a bounded Fubini function in a dynamical system, we define f(f ) recursively by: • c(f ) := f • 1(f ) := 1 (the function constantly equal to 1) It is easy to see that g ∈ F(f, G) iff there is a f ∈ F(G) such that g = f(f ). Lemma 3.1. Let G be a countable Abelian group, let N be an infinite set of integers, and for each N ∈ N , let S N be a finite quotient of G, π N : G → S N , with |S N | → ∞. Let f N : S N → D be given. There is a dynamical system (X, B, µ, Γ), a measure space (Γ, C, λ), a homomorphism π : G → Γ, and a measurable Fubini function f : X → D such that for any f ∈ F(G), Additionally, if for every g, h ∈ G, g = h, π N (g) = π N (h) except for finitely many N ∈ N then π(g) = π(h).
Proof. Fix a non-principle ultrafilter U and form the nonstandard extension of a universe containing the sequences N , f N , S N . The sequence N codes a nonstandard integer a and S a is a hyperfinite Abelian group. By the Loeb measure construction, the internal subsets of S a may be extended to a σ-algebra on S a , and the sequence f N represents an internal function F : S a → D * . The function f = st • F is then a measurable function from S a to D.
This same measure space is also (Γ, C, λ), with Γ acting on S a = Γ by the group action. Since F is internal, for any x ∈ S a , the functions g → f (T g x) and x → f (T g x)dλ are the result of applying the standard part operation to internal functions, and are therefore measurable, and the same applies to any element of F (f, Γ). So f is Fubini. The embedding π : G → Γ is simply the embedding represented by the sequence π N .
The final clause follows from transfer. For instance, if lim inf N ∈N ||f N || U k (SN ) ≥ α then for each ǫ > 0 and all but finitely many N in N , Applying this argument for arbitrary f ∈ F(G), and the analogous argument for the upper bound, gives the claim.
As shown in the previous section, there is a discrete subgroup H of Γ containing G such that for each F ∈ F(f, H), ||F || U k (H) = ||F || U k (Γ) . Putting this together, we obtain the following theorem: Theorem 3.1. Let G be a countable Abelian group, let N be an infinite set of integers, and for each N ∈ N , let S N be a finite quotient of G, π N : G → S N , with |S N | → ∞. Let f N : S N → D be given. Then there is a dynamical system (X, B, µ, H) and an L ∞ function f such that for any f ∈ F(G), for each k.