The Setting
Let be a probability space and let be measure-preserving maps of with for all . The family is mixing when, for all measurable sets , (1)
A measurable map to a finite alphabet reads the system as the finite-valued process . For a function , the complex observable on is centered when .
The system is observed from a second probability space through a measure-preserving map , a coupling under which is a random point of with law . On lives a family of projective characters , indexed by an abelian group , and an automorphism of moves the index along the orbit of a point . At time the observable seen through the coupling, , is paired with the character by the inner product of . The question is whether these correlations are small in modulus on average over when the process has entropy rate zero.
Projective Characters
A family of projective characters of an abelian group on a measure space is a family of -measurable functions with almost everywhere for every , with almost everywhere, with mean for every , and multiplicative up to constant phases: for all there is a complex number of modulus one with (2)✦
Word Entropy
The Shannon entropy of a function on a finite set is (3)✦ with the natural logarithm and the convention .
For maps from a set to an alphabet , the length- word map sends a point of to the word in .✦ When is finite and carries a measure , the word entropy at length is the Shannon entropy of the law of the word map: (4)✦ The process on has entropy rate zero when its word entropies satisfy as .
The Claim
Theorem 1 (Orbit cancellation). Let and be probability spaces. Let be measure-preserving maps of with , mixing in the sense of (1), and let be measure-preserving. Let be a measurable map to a finite set whose process has entropy rate zero for , and let satisfy . Let be a family of projective characters of an abelian group on , let be an automorphism of , and let . Then (5)✦ If moreover on , then (6)✦
In the paper, the result reads: for a mixing two-sided stationary process on a finite alphabet, of entropy rate zero, with shift , a centered finite-valued one-site function , any coupling , any family of projective characters , any automorphism and any , , with and standing for and .
What Is Checked
Both claims are stated over the library’s projective characters (2) and its word entropy (4), built from the length- word map and the Shannon entropy (3), with measure preservation, the rule and mixing (1) as hypotheses.