Pith. sign in

REVIEW 3 major objections 4 minor 1 cited by

Combinatorial examples and applications of 2-Segal sets

T0 review · 3 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash

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

Pith's one-line read Finite graphs and rooted trees carry explicit 2-Segal sets whose Hall algebras can be computed by hand.

desk verdict A clear, honest survey of 2-Segal sets with worked graph and double-category examples that check out; the tree section rests on an unpublished preprint and an informal, circular definition, so the tree Hall algebra material cannot be independently verified as written. read the letter →

arxiv 2411.18544 v1 pith:ITAMRGCM submitted 2024-11-27 math.AT math.COmath.CT

Julia E. Bergner This is my paper · ORCID
classification math.ATmath.COmath.CT MSC 55U1018N50
keywords 2-SegalsetsHallalgebrasWaldhausenS-constructionsimplicialrootedtreesfinitegraphsdoublecategoriesdecompositionspaces
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

This is an introduction to 2-Segal sets aimed at readers who want to see the structure without heavy homotopy theory. The paper's central assertion is that the 2-Segal condition, a weakening of Segal's condition under which composition need not exist or be unique, is realized by two concrete families: simplicial sets $X^G$ attached to finite graphs and $X^T$ attached to rooted trees. Both families are shown to be 2-Segal, and the paper works out what the two main constructions, Hall algebras and a discrete Waldhausen $S_\bullet$-construction, return on these examples. If the exposition is correct, a reader can compute Hall algebra products such as $a\cdot b$ in the graph case and $a\cdot b=G$ in the rooted-tree case directly from the simplicial structure, and can see how reduced 2-Segal sets correspond to pointed stable double categories.

What carries the argument

The central objects are the simplicial sets $X^G$ and $X^T$ built from subobjects of a graph or tree, together with the 2-Segal maps $X_n \to X_2 \times_{X_1} \cdots \times_{X_1} X_2$ induced by triangulations of an $(n+1)$-gon. The mechanism is that a 2-simplex with faces $d_2(x)$ and $d_0(x)$ supplies a possibly non-unique composite $d_1(x)$, and a 3-simplex with given boundary 2-simplices supplies associativity; the 2-Segal condition says every polygon triangulation determines a unique top simplex. The paper also uses the path space criterion: a simplicial set is 2-Segal exactly when its left and right path spaces (décalages) are 1-Segal, which turns the condition into a check about nerves of categories. Finally, the equivalence $S_\bullet \simeq P$ carries reduced 2-Segal sets to pointed stable double categories, where stability means each square is uniquely determined by its span of sources and independently by its cospan of targets.

What would settle it

Compute the 1-simplices and the 2-Segal map of $X^T$ for a small labeled rooted tree, such as a three-vertex chain, using the cited precise definition of admissible subforest; if the resulting set of subforests differs from the list generated by Definition 5.3, then Example 6.6 and Proposition 6.7 would need correction. Alternatively, check whether $X^T_3 \to X^T_2 \times_{X^T_1} X^T_2$ is a bijection for that tree under the face-map definition; any failure would contradict Theorem 5.5.

Watch

Extended reading notes

Core claim

The discovery, on the paper's own terms, is that 2-Segal sets form a combinatorial, hand-computable setting rather than only a homotopical one. For a finite graph $G$, the simplicial set $X^G$ has a single 0-simplex, subgraphs as 1-simplices, and $n$-simplices given by a subgraph together with an ordered partition of its vertices into $n$ possibly empty parts; the paper asserts that each such $X^G$ is 2-Segal, with face maps cutting and merging blocks of the partition. For a rooted tree $T$, the same shape is built from admissible subforests and layers of admissible cuts, and again $X^T$ is 2-Segal, with the Segal map injective but not surjective. The Hall algebra of a 2-Segal set counts 2-simplices with prescribed faces; on graph examples this makes $a\cdot b$ the sum of all subgraphs on the two vertices $\{a,b\}$, while on the rooted-tree example $a\cdot b=G$ and $b\cdot a=0$, exhibiting noncommutativity. The paper also presents the discrete Waldhausen construction $S_\bullet$ and the path-space construction $P$, together with the equivalence $S_\bullet \simeq P$ between pointed stable double categories and reduced 2-Segal sets, so that each graph or tree example comes with an explicit double-categorical description.

