A simple application of the implicit function theorem



Similar documents
JUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson

SOLVING POLYNOMIAL EQUATIONS

Factoring Cubic Polynomials

3.6 The Real Zeros of a Polynomial Function

Extracting the roots of septics by polynomial decomposition

Zeros of Polynomial Functions

3.2 The Factor Theorem and The Remainder Theorem

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include

a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)

Zeros of a Polynomial Function

by the matrix A results in a vector which is a reflection of the given

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

Rolle s Theorem. q( x) = 1

Integer roots of quadratic and cubic polynomials with integer coefficients

6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives

March 29, S4.4 Theorems about Zeros of Polynomial Functions

Lagrange Interpolation is a method of fitting an equation to a set of points that functions well when there are few points given.

Algebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the school year.

Section 3.2 Polynomial Functions and Their Graphs

How To Understand The Theory Of Algebraic Functions

Polynomials and Factoring

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Real Roots of Univariate Polynomials with Real Coefficients

Solving Cubic Polynomials

Basics of Polynomial Theory

1.7. Partial Fractions Rational Functions and Partial Fractions. A rational function is a quotient of two polynomials: R(x) = P (x) Q(x).

The Division Algorithm for Polynomials Handout Monday March 5, 2012

The Method of Least Squares

Inner Product Spaces

3.6. The factor theorem

Factoring Polynomials

1 Lecture: Integration of rational functions by decomposition

LEVERRIER-FADEEV ALGORITHM AND CLASSICAL ORTHOGONAL POLYNOMIALS

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

MA107 Precalculus Algebra Exam 2 Review Solutions

INTERPOLATION. Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y).

expression is written horizontally. The Last terms ((2)( 4)) because they are the last terms of the two polynomials. This is called the FOIL method.

calculating the result modulo 3, as follows: p(0) = = 1 0,

Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2)

Understanding Basic Calculus

College Algebra - MAT 161 Page: 1 Copyright 2009 Killoran

5. Factoring by the QF method

Math Common Core Sampler Test

Cubic Functions: Global Analysis

RESULTANT AND DISCRIMINANT OF POLYNOMIALS

Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points

minimal polyonomial Example

Powers of Two in Generalized Fibonacci Sequences

3.3. Solving Polynomial Equations. Introduction. Prerequisites. Learning Outcomes

PROBLEM SET 6: POLYNOMIALS

Roots of Polynomials

MATH 52: MATLAB HOMEWORK 2

Factoring Polynomials

A Different Way to Solve Quadratics Bluma s Method*

Zero: If P is a polynomial and if c is a number such that P (c) = 0 then c is a zero of P.

Mathematics Course 111: Algebra I Part IV: Vector Spaces

0.4 FACTORING POLYNOMIALS

The Method of Partial Fractions Math 121 Calculus II Spring 2015

1.3 Algebraic Expressions

Similarity and Diagonalization. Similar Matrices

GRE Prep: Precalculus

7.2 Quadratic Equations

Integrals of Rational Functions

4.3 Lagrange Approximation

3 1. Note that all cubes solve it; therefore, there are no more

it is easy to see that α = a

Zeros of Polynomial Functions

LINEAR ALGEBRA W W L CHEN

1 Sets and Set Notation.

Vieta s Formulas and the Identity Theorem

the multiplicative products between the distribution (P ± i0) λ and the operators L r {δ} and K r {δ}

tegrals as General & Particular Solutions

4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION

Algebraic Concepts Algebraic Concepts Writing

Factoring analytic multivariate polynomials and non-standard Cauchy-Riemann conditions

Factoring Polynomials

Unit 3: Day 2: Factoring Polynomial Expressions

Chapter 6. Orthogonality

Factoring - Solve by Factoring

Linear Algebra I. Ronald van Luijk, 2012

15. Symmetric polynomials

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

Inner products on R n, and more

Equations, Inequalities & Partial Fractions

