The Setting
Fix a standard Borel space with a measurable automorphism , and a finite index set . The objects here are laws of random arrays , indexed by tuples in and with entries in a state space over , invariant under an automorphism of acting entrywise and carrying -algebras of data on the arrays of each order. Passing to an extension, a larger state space mapping to , may change the conditional expectation of a function of the arrays onto these -algebras. The question is whether every such object has an extension past which no further extension changes them, and whether the inverse limit of a tower of extensions is again an object of the same kind.
Arrays and Array Objects
An array of order over a space is a function that assigns an entry to every index tuple in , so that the arrays of order form the product β¦; an array of order zero is a single point of .β¦ A map acts on arrays entrywise, by .β¦ For an array of order , an axis and an index , the plane is the array of order whose entry at is the entry of at the tuple obtained by inserting into at position .β¦ For a set , the last-axis planes of along form the family .β¦
Initial array laws of over are probability measures on , , each invariant under acting entrywise, that are consistent and proper: for every , every axis , every index and every proper subset of , (1)β¦
Laws on , , are conditionally local for a measurable map if, for every , every proper subset of and almost every value of the parameter array under , the planes with are independent under given , the plane at having law , where is the conditional law under of an array of order given its parameter array .
An array object over consists of nonempty standard Borel spaces of states and of parameters with measurable automorphisms and , measurable maps and with and , and probability measures on , , that are invariant under acting entrywise, lie over the initial array laws , , are consistent and proper as in (1) and are conditionally local for , with and independent under , a measure on .β¦
Extensions and Saturation
The kinds of data field over are the parameter, the outside at and the enlarged at , for , so that there are kinds.β¦ An array object has, at every order , one data field of each kind, a sub--algebra of the Borel -algebra of : the parameter field and, for each , the outside field and the enlarged field .β¦ For a data field of order , the conditional expectation is the orthogonal projection of the complex Hilbert space onto the closed subspace of -measurable functions.β¦
An extension of an array object is an array object over the same initial laws, with states , parameters , automorphisms and , maps and and laws , together with measurable maps and such that , and (2)β¦ We write . For an extension and , the pullback along is the map , composition with the measure-preserving map ; it is a linear isometry of into .β¦
An array object is saturated if, for every extension , every order , every data field of of order , with the field of of the same kind, and every , (3)β¦
Towers and Their Limits
For measurable maps , , called the bonding maps, the inverse limit is the set of paths, the sequences in with for every , with the projections . Maps of the stages that commute with the bonding maps act on paths stagewiseβ¦; in particular, automorphisms of the stages that commute with the bonding maps give an automorphism of the inverse limit.
Given probability measures on , let be the conditional law under of a point of given its image in .β¦ The sequential limit law is the law on , given by the Ionescu-Tulcea theorem, of the Markov chain with (4)β¦ and the inverse limit law is its restriction to the set of paths.β¦ For , applying entrywise makes the arrays an inverse system whose paths are the arrays of pathsβ¦. The inverse limit array law of probability measures on is the inverse limit law of for this system, a measure on .
A tower of array objects over is a sequence of array objects over , the stage with states , parameters , automorphisms and , maps and and laws , together with extensions with parameter maps .β¦ The limit of the tower consists of the states and the parameters , the automorphisms and acting stagewise by and , the factor map β¦, the parameter map β¦, and at each order the law on , the inverse limit array law of .β¦
The Claim
Theorem 1. Let be initial array laws of a measurable automorphism of a standard Borel space , over a finite index set .
(a) Every array object over has an extension (5)β¦
(b) For every tower of array objects over , the limit (6)β¦ is an array object over .
(c) In particular the laws of are conditionally local: for every order , every proper subset of and almost every value of the parameter array under , (7)β¦ where is the conditional law under of an array of order given its parameter array.
In the paper, the result reads: every array object has an extension such that, for every , every and every among , and , no further extension changes , that is, .
What Is Checked
The claim is stated over array objects over initial array laws of a measurable automorphism of a standard Borel space with a finite index set, over their extensions with the pullbacks along them and the conditional expectations onto the parameter, outside and enlarged fields in complex , and over towers of extensions with their limits, built from inverse limits of standard Borel spaces and the sequential limit laws of conditional laws.