Table of Contents
Fetching ...

$m$-Rigidity and Finite-One Degrees Inside Typical Many-One Degrees

Patrizio Cintioli

Abstract

In recent work, the notion of $m$-rigidity was introduced as a sufficient condition for the existence of infinite antichains of $1$-degrees inside many-one degrees. Motivated by a recent preprint of Richter, Stephan, and Zhang on finite-one degrees inside many-one degrees, we study the finite-one structure of the many-one degree of an $m$-rigid set. First, combining bi-immunity of $m$-rigid sets with a theorem of Richter, Stephan, and Zhang, we show that for Lebesgue-almost every set $A$, and for a comeager class of sets $A$, the many-one degree $°_m(A)$ contains a least finite-one degree. Second, we prove that if $A$ is $m$-rigid, then $°_m(A)$ contains infinitely many pairwise incomparable finite-one degrees. More precisely, we construct representatives $B_S \equiv_m A$, indexed by computable sets $S$, such that $T \setminus S$ infinite implies $B_T \not\leq_{fin} B_S$. Third, inside a single finite-one degree we build a strict ascending chain \[ A_{(1)} <_1 A_{(2)} <_1 \cdots \] of $1$-degrees. These results yield almost-sure and comeager partial answers to the first two open problems posed by Richter, Stephan, and Zhang.

$m$-Rigidity and Finite-One Degrees Inside Typical Many-One Degrees

Abstract

In recent work, the notion of -rigidity was introduced as a sufficient condition for the existence of infinite antichains of -degrees inside many-one degrees. Motivated by a recent preprint of Richter, Stephan, and Zhang on finite-one degrees inside many-one degrees, we study the finite-one structure of the many-one degree of an -rigid set. First, combining bi-immunity of -rigid sets with a theorem of Richter, Stephan, and Zhang, we show that for Lebesgue-almost every set , and for a comeager class of sets , the many-one degree contains a least finite-one degree. Second, we prove that if is -rigid, then contains infinitely many pairwise incomparable finite-one degrees. More precisely, we construct representatives , indexed by computable sets , such that infinite implies . Third, inside a single finite-one degree we build a strict ascending chain of -degrees. These results yield almost-sure and comeager partial answers to the first two open problems posed by Richter, Stephan, and Zhang.
Paper Structure (6 sections, 10 theorems, 5 equations)

This paper contains 6 sections, 10 theorems, 5 equations.

Key Result

Lemma 2.4

Every $m$-rigid set is bi-immune.

Theorems & Definitions (23)

  • Definition 2.1: Reducibilities and degrees
  • Remark 2.2
  • Definition 2.3: Cintioli2026
  • Lemma 2.4: Cintioli Cintioli2026
  • Theorem 3.1: Richter, Stephan, Zhang RSZ2026
  • Corollary 3.2
  • proof
  • Definition 4.1
  • Lemma 4.2
  • proof
  • ...and 13 more