Representations of infinite tree-sets

Jay Lilian Kneip; J. Pascal Gollin

REVIEW 3 major objections 5 minor 10 references

Representations of infinite tree-sets

T0 review · 3 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper proves every regular tree set is the edge tree set of a tree-like space, with the tame case exactly the ordinary infinite trees.

desk verdict Fresh, likely-correct extension of tree-set representation to infinite tree sets, with a real but repairable gap in the topological half and an abstract that overstates the theorem. read the letter →

arxiv 1908.10327 v1 pith:LJVFQMHH submitted 2019-08-27 math.CO

J. Pascal Gollin , Jay Lilian Kneip This is my paper · ORCID

classification math.CO MSC 05C0505C6306A06

keywords treesetsseparationsystemsinfinitetreestree-likespacesgraph-likepseudo-arcslimitedgestame

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

Tree sets are nested families of abstract separations that model tree-like structures in combinatorics, from tree-decompositions to tangles. Finite tree sets are already known to be representable as the edge tree sets of finite graph-theoretic trees; this paper extends that representation theory to infinite tree sets. It proves that a regular tree set is isomorphic to the edge tree set of an ordinary (possibly infinite) tree exactly when it contains no chain of order type $\omega+1$ (no infinite ascending sequence capped by a top element), and that every regular tree set, without exception, is isomorphic to the edge tree set of a suitably constructed 'tree-like space'—a compact topological analogue of a tree that can possess limit edges. The upshot is a complete geometric model: every regular infinite tree set, however wild, is the edge tree set of some concrete tree-like object.

What carries the argument

The load-bearing object is an order-geometric correspondence between a regular tree set $\tau$ and a space $T(\tau)$ whose vertices are the consistent orientations of $\tau$ and whose edges are the unoriented separations. Each oriented separation $\vec e$ is maximal in a unique consistent orientation $O(\vec e)$; the edge corresponding to $\vec e$ joins $O(\vec e)$ to $O(\bar e)$, and the partial order of $\tau$ is recovered by a subbase of open sets $S(\vec e,r)$ that point toward the vertex where $\vec e$ is maximal. In the tame case only the splitting orientations are kept as vertices and the space reduces to an ordinary tree. The decisive technical claim is that the set $P(u,v)=\bigcup\{\bar e:\vec e\in v\setminus u\}$ is the unique pseudo-arc between $u$ and $v$ in $T(\tau)$, and this uniqueness is what turns the order-preserving bijection into an isomorphism of tree sets.

What would settle it

Take a regular tree set containing a chain of order type $\omega+1$ with no trivial separations and compute its space $T(\tau)$. The theorem predicts that for the two endpoint orientations $u,v$ the set $P(u,v)$ is a compact connected pseudo-arc whose every edge separates $u$ from $v$. If for some such $\tau$ the set $P(u,v)$ is disconnected, non-compact, or two distinct pseudo-arcs with the same endpoints appear, then Theorem 4.15(2) is false.

Watch

Extended reading notes

Core claim

The paper's central discovery is a pair of representation theorems. First, for a regular tree set $\tau$ that is tame—no chain of order type $\omega+1$—the consistent orientations that split $\tau$ can be made the vertices of a graph-theoretic tree $T(\tau)$, with edges the unoriented separations of $\tau$; this tree is isomorphic to the original when $\tau$ came from a tree, and $\tau$ is isomorphic to $\tau(T(\tau))$. Second, for an arbitrary regular tree set, the same idea works with all consistent orientations as vertices and a topology added, yielding a compact connected graph-like space $T(\tau)$ (a topological space built from vertices and edges, with a Hausdorff topology that allows limit edges) that is tree-like, in that any two vertices are joined by a unique pseudo-arc (a compact connected sub-space whose every edge is needed to separate its endpoints). Every regular $\tau$ is isomorphic to the edge tree set of $T(\tau)$, and every tree-like space is isomorphic to $T(\tau(T))$. This overcomes the $\omega+1$ obstruction: tree-like spaces may have limit edges, so chains of any order type can be represented.

Load-bearing premise

The representation theorem for arbitrary regular tree sets rests on the imported pseudo-arc statement that, for any two consistent orientations $u,v$ of $\tau$, the set $P(u,v)$ built in Lemma 4.13 is the unique pseudo-arc between them in $T(\tau)$; if that set can fail to be compact, connected, or unique, the isomorphism $\tau\cong\tau(T(\tau))$ may collapse.

