pith. sign in

arxiv: 2605.23349 · v1 · pith:74JIQRI3new · submitted 2026-05-22 · 🧮 math.DS

Observing Joinings: A Distance-Array Characterization of Furstenberg Disjointness

Ao Xu This is my paper

Pith reviewed 2026-05-25 03:14 UTC · model grok-4.3

classification 🧮 math.DS
keywords Furstenberg disjointnessjoiningsdistance arraysergodic theoryGromov-Vershik reconstructionWasserstein dependencedynamical systemsexchangeable arrays
0
0 comments X

The pith

Two dynamical systems are Furstenberg-disjoint exactly when all their anchored multi-orbit distance-array projections are independent.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces multi-particle distance arrays that sample finite orbit segments and record their joint metric evolution in compact metric models of dynamical systems. It establishes that two systems are disjoint if and only if these anchored arrays arising from any joining are independent at every finite level. This turns the global joining property into a check on finite observable patterns. The argument rests on a marked and colored version of the Gromov-Vershik reconstruction principle that recovers the joining from the arrays. Wasserstein dependence coefficients then give a quantitative version in which vanishing at all orders detects disjointness.

Core claim

In the anchored fixed-model setting, two systems are disjoint if and only if all their anchored multi-orbit distance-array projections are independent. The structural engine behind this criterion is a marked and colored version of the Gromov-Vershik reconstruction principle for exchangeable arrays; unanchored arrays reconstruct the intrinsic twin-free quotient, while anchors recover the actual joining in a fixed model.

What carries the argument

Multi-particle distance arrays that record joint metric evolution of finite orbit segments, together with the marked and colored Gromov-Vershik reconstruction principle for exchangeable arrays.

If this is right

  • Disjointness holds precisely when the Wasserstein dependence coefficients between the distance arrays vanish at every order.
  • Every weak neighborhood of the product joining contains a finite distance-array certificate of independence.
  • The characterization requires the multi-particle level; single-particle arrays are insufficient.
  • The criterion covers compact rotations, Bernoulli shifts, reversible Markov shifts, common factors, Kronecker factors, and weakly mixing systems.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Checking disjointness could reduce to verifying independence on finite samples of orbit distances rather than constructing infinite joinings.
  • The same distance-array lens might yield finite characterizations for other joining properties such as relative weak mixing.
  • In settings with only finite trajectory data the arrays offer a direct test for absence of common factors.
  • Exchangeable array techniques may connect this criterion to reconstruction problems in other areas of ergodic theory.

Load-bearing premise

The marked and colored version of the Gromov-Vershik reconstruction principle applies to the exchangeable arrays arising from the distance-array construction in compact metric models.

What would settle it

A concrete pair of non-disjoint systems whose anchored multi-orbit distance-array projections are nevertheless independent, or a pair of disjoint systems in which some anchored arrays exhibit positive dependence.

read the original abstract

Joinings are fundamental global objects in ergodic theory, yet in compact metric models one naturally observes only finite orbit-distance patterns. We bridge this gap by introducing multi-particle distance arrays, which sample finite orbit segments and record their joint metric evolution. In the anchored fixed-model setting, this framework yields a purely finite-observable characterization of Furstenberg disjointness: two systems are disjoint if and only if all their anchored multi-orbit distance-array projections are independent. The structural engine behind this criterion is a marked and colored version of the Gromov--Vershik reconstruction principle for exchangeable arrays; unanchored arrays reconstruct the intrinsic twin-free quotient, while anchors recover the actual joining in a fixed model. To quantify this independence, we introduce Wasserstein dependence coefficients, establishing an all-order zero criterion for disjointness, and show that weak neighborhoods of the product joining always admit finite distance-array certificates. Examples from compact rotations, Bernoulli and reversible Markov shifts, common factors, Kronecker factors, and weak mixing demonstrate the strict necessity of the multi-particle level and the broad scope of this approach.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper introduces multi-particle distance arrays that record joint metric evolution on finite orbit segments in compact metric dynamical systems. It claims that two systems are Furstenberg disjoint if and only if all their anchored multi-orbit distance-array projections are independent. The argument relies on a marked and colored variant of the Gromov-Vershik reconstruction principle: unanchored arrays recover the twin-free quotient while anchors recover the joining; independence is then quantified via newly defined Wasserstein dependence coefficients, yielding an all-order zero criterion. Examples from rotations, Bernoulli shifts, Markov shifts, common factors, Kronecker factors, and weak mixing are used to illustrate necessity of the multi-particle level.

