TOPOLOGICAL EQUIVALENCE OF LINEAR ORDINARY DIFFERENTIAL EQUATIONS
|
|
- Megan Davis
- 5 years ago
- Views:
Transcription
1 TOPOLOGICAL EQUIVALENCE OF LINEAR ORDINARY DIFFERENTIAL EQUATIONS ALEX HUMMELS Abstract. This paper proves a theorem that gives conditions for the topological equivalence of linear ordinary differential equations. Contents 1. Introductory Concepts Phase Flows, Diffeomorphisms, and Vector Fields Linear ODEs Complexification and Decomplexification Equivalence Relations between Phase Flows 3 2. Main Theorem 3 3. Lemma The Lyapunov Function The Homeomorphism h 8 Closing Remarks 9 Acknowledgments 9 References 9 1. Introductory Concepts 1.1. Phase Flows, Diffeomorphisms, and Vector Fields. We begin with the notion of a phase flow, a concept essential to ordinary differential equations, or ODEs. A phase flow describes the motion of a point in a deterministic system, or one whose future is uniquely determined by its present state. Definition 1.1. A set of mappings {g t g t : M M, t R} is a one-parameter group of transformations of the set M if s, t R g t+s = g t g s. Then the pair (M, {g t }) is a phase flow. In this definition we assume that g 0 is the identity transformation. Definition 1.2. A differentiable, bijective function f : U V, for U, V open subsets of R n, is a diffeomorphism if f 1 : V U is differentiable. Now if ODEs are to be linked to phase flows, the transformations of the oneparameter group of a phase flow must be differentiable. For this reason we make the following definition. 1
2 2 ALEX HUMMELS Definition 1.3. Let M be a manifold. The set {g t } is a one-parameter group of diffeomorphisms if 1) {g t } is a one-parameter group of transformations of M 2) The mapping g : R M M defined by g(t, x) = g t (x) is differentiable Remark 1.4. Condition 1) implies that for every s, t R that g t+s = g t g s. So g 0 = g t+( t) = g t g t. Thus as g 0 is the identity transformation, (g t ) 1 = g t for all t. Then by condition 2) g t, (g t ) 1 are differentiable so for every t we have g t is a diffeomorphism. Now we can look at a specific vector field linked to a one-parameter group of diffeomorphisms. We begin with choosing the flow (M, {g t }) where {g t } is a oneparameter group of diffeomorphisms of some subset M R n. Definition 1.5. The phase velocity, v(x), of this flow at some point x M is v(x) = d g t x dt t=0 i.e. the vector describing the motion of the phase flow at point x. For all phase flows described by one-parameter groups of diffeomorphisms in Euclidean space, the phase velocity is a vector and is defined at each point. Thus, for any such phase flow we can create a vector field by assigning the phase velocity to each point in the phase space. This is called the phase velocity vector field. When the function g t is unknown, the right side of the above equation is commonly written as ẋ. For the remainder of this paper we shall use the ẋ notation. From here we arrive at the concept of a linear ODE Linear ODEs. Definition 1.6. Let A : R n R n be a linear transformation. A linear ordinary differential equation is one with phase space R n and phase velocity v(x) = Ax, i.e. ẋ = Ax. The proof of our theorem will also require a useful theorem about linear ODEs Theorem 1.7. Consider the linear ODE ẋ = Ax for x R n. Then there exists a unique solution ϕ : R R n with initial condition ϕ(0) = x 0. This is a direct consequence of the existence and uniqueness theorem for firstorder ordinary differential equations. In particular, the solution is defined by ϕ(t) = e ta x 0.
3 TOPOLOGICAL EQUIVALENCE OF LINEAR ORDINARY DIFFERENTIAL EQUATIONS Complexification and Decomplexification. The concepts of complexification and decomplexification will become useful to us in proving a later lemma in this paper. Any real vector space V with basis {v j } determines a complex vector space C V = C V with basis {v j }. We call C V the complexification of V. Each vector of C V is a complex linear combination v = c j v j of the v j, and V C V is identified with the subspace of those vectors whose coordinates c j are real. Similarly, any complex vector space W with basis {w j } = {a j +ib j } can be viewed as a real vector space R W with basis vectors {a j, b j }. Thus, 2dim(W ) = dim( R W ). We call R W the decomplexification of W. Remark 1.8. R ( C V ) V and C ( R W ) W for all real vector spaces V and complex vector spaces W. Before moving on, we must also consider complexification and decomplexification in terms of operators. We define a complexified operator as follows Definition 1.9. If A : U V is linear then C A : C U C V is a complex linear map defined by the equation C A(x + iy) = Ax + iay for x, y U. We can also consider the eigenvalues of C A. Definition A scalar λ C is an eigenvalue of a real operator A : U U if there exists a nonzero vector v C U, called an eigenvector, such that C Av = λv. This is important as real operators can have complex eigenvalues, which can only be accounted for by complexified operators Equivalence Relations between Phase Flows. We now switch gears to introduce another important topic - equivalence of phase flows. Definition Two phase flows (R n, {f t }) and (R n, {g t }) are equivalent if there exists a bijection h : R n R n such that for every t R that h f t = g t h. Now within this broader definition, we can more precisely specify certain types of equivalences between phase flows based on the properties of our mapping h. 1) If h, h 1 are linear, then {f t } and {g t } are linearly equivalent 2) If h, h 1 are differentiable then {f t } and {g t } are differentiably equivalent 3) If h, h 1 are continuous, then {f t } and {g t } are topologically equivalent Remark From here we observe that 1) 2) 3). Now we have all the tools necessary to state the main theorem of this paper and prove it. 2. Main Theorem Theorem 2.1. Let A, B : R n R n be linear operators with no purely imaginary eigenvalues. Then the linear ODEs ẋ = Ax and ẋ = Bx are topologically equivalent if and only if A and B have the same number of eigenvalues with positive real parts. Proving this theorem will require three different lemmas, each more difficult to prove than the last.
4 4 ALEX HUMMELS Lemma 2.2. Let A 1, B 1 : R n R n and A 2, B 2 : R m R m be linear. If the pairs of systems ẋ = A 1 x and ẋ = B 1 x as well as ẋ = A 2 x and ẋ = B 2 x are topologically equivalent, then the system defined by x 1 = A 1 x 1, x 2 = A 2 x 2 is topologically equivalent to the system defined by x 1 = B 1 x 1, x 2 = B 2 x 2. Proof of Lemma 2.2. This is an immediate result of the fact that the product of homeomorphisms is a homeomorphism. Lemma 2.3. If the operator A : R n R n has no purely imaginary eigenvalues then R n can be written as the direct sum of A-invariant subspaces, R m and R m+, such that for all eigenvalues λ of A R m, Re(λ) < 0 and for all eigenvalues µ of A R m +, Re(µ) > 0. Proof of Lemma 2.3. Consider C A in Jordan normal form and consider a single Jordan block B: λ λ Let e 1,..., e m be the basis for this block. If λ R then the e j are real vectors and we re done with this block. If λ / R then none of the e j are real vectors. In this case we see, from the definition of Jordan normal form, that the subspace spanned by the vectors e 1,..., e n corresponds to a Jordan block B. λ λ As λ λ we find the bases of these subspaces are linearly independent over C. We can then define a real subspace of R n C R n by span{e j + e j, (e j e j )i} If we complexify this space we get the span of the {e j } and {e j }. Thus as {e j } {e j } is linearly independent over C, this real subspace has dimension 2m. Also, the eigenvalues of A restricted to this subspace have strictly positive or negative real part by assumption. Thus, continuing this process with each block we can split up R n into a direct sum as required. Lemma 2.4. Let A : R n R n be linear with no purely imaginary eigenvalues. If Re(λ) > 0 for all eigenvalues λ, then the systems ẋ = Ax and ẋ = x are topologically equivalent. If Re(λ) < 0 for all eigenvalues λ, then the systems ẋ = Ax and ẋ = x are topologically equivalent. This lemma requires much more care than the other two and shall be dealt with after the main theorem is proven. For now, we will assume the lemma and proceed to the proof of the main theorem.
5 TOPOLOGICAL EQUIVALENCE OF LINEAR ORDINARY DIFFERENTIAL EQUATIONS 5 Proof of Theorem 2.1. Suppose A and B have the same number of eigenvalues with positive real parts (m + ) and those with negative real parts (m ). By lemma 2, both the operators A and B can be split into invariant subspaces A +, B + R m+ and A, B R m by the real part of their eigenvalues. By lemma 2.4, the systems ẋ = A + x and ẋ = B + x are both topologically equivalent to the standard system ẋ = x for x R m+. Similarly, it follows that ẋ = A x and ẋ = B x are topologically equivalent to ẋ = x for x R m. Then by lemma 2.2 we get both ẋ = Ax and ẋ = Bx are topologically equivalent to x 1 = x 1, x 2 = x 2 for x 1 R m+, x 2 R m. Thus, we must have that ẋ = Ax and ẋ = Bx are topologically equivalent to each other. Suppose ẋ = Ax and ẋ = Bx are topologically equivalent to each other and A has m 1 positive real part eigenvalues whereas B has m 2 positive real part eigenvalues. Using lemma 2.3, we can split A and B up into invariant subspaces according to the real part of their eigenvalues as before: A + R m1, A R n m1, B + R m2, B R n m2. Now any point in A cannot be mapped to a point not in B. Any point not in B will tend to infinity as t tends to 0, so any map between that point and any point in A must be discontinuous at 0. A similar argument holds for A + and B +. So ẋ = A + x and ẋ = B + x must be topologically equivalent, as well as ẋ = A x and ẋ = B x. However, homeomorphisms only exist between real vector spaces of the same dimension (a result which will not be proven in this paper). Thus, m 1 = m 2 as required. 3. Lemma The Lyapunov Function. This lemma hinges on the construction of a specific quadratic form called a Lyapunov function. The theorem guaranteeing the existence of the Lyapunov function is as follows: Theorem 3.1. Let A : R n R n be linear and let all eigenvalues λ of A be such that Re(λ) > 0. Then there exists a positive definite quadratic form q in R n such that the derivative of q along the vector field Ax is positive definite. In our proof we will consider the operator B = C A : C R n C R n and a positive definite quadratic form q : R C n R whose derivative along the vector field of R Bz is positive definite. This approach allows us to handle the case of complex eigenvalues, as mentioned in section 1.3. With this route, we can restrict z to the canonical copy of R n in C n to get the actual theorem. Now, we begin to construct the function guaranteed by the theorem above. We begin by choosing any basis and letting q(z) = z, z = n i=1 z iz i where the z i are the coordinates of z in our basis. This q will be our Lyapunov function. Now
6 6 ALEX HUMMELS we compute the directional derivative. R Bzq(z) = lim h 0 q(z + hbz) q(z) h z + hbz, z + hbz z, z = lim h 0 h h z, Bz + h Bz, z + h 2 Bz, Bz = lim h 0 h = z, Bz + Bz, z = Bz, z + Bz, z = 2Re Bz, z So we have shown that the derivative of our positive definite quadratic form q along the vector field R Bz is a quadratic form. Now we only need to prove that this is in fact positive definite. In order to do so, we must find a special basis. If we have an eigenbasis for B, then we get the following ( n ) 2Re Bz, z = 2Re λ i z i z i = 2 i=1 n Re(λ i z i 2 ) By assumption, we know Re(λ i ) > 0 for every i so R Bzq(z) is positive definite. However, B doesn t necessarily have an eigenbasis, so we have to find another option. The intuitive route would be to find a basis in which B is almost diagonalizable and would thus almost have an eigenbasis. We formalize this notion of such a basis in the sublemma below. Sublemma 3.2. Let B : C n C n be linear and ε > 0. Then there exists a basis in C n in which A is upper triangular with entries above the main diagonal less than ε. Proof of Sublemma 3.2. Again, we use the existence of a Jordan normal form. Consider B in Jordan normal form, where it can be decomposed into Jordan blocks of the form λ λ So we see Be i = λe i + e i 1 for i > 1 where e 1,..., e n is the basis of the specific block. Now letting e i = ( ε 2) i 1ei, we get a new basis e 1, e 2,..., e n. So for i > 1 Be i = ( ) i 1 ε Be i = 2 ( ) i 1 ε (λe i + e i 1) = λe i + ε 2 2 i=1 [ ( ) i 2 ε e i 1] = λe i + ε 2 2 e i 1.
7 TOPOLOGICAL EQUIVALENCE OF LINEAR ORDINARY DIFFERENTIAL EQUATIONS 7 Thus we get each Jordan block in a form with all entries above the diagonal less than ε. ε λ ε λ Repeating this for each block we get the sublemma as required. Now that we have this basis, we need to prove that the directional derivative of q along R Bz using this basis is positive definite. Here we use yet another sublemma before getting into the actual proof. Sublemma 3.3. If the quadratic form a(x) = n i,j=1 a ijx i x j is positive definite then there exists ε > 0 such that if b(x) = n i,j=1 b ijx i x j and every b ij < ε then every quadratic form a(x) + b(x) is also positive definite. Proof of Sublemma 3.3. We begin by considering a(x) on the unit sphere. As a(x) is continuous and the unit sphere is compact, i.e. a closed and bounded set, a(x) achieves both a supremum and infimum on the sphere. Then since a(x) > 0 for all x 0 the infimum, α, is such that a(x) α > 0. If we have b ij < ε then we get the following inequality for b(x) on the sphere n n b(x) = b ij x i x j b ij < n 2 ε i,j=1 i,j=1 As we want a(x) + b(x) > 0 for all x 0 we must have a(x) > b(x). It suffices to choose ε > 0 such that α > n 2 ε. Thus we find that if 0 < ε < α/n 2 then a(x)+b(x) is positive on the unit sphere, and is therefore positive definite. Remark 3.4. By the argument above, we get that any positive definite quadratic form a(x) can be bounded above and below like so: α x 2 a(x) β x 2, 0 < α β After all this work, we are finally ready to prove Theorem 3.1. Proof of Theorem 3.1. Let ε > 0 and consider q(z) in the basis guaranteed by sublemma 3.2. We have already shown that q and R Bzq(z) are quadratic forms regardless of basis, so we only need to show that R Bzq(z) > 0 for all z. Now we split up R Bzq(z) as follows n R Bzq(z) = 2Re Bz, z = 2Re b ij z j z i + 2Re b ij z j z i i,j=1 b ij z j z i = 2Re i=j i=j 1 We can do this because in our basis b ij = 0 for i > j and i < j 1. We also know b ii = λ i, i.e. the diagonal entries are the eigenvalues of B. From this we get that 2Re i=j b ijz j z i = 2Re n i=1 λ i z i 2 is positive definite as Re(λ i ) > 0 for all i. In our basis we know that b ij < ε for any ε > 0. Therefore by sublemma 3.2 we get 2Re b ij z j z i + 2Re b ij z j z i = R Bzq(z) > 0 z i=j i=j 1
8 8 ALEX HUMMELS As mentioned previously, by restricting z to R n, the real theorem follows from our proof in the complex case The Homeomorphism h. The object of lemma 3 is finding a homeomorphism h : R n R n between the phase flows {f t } of ẋ = Ax and {g t } of ẋ = x. In fact we are only two shorts proofs away from proving lemma 3. But first, some setup. We let S be the unit ellipsoid described by S = {x R n : q(x) = 1} where q is our Lyapunov function. Now we claim that we can define h : R n R n by 1) h fixes S pointwise 2) h(f t x 0 ) = g t x 0 for every t R, x 0 S and h(0) = 0 Now all we have to do to finish lemma 3 is show that h is well-defined, h and h 1 are continuous bijections, and h f t = g t h for all t. To do so, we start with the following sublemmas. Sublemma 3.5. Let ϕ : R n R n be some nonzero solution of ẋ = Ax and define ρ : R R by ρ(t) = ln(q(ϕ(t))). Then ρ is a diffeomorphism. In particular, there exists an α, β such that 0 < α < β and α dρ dt β. Proof of Sublemma 3.5. Now by the uniqueness theorem for linear ODEs, we get that q(ϕ(t)) 0 for all t R. Else, this would violate that 0 = 0, i.e. that the point 0 does not move along the phase flow. This guarantees that ρ is well-defined and we already know q(x) is differentiable, so we get dρ. Since Ax q(x) is a positive definite quadratic form and dρ dt that 0 < α β and α dρ dt β. dt = Axq(x) q(x) is bounded, there exists an α, β such Corollary 3.6. Every nonzero point x R n can be written uniquely in the form x = f t x 0 where x 0 S, t R, and {f t } is the phase flow of ẋ = Ax. Proof of Corollary 3.6. First we consider the solution ϕ with initial condition ϕ(0) = x. Sublemma 3.5 implies that the phase flows outward from the origin at a definite rate at all times. Thus if q(x) < 1 there exists a time τ > 0 such that q(ϕ(τ)) = 1. Else if q(x) > 1 then the property holds with τ < 0. We then set x 0 = ϕ(τ) S. Then simply by flowing (backwards in the first case and forward in the second case) in time τ seconds we reach x again. Thus, x = f t x 0 where t = τ regardless of case. Then t is unique, as the phase curve passing through some x R only intersects S in a single point, x 0, by sublemma 3.5 and the monotonicity of ρ(t). Proof of Lemma 2.4. These proofs allow us to construct a one-to-one function F : R S n 1 R n \ {0} defined by F (t, x 0 ) = f t x 0. We quickly find that F is continuous, due to the continuous dependence of solutions on their initial conditions. Similarly, F 1 is one-to-one and continuous. We can actually use the same arguments with ẋ = x and {g t }, as for ẋ = x we get dρ dt = 2Re n i=1 Ax2 i n = 2. i=1 Ax2 i Thus we can create another one-to-one function G : R S n 1 R n \ {0} defined by G(t, x 0 ) = g t x 0. By the same logic G, G 1 are one-to-one, continuous functions. In fact, considering the function G F 1 : R n \ {0} R n \ {0}, we get (G F 1 )(x) = h(x) for all x 0. Thus, as h(0) = 0, we get that h is a one-to-one function. As h is continuous at 0 by sublemma 3.5, we need only prove that h f t = g t h for all t. This is obviously true at 0, and quite easy for x 0 where x = f s x 0 as (h f t )(x) = h(f t (f s x 0 )) = h(f t+s x 0 ) = g t+s x 0 = g t (g s x 0 ) = g t (h(x)) = (g t h)(x)
9 TOPOLOGICAL EQUIVALENCE OF LINEAR ORDINARY DIFFERENTIAL EQUATIONS 9 So we have successfully constructed a homeomorphism h to prove lemma 2.4. Closing Remarks This theorem specifically disallows purely imaginary eigenvalues, so we will take a moment to consider how their inclusion affects this argument. If we allow the eigenvalues of A to be such that Re(λ) 0 then in place of the Lyapunov function there would have to be a positive semidefinite function. This in turn invalidates our proof of the main theorem, as some representation x = f t x 0 may not be unique. The argument presented in this paper is outlined in [1]. The same source notes this theorem holds locally for ODE in general. More precisely, any nonlinear ODE ẋ = v(x) is topologically equivalent to its linear part in a small neighborhood of a fixed point, provided the linear parts of v(x) have no purely imaginary eigenvalues. Acknowledgments I would like to thank my mentor Ben Lowe for his continual guidance and encouragement on this paper. References [1] V.I. Arnold. Ordinary Differential Equations. The MIT Press. Massachusetts
CLASSIFICATIONS OF THE FLOWS OF LINEAR ODE
CLASSIFICATIONS OF THE FLOWS OF LINEAR ODE PETER ROBICHEAUX Abstract. The goal of this paper is to examine characterizations of linear differential equations. We define the flow of an equation and examine
More informationTHE HARTMAN-GROBMAN THEOREM AND THE EQUIVALENCE OF LINEAR SYSTEMS
THE HARTMAN-GROBMAN THEOREM AND THE EQUIVALENCE OF LINEAR SYSTEMS GUILLAUME LAJOIE Contents 1. Introduction 2 2. The Hartman-Grobman Theorem 2 2.1. Preliminaries 2 2.2. The discrete-time Case 4 2.3. The
More informationLINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM
LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F is R or C. Definition 1. A linear operator
More informationNOTES ON LINEAR ODES
NOTES ON LINEAR ODES JONATHAN LUK We can now use all the discussions we had on linear algebra to study linear ODEs Most of this material appears in the textbook in 21, 22, 23, 26 As always, this is a preliminary
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationMATH SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER Given vector spaces V and W, V W is the vector space given by
MATH 110 - SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER 2009 GSI: SANTIAGO CAÑEZ 1. Given vector spaces V and W, V W is the vector space given by V W = {(v, w) v V and w W }, with addition and scalar
More informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
More information1 The Observability Canonical Form
NONLINEAR OBSERVERS AND SEPARATION PRINCIPLE 1 The Observability Canonical Form In this Chapter we discuss the design of observers for nonlinear systems modelled by equations of the form ẋ = f(x, u) (1)
More informationw T 1 w T 2. w T n 0 if i j 1 if i = j
Lyapunov Operator Let A F n n be given, and define a linear operator L A : C n n C n n as L A (X) := A X + XA Suppose A is diagonalizable (what follows can be generalized even if this is not possible -
More information1 Lyapunov theory of stability
M.Kawski, APM 581 Diff Equns Intro to Lyapunov theory. November 15, 29 1 1 Lyapunov theory of stability Introduction. Lyapunov s second (or direct) method provides tools for studying (asymptotic) stability
More informationAN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES
AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral radius of a matrix A may be obtained using the formula ρ(a) lim
More informationThe Jordan Canonical Form
The Jordan Canonical Form The Jordan canonical form describes the structure of an arbitrary linear transformation on a finite-dimensional vector space over an algebraically closed field. Here we develop
More informationWe simply compute: for v = x i e i, bilinearity of B implies that Q B (v) = B(v, v) is given by xi x j B(e i, e j ) =
Math 395. Quadratic spaces over R 1. Algebraic preliminaries Let V be a vector space over a field F. Recall that a quadratic form on V is a map Q : V F such that Q(cv) = c 2 Q(v) for all v V and c F, and
More informationMath 113 Winter 2013 Prof. Church Midterm Solutions
Math 113 Winter 2013 Prof. Church Midterm Solutions Name: Student ID: Signature: Question 1 (20 points). Let V be a finite-dimensional vector space, and let T L(V, W ). Assume that v 1,..., v n is a basis
More informationChapter 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 informationThe Cayley-Hamilton Theorem and the Jordan Decomposition
LECTURE 19 The Cayley-Hamilton Theorem and the Jordan Decomposition Let me begin by summarizing the main results of the last lecture Suppose T is a endomorphism of a vector space V Then T has a minimal
More informationSpectral Theorem for Self-adjoint Linear Operators
Notes for the undergraduate lecture by David Adams. (These are the notes I would write if I was teaching a course on this topic. I have included more material than I will cover in the 45 minute lecture;
More informationLecture 3: Review of Linear Algebra
ECE 83 Fall 2 Statistical Signal Processing instructor: R Nowak Lecture 3: Review of Linear Algebra Very often in this course we will represent signals as vectors and operators (eg, filters, transforms,
More informationLecture 3: Review of Linear Algebra
ECE 83 Fall 2 Statistical Signal Processing instructor: R Nowak, scribe: R Nowak Lecture 3: Review of Linear Algebra Very often in this course we will represent signals as vectors and operators (eg, filters,
More informationFirst we introduce the sets that are going to serve as the generalizations of the scalars.
Contents 1 Fields...................................... 2 2 Vector spaces.................................. 4 3 Matrices..................................... 7 4 Linear systems and matrices..........................
More informationMATH JORDAN FORM
MATH 53 JORDAN FORM Let A,, A k be square matrices of size n,, n k, respectively with entries in a field F We define the matrix A A k of size n = n + + n k as the block matrix A 0 0 0 0 A 0 0 0 0 A k It
More informationLyapunov Stability Theory
Lyapunov Stability Theory Peter Al Hokayem and Eduardo Gallestey March 16, 2015 1 Introduction In this lecture we consider the stability of equilibrium points of autonomous nonlinear systems, both in continuous
More information08a. Operators on Hilbert spaces. 1. Boundedness, continuity, operator norms
(February 24, 2017) 08a. Operators on Hilbert spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2016-17/08a-ops
More informationLinear ODEs. Existence of solutions to linear IVPs. Resolvent matrix. Autonomous linear systems
Linear ODEs p. 1 Linear ODEs Existence of solutions to linear IVPs Resolvent matrix Autonomous linear systems Linear ODEs Definition (Linear ODE) A linear ODE is a differential equation taking the form
More informationTHE JORDAN-BROUWER SEPARATION THEOREM
THE JORDAN-BROUWER SEPARATION THEOREM WOLFGANG SCHMALTZ Abstract. The Classical Jordan Curve Theorem says that every simple closed curve in R 2 divides the plane into two pieces, an inside and an outside
More informationDEVELOPMENT OF MORSE THEORY
DEVELOPMENT OF MORSE THEORY MATTHEW STEED Abstract. In this paper, we develop Morse theory, which allows us to determine topological information about manifolds using certain real-valued functions defined
More informationSolution. That ϕ W is a linear map W W follows from the definition of subspace. The map ϕ is ϕ(v + W ) = ϕ(v) + W, which is well-defined since
MAS 5312 Section 2779 Introduction to Algebra 2 Solutions to Selected Problems, Chapters 11 13 11.2.9 Given a linear ϕ : V V such that ϕ(w ) W, show ϕ induces linear ϕ W : W W and ϕ : V/W V/W : Solution.
More informationAnalysis II: The Implicit and Inverse Function Theorems
Analysis II: The Implicit and Inverse Function Theorems Jesse Ratzkin November 17, 2009 Let f : R n R m be C 1. When is the zero set Z = {x R n : f(x) = 0} the graph of another function? When is Z nicely
More informationInfinite-Dimensional Triangularization
Infinite-Dimensional Triangularization Zachary Mesyan March 11, 2018 Abstract The goal of this paper is to generalize the theory of triangularizing matrices to linear transformations of an arbitrary vector
More informationNonlinear Control. Nonlinear Control Lecture # 3 Stability of Equilibrium Points
Nonlinear Control Lecture # 3 Stability of Equilibrium Points The Invariance Principle Definitions Let x(t) be a solution of ẋ = f(x) A point p is a positive limit point of x(t) if there is a sequence
More information1.1 Limits and Continuity. Precise definition of a limit and limit laws. Squeeze Theorem. Intermediate Value Theorem. Extreme Value Theorem.
STATE EXAM MATHEMATICS Variant A ANSWERS AND SOLUTIONS 1 1.1 Limits and Continuity. Precise definition of a limit and limit laws. Squeeze Theorem. Intermediate Value Theorem. Extreme Value Theorem. Definition
More informationALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA
ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND
More informationMATH 115A: SAMPLE FINAL SOLUTIONS
MATH A: SAMPLE FINAL SOLUTIONS JOE HUGHES. Let V be the set of all functions f : R R such that f( x) = f(x) for all x R. Show that V is a vector space over R under the usual addition and scalar multiplication
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationLinear Algebra 2 Spectral Notes
Linear Algebra 2 Spectral Notes In what follows, V is an inner product vector space over F, where F = R or C. We will use results seen so far; in particular that every linear operator T L(V ) has a complex
More informationRichard DiSalvo. Dr. Elmer. Mathematical Foundations of Economics. Fall/Spring,
The Finite Dimensional Normed Linear Space Theorem Richard DiSalvo Dr. Elmer Mathematical Foundations of Economics Fall/Spring, 20-202 The claim that follows, which I have called the nite-dimensional normed
More information4 Countability axioms
4 COUNTABILITY AXIOMS 4 Countability axioms Definition 4.1. Let X be a topological space X is said to be first countable if for any x X, there is a countable basis for the neighborhoods of x. X is said
More informationThe 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 informationA proof of the Jordan normal form theorem
A proof of the Jordan normal form theorem Jordan normal form theorem states that any matrix is similar to a blockdiagonal matrix with Jordan blocks on the diagonal. To prove it, we first reformulate it
More informationExamples include: (a) the Lorenz system for climate and weather modeling (b) the Hodgkin-Huxley system for neuron modeling
1 Introduction Many natural processes can be viewed as dynamical systems, where the system is represented by a set of state variables and its evolution governed by a set of differential equations. Examples
More informationMath 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 informationBalanced Truncation 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.242, Fall 2004: MODEL REDUCTION Balanced Truncation This lecture introduces balanced truncation for LTI
More informationDefinition (T -invariant subspace) Example. Example
Eigenvalues, Eigenvectors, Similarity, and Diagonalization We now turn our attention to linear transformations of the form T : V V. To better understand the effect of T on the vector space V, we begin
More informationx i e i ) + Q(x n e n ) + ( i<n c ij x i x j
Math 210A. Quadratic spaces over R 1. Algebraic preliminaries Let V be a finite free module over a nonzero commutative ring F. Recall that a quadratic form on V is a map Q : V F such that Q(cv) = c 2 Q(v)
More informationNOTES ON VECTOR-VALUED INTEGRATION MATH 581, SPRING 2017
NOTES ON VECTOR-VALUED INTEGRATION MATH 58, SPRING 207 Throughout, X will denote a Banach space. Definition 0.. Let ϕ(s) : X be a continuous function from a compact Jordan region R n to a Banach space
More informationTHEODORE VORONOV DIFFERENTIABLE MANIFOLDS. Fall Last updated: November 26, (Under construction.)
4 Vector fields Last updated: November 26, 2009. (Under construction.) 4.1 Tangent vectors as derivations After we have introduced topological notions, we can come back to analysis on manifolds. Let M
More informationStability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games
Stability of Feedback Solutions for Infinite Horizon Noncooperative Differential Games Alberto Bressan ) and Khai T. Nguyen ) *) Department of Mathematics, Penn State University **) Department of Mathematics,
More informationGRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.
GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,
More informationChapter 4 & 5: Vector Spaces & Linear Transformations
Chapter 4 & 5: Vector Spaces & Linear Transformations Philip Gressman University of Pennsylvania Philip Gressman Math 240 002 2014C: Chapters 4 & 5 1 / 40 Objective The purpose of Chapter 4 is to think
More information1 )(y 0) {1}. Thus, the total count of points in (F 1 (y)) is equal to deg y0
1. Classification of 1-manifolds Theorem 1.1. Let M be a connected 1 manifold. Then M is diffeomorphic either to [0, 1], [0, 1), (0, 1), or S 1. We know that none of these four manifolds are not diffeomorphic
More informationNonlinear Control. Nonlinear Control Lecture # 2 Stability of Equilibrium Points
Nonlinear Control Lecture # 2 Stability of Equilibrium Points Basic Concepts ẋ = f(x) f is locally Lipschitz over a domain D R n Suppose x D is an equilibrium point; that is, f( x) = 0 Characterize and
More informationConvergence Rate of Nonlinear Switched Systems
Convergence Rate of Nonlinear Switched Systems Philippe JOUAN and Saïd NACIRI arxiv:1511.01737v1 [math.oc] 5 Nov 2015 January 23, 2018 Abstract This paper is concerned with the convergence rate of the
More informationREPRESENTATIONS OF S n AND GL(n, C)
REPRESENTATIONS OF S n AND GL(n, C) SEAN MCAFEE 1 outline For a given finite group G, we have that the number of irreducible representations of G is equal to the number of conjugacy classes of G Although
More informationLecture 4. Chapter 4: Lyapunov Stability. Eugenio Schuster. Mechanical Engineering and Mechanics Lehigh University.
Lecture 4 Chapter 4: Lyapunov Stability Eugenio Schuster schuster@lehigh.edu Mechanical Engineering and Mechanics Lehigh University Lecture 4 p. 1/86 Autonomous Systems Consider the autonomous system ẋ
More informationHomework For each of the following matrices, find the minimal polynomial and determine whether the matrix is diagonalizable.
Math 5327 Fall 2018 Homework 7 1. For each of the following matrices, find the minimal polynomial and determine whether the matrix is diagonalizable. 3 1 0 (a) A = 1 2 0 1 1 0 x 3 1 0 Solution: 1 x 2 0
More informationNONCOMMUTATIVE POLYNOMIAL EQUATIONS. Edward S. Letzter. Introduction
NONCOMMUTATIVE POLYNOMIAL EQUATIONS Edward S Letzter Introduction My aim in these notes is twofold: First, to briefly review some linear algebra Second, to provide you with some new tools and techniques
More informationReal representations
Real representations 1 Definition of a real representation Definition 1.1. Let V R be a finite dimensional real vector space. A real representation of a group G is a homomorphism ρ VR : G Aut V R, where
More information5 More on Linear Algebra
14.102, Math for Economists Fall 2004 Lecture Notes, 9/23/2004 These notes are primarily based on those written by George Marios Angeletos for the Harvard Math Camp in 1999 and 2000, and updated by Stavros
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationLecture 2 - Unconstrained Optimization Definition[Global Minimum and Maximum]Let f : S R be defined on a set S R n. Then
Lecture 2 - Unconstrained Optimization Definition[Global Minimum and Maximum]Let f : S R be defined on a set S R n. Then 1. x S is a global minimum point of f over S if f (x) f (x ) for any x S. 2. x S
More informationTopic 2 Quiz 2. choice C implies B and B implies C. correct-choice C implies B, but B does not imply C
Topic 1 Quiz 1 text A reduced row-echelon form of a 3 by 4 matrix can have how many leading one s? choice must have 3 choice may have 1, 2, or 3 correct-choice may have 0, 1, 2, or 3 choice may have 0,
More information1. Bounded linear maps. A linear map T : E F of real Banach
DIFFERENTIABLE MAPS 1. Bounded linear maps. A linear map T : E F of real Banach spaces E, F is bounded if M > 0 so that for all v E: T v M v. If v r T v C for some positive constants r, C, then T is bounded:
More informationChapter 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 informationNOTES II FOR 130A JACOB STERBENZ
NOTES II FOR 130A JACOB STERBENZ Abstract. Here are some notes on the Jordan canonical form as it was covered in class. Contents 1. Polynomials 1 2. The Minimal Polynomial and the Primary Decomposition
More informationDifferential Topology Final Exam With Solutions
Differential Topology Final Exam With Solutions Instructor: W. D. Gillam Date: Friday, May 20, 2016, 13:00 (1) Let X be a subset of R n, Y a subset of R m. Give the definitions of... (a) smooth function
More informationConstruction of Lyapunov functions by validated computation
Construction of Lyapunov functions by validated computation Nobito Yamamoto 1, Kaname Matsue 2, and Tomohiro Hiwaki 1 1 The University of Electro-Communications, Tokyo, Japan yamamoto@im.uec.ac.jp 2 The
More informationLecture 22: Jordan canonical form of upper-triangular matrices (1)
Lecture 22: Jordan canonical form of upper-triangular matrices (1) Travis Schedler Tue, Dec 6, 2011 (version: Tue, Dec 6, 1:00 PM) Goals (2) Definition, existence, and uniqueness of Jordan canonical form
More informationThe goal of this chapter is to study linear systems of ordinary differential equations: dt,..., dx ) T
1 1 Linear Systems The goal of this chapter is to study linear systems of ordinary differential equations: ẋ = Ax, x(0) = x 0, (1) where x R n, A is an n n matrix and ẋ = dx ( dt = dx1 dt,..., dx ) T n.
More informationJordan Normal Form. Chapter Minimal Polynomials
Chapter 8 Jordan Normal Form 81 Minimal Polynomials Recall p A (x) =det(xi A) is called the characteristic polynomial of the matrix A Theorem 811 Let A M n Then there exists a unique monic polynomial q
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets
FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES CHRISTOPHER HEIL 1. Compact Sets Definition 1.1 (Compact and Totally Bounded Sets). Let X be a metric space, and let E X be
More informationLINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS
LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F has characteristic zero. The following are facts (in
More informationIr O D = D = ( ) Section 2.6 Example 1. (Bottom of page 119) dim(v ) = dim(l(v, W )) = dim(v ) dim(f ) = dim(v )
Section 3.2 Theorem 3.6. Let A be an m n matrix of rank r. Then r m, r n, and, by means of a finite number of elementary row and column operations, A can be transformed into the matrix ( ) Ir O D = 1 O
More information3.2 Real and complex symmetric bilinear forms
Then, the adjoint of f is the morphism 3 f + : Q 3 Q 3 ; x 5 0 x. 0 2 3 As a verification, you can check that 3 0 B 5 0 0 = B 3 0 0. 0 0 2 3 3 2 5 0 3.2 Real and complex symmetric bilinear forms Throughout
More informationThroughout these notes we assume V, W are finite dimensional inner product spaces over C.
Math 342 - Linear Algebra II Notes Throughout these notes we assume V, W are finite dimensional inner product spaces over C 1 Upper Triangular Representation Proposition: Let T L(V ) There exists an orthonormal
More informationA PRIMER ON SESQUILINEAR FORMS
A PRIMER ON SESQUILINEAR FORMS BRIAN OSSERMAN This is an alternative presentation of most of the material from 8., 8.2, 8.3, 8.4, 8.5 and 8.8 of Artin s book. Any terminology (such as sesquilinear form
More informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More informationBASIC ALGORITHMS IN LINEAR ALGEBRA. Matrices and Applications of Gaussian Elimination. A 2 x. A T m x. A 1 x A T 1. A m x
BASIC ALGORITHMS IN LINEAR ALGEBRA STEVEN DALE CUTKOSKY Matrices and Applications of Gaussian Elimination Systems of Equations Suppose that A is an n n matrix with coefficents in a field F, and x = (x,,
More informationMath 102, Winter Final Exam Review. Chapter 1. Matrices and Gaussian Elimination
Math 0, Winter 07 Final Exam Review Chapter. Matrices and Gaussian Elimination { x + x =,. Different forms of a system of linear equations. Example: The x + 4x = 4. [ ] [ ] [ ] vector form (or the column
More informationSynchronization, Chaos, and the Dynamics of Coupled Oscillators. Supplemental 1. Winter Zachary Adams Undergraduate in Mathematics and Biology
Synchronization, Chaos, and the Dynamics of Coupled Oscillators Supplemental 1 Winter 2017 Zachary Adams Undergraduate in Mathematics and Biology Outline: The shift map is discussed, and a rigorous proof
More information21 Linear State-Space Representations
ME 132, Spring 25, UC Berkeley, A Packard 187 21 Linear State-Space Representations First, let s describe the most general type of dynamic system that we will consider/encounter in this class Systems may
More informationAPPPHYS217 Tuesday 25 May 2010
APPPHYS7 Tuesday 5 May Our aim today is to take a brief tour of some topics in nonlinear dynamics. Some good references include: [Perko] Lawrence Perko Differential Equations and Dynamical Systems (Springer-Verlag
More informationMath 443 Differential Geometry Spring Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook.
Math 443 Differential Geometry Spring 2013 Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook. Endomorphisms of a Vector Space This handout discusses
More information7. Symmetric Matrices and Quadratic Forms
Linear Algebra 7. Symmetric Matrices and Quadratic Forms CSIE NCU 1 7. Symmetric Matrices and Quadratic Forms 7.1 Diagonalization of symmetric matrices 2 7.2 Quadratic forms.. 9 7.4 The singular value
More informationA SHORT INTRODUCTION TO BANACH LATTICES AND
CHAPTER A SHORT INTRODUCTION TO BANACH LATTICES AND POSITIVE OPERATORS In tis capter we give a brief introduction to Banac lattices and positive operators. Most results of tis capter can be found, e.g.,
More informationExercise Solutions to Functional Analysis
Exercise Solutions to Functional Analysis Note: References refer to M. Schechter, Principles of Functional Analysis Exersize that. Let φ,..., φ n be an orthonormal set in a Hilbert space H. Show n f n
More informationm We can similarly replace any pair of complex conjugate eigenvalues with 2 2 real blocks. = R
1 RODICA D. COSTIN Suppose that some eigenvalues are not real. Then the matrices S and are not real either, and the diagonalization of M must be done in C n. Suppose that we want to work in R n only. Recall
More informationREPRESENTATION 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 information5 Quiver Representations
5 Quiver Representations 5. Problems Problem 5.. Field embeddings. Recall that k(y,..., y m ) denotes the field of rational functions of y,..., y m over a field k. Let f : k[x,..., x n ] k(y,..., y m )
More informationDifferential Topology Solution Set #2
Differential Topology Solution Set #2 Select Solutions 1. Show that X compact implies that any smooth map f : X Y is proper. Recall that a space is called compact if, for every cover {U } by open sets
More informationDIFFERENTIAL TOPOLOGY AND THE POINCARÉ-HOPF THEOREM
DIFFERENTIAL TOPOLOGY AND THE POINCARÉ-HOPF THEOREM ARIEL HAFFTKA 1. Introduction In this paper we approach the topology of smooth manifolds using differential tools, as opposed to algebraic ones such
More informationLinear algebra 2. Yoav Zemel. March 1, 2012
Linear algebra 2 Yoav Zemel March 1, 2012 These notes were written by Yoav Zemel. The lecturer, Shmuel Berger, should not be held responsible for any mistake. Any comments are welcome at zamsh7@gmail.com.
More informationPutzer s Algorithm. Norman Lebovitz. September 8, 2016
Putzer s Algorithm Norman Lebovitz September 8, 2016 1 Putzer s algorithm The differential equation dx = Ax, (1) dt where A is an n n matrix of constants, possesses the fundamental matrix solution exp(at),
More informationEmpirical Processes: General Weak Convergence Theory
Empirical Processes: General Weak Convergence Theory Moulinath Banerjee May 18, 2010 1 Extended Weak Convergence The lack of measurability of the empirical process with respect to the sigma-field generated
More informationJordan normal form notes (version date: 11/21/07)
Jordan normal form notes (version date: /2/7) If A has an eigenbasis {u,, u n }, ie a basis made up of eigenvectors, so that Au j = λ j u j, then A is diagonal with respect to that basis To see this, let
More informationE. The Hahn-Banach Theorem
E. The Hahn-Banach Theorem This Appendix contains several technical results, that are extremely useful in Functional Analysis. The following terminology is useful in formulating the statements. Definitions.
More informationLet us recall in a nutshell the definition of some important algebraic structure, increasingly more refined than that of group.
Chapter 1 SOME MATHEMATICAL TOOLS 1.1 Some definitions in algebra Let us recall in a nutshell the definition of some important algebraic structure, increasingly more refined than that of group. Ring A
More informationA LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION
A LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION O. SAVIN. Introduction In this paper we study the geometry of the sections for solutions to the Monge- Ampere equation det D 2 u = f, u
More informationDefinition 5.1. A vector field v on a manifold M is map M T M such that for all x M, v(x) T x M.
5 Vector fields Last updated: March 12, 2012. 5.1 Definition and general properties We first need to define what a vector field is. Definition 5.1. A vector field v on a manifold M is map M T M such that
More informationChapter Two Elements of Linear Algebra
Chapter Two Elements of Linear Algebra Previously, in chapter one, we have considered single first order differential equations involving a single unknown function. In the next chapter we will begin to
More informationGQE ALGEBRA PROBLEMS
GQE ALGEBRA PROBLEMS JAKOB STREIPEL Contents. Eigenthings 2. Norms, Inner Products, Orthogonality, and Such 6 3. Determinants, Inverses, and Linear (In)dependence 4. (Invariant) Subspaces 3 Throughout
More information