This paper investigates which sets of integers can be realized as the set of possible degrees for maps between topological spaces (manifolds). The authors show that while finite sets of integers containing zero can always be realized as mapping degrees for some manifolds, not all multiplicative sets containing 0 and 1 can be realized as self-mapping degrees. They also demonstrate that mapping degree sets for lower-dimensional manifolds can be realized by higher-dimensional ones.
What Problem Does This Paper Address?
The central question in this paper is: given a set of integers $A$, can we find two closed oriented manifolds $M$ and $N$ such that the set of all possible degrees of maps from $M$ to $N$ is exactly $A$? This is known as the "realization problem for mapping degree sets."
Specifically, the authors build upon existing work. It's known that for any manifold $M$, the set of degrees of maps from $M$ to itself, denoted $D(M)$, always contains 0 and 1, and is closed under multiplication (if $a, b \in D(M)$, then $ab \in D(M)$). Such a set is called "multiplicative." While it was previously shown that finite sets of integers (containing 0) can be realized as mapping degree sets for 3-manifolds, and that some infinite sets cannot be realized, the problem for multiplicative sets and self-mapping degrees remained open. This paper addresses the question of whether every multiplicative set containing 0 and 1 can be realized as $D(M)$ for some manifold $M$. It also explores how mapping degree sets of lower-dimensional manifolds relate to those of higher-dimensional ones.
Methods
The paper employs a combination of topological constructions and results from geometric topology.
Constructing Manifolds: The authors utilize the concept of connected sums of manifolds and products of manifolds to construct new spaces with desired properties.
Hyperbolic Manifolds: A key technique involves using closed oriented hyperbolic manifolds. These manifolds have special geometric properties that are leveraged to control the degrees of maps. Specifically, they use results about the volume and the degrees of self-maps of hyperbolic manifolds.
Homotopy Theory: The paper relies on the fact that the set of self-mapping degrees $D(M)$ is invariant under homotopy equivalence of manifolds. This allows them to count the number of possible $D(M)$ sets by counting homotopy classes of manifolds.
Algebraic Topology: Tools like homology groups and their generators are used to analyze maps between manifolds and their degrees. For instance, the degree of a map is related to how it affects homology classes.
Number Theory: The multiplicative property of degree sets is a core concept, drawing connections to number-theoretic properties of integers.
Datasets
Not discussed in the paper. The paper deals with theoretical constructions of topological spaces and their properties, rather than empirical data or computational experiments.
Key Insights and Ideas
Not all multiplicative sets are realizable as self-mapping degrees: This is a significant negative result. The authors construct a specific multiplicative set containing 0 and 1 that cannot be the set of self-mapping degrees for any manifold. This highlights that the multiplicative property, while necessary, is not sufficient for a set to be a mapping degree set.
Higher dimensions can realize lower-dimensional degree sets: A crucial finding is that for any $n$-dimensional manifold's mapping degree set, one can find higher-dimensional $(n+k)$-dimensional manifolds (for $k \ge 3$) that realize the same degree set. This suggests a form of "dimension-independence" for realizability, at least for dimensions $\ge 6$.
Finite sets are universally realizable (with dimension caveats): Building on prior work, the paper confirms that any finite set of integers containing 0 can be realized as a mapping degree set for $n$-manifolds, provided $n \notin \{1, 2, 4, 5\}$. This is a strong positive result for finite sets.
The structure of $D(CP^n)$: The paper provides a proof for the well-known fact that the self-mapping degrees of the complex projective space $CP^n$ are precisely the $n$-th powers of integers, i.e., $\{k^n \mid k \in \mathbb{Z}\}$.
Key Results
Theorem 2.1: There exists a multiplicative set $A$ containing $\{0, 1\}$ which is not $D(M)$ for any closed oriented $n$-manifold $M$.
Theorem 2.2: For any $n \in \mathbb{N}$ and $k \ge 3$, every mapping degree set $A$ of $n$-manifolds is the mapping degree set of some $(n+k)$-manifolds. This also holds for self-mapping degree sets.
Theorem 2.3: For each positive integer $n \notin \{1, 2, 4, 5\}$, every finite set of integers containing 0 is the mapping degree set of some $n$-manifolds. For $n \neq 1, 2$, every finite multiplicative set containing $\{0, 1\}$ is the self-mapping degree set of some $n$-manifold.
Example 1.6 (with proof): $D(CP^n) = \{k^n \mid k \in \mathbb{Z}\}$.
Limitations and Future Work
Specific Non-Realizable Sets: The paper poses Question 2.4, asking for concrete examples of sets that are not mapping degree sets or self-mapping degree sets, beyond the existence proof in Theorem 2.1. Finding such explicit examples is noted as a more subtle problem.
Realization of Arithmetic/Geometric Progressions: Question 2.5 asks whether every infinite arithmetic progression (with 0 and 1) is a self-mapping degree set, and whether there exists an infinite geometric progression (with 0 and 1) that is a self-mapping degree set. These remain open.
Dimensions $n=4, 5$ for Theorem 2.3: The authors mention that Theorem 2.3 for finite multiplicative sets holds for $n \neq 1, 2$, but they do not have a proof for $n=4, 5$. This is an area for future investigation.
Non-recursively enumerable sets: The paper notes that $D(M, N)$ sets are recursively enumerable, and Theorem 2.1 implies the existence of non-recursively enumerable multiplicative sets. Finding explicit non-realizable sets (as mentioned in Question 2.4) could shed light on this.
Summary updated
Abstract
The set of degrees of maps <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper D left-parenthesis upper M comma upper N right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>D</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>M</mml:mi> <mml:mo>,</mml:mo> <mml:mi>N</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">D(M,N)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , where <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper M comma upper N"> <mml:semantics> <mml:mrow> <mml:mi>M</mml:mi> <mml:mo>,</mml:mo> <mml:mi>N</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">M,N</mml:annotation> </mml:semantics> </mml:math> </inline-formula> are closed oriented <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="n"> <mml:semantics> <mml:mi>n</mml:mi> <mml:annotation encoding="application/x-tex">n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -manifolds, always contains 0 and the set of degrees of self-maps <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper D left-parenthesis upper M right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>D</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>M</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">D(M)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> always contains <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="0"> <mml:semantics> <mml:mn>0</mml:mn> <mml:annotation encoding="application/x-tex">0</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="1"> <mml:semantics> <mml:mn>1</mml:mn> <mml:annotation encoding="application/x-tex">1</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . Also, if <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="a comma b element-of upper D left-parenthesis upper M right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>a</mml:mi> <mml:mo>,</mml:mo> <mml:mi>b</mml:mi> <mml:mo> ∈ </mml:mo> <mml:mi>D</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>M</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">a,b\in D(M)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , then <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="a b element-of upper D left-parenthesis upper M right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mi>a</mml:mi> <mml:mi>b</mml:mi> <mml:mo> ∈ </mml:mo> <mml:mi>D</mml:mi> <mml:mo stretchy="false">(</mml:mo> <mml:mi>M</mml:mi> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">ab\in D(M)</mml:annotation> </mml:semantics> </mml:math> </inline-formula> ; a set <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A subset-of-or-equal-to double-struck upper Z"> <mml:semantics> <mml:mrow> <mml:mi>A</mml:mi> <mml:mo> ⊆ </mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="double-struck">Z</mml:mi> </mml:mrow> </mml:mrow> <mml:annotation encoding="application/x-tex">A\subseteq \mathbb {Z}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> so that <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="a b element-of upper A"> <mml:semantics> <mml:mrow> <mml:mi>a</mml:mi> <mml:mi>b</mml:mi> <mml:mo> ∈ </mml:mo> <mml:mi>A</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">ab\in A</mml:annotation> </mml:semantics> </mml:math> </inline-formula> for each <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="a comma b element-of upper A"> <mml:semantics> <mml:mrow> <mml:mi>a</mml:mi> <mml:mo>,</mml:mo> <mml:mi>b</mml:mi> <mml:mo> ∈ </mml:mo> <mml:mi>A</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">a,b\in A</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is called multiplicative. On the one hand, not every infinite set of integers (containing <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="0"> <mml:semantics> <mml:mn>0</mml:mn> <mml:annotation encoding="application/x-tex">0</mml:annotation> </mml:semantics> </mml:math> </inline-formula> ) is a mapping degree set (Neofytidis, Wang, and Wang [Bull. Lond. Math. Soc. 55 (2023), pp. 1700–1717]) and, on the other hand, every finite set of integers (containing <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="0"> <mml:semantics> <mml:mn>0</mml:mn> <mml:annotation encoding="application/x-tex">0</mml:annotation> </mml:semantics> </mml:math> </inline-formula> ) is the mapping degree set of some <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="3"> <mml:semantic
BibTeX
@inproceedings{neofytidis2023realisation,
author = {Christoforos Neofytidis and Hongbin Sun and Ye Tian and Shicheng Wang and Zhongzi Wang},
title = {{On the realisation problem for mapping degree sets}},
booktitle = {Proceedings of the American Mathematical Society},
year = {2023},
}