vix.ing · top · new · best · stats · spec

Definable Obstruction Theory

2025/01/22 by Nicholas Meadows, Meadows, Nicholas
Computer Science · #03E15 (Primary) #18B99 (Secondary) #18G80 #55S35 #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO)

paper · pdf · doi:10.48550/arxiv.2501.12888

openalex publication_date 2025/01/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A series of recent papers by Bergfalk, Lupini and Panagiotopoulus developed the foundations of a field known as `definable algebraic topology,' in which classical cohomological invariants are enriched by viewing them as groups with a Polish cover. This allows one to apply techniques from descriptive set theory to the study of cohomology theories. In this paper, we will establish a `definable' version of a classical theorem from obstruction theory, and use this to study the potential complexity of the homotopy relation on the space of continuous maps C(X, |K|), where X is a locally compact Polish space, and K is a locally finite countable simplicial complex. We will also characterize the Solecki Groups of the Cech cohomology of X, which are the canonical chain of subgroups with a Polish cover that are least among those of a given complexity.

Related