NSM100 Introduction to Algebra Chapter 5 Notes Factoring

SMT 2014 Algebra Test Solutions February 15, 2014

Application. Outline. 3-1 Polynomial Functions 3-2 Finding Rational Zeros of. Polynomial. 3-3 Approximating Real Zeros of.

WARM UP EXERCSE. 2-1 Polynomials and Rational Functions

THREE DIMENSIONAL GEOMETRY

Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = i.

Factorization in Polynomial Rings

9.2 Summation Notation

Notes from February 11

Factorization Algorithms for Polynomials over Finite Fields

7. Some irreducible polynomials

Factoring Polynomials and Solving Quadratic Equations

Transcription:

Boletín de la Asociación Matemática Venezolana, Vol. XIX, No. 1 (2012) 71 DIVULGACIÓN MATEMÁTICA A simple application of the implicit function theorem Germán Lozada-Cruz Abstract. In this note we show that the roots of a polynomial are C depend of the coefficients. The main tool to show this is the Implicit Function Theorem. Resumen. En esta nota se muestra el hecho que las raíces de un polinomio son C, depende de los coeficientes. La herramienta principal para mostrar este resultado es el teorema de la función implícita. 1 Motivation Quadratic equations appear already in antiquity (Babylon, 2000 BC) and the solution of the general equation, even when it appears in different forms in the Euclid s Elements treated by geometric arguments, is obtained algebraically by the Arab mathematician al-khowarizmi. He is credited with being the first to solve the quadratic equation ax 2 + bx + c = 0, (1) where a, b and c are real numbers with a 0. Denoting by = b 2 4ac, we have the the zeros of (1) are given by Thus, we have i) distinct roots if > 0 ii) equals roots if = 0 and x = b ±. (2) 2a Partially supported by FAPESP, Grant: 09/08435-0, Brazil.

72 G. Lozada-Cruz iii) complex roots if < 0. In the case i) we say that the roots of (1) are simple and in the case ii) we say that the root of (1) is multiple. A natural question that arises is: Question 1.1 If we change slightly the coefficients a, b and c in (1), what happens with the root x given by (1.2)? First, let s look at two simple examples: Example 1.2 Find the roots of the following polynomial p given by p(x) = x 2 + x 6. (3) Using the formula (2) we obtain x = 2 and x = 3. This is the polynomial p has real and distinct roots. Example 1.3 Find the roots of the following polynomial p given by p(x) = (1, 01)x 2 + 0, 99x 6, 01. (4) Using the formula (2) we obtain x = 1, 99 and x = 2, 97. polynomial p has real and distinct roots. This is the From (3) and (4) we can see that if we change slightly the coefficients of the quadratic function then the roots will also change slightly With the intention of answering this question, we look to the right side of equation (2) as a function that depends on the coefficients a, b and c. This is x = x(a, b, c). (5) Thus, if we show that x as a function of the coefficients a, b and c is a continuous function, this answer our question posed above. More generally consider a polynomial function p : R R given by p(x) = a 0 + a 1 x + + a n x n = n a i x i, (6) where a j R, j = 0, 1,, n. The aim of this short note is to show that the simple real zeros of the equation (6) depend C of the parameter λ = (a 0, a 1,, a n ) R n+1 formed by the coefficients of p.

A simple application of the implicit function theorem 73 Definition 1.1 We say that c R is a zero of p if p(c) = 0. Theorem 1.1 If c is a zero of p then there exists a polinomial function q such that p(x) = (x c)q(x). (7) Proof. If c is a zero of p then for all x we have p(x) = p(x) p(c) = n a i (x i c i ) = (x c)q(x). Definition 1.2 We say that c is a simple zero of p if q(c) 0. If q(c) = 0 then q(x) = (x c)r(x), thus p(x) = (x c) 2 r(x), where r is another polinomial function. Deriving the equality (7) we have The following result is easy to prove p (x) = q(x) + (x c)q (x). (8) Theorem 1.2 The number c is simple zero of p if only if p (c) 0. Proof. Follows from (8). 2 C dependence of the zeros of polynomials with respect to the coefficients The main result of this short note is the following result which is the positive answer to the Question 1.1 Theorem 2.1 If c is a simple zero of p then c is a function of class C of the coeficients a 0, a 1,, a n of the polinomial p. Proof. Let us define the following function where λ = (a 0,, a n ). f : R R n+1 R (x, λ) f(x, λ) = n a i x i