Editorial extensions

If this is right

Every regular tree set, even one with chains of order type $\omega+1$, is isomorphic to the edge tree set of a compact connected tree-like space, so order-theoretic questions about such tree sets can be translated into topological questions.
The tame regular tree sets are exactly the edge tree sets of ordinary infinite trees, with a chain of order type $\omega+1$ as the only obstruction.
Inclusion of regular tree sets corresponds to taking minors of the representing tree-like spaces, and minors of tree-like spaces correspond to subsets of their edge tree sets.
The constructions are idempotent up to isomorphism: $T(\tau(T))\cong T$ and $\tau(T(\tau))\cong\tau$ for every tree-like space $T$, with the analogous statements holding for tame tree sets and ordinary trees.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

If this representation is treated as canonical, then consistent orientations that are not splitting become limit points of the tree-like space, giving a concrete geometric reading of abstract tangles as 'directions' in the space.
The topology on $T(\tau)$ suggests a natural notion of convergence of separations; proving a compactness theorem for this convergence could yield a geometric proof of tangle–tree duality for regular tree sets.
A testable extension: for tree sets with dense chains, the cofinality of the chain should control whether the corresponding pseudo-arcs are metric or non-metric, so computing the topological dimension of $T(\tau)$ may classify tree sets by the shape of their limit chains.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

You should know two things about this paper. First, it proves something genuinely new: regular tame tree sets are exactly the edge tree sets of graph-theoretic trees, and regular tree sets are exactly the edge tree sets of the new "tree-like spaces" with limit edges. Second, the second theorem has a load-bearing gap in the proof as written, and the abstract overclaims by dropping the word "regular". Neither problem is fatal, but both need fixing before I would trust the paper as more than a strong preprint.

Section 3 is the best part. The proof that a tree set without an ω+1 chain is represented by an actual tree is clean and mostly self-contained. The construction of T(τ) from splitting orientations is natural, the flip-lemma arguments are honest, and the bijection proofs in Lemmas 3.7 and 3.8 are convincing. This alone is a solid contribution, extending Diestel's finite result in exactly the right direction.

Section 4 is more ambitious and more fragile. The topological constructions are sophisticated: the sub-base topology, the Alexander sub-base argument for compactness, and the connectedness proof are real mathematics and, as far as I can tell, correct. But Lemma 4.13, which carries Theorem 4.15(2), asserts that the union P(u,v) of edges along the chain v\u is the unique pseudo-arc between u and v. The footnote says this follows from machinery in [1] or by repeating the connectedness proof, but neither the precise citation nor the direct verification is supplied. The stress-test is right: P(u,v) is an arbitrary union of closed edges, and compactness is not automatic in a graph-like space. If the cited machinery from [1] really covers this, fine, but the paper should say exactly which theorem in [1] does the work. As it stands, an editor or referee cannot check this step without reconstructing it.

Smaller issues: the abstract says "every infinite tree set" where Theorem 4.15 says "every regular tree set"; that is a simple but real overstatement. There are also a few "easy to check" and "not hard to verify" moments in Lemmas 4.14 and 4.17 that are probably fine for the intended audience but could be tightened.

Who is this for? People working in abstract separation systems, tangles, and infinite graph theory. The categorical flavour is new, and if the pseudo-arc gap gets fixed, this will be a useful and citable paper. I would send it to peer review, not desk-reject it, but I would ask the authors to make Lemma 4.13 verifiable and to correct the abstract.

Referee Report

3 major / 5 minor

Summary. The paper studies representations of infinite tree sets, which are nested separation systems with no trivial elements. It proves two classification theorems: a tree set is isomorphic to the edge tree set of a graph-theoretic tree iff it is regular and tame (no chain of order type ω+1), and a tree set is isomorphic to the edge tree set of a 'tree-like space' (a compact graph-like space satisfying tree-like properties) iff it is regular. The proofs construct a tree T(τ) from splitting orientations for the tame case, and a tree-like space T(τ) from all consistent orientations for the general case, and establish the corresponding round-trip isomorphisms. The paper also proves monotonicity results for inclusions and minors. The main new content is the topological representation via tree-like spaces.