Significance. If the central equivalence holds, the work supplies a finite-observable, metric-based characterization of disjointness that directly connects local orbit-distance data to global joinings. The introduction of Wasserstein dependence coefficients and the explicit reconstruction of both the quotient and the joining from anchored arrays would constitute a concrete advance in the study of joinings, particularly for systems admitting compact metric models. The all-order independence criterion and the finite-certificate result for neighborhoods of the product joining are potentially useful for both theoretical and computational purposes.

major comments (2)
  1. [The structural engine paragraph and the section deriving the anchored reconstruction] The central iff claim rests on the applicability of the marked/colored Gromov-Vershik reconstruction to the specific exchangeable arrays generated by sampling finite orbit segments under the diagonal action and recording their metric evolution. The manuscript must verify that the marking map is measurable, that the arrays satisfy the precise exchangeability and atomless hypotheses required by the colored variant, and that the reconstruction recovers the actual joining rather than only its twin-free quotient; any gap here directly affects the translation from array independence to the joining being the product measure.
  2. [The section introducing Wasserstein dependence coefficients and the all-order zero criterion] The Wasserstein dependence coefficients are asserted to give an all-order zero criterion for disjointness. The manuscript should supply an explicit relation between vanishing of these coefficients at all orders and the independence of the anchored projections, including control on the approximation error when only finite-order arrays are observed.
minor comments (2)
  1. [Introduction and notation section] Notation for anchored versus unanchored arrays and for the multi-particle versus single-particle cases should be introduced with a single consistent table or diagram early in the text.
  2. [Examples] The examples section would benefit from a brief statement of which specific distance-array projections are checked in each case (e.g., 2-particle vs. 3-particle) to make the necessity claim easier to verify.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful and constructive report. The comments identify key points where additional explicit verification and relations would strengthen the presentation. We respond to each major comment below.

read point-by-point responses

  1. Referee: [The structural engine paragraph and the section deriving the anchored reconstruction] The central iff claim rests on the applicability of the marked/colored Gromov-Vershik reconstruction to the specific exchangeable arrays generated by sampling finite orbit segments under the diagonal action and recording their metric evolution. The manuscript must verify that the marking map is measurable, that the arrays satisfy the precise exchangeability and atomless hypotheses required by the colored variant, and that the reconstruction recovers the actual joining rather than only its twin-free quotient; any gap here directly affects the translation from array independence to the joining being the product measure.

    Authors: We agree that these technical hypotheses require explicit verification to make the application of the colored Gromov-Vershik principle fully rigorous. In the revision we will insert a new subsection immediately following the structural engine paragraph that (i) confirms measurability of the marking map with respect to the product sigma-algebra on the space of arrays, (ii) verifies exchangeability and the atomless condition for the arrays obtained from finite diagonal orbit segments, and (iii) shows that the anchored reconstruction recovers the full joining on the fixed model (rather than only the twin-free quotient). These additions will close the logical step from array independence to the product joining. revision: yes

  2. Referee: [The section introducing Wasserstein dependence coefficients and the all-order zero criterion] The Wasserstein dependence coefficients are asserted to give an all-order zero criterion for disjointness. The manuscript should supply an explicit relation between vanishing of these coefficients at all orders and the independence of the anchored projections, including control on the approximation error when only finite-order arrays are observed.

    Authors: We accept that an explicit relation and quantitative error control are needed for clarity. The revised manuscript will contain a new proposition that states: the anchored projections are independent if and only if the Wasserstein dependence coefficients vanish at every order. We will also derive explicit bounds relating the partial (finite-order) coefficients to the Wasserstein distance between the observed finite-order law and the product measure, thereby controlling the approximation error when only finite-order arrays are available. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper derives its central iff characterization of disjointness from the independence of anchored multi-orbit distance-array projections by invoking a marked and colored variant of the Gromov-Vershik reconstruction principle as the structural engine. The arrays themselves are constructed directly from finite orbit segments and their metric evolution in compact models, with unanchored versions recovering the twin-free quotient and anchors recovering the joining; independence is then quantified via Wasserstein coefficients. No equation or step in the provided text reduces the claimed equivalence to a self-definition, a fitted parameter renamed as prediction, or a load-bearing self-citation chain; the reconstruction principle is presented as an external tool rather than derived internally. The derivation is therefore self-contained against the cited principle.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 2 invented entities

