LINEAR DIFFERENCE EQUATIONS SIGMUNDUR GUDMUNDSSON. [ November 2017 ]

Size: px
Start display at page:

Download "LINEAR DIFFERENCE EQUATIONS SIGMUNDUR GUDMUNDSSON. [ November 2017 ]"

Transcription

1 LINEAR DIFFERENCE EQUATIONS SIGMUNDUR GUDMUNDSSON [ November 2017 ] In these notes we shall by N, R and C denote the sets of natural, real and complex numbers, respectively. All the definitions and most of the results mentioned below can be formulated both for the real and for the complex numbers. Here we have chosen to present the complex version, but if the same also applies to the real case we have added the symbol [R] in the corresponding header. Definition 0.1. [R] A complex-valued sequence is a function f : N C. We denote by C the set of all complex-valued sequences i.e. C = {f f : N C}. For two elements f, g C and α C we define the addition + and the product by i. (f + g)(n) = f(n) + g(n) for all n N, ii. (α f)(n) = α f(n) for all n N. Exercise 0.2. [R] Prove that the triple (C, +, ) is a complex linear space. Remark 0.3. [R] If n N and f C we often write f n instead of f(n). Definition 0.4. [R] A linear difference of degree k with constant complex coefficients is an of the form (0.1) c k a n + c k 1 a n c 0 a n k = g n, where c 0,..., c k are complex numbers such that c 0 0 c k, g C is a sequence and a n,..., a n k unknown complex numbers. If g 0 then the is said to be homogeneous, but inhomogeneous otherwise. Definition 0.5. [R] A solution to (0.1) is a sequence f C such that c k f n + c k 1 f n c 0 f n k = g n, for all natural numbers n k. 1. The Homogeneous Case Proposition 1.1. [R] Let c 0,..., c k be complex numbers such that c 0 0 c k and V be the set of all solutions to the homogeneous linear difference i.e. V = {f C c k f n + c k 1 f n c 0 f n k = 0 for n k}. 1

2 Then V is a linear subspace of C. Proof. [R] Let f, g C be solutions to the and α, β C, then c k (αf n + βg n ) + c k 1 (αf n 1 + βg n 1 ) + + c 0 (αf n k + βg n k ) = α(c k f n + c k 1 f n c 0 f n k ) = 0. +β(c k g n + c k 1 g n c 0 g n k ) This proves that the sequence (αf + βg) is an element of V, which implies that V is a linear subspace of C. Proposition 1.2. [R] Let c 0,..., c k and α 0,..., α k 1 be complex numbers such that c 0 0 c k. Then the linear homogeneous difference (1.1) has a unique solution f C which satisfies the following initial conditions f 0 = α 0, f 1 = α 1,..., f k 1 = α k 1. Proof. [R] We have assumed that c k 0, so for each n k we have f n = (c k 1 f n c 0 f n k )/c k. The function values f 0, f 1,..., f k 1 are given by the initial conditions, so it follows from the induction principle that the sequence f C is uniquely determined. The next result gives a nice description of the solution space in the complex case. For the real case see Theorem Theorem 1.3. Let c 0,..., c k be complex numbers such that c 0 0 c k. Then the set V of all solutions to the homogeneous linear difference is a k-dimensional complex linear subspace of C. Proof. Let α denote the vector α = (α 0,..., α k 1 ) and {e 1, e 2,..., e k } be the canonical basis for C k. Then the k different sets of initial conditions α = e 1, α = e 2,..., α = e k generate k linearly independent solutions. This shows that the dimension of V is k. Definition 1.4. [R] For complex numbers c 0,..., c k such that c 0 0 c k we call p(λ) = c k λ k + c k 1 λ k c 1 λ + c 0 the characteristic polynomial of the homogeneous linear difference. 2

3 Proposition 1.5. [R] Let λ 0 be a non-zero complex number. Then the sequence f : n λ n 0 is a solution to the homogeneous linear difference if and only if λ 0 is a root of the corresponding characteristic polynomial. Proof. The result follows directly from the following c k f n + c k 1 f n c 1 f n k+1 + c 0 f n k = c k λ n + c k 1 λ n c 1 λ n k+1 + c 0 λ n k = λ n k (c k λ k + + c 1 λ + c 0 ) = λ n k p(λ). The next important result is well-known but rather messy to prove in its full generality. The reader should note that we have left out the symbol [R]. Proposition 1.6. Let c 0,..., c k and α 0,..., α k 1 be complex numbers such that c 0 0 c k and λ 1,..., λ t be the different roots of the characteristic polynomial p(λ) = (c k λ k + + c 1 λ + c 0 ), with multiplicities m 1,..., m t. Then the k = m 1 + m m t sequences f 1,1 : n λ n 1 f 1,2 : n nλ n 1... f 1,m1 : n n m 1 1 λ n 1 f 2,1 : n λ n 2 f 2,2 : n nλ n 2... f 2,m2 : n n m 2 1 λ n 2. f t,1 : n λ n t f t,2 : n nλ n t... f t,mt : n n m t 1 λ n t are linearily independent solutions to the homogeneous linear difference. Exercise 1.7. Prove Proposition 1.6 for the special cases when k = 1, 2, 3. Lemma 1.8. Let the real numbers c 0, c 1,..., c k satisfying c 0 0 c k be the coefficients of the homogeneous linear difference s (1.2). Then the following conditions are equivalent i. f C is a solution to (1.2), ii. f C is a solution to (1.2), iii. Ref R and Imf R are solutions to (1.2). 3

