Preprint
Article

This version is not peer-reviewed.

Closed Lindelöf Σ Kernels of Neighborhood Assignments in Charming Spaces

Submitted:

27 September 2026

Posted:

29 September 2026

You are already at the latest version

Abstract
Every neighborhood assignment on a charming space \( X \) has a countable kernel whose closure in \( X \) is Lindelöf \( \Sigma \). Consequently, for any two neighborhood assignments \( M \) and \( N \) on \( X \), there is a closed discrete set \( D\subseteq X \) such that \( M[N[D]]=X \). For a neighborhood assignment \( P \)$ on \( X \) and a set \( A\subseteq X \), write \( P[A]=\bigcup_{a\in A}P(a) \). The \( D \)-property also admits an exact one-step reduction to covering a fixed Lindelöf \( \Sigma \) kernel by assigned neighborhoods centered at an ambient closed discrete set. The relevant pointwise square-refinement condition is the classical \( z \)-space condition formulated in terms of normal neighbornets. For continuous closed surjections, the corresponding fixed-assignment equivalence also holds. Every uncountable \( \mathrm{HFC}_{\mathrm w} \) subspace of \( [\omega_1]^{\leq\omega} \) has a closed countable kernel for every neighborhood assignment but is not charming. In particular, this applies to the preliminary \( \diamondsuit \)-construction announced by Tsaban. For a Lindelöf \( \Sigma \) kernel \( Y \), the Hu–Yin boundary obstruction is \( \overline{Y}^{\,X}\setminus Y \). A charming space is CL charming exactly when it has a Lindelöf \( \Sigma \) kernel whose trace on the corresponding closed core is \( G_\delta \). For any fixed Lindelöf \( \Sigma \) kernel \( Y \), the closed-core reduction can be iterated. The iteration preserves the \( D \)-property, reaches the largest closed subspace in which the kernel trace and its complement are both dense, and has a sharp stabilization bound in terms of the hereditary Lindelöf number of \( Y \). The general charming-space \( D \)-problem remains open.
Keywords: 
;  ;  ;  ;  ;  
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.