Pith. sign in

REVIEW 4 major objections 5 minor 1 cited by

Six-Functor Formalisms II : The $\infty$-categorical compactification

T0 review · 4 major / 5 minor · reviewed 2026-08-11 · deepseek-v4-flash

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

Pith's one-line read Exceptional pushforwards exist in any admissible ∞-category

desk verdict A serious written attempt at Liu-Zheng's gluing theorem with genuinely useful combinatorial scaffolding, but the printed proof has a load-bearing gap in the weak-contractibility step and needs revision before it can serve as the citable replacement it aims to be. read the letter →

arxiv 2412.03231 v2 pith:YMSVHCGB submitted 2024-12-04 math.AG math.CT

Chirantan Chowdhury This is my paper · ORCID
classification math.AGmath.CT MSC 18N6014F08
keywords six-functorformalismexceptionalpushforwardinfinity-categoriesgluingfunctorscompactificationscartesiansquaresadmissibleedgesliftingproblems
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 paper proves an ∞-categorical gluing theorem: given two admissible families of edges E1 and E2 in an ∞-category C, any functor defined on grids whose squares are pullbacks extends along the diagonal projection to a functor on C itself. That extension is the abstract version of the exceptional pushforward construction, assembling f! from its values on open immersions and proper maps. The proof splits into two extension theorems, one for commutative grids and one for cartesian grids, and the combinatorial heart is showing that the relevant categories of compactifications and cartesianizations are weakly contractible. If correct, the paper supplies a fully written, simplified proof of a key unpublished gluing theorem used in abstract six-functor formalisms.

What carries the argument

The load-bearing objects are two combinatorial ∞-categories attached to an n-simplex: Kpt(τ), whose objects are ways to realize an n-simplex as a grid with vertical edges in E1 and horizontal edges in E2, and Kart(τ), whose objects are right Kan extensions along an up-set map and which encode decompositions of commutative squares into pullback squares. The arguments show that both are weakly contractible and that the source inclusions □^n ⊂ Cpt^n and ⊞^n_cart ⊂ Cart^n are inner anodyne, so the lifting theorem from [1, Theorem 4.1.1] applies. This reduces the gluing problem to a purely combinatorial statement about partially ordered sets and their admissible edge classes.

What would settle it

Check Lemma 4.1.9 directly: for a 1-morphism with two compactifications, the construction takes a limit in the overcategory C_{E2}/y over a diagram whose edges lie in E1, then uses Remark 4.1.10 to produce refinement maps. If there is an admissible pair (E1,E2) for which those refinement maps land in E2 rather than E1, the cofilteredness proof breaks and weak contractibility of Kpt(τ) is no longer established, so Theorem A does not follow.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1.0.3: for an ∞-category C with admissible edge collections E1 and E2 such that every morphism factors as a morphism in E1 followed by one in E2 and every morphism in E1∩E2 is k-truncated, the lifting problem for the map p:δ∗2C^cart_{E1,E2}→C has a solution for every ∞-category D. The map p, induced by composing along the diagonal of an n×n grid, factors as pcart followed by pcomm, and the paper proves both extension theorems (Theorem 4.2.1 for pcomm and Theorem 5.2.1 for pcart) using a lifting criterion from the companion work. The load-bearing inputs are weak contractibility of the ∞-category Kpt(τ) of compactifications and of the cartesianization category Kart(τ), which encode all ways to decompose a simplex into E1-then-E2 directions and to decompose commutative squares into pullback squares. When both hold, any functor on the cartesian grids extends canonically, giving the exceptional pushforward in the abstract six-functor formalism.

Load-bearing premise

Everything rests on Proposition 4.1.8, the claim that for every simplex the ∞-category Kpt(τ) of compactifications is weakly contractible; the written proof of that claim uses a cofilteredness argument in which the edge classes E1 and E2 are handled in a way that does not obviously match Definition 4.1.7.4.

Editorial extensions

If this is right

  • A functor defined on cartesian grids extends uniquely, up to contractible choice, to all of C, producing the exceptional pushforward in an abstract six-functor formalism.
  • The two-step factorization isolates the role of the k-truncated condition: it is used only in the pcart step, where it lowers the truncation level when moving from commutative to cartesian squares.
  • The result turns Nagata-style compactification decompositions into a formal property of ∞-categories with admissible edge classes, so it applies to any context admitting such classes, not just schemes.
  • The paper gives a written, simplified proof of an unpublished gluing theorem that previously circulated informally and is a core piece of current six-functor formalism constructions.

