Derived Stone Embedding
A classical result, the Stone embedding, characterizes profinite sets as totally disconnected, compact Hausdorff spaces. Building on “Pyknotic objects, I. Basic notions”, which introduced a derived Stone embedding of the pro-category of $π$-finite spaces into pyknotic spaces, this paper uses the $\infty$-topoi machinery to partially characterize the essential image of this embedding, extending the classical characterization to the derived setting.
💡 Research Summary
The paper “Derived Stone Embedding” investigates the embedding of the pro‑category of π‑finite spaces, denoted Pro(𝒮^π), into the ∞‑topos of pyknotic spaces Pyk(𝒮). This embedding, introduced in Bhatt–Halpern‑Leistner (2019) and independently by Scholze–Clausen as the theory of condensed objects, is a derived analogue of the classical Stone embedding which identifies the pro‑category of finite sets with the category of compact, totally disconnected Hausdorff spaces. While the existence of a fully faithful functor Pro(𝒮^π) → Pyk(𝒮) was known, the precise description of its essential image remained open. The author fills this gap by employing tools from ∞‑topos theory, homotopy sheaves, and Postnikov towers.
The paper is organized as follows:
-
Introduction – Reviews the classical Stone embedding, the motivation for a derived version, and the role of pyknotic spaces as the minimal ∞‑topos containing Pro(𝒮^π). It states the main goal: a partial characterization of the essential image of the derived Stone embedding.
-
∞‑Topos Background – Provides a concise but self‑contained review of the machinery needed later. The author defines “powering over spaces” (X^K = lim←_K X) and the global sections functor Γ : 𝒳 → 𝒮, together with its left adjoint Γ^*. Using these, homotopy groups in an ∞‑topos are defined as sheaves π_n(X) ∈ Disc(𝒳/𝒳). The section also introduces n‑gerbes, Eilenberg–MacLane objects K(A,n), loop objects ΩX, and the crucial Lemma 2.15 (a pull‑back diagram expressing τ≤n X as a pullback of τ≤n‑1 X along K(π_n(X), n+1)). This lemma is a direct ∞‑categorical analogue of the classical Postnikov extension.
-
Pyknotic Spaces – Summarizes the definition of pyknotic spaces as hypercomplete sheaves on the site of profinite sets, and recalls that Pyk(𝒮) is hypercomplete and locally ∞‑connected. The author discusses coherent objects and the “solidification” process that embeds Pro(𝒮^π) into Pyk(𝒮) as a full subcategory.
-
Characterization of the Essential Image – This is the technical heart of the paper. Two main ingredients are proved:
-
Pro‑limit commutes with homotopy groups (Corollary 3.12). For a pro‑system {X_i} of π‑finite spaces, the homotopy groups of the inverse limit are the inverse limits of the homotopy groups: π_j(lim← X_i) ≅ lim← π_j(X_i). Consequently, any object coming from Pro(𝒮^π) has pro‑finite homotopy sheaves.
-
Relative Eilenberg–MacLane objects are π‑finite (Lemma 4.9). For a 1‑gerbe Γ in Pyk(𝒮) and an Eilenberg–MacLane object K_Γ(G,n) over Γ, the object lies in the essential image of the embedding iff both Γ and the band G (pulled back to the base point) are themselves in Pro(𝒮^π). This lemma guarantees that the building blocks used in a Postnikov tower are admissible.
Using Lemma 2.15, the author constructs a Postnikov tower for any 1‑connected pyknotic space X whose homotopy sheaves are pro‑finite. At each stage, the extension is realized as a pullback along K(π_n(X), n+1). By Lemma 4.9, each such K‑object belongs to Pro(𝒮^π), so the inductive construction stays inside the essential image. The converse direction follows from the first ingredient: if a pyknotic space lies in the essential image, its homotopy sheaves must be pro‑finite.
The main theorem (Theorem 4.6) therefore states:
A connected object Y ∈ Pyk(𝒮) lies in the essential image of Pro(𝒮^π) → Pyk(𝒮) if and only if for every chosen base point ξ, the pyknotic homotopy groups π_n(Y, ξ) form pro‑finite pro‑systems.
This result is a derived analogue of the classical Stone theorem: instead of total disconnectedness, the condition is “pro‑finite homotopy sheaves”.
-
-
Acknowledgments and Remarks – The author thanks several mentors, acknowledges the use of ChatGPT for LaTeX assistance, and notes that Scholze’s informal claim in
Comments & Academic Discussion
Loading comments...
Leave a Comment