4 Proof. The sequence f C is a solution to (1.2) if and only if c k f n + c k 1 f n c 0 f n k = 0 for all n k. By conjugating this and using the fact that the coefficients are all real we obtain the equivalent c k fn + c k 1 fn c 0 fn k = 0 which holds for all n k. But this means that the sequence f C is a solution to (1.2). From this we conclude that i. and ii. are equivalent. As a direct consequence of the definitions of the real and imaginary parts of f C we have (1.3) Ref = (f + f)/2 Imf = (f f)/2i and (1.4) f = Ref + i Imf f = Re i Imf It follows from the fact that the solution space V is complex linear and s (1.3) that i. and ii. imply iii. Similarily we can conclude from s (1.4) that iii. implies i. and ii. Example 1.9. Let α and β be real numbers such that β 0. Then the characteristic polynomial of the linear difference (1.5) a n 2αa n 1 + (α 2 + β 2 )a n 2 = 0 is given by p(λ) = λ 2 2αλ + (α 2 + β 2 ). This polynomial has the complex roots λ 1 = α + iβ and λ 2 = α iβ. According to Proposition 1.6 the sequences f : n (α + iβ) n and f : n (α iβ) n form a basis for the two dimensional solution space V. Writing α + iβ in polar form re iθ we see that the two sequences are given by f : n r n e inθ and f : n r n e inθ. Following Lemma 1.8 we see that the real-valued sequences Ref : n r n cos nθ and Imf : n r n sin nθ are linearily independent solutions to the homogeneous linear difference (1.5) with real coefficients. The next result is the real version of Theorem 1.3. Theorem Let c 0,..., c k be real numbers such that c 0 0 c k. Then the set V of all real-valued solutions to the homogeneous linear difference is a k-dimensional real linear subspace of R. Proof. The coefficients of the characteristic polynomial are all real, which means that its roots are either real or come in pairs (α + iβ, α iβ). It then follows that all possible real initial values generate a real k-dimensional solution space. 4

5 2. The Inhomogeneous Case Lemma 2.1. [R] Let c 0,..., c k be complex numbers such that c 0 0 c k and g C. If h C is a solution to the inhomogeneous c k a n + c k 1 a n c 0 a n k = g n, then the following conditions are equivalent. i. (f + h) C is a solution to the inhomogeneous, ii. f C is a solution to the corresponding homogeneous. Proof. This result follows directly from the following c k (f + h) n + c k 1 (f + h) n c 0 (f + h) n k g n = (c k f n + c k 1 f n c 0 f n k ) +(c k h n + c k 1 h n c 0 h n k ) g n = c k f n + c k 1 f n c 0 f n k. Theorem 2.2. [R] Let c 0,..., c k be complex numbers such that c 0 0 c k, g C and h C be a solution to the inhomogeneous linear difference c k a n + c k 1 a n c 0 a n k = g n. Further let V be the solution space to the corresponding homogeneous. Then the set S g of all solutions to the inhomogeneous is given by S g = h + V = {(h + f) C f V }. Proof. This result is a direct consequence of Lemma 2.1. Department of Mathematics, Faculty of Science, Lund University, Box 118, S Lund, Sweden address: Sigmundur.Gudmundsson@math.lu.se 5

17 Advancement Operator Equations

17 Advancement Operator Equations November 14, 2017 17 Advancement Operator Equations William T. Trotter trotter@math.gatech.edu Review of Recurrence Equations (1) Problem Let r(n) denote the number of regions determined by n lines that

More information

Examples: Solving nth Order Equations

Examples: Solving nth Order Equations Atoms L. Euler s Theorem The Atom List First Order. Solve 2y + 5y = 0. Examples: Solving nth Order Equations Second Order. Solve y + 2y + y = 0, y + 3y + 2y = 0 and y + 2y + 5y = 0. Third Order. Solve

More information

Second Order and Higher Order Equations Introduction

Second Order and Higher Order Equations Introduction Second Order and Higher Order Equations Introduction Second order and higher order equations occur frequently in science and engineering (like pendulum problem etc.) and hence has its own importance. It

More information

Section 5.2 Solving Recurrence Relations

Section 5.2 Solving Recurrence Relations Section 5.2 Solving Recurrence Relations If a g(n) = f (a g(0),a g(1),..., a g(n 1) ) find a closed form or an expression for a g(n). Recall: nth degree polynomials have n roots: a n x n + a n 1 x n 1

More information

Math53: Ordinary Differential Equations Autumn 2004

Math53: Ordinary Differential Equations Autumn 2004 Math53: Ordinary Differential Equations Autumn 2004 Unit 2 Summary Second- and Higher-Order Ordinary Differential Equations Extremely Important: Euler s formula Very Important: finding solutions to linear

More information

Atoms An atom is a term with coefficient 1 obtained by taking the real and imaginary parts of x j e ax+icx, j = 0, 1, 2,...,