Reading between the lines

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

  • If weak contractibility of Kpt(τ) holds, the same argument should extend to the symmetric setup with E1 and E2 interchanged, as long as the decomposition condition is adjusted; the paper does not state this explicitly.
  • The k-truncation hypothesis is likely removable from the pcomm half, since Theorem 4.2.1 never uses it; only the pcart step depends on it.
  • The proof strategy suggests that any six-functor formalism satisfying the two admissible-edge conditions automatically produces f! with coherent functoriality; verifying compatibility with composition of arbitrary morphisms in C would be a natural next step.
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

4 major / 5 minor

Summary. The paper aims to prove an ∞-categorical version of the Liu–Zheng gluing construction for exceptional pushforwards in abstract six-functor formalisms. The main theorem (Theorem 1.0.3) states that, under admissibility and a factorization condition on two edge collections E1, E2 in an ∞-category C, the natural map p : δ*_2 C^cart_{E1,E2} → C admits an extension along p for any target ∞-category D. The proof is split into two steps: Theorem 4.2.1 (extension along the map pcomm from commutative grids to C) and Theorem 5.2.1 (extension along the map pcart from Cartesian grids to commutative grids). The key technical input is the author's previous lifting theorem [1, Theorem 4.1.1] (restated as Theorem 3.3.1), whose weak contractibility hypothesis is to be supplied by Proposition 4.1.8 (for pcomm) and Proposition 5.1.9 (for pcart). The paper develops combinatorial tools: multisimplicial sets, the ∞-category of compactifications Kpt(τ), and the ∞-category of cartesianizations Kart(τ), together with inner anodyne inclusions proved in the appendices.

Significance. If the main theorem is correct, it reproduces in written detail a load-bearing gluing theorem that is currently only available in unpublished work of Liu–Zheng. The paper is valuable because it isolates a parameter-free combinatorial statement (Theorem 1.0.3) and separates the proof into two independent extension problems, each governed by a concrete simplicial set (compactifications and cartesianizations). It also contains substantial combinatorial material, such as the inner anodyne results in Appendix A and the limit existence criteria in Appendix B, that could be reused independently. The result would be a useful foundation for rigorous treatments of six-functor formalisms in derived algebraic geometry and p-adic geometry. However, the current manuscript has several unresolved technical gaps in exactly the weak-contractibility statements that carry the proof, so its significance is conditional on those gaps being repaired.

major comments (4)
  1. [Lemma 4.1.9 and Definition 4.1.7.4] There is an inconsistency between the edge classes used to define morphisms of Kpt(τ) and the edge classes used in the cofilteredness proof. Definition 4.1.7.4 declares morphisms of Kpt(τ) to be natural transformations that are pointwise in E1. However, the proof of Lemma 4.1.9 takes limits in the overcategory C_{E2}/y, and Remark 4.1.10 explicitly constructs refinement maps in E2. Proposition B.0.2 only supplies finite limits in overcategories of C_{E2} when the diagrams involved have E2-edges, and it does not apply to diagrams whose edges are in E1 unless one knows E1 ⊆ E2 or that C_{E1}/y has finite limits. No such implication is established. Consequently, the proof of Lemma 4.1.9 does not prove that Kpt(τ) is cofiltered, and Proposition 4.1.8—which is the weak-contractibility hypothesis needed for Theorem 4.2.1—is not established as written.
  2. [Lemma 4.1.9, proof] The proof of Lemma 4.1.9 uses the assertion that 'CE2 admits pullbacks and CE2 → C preserves pullbacks' and that this follows from the hypotheses of the proposition. This does not follow from admissibility as defined in Definition 1.0.2: admissibility of E2 only says that E2 contains identities, is stable under pullbacks, and satisfies the right-cancellation property. It neither asserts that C admits pullbacks nor that the pullbacks of E2-edges exist. Indeed Theorem 4.2.1, which relies on Proposition 4.1.8, has no hypothesis that C admits pullbacks. Thus the proof of Lemma 4.1.9 invokes an unstated pullback-completeness assumption that is absent from the theorem statement.
  3. [Theorem 5.2.1, proof, and Proposition 5.1.9] Theorem 5.2.1 is stated without any assumption that C admits pullbacks, but its proof relies on Proposition 5.1.9, whose explicit hypothesis is 'If C admits pullbacks'. Proposition 5.1.9 is used to conclude that Kart(τ) is a contractible Kan complex, and this contractibility is then used in the proof of Theorem 5.2.1 to verify the weak-contractibility condition of Theorem 3.3.1. Since the hypothesis of Proposition 5.1.9 is not among the hypotheses of Theorem 5.2.1, the proof of Theorem 5.2.1 is incomplete as stated. The same missing assumption also affects the compatibility verification in the induction step over the truncation degree i, because the diagram in Eq. (106) only makes sense for squares that admit the required decompositions.
  4. [Proof of Theorem B, induction on i] The proof of Theorem 5.2.1 proceeds 'by induction on i' and defines g'_cart as the union of the induced maps g^i_cart over i ≥ −2, but the argument does not specify the precise inductive statement nor verify that the extensions g^i_cart agree on the overlaps δ*_2 C^{i-1}_{E1,E2} ∩ δ*_2 C^{i}_{E1,E2} in a way that is compatible with the lifting problem. In particular, the diagram in Eq. (107) introduces a map p^{i-1,2}_{cart} : δ*_2 C^{-2}_{E1,E2} → δ*_2 C^{i-1}_{E1,E2} and then applies the induction hypothesis, but it is not shown that the extension produced for the (i−1)-level can be chosen so that the composed lifting problem with p^{i-1,i}_{cart} is solvable. This is a load-bearing point for the definition of g'_cart on the union, since the union in Eq. (80) is built from all truncation levels.
