Search arXiv⌕ Search

arXiv · 2610.16672

Tight $σ$-filtrations and the BFPP of $C(ω^*)$

Abstract

Assuming that $\mathcal{P}(ω)$ is tightly $σ$-filtered, we prove that $C(ω^*)$ fails the ball fixed point property. This axiom holds under the continuum hypothesis and in the $\aleph_2$-Cohen model. The proof shows that the Stone space of the countable--cocountable algebra $\operatorname{Cc}(ω_1)$ is a continuous retract of $ω^*$ and uses the equivalence between tight $σ$-filteredness of $\operatorname{Cc}(ω_1)$ and of $\mathcal{P}(ω)$. We also prove that the quotient of a tightly $σ$-filtered Boolean algebra $B$ with the countable separation property by an $\aleph_1$-generated $P$-ideal is a Boolean retract of $B$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Antonio Avilés, Maurício Rossetto. 2026-10-12. Tight $σ$-filtrations and the BFPP of $C(ω^*)$. https://arxiv.org/abs/2610.16672

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

KEEP EXPLORING

Related papers

Convex Team Logics

We prove expressive completeness results for convex propositional and modal team logics, where a logic is convex if, for each formula, if it is true in two teams $t$ and $u$ and $t\subseteq s\subseteq u$, then it is also true in $s$. We introduce propositional/modal team logics which are expressively complete for the class of all convex propositional/modal team properties. We also answer an open question concerning the expressive power of classical propositional logic extended with the nonemptiness atom NE: we show that it is expressively complete for the class of all convex and union-closed properties. A modal analogue of this result additionally yields an expressive completeness theorem for Aloni's (2022) Bilateral State-Based Modal Logic. There is a specific sense in which one of the propositional convex logics we introduce extends propositional dependence logic; this sense corresponds to the existence of a compositional translation between the two logics. Another of the convex logics extends propositional inquisitive logic in the same manner. We generalize the notion of uniform definability, as considered in the team semantics literature, to formalize this notion of compositional extension.

math.LO↗

Hindman and Owings-like theorems without the Axiom of Choice

We investigate Hindman- and Owings-type Ramsey-theoretic statements in Zermelo-Fraenkel set theory without the Axiom of Choice, with some occasional extra assumptions (such as the Axiom of Dependent Choice and/or the Axiom of Determinacy). We study several variations of Hindman's theorem on $\mathbb Q$-vector spaces; notably, we show that the uncountable analog of Hindman's theorem fails for the additive group of $\mathbb R$ (under ZF), and for $\mathbb Q$-vector spaces of uncountable dimension (under DC if such dimension is not well-orderable), among other results. In contrast, for Owings-type configurations, we obtain several positive results, especially when assuming AD. These results highlight the interaction between determinacy, algebraic structure, and dimension in the study of infinite Ramsey theory without the Axiom of Choice.

math.LO↗

Constructive equivalence between Brouwer's fixed-point theorem and weak König's lemma

In the context of constructive reverse mathematics, we show that Brouwer's fixed-point theorem and weak König's lemma (WKL) are equivalent. To derive WKL from Brouwer's fixed-point theorem, the construction of a continuous function on the unit square without fixed points due to Orevkov [Soviet Math. Doklady (1963), 1253--1256] is generalised to yield a uniformly continuous function on the unit square whose fixed points encode information about infinite paths of a given infinite tree.

math.LO↗