Review based on abstract only; ledger entries extracted from stated concepts.

axioms (1)
  • standard math Marked and colored Gromov-Vershik reconstruction principle for exchangeable arrays
    Invoked as the structural engine that allows anchored arrays to recover the joining and unanchored arrays to recover the quotient.
invented entities (2)
  • multi-particle distance arrays no independent evidence
    purpose: Sample finite orbit segments and record joint metric evolution to observe joinings
    New observable introduced to bridge finite patterns with global joinings.
  • Wasserstein dependence coefficients no independent evidence
    purpose: Quantify independence to obtain an all-order zero criterion for disjointness
    New coefficients introduced to turn the array-independence statement into a measurable criterion.

pith-pipeline@v0.9.0 · 5711 in / 1261 out tokens · 36302 ms · 2026-05-25T03:14:27.964009+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

32 extracted references · 32 canonical work pages

  1. [1]

    Mathematical Systems Theory1(1), 1–49 (1967) https://doi.org/10.1007/BF01692494

    Furstenberg, H.: Disjointness in ergodic theory, minimal sets, and a problem in Diophantine approximation. Mathematical Systems Theory1(1), 1–49 (1967) https://doi.org/10.1007/BF01692494

    work page doi:10.1007/bf01692494 1967

  2. [2]

    Princeton University Press, Princeton (1981)

    Furstenberg, H.: Recurrence in Ergodic Theory and Combinatorial Number Theory. Princeton University Press, Princeton (1981)

    work page 1981

  3. [3]

    Mathematical Surveys and Mono- graphs, vol

    Glasner, E.: Ergodic Theory Via Joinings. Mathematical Surveys and Mono- graphs, vol. 101. American Mathematical Society, Providence (2003). https: //doi.org/10.1090/surv/101

    work page doi:10.1090/surv/101 2003

  4. [4]

    Journal d’Analyse Math´ ematique31, 204–256 (1977) https://doi.org/10.1007/BF02813304

    Furstenberg, H.: Ergodic behavior of diagonal measures and a theorem of Sze- mer´ edi on arithmetic progressions. Journal d’Analyse Math´ ematique31, 204–256 (1977) https://doi.org/10.1007/BF02813304

    work page doi:10.1007/bf02813304 1977

  5. [5]

    Journal d’Analyse Math´ ematique35, 97–122 (1979) https://doi.org/10.1007/BF02791063

    Rudolph, D.J.: An example of a measure preserving map with minimal self- joinings, and applications. Journal d’Analyse Math´ ematique35, 97–122 (1979) https://doi.org/10.1007/BF02791063

    work page doi:10.1007/bf02791063 1979

  6. [6]

    Annals of Mathematics 134(3), 545–607 (1991) https://doi.org/10.2307/2944357

    Ratner, M.: On Raghunathan’s measure conjecture. Annals of Mathematics 134(3), 545–607 (1991) https://doi.org/10.2307/2944357

    work page doi:10.2307/2944357 1991

  7. [7]

    Annals of Mathematics161(1), 397–488 (2005) https://doi.org/10.4007/annals.2005.161

    Host, B., Kra, B.: Nonconventional ergodic averages and nilmanifolds. Annals of Mathematics161(1), 397–488 (2005) https://doi.org/10.4007/annals.2005.161. 397

    work page doi:10.4007/annals.2005.161 2005

  8. [8]

    In: Dynamical Systems and Turbulence, Warwick 1980

    Takens, F.: Detecting strange attractors in turbulence. In: Dynamical Systems and Turbulence, Warwick 1980. Lecture Notes in Mathematics, vol. 898, pp. 366–

    work page 1980

  9. [9]

    https://doi.org/10.1007/BFb0091924

    Springer, Berlin (1981). https://doi.org/10.1007/BFb0091924

    work page doi:10.1007/bfb0091924 1981

  10. [10]

    Birkh¨ auser, Boston (1999)

    Gromov, M.: Metric Structures for Riemannian and Non-Riemannian Spaces. Birkh¨ auser, Boston (1999)

    work page 1999

  11. [11]

    Russian Math- ematical Surveys59(2), 259–295 (2004) https://doi.org/10.1070/ RM2004v059n02ABEH000718

    Vershik, A.M.: Random metric spaces and universality. Russian Math- ematical Surveys59(2), 259–295 (2004) https://doi.org/10.1070/ RM2004v059n02ABEH000718

    work page 2004

  12. [12]

    Sturm, K.-T.: On the geometry of metric measure spaces. I. Acta Mathematica 196(1), 65–131 (2006) https://doi.org/10.1007/s11511-006-0002-8

    work page doi:10.1007/s11511-006-0002-8 2006

  13. [13]

    Probability Theory and Related Fields145, 285–322 29 (2009)

    Greven, A., Pfaffelhuber, P., Winter, A.: Convergence in distribution of ran- dom metric measure spaces. Probability Theory and Related Fields145, 285–322 29 (2009)

    work page 2009

  14. [14]

    Foundations of Computational Mathematics11, 417–487 (2011) https: //doi.org/10.1007/s10208-011-9093-5

    M´ emoli, F.: Gromov–wasserstein distances and the metric approach to object matching. Foundations of Computational Mathematics11, 417–487 (2011) https: //doi.org/10.1007/s10208-011-9093-5

    work page doi:10.1007/s10208-011-9093-5 2011

  15. [15]

    Russian Mathematical Surveys78(3), 485–554 (2023) https://doi.org/10.4213/rm10103e

    Vershik, A.M., Veprev, D.A., Zatitskii, P.B.: Dynamics of metrics in measure spaces and scaling entropy. Russian Mathematical Surveys78(3), 485–554 (2023) https://doi.org/10.4213/rm10103e

    work page doi:10.4213/rm10103e 2023

  16. [16]

    Journal of Multivariate Analysis11(4), 581–598 (1981)

    Aldous, D.J.: Representations for partially exchangeable arrays of random variables. Journal of Multivariate Analysis11(4), 581–598 (1981)

    work page 1981

  17. [17]

    Preprint, Institute for Advanced Study (1979)

    Hoover, D.N.: Relations on probability spaces and arrays of random variables. Preprint, Institute for Advanced Study (1979)

    work page 1979

  18. [18]

    Springer, New York (2005)

    Kallenberg, O.: Probabilistic Symmetries and Invariance Principles. Springer, New York (2005)

    work page 2005

  19. [19]

    Journal of Combinatorial Theory, Series B96(6), 933–957 (2006) https://doi.org/10.1016/j.jctb.2006.05

    Lov´ asz, L., Szegedy, B.: Limits of dense graph sequences. Journal of Combinatorial Theory, Series B96(6), 933–957 (2006) https://doi.org/10.1016/j.jctb.2006.05. 002

    work page doi:10.1016/j.jctb.2006.05 2006

  20. [20]

    Geometric and Functional Analysis19(6), 1597–1619 (2010) https://doi.org/10.1007/s00039-010-0044-0

    Borgs, C., Chayes, J., Lov´ asz, L.: Moments of two-variable functions and the uniqueness of graph limits. Geometric and Functional Analysis19(6), 1597–1619 (2010) https://doi.org/10.1007/s00039-010-0044-0

    work page doi:10.1007/s00039-010-0044-0 2010

  21. [21]

    Rendi- conti di Matematica e delle sue Applicazioni28, 33–61 (2008)

    Diaconis, P., Janson, S.: Graph limits and exchangeable random graphs. Rendi- conti di Matematica e delle sue Applicazioni28, 33–61 (2008)

    work page 2008

  22. [22]

    American Mathematical Society Colloquium Publications, vol

    Lov´ asz, L.: Large Networks and Graph Limits. American Mathematical Society Colloquium Publications, vol. 60. American Mathematical Society, Providence (2012)

    work page 2012

  23. [23]

    Vestnik Leningrad University

    Kantorovich, L.V., Rubinstein, G.S.: On a space of completely additive functions. Vestnik Leningrad University. Mathematics13(7), 52–59 (1958)

    work page 1958

  24. [24]

    Springer, Berlin (2009)

    Villani, C.: Optimal Transport: Old and New. Springer, Berlin (2009)

    work page 2009

  25. [25]

    Advances in Mathematics4(3), 337–352 (1970) https://doi.org/10.1016/0001-8708(70) 90029-0

    Ornstein, D.: Bernoulli shifts with the same entropy are isomorphic. Advances in Mathematics4(3), 337–352 (1970) https://doi.org/10.1016/0001-8708(70) 90029-0

    work page doi:10.1016/0001-8708(70 1970

  26. [26]

    Yale University Press, New Haven (1974)

    Ornstein, D.: Ergodic Theory, Randomness, and Dynamical Systems. Yale University Press, New Haven (1974)

    work page 1974

  27. [27]

    Information and Inference: A Journal of the IMA13(2), 006 (2024) https: 30 //doi.org/10.1093/imaiai/iaae006

    O’Connor, K., Nobel, A., McGoff, K.: Estimation of stationary optimal transport plans. Information and Inference: A Journal of the IMA13(2), 006 (2024) https: 30 //doi.org/10.1093/imaiai/iaae006

    work page doi:10.1093/imaiai/iaae006 2024

  28. [28]

    Jour- nal of Mathematical Sciences190(3), 427–437 (2013) https://doi.org/10.1007/ s10958-013-1258-0

    Vershik, A.M.: On classification of measurable functions of several variables. Jour- nal of Mathematical Sciences190(3), 427–437 (2013) https://doi.org/10.1007/ s10958-013-1258-0

    work page 2013

  29. [29]

    Functional Analysis and Its Applications 36(2), 93–105 (2002) https://doi.org/10.1023/A:1015662321953

    Vershik, A.M.: Classification of measurable functions of several variables and invariantly distributed random matrices. Functional Analysis and Its Applications 36(2), 93–105 (2002) https://doi.org/10.1023/A:1015662321953

    work page doi:10.1023/a:1015662321953 2002

  30. [30]

    Cambridge University Press, Cambridge (2009)

    Meyn, S.P., Tweedie, R.L.: Markov Chains and Stochastic Stability, 2nd edn. Cambridge University Press, Cambridge (2009)

    work page 2009

  31. [31]

    American Mathematical Society, Providence (2017)

    Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times, 2nd edn. American Mathematical Society, Providence (2017)

    work page 2017

  32. [32]

    Cambridge University Press, Cambridge (1983) 31

    Petersen, K.: Ergodic Theory. Cambridge University Press, Cambridge (1983) 31

    work page 1983