Significance. If correct, the results give a complete and clean classification of representable tree sets and introduce a natural topological notion of tree that accommodates limit edges. The constructions are explicit and several auxiliary results (e.g., compactness of T(τ), connectedness, and edge-deletion properties) are proved in the paper. The paper is a valuable bridge between abstract separation systems and graph-like spaces. However, the central representation theorem for tree-like spaces depends on an unproved pseudo-arc identification in Lemma 4.13, and the abstract and introduction overstate the results by omitting the regularity condition.

major comments (3)

[§4.5, Lemma 4.13 (footnote **)] The proof of Lemma 4.13 asserts that for vertices u,v of T(τ1) the set P(u,v) = ⋃{*e | →e ∈ v\u} is the unique pseudo-arc with end-vertices u and v. This assertion is not proved; the footnote either refers to machinery from [1] or promises a direct verification that is not carried out. In particular, compactness of P(u,v) is not automatic for an arbitrary union of closed edges along a chain, and without compactness P(u,v) is not a pseudo-arc. The subsequent inclusions P(y,v) ⊆ P(x,v) ⊆ P(x,w), which are used to prove that φ is order-preserving, therefore lack justification. Since Lemma 4.13 is the core of Theorem 4.15(2), the main representation theorem is incomplete. Please provide the missing proof or state precisely which result of [1] applies and verify its hypotheses.
[Abstract and §1, Theorems 1 and 2] The abstract states that 'every infinite tree set' can be represented, and Theorem 2 in the introduction states that 'Every tree set is isomorphic to the edge tree set of a suitable tree-like space.' Similarly, Theorem 1 states that every tree set without a chain of order type ω+1 is isomorphic to the edge tree set of a tree. However, Theorem 3.9(1) requires the tree set to be regular and tame, and Theorem 4.15(1) requires regularity. Since edge tree sets of trees and tree-like spaces are always regular, non-regular tree sets (e.g., a single unoriented separation with →s < ←s) are counterexamples to these overstatements. The statements should be corrected to 'regular tame' and 'regular', respectively.
[§4.4, definition of the sub-base] The sub-base of the topology on T(τ) is not well-defined as written: the sets S(→e,r) are defined only for →e ∈ O1, but the sub-base is then taken over all →e ∈ τ. Moreover, the sets E+(→e) and E−(→e) are defined relative to the chosen orientation O1, and the claim that the topology is independent of this choice is not proved. Because T(τ) is the central object in Theorem 4.15, the definition must be made precise (for example, by defining S(→e,r) for every →e via the member of {→e,←e} that lies in O1) and the invariance should be proved.

minor comments (5)

[§4.4] The notation *e for the closed edge (presumably ι_e([0,1])) is used but never defined; please define it.
[§4.5, Lemma 4.18] Lemma 4.18 duplicates Lemma 4.3 and is stated without proof; it should be removed or replaced by a reference.
[§3.3, proof of Lemma 3.7] The sentence 'Redoing the proof of Lemma 3.6 ...' is a very compressed argument for the order-preserving property; a direct argument would improve readability.
[§3.3, Theorem 3.10] Theorem 3.10 is said to be a special case of Theorems 4.16 and 4.17, but the reduction from tree-like spaces to graph-theoretic trees is not immediate and should be explained.
[§4.5, proof of Theorem 4.17] The assertion about the unique pseudo-arc in the contraction having point set {[x] ∈ T1 | x ∈ P(v,w)} is stated without proof; since this is a key step, a proof or a reference should be provided.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the representation proofs are explicit constructions checked by bijections; the one load-bearing external premise is cited from prior independent work, not from the paper's own claims.

full rationale

