惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Engineering at Meta
Engineering at Meta
J
Java Code Geeks
I
InfoQ
腾讯CDC
Vercel News
Vercel News
IT之家
IT之家
V
Visual Studio Blog
P
Proofpoint News Feed
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
G
Google Developers Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
博客园 - 叶小钗
有赞技术团队
有赞技术团队
月光博客
月光博客
Martin Fowler
Martin Fowler
量子位
L
LangChain Blog
B
Blog
Last Week in AI
Last Week in AI
博客园 - 司徒正美
Microsoft Security Blog
Microsoft Security Blog
博客园 - 聂微东
Microsoft Azure Blog
Microsoft Azure Blog
A
About on SuperTechFans

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
A condensed proof of the pro-étale and étale exodromy the...
[Submitted on 21 May 2026 (v1), last revised 17 Jun 2026 (this v · 2026-06-18 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:The exodromy correspondence of Barwick, Glasman, and Haine computes constructible sheaves of spaces on a scheme $X$ as an $\infty$-category of continuous functors from the profinite category $\operatorname{Gal}(X)$. Viewing $\operatorname{Gal}(X)$ instead as a condensed category, this was extended by Wolf to an exodromy correspondence for pro-étale sheaves. Using the condensed perspective from the outset, we give a quick and self-contained proof of the pro-étale exodromy theorem. This is used to extract an exodromy theorem for (Postnikov complete) étale sheaves that does not yet appear in the literature, which is closely related to Lurie's work on ultracategories. Finally, we use this to give a new proof of the constructible étale exodromy correspondence of Barwick, Glasman, and Haine. Without additional effort, our method removes the qcqs hypotheses on the schemes, and gives versions for sheaves with coefficients in more general $\infty$-categories. Finally, we refine the methods to obtain a $\kappa$-condensed statement for any uncountable cardinal $\kappa$ such that $\kappa > \lvert \mathcal O_X(U) \rvert$ for every affine open $U \subseteq X$.

Submission history

From: Remy Van Dobben De Bruyn [view email]
[v1] Thu, 21 May 2026 13:50:18 UTC (67 KB)
[v2] Wed, 17 Jun 2026 16:09:36 UTC (67 KB)