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

推荐订阅源

P
Proofpoint News Feed
T
The Blog of Author Tim Ferriss
aimingoo的专栏
aimingoo的专栏
M
MIT News - Artificial intelligence
N
Netflix TechBlog - Medium
Y
Y Combinator Blog
B
Blog RSS Feed
H
Help Net Security
Blog — PlanetScale
Blog — PlanetScale
Vercel News
Vercel News
Google DeepMind News
Google DeepMind News
Microsoft Security Blog
Microsoft Security Blog
G
Google Developers Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - 司徒正美
L
LangChain Blog
IT之家
IT之家
F
Fortinet All Blogs
V
V2EX
C
Check Point Blog
The Cloudflare 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
Closure Atlases and Local-to-Global Obstructions in Finit...
[Submitted on 19 Jun 2026] · 2026-06-25 · via math updates on arXiv.org

View PDF HTML (experimental)

Abstract:This paper studies finite closure operators on overlapping finite universes and gives an exact local-to-global obstruction criterion for conservative globalization. Given a finite family of local closure systems, its atlas-generated closure is obtained by repeatedly applying the local closure operators to the parts visible in each chart. This closure is the least global closure operator extending all chart closures. A chart-visible obstruction is a consequence produced by this global propagation that lies inside a chart but is not validated by that chart's own closure operator. The main theorem proves that a finite closure atlas has a global conservative realization exactly when no such obstruction occurs; in that case the atlas-generated closure itself is the conservative realization. The obstruction condition is finite and directly computable.
The paper also records the indexed representation layer motivating the terminology. For a finite closure system, an indexed truth space selects closed theories as contexts and represents each element by the region of selected closed theories containing it. Closure consequence is always sound for region inclusion, and the full indexed space of all closed theories recovers the original closure consequence exactly; reduced indexed spaces can therefore create spurious region consequences by deleting separating closed theories. A formal opposite gives a four-region membership decomposition - only one, only the other, both, and neither - unless additional separation assumptions are imposed. Finally, overlap-compatible local closed theories glue by canonical union under the atlas-generated closure. The framework is finite, structural, and closure-theoretic; the logical terminology is used only as an interpretation of the underlying closure data.

Submission history

From: Jaehwan Kim [view email]
[v1] Fri, 19 Jun 2026 01:27:18 UTC (23 KB)