Fixed Points of Polynomials over Division Rings

Abstract

We study the discrete dynamics of standard (or left) polynomials f(x) over division rings D. We define their fixed points to be the points λ ∈ D for which f n(λ)=λ for any n ∈ N, where f n(x) is defined recursively by f n(x)=f(f (n-1)(x)) and f 1(x)=f(x). Periodic points are similarly defined. We prove that λ is a fixed point of f(x) if and only if f(λ)=λ, which enables the use of known results from the theory of polynomial equations, to conclude that any polynomial of degree m ≥ 2 has at most m conjugacy classes of fixed points. We also consider arbitrary periodic points, and show that in general, they do not behave as in the commutative case. We provide a sufficient condition for periodic points to behave as expected.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…