Load-bearing premise

The load-bearing premise is that the paper's informal Definition 5.3, which says admissible subforests are whatever comes out of face maps along admissible cuts, faithfully captures the more precise definition in the cited earlier work; the tree theorem and the tree Hall algebra computations change if those two notions differ.

Editorial extensions

If this is right

  • Every finite graph $G$ yields an associative, unital Hall algebra whose basis is the subgraphs of $G$, with product $H\cdot K$ nonzero only when $H$ and $K$ are vertex-disjoint, in which case it is the sum of all subgraphs obtained by adding edges between $H$ and $K$.
  • Every nontrivial rooted tree yields a noncommutative Hall algebra with 0/1 structure constants: $H\cdot K$ is the sum of trees admitting an admissible cut separating $H$ from $K$, and reversing the order changes the cut direction.
  • The equivalence between reduced 2-Segal sets and pointed stable double categories makes the graph and tree examples into concrete instances of the discrete Waldhausen construction, so their associated double categories can be described explicitly from simplices.
  • The path space criterion gives a finite check for 2-Segal-ness: verify that $P^\triangleleft X$ and $P^\triangleright X$ are nerves of categories, which is how the partial monoid nerve $M_\bullet$ is seen to be 2-Segal but not 1-Segal.

Reading between the lines

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

  • Extension: If Definition 5.3 matches the precise definition in the cited earlier work, the tree Hall algebra is essentially the incidence algebra of the poset of admissible subforests ordered by inclusion, with structure constants recording cut layers; the paper does not name this poset.
  • Extension: The graph construction suggests a general template: any incidence structure with a notion of disjoint union and a notion of vertex sets will produce a 2-Segal set by ordered partitions of a base set, and the Hall product becomes a convolution over that incidence structure; testing this on other families, such as matroids, would be a natural next step.
  • Extension: Because the paper's proof of the tree theorem is delegated to an unpublished source, a reader cannot yet verify the tree combinatorics from this paper alone; a self-contained proof of Theorem 5.5 would be needed before the tree Hall algebras can be treated as fully established.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 4 minor

Summary. The paper is an expository introduction to 2-Segal sets in the discrete setting. It reviews simplicial sets, 1-Segal sets, and 2-Segal sets; presents two families of examples, the simplicial sets X^G attached to a finite graph (Section 4) and X^T attached to a rooted tree (Section 5), quoting the 2-Segal property for these from the author's earlier papers [3] and [2]; and then applies these examples to Hall algebras (Section 6) and to the discrete Waldhausen S_•-construction, including the equivalence S_• ≃ P between pointed stable double categories and reduced 2-Segal sets (Section 7, quoted from [3]). The main contribution is expository: it collects these constructions and provides worked computations such as the Hall algebra of a two-vertex graph and of the same graph viewed as a rooted tree.

Significance. If the exposition were fully self-contained, the paper would serve a useful purpose: the 2-Segal literature is largely homotopical, and this manuscript makes the definition and its algebraic consequences accessible through finite examples. The graph material (Theorem 4.3 with the 3-simplex argument, Examples 6.3 and 6.4, Proposition 6.5) and the S_•-material (Theorems 7.6 and 7.10, Examples 7.11 and 7.12) give concrete, reproducible computations grounded in the published paper [3]. The paper is also honest about what it quotes and what it only sketches. However, the tree section does not meet the same standard of self-containedness, and since the tree Hall computation in Example 6.6 is one of the two advertised families of examples, this is a substantive gap rather than a cosmetic one.

