The Setting
Consider stationary random arrays of states in which every state carries a parameter. Given the parameters of a tuple of states, one state for each slot, which circle-valued functions of the state at one slot are matched exactly by functions of the states at the other slots, and can these exact lines be labelled measurably by the parameter of their own slot, compatibly with products and with time?
A standard Borel space is a nonempty set with a -algebra under which it is isomorphic to a Polish space with its Borel sets.✦ Fix one, , with a measurable automorphism , and a finite index set , whose elements are called slots. An array of order over a space is a function from the index tuples to , a point of ✦, and a map acts on arrays entrywise, as .✦ Arrays of order zero are points of ✦, arrays of order one are tuples , and arrays of order two are squares . The plane of an array of order that fixes axis at slot is the array of order whose entry at is the entry at the tuple obtained by inserting into at position .✦
Initial array laws of are probability measures on , one for each order , each invariant under acting entrywise.✦ Initial array laws of are consistent if every plane of an array drawn from has law , and proper if, for every subset of other than , the planes that fix the last axis at the slots of are independent under , each with law .
An array object over initial array laws of consists of a standard Borel space of states with an automorphism , a standard Borel space of parameters with an automorphism , measurable maps and with and , and probability measures on that are invariant under , consistent and proper in the same sense, and carried to by acting entrywise.✦ Write for the conditional law under of an array given that its parameter array, applied entrywise, is ; it is a Markov kernel from to .✦ Moreover, an array object is conditionally local: given the parameter array of an array drawn from , the planes that fix the last axis at the slots of any are independent, the one at slot with law at the plane of at slot . Also, an array object is locally independent: under the maps and are independent.
The parameter law of order is the law of the parameter array under : on at order zero, on at order one.✦ At order zero, write for the law of a state with parameter , and , a complex Hilbert space; at order one, write for a parameter tuple.
Let be a Markov kernel from to such that, for every and , the coordinate has law under and the coordinates , , are independent under . A Markov kernel from to is a version of if for -almost every .
Extensions and Saturation
An extension of by an array object over the same initial laws is a pair of measurable maps, between the state spaces and between the parameter spaces, each intertwining the automorphisms, with and , such that carries to for every .✦ The pullback of an extension at order is the linear isometry from to .✦
A data field of an object is named by its kind : the parameter field , or for a slot the outside field or the enlarged field , each a -algebra on the arrays of order . The projection is the conditional expectation onto the data field of kind of , the orthogonal projection of onto the functions measurable for that field.✦ The object is saturated if these projections commute with every pullback: (1)✦ for every extension of by an array object , every order , every kind and every .
Hilbert Codes
Fix a countable family of sets generating the -algebra of , and take the algebra of sets that it generates.✦ The test functions are the finite sums with coefficients and sets in that algebra✦; an enumeration of them, fixed once and for all, gives every finite measure on its test sequence in ✦.
A Hilbert code for is a pair of a base point and a real sequence that is a distance code for the test sequence of : for all indices and , (2)✦ The decoded vector of is a vector of with for every ✦, and the code of a vector is .✦ The representative of is the function on whose value at is the limit, as , of , the test function read pointwise, where is the least index with .✦
The distance between two codes is the distance in between their representatives, the base point of .✦ A code with base point is unimodular if holds -almost everywhere✦, and canonical if its decoded vector has a positive real inner product at the first index for which , a condition that fixes the phase of .✦
Exact Lines and Labels
Let be a parameter tuple. A tuple of canonical unimodular codes, with base point , is exact over if (3)✦ and is the set of exact tuples over . The exact lines at slot over are the codes found at slot of an exact tuple: (4)✦
A parameter square has rows , the planes fixing the first axis, and columns , the planes fixing the last axis. An exact square over is an array of codes whose row is exact over for every and whose column is exact over for every ; is the set of exact squares over .✦
A label is a pair of a parameter and a Hilbert code for .✦ For a set of labels, the fibre over is the set of codes with . A set of labels is separated if it is measurable, every has canonical and unimodular with base point , and any two distinct codes in one fibre satisfy .
Projective Classes and Time
The group of measurable circle-valued maps on is the group, under pointwise multiplication, of measurable maps from to the unit circle with the Borel structure it inherits from .✦ For a measure on , the maps equal -almost everywhere to a constant form its subgroup of constant phases✦, and the projective circle group of is the quotient: circle-valued maps modulo constant phases and changes on null sets.✦ The circle representative of a code is its representative read as a point of the circle at each .✦ For , the projective class of is the class of in the projective circle group of ✦, and for a set of labels the local projective group is the subgroup of that group generated by the classes , .✦
For a code with base point , let , a vector of , and let be its first nonzero inner product with the test sequence of . The time transport of is the code of the vector of .✦
The Claim
Theorem 1. Let be an array object over initial array laws of with , and let be a Markov kernel from to with the marginals and the independence off each slot described in the setting. In (i) to (v) suppose moreover that is saturated and that is a version of .
There is a separated set of labels such that (5)✦
For each slot there is a separated set of labels such that (6)✦
If sets of labels, one for each slot , satisfy for -almost every , then for all slots and (7)✦
For a separated set of labels satisfying (5) and for -almost every , taking projective classes is a bijection from the fibre onto the local projective group: (8)✦
If a set of labels satisfies (5), then for -almost every time transport is a bijection between fibres: (9)✦
Let and , and suppose that every exact tuple over the row is row of some exact square over . Then restriction to row is a bijection from the exact squares over onto the exact tuples over : (10)✦
In the paper, the result reads: on a -conull set of parameters there is a measurable countable family of abelian groups of labels of lines in , with measurable modulus-one representatives, identity , orthogonal, of mean zero off the identity and with products respecting the group law, such that for -almost every the exact lines at slot are exactly and span what the paper calls the active space, with measurable isomorphisms for slots and , time isomorphisms respecting exact matching, and, for almost every square, a label at one cell determining a unique array matched along every row and column.
The fibres of (5) take the place of the paper’s groups , matched with the local projective groups by (8).
What Is Checked
The claim is stated over an array object with at least three slots over initial array laws of , saturated in (i) to (v); a Markov kernel with the marginals and independence off each slot, a version of in (i) to (v); Hilbert codes for with their distance and the conditions of being canonical and unimodular; exact tuples, exact lines and exact squares over ; the projective circle groups of the measures ; and time transport of codes.
The library proves that the map of an extension , acting entrywise, is measure preserving from to .✦ For circle-valued maps on it proves that the measurable ones, and among them those almost everywhere constant, are closed under products and inverses, that measurable ones lie in ✦, and that the circle representative of a code is measurable✦. For time transport it proves that the code of is unimodular✦ and that every unimodular code has a nonzero inner product with some term of the test sequence✦.
The arrays of order zero over form a space measurably isomorphic to , an array being sent to its entry at the empty tuple✦, and a measurable equivalence of acts entrywise as a measurable equivalence of the arrays of order , with inverse the entrywise action of the inverse equivalence✦.