minor comments (5)
  1. [Throughout] There are numerous typographical errors that impede reading, for example 'The abstract six-functor formalism plays is' in the first sentence of the introduction, 'vibration' instead of 'fibration' in the proof of Theorem 4.2.1, and 'thee case' in the road map. A careful proofreading pass is needed.
  2. [Definition 4.1.7] The notation 'Fun_{E1,E2}(Cpt_n, C)' used in the proof of Proposition 4.1.8 is not defined before first use; the intended definition (functors sending horizontal arrows to E1 and vertical arrows to E2) should be stated explicitly at the point of definition.
  3. [Notation 5.1.13 and Proposition 5.1.15] In Proposition 5.1.15, the notation X appears in Eq. (108) as 'X =' followed by a blank; this is a missing definition or a typesetting error that makes the displayed formula unintelligible. Please correct and define X.
  4. [Section 3.2 and Theorem 3.3.1] The paper cites [1, Theorem 4.1.1] as the main technical engine, but the numbering convention between the present paper and [1] is not synchronized; for instance, the road map discusses 'Theorem 4.2.1' and 'Theorem 5.2.1' before those theorems are stated, and at times refers to 'Section 3.3' when Theorem 3.3.1 is introduced. Please add cross-references and clarify the numbering.
  5. [Remark 5.1.20 and Construction 5.1.19] The definition of ǫ_n in Construction 5.1.19 uses the notation Λ^n_0 and µ^n_0 from Eq. (91), but the proof of Lemma 5.1.18 is only partially given; in particular, part (2) states the identities without proof. Please fill in this justification, since the pullback property in Claim 5.1.22 relies on these identities.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular reduction found: the extension theorems are proved from the parameter-free lifting theorem [1, Thm 4.1.1], whose hypotheses do not include the target results.

full rationale

The paper's central theorem 1.0.3 is split into Theorem 4.2.1 (extension along pcomm) and Theorem 5.2.1 (extension along pcart). Both proofs apply the general lifting criterion restated as Theorem 3.3.1, i.e. [1, Theorem 4.1.1]. That theorem's hypotheses are purely categorical: weak contractibility of certain simplicial sets and compatibility with a given map; they do not mention exceptional pushforwards, compactifications, cartesian grids, or the extension being constructed. The weak-contractibility inputs are Proposition 4.1.8 for pcomm and Proposition 5.1.9 for pcart, both argued in the paper rather than assumed from the conclusion. The compatibility inputs are constructed explicitly: for Theorem 4.2.1 the element in Γ(pcomm*N)_0 is produced from the given simplex in δ*_2 C^{E1,E2} plus gcomm; for Theorem 5.2.1 the analogous ω is built from pullback squares and gcart. Thus the derivation does not define the target functor in terms of itself, nor does it fit a parameter and then rename the fit as a prediction. The reliance on [1] is a self-citation, but it is a parameter-free prior theorem whose assumptions do not include the target result, so under the review rules it is independent support rather than a circularity. The skeptic's criticisms about Proposition 4.1.8 and the unsupported assertion that C_{E2} admits pullbacks are proof-gap or correctness concerns, not circular reductions: the paper may have missing hypotheses or faulty edge bookkeeping, but that does not make the conclusion equivalent to its inputs by construction. The acknowledged dependence on Liu-Zheng [6] for notation and definitions is likewise a transparency issue, not a logical circle. Accordingly, no circular step is identified.

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

The central claim rests on the author's own lifting theorem [1, Theorem 4.1.1] (unproved here, unverified independently), on standard Lurie results from Higher Topos Theory, on an implicit pullback-existence assumption, and on silent adoption of Liu-Zheng's conventions. No free parameters are fitted to data and no entities are invented; the truncation index k and the filtration index i in Theorem B are structural hypotheses or induction parameters, not ad hoc constants.

