pith. sign in

arxiv: 2605.16152 · v1 · pith:FOWSP74Nnew · submitted 2026-05-15 · 🧮 math.CO

Whitney's 2-isomorphism theorem for graphings

M\'arton Borb\'enyi , Grigory Terlov , L\'aszl\'o M\'arton T\'oth This is my paper

Pith reviewed 2026-05-20 16:46 UTC · model grok-4.3

classification 🧮 math.CO
keywords graphingsweak isomorphismWhitney theoremmeasurable combinatoricsmatroidsrigidity theoremhyperfinite subgraphsinfinite graphs
8
0 comments X

The pith

Weak isomorphisms between locally finite graphings can be realized by countably many measurable Whitney operations.

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

The paper proves measurable versions of Whitney's classical theorems on weak isomorphisms of graphs, now applied to locally finite graphings. It defines weak isomorphism as an edge-measure-preserving Borel bijection that preserves cycles and hyperfinite subgraphs modulo null sets. A rigidity theorem shows that for weakly 3-connected infinitely-ended graphings, every weak isomorphism is induced by an actual isomorphism. The central result decomposes every weak isomorphism into a countable sequence of measurable Whitney operations introduced for this setting. This provides a general sufficient condition in measurable combinatorics for the existence of isomorphisms between given graphings.

Core claim

For weakly 3-connected infinitely-ended graphings, every weak isomorphism is induced by an isomorphism of graphings. Every weak isomorphism between graphings can be implemented by countably many measurable Whitney operations. The proofs rely on new measurable-combinatorial tools, including analysis of infinitely-ended subforests, and further develop the limit theory of matroids.

What carries the argument

Measurable Whitney operations, introduced as transformations on graphings that preserve weak isomorphism while allowing any weak isomorphism to be decomposed into a countable chain of such steps.

If this is right

  • Weakly 3-connected infinitely-ended graphings that are weakly isomorphic must be isomorphic via a graphing isomorphism.
  • Weak isomorphism supplies the first general sufficient condition in measurable combinatorics for the existence of an isomorphism between two given graphings.
  • The decomposition into measurable Whitney operations extends classical finite-graph results to the infinite measurable setting.
  • Analysis of infinitely-ended subforests becomes a key tool for establishing isomorphisms in this framework.

Where Pith is reading between the lines

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

  • The countable decomposition could yield constructive methods to produce isomorphisms once a weak isomorphism is known.
  • Similar measurable analogues of other classical theorems on graphs or matroids may follow from the same techniques.
  • The results connect measurable combinatorics more closely to questions of classification and rigidity for infinite structures.

Load-bearing premise

The local finiteness of the graphings together with the definition of weak isomorphism as preserving cycles and hyperfinite subgraphs modulo null sets is what supports both the rigidity theorem and the countable decomposition.

What would settle it

Two locally finite graphings that are weakly isomorphic but cannot be connected by any countable sequence of measurable Whitney operations would disprove the main theorem.

Figures

Figures reproduced from arXiv: 2605.16152 by Grigory Terlov, L\'aszl\'o M\'arton T\'oth, M\'arton Borb\'enyi.

