Polynomial Invariants
|
|
- Grant Daniels
- 7 years ago
- Views:
Transcription
1 Polynomial Invariants Dylan Wilson October 9, 2014 (1) Today we will be interested in the following Question 1.1. What are all the possible polynomials in two variables f(x, y) such that f(x, y) = f(y, x)? Of course, this question is vague. It s unclear what sort of answer I m looking for. To explain, let s start with an example. Example 1.2. A natural condition on a polynomial in one variable, p(x) is that it be even, i.e. p(x) = p( x) Let s try to describe the set of all even polynomials. To start with, let s consider the case of quadratics p(x) = ax 2 + bx + c. The condition that this be even says that we have an equality ax 2 + bx + c = a( x) 2 + b( x) + c Subtracting the right from the left we get the condition = ax 2 bx + c 2bx = 0 which can only happen if b = 0. (Here and for the rest of the talk, when I write down p(x) = 0 I mean that the polynomial is zero as a function, not that some value of x makes it zero.) Thus, quadratic polynomials are even if and only if they are of the form ax 2 + c. More generally, if p(x) = a n x n + a n 1 x n a 0 then p(x) = p( x) means a n x n + a n 1 x n a 0 = a n ( x) n + a n 1 ( x) n a 0 Two polynomials are equal if and only if their coefficients are equal (take this either as a definition or an exercise), so this says that a k = ( 1) k a k If k is even this doesn t say anything, just a k = a k. If k is odd, it says a k = a k which can only happen if a k = 0. Thus we have shown that a polynomial is even if and only if it can be written a 2n x 2n +a 2n 2 x 2n a 2 x 2 + a 0. In other words, a polynomial is even if and only if it is a polynomial in the variable x 2. We write this suggestively by saying that the collection of even polynomials is R[x 2 ] (just like the collection of all polynomials was R[x]). Ok, so much for even polynomials. But now maybe it s clearer what I mean by the question above. Let s make it even clearer in the following set of exercise: 1
2 Exercise 1.3. Show that the set of even polynomials is a vector subspace of R[x] directly from the definition of even (i.e. not using the result we proved above describing the set of even polynomials another way.) Exercise 1.4. Recall that the degree of a monomial ax k, where a 0, is k, and the degree of a polynomial (which is a sum of monomials) is the highest degree nonzero monomial that appears. Prove that polynomials of degree at most n form a vector subspace of R[x]. We will write this subspace as R[x] n. Prove that the even polynomials of degree at most n form a vector subspace, we ll denote this by Even n. (Hint: Something you proved during your quiz could be helpful...) Exercise 1.5. Prove that any even polynomial of degree 6 can be written uniquely in the form ax 6 + bx 4 + cx 2 + d. (Hint: To prove something like this, you show that any two ways of writing the polynomial in that form are equal. That is, start by writing down two expressions as above and setting them equal to each other. Then prove they were the same expression.) Exercise 1.6. Show that the function f : R 4 Even 6 given by f(a, b, c, d) = ax 6 + bx 4 + cx 2 + d is (i) linear, (ii) injective (look it up), (iii) surjective (look it up). Such a map is called an isomorphism. Show, more generally, that we have an isomorphism R n Even 2n 2 for n 1. You ll talk more about dimension in class, but whatever we mean by dimension it should be the case that R n has dimension n. So here is a sort of cheap definition of dimension: Definition 1.7. A vector space V has dimension n if there is a linear isomorphism R n V. Warning 1.8. We haven t proved anything about this concept yet! As of now, it could be the case that a vector space can have different dimensions at the same time... For example, how do we know there is no linear isomorphism R R 2? Why isn t R 2 2-dimensional and 1-dimensional? So what have we accomplished? We ve cooked up some basic polynomials, {1, x 2, x 4,...}, such that any even polynomial is a unique linear combination of these ones. A linear combination of vectors v i in a vector space V is just any vector of the form a 1 v 1 + a 2 v a n v n, a i R A basic observation is the following: Proposition 1.9. A vector space V has dimension n if and only if there are vectors v 1,..., v n V such that every element of V is a unique linear combination of the vectors {v 1,..., v n }. Proof. Given such vectors v 1,..., v n define a map f : R n V as follows: This is linear because f(a 1,..., a n ) = a 1 v a n v n f(λa 1 + µb 1,..., λa n + µb n ) = (λa i + µb i )v i = (λa i v i + µb i v i ) ( ) ( ) = λai v i + µbi v i = λf(a 1,..., a n ) + µf(b 1,..., b n ) It is surjective since any vector v can be written as v = a 1 v a n v n = f(a 1,..., a n ), by assumption, and it is injective because the choice of a i is unique, again by assumption. On the other hand, if we start off with a linear isomorphism f : R n V, then define v i = f(e i ) where e i is the vector with a 1 in the ith spot and zeros elsewhere. Now pick v V. Since isomorphisms are surjective, there is some vector (a 1,..., a n ) R n such that f(a 1,..., a n ) = v. By linearity, v = f(a 1,..., a n ) = f(a 1 e a n e n ) = a 1 f(e 1 ) + + a n f(e n ) = a 1 v a n v n 2
3 If there were some other way of writing v as such a linear combination, i.e. v = b 1 v b n v n then, again by linearity, v = f(b 1,..., b n ). But f is injective, so this implies that (b 1,..., b n ) = (a 1,..., a n ), i.e. a i = b i for all i. In other words, there is a unique choice of the a i that give v. This completes the proof. The v i above serve as basic building blocks for the vector space V. They are called a basis. Our goal will be to find similar basic building blocks for symmetric polynomials. (2) First we should lay the groundwork. Remember, we re interested in polynomials in two variables x and y, like 5x 2 y + 3x + 2, 3y, (x + 2) 2 (where the last expression really means x 2 + 4x + 4). We define the degree of a monomial ax i y j to be i + j if a is nonzero. The degree of a polynomial is the degree of its largest nonzero monomial. Exercise 2.1. Show that the set of symmetric polynomials, Symm, is a subspace of R[x, y]. Show that the set of polynomials of degree at most n, R[x, y] n, and the set of symmetric polynomials of degree at most n, Symm n, are also subspaces. Definition 2.2. A homogeneous polynomial of degree d is a sum of monomials of degree exactly d. convention, 0 is considered homogeneous of every degree. By Write down an example of a non- Exercise 2.3. Write down examples of homogeneous polynomials. homogeneous polynomial. Exercise 2.4. Show that the set of homogeneous polynomials of degree d, R[x, y] n, is a subspace of R[x, y] and of R[x, y] n. Show that the set of homogeneous, symmetric polynomials of degree d is a subspace. Exercise 2.5. Show that every nonzero polynomial can be written uniquely as a sum of nonzero homogeneous polynomials. Exercise 2.6. Show that a polynomial is symmetric if and only if it is a sum of homogeneous, symmetric polynomials. All told, then, we will have answered our original question if we can answer: Question 2.7. How can we describe the space of homogeneous, symmetric polynomials of degree d, for arbitrary d? Example 2.8. (d = 0). The only degree 0 polynomials are constants. They are all symmetric. So there is a one-dimensional space of such things. Example 2.9. (d = 1). Degree 1 homogeneous polynomials are called linear and look like this: 2x + 3y, 3x, 5x 5y, ax + by The symmetry condition says ax + by = bx + ay, i.e. a = b. In other words, every degree 1, homogeneous polynomial is a multiple of the polynomial x + y. So, again, we get a one-dimensional space. Example (d = 2) These look like ax 2 + bxy + cy 2 Being symmetric means that a = c. So they look like a(x 2 + y 2 ) + bxy. You can check that this space is 2-dimensional. 3
4 Example (d = 3) These are: ax 3 + bx 2 y + cxy 2 + dy 3 where a = d and b = c. In other words, they look like a(x 3 + y 3 ) + b(x 2 y + xy 2 ). As we do these examples, we start to collect our building blocks. They look a little more complicated than what we saw in the case of even polynomials in one variable. We ve picked out the polynomials: 1, x + y, x 2 + y 2, xy, x 3 + y 3, x 2 y + xy 2 A bit too early for a pattern, but we at least notice the polynomials x n + y n appear. Indeed, these are obviously homogeneous and symmetric. Now for an observation, again in the form of an exercise: Exercise Show that if f and g are homogeneous, symmetric polynomials of degrees d and e, respectively, then f g (the product) is a homogeneous, symmetric polynomial of degree d + e. In particular, (x + y) 2 is homogeneous and symmetric. That means we can write it in terms of the building blocks x 2 + y 2 and xy: (x + y) 2 = (x 2 + y 2 ) + 2xy Let s turn this on its head: x 2 + y 2 = (x + y) 2 2xy In other words: the building block x 2 + y 2 can be written in terms of xy and (x + y) 2. It follows that every degree 2, symmetric, homogeneous polynomial is a unique linear combination of xy and (x + y) 2. (Why?) So our new list of building blocks looks like: 1, x + y, xy, (x + y) 2, x 3 + y 3, x 2 y + xy 2 and, actually, let s notice that and x 2 y + xy 2 = xy(x + y) thus So we write the basic building blocks as: At this point we might guess: (x + y) 3 = x 3 + 3x 2 y + 3xy 2 + y 3 = (x 3 + y 3 ) + 3xy(x + y) x 3 + y 3 = (x + y) 3 3xy(x + y) 1, x + y, xy, (x + y) 2, (x + y) 3, xy(x + y) Proposition Every symmetric, homoegenous polynomial of degree d can be written uniquely as a linear combination of the polynomials (x + y) d, (x + y) d 2 xy, (x + y) d 4 (xy) 2,... In other words, these polynomials form a basis for the degree d homogeneous, symmetric polynomials. In particular, this space has dimension d/2 + 1 if d is even and (d 1)/2 + 1 if d is odd. The proof is a little involved, so let me not give it at the moment. (Later in the course I ll be able to give a fairly quick proof, after we learn some tricks for checking when some set of vectors is a basis.) Something better is true, actually: 4
5 Theorem Let f(x, y) be a symmetric polynomial (not necessarily homogeneous). unique polynomial h(w, z) in two variable such that Then there is a f(x, y) = h(x + y, xy) In other words, we can think of symmetric polynomials as polynomials in the elementary symmetric polynomials x + y and xy. It follows from what we ve done so far that we can find such a polynomial. The uniqueness part is a little tricky, but also follows from what we ve done so far. At this point I should probably stop, but let me point out some obvious questions, which will be in the form of challenge problems: Problem Write x n + y n in terms of the basis we ve given. Problem Run the same analysis for polynomials f(x, y) such that f(x, y) = f( x, y) = f(x, y). Prove that these are built from x 2 and y 2 just as symmetric polynomials are built from x + y and xy. Compute the dimensions of the spaces of such polynomials which are homogeneous of degree d. Problem Do the same for polynomials f(x, y) such that f(x, y) = f( x, y). The dimension part is a little trickier because not all degrees will behave the same way... 5
Math 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationVieta s Formulas and the Identity Theorem
Vieta s Formulas and the Identity Theorem This worksheet will work through the material from our class on 3/21/2013 with some examples that should help you with the homework The topic of our discussion
More informationit is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationMath 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationApplications to Data Smoothing and Image Processing I
Applications to Data Smoothing and Image Processing I MA 348 Kurt Bryan Signals and Images Let t denote time and consider a signal a(t) on some time interval, say t. We ll assume that the signal a(t) is
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationLinear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)
MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationSolution to Homework 2
Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if
More informationMATH 10034 Fundamental Mathematics IV
MATH 0034 Fundamental Mathematics IV http://www.math.kent.edu/ebooks/0034/funmath4.pdf Department of Mathematical Sciences Kent State University January 2, 2009 ii Contents To the Instructor v Polynomials.
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More information1 Shapes of Cubic Functions
MA 1165 - Lecture 05 1 1/26/09 1 Shapes of Cubic Functions A cubic function (a.k.a. a third-degree polynomial function) is one that can be written in the form f(x) = ax 3 + bx 2 + cx + d. (1) Quadratic
More informationPractice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More informationLinear and quadratic Taylor polynomials for functions of several variables.
ams/econ 11b supplementary notes ucsc Linear quadratic Taylor polynomials for functions of several variables. c 010, Yonatan Katznelson Finding the extreme (minimum or maximum) values of a function, is
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationChapter 17. Orthogonal Matrices and Symmetries of Space
Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length
More informationMethods for Finding Bases
Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,
More information15. Symmetric polynomials
15. Symmetric polynomials 15.1 The theorem 15.2 First examples 15.3 A variant: discriminants 1. The theorem Let S n be the group of permutations of {1,, n}, also called the symmetric group on n things.
More informationLinear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
More informationThe Method of Partial Fractions Math 121 Calculus II Spring 2015
Rational functions. as The Method of Partial Fractions Math 11 Calculus II Spring 015 Recall that a rational function is a quotient of two polynomials such f(x) g(x) = 3x5 + x 3 + 16x x 60. The method
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More informationGRE Prep: Precalculus
GRE Prep: Precalculus Franklin H.J. Kenter 1 Introduction These are the notes for the Precalculus section for the GRE Prep session held at UCSD in August 2011. These notes are in no way intended to teach
More informationMATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column
More informationReal Roots of Univariate Polynomials with Real Coefficients
Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials
More informationFOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it
More information5. Linear algebra I: dimension
5. Linear algebra I: dimension 5.1 Some simple results 5.2 Bases and dimension 5.3 Homomorphisms and dimension 1. Some simple results Several observations should be made. Once stated explicitly, the proofs
More information1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]
1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationGeometric Transformations
Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted
More informationHow To Solve Factoring Problems
05-W4801-AM1.qxd 8/19/08 8:45 PM Page 241 Factoring, Solving Equations, and Problem Solving 5 5.1 Factoring by Using the Distributive Property 5.2 Factoring the Difference of Two Squares 5.3 Factoring
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationApplication. Outline. 3-1 Polynomial Functions 3-2 Finding Rational Zeros of. Polynomial. 3-3 Approximating Real Zeros of.
Polynomial and Rational Functions Outline 3-1 Polynomial Functions 3-2 Finding Rational Zeros of Polynomials 3-3 Approximating Real Zeros of Polynomials 3-4 Rational Functions Chapter 3 Group Activity:
More information3.2 The Factor Theorem and The Remainder Theorem
3. The Factor Theorem and The Remainder Theorem 57 3. The Factor Theorem and The Remainder Theorem Suppose we wish to find the zeros of f(x) = x 3 + 4x 5x 4. Setting f(x) = 0 results in the polynomial
More informationBasics of Polynomial Theory
3 Basics of Polynomial Theory 3.1 Polynomial Equations In geodesy and geoinformatics, most observations are related to unknowns parameters through equations of algebraic (polynomial) type. In cases where
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More information3. Prime and maximal ideals. 3.1. Definitions and Examples.
COMMUTATIVE ALGEBRA 5 3.1. Definitions and Examples. 3. Prime and maximal ideals Definition. An ideal P in a ring A is called prime if P A and if for every pair x, y of elements in A\P we have xy P. Equivalently,
More informationAcademic Success Centre
250) 960-6367 Factoring Polynomials Sometimes when we try to solve or simplify an equation or expression involving polynomials the way that it looks can hinder our progress in finding a solution. Factorization
More informationAu = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.
Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry
More informationLecture 16 : Relations and Functions DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationThe Division Algorithm for Polynomials Handout Monday March 5, 2012
The Division Algorithm for Polynomials Handout Monday March 5, 0 Let F be a field (such as R, Q, C, or F p for some prime p. This will allow us to divide by any nonzero scalar. (For some of the following,
More information0.8 Rational Expressions and Equations
96 Prerequisites 0.8 Rational Expressions and Equations We now turn our attention to rational expressions - that is, algebraic fractions - and equations which contain them. The reader is encouraged to
More informationTo give it a definition, an implicit function of x and y is simply any relationship that takes the form:
2 Implicit function theorems and applications 21 Implicit functions The implicit function theorem is one of the most useful single tools you ll meet this year After a while, it will be second nature to
More informationThese axioms must hold for all vectors ū, v, and w in V and all scalars c and d.
DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms
More informationCovariance and Correlation
Covariance and Correlation ( c Robert J. Serfling Not for reproduction or distribution) We have seen how to summarize a data-based relative frequency distribution by measures of location and spread, such
More informationChapter 3 Section 6 Lesson Polynomials
Chapter Section 6 Lesson Polynomials Introduction This lesson introduces polynomials and like terms. As we learned earlier, a monomial is a constant, a variable, or the product of constants and variables.
More information1.7 Graphs of Functions
64 Relations and Functions 1.7 Graphs of Functions In Section 1.4 we defined a function as a special type of relation; one in which each x-coordinate was matched with only one y-coordinate. We spent most
More information160 CHAPTER 4. VECTOR SPACES
160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results
More informationIntegrals of Rational Functions
Integrals of Rational Functions Scott R. Fulton Overview A rational function has the form where p and q are polynomials. For example, r(x) = p(x) q(x) f(x) = x2 3 x 4 + 3, g(t) = t6 + 4t 2 3, 7t 5 + 3t
More information1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is
More informationSeparable First Order Differential Equations
Separable First Order Differential Equations Form of Separable Equations which take the form = gx hy or These are differential equations = gxĥy, where gx is a continuous function of x and hy is a continuously
More information(a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9
Homework #01, due 1/20/10 = 9.1.2, 9.1.4, 9.1.6, 9.1.8, 9.2.3 Additional problems for study: 9.1.1, 9.1.3, 9.1.5, 9.1.13, 9.2.1, 9.2.2, 9.2.4, 9.2.5, 9.2.6, 9.3.2, 9.3.3 9.1.1 (This problem was not assigned
More informationPROBLEM SET 6: POLYNOMIALS
PROBLEM SET 6: POLYNOMIALS 1. introduction In this problem set we will consider polynomials with coefficients in K, where K is the real numbers R, the complex numbers C, the rational numbers Q or any other
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationNormal distribution. ) 2 /2σ. 2π σ
Normal distribution The normal distribution is the most widely known and used of all distributions. Because the normal distribution approximates many natural phenomena so well, it has developed into a
More informationLagrange Interpolation is a method of fitting an equation to a set of points that functions well when there are few points given.
Polynomials (Ch.1) Study Guide by BS, JL, AZ, CC, SH, HL Lagrange Interpolation is a method of fitting an equation to a set of points that functions well when there are few points given. Sasha s method
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
More informationThe Mean Value Theorem
The Mean Value Theorem THEOREM (The Extreme Value Theorem): If f is continuous on a closed interval [a, b], then f attains an absolute maximum value f(c) and an absolute minimum value f(d) at some numbers
More information1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 005-06-15 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
More informationCopyrighted Material. Chapter 1 DEGREE OF A CURVE
Chapter 1 DEGREE OF A CURVE Road Map The idea of degree is a fundamental concept, which will take us several chapters to explore in depth. We begin by explaining what an algebraic curve is, and offer two
More informationSecond Order Linear Nonhomogeneous Differential Equations; Method of Undetermined Coefficients. y + p(t) y + q(t) y = g(t), g(t) 0.
Second Order Linear Nonhomogeneous Differential Equations; Method of Undetermined Coefficients We will now turn our attention to nonhomogeneous second order linear equations, equations with the standard
More information6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives
6 EXTENDING ALGEBRA Chapter 6 Extending Algebra Objectives After studying this chapter you should understand techniques whereby equations of cubic degree and higher can be solved; be able to factorise
More informationexpression is written horizontally. The Last terms ((2)( 4)) because they are the last terms of the two polynomials. This is called the FOIL method.
A polynomial of degree n (in one variable, with real coefficients) is an expression of the form: a n x n + a n 1 x n 1 + a n 2 x n 2 + + a 2 x 2 + a 1 x + a 0 where a n, a n 1, a n 2, a 2, a 1, a 0 are
More information9. POLYNOMIALS. Example 1: The expression a(x) = x 3 4x 2 + 7x 11 is a polynomial in x. The coefficients of a(x) are the numbers 1, 4, 7, 11.
9. POLYNOMIALS 9.1. Definition of a Polynomial A polynomial is an expression of the form: a(x) = a n x n + a n-1 x n-1 +... + a 1 x + a 0. The symbol x is called an indeterminate and simply plays the role
More informationPOLYNOMIALS and FACTORING
POLYNOMIALS and FACTORING Exponents ( days); 1. Evaluate exponential expressions. Use the product rule for exponents, 1. How do you remember the rules for exponents?. How do you decide which rule to use
More informationSection 1.1. Introduction to R n
The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to
More informationSolutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
More informationSolving Quadratic Equations
9.3 Solving Quadratic Equations by Using the Quadratic Formula 9.3 OBJECTIVES 1. Solve a quadratic equation by using the quadratic formula 2. Determine the nature of the solutions of a quadratic equation
More informationPartial Fractions. (x 1)(x 2 + 1)
Partial Fractions Adding rational functions involves finding a common denominator, rewriting each fraction so that it has that denominator, then adding. For example, 3x x 1 3x(x 1) (x + 1)(x 1) + 1(x +
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationA Brief Review of Elementary Ordinary Differential Equations
1 A Brief Review of Elementary Ordinary Differential Equations At various points in the material we will be covering, we will need to recall and use material normally covered in an elementary course on
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationRevised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)
Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More information5 Homogeneous systems
5 Homogeneous systems Definition: A homogeneous (ho-mo-jeen -i-us) system of linear algebraic equations is one in which all the numbers on the right hand side are equal to : a x +... + a n x n =.. a m
More informationLinear Algebra Notes
Linear Algebra Notes Chapter 19 KERNEL AND IMAGE OF A MATRIX Take an n m matrix a 11 a 12 a 1m a 21 a 22 a 2m a n1 a n2 a nm and think of it as a function A : R m R n The kernel of A is defined as Note
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationFactoring Polynomials
Factoring Polynomials Hoste, Miller, Murieka September 12, 2011 1 Factoring In the previous section, we discussed how to determine the product of two or more terms. Consider, for instance, the equations
More informationRecognizing Types of First Order Differential Equations E. L. Lady
Recognizing Types of First Order Differential Equations E. L. Lady Every first order differential equation to be considered here can be written can be written in the form P (x, y)+q(x, y)y =0. This means
More informationMATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
More information8 Square matrices continued: Determinants
8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationThe last three chapters introduced three major proof techniques: direct,
CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More information3.6 The Real Zeros of a Polynomial Function
SECTION 3.6 The Real Zeros of a Polynomial Function 219 3.6 The Real Zeros of a Polynomial Function PREPARING FOR THIS SECTION Before getting started, review the following: Classification of Numbers (Appendix,
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More informationPolynomial and Rational Functions
Polynomial and Rational Functions Quadratic Functions Overview of Objectives, students should be able to: 1. Recognize the characteristics of parabolas. 2. Find the intercepts a. x intercepts by solving
More information1 Lecture: Integration of rational functions by decomposition
Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.
More information2 Integrating Both Sides
2 Integrating Both Sides So far, the only general method we have for solving differential equations involves equations of the form y = f(x), where f(x) is any function of x. The solution to such an equation
More informationWinter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com
Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).
More information