Search arXivSearch

arXiv · 2512.10854

Noetherian Properties, Large Cardinals, and Independence Around $\aleph_ω$

Abstract

A base of a topological space is called {\em Noetherian } iff it does not contain an infinite strictly $\subseteq$-increasing chain. We show that minimal cardinality of a regular spaces without a Noetherian base is the first strongly inaccessible cardinal, answering a question from the 1980s. We also study the {\em Noetherian type} of a topological space $X$, denoted by $Nt(X)$, defined as the least cardinal $κ$ such that $X$ has a base $\mathcal B$ with $|\{B'\in \mathcal B: B\subset B'\}|<κ$ for each $B\in \mathcal B$. The behavior of the Noetherian type under the $G_δ$-modification was investigated by Milovich and Spadaro. A central question, posed by them, is whether the Noetherian type of the $G_δ$-modification of the space $D(2)^{\aleph_ω}$ is $ω_1$. This statement, denoted (Nt), is known to be independent of ZFC + GCH: it holds under ``GCH + $\square_{\aleph_ω}$'', but fails under ``GCH + $(\aleph_{ω+1}, \aleph_ω)\to (\aleph_1, \aleph_0)$''. We place this phenomenon in a broader context by identifying similar independence phenomena for several topological and combinatorial principles. These include: (wFN) the weak Freese-Nation property of $[\aleph_ω]^ω$; (SAT) the existence of a saturated MAD family in $[\aleph_ω]^ω$; (HnT) the existence of an $ω$-homogeneous, but not $ω$-transitive permutation group on $\aleph_ω$; and (SPL) the existence of a countably compact, locally countable, and $ω$-fair regular space of cardinality $\aleph_{ω+1}$. Assuming GCH, we analyze the logical relationships between these principles and show, for example, that SPL implies wFN, which in turn implies both SAT, HnT and Nt, while SAT does not imply Nt.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lajos Soukup, Zoltán Szentmiklóssy. 2025-12-11. Noetherian Properties, Large Cardinals, and Independence Around $\aleph_ω$. https://arxiv.org/abs/2512.10854

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO