The Setting
Let be a measurable automorphism of a standard Borel space , and a finite index set. Over sit a state space with an automorphism , a parameter space with an automorphism , and a parameter map intertwining them; disintegrating the law of a state over its parameter gives a fibre above each . A line above is a circle-valued function on this fibre, taken modulo constant phases. Time moves a line above to a line above by composition with , and matching passes from the entry at a slot , an index of , of an exact tuple of lines, one whose product integrates to modulus one, to its entry at a slot , another index of .
Fix a set of labels, each a line above a parameter given by a code. For a parameter , the lines of above generate an abelian group , which varies with . The lemma compares these groups through one measurable map on coded lines with values in , whose level sets cut almost every group into finite blocks.
Array Objects
Initial array laws of over are probability measures on the arrays of each order , invariant under applied entrywise, consistent (fixing any axis of an array of order at any index carries to ) and proper (for every subset of , the planes of an array of order at the indices of on the last axis, that is, the arrays of order obtained by fixing the last axis at an index of , are independent under , each with law ).✦ An array object over them consists of standard Borel spaces of states and of parameters with automorphisms and , measurable maps and intertwining with and with , and laws on , invariant, consistent and proper in the same sense and carried to by , such that for the planes at the indices of stay independent given the parameter array (the image of the array under applied entrywise), each with its own conditional law given its parameter array, and and are independent under , arrays of order zero being points of .✦
The parameter law of is the image of under applied entrywise✦, and its conditional kernel is the Markov kernel from to giving the conditional law, under , of an array given its parameter array. The tuple kernel of is the kernel from to giving the joint conditional law of the entries of an array of order one given its parameter array.✦
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, from to , that intertwine the automorphisms, satisfy and , and carry, with applied entrywise, each law of to the law of of the same order✦; pulling back along it is the isometry from of the laws of to of those of .✦ To an array object are attached, for every order and index , the parameter field , the outside field and the enlarged field , sub--fields of . An array object is saturated when pulling back along every extension commutes with the conditional expectations of onto these sub--fields, for every order and index .✦
Codes, Lines and Labels
Fix a parameter . The Hilbert test sequence of is a sequence in running through the simple functions with coefficients in and sets from the algebra generated by a fixed countable generating family of the -algebra of .✦
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 : it is nonnegative, satisfies and for all and , and has infimum .✦ The decoded vector of a Hilbert code for is the vector of with for every .✦ The representative of a Hilbert code for is the pointwise limit on of the , where is the first index with .✦ The circle representative of is the map from to the unit circle that equals wherever .✦ A code is canonical when the first test vector not orthogonal to has ✦, and unimodular when holds -almost everywhere.✦ Conversely, the code at of a vector of is the Hilbert code with , the sequence of distances from to the test vectors; its decoded vector is .
The projective circle group is the group of measurable maps under pointwise multiplication, modulo its subgroup of maps that are -almost everywhere constant.✦ The projective class of a code at is the class of in .✦
A label is a pair of a parameter and a Hilbert code for .✦ A tuple label is a pair of a parameter array of order one and a tuple of codes✦; its label at slot is , with the entry of at .✦ For a kernel from to , a tuple label is exact when every has base point and is canonical and unimodular, and (1)✦ The line graph at an index is the set of pairs with exact.✦ The exact square is the set of pairs of a parameter array of order two and an matrix of codes whose row at each is exact over the plane of fixing the first axis at and whose column at each is exact over the plane of fixing the last axis at .✦
The time map on labels sends to , where the transported code is the code, at the image under of the base point of , of multiplied by the constant phase that makes its first nonzero coefficient positive.✦
The set of labels has fibres . The local projective group at a parameter is the subgroup of generated by the classes of the codes .✦ A Borel fibre enumeration of a set of pairs is a sequence of measurable sets of first coordinates and measurable maps such that lies in the set for , and each of its points is for exactly one with .✦ The fibre measure of a measure on first coordinates, for a set of pairs with a Borel fibre enumeration , is the image of the product of with counting measure, restricted to the pairs with , under .✦
Orbit Vectors and Blocks
A label orbit vector is a complex function on .✦ The first and the second label shift and are the measurable automorphisms of given by (2)
For a measure on labels and a map from labels to a set , a positive level of is a value whose level set has positive -measure.✦ Given and a parameter , the block label of is , where is a chosen code in with when is such a class, and the code at of the zero vector otherwise.✦ The block of in is the set of the with .
The Claim
Theorem 1. Let be an array object over initial array laws of and a Markov kernel from to such that, for every and every , the entry of has law under . Let be a set of labels with a Borel fibre enumeration, matching the line graphs: for -almost every and every , the codes with in the line graph at are exactly those of . Let be its fibre measure. For (a), (b) and (d) suppose moreover that is saturated, that has at least three elements, that equals the tuple kernel of -almost everywhere, that for every and every the entries , , are independent under , that the set of exact tuple labels and the exact square each have a Borel fibre enumeration, being the fibre measure of , and let be two indices of .
There are a measurable map from labels to and a function with -almost everywhere, such that some countable set contains for -almost every label and (3)✦ the first for every label , the second for -almost every tuple label , the third for -almost every label .
There is a measurable map from labels to with countably many positive levels for , each level set of finite -measure, whose image measure is preserved by and by , such that for -almost every every value with is a positive level and each positive level is taken at finitely many , and (4)✦ the first for -almost every and every exact tuple label , the second for -almost every and every .
Suppose that is nonempty and that equals the tuple kernel of -almost everywhere, and let map labels to a set and map to itself, with for -almost every and every . Then for -almost every there is a group isomorphism with (5)✦
There are a measurable map from labels to with countably many positive levels for and a parameter with countable, such that every block label is a positive level and every positive level has a finite nonempty block in ; such that for -almost every every value with is a positive level, each positive level is taken at finitely many , and for every ; and such that there are group isomorphisms for -almost every and a group automorphism of with (6)✦
In the paper, the result reads: the groups are measurably partitioned into blocks of a fixed finite positive cardinality, permuted by matching () and by time (), and there are an abstract countable abelian group with a block partition, block-preserving isomorphisms for typical , not necessarily measurable, and an automorphism of with for every integer and every index of a block.
What Is Checked
The four statements are stated over a saturated array object over initial array laws of , its parameter laws and , its own kernel and its tuple kernel, a Markov kernel , two indices , and a set of labels, the set of exact tuple labels and the exact square with Borel fibre enumerations, the first two with fibre measures and ; on these rest the Hilbert codes for and their projective classes, exact tuple labels, the time map , the local projective groups , the label shifts and , positive levels and block labels .
About these constructions the library proves that the circle representative of every code is measurable✦, that a measurable map into is square integrable for a finite measure✦, that the code of at any base point is unimodular for every measurable automorphism of ✦, that every unimodular code has a nonzero coefficient ✦, and that the map between the state spaces of an extension of by , applied entrywise, is measure preserving from each law of to the law of of the same order.