major comments (3)
  1. [Section 5, Definition 5.3] The definition of 'admissible subforest' is not a definition as written. It says an admissible subforest is 'any forest (or tree) obtained from face maps along admissible cuts,' but face maps belong to the simplicial set X^T of Definition 5.4, which is itself defined in terms of the set of admissible subforests. The paper explicitly states that the reader should consult [2] for 'a more nuanced definition' and that the given one 'can be made more precise.' Since [2] is an unpublished preprint, the tree examples in Sections 5 and 6 cannot be checked from the manuscript. I recommend giving a precise recursive definition of admissible subforest and of layering, or quoting the exact definition from [2] and proving that it is equivalent to the sketch.
  2. [Section 6, Example 6.6] The computation that H(X^T) is 4-dimensional, with a·b = G and b·a = 0, depends critically on excluding a ⊔ b from X^T_1. That exclusion is a consequence of the informal Definition 5.3. If the precise definition in [2] differs in any way, for example by allowing disconnected upper forests or by treating the root differently, the basis and multiplication in Example 6.6 and the statements in Proposition 6.7 would change. Since the paper's expository promise is that a reader can reproduce the Hall algebra computations, this load-bearing computation must be supported by a precise definition inside the paper, not merely by a pointer to an unpublished preprint.
  3. [Section 5, Theorem 5.5] The 2-Segal property for X^T is quoted from the unpublished preprint [2] and is only illustrated for one 3-simplex shape in Figure 1. Without a precise definition of admissible subforest, the statement of the theorem is not fully well-posed for a reader of this paper. This is not a criticism of the theorem itself, but of the exposition: either the precise definition and a proof sketch should appear here, or the tree section should be explicitly framed as conditional on [2]. As it stands, the graph examples are self-contained, but the tree examples are not.
minor comments (4)
  1. [Section 7, Definition 7.3] The displayed maps that are asserted to be bijections are missing: the text reads 'so that the maps and are bijections' with no maps shown. Please insert the omitted diagrams or a precise description of the source and target maps.
  2. [Section 7, Definition 7.5] The diagram defining S_n(C) is visibly garbled in the text; the rows and columns do not render as an array. A clean commutative diagram or a formal description of the diagrams in terms of functors from W2 would improve readability.
  3. [Section 5, after Definition 5.2] The sentence 'Similarly to graphs equipped with an ordered partition of their edges' should presumably say 'vertices', since the graph construction X^G in Definition 4.1 uses partitions of vertices, not edges.
  4. [Section 6, Proposition 6.7] The phrase 'an admissible cut between H and K' in the bullet list is used without definition; please add a definition or a reference to make the statement precise.

Circularity Check

3 steps flagged · score 4.0 of 10

Expository paper mostly restates author's prior results; tree section rests on an explicitly informal definition and an unpublished preprint, so its Hall algebra computations cannot be independently verified as written.

  1. self citation load bearing [Theorem 5.5 and Proposition 5.6, Section 5; also Proposition 6.7 and Example 6.6, Section 6]
    "Theorem 5.5. [2] For any rooted tree T , the simplicial set X T is 2-Segal. ... Proposition 5.6. [2] If T is a labelled tree with vertex set V , then the Segal map (d0, d2) : X T 2 → X T 1 × X T 1 is injective. ... We refer the reader to [2] for these definitions and more details."

    The central claim that X^T is 2-Segal, the injectivity of its Segal map, and the tree Hall algebra properties are all quoted from the authors' unpublished preprint [2], with only a sketch ('The idea is that rigidity in the definition of a cut...') and an example. No proof is given in this paper, and [2] is not publicly available, so the load-bearing mathematical content is not independently verifiable here and reduces to a self-citation.

  2. self definitional [Definition 5.3 and Definition 5.4, Section 5; used in Example 6.6 and Proposition 6.7]
    "An admissible subforest of T is any forest (or tree) obtained from face maps along admissible cuts. Formalizing the idea described above, we make the following definition. Definition 5.4. ... X T 1 is the set of admissible subforests of T ; ..."

    The paper defines X^T_1 as the set of admissible subforests, and defines an admissible subforest as 'any forest (or tree) obtained from face maps along admissible cuts.' Face maps are maps of the simplicial set X^T itself, so the set of 1-simplices is defined as the image of the very structure it is supposed to define. The paper explicitly disclaims precision: 'We refer the reader to [2] for a more nuanced definition, and simply suggest here that the following one can be made more precise.' The worked computation Example 6.6 (a·b = G, excluding a⨿b) depends on exactly this informal definition, so the tree Hall algebra example cannot be checked from the paper as written.