Figure 1
Figure 1. Figure 1: Illustration of Whitney’s theorem. Grey lines show how the cycles are transformed for each [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: A weak isomorphism of weakly 2-connected, 2-ended graphings that is not induced by an isomor [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: A split at cut vertices that does not preserve hyperfiniteness. [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Illustration to the proof of Lemma 3.4. The black edges that connect 𝐶(𝑒) with 𝑆1 and 𝑆2 portray the edge boundary between the respective sells. The blue vertices and dashed edges depict our additions, while the red paths represent the desired paths in the statement. Lemma 3.5. In the setting of Lemma 3.2 assume further that G is weakly 2-connected and the subgraphs in E are singleton edges. Then one can m… view at source ↗
Figure 5
Figure 5. Figure 5: Illustration to the proof of Lemma 3.5. The red tree depicts the desired 𝑇𝑒. non-T𝑖-edges of 𝐵 Q 1 (𝐶(𝑒)) and their edge boundaries. Clearly, T𝑖 ⊆ G′ 𝑖 . Moreover, each 𝑇𝑒 is a trifurcation in G ′ 𝑖 because it has leaves in at least four distinct infinite sides of 𝐵 Q 2 (𝐶(𝑒)) and each of those sides is infinite in G ′ 𝑖 by Lemma 3.3. Fix an arbitrary Borel linear ordering < of the edges of G ′ 𝑖 and let F… view at source ↗
Figure 6
Figure 6. Figure 6: Example of a bifurcation induced by {𝑢, 𝑣, 𝑥, 𝑦, 𝑧} and a wedge (𝑥, 𝑧, 𝑦) such that after removal of its center the endpoints cannot both be in a leafless forest. We first prove that if the removed centers of wedges are sparse enough, the graphing remains weakly 2-connected and infinitely-ended. Lemma 3.8. In the setting of Lemma 3.2 assume further that G is weakly 3-connected and that E consists of single… view at source ↗
Figure 7
Figure 7. Figure 7: Illustration of the construction of the desired tree [PITH_FULL_IMAGE:figures/full_fig_p015_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Illustration of the construction of the desired tree [PITH_FULL_IMAGE:figures/full_fig_p016_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Illustration of the construction of the desired tree [PITH_FULL_IMAGE:figures/full_fig_p016_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: An example of infinite-ended graph and its banana decomposition. [PITH_FULL_IMAGE:figures/full_fig_p020_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: An example of a finite vertex split/join. [PITH_FULL_IMAGE:figures/full_fig_p025_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: An example of a 2-ended infinite split/join. [PITH_FULL_IMAGE:figures/full_fig_p026_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: An example of finite Whitney twist. (2-ended simultaneous Whitney twist.) Let G and 𝑓 : 𝑋0 → 𝑋1 be as above, except assume all components of G are 2-ended, and each cut pair {𝑥, 𝑓 (𝑥)} separates the two ends. Moreover, assume that the pairs are non-crossing: for 𝑥, 𝑦 ∈ 𝑋0 from the same G-component, the cut-pair {𝑥, 𝑓 (𝑥)} does not separate 26 [PITH_FULL_IMAGE:figures/full_fig_p026_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: An example of a 2-ended simultaneous Whitney twist. [PITH_FULL_IMAGE:figures/full_fig_p027_14.png] view at source ↗
read the original abstract

We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. In the setting of locally finite graphings, we introduce a notion of weak isomorphism as an edge-measure-preserving Borel bijection that preserves cycles and hyperfinite subgraphs, modulo null sets. We first show a rigidity theorem, proving that for weakly 3-connected infinitely-ended graphings, every weak isomorphism is induced by an isomorphism of graphings. To our knowledge, this gives the first general sufficient condition in measurable combinatorics for the existence of an isomorphism between two given graphings. Next, we give a full measurable version of Whitney's theorem, showing that every weak isomorphism between graphings can be implemented by countably many measurable Whitney operations, which we introduce in this setting. The proofs require new measurable-combinatorial tools, including a careful analysis of infinitely-ended subforests. This work further develops the limit theory of matroids recently initiated by Lov\'asz.

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

1 major / 2 minor

Summary. The paper establishes measurable analogues of Whitney's classical theorems on weak isomorphisms of graphs, now in the setting of locally finite graphings. It defines weak isomorphism as an edge-measure-preserving Borel bijection that preserves cycles and hyperfinite subgraphs modulo null sets. A rigidity theorem is proved showing that for weakly 3-connected infinitely-ended graphings every weak isomorphism is induced by a graphing isomorphism; this is claimed to be the first general sufficient condition in measurable combinatorics for the existence of an isomorphism between two given graphings. The main result is a full measurable Whitney theorem: every weak isomorphism decomposes into countably many measurable Whitney operations (introduced here), with the proofs relying on new tools for the analysis of infinitely-ended subforests. The work also advances the limit theory of matroids.

Significance. If the central claims hold, the paper supplies the first general sufficient condition for the existence of an isomorphism between two given graphings in measurable combinatorics, together with an explicit countable decomposition into measurable Whitney operations. This extends classical finite-graph results to the measurable setting while developing new combinatorial tools for infinitely-ended structures and hyperfinite subgraphs. The rigidity theorem and the decomposition together strengthen the link between measurable combinatorics and matroid limit theory.

major comments (1)
  1. [analysis of infinitely-ended subforests (general case)] The central decomposition into countably many measurable Whitney operations (abstract and § on the general case) rests on a measurable selector for separators or flips in infinitely-ended subforests that simultaneously preserves edge measure, cycle space, and the hyperfinite property. The skeptic's concern is that when an infinite end meets a null set of edges preserved by the weak isomorphism, it is unclear whether such a Borel/measurable choice exists on a positive-measure set of components; if the selector fails, the countable decomposition cannot be carried out while remaining measurable. This point is load-bearing for the main theorem and requires explicit verification that the new tools handle the null-set interaction without circular appeal to the rigidity theorem.
minor comments (2)
  1. [Definition of weak isomorphism] Clarify the precise definition of 'preserves hyperfinite subgraphs modulo null sets' and how it interacts with the edge-measure preservation in the weak-isomorphism definition.
  2. [Introduction] The abstract states that proofs exist using new tools, but the manuscript should include a short roadmap paragraph indicating which sections treat the infinitely-ended case versus the 3-connected rigidity case.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for raising this important point concerning the measurability of the selector in the general case. We address the concern below.

read point-by-point responses

  1. Referee: [analysis of infinitely-ended subforests (general case)] The central decomposition into countably many measurable Whitney operations (abstract and § on the general case) rests on a measurable selector for separators or flips in infinitely-ended subforests that simultaneously preserves edge measure, cycle space, and the hyperfinite property. The skeptic's concern is that when an infinite end meets a null set of edges preserved by the weak isomorphism, it is unclear whether such a Borel/measurable choice exists on a positive-measure set of components; if the selector fails, the countable decomposition cannot be carried out while remaining measurable. This point is load-bearing for the main theorem and requires explicit verification that the new tools handle the null-set interaction without circular appeal to the rigidity theorem.

    Authors: We are grateful to the referee for highlighting this potential subtlety. The new measurable-combinatorial tools for the analysis of infinitely-ended subforests, developed in the relevant section, construct a Borel selector for separators and flips that respects edge measure, cycle space, and hyperfiniteness. The selector is obtained by first excising a null set of edges (which is possible because the weak isomorphism preserves the relevant structures modulo null sets) and then applying a measurable selection theorem to the resulting equivalence classes of components. This ensures the choice is defined on a positive-measure set of components. The construction relies only on the preservation properties under weak isomorphism and the new tools; it makes no appeal to the rigidity theorem, which is established separately and later for the weakly 3-connected case using distinct arguments. In the revised manuscript we will add an explicit remark or short subsection verifying these points and confirming that the selector remains measurable in the presence of null-set interactions. revision: yes

Circularity Check

0 steps flagged

No significant circularity; original definitions and proofs are self-contained

full rationale

The paper introduces original notions of weak isomorphism (edge-measure-preserving Borel bijection preserving cycles and hyperfinite subgraphs mod null sets) and measurable Whitney operations for locally finite graphings. The rigidity theorem for weakly 3-connected infinitely-ended cases and the countable decomposition are established via new measurable-combinatorial tools and analysis of infinitely-ended subforests, without reducing to fitted parameters, self-definitional equations, or load-bearing self-citations. The reference to Lovász's matroid limit theory is external and does not form a self-referential chain. The derivation chain relies on independent proofs rather than renaming or smuggling prior results by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 2 invented entities

The central claims rest on standard background from measure theory, descriptive set theory, and graph theory plus newly introduced definitions; no numerical free parameters appear.

axioms (2)
  • domain assumption Graphings are locally finite with Borel sigma-algebras and edge measures.
    Invoked to define Borel bijections and measure preservation in the setting of the theorems.
  • standard math Standard results from measurable combinatorics and matroid theory hold.
    Background for extending classical Whitney theorems and Lovász's limit theory.
invented entities (2)
  • weak isomorphism no independent evidence
    purpose: Edge-measure-preserving Borel bijection that preserves cycles and hyperfinite subgraphs modulo null sets.
    New definition introduced to capture measurable weak isomorphism.
  • measurable Whitney operations no independent evidence
    purpose: Countable sequence of operations that implement any weak isomorphism in the graphing setting.
    Newly introduced measurable adaptations of classical Whitney operations.

pith-pipeline@v0.9.0 · 5703 in / 1550 out tokens · 173329 ms · 2026-05-20T16:46:42.407744+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

36 extracted references · 36 canonical work pages

  1. [1]

    Weilacher, Felix , TITLE =. Fund. Math. , FJOURNAL =. 2020 , NUMBER =. doi:10.4064/fm863-2-2020 , URL =

    work page doi:10.4064/fm863-2-2020 2020

  2. [2]

    Combinatorica , FJOURNAL =

    Elek, G\'abor , TITLE =. Combinatorica , FJOURNAL =. 2010 , NUMBER =. doi:10.1007/s00493-010-2559-2 , URL =

    work page doi:10.1007/s00493-010-2559-2 2010

  3. [3]

    Notices Amer

    Bernshteyn, Anton , TITLE =. Notices Amer. Math. Soc. , FJOURNAL =. 2022 , NUMBER =. doi:10.1090/noti2539 , URL =

    work page doi:10.1090/noti2539 2022

  4. [4]

    Descriptive graph combinatorics , author=

    work page

  5. [5]

    2024 , isbn =

    The Theory of Countable Borel Equivalence Relations , author =. 2024 , isbn =

    work page 2024

  6. [6]

    and Peres, Y

    Lyons, R. and Peres, Y. , TITLE =. 2016 , PAGES =

    work page 2016

  7. [7]

    Miller, B. D. Ends of graphed equivalence relations, I. Israel J. Math. 2008. doi:10.1007/s11856-009-0015-z

    work page doi:10.1007/s11856-009-0015-z 2008

  8. [8]

    Trees and amenable equivalence relations , volume=

    Adams, Scot , year=. Trees and amenable equivalence relations , volume=. Ergodic Theory and Dynamical Systems , publisher=. doi:10.1017/S0143385700005368 , number=

    work page doi:10.1017/s0143385700005368

  9. [9]

    Journal of Combinatorial Theory, Series B , volume=

    Cycle matroids of graphings: from convergence to duality , author=. Journal of Combinatorial Theory, Series B , volume=. 2026 , publisher=

    work page 2026

  10. [10]

    arXiv preprint arXiv:2507.15105 , year=

    Convergent sequences of combinatorial submodular setfunctions , author=. arXiv preprint arXiv:2507.15105 , year=

    work page arXiv

  11. [11]

    Combinatorica , volume=

    Quotient-convergence of submodular setfunctions , author=. Combinatorica , volume=. 2026 , publisher=

    work page 2026

  12. [12]

    2022 , copyright =

    Nonamenable subforests of multi-ended quasi-pmp graphs , publisher =. 2022 , copyright =. doi:10.48550/ARXIV.2211.07908 , author =

    work page doi:10.48550/arxiv.2211.07908 2022

  13. [13]

    Journal of Combinatorial Theory, Series B , volume=

    Limits of permutation sequences , author=. Journal of Combinatorial Theory, Series B , volume=. 2013 , publisher=

    work page 2013

  14. [14]

    arXiv preprint arXiv:2302.04704 , year=

    Submodular setfunctions on sigma-algebras , author=. arXiv preprint arXiv:2302.04704 , year=

    work page arXiv

  15. [15]

    Journal of Combinatorial Theory, Series B , volume=

    The matroid of a graphing , author=. Journal of Combinatorial Theory, Series B , volume=. 2024 , publisher=

    work page 2024

  16. [16]

    2017 , issn =

    First order convergence of matroids , journal =. 2017 , issn =. doi:https://doi.org/10.1016/j.ejc.2016.08.005 , url =

    work page doi:10.1016/j.ejc.2016.08.005 2017

  17. [17]

    Limits of Boolean Functions on F\_p\^

    Hatami, Hamed and Hatami, Pooya and Hirst, James , journal=. Limits of Boolean Functions on F\_p\^

    work page

  18. [18]

    Annales de l'institut Fourier , volume=

    Theory of capacities , author=. Annales de l'institut Fourier , volume=

    work page

  19. [19]

    American Journal of Mathematics , volume=

    2-isomorphic graphs , author=. American Journal of Mathematics , volume=. 1933 , publisher=

    work page 1933

  20. [20]

    2004 , publisher=

    Topics in orbit equivalence , author=. 2004 , publisher=

    work page 2004

  21. [21]

    Electronic Journal of Combinatorics , pages=

    The structure of locally finite two-connected graphs , author=. Electronic Journal of Combinatorics , pages=

    work page

  22. [22]

    Journal of Combinatorial Theory, Series B , volume=

    Duality of infinite graphs , author=. Journal of Combinatorial Theory, Series B , volume=. 1982 , publisher=

    work page 1982

  23. [23]

    2012 , publisher=

    Large networks and graph limits , author=. 2012 , publisher=

    work page 2012

  24. [24]

    Tserunyan, Anush and Tucker-Drob, Robin , journal=. The

    work page

  25. [25]

    1966 , publisher=

    Connectivity in graphs , author=. 1966 , publisher=

    work page 1966

  26. [26]

    2007 , publisher=

    Combinatorial problems and exercises , author=. 2007 , publisher=

    work page 2007

  27. [27]

    2026 , url =

    The super. 2026 , url =

    work page 2026

  28. [28]

    arXiv preprint arXiv:2203.14598 , year=

    Isometric orbit equivalence for probability-measure preserving actions , author=. arXiv preprint arXiv:2203.14598 , year=

    work page arXiv

  29. [29]

    Electronic Journal of Probability , volume=

    Recurrence of distributional limits of finite planar graphs , author=. Electronic Journal of Probability , volume=. 2001 , publisher=

    work page 2001

  30. [30]

    Geometry, rigidity, and group actions , pages=

    A survey of measured group theory , author=. Geometry, rigidity, and group actions , pages=. 2011 , publisher=

    work page 2011

  31. [31]

    Selected Works of Oded Schramm , pages=

    Hyperfinite graph limits , author=. Selected Works of Oded Schramm , pages=. 2011 , publisher=

    work page 2011

  32. [32]

    and Lyons, R

    Aldous, D. and Lyons, R. , TITLE =. Electron. J. Probab. , FJOURNAL =. 2007 , PAGES =. doi:10.1214/EJP.v12-463 , URL =

    work page doi:10.1214/ejp.v12-463 2007

  33. [33]

    Inventiones mathematicae , volume=

    Cocycle and orbit equivalence superrigidity for malleable actions of w-rigid groups , author=. Inventiones mathematicae , volume=. 2007 , publisher=

    work page 2007

  34. [34]

    Annals of mathematics , pages=

    Orbit equivalence rigidity and bounded cohomology , author=. Annals of mathematics , pages=. 2006 , publisher=

    work page 2006

  35. [35]

    Annals of Mathematics , pages=

    Orbit equivalence rigidity , author=. Annals of Mathematics , pages=. 1999 , publisher=

    work page 1999

  36. [36]

    Annals of Mathematics , volume=

    Strong rigidity for ergodic actions of semisimple Lie groups , author=. Annals of Mathematics , volume=. 1980 , publisher=

    work page 1980