Hostname: page-component-788cddb947-wgjn4 Total loading time: 0 Render date: 2024-10-10T04:37:29.363Z Has data issue: false hasContentIssue false

On multivariate minimal polynomials

Published online by Cambridge University Press:  17 January 2001

THOMAS BLOOM
Affiliation:
Department of Mathematics, University of Toronto, M5S 3G3 Toronto, Ontario, Canada; e-mail: bloom@math.toronto.edu
JEAN-PAUL CALVI
Affiliation:
Laboratoire de Mathématiques E. Picard, Université Paul Sabatier, 31062 Toulouse Cedex, France; e-mail: calvi@picard.ups-tlse.fr

Abstract

Given compact sets E and F in [Copf ]n (n [ges ] 1) related by F = q−1(E) where q is a polynomial map, we are interested in the general problem of comparing minimal polynomials for E with minimal polynomials for F. Let α be an n-multi-index of length d. We define the classes of polynomials ℙ(α) := zα + [Copf ]d−1[z] and [Pscr ](α) := {p: p(z) = zα + [sum ]β[pr ]αaβzβ} where [pr ] denotes the usual graded lexicographic order. Polynomials in ℙ(α) or in [Pscr ](α) of least deviation from zero on E (with respect to the supremum norm) are called minimal polynomials for E. We prove that if q is a simple (i.e. i(z) = zmi) polynomial mapping of degree m and if p is minimal polynomial for E then pq is a minimal polynomial for F = q−1(E) and, using some algebraic machinery, we can also construct minimal polynomials for E from minimal polynomials for F. The result seems to be new even in the one-dimensional case.

Type
Research Article
Copyright
© 2000 Cambridge Philosophical Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)