1 more flagged steps
  1. other [Section 7, Theorem 7.6 and Theorem 7.10]
    "Theorem 7.6. [3, 4.8] If D is a pointed stable double category, then the simplicial set S•(D) is a 2-Segal set. ... Theorem 7.10. [3, 6.1] The functors S• and P define an equivalence of categories S• : SDC ∗ ≃↔ 2Seg∗ : P."

    The discrete Waldhausen construction is presented as an application, but its main theorems are both quoted from the author's joint paper [3]. The proof of Theorem 7.6 is only an 'Idea of the proof', and Proposition 7.9 is also quoted from [3]. This is self-citation, but it is less severe than the tree case because [3] is a published, externally reviewed paper and the cited results are the original research source; the expository material here does not claim to re-derive them.

full rationale

The paper is explicitly an exposition: it reviews 2-Segal sets (from independently published work [5], [7]), gives examples from graphs and trees, and works out Hall algebras and the discrete Waldhausen construction on these examples. The graph section is substantially self-contained: Theorem 4.3 is quoted from the published [3], and the 3-simplex argument in Section 4 gives a concrete justification of the 2-Segal condition for that example. The Hall algebra computations for graphs (Example 6.3, Proposition 6.5) follow directly from the explicit description of X^G and are independently checkable from the text. The double-category section is largely a restatement of the author's joint paper [3], with proofs sketched; because [3] is published and the equivalence S• ≃ P is the original theorem being expounded, this is ordinary self-citation in an expository context rather than a constructed reduction. The significant problem is the tree section: Theorem 5.5 (X^T is 2-Segal), Proposition 5.6, and the tree Hall algebra properties in Proposition 6.7 are all quoted from the unpublished preprint [2], and the paper's own Definition 5.3 defines admissible subforests in terms of face maps of the very simplicial set X^T being defined, with the text admitting 'We refer the reader to [2] for a more nuanced definition, and simply suggest here that the following one can be made more precise.' The concrete computation in Example 6.6 (a·b = G, with a⨿b excluded) depends on this informal, self-referential definition, so the tree example cannot be reproduced from the paper alone. This makes the central expository promise partially unmet and justifies a score of 4: the graph and double-category content is independently grounded, while the tree content is load-bearing self-citation resting on an informal definition tied to the simplicial set it defines.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

No parameters are fitted anywhere, since the paper is an exposition with no numerics. The central claims rest on three pillars: the standard simplicial and categorical formalism in section 2, the 2-Segal theory developed in the published book [5] and paper [7], and the specific constructions X^G, X^T, and S_•, whose 2-Segal property is taken from the author's own papers [3] and [2]. The tree section additionally depends on the informal Definition 5.3 being a faithful stand-in for [2]'s precise definitions, a premise the author explicitly flags as needing refinement.

assumptions (4)
  • standard math Standard simplicial set formalism: Yoneda lemma, face and degeneracy maps, nerves of categories.
    Invoked throughout section 2 as unproved background; this is standard material in the field.
  • domain assumption The cited theorems are correct: X^G is 2-Segal (Theorem 4.3 from [3]), X^T is 2-Segal (Theorem 5.5 from [2]), S_•(D) is 2-Segal (Theorem 7.6 from [3]), and S_• and P are inverse equivalences (Theorem 7.10 from [3]).
    The proofs in the present paper are sketches or illustrations; verification is entirely delegated to [3] and to the unpublished preprint [2].
  • domain assumption Path Space Criterion (Theorem 7.8): a simplicial set X is 2-Segal if and only if its path spaces P^◁X and P^▷X are 1-Segal sets.
    Quoted from [5] and [7] without proof; it is used to assemble the double category PX from a 2-Segal set.
  • ad hoc to paper Definition 5.3's informal notion of admissible subforest is a faithful stand-in for the precise definition in [2].
    The paper says the definition 'can be made more precise' and refers the reader to [2]; all tree examples and Proposition 6.7 depend on this assumed faithfulness.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Combinatorial examples and applications of 2-Segal sets." pith.science (2026). https://pith.science/paper/ITAMRGCM

