A DYNAMICAL SYSTEM PROOF OF NIVEN’S THEOREM AND ITS EXTENSIONS

Chatchawan Panraksa, Detchat Samart, Songpon SriwongsaBulletin of the Australian Mathematical Society 2023

TL;DR

This paper presents a novel approach to Niven's theorem, which characterizes rational values of $\cos(r\pi)$ that are also rational. By reframing the problem using the lens of arithmetic dynamics and the iteration of the function $f(x) = x^2 - 2$, the authors develop a systematic method to classify all such values within any arbitrary number field $K$. This dynamical systems perspective offers a unified framework for understanding Niven's theorem and its extensions.

What Problem Does This Paper Address?

Niven's theorem, a classic result in number theory, states that if $r$ is a rational number and $\cos(r\pi)$ is also rational, then $\cos(r\pi)$ must be one of $0, \pm 1, \pm 1/2$. This theorem, while elegant, primarily addresses the case where the output is rational. A more general question arises: for any given number field $K$ (a finite extension of the rational numbers $\mathbb{Q}$), what are the values of $\cos(r\pi)$ that are both rational multiples of $\pi$ and elements of $K$? This problem, referred to as Problem 1 in the paper, is what the authors aim to solve. They seek an algorithm to classify these values, moving beyond the restriction of the output being rational.

Methods

The core of the paper's methodology lies in the application of arithmetic dynamics. The authors establish a crucial connection between the problem of finding values of $\cos(r\pi)$ in a number field $K$ and the study of preperiodic points of the quadratic map $f(x) = x^2 - 2$.

Here's a breakdown of their approach:

  • Transformation: They show that if $\gamma = 2\cos(r\pi)$ for some $r \in \mathbb{Q}$, then $\gamma$ is an element of $K$ if and only if $\gamma$ is a preperiodic point of $f(x) = x^2 - 2$ within $K$. This is formalized in Theorem 5, which states $C(K) = \text{PrePer}(f, K)$, where $C(K)$ is the set of values in question and $\text{PrePer}(f, K)$ is the set of preperiodic points of $f$ in $K$.
  • Preperiodic Points: A point is preperiodic if its orbit under repeated application of $f$ eventually enters a cycle. The authors leverage the fact that the set of preperiodic points is finite for any number field $K$.
  • Dynatomic Polynomials: A key tool for studying preperiodic points is the dynatomic polynomial, $\Phi_{n,f}(x)$, whose roots are the points that have minimal period $n$ under iteration of $f$. The paper utilizes known results about the dynatomic polynomials of $f(x) = x^2 - 2$, particularly their factorization properties.
  • Degree of Irreducible Factors: Theorem 6 establishes a relationship between the minimal period $n$ of a periodic point and the degree of the number field $K$. Specifically, if $a \in K$ is a periodic point of $f$ with minimal period $n$, then $n$ must divide the degree of $K$. This is crucial for bounding the possible periods.
  • Algorithm Development: By combining these ideas, the authors outline a procedure to classify these values. This involves factoring the polynomial $f^{(D)}(x) - x$ (where $D$ is the degree of $K$) and analyzing the degrees of its irreducible factors. The preperiodic points are then found by taking preimages of periodic points.

The novelty lies in reframing a number-theoretic problem about trigonometric values as a problem in dynamical systems, specifically about the iteration of a simple polynomial.

Datasets

Not discussed in the paper. The paper focuses on theoretical results and algorithmic approaches rather than empirical evaluation on datasets.

Key Insights and Ideas

  • The $x^2-2$ Connection: The most significant insight is the elegant equivalence between the problem of finding rational cosine values in a number field and identifying preperiodic points of the dynamical system $f(x) = x^2 - 2$. This transforms a trigonometric problem into an algebraic one.
  • Dynamical Systems as a Unifying Framework: The paper demonstrates how arithmetic dynamics can provide a powerful and unified perspective on classical number theory problems like Niven's theorem and its generalizations.
  • Periodicity and Field Degree: The finding that the minimal period of a periodic point of $f(x) = x^2 - 2$ must divide the degree of the number field containing it (Theorem 6) is a critical constraint that limits the complexity of the problem.
  • Algorithmic Classification: The paper moves beyond theoretical statements to propose a concrete algorithmic approach for classifying these values, making the problem computationally tractable.

Key Results

  • Theorem 5: Establishes the equivalence $C(K) = \text{PrePer}(f, K)$, linking values of $\cos(r\pi)$ in $K$ to preperiodic points of $f(x) = x^2 - 2$ in $K$.
  • Theorem 6: States that if $a \in K$ is a periodic point of $f(x) = x^2 - 2$ with minimal period $n$, then $n$ divides the degree of $K$, $[K:\mathbb{Q}]$.
  • Corollary 10: Shows that any value $\gamma \in C(K)$ is an algebraic integer, i.e., $\gamma \in O_K$.
  • Examples for Low Degree Fields: The paper provides explicit classifications of these values for number fields of degree $D=1$ (Niven's theorem), $D=2$ (Theorem 3), $D=3$, $D=4$, and $D=5$, illustrating the application of their method. For instance, for $D=1$, they recover Niven's theorem by identifying the preperiodic points of $f(x)$ in $\mathbb{Q}$ as $\{0, \pm 1, \pm 2\}$.

Limitations and Future Work

  • Computational Complexity: While the paper provides an algorithm, explicitly computing the preperiodic points for higher-degree number fields can still be computationally intensive due to the complexity of factoring polynomials.
  • Generalization to Other Functions: The paper notes that Theorem 6 relies on specific properties of the dynatomic polynomials of $f(x) = x^2 - 2$. It is not expected that this theorem holds for arbitrary polynomial maps $f(x)$.
  • Interpreting Preperiodic Points: The authors suggest that for other values of $c$ in $f_c(x) = x^2 + c$, interpreting the preperiodic points as special values of some function remains an interesting open problem.
  • Explicit Bounds: While Corollary 11 provides an upper bound on the number of preperiodic points, it is noted to be far from optimal, suggesting room for improvement in bounding the size of $C(K)$.

Summary updated

Abstract

Abstract Niven’s theorem asserts that $\{\cos (r\pi ) \mid r\in \mathbb {Q}\}\cap \mathbb {Q}=\{0,\pm 1,\pm 1/2\}.$ In this paper, we use elementary techniques and results from arithmetic dynamics to obtain an algorithm for classifying all values in the set $\{\cos (r\pi ) \mid r\in \mathbb {Q}\}\cap K$ , where K is an arbitrary number field.
BibTeX
@article{panraksa2023dynamical,
  author = {Chatchawan Panraksa and Detchat Samart and Songpon Sriwongsa},
  title = {{A DYNAMICAL SYSTEM PROOF OF NIVEN’S THEOREM AND ITS EXTENSIONS}},
  journal = {Bulletin of the Australian Mathematical Society},
  year = {2023},
}
Figure