Atoms An atom is a term with coefficient 1 obtained by taking the real and imaginary parts of x j e ax+icx, j = 0, 1, 2,..., Atoms An atom is a term with coefficient 1 obtained by taking the real and imaginary parts of x j e ax+icx, j = 0, 1, 2,..., where a and c represent real numbers and c 0. Details and Remarks The definition

More information

3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall

3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall c Dr Oksana Shatalov, Fall 2016 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from the set A to the set B is a correspondence that assigns to

More information

Section 9.8 Higher Order Linear Equations

Section 9.8 Higher Order Linear Equations Section 9.8 Higher Order Linear Equations Key Terms: Higher order linear equations Equivalent linear systems for higher order equations Companion matrix Characteristic polynomial and equation A linear

More information

Section 7.2 Solving Linear Recurrence Relations

Section 7.2 Solving Linear Recurrence Relations Section 7.2 Solving Linear Recurrence Relations If a g(n) = f (a g(0),a g(1),..., a g(n 1) ) find a closed form or an expression for a g(n). Recall: nth degree polynomials have n roots: a n x n + a n 1

More information

K th -order linear difference equation (Normal Form)

K th -order linear difference equation (Normal Form) The standard form of the general K th -order difference equation is x n + 1 = F(x n, x n - 1, x n - 2,..., x n - K + 1, P) where P is a vector of parameters. However, linear equations are normally expressed

More information

Honors Differential Equations

Honors Differential Equations MIT OpenCourseWare http://ocw.mit.edu 18.034 Honors Differential Equations Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. UNIT III: HIGHER-ORDER

More information

Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem

Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem Review of Linear Algebra Definitions, Change of Basis, Trace, Spectral Theorem Steven J. Miller June 19, 2004 Abstract Matrices can be thought of as rectangular (often square) arrays of numbers, or as

More information

How to Solve Linear Differential Equations

How to Solve Linear Differential Equations How to Solve Linear Differential Equations Definition: Euler Base Atom, Euler Solution Atom Independence of Atoms Construction of the General Solution from a List of Distinct Atoms Euler s Theorems Euler

More information

NOTES (1) FOR MATH 375, FALL 2012

NOTES (1) FOR MATH 375, FALL 2012 NOTES 1) FOR MATH 375, FALL 2012 1 Vector Spaces 11 Axioms Linear algebra grows out of the problem of solving simultaneous systems of linear equations such as 3x + 2y = 5, 111) x 3y = 9, or 2x + 3y z =

More information

5 FUNCTIONS. 5.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall

5 FUNCTIONS. 5.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall c Dr Oksana Shatalov, Fall 2017 1 5 FUNCTIONS 5.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from the set A to the set B is a correspondence that assigns to

More information

9 FUNCTIONS. 9.1 The Definition of Function. c Dr Oksana Shatalov, Fall

9 FUNCTIONS. 9.1 The Definition of Function. c Dr Oksana Shatalov, Fall c Dr Oksana Shatalov, Fall 2018 1 9 FUNCTIONS 9.1 The Definition of Function DEFINITION 1. Let X and Y be nonempty sets. A function f from the set X to the set Y is a correspondence that assigns to each

More information

1 Complex Numbers. 1.1 Sums and Products

1 Complex Numbers. 1.1 Sums and Products 1 Complex Numbers 1.1 Sums Products Definition: The complex plane, denoted C is the set of all ordered pairs (x, y) with x, y R, where Re z = x is called the real part Imz = y is called the imaginary part.

More information

ON THE CHEBYSHEV POLYNOMIALS. Contents. 2. A Result on Linear Functionals on P n 4 Acknowledgments 7 References 7

ON THE CHEBYSHEV POLYNOMIALS. Contents. 2. A Result on Linear Functionals on P n 4 Acknowledgments 7 References 7 ON THE CHEBYSHEV POLYNOMIALS JOSEPH DICAPUA Abstract. This paper is a short exposition of several magnificent properties of the Chebyshev polynomials. The author illustrates how the Chebyshev polynomials

More information

IV. Conformal Maps. 1. Geometric interpretation of differentiability. 2. Automorphisms of the Riemann sphere: Möbius transformations

IV. Conformal Maps. 1. Geometric interpretation of differentiability. 2. Automorphisms of the Riemann sphere: Möbius transformations MTH6111 Complex Analysis 2009-10 Lecture Notes c Shaun Bullett 2009 IV. Conformal Maps 1. Geometric interpretation of differentiability We saw from the definition of complex differentiability that if f

More information

LECTURE VII: THE JORDAN CANONICAL FORM MAT FALL 2006 PRINCETON UNIVERSITY. [See also Appendix B in the book]

LECTURE VII: THE JORDAN CANONICAL FORM MAT FALL 2006 PRINCETON UNIVERSITY. [See also Appendix B in the book] LECTURE VII: THE JORDAN CANONICAL FORM MAT 204 - FALL 2006 PRINCETON UNIVERSITY ALFONSO SORRENTINO [See also Appendix B in the book] 1 Introduction In Lecture IV we have introduced the concept of eigenvalue

More information