@misc{pith2026241118544,
  author       = {Pith},
  title        = {Pith review of: Combinatorial examples and applications of 2-Segal sets},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ITAMRGCM}},
  note         = {Machine review of arXiv:2411.18544}
}
abstract

We give an introduction to the theory of 2-Segal sets, and two of the main applications of them: Hall algebras and a discrete version of Waldhausen's $S_\bullet$-construction. We present several combinatorial examples and how these constructions can be applied to them.

Figures

Figures reproduced from arXiv: 2411.18544 by the authors.

Figure 1
Figure 1. 2-Segal maps for XT . Definition 5.3. An admissible subforest of T is any forest (or tree) obtained from face maps along admissible cuts. Formalizing the idea described above, we make the following definition. Definition 5.4. Let T be a labelled rooted tree. We define a simplicial set XT as follows: • XT 0 = {∅}; • XT 1 is the set of admissible subforests of T; and • for n ≥ 2, XT n is the set of all admissible subf… view at source ↗

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. 2-Segal sets and pseudomonoids in the bicategory of spans

    math.CT 2025-05 conditional novelty 4.0 of 10

    2-Segal sets are shown to correspond one-to-one, up to isomorphism, with pseudomonoids in the bicategory of spans, using a graphical proof that avoids higher category theory.

Reference graph

Works this paper leans on

8 extracted references · 6 canonical work pages · cited by 1 Pith paper

  1. [3]

    Bergner, Ang´ elica M

    Julia E. Bergner, Ang´ elica M. Osorno, Viktoriya Ozornova, Martina Rovelli, and Claudia I. Sche- imbauer, 2-Segal sets and the Waldhausen construction, Topology Appl., 235 (2018) 445–484

    work page 2018

  2. [2]

    Bergner, Olivia Borghi, Pinka Dey, Imma G´ alvez-Carrillo, and Teresa Hoekstra-Mendoza, 2-Segal sets from cuts of rooted trees, preprint

    Julia E. Bergner, Olivia Borghi, Pinka Dey, Imma G´ alvez-Carrillo, and Teresa Hoekstra-Mendoza, 2-Segal sets from cuts of rooted trees, preprint

    work page

  3. [1]

    Bergner, Simplicial sets in topology, category theory, and beyond, Matematica 1 (2022), no

    Julia E. Bergner, Simplicial sets in topology, category theory, and beyond, Matematica 1 (2022), no. 4, 886–912

    work page 2022

  4. [4]

    Young, Hall algebras via 2-Segal spaces, preprint available at math.CT/2409.19384

    Benjamin Cooper and Matthew B. Young, Hall algebras via 2-Segal spaces, preprint available at math.CT/2409.19384. 18 J.E. BERGNER

    arXiv

  5. [5]

    Dyckerhoff and M

    T. Dyckerhoff and M. Kapranov, Higher Segal spaces, Lecture Notes in Mathematics, 2244. Springer, Cham, 2019

    work page 2019

  6. [6]

    Greg Friedman, An elementary illustrated introduction to simplicial sets, Rocky Mountain J. Math. 42 (2012), no. 2, 353—423

    work page 2012

  7. [7]

    Math.331 (2018) 952–1015

    Imma G´ alvez-Carrillo, Joachim Kock, and Andrew Tonks, Decomposition spaces, incidence algebras and M¨ obius inversion I: Basic theory,Adv. Math.331 (2018) 952–1015

    work page 2018

  8. [8]

    Department of Mathematics, University of Virginia, Charlottesville, V A 22904 Email address: jeb2md@virginia.edu

    Philip Hackney, The decomposition space perspective, preprint available at math.AT/2409.19061. Department of Mathematics, University of Virginia, Charlottesville, V A 22904 Email address: jeb2md@virginia.edu

    arXiv

Pith tools

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