The general structural conjecture for joinings of partially pro-nilsystem actions
The general structural conjecture for joinings of partially pro-nilsystem actions
Let for be subgroups with no pairwise inclusions, and let be integers. For each , let be a -system, and write for the class of systems whose -subactions are direct integrals of -step pro-nilsystems. A system is sated with respect to a family of classes when it has the corresponding satedness property for all possible joins of those classes.
General Structural Conjecture. Depending only on these data, there are finite families of pairs for , with and properly containing , such that if and each is sated with respect to all possible joins of classes , where and , then for any joining , the factors are relatively independent over
where is the factor of generated by the factor map to .
This conjecture proposes a structural description of joinings when the acting subgroups are linearly dependent. In the special case , it says that, under sufficient satedness, the joining factors are relatively independent over joins of factors arising from systems with trivial -subaction and bounded-step pro-nilsystem structure. The result remains conjectural in the stated generality.
Sources & referencesView supporting material
Primary source
Tim Austin, “Multiple recurrence and the structure of probability-preserving systems”, arXiv:1006.0491 (2010).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.