4.3 Linear, Homogeneous Equations with Constant Coefficients. Jiwen He

4.3 Linear, Homogeneous Equations with Constant Coefficients. Jiwen He 4.3 Exercises Math 3331 Differential Equations 4.3 Linear, Homogeneous Equations with Constant Coefficients Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/ jiwenhe/math3331

More information

3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Spring

3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Spring c Dr Oksana Shatalov, Spring 2016 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from A to B is a rule that assigns to each element in the set

More information

Math 550 Notes. Chapter 2. Jesse Crawford. Department of Mathematics Tarleton State University. Fall 2010

Math 550 Notes. Chapter 2. Jesse Crawford. Department of Mathematics Tarleton State University. Fall 2010 Math 550 Notes Chapter 2 Jesse Crawford Department of Mathematics Tarleton State University Fall 2010 (Tarleton State University) Math 550 Chapter 2 Fall 2010 1 / 20 Linear algebra deals with finite dimensional

More information

Filters in Analysis and Topology

Filters in Analysis and Topology Filters in Analysis and Topology David MacIver July 1, 2004 Abstract The study of filters is a very natural way to talk about convergence in an arbitrary topological space, and carries over nicely into

More information

Theory of Higher-Order Linear Differential Equations

Theory of Higher-Order Linear Differential Equations Chapter 6 Theory of Higher-Order Linear Differential Equations 6.1 Basic Theory A linear differential equation of order n has the form a n (x)y (n) (x) + a n 1 (x)y (n 1) (x) + + a 0 (x)y(x) = b(x), (6.1.1)

More information

1. General Vector Spaces

1. General Vector Spaces 1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule

More information

Forward r-difference Operator and Finding Solution of Nonhomogeneous Difference Equations

Forward r-difference Operator and Finding Solution of Nonhomogeneous Difference Equations International Mathematical Forum, 2, 2007, no. 40, 957-968 Forward r-difference Operator and Finding Solution of Nonhomogeneous Difference Equations Hassan Hosseinzadeh and G. A. Afrouzi Islamic Azad University,

More information

Chapter 4: Higher-Order Differential Equations Part 1

Chapter 4: Higher-Order Differential Equations Part 1 Chapter 4: Higher-Order Differential Equations Part 1 王奕翔 Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw October 8, 2013 Higher-Order Differential Equations Most of this

More information

1.8 Dual Spaces (non-examinable)

1.8 Dual Spaces (non-examinable) 2 Theorem 1715 is just a restatement in terms of linear morphisms of a fact that you might have come across before: every m n matrix can be row-reduced to reduced echelon form using row operations Moreover,

More information

6 Inner Product Spaces

6 Inner Product Spaces Lectures 16,17,18 6 Inner Product Spaces 6.1 Basic Definition Parallelogram law, the ability to measure angle between two vectors and in particular, the concept of perpendicularity make the euclidean space

More information

1. COMPLEX NUMBERS. z 1 + z 2 := (a 1 + a 2 ) + i(b 1 + b 2 ); Multiplication by;

1. COMPLEX NUMBERS. z 1 + z 2 := (a 1 + a 2 ) + i(b 1 + b 2 ); Multiplication by; 1. COMPLEX NUMBERS Notations: N the set of the natural numbers, Z the set of the integers, R the set of real numbers, Q := the set of the rational numbers. Given a quadratic equation ax 2 + bx + c = 0,

More information

Sequences, their sums and Induction

Sequences, their sums and Induction Sequences, their sums and Induction Example (1) Calculate the 15th term of arithmetic progression, whose initial term is 2 and common differnce is 5. And its n-th term? Find the sum of this sequence from

More information

2nd-Order Linear Equations

2nd-Order Linear Equations 4 2nd-Order Linear Equations 4.1 Linear Independence of Functions In linear algebra the notion of linear independence arises frequently in the context of vector spaces. If V is a vector space over the

More information

Math 113 Homework 5. Bowei Liu, Chao Li. Fall 2013

Math 113 Homework 5. Bowei Liu, Chao Li. Fall 2013 Math 113 Homework 5 Bowei Liu, Chao Li Fall 2013 This homework is due Thursday November 7th at the start of class. Remember to write clearly, and justify your solutions. Please make sure to put your name

More information

Logic and Discrete Mathematics. Section 6.7 Recurrence Relations and Their Solution

Logic and Discrete Mathematics. Section 6.7 Recurrence Relations and Their Solution Logic and Discrete Mathematics Section 6.7 Recurrence Relations and Their Solution Slides version: January 2015 Definition A recurrence relation for a sequence a 0, a 1, a 2,... is a formula giving a n

More information

Table of contents. d 2 y dx 2, As the equation is linear, these quantities can only be involved in the following manner:

Table of contents. d 2 y dx 2, As the equation is linear, these quantities can only be involved in the following manner: M ath 0 1 E S 1 W inter 0 1 0 Last Updated: January, 01 0 Solving Second Order Linear ODEs Disclaimer: This lecture note tries to provide an alternative approach to the material in Sections 4. 4. 7 and

More information

Linear Algebra. Chapter 5