74 G. Lozada-Cruz Clearly we see that f is C class in the variables x and λ. Suppose c 0 is a simple zero of polynomial function p 0 corresponding to the particular case λ 0 = (a 0 0, a 0 1,, a 0 n) R n+1 then f(c 0, λ 0 ) = n a 0 i (c 0) i = p 0 (c 0 ) = 0 f x (c 0, λ 0 ) = ( n x and a i x i) (c0,λ 0) = (p0 ) (c 0 ) 0. By the implicit function theorem (Theorem 3.1) there are open neighborhoods U R of c 0 and V R n+1 of λ 0 such that for all λ V there exists an unique c U with f(c, λ) = 0. Thus, we have a unique map c : V U λ c(λ) such that f(c(λ), λ) = 0. This tells us that the polynomial function p corresponding to the value of the parameter λ = (a 0,, a n ) R n+1 near λ 0, also has exactly a simple zero c(λ) R near to c 0. Since f C k for all k N, the function c( ) C k for all k N. This tells us that the simple zeros of p are C dependent of the coefficients. Moreover, the following formula holds [ ] 1 c f λ (λ) = (c(λ), λ) f (c(λ), λ). c λ Remark 2.1 We believe that this simple application of the implicit function theorem is appropriate for the undergraduate classroom or homework. Also, using this same theorem we can conclude that the eigenvalues of a matrix A = (a ij ) n n depend continuously of the coefficients a ij. Remark 2.2 This positive result should be contrasted with Abel s theorem, which in algebra states that there is not a formula for the zeros of a polynomial of degree n 5 in terms of coefficients. Remark 2.3 For polynomials with more than one variable we have analytical dependence of the zeros, for more details see [2], p. 362.

A simple application of the implicit function theorem 75 3 Implicit function theorem For completeness of this note we states here the Implicit function theorem. More information about the history, theory and applications of this theorem can be found in [1]. Denoting by L(R n ) = {T : R n R n ; T is linear} Aut(R n ) = {T L(R n ) : T is a bijection}. Theorem 3.1 (Implicit Theorem) Let W R n R p a open set and f C k (W, R n ). Suppose that for some (x 0, y 0 ) W, f(x 0, y 0 ) = 0 and D x f(x 0, y 0 ) Aut(R n ). Then there are open neighborhoods U R n of x 0 and V R p of y 0 such that for all y V there exists a unique x U with f(x, y) = 0. Thus we have a unique map ψ : V U y ψ(y) with ψ(y) = x and f(ψ(y), y) = 0. Moreover, the derivative of ψ in y, Dψ(y) L(R p, R n ) is given by Proof. See [1]. References Dψ(y) = [D x f(ψ(y), y)] 1 D y f(ψ(y), y), y V. [1] Krantz, Steven G.; Parks, Harold R. The Implicit function theorem. History, theory, and applications. Birkhäuser Boston, Inc., Boston, MA, 2002 [2] Hörmander, Lars, The analysis of linear partial differential operators. II. Differential operators with constant coefficients. Reprint of the 1983 original. Classics in Mathematics. Springer-Verlag, 2005. Germán Lozada-Cruz Departamento de Matemática IBILCE - Instituto de Biociências, Letras e Ciências Exatas UNESP- Universidade Estadual Paulista. e-mail: german@ibilce.unesp.br