This is a pure mathematical paper with no fitted parameters, empirical inputs, or data. The central claims, Theorem 3.9 and Theorem 4.15, are proved by explicit constructions: for a tree set τ, the paper builds a tree Tpτq (or tree-like space Tpτq) and then defines an explicit bijection φ from τ to the edge tree set τpTpτqq, checking that φ preserves the order and involution. These checks are carried out directly in Lemmas 3.7 and 4.13. The converse directions, Lemmas 3.8 and 4.14, also define explicit maps and verify bijectivity and order preservation. No step in these arguments defines a concept in terms of the target result, and no fitted quantity is renamed as a prediction. The references used are to prior independent literature: the Extension Lemma is cited from Diestel [2], and the pseudo-arc machinery is cited from Bowler, Carmesin and Christian [1]. Neither of these is authored by the present authors, so there is no self-citation chain. The one potentially load-bearing external premise is in Lemma 4.13, where the set Ppu,vq = ⋃{˚e | →e ∈ v \ u} is asserted to be 'the unique pseudo-arc in T with u and v as end-vertices'. The footnote states: 'This follows immediately if one uses the machinery established in [1], which we do not introduce here. Alternatively one can show the connectedness of Ppu,vq by repeating the proof that Tpτ1q is connected, and verifying the other properties of a pseudo-arc directly.' This is a missing proof or an omitted verification of an external fact, and it is indeed load-bearing for Theorem 4.15(2). However, relying on a cited result from a different paper is not circular reasoning: the premise is not the paper's own conclusion, nor is it defined in terms of the target statement. The compactness and uniqueness of Ppu,vq are not derived from the theorem being proved. Thus the paper's derivation chain does not reduce to its own inputs. The correct finding is no significant circularity, with a caveat that the rigor of Lemma 4.13 depends on the cited pseudo-arc machinery from [1] or on the promised but not included direct verification.

Assumptions & free parameters 0 free parameters · 5 assumptions · 1 invented entities

The paper contributes definitions, constructions and proofs on top of the established theories of separation systems (Diestel) and graph-like spaces (Thomassen-Vella; Bowler-Carmesin-Christian). No free parameters are fitted. The main new entity, tree-like spaces, is the paper's own object and carries no independent evidence beyond the theorems proven here.

assumptions (5)

standard math ZFC set theory
All arguments are carried out in ordinary mathematical practice with choice, as Zorn's Lemma is used in Theorem 4.6.
standard math Extension Lemma for separation systems (Diestel [2])
Lemma 2.2 is cited from [2] and used to extend partial orientations to consistent orientations, a key step in defining orientations and splitting stars.
domain assumption Pseudo-arc machinery for graph-like spaces (Bowler-Carmesin-Christian [1])
Lemma 4.10, Lemma 4.4 and related definitions are taken from [1]; the paper relies on the existence and properties of pseudo-arcs and pseudo-circles in graph-like spaces.
standard math Alexander sub-base theorem
Used in Lemma 4.11 to prove compactness of Tpτq from a sub-base open cover.
domain assumption Every compact connected graph-like space is pseudo-arc connected (Theorem 4.6)
Proved in the paper but relies on Zorn's lemma and standard topology; it is a general fact about graph-like spaces.

invented entities (1)

Tree-like spaces
purpose: Topological generalisation of infinite trees that allows limit edges, used to represent every regular tree set as an edge tree set.
A new class of topological spaces introduced in Definition 4.8; the only evidence for its utility is the representation theorem proved within the paper, with no external independent verification beyond the paper's own constructions.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Representations of infinite tree-sets." pith.science (2026). https://pith.science/paper/LJVFQMHH

@misc{pith2026190810327,
  author       = {Pith},
  title        = {Pith review of: Representations of infinite tree-sets},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/LJVFQMHH}},
  note         = {Machine review of arXiv:1908.10327}
}

abstract

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets. First we characterise those tree sets that can be represented by tree sets arising from infinite trees; these are precisely those tree sets without a chain of order type ${\omega+1}$. Then we introduce and study a topological generalisation of infinite trees which can have limit edges, and show that every infinite tree set can be represented by the tree set admitted by a suitable such tree-like space.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

10 extracted references · 6 canonical work pages

[1]

Bowler, J

N. Bowler, J. Carmesin, and R. Christian,Inﬁnite graphic matroids, Combinatorica 38 (2018), no. 2, 305–339, DOI10.1007/s00493-016-3178-3. MR3800843Ò1, 4.1, 4.1, 4.1, 4.4, 4.2, 4.10,‖,∗∗

work page 2018
[2]

Diestel,Abstract separation systems, Order 35 (2018), no

R. Diestel,Abstract separation systems, Order 35 (2018), no. 1, 157–170, DOI10.1007/s11083-017- 9424-5. MR3774512Ò1, 2.2

work page 2018
[3]

1, 171–192, DOI10.1007/s11083-017-9425-4