assumptions (4)
  • domain assumption [1, Theorem 4.1.1]: a lift exists when the slice diagram N is weakly contractible and compatible with f'
    Stated in Section 3.3 as the main technical theorem; proved in the author's prior preprint arXiv:2304.11742, not re-proved here and not independently machine-checked; both Theorems 4.2.1 and 5.2.1 reduce to it.
  • domain assumption C admits pullbacks and the edge classes are pullback-stable
    Admissibility (Definition 1.0.2) presupposes pullback-stability; Proposition 5.1.9 and Appendix B need actual finite limits in overcategories, but Theorem 5.2.1 does not state 'C admits pullbacks'.
  • standard math Standard results of Lurie's Higher Topos Theory are correct and applicable
    Frequent invocations such as [8, Corollary 2.3.2.4], [8, Corollary 2.3.2.5], [8, Lemma 2.1.2.3], [8, Theorem 4.1.3.1], [8, Proposition 4.3.2.15], and [8, Lemma 4.3.2.13].
  • domain assumption Liu-Zheng [6] notational conventions are adopted without recall
    Conventions paragraph: 'The paper relies on notations and definitions from the paper [6]. We shall omit referencing the paper as it will be implicit throughout the article.'

how reviews work

0 comments
Cite this review

Pith. "Pith review of Six-Functor Formalisms II : The $\infty$-categorical compactification." pith.science (2026). https://pith.science/paper/YMSVHCGB

@misc{pith2026241203231,
  author       = {Pith},
  title        = {Pith review of: Six-Functor Formalisms II : The $\infty$-categorical compactification},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/YMSVHCGB}},
  note         = {Machine review of arXiv:2412.03231}
}
abstract

This paper is part of a series of articles in which we reproduce the statements regarding the abstract six-functor formalism developed by Liu-Zheng. In this paper, we prove a theorem, which is an $\infty$-categorical version for defining the exceptional pushforward functor in an abstract-six functor formalism. The article describes specific combinatorial simplicial sets related to compactifications and pullback squares. This theorem plays a key role in constructing the abstract six-functor formalism, which will be discussed in the forthcoming article.

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. Abstract Six-Functor Formalisms: Extension to Ind- and Pro- Categories and Functorial Cohomological Purity

    math.AG 2026-08 conditional novelty 6.0 of 10

    A presentable six-functor formalism satisfying cohomological purity extends to Ind- and Pro-categories, defining motivic stable homotopy theory for ind-pro algebraic stacks such as the Hecke stack.

Reference graph

Works this paper leans on

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

  1. [1]

    Chowdhury

    C. Chowdhury. Six-Functor Formalisms I : Constructing functo rs using category of simplices. https://arxiv.org/abs/2304.11742, 2023

    arXiv 2023

  2. [2]

    Chowdhury

    C. Chowdhury. Motivic Homotopy Theory of Algebraic Stacks. Annals of K-Theory , 9(1):1–22, May 2024

    work page 2024

  3. [3]

    P. Deligne. Cohomologie a supports propres. In Th´ eorie des Topos et Cohomologie Etale des Sch´ emas, pages 250–480, Berlin, Heidelberg, 1973. Springer Berlin Heidelber g

    work page 1973

  4. [4]

    Derivator Six-Functor-Formalisms – Construc tion II, 2022

    Fritz H¨ ormann. Derivator Six-Functor-Formalisms – Construc tion II, 2022

    work page 2022

  5. [5]

    A. A. Khan and C. Ravi. Generalized cohomology theories for algeb raic stacks, 2021

    work page 2021

  6. [6]

    Liu and W

    Y. Liu and W. Zheng. Gluing restricted nerves of ∞-categories. https://arxiv.org/pdf/1211.5294.pdf , Nov. 2012

    arXiv 2012

  7. [7]

    Liu and W

    Y. Liu and W. Zheng. Enhanced six operations and base change th eorem for higher Artin stacks. https://arxiv.org/pdf/1211.5948.pdf , Sept. 2017

    arXiv 2017

  8. [8]

    J. Lurie. Higher topos theory , volume 170 of Annals of Mathematics Studies . Princeton University Press, Princeton, NJ, 2009

    2009

Show all 12 references
  1. [9]

    J. Lurie. Higher algebra. http://people.math.harvard.edu/∼ lurie/papers/HA.pdf , 2017

    2017

  2. [10]

    J. Lurie. Spectral algebraic geometry. https://www.math.ias.edu/∼ lurie/papers/SAG-rootfile.pdf , 2018

    2018

  3. [11]

    L. Mann. A p-adic 6-functor formalism in rigid-analytic geometry. https://arxiv.org/abs/2206.02022, 2022

    2022 arXiv

  4. [12]

    P. Scholze. Etale cohomology of diamonds. https://arxiv.org/abs/1709.07343, 2017. 36

    2017 arXiv

Pith tools

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