The Setting
Let be a measurable automorphism of a standard Borel space . Consider an extension of whose points, the states, lie over the points of a space of parameters, and a joining of copies of this extension. Bounded functions on the states, one for each copy, have a nonzero joint integral under the joining. Then each of them correlates with lines, circle-valued functions on the fibres over the parameters, taken modulo constant phases and exact for the joining, and a finite block of such lines carries part of the correlation. The block sits in a group of lines over one parameter and is shifted by an automorphism of that group; a copy of the group and of the block is found over almost every parameter, the labels of the lines move with time by a fixed shift, and the coefficients of the function summed over the block have positive integral. At later times, the sums for the function moved by time over the moved block follow from the sum at time zero one step at a time.
The library states this for an array object, an extension carrying laws on arrays of all orders, the joining being its law on arrays of order one. Lines are labelled by Hilbert codes, a label being a parameter together with a Hilbert code; the exact lines over a parameter form the fibre of a set of labels, and a block is cut out by a measurable labelling, a measurable map on labels with values in the functions on .
Arrays and Array Objects
Fix a finite set of slots. An array of order over a space is a function from the index tuples to , a point of ✦, and a map of acts on arrays coordinatewise✦. The plane restriction fixing axis of an array of order at a slot is the array of order read off at the index tuples with inserted at position .✦ Arrays of order zero are the points of ✦, and an array of order one is a tuple , its entry being its plane at ✦.
Initial array laws for are probability measures on , one for each , that are invariant under acting coordinatewise, consistent, every plane restriction carrying to , and proper: for every subset of , the planes of the last axis at the slots of are independent under , each with law .✦
An array object over these laws consists of a standard Borel space of states with an automorphism and a measurable factor map with , a standard Borel space of parameters with an automorphism and a measurable parameter map with , and probability measures on , invariant under , carried by to , consistent and proper as above.✦ Two further conditions tie the laws to the parameters. Given the parameter array, obtained by applying coordinatewise, the last-axis planes at the slots of a subset are conditionally independent under , the plane at having the conditional law under of an array given its parameter array, evaluated at the plane of the parameter array at ; and under the maps and are independent.
The conditional law under of a state given its parameter is a Markov kernel from to ✦, and the parameter law is the law of the parameter✦. In the same way is the conditional law under of an array of order one given its parameter array , with entries , a kernel from to ✦, and is the law of ✦.
An extension of by an array object over the same initial laws is a pair of measurable maps, from the states of to those of and from the parameters of to those of , that intertwine the automorphisms, satisfy and , and make , acting coordinatewise, measure preserving from to for every .✦ Pulling back along is the linear isometry from to .✦
On the arrays of order an array object has data fields, sub--algebras of the Borel sets of : the parameter field and, for each slot , the outside field and the enlarged field . An array object is saturated if, for every extension of by an array object , every order , every kind of data field and every , the identity (1) holds, where and are conditional expectations under and , and is taken in on the left and in on the right. (1)✦
Codes and Exact Lines
For a probability measure on , the projective circle group of is the quotient of the group of measurable maps from to the unit circle , under pointwise multiplication, by the subgroup of maps -almost everywhere equal to a constant.✦ A line over a parameter is an element of the projective circle group of .
For a finite measure on , the Hilbert test sequence of enumerates, as vectors of , the simple functions with rational and and sets in the algebra generated by a fixed countable generating family of the Borel sets of .✦ A Hilbert code for is a pair of a base point and a sequence of nonnegative reals such that, for the test sequence of and all and , (2)✦ It locates a vector of whose distance to is for every ✦, and every vector of has its code at , the sequence of its distances to the ✦. The Hilbert codes for form a standard Borel space . A code is canonical if the first not orthogonal to its vector has a positive real inner product with it✦, and unimodular if its vector has modulus one -almost everywhere✦. The code representative of a Hilbert code for is the pointwise limit on , as , of , where is the first index with .✦ The circle representative of is a map equal to wherever .✦ The class of in the projective circle group of is the projective class of at a parameter .✦
A label is a pair of a parameter and a Hilbert code for .✦ The absolute coefficient of a function on at a label is (3)✦ Time acts on labels by the label time map (4)✦ where, for a code with base point , is the code at of the class of in , multiplied by the constant phase that makes its first nonzero coefficient against the test sequence positive✦.
Let be a kernel from to . A pair of a parameter array and a tuple of Hilbert codes is exact for if each is canonical and unimodular with base point and (5)✦ The line graph of at a slot is the set of pairs with for some exact pair ; the exact lines of at over are the codes with in it. A set of labels has the fibres , and its fibres are the exact lines of when: (6)
Blocks
A Borel enumeration of the fibres of is a sequence of Borel sets and measurable maps such that for , every label has for some with , and whenever and .✦ The fibre sum along of a function on labels is the function on .✦ For a measurable map on labels and a value , the restriction of to the labels of at level of is the sequence with the same maps and with the sets replaced by .✦
Label orbit vectors are the functions ✦, and the second label shift is the measurable automorphism of with ✦. Let be a measurable labelling. For a level and a function on , the moving sum at time is the fibre sum, along restricted to the level of , of the coefficients of : (7)✦
For a parameter , the local projective group is the subgroup of the projective circle group of generated by the classes of the codes .✦ For , let be a chosen code with when there is one, and the code of the zero vector at otherwise✦; the block map of at is ✦.
A positive block of a function on , for and , consists of a measurable labelling , a base parameter , a level and an automorphism of the group with the following properties.✦ The block is finite, and shifts block values: (8) For -almost every there is a group isomorphism with for every . The labels obey the time law (9) and the moving sum of at level satisfies (10) We write for the set of positive blocks of .
The Claim
Theorem 1. Let be a saturated array object with at least three slots. Let be a kernel from to that equals at -almost every parameter array and whose marginal at each slot is at every , let be a set of labels whose fibres are the exact lines of as in (6), and let be a Borel enumeration of the fibres of . Let , , be measurable functions on with and , and let . Then (11)✦ If moreover, for every and every , the coordinates , , are independent under , if the set of exact pairs for and the exact square set of (the pairs of a parameter array of order two and an matrix of codes whose row at each is exact for over the plane of fixing the first axis at and whose column at each is exact for over the plane of fixing the last axis at ) have Borel enumerations of their fibres in the same sense, and if are two indices of , then has a positive block: (12)✦ Moreover, for every measurable labelling obeying the time law (9), every level , every function on and every , the moving sums (7) satisfy (13)✦
In the paper, the result reads: over the zero-entropy witness of Proposition 2.1 there are , a countable abelian group , an automorphism , a finite nonempty and such that, for -almost every , the measure has -marginal and representatives obeying the projective character laws, and the sums are measurable and bounded by , with for every . Here is a measure on for each parameter , is a measure on , and the are functions on , all in the paper’s notation.
What Is Checked
The claim is stated over a saturated array object with at least three slots, its laws and , the conditional laws and with the parameter laws and , Hilbert codes for with their circle representatives and absolute coefficients (3), a kernel with a set of labels whose fibres are its exact lines, a Borel enumeration of these fibres, and, for the blocks, the local projective groups , the label shift and the label time .
The library also proves that the circle representative of every Hilbert code is a measurable map✦, that every measurable map from to is square integrable for a finite measure✦, that the code at of , before its phase is fixed, is unimodular✦, and that every unimodular code has a nonzero coefficient against its test sequence✦.