Table of Contents
Fetching ...

All Borel Group Extensions of Finite-Dimensional Real Space Are Trivial

Linus Richter

TL;DR

This work classifies Borel definable abelian group extensions of the additive groups $(\mathbb{R}^N,+)$ by countable abelian groups $G$. By blending group cohomology with descriptive set theory and employing Cohen-forcing-type arguments, the authors show that every Borel 2-cocycle is a coboundary for all $N\ge 2$, so $H^2_{Bor}(\mathbb{R}^N,G)=0$ and all such definable extensions are trivial. The core analysis begins with a detailed $N=2$ case that introduces novel geometric lemmas and a staged trivialisation, then extends the results to general $N$ via a higher-dimensional analogue $T(N)$, with a consistent forcing-based strategy ensuring coboundarity. The results extend the Kanovei–Reeken theorem from $N=1$ to all $N\ge 2$, and the paper discusses open questions for uncountable $G$ and other Polish groups, outlining future directions at the intersection of logic, descriptive set theory, and homological algebra.

Abstract

For $N \geq 2$, we study the structure of definable abelian group extensions of the additive group $(\mathbb{R}^N,+)$ by countable abelian (Borel) groups $G$. Given an extension $H$ of $(\mathbb{R}^N,+)$ by $G$, we measure the definability of $H$ by investigating its complexity as a Borel set. We do this by combining homological algebra and descriptive set theory, and hence study the Borel complexity of those functions inducing $H$, the abelian cocycles. We prove that, for every $N \geq 2$, there are no non-trivial Borel definable abelian cocycles coding group extensions of $(\mathbb{R}^N,+)$ by a countable abelian group $G$, and hence show that no non-trivial such group extensions exist. This completes the picture first investigated by Kanovei and Reeken in 2000, who proved the case $N = 1$, and whose techniques we adapt in this work.

All Borel Group Extensions of Finite-Dimensional Real Space Are Trivial

TL;DR

This work classifies Borel definable abelian group extensions of the additive groups by countable abelian groups . By blending group cohomology with descriptive set theory and employing Cohen-forcing-type arguments, the authors show that every Borel 2-cocycle is a coboundary for all , so and all such definable extensions are trivial. The core analysis begins with a detailed case that introduces novel geometric lemmas and a staged trivialisation, then extends the results to general via a higher-dimensional analogue , with a consistent forcing-based strategy ensuring coboundarity. The results extend the Kanovei–Reeken theorem from to all , and the paper discusses open questions for uncountable and other Polish groups, outlining future directions at the intersection of logic, descriptive set theory, and homological algebra.

Abstract

For , we study the structure of definable abelian group extensions of the additive group by countable abelian (Borel) groups . Given an extension of by , we measure the definability of by investigating its complexity as a Borel set. We do this by combining homological algebra and descriptive set theory, and hence study the Borel complexity of those functions inducing , the abelian cocycles. We prove that, for every , there are no non-trivial Borel definable abelian cocycles coding group extensions of by a countable abelian group , and hence show that no non-trivial such group extensions exist. This completes the picture first investigated by Kanovei and Reeken in 2000, who proved the case , and whose techniques we adapt in this work.
Paper Structure (12 sections, 33 theorems, 54 equations)

This paper contains 12 sections, 33 theorems, 54 equations.

Key Result

Theorem 1.2

For every group $G$, the only Borel definable group extension of $(\mathbb{R},+)$ by $G$ is the trivial extension. In other words, every Borel cocycle $C \colon (\mathbb{R}^2)^2 \rightarrow G$ is a Borel coboundary.

Theorems & Definitions (65)

  • Definition 1.1
  • Theorem 1.2: Kanovei and Reeken, 2000
  • Remark
  • Proposition 2.1: cf. dansPaperRichter2024
  • proof
  • Lemma 2.2
  • Lemma 2.3
  • Lemma 2.4
  • Lemma 2.5
  • Theorem 2.6: MR756630
  • ...and 55 more