Linear Algebra. Chapter 5 Chapter 5 Linear Algebra The guiding theme in linear algebra is the interplay between algebraic manipulations and geometric interpretations. This dual representation is what makes linear algebra a fruitful

More information

Diagonalizing Matrices

Diagonalizing Matrices Diagonalizing Matrices Massoud Malek A A Let A = A k be an n n non-singular matrix and let B = A = [B, B,, B k,, B n ] Then A n A B = A A 0 0 A k [B, B,, B k,, B n ] = 0 0 = I n 0 A n Notice that A i B

More information

The Theory of Linear Homogeneous (Constant Coefficient) Recurrences

The Theory of Linear Homogeneous (Constant Coefficient) Recurrences The Theory of Linear Homogeneous (Constant Coefficient) Recurrences by Evan Houston The paper below was prepared by Evan Houston for his Combinatorics classes several years ago. The mathematics is due

More information

Complex Numbers. Integers, Rationals, and Reals. The natural numbers: The integers:

Complex Numbers. Integers, Rationals, and Reals. The natural numbers: The integers: Complex Numbers Integers, Rationals, and Reals The natural numbers: N {... 3, 2,, 0,, 2, 3...} The integers: Z {... 3, 2,, 0,, 2, 3...} Note that any two integers added, subtracted, or multiplied together

More information

Solutions to Homework #3, Math 116

Solutions to Homework #3, Math 116 Solutions to Homework #, Math 6 Keziah Cook and Michael McElroy November 5, Problem Goroff) In each of the following cases, determine the supremum of f over its domain D. If there are points x D for which

More information

Recurrence Relations

Recurrence Relations Recurrence Relations Winter 2017 Recurrence Relations Recurrence Relations A recurrence relation for the sequence {a n } is an equation that expresses a n in terms of one or more of the previous terms

More information

NOTES ON LINEAR ALGEBRA. 1. Determinants

NOTES ON LINEAR ALGEBRA. 1. Determinants NOTES ON LINEAR ALGEBRA 1 Determinants In this section, we study determinants of matrices We study their properties, methods of computation and some applications We are familiar with the following formulas

More information

be the set of complex valued 2π-periodic functions f on R such that

be the set of complex valued 2π-periodic functions f on R such that . Fourier series. Definition.. Given a real number P, we say a complex valued function f on R is P -periodic if f(x + P ) f(x) for all x R. We let be the set of complex valued -periodic functions f on

More information

6. The Algebraic Eigenproblem

6. The Algebraic Eigenproblem 6. The Algebraic Eigenproblem 6. How independent are linearly independent vectors? If the three vectors a, a 2, a 3 in R 3 lie on one plane, then there are three scalars x, x 2, x 3, not all zero, so that

More information

Section Integration of Nonnegative Measurable Functions

Section Integration of Nonnegative Measurable Functions 18.2. Integration of Nonnegative Measurable Functions 1 Section 18.2. Integration of Nonnegative Measurable Functions Note. We now define integrals of measurable functions on measure spaces. Though similar

More information

Topics in Fourier analysis - Lecture 2.

Topics in Fourier analysis - Lecture 2. Topics in Fourier analysis - Lecture 2. Akos Magyar 1 Infinite Fourier series. In this section we develop the basic theory of Fourier series of periodic functions of one variable, but only to the extent

More information

Higher Order Linear Equations Lecture 7

Higher Order Linear Equations Lecture 7 Higher Order Linear Equations Lecture 7 Dibyajyoti Deb 7.1. Outline of Lecture General Theory of nth Order Linear Equations. Homogeneous Equations with Constant Coefficients. 7.2. General Theory of nth

More information

Lecture Notes for Math 251: ODE and PDE. Lecture 12: 3.3 Complex Roots of the Characteristic Equation

Lecture Notes for Math 251: ODE and PDE. Lecture 12: 3.3 Complex Roots of the Characteristic Equation Lecture Notes for Math 21: ODE and PDE. Lecture 12: 3.3 Complex Roots of the Characteristic Equation Shawn D. Ryan Spring 2012 1 Complex Roots of the Characteristic Equation Last Time: We considered the

More information

Linear Algebra: Matrix Eigenvalue Problems

Linear Algebra: Matrix Eigenvalue Problems CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given

More information

Chapter 2: Linear Independence and Bases

Chapter 2: Linear Independence and Bases MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space