, Tree sets, Order 35 (2018), no. 1, 171–192, DOI10.1007/s11083-017-9425-4. MR3774513Ò1, 3.1

work page 2018
[4]

Diestel and S.-i

R. Diestel and S.-i. Oum,Tangle-tree duality in abstract separation systems(2017), available at arXiv:1701.02509. Preprint.Ò1

arXiv 2017
[5]

Preprint.Ò1

, Tangle-tree duality: in graphs, matroids and beyond(2017), available at arXiv:1701.02651. Preprint.Ò1

arXiv 2017
[6]

Tangles and the Mona Lisa

R. Diestel and G. Whittle,Tangles and the Mona Lisa(2016), available at arXiv:1603.06652. Preprint. Ò1

work page Pith review arXiv 2016
[7]

Robertson and P

N. Robertson and P. D. Seymour,Graph minors. X. Obstructions to tree-decomposition, J. Combin. Theory Ser. B52 (1991), no. 2, 153–190, DOI10.1016/0095-8956(91)90061-N. MR1110468Ò1

1991
[8]

Robertson, P

N. Robertson, P. Seymour, and R. Thomas,Excluding inﬁnite minors, Discrete Math.95 (1991), no. 1- 3, 303–319, DOI10.1016/0012-365X(91)90343-Z. Directions in inﬁnite graph theory and combinatorics (Cambridge, 1989). MR1141945Ò1

work page 1991

Show all 10 references

[9]

P. D. Seymour and R. Thomas,Graph searching and a min-max theorem for tree-width, J. Combin. Theory Ser. B58 (1993), no. 1, 22–33, DOI10.1006/jctb.1993.1027. MR1214888Ò1

1993
[10]

Thomassen and A

C. Thomassen and A. Vella,Graph-like continua, augmenting arcs, and Menger’s theorem, Combina- torica 28 (2008), no. 5, 595–623, DOI10.1007/s00493-008-2342-9. MR2501250Ò1, 4.1 E-mail address: pascal.gollin@uni-hamburg.de E-mail address: jakob.kneip@studium.uni-hamburg.de F ach...

2008

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.

[1] [1]

Bowler, J

N. Bowler, J. Carmesin, and R. Christian,Inﬁnite graphic matroids, Combinatorica 38 (2018), no. 2, 305–339, DOI10.1007/s00493-016-3178-3. MR3800843Ò1, 4.1, 4.1, 4.1, 4.4, 4.2, 4.10,‖,∗∗

work page 2018

[2] [2]

Diestel,Abstract separation systems, Order 35 (2018), no

R. Diestel,Abstract separation systems, Order 35 (2018), no. 1, 157–170, DOI10.1007/s11083-017- 9424-5. MR3774512Ò1, 2.2

work page 2018

[3] [3]

1, 171–192, DOI10.1007/s11083-017-9425-4

, Tree sets, Order 35 (2018), no. 1, 171–192, DOI10.1007/s11083-017-9425-4. MR3774513Ò1, 3.1

work page 2018

[4] [4]

Diestel and S.-i

R. Diestel and S.-i. Oum,Tangle-tree duality in abstract separation systems(2017), available at arXiv:1701.02509. Preprint.Ò1

arXiv 2017

[5] [5]

Preprint.Ò1

, Tangle-tree duality: in graphs, matroids and beyond(2017), available at arXiv:1701.02651. Preprint.Ò1

arXiv 2017

[6] [6]

Tangles and the Mona Lisa

R. Diestel and G. Whittle,Tangles and the Mona Lisa(2016), available at arXiv:1603.06652. Preprint. Ò1

work page Pith review arXiv 2016

[7] [7]

Robertson and P

N. Robertson and P. D. Seymour,Graph minors. X. Obstructions to tree-decomposition, J. Combin. Theory Ser. B52 (1991), no. 2, 153–190, DOI10.1016/0095-8956(91)90061-N. MR1110468Ò1

1991

[8] [8]

Robertson, P

N. Robertson, P. Seymour, and R. Thomas,Excluding inﬁnite minors, Discrete Math.95 (1991), no. 1- 3, 303–319, DOI10.1016/0012-365X(91)90343-Z. Directions in inﬁnite graph theory and combinatorics (Cambridge, 1989). MR1141945Ò1

work page 1991