Qualitative Theory of Dynamical Systems

, 5:285

Algebraic closure of a rational function

Authors

    • LIX. École Polytechnique
    • Université Paris XII-val de marne
Article

DOI: 10.1007/BF02972683

Cite this article as:
Ollagnier, J.M. Qual. Th. Dyn. Syst (2004) 5: 285. doi:10.1007/BF02972683

Abstract

We give a simple algorithm to decide if a non-constant rational fractionR=P/Q in the field\(\mathbb{K}(x) = \mathbb{K}(x_1 ,...,x_n )\) inn≥2 variables over a fieldK of characteristic 0 can be written as a non-trivial compositionR=U(R1), whereR1 is anothern-variable rational fraction whereasU is a one-variable rational fraction which is not a homography.

More precisely, this algorithm produces a generator of thealgebraic closure of a rational fraction in the fieldKx.

Although our algorithm is simple (it uses only elementary linear algebra), its proof relies on a structure theorem: the algebraic closure of a rational fraction is a purely transcendental extension ofK of transcendence degree 1.

Despite this theorem is a generalization of a result of Poincaré about the rational first integrals of polynomial planar vector fields, we found it useful to give a complete proof of it: our proof is as algebraic as possible and thus very different from Poincaré's original work.

Key Words

Algorithmsalgebraic closurerational function

Copyright information

© Birkhäuser-Verlag 2004