More information

) z r θ ( ) ( ) ( ) = then. Complete Solutions to Examination Questions Complete Solutions to Examination Questions 10.

) z r θ ( ) ( ) ( ) = then. Complete Solutions to Examination Questions Complete Solutions to Examination Questions 10. Complete Solutions to Examination Questions 0 Complete Solutions to Examination Questions 0. (i We need to determine + given + j, j: + + j + j (ii The product ( ( + j6 + 6 j 8 + j is given by ( + j( j

More information

10.1 Complex Arithmetic Argand Diagrams and the Polar Form The Exponential Form of a Complex Number De Moivre s Theorem 29

10.1 Complex Arithmetic Argand Diagrams and the Polar Form The Exponential Form of a Complex Number De Moivre s Theorem 29 10 Contents Complex Numbers 10.1 Complex Arithmetic 2 10.2 Argand Diagrams and the Polar Form 12 10.3 The Exponential Form of a Complex Number 20 10.4 De Moivre s Theorem 29 Learning outcomes In this Workbook

More information

Constant coefficients systems

Constant coefficients systems 5.3. 2 2 Constant coefficients systems Section Objective(s): Diagonalizable systems. Real Distinct Eigenvalues. Complex Eigenvalues. Non-Diagonalizable systems. 5.3.. Diagonalizable Systems. Remark: We

More information

Review of Linear Algebra

Review of Linear Algebra Review of Linear Algebra Throughout these notes, F denotes a field (often called the scalars in this context). 1 Definition of a vector space Definition 1.1. A F -vector space or simply a vector space

More information

Apprentice Linear Algebra, 1st day, 6/27/05

Apprentice Linear Algebra, 1st day, 6/27/05 Apprentice Linear Algebra, 1st day, 6/7/05 REU 005 Instructor: László Babai Scribe: Eric Patterson Definitions 1.1. An abelian group is a set G with the following properties: (i) ( a, b G)(!a + b G) (ii)

More information

CALCULUS JIA-MING (FRANK) LIOU

CALCULUS JIA-MING (FRANK) LIOU CALCULUS JIA-MING (FRANK) LIOU Abstract. Contents. Power Series.. Polynomials and Formal Power Series.2. Radius of Convergence 2.3. Derivative and Antiderivative of Power Series 4.4. Power Series Expansion

More information

The Gram-Schmidt Process 1

The Gram-Schmidt Process 1 The Gram-Schmidt Process In this section all vector spaces will be subspaces of some R m. Definition.. Let S = {v...v n } R m. The set S is said to be orthogonal if v v j = whenever i j. If in addition

More information

N-WEAKLY SUPERCYCLIC MATRICES

N-WEAKLY SUPERCYCLIC MATRICES N-WEAKLY SUPERCYCLIC MATRICES NATHAN S. FELDMAN Abstract. We define an operator to n-weakly hypercyclic if it has an orbit that has a dense projection onto every n-dimensional subspace. Similarly, an operator

More information

ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS

ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements

More information

6.4 BASIS AND DIMENSION (Review) DEF 1 Vectors v 1, v 2,, v k in a vector space V are said to form a basis for V if. (a) v 1,, v k span V and

6.4 BASIS AND DIMENSION (Review) DEF 1 Vectors v 1, v 2,, v k in a vector space V are said to form a basis for V if. (a) v 1,, v k span V and 6.4 BASIS AND DIMENSION (Review) DEF 1 Vectors v 1, v 2,, v k in a vector space V are said to form a basis for V if (a) v 1,, v k span V and (b) v 1,, v k are linearly independent. HMHsueh 1 Natural Basis

More information

The Cyclic Decomposition of a Nilpotent Operator

The Cyclic Decomposition of a Nilpotent Operator The Cyclic Decomposition of a Nilpotent Operator 1 Introduction. J.H. Shapiro Suppose T is a linear transformation on a vector space V. Recall Exercise #3 of Chapter 8 of our text, which we restate here

More information

Axioms for Set Theory

Axioms for Set Theory Axioms for Set Theory The following is a subset of the Zermelo-Fraenkel axioms for set theory. In this setting, all objects are sets which are denoted by letters, e.g. x, y, X, Y. Equality is logical identity:

More information

October 4, 2017 EIGENVALUES AND EIGENVECTORS. APPLICATIONS

October 4, 2017 EIGENVALUES AND EIGENVECTORS. APPLICATIONS October 4, 207 EIGENVALUES AND EIGENVECTORS. APPLICATIONS RODICA D. COSTIN Contents 4. Eigenvalues and Eigenvectors 3 4.. Motivation 3 4.2. Diagonal matrices 3 4.3. Example: solving linear differential

More information

Math 54. Selected Solutions for Week 10

Math 54. Selected Solutions for Week 10 Math 54. Selected Solutions for Week 10 Section 4.1 (Page 399) 9. Find a synchronous solution of the form A cos Ωt+B sin Ωt to the given forced oscillator equation using the method of Example 4 to solve

More information

Proof by induction ME 8

Proof by induction ME 8 Proof by induction ME 8 n Let f ( n) 9, where n. f () 9 8, which is divisible by 8. f ( n) is divisible by 8 when n =. Assume that for n =, f ( ) 9 is divisible by 8 for. f ( ) 9 9.9 9(9 ) f ( ) f ( )

More information

LINEAR ALGEBRA W W L CHEN

LINEAR ALGEBRA W W L CHEN LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008. This chapter is available free to all individuals, on the understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,

More information

Linear Independence. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

Linear Independence. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics Linear Independence MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Introduction Given a set of vectors {v 1, v 2,..., v r } and another vector v span{v 1, v 2,...,

More information

September 26, 2017 EIGENVALUES AND EIGENVECTORS. APPLICATIONS

September 26, 2017 EIGENVALUES AND EIGENVECTORS. APPLICATIONS September 26, 207 EIGENVALUES AND EIGENVECTORS. APPLICATIONS RODICA D. COSTIN Contents 4. Eigenvalues and Eigenvectors 3 4.. Motivation 3 4.2. Diagonal matrices 3 4.3. Example: solving linear differential

More information

Topic 1: Matrix diagonalization

Topic 1: Matrix diagonalization Topic : Matrix diagonalization Review of Matrices and Determinants Definition A matrix is a rectangular array of real numbers a a a m a A = a a m a n a n a nm The matrix is said to be of order n m if it

More information

Inverses of Square Matrices

Inverses of Square Matrices Inverses of Square Matrices A. Havens Department of Mathematics University of Massachusetts, Amherst February 23-26, 2018 Outline 1 Defining Inverses Inverses for Products and Functions Defining Inverse

More information

The set of all solutions to the homogeneous equation Ax = 0 is a subspace of R n if A is m n.

The set of all solutions to the homogeneous equation Ax = 0 is a subspace of R n if A is m n. 0 Subspaces (Now, we are ready to start the course....) Definitions: A linear combination of the vectors v, v,..., v m is any vector of the form c v + c v +... + c m v m, where c,..., c m R. A subset V

More information

3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall

3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall c Dr Oksana Shatalov, Fall 2014 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from A to B is a rule that assigns to each element in the set

More information

Chapter 10 Conjugate Direction Methods

Chapter 10 Conjugate Direction Methods Chapter 10 Conjugate Direction Methods An Introduction to Optimization Spring, 2012 1 Wei-Ta Chu 2012/4/13 Introduction Conjugate direction methods can be viewed as being intermediate between the method

More information

Section 9.3 Phase Plane Portraits (for Planar Systems)

Section 9.3 Phase Plane Portraits (for Planar Systems) Section 9.3 Phase Plane Portraits (for Planar Systems) Key Terms: Equilibrium point of planer system yꞌ = Ay o Equilibrium solution Exponential solutions o Half-line solutions Unstable solution Stable

More information

Chapter 2 Linear Transformations

Chapter 2 Linear Transformations Chapter 2 Linear Transformations Linear Transformations Loosely speaking, a linear transformation is a function from one vector space to another that preserves the vector space operations. Let us be more

More information

Our goal is to solve a general constant coecient linear second order. this way but that will not always happen). Once we have y 1, it will always

Our goal is to solve a general constant coecient linear second order. this way but that will not always happen). Once we have y 1, it will always October 5 Relevant reading: Section 2.1, 2.2, 2.3 and 2.4 Our goal is to solve a general constant coecient linear second order ODE a d2 y dt + bdy + cy = g (t) 2 dt where a, b, c are constants and a 0.

More information

α = Permutation groups

α = Permutation groups Permutation groups A permutation of a set A is another name for a bijection from A to A, that is, any function ϕ: A A which is both one-to-one and onto. When A is a finite set with n objects, it is customary

More information

1.1 Simple functions and equations Polynomials and polynomial equations

1.1 Simple functions and equations Polynomials and polynomial equations 1 Preliminary algebra This opening chapter reviews the basic algebra of which a working knowledge is presumed in the rest of the book. Many students will be familiar with much, if not all, of it, but recent

More information

NOTES ON LINEAR ALGEBRA OVER INTEGRAL DOMAINS. Contents. 1. Introduction 1 2. Rank and basis 1 3. The set of linear maps 4. 1.

NOTES ON LINEAR ALGEBRA OVER INTEGRAL DOMAINS. Contents. 1. Introduction 1 2. Rank and basis 1 3. The set of linear maps 4. 1. NOTES ON LINEAR ALGEBRA OVER INTEGRAL DOMAINS Contents 1. Introduction 1 2. Rank and basis 1 3. The set of linear maps 4 1. Introduction These notes establish some basic results about linear algebra over

More information

Modern Control Systems

Modern Control Systems Modern Control Systems Matthew M. Peet Arizona State University Lecture 2: Mathematical Preliminaries Mathematics - Sets and Subsets Definition 1. A set, D, is any collection of elements, d. Denoted d

More information

No books, notes, any calculator, or electronic devices are allowed on this exam. Show all of your steps in each answer to receive a full credit.

No books, notes, any calculator, or electronic devices are allowed on this exam. Show all of your steps in each answer to receive a full credit. MTH 309-001 Fall 2016 Exam 1 10/05/16 Name (Print): PID: READ CAREFULLY THE FOLLOWING INSTRUCTION Do not open your exam until told to do so. This exam contains 7 pages (including this cover page) and 7

More information

ARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS

ARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS ARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS TIMO ERKAMA It is an open question whether n-cycles of complex quadratic polynomials can be contained in the field Q(i) of complex rational numbers

More information

Math Euler Cauchy Equations

Math Euler Cauchy Equations 1 Math 371 - Euler Cauchy Equations Erik Kjær Pedersen November 29, 2005 We shall now consider the socalled Euler Cauchy equation x 2 y + axy + by = 0 where a and b are constants. To solve this we put

More information

Linear differential equations with constant coefficients Method of undetermined coefficients

Linear differential equations with constant coefficients Method of undetermined coefficients Linear differential equations with constant coefficients Method of undetermined coefficients e u+vi = e u (cos vx + i sin vx), u, v R, i 2 = -1 Quasi-polynomial: Q α+βi,k (x) = e αx [cos βx ( f 0 + f 1

More information

Ordinary Differential Equations (ODEs)

Ordinary Differential Equations (ODEs) Chapter 13 Ordinary Differential Equations (ODEs) We briefly review how to solve some of the most standard ODEs. 13.1 First Order Equations 13.1.1 Separable Equations A first-order ordinary differential

More information

Notes for Recitation 14

Notes for Recitation 14 6.04/18.06J Mathematics for Computer Science October 7, 006 Tom Leighton and Ronitt Rubinfeld Notes for Recitation 14 Guessing a Particular Solution A general linear recurrence has the form: fn) = b 1

More information

Number systems over orders of algebraic number fields

Number systems over orders of algebraic number fields Number systems over orders of algebraic number fields Attila Pethő Department of Computer Science, University of Debrecen, Hungary and University of Ostrava, Faculty of Science, Czech Republic Joint work

More information

Differential equations

Differential equations Differential equations Math 7 Spring Practice problems for April Exam Problem Use the method of elimination to find the x-component of the general solution of x y = 6x 9x + y = x 6y 9y Soln: The system

More information

REPRESENTATION THEORY WEEK 7

REPRESENTATION THEORY WEEK 7 REPRESENTATION THEORY WEEK 7 1. Characters of L k and S n A character of an irreducible representation of L k is a polynomial function constant on every conjugacy class. Since the set of diagonalizable

More information

SOLUTION SETS OF RECURRENCE RELATIONS

SOLUTION SETS OF RECURRENCE RELATIONS SOLUTION SETS OF RECURRENCE RELATIONS SEBASTIAN BOZLEE UNIVERSITY OF COLORADO AT BOULDER The first section of these notes describes general solutions to linear, constant-coefficient, homogeneous recurrence

More information

5 Set Operations, Functions, and Counting

5 Set Operations, Functions, and Counting 5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,

More information

UNDERSTANDING THE DIAGONALIZATION PROBLEM. Roy Skjelnes. 1.- Linear Maps 1.1. Linear maps. A map T : R n R m is a linear map if

UNDERSTANDING THE DIAGONALIZATION PROBLEM. Roy Skjelnes. 1.- Linear Maps 1.1. Linear maps. A map T : R n R m is a linear map if UNDERSTANDING THE DIAGONALIZATION PROBLEM Roy Skjelnes Abstract These notes are additional material to the course B107, given fall 200 The style may appear a bit coarse and consequently the student is

More information

Exam 1 - Definitions and Basic Theorems

Exam 1 - Definitions and Basic Theorems Exam 1 - Definitions and Basic Theorems One of the difficuliies in preparing for an exam where there will be a lot of proof problems is knowing what you re allowed to cite and what you actually have to

More information

RIGIDITY OF MINIMAL ISOMETRIC IMMERSIONS OF SPHERES INTO SPHERES. Christine M. Escher Oregon State University. September 10, 1997

RIGIDITY OF MINIMAL ISOMETRIC IMMERSIONS OF SPHERES INTO SPHERES. Christine M. Escher Oregon State University. September 10, 1997 RIGIDITY OF MINIMAL ISOMETRIC IMMERSIONS OF SPHERES INTO SPHERES Christine M. Escher Oregon State University September, 1997 Abstract. We show two specific uniqueness properties of a fixed minimal isometric

More information

BASES. Throughout this note V is a vector space over a scalar field F. N denotes the set of positive integers and i,j,k,l,m,n,p N.

BASES. Throughout this note V is a vector space over a scalar field F. N denotes the set of positive integers and i,j,k,l,m,n,p N. BASES BRANKO ĆURGUS Throughout this note V is a vector space over a scalar field F. N denotes the set of positive integers and i,j,k,l,m,n,p N. 1. Linear independence Definition 1.1. If m N, α 1,...,α

More information

3.5 Undetermined Coefficients

3.5 Undetermined Coefficients 3.5. UNDETERMINED COEFFICIENTS 153 11. t 2 y + ty + 4y = 0, y(1) = 3, y (1) = 4 12. t 2 y 4ty + 6y = 0, y(0) = 1, y (0) = 1 3.5 Undetermined Coefficients In this section and the next we consider the nonhomogeneous

More information

Complex numbers, the exponential function, and factorization over C

Complex numbers, the exponential function, and factorization over C Complex numbers, the exponential function, and factorization over C 1 Complex Numbers Recall that for every non-zero real number x, its square x 2 = x x is always positive. Consequently, R does not contain

More information

Eigenvalues and Eigenvectors 7.1 Eigenvalues and Eigenvecto

Eigenvalues and Eigenvectors 7.1 Eigenvalues and Eigenvecto 7.1 November 6 7.1 Eigenvalues and Eigenvecto Goals Suppose A is square matrix of order n. Eigenvalues of A will be defined. Eigenvectors of A, corresponding to each eigenvalue, will be defined. Eigenspaces

More information

Math 203A - Solution Set 4

Math 203A - Solution Set 4 Math 203A - Solution Set 4 Problem 1. Let X and Y be prevarieties with affine open covers {U i } and {V j }, respectively. (i) Construct the product prevariety X Y by glueing the affine varieties U i V

More information