ON AN INFINITE SET OF NON-LINEAR DIFFERENTIAL EQUATIONS By J. B. McLEOD (Oxford)

Size: px
Start display at page:

Download "ON AN INFINITE SET OF NON-LINEAR DIFFERENTIAL EQUATIONS By J. B. McLEOD (Oxford)"

Transcription

1 ON AN INFINITE SET OF NON-LINEAR DIFFERENTIAL EQUATIONS By J. B. McLEOD (Oxford) [Received 25 October 1961] 1. IT is of some interest in the study of collision processes to consider the solution of the infinite set of non-linear differential equations where the initial conditions are!/i(0) = l, Sfi(0) = O (» = 2,3,4,...). (1.2) We are concerned with positive values of the independent variable t, which is physically the time, and the constant coefficients a if are positive and symmetric, i.e. a ti ^ 0, a^ = a it. The only work that seems to have been done on this type of problem from the pure-mathematical point of view has been restricted, in effect, to the case where o w is bounded, as in (1), (2). The extension to unbounded a y appears difficult, but this paper makes a start on the problem by solving explicitly one specific case, when a ti = ij, and by proving, in 4, an existence theorem (though not a uniqueness theorem) under fairly general conditions on a tj. I hope to return to the problem of uniqueness and other related questions in a later paper. 2. The case a {i = ij THEOEBM 1. There is one and only one solution of the equations (1.1), with the initial conditions (1.2) and with a^ = ij, for which 2*V< ** absolutely and uniformly convergent for t in some closed interval [0,&], where # < 1. Furthermore, this solution continues to be a valid solution for all positive t <C 1, but its analytic continuation, though meaningful, fails to remain a solution for t > 1. In fact, there is no solution whatever of the equations, with the given initial conditions, for which J* 2^! ** absolutely and uniformly convergent in some interval [0, e], where e ^ 1. Proof. For convenience, we divide the proof into three parts, (i) showing that the solution is unique, (ii) showing that the solution exists, and (iii) discussing the continuance of the solution. In (i), (ii), we shall, of course, be restricted to values of (in [0,#]. Quart. J. Math. Oxford (2), 13 (1962),

2 120 J. B. McLEOD (i) With the given convergence assumptions, we can multiply the ith equation by t and add to obtain 2 * = - &* provided that the second term on the right-hand side converges. In fact, it converges absolutely because it is just a rearrangement of the first term, which evidently converges absolutely. We see this by noting that, if either term is multiplied out, then the total coefficient of y t y^ is (i-\-j)ij. It follows therefore that the convergence being absolute and uniform for t in [0,#]. It follows also from (1.1) that each y ( is continuous because it is differentiable, and that dyjdt is continuous because it is the sum of a uniformly convergent series of continuous functions. Hence we may integrate (2.2) term by term, and obtain, using the initial conditions, that m t = 1. (2-3) The equations (1.1) therefore reduce to % fjii-myi-, (* = i,2,3,...). (2.4) The equations (2.4) can be solved in succession since only y 1 appears in the first, only y x and y % in the second, and so forth. This solution, and so the solution of (1.1), with initial conditions (1.2), is unique. (ii) In order to prove that there is a solution at all of (1.1), with initial conditions (1.2), we have to show that the solution of (2.4) satisfies the convergence criteria of the theorem and also (2.3). We therefore investigate the solution of (2.4). We readily obtain yx = e- 4, y* = «-*- Let us suppose in general that, forj = 1, 2,..., n, y, = A i P-^e-»IJ, (2.5) where A t is independent of t. Then, substituting in the (n+l)th equation, we have

3 ON A SET OF DIFFERENTIAL EQUATIONS 121 so that 7 n i-i 2 Hence (2.5) holds by induction for allj provided that A x = 1 and 1 "V A A A n+\ 2 ^ ( To investigate the nature of the coefficients A jt we define, formally, y(w) = fa n w»-k (2.7) n-l Then, still formally, the left-hand side of (2.6) is the coefficient of w n in o for n = 1, 2, 3,..., while the right-hand side is the coefficient of w n in to y(u)du w J o for n = 0, 1, 2,... We therefore have, formally, that, for (2.6) to be true, y(w) is a solution of w \ y i {u)du = - y{u)du A v o o Differentiating both sides, we obtain 0 and, multiplying through by w % and differentiating again, we conclude that to */ ^ whence, after a sh'ght rearrangement, we have i.e. dw, 1 dy y yw = log y+c, t

4 122 J. B. MoLEOD for some constant c. Using the fact that A x = 1, we see that y = 1 when w = 0, so that c = 0 and (2.8) This gives w as an analytic function of y in some neighbourhood of y = 1, and so, on inversion, it gives y as an analytic function of w in some neighbourhood of w = 0. Thus y can be expressed as a power series in w, and going backwards through the formal argument above, we find that the power series is given by (2.7), where A t = 1 and (2.6) is satisfied. We have therefore determined the coefficients A it given by A 1 = 1 and (2.6), as the coefficients in the expansion of a certain analytic function. We next note that, if w is given as a function of y by (2.8), then dw/dy = 0 implies logy =1, y = e, w = e- 1. Hence the radius of convergence of (2.7) is e~ x. It is now immediate that the sequence {j/y}, given by (2.5), satisfies the convergence criteria of the theorem provided that \t is so small that \te~*\ ^ e~ l 77 for some 77 > 0. It only remains to verify, in this section of the proof, that (2.3) is satisfied. If y^ is given by (2.5), and if / is sufficiently small, then 2 i-l = e-h/(te-<), (2.9) where y(w) is defined by (2.7). But, by (2.8), t/(te~0 satisfies te- t = y~ 1 \ogy, i.e. y = e*. Thus (2.9) reduces to unity, as required. (iii) The final question is whether the solution now found remains valid for all positive t. In fact, the argument in the last two paragraphs of (ii), as we have shown, holds good for all positive t such that \te~*\ < c" 1, i.e. for 0 ^ t < 1, and so the solution remains valid over this range. To investigate whether it continues to be a solution for t ^ 1, we note that it is certainly a solution of (2.4) for all positive t, and comparing (2.4) with (1.1), we see that it can continue as a solution of (1.1) if and only if J iy t = 1. In fact, this holds for t = 1, but not for t > 1.

5 ON A SET OF DIFFERENTIAL EQUATIONS 123 To consider t > 1 first, we note that then 0 < te- 4 < e~ x, and so certainly 2 *y< converges. In fact, = e-* f, Aiite- 1 )*- 1 where t* (with 0 < t* < 1) is such that t+e-'* = te-*, = e~*(f, as at the end of (ii). Hence 00 2*y< ^ * To consider t = 1, we have to investigate the coefficients -4 4 more closely. We can in fact obtain them explicitly from (2.8). For, with y = (*, (2.8) reduces to t = we?, and we can then expand e* as a power series in w by Lagrange's expansion. This gives i.e. y = 1 + > n-l and comparing this with (2.7), we obtain A n+1 = (n+l)»-vn! (n = 1, 2, 3,...). Using the asymptotic expression for n\, we conclude that J4 71 lp n and it then follows that (2.7) is uniformly convergent for 0 ^ w ^ e -1, and thus that y(w) is continuous for 0 ^ w ^ e~ l. Hence ^ iy t = 1 for < = 1. The proof of the statement in the theorem that no solution exists satisfying the convergence criteria over [0, e], where e > 1, is practically a repetition of what we have just done. For, since the convergence criteria are satisfied over [0, e], the equations (1.1) reduce to (2.4) over [0, e], as in part (i) of the proof, and (2.4) gives as the only possible solution (2.5). But (2.5) is not a solution for t > 1, and evenfor t = 1 it does not satisfy the convergence criteria since ^ i t y i diverges. 3. Theorem 1 indicates that all that we can hope to prove in any generalization is that there exists one and only one solution of the

6 124 J. B. MoLEOD equations (1.1) with initial conditions (1.2) for some interval [0,c] of t. That there is no significance in the interval [0,1] of Theorem 1 is shown by considering the case a {i = kij, for some constant k. This in fact reduces to the case a ti = ij if we replace t by T, where T = Id. From Theorem 1, we then have one and, under the convergence criteria, only one solution for the interval [0,1] of T, which is [0,1/k] for t. 4. The general case Let us first consider very briefly what happens if a ti = c i Cj, where, since a ti ^ 0, we must have c i ^ 0 for all i. In fact, we may exclude the case c i 0 for any i. For, if c t = 0 for just one value of t, then the corresponding y t appears in no equation but the tth, for it appears with the coefficient c { (= 0) in any other equation. We may therefore ignore y t and solve the remaining equations for the remaining yy The problem therefore reduces to a similar one in which all the coefficients are non-vanishing. This argument can plainly be repeated if c t = 0 for more than one value of t. Further, by making a change of scale as in 3, we may suppose that More generally, if we suppose that there are numbers c i such that c-ii ^ c<cy for all i, j, then once again we may assume without loss of generality that c t > 0 for all t. For, if c t = 0 for some particular value of t, then ay = 0 for this value of i and all j, and y t can be eliminated as before. And once again we may suppose that (^ = 1. Given a sequence of non-zero numbers {c n } (n = 1,2,3,...), with c 1 = 1, we define a related sequence {C n } by the recurrence relations We then have C, = 1, (4.1) Lf,0^ = ^1 ^ (n= 1,2,3,...). (4.2) fi C n+1 THEOREM 2. //, in the problem of (1.1) with initial conditions (1.2), we have a if <j c { Cj, where, without loss of generality, we may suppose c { > 0for alii and <^ = I, and,if the sequence {C n }defined by (4.1) and (4.2) is such that the power series J C zn n h* 13 non-zero radius of convergence R, then the problem possesses at least one solution valid in any closed interval [0, R #] of t, where # > 0. (We may remark that this is not a best-possible result since, in the case of J 2, Theorem 2 would give us a range of validity [0, e~ x #], whereas Theorem 1 tells us that it is

7 ON A SET OF DIFFERENTIAL EQUATIONS 125 actually [0,1]. It is also perhaps worth emphasizing that, although Theorem 2 places no convergence criteria as in Theorem 1, it at the same time Bays nothing about uniqueness.) Proof. Consider the N equations with the initial conditions!^(0)=l, yi N) (0) = 0 (»=2,3 N). (4.3 a) By multiplying the tth equation of (4.3) by i and adding for t = 1, 2,..., N, we find that, as at the beginning of Theorem 1, the terms on the right-hand side cancel, so that N whence 2*^ = 1. (4.4) The proof of the theorem breaks fairly naturally into three sections: (i) we show that the problem of (4.3) and (4.3 a) has one and only one solution, and that this solution is valid for all positive t and is such that yi^it) > 0 for all t; (ii) we show that, for fixed i and N -> oo, the sequence {y[ N) (t)} is uniformly bounded and equicontinuous for t in [0, R #]; (iii) we show that there is a sequence of values of N tending to infinity for which, for all i and t in [0, R &], yi N) (t) -> y^t), where t/<(<) a solution of the problem of (1.1) and (1.2). (i) We note first that the right-hand side of (4.3) satisfies a Lipschitz condition in the y[^ if the y^ are bounded. But this is certainly so initially, and so, by a familiar theorem in the theory of the existence of solutions of differential equations, there is one and only one solution of (4.3) and (4.3 a) for some interval [0,t x ], say, oft. We note secondly that, for t sufficiently small in [0, t J, y[ N) ^ 0 for ' For»r>«>> = i. 2,^(0) = 0, 5*U >0) i-o unless On = 0, when, from (4.3),

8 126 J. B. McLEOD which, with the initial condition j/^(0) = 0, implies that y^ = 0; «-* m =o, rn >», unless, arguing again as above, y^ = 0, and so forth. If we now drop from the equations all functions which are identically zero, and renumber to fill up the gaps, we can show that, except for the initial vanishing of y^,..., yffl, we have y^ > 0 for all i and all t (not necessarily sufficiently small) in [0, t{\. For, if we suppose that y]^, say, is the first to vanish as ( increases in [0, <J (if two vanish simultaneously, we choose the one with the smaller value of k) and if we suppose that it vanishes first at t = o, then we have from (4.3) that whioh is a contradiction. If y^ > 0 for all i, then it follows from (4.4) that y{ m < 1 for all t, and so we can treat t x as the initial point, apply the Lipschitz-condition argument, and extend the region of validity. As we repeat this process, we can either extend the region of validity to all positive t, which is what we want, or we find that there is a least upper bound on the values of t for which extension is possible. Let us suppose this bound is T, so that we can extend to any interval [0, T &], where & > 0, but not to any interval [0, T+&]. As t -> T, we certainly have for all i, by arguments already used, that yw > 0, and so,from (4.4), yw < 1. Hence, from (4.3), Idy^/dt] < K for all i and some constant K. Certainly, y^(<) has at least one limit as t -* T because it is bounded, but in fact the limit is unique. For, if we suppose not, then we can find two values of t arbitrarily close to T for which the values of y\ N) {t) are not arbitrarily close, and this contradicts the boundedness of the differential coefficient. If we now define, vum.,. im,.-, y\ N) (T) = km y^it), 1-+T-0 we can apply the usual Lipsohitz-condition argument to extend the solution beyond T, which contradicts the definition of T. We have thus shown that we can extend the solution to all positive t, and it is unique because we have throughout used Lipschitz-condition arguments. Furthermore the argument implies that y^ > 0 for all t except initially and except for those functions which vanish identically. This completes section (i) of the proof.

9 ON A SET OF DIFFERENTIAL EQUATIONS 127 (ii) We now investigate bounds for the solutions y^. Since certainly 1, we have, from (4.3), with t = 2, that so that ytf < #. Suppose in general that Then again from (4.3) so that yj*> < ^ t*- 1 (t = 1, 2,...,n). (4.5) v ( JV, ^ ^ <. by virtue of (4.2). Using induction, we establish the truth of (4.5) for i = 1, 2,..., N. We note that the estimate (4.5) for y^ is independent ofn. We note next that N m Ic t y^<fc t^, (4.6) i-l i-1 by virtue of (4.5), and that the right-hand side is bounded, independent of N, provided that t lies in [0, R &]. From now on we shall suppose t to lie in such an interval. With this restriction on t, we now show that y^, for fixed t, is equicontinuous for all N. We shall certainly have shown this if we prove that dyw/dt is bounded for all N, t, and this follows from (4.3) by using (4.5) and (4.6). For fixed t, therefore, but for all N, and for all f in [0, B &], the sequence {y^(0} is a uniformly bounded, equicontinuous set. Hence, by Ascoli's lemma [as, for example, in (3) 5], there is a subsequence which is uniformly convergent for t in [0, R #]. (iii) We can now employ the principle of the Helly selection theorem to show that there is a sequence of values of N for which {j/^(0} i 8 uniformly convergent, not just for one i, but for all t. For we have established a subsequence 2VJ < N\ < N\ <... such that for this subsequence {y^jia uniformly convergent. We can then find a subsequence of this subsequence, say N% < N\ < N% <..., such that {yi^} is also uniformly convergent. And, in general, for any integer i, we can find a subsequence Ng < N[ < N\ <..., which is a subsequence of that for i 1, and such that for it {y[ N) }, {yi N) },..., {y\ N) } are all uniformly

10 128 ON A SET OF DIFFERENTIAL EQUATIONS convergent. The sequence ivj, N\, N\,... is then a subsequence for which {y^1} is uniformly convergent for all t. From now on, we shall restrict ourselves to values of N in this subsequence. Then lim y^(t) = Vi(t), say. (4.7) As N -* oo through this subsequence, and for t in [0, R &], S i-l CO converges uniformly to c i!/< ^ivi ^ where N o, though large, is to be fixed. We first choose N o so that, using (4.5) and (4.6), both the second and third terms on the right-hand side do not exceed Je, for any given e > 0, and, N o once chosen, we can make N sufficiently large so that, from (4.7), the first term also does not exceed e. It thus follows that dyf^jdt converges uniformly to i-l 2 from which it follows that the functions y { (t) satisfy (1.1). This completes the proof of the theorem. REFERENCES 1. Z. A. Melzak, 'A scalar transport equation', Trans. American Math. Soc. 85 (1957) D. Morgenstern, 'Analytical studies related to the Maiwell-Boltzmann equation', J. Rational Mech. Anal. 4 (1955) E. A. Coddington and N. Levinson, Theory of ordinary differential equations (New York, 1955).

LECTURE 10: REVIEW OF POWER SERIES. 1. Motivation

LECTURE 10: REVIEW OF POWER SERIES. 1. Motivation LECTURE 10: REVIEW OF POWER SERIES By definition, a power series centered at x 0 is a series of the form where a 0, a 1,... and x 0 are constants. For convenience, we shall mostly be concerned with the

More information

Group, Rings, and Fields Rahul Pandharipande. I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S,

Group, Rings, and Fields Rahul Pandharipande. I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S, Group, Rings, and Fields Rahul Pandharipande I. Sets Let S be a set. The Cartesian product S S is the set of ordered pairs of elements of S, A binary operation φ is a function, S S = {(x, y) x, y S}. φ

More information

Proof. We indicate by α, β (finite or not) the end-points of I and call

Proof. We indicate by α, β (finite or not) the end-points of I and call C.6 Continuous functions Pag. 111 Proof of Corollary 4.25 Corollary 4.25 Let f be continuous on the interval I and suppose it admits non-zero its (finite or infinite) that are different in sign for x tending

More information

On the remarkable Properties of the Coefficients which occur in the Expansion of the binomial raised to an arbitrary power *

On the remarkable Properties of the Coefficients which occur in the Expansion of the binomial raised to an arbitrary power * On the remarkable Properties of the Coefficients which occur in the Expansion of the binomial raised to an arbitrary power * Leonhard Euler THEOREM If for the power of the binomial raised to the exponent

More information

Eigenvalues and Eigenfunctions of the Laplacian

Eigenvalues and Eigenfunctions of the Laplacian The Waterloo Mathematics Review 23 Eigenvalues and Eigenfunctions of the Laplacian Mihai Nica University of Waterloo mcnica@uwaterloo.ca Abstract: The problem of determining the eigenvalues and eigenvectors

More information

Polynomial expansions in the Borel region

Polynomial expansions in the Borel region Polynomial expansions in the Borel region By J. T. HURT and L. R. FORD, Rice Institute, Houston, Texas. (Received 22nd August, 1936. Read 6th November, 1936.) This paper deals with certain expansions of

More information

a j x j. j=0 The number R (possibly infinite) which Theorem 1 guarantees is called the radius of convergence of the power series.

a j x j. j=0 The number R (possibly infinite) which Theorem 1 guarantees is called the radius of convergence of the power series. Lecture 6 Power series A very important class of series to study are the power series. They are interesting in part because they represent functions and in part because they encode their coefficients which

More information

Linear Algebra. The analysis of many models in the social sciences reduces to the study of systems of equations.

Linear Algebra. The analysis of many models in the social sciences reduces to the study of systems of equations. POLI 7 - Mathematical and Statistical Foundations Prof S Saiegh Fall Lecture Notes - Class 4 October 4, Linear Algebra The analysis of many models in the social sciences reduces to the study of systems

More information

Limits and Continuity

Limits and Continuity Chapter Limits and Continuity. Limits of Sequences.. The Concept of Limit and Its Properties A sequence { } is an ordered infinite list x,x,...,,... The n-th term of the sequence is, and n is the index

More information

Series Solutions. 8.1 Taylor Polynomials

Series Solutions. 8.1 Taylor Polynomials 8 Series Solutions 8.1 Taylor Polynomials Polynomial functions, as we have seen, are well behaved. They are continuous everywhere, and have continuous derivatives of all orders everywhere. It also turns

More information

1 The Existence and Uniqueness Theorem for First-Order Differential Equations

1 The Existence and Uniqueness Theorem for First-Order Differential Equations 1 The Existence and Uniqueness Theorem for First-Order Differential Equations Let I R be an open interval and G R n, n 1, be a domain. Definition 1.1 Let us consider a function f : I G R n. The general

More information

ON NATURAL FAMILIES OF CURVES

ON NATURAL FAMILIES OF CURVES WSJ NATURAL FAMILIES OF CURVES 793 ON NATURAL FAMILIES OF CURVES BY C. H. ROWE 1. Introduction. A natural family of curves in a Riemannian space VN of N dimensions is a family which consists of the oo

More information

Vector Spaces in Quantum Mechanics

Vector Spaces in Quantum Mechanics Chapter 8 Vector Spaces in Quantum Mechanics We have seen in the previous Chapter that there is a sense in which the state of a quantum system can be thought of as being made up of other possible states.

More information

Introduction to Real Analysis Alternative Chapter 1

Introduction to Real Analysis Alternative Chapter 1 Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces

More information

FACTORIZATION AND THE PRIMES

FACTORIZATION AND THE PRIMES I FACTORIZATION AND THE PRIMES 1. The laws of arithmetic The object of the higher arithmetic is to discover and to establish general propositions concerning the natural numbers 1, 2, 3,... of ordinary

More information

Weighted Sums of Orthogonal Polynomials Related to Birth-Death Processes with Killing

Weighted Sums of Orthogonal Polynomials Related to Birth-Death Processes with Killing Advances in Dynamical Systems and Applications ISSN 0973-5321, Volume 8, Number 2, pp. 401 412 (2013) http://campus.mst.edu/adsa Weighted Sums of Orthogonal Polynomials Related to Birth-Death Processes

More information

Topic 4 Notes Jeremy Orloff

Topic 4 Notes Jeremy Orloff Topic 4 Notes Jeremy Orloff 4 auchy s integral formula 4. Introduction auchy s theorem is a big theorem which we will use almost daily from here on out. Right away it will reveal a number of interesting

More information

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9 MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended

More information

Math 109 HW 9 Solutions

Math 109 HW 9 Solutions Math 109 HW 9 Solutions Problems IV 18. Solve the linear diophantine equation 6m + 10n + 15p = 1 Solution: Let y = 10n + 15p. Since (10, 15) is 5, we must have that y = 5x for some integer x, and (as we

More information

SECOND-ORDER RECURRENCES. Lawrence Somer Department of Mathematics, Catholic University of America, Washington, D.C

SECOND-ORDER RECURRENCES. Lawrence Somer Department of Mathematics, Catholic University of America, Washington, D.C p-stability OF DEGENERATE SECOND-ORDER RECURRENCES Lawrence Somer Department of Mathematics, Catholic University of America, Washington, D.C. 20064 Walter Carlip Department of Mathematics and Computer

More information

Contents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3

Contents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3 Analysis Math Notes Study Guide Real Analysis Contents Ordered Fields 2 Ordered sets and fields 2 Construction of the Reals 1: Dedekind Cuts 2 Metric Spaces 3 Metric Spaces 3 Definitions 4 Separability

More information

Chapter 11 - Sequences and Series

Chapter 11 - Sequences and Series Calculus and Analytic Geometry II Chapter - Sequences and Series. Sequences Definition. A sequence is a list of numbers written in a definite order, We call a n the general term of the sequence. {a, a

More information

Induction, sequences, limits and continuity

Induction, sequences, limits and continuity Induction, sequences, limits and continuity Material covered: eclass notes on induction, Chapter 11, Section 1 and Chapter 2, Sections 2.2-2.5 Induction Principle of mathematical induction: Let P(n) be

More information

LECTURE 12 A MODEL OF LIQUIDITY PREFERENCE (CONCLUDED)

LECTURE 12 A MODEL OF LIQUIDITY PREFERENCE (CONCLUDED) LECTURE 12 A MODEL OF LIQUIDITY PREFERENCE (CONCLUDED) JACOB T. SCHWARTZ EDITED BY KENNETH R. DRIESSEL Abstract. We prove Theorem 11.6 and Theorem 11.9 of the previous lecture. 1. Proof of Theorem 11.6

More information

ON DIVISION ALGEBRAS*

ON DIVISION ALGEBRAS* ON DIVISION ALGEBRAS* BY J. H. M. WEDDERBURN 1. The object of this paper is to develop some of the simpler properties of division algebras, that is to say, linear associative algebras in which division

More information

CHAPTER 8: EXPLORING R

CHAPTER 8: EXPLORING R CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed

More information

Math 104: Homework 7 solutions

Math 104: Homework 7 solutions Math 04: Homework 7 solutions. (a) The derivative of f () = is f () = 2 which is unbounded as 0. Since f () is continuous on [0, ], it is uniformly continous on this interval by Theorem 9.2. Hence for

More information

Calculation of the Ramanujan t-dirichlet. By Robert Spira

Calculation of the Ramanujan t-dirichlet. By Robert Spira MATHEMATICS OF COMPUTATION, VOLUME 27, NUMBER 122, APRIL, 1973 Calculation of the Ramanujan t-dirichlet Series By Robert Spira Abstract. A method is found for calculating the Ramanujan T-Dirichlet series

More information

Existence and uniqueness: Picard s theorem

Existence and uniqueness: Picard s theorem Existence and uniqueness: Picard s theorem First-order equations Consider the equation y = f(x, y) (not necessarily linear). The equation dictates a value of y at each point (x, y), so one would expect

More information

Math Homework 2

Math Homework 2 Math 73 Homework Due: September 8, 6 Suppose that f is holomorphic in a region Ω, ie an open connected set Prove that in any of the following cases (a) R(f) is constant; (b) I(f) is constant; (c) f is

More information

Jumping Sequences. Steve Butler Department of Mathematics University of California, Los Angeles Los Angeles, CA

Jumping Sequences. Steve Butler Department of Mathematics University of California, Los Angeles Los Angeles, CA 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 11 (2008), Article 08.4.5 Jumping Sequences Steve Butler Department of Mathematics University of California, Los Angeles Los Angeles, CA 90095 butler@math.ucla.edu

More information

Solutions Final Exam May. 14, 2014

Solutions Final Exam May. 14, 2014 Solutions Final Exam May. 14, 2014 1. Determine whether the following statements are true or false. Justify your answer (i.e., prove the claim, derive a contradiction or give a counter-example). (a) (10

More information

DR.RUPNATHJI( DR.RUPAK NATH )

DR.RUPNATHJI( DR.RUPAK NATH ) Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology

More information

Math 410 Homework 6 Due Monday, October 26

Math 410 Homework 6 Due Monday, October 26 Math 40 Homework 6 Due Monday, October 26. Let c be any constant and assume that lim s n = s and lim t n = t. Prove that: a) lim c s n = c s We talked about these in class: We want to show that for all

More information

Calculus (Real Analysis I)

Calculus (Real Analysis I) Calculus (Real Analysis I) (MAT122β) Department of Mathematics University of Ruhuna A.W.L. Pubudu Thilan Department of Mathematics University of Ruhuna Calculus (Real Analysis I)(MAT122β) 1/172 Chapter

More information

LIE RING METHODS IN THE THEORY OF FINITE NILPOTENT GROUPS

LIE RING METHODS IN THE THEORY OF FINITE NILPOTENT GROUPS 307 LIE RING METHODS IN THE THEORY OF FINITE NILPOTENT GROUPS By GRAHAM HIGMAN 1. Introduction There are, of course, many connections between Group Theory and the theory of Lie rings, and my title is,

More information

FIRST YEAR CALCULUS W W L CHEN

FIRST YEAR CALCULUS W W L CHEN FIRST YER CLCULUS W W L CHEN c W W L Chen, 994, 28. 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

PELL S EQUATION, II KEITH CONRAD

PELL S EQUATION, II KEITH CONRAD PELL S EQUATION, II KEITH CONRAD 1. Introduction In Part I we met Pell s equation x dy = 1 for nonsquare positive integers d. We stated Lagrange s theorem that every Pell equation has a nontrivial solution

More information

Infinite series, improper integrals, and Taylor series

Infinite series, improper integrals, and Taylor series Chapter 2 Infinite series, improper integrals, and Taylor series 2. Introduction to series In studying calculus, we have explored a variety of functions. Among the most basic are polynomials, i.e. functions

More information

Week 2: Sequences and Series

Week 2: Sequences and Series QF0: Quantitative Finance August 29, 207 Week 2: Sequences and Series Facilitator: Christopher Ting AY 207/208 Mathematicians have tried in vain to this day to discover some order in the sequence of prime

More information

Mat104 Fall 2002, Improper Integrals From Old Exams

Mat104 Fall 2002, Improper Integrals From Old Exams Mat4 Fall 22, Improper Integrals From Old Eams For the following integrals, state whether they are convergent or divergent, and give your reasons. () (2) (3) (4) (5) converges. Break it up as 3 + 2 3 +

More information

1 5 π 2. 5 π 3. 5 π π x. 5 π 4. Figure 1: We need calculus to find the area of the shaded region.

1 5 π 2. 5 π 3. 5 π π x. 5 π 4. Figure 1: We need calculus to find the area of the shaded region. . Area In order to quantify the size of a 2-dimensional object, we use area. Since we measure area in square units, we can think of the area of an object as the number of such squares it fills up. Using

More information

In particular, if A is a square matrix and λ is one of its eigenvalues, then we can find a non-zero column vector X with

In particular, if A is a square matrix and λ is one of its eigenvalues, then we can find a non-zero column vector X with Appendix: Matrix Estimates and the Perron-Frobenius Theorem. This Appendix will first present some well known estimates. For any m n matrix A = [a ij ] over the real or complex numbers, it will be convenient

More information

GENERALIZED ANNUITIES AND ASSURANCES, AND INTER-RELATIONSHIPS. BY LEIGH ROBERTS, M.Sc., ABSTRACT

GENERALIZED ANNUITIES AND ASSURANCES, AND INTER-RELATIONSHIPS. BY LEIGH ROBERTS, M.Sc., ABSTRACT GENERALIZED ANNUITIES AND ASSURANCES, AND THEIR INTER-RELATIONSHIPS BY LEIGH ROBERTS, M.Sc., A.I.A ABSTRACT By the definition of generalized assurances and annuities, the relation is shown to be the simplest

More information

AAA = A -A A = A A A; AAA = A AA = AA. A- AAAA=A-AAA = AA-AA; PPPP P. PPP = PP pp

AAA = A -A A = A A A; AAA = A AA = AA. A- AAAA=A-AAA = AA-AA; PPPP P. PPP = PP pp 26 GRASSMANN'S SPACE ANALYSIS. Laws of Combinatory Multiplication. All combinatoryproducts are assumed to be subject to the distributive law expressed by the equation A{B+C) = AB + AC. The planimetric

More information

MTH4101 CALCULUS II REVISION NOTES. 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) ax 2 + bx + c = 0. x = b ± b 2 4ac 2a. i = 1.

MTH4101 CALCULUS II REVISION NOTES. 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) ax 2 + bx + c = 0. x = b ± b 2 4ac 2a. i = 1. MTH4101 CALCULUS II REVISION NOTES 1. COMPLEX NUMBERS (Thomas Appendix 7 + lecture notes) 1.1 Introduction Types of numbers (natural, integers, rationals, reals) The need to solve quadratic equations:

More information

Arithmetic Funtions Over Rings with Zero Divisors

Arithmetic Funtions Over Rings with Zero Divisors BULLETIN of the Bull Malaysian Math Sc Soc (Second Series) 24 (200 81-91 MALAYSIAN MATHEMATICAL SCIENCES SOCIETY Arithmetic Funtions Over Rings with Zero Divisors 1 PATTIRA RUANGSINSAP, 1 VICHIAN LAOHAKOSOL

More information

Principles of Real Analysis I Fall I. The Real Number System

Principles of Real Analysis I Fall I. The Real Number System 21-355 Principles of Real Analysis I Fall 2004 I. The Real Number System The main goal of this course is to develop the theory of real-valued functions of one real variable in a systematic and rigorous

More information

Analysis III. Exam 1

Analysis III. Exam 1 Analysis III Math 414 Spring 27 Professor Ben Richert Exam 1 Solutions Problem 1 Let X be the set of all continuous real valued functions on [, 1], and let ρ : X X R be the function ρ(f, g) = sup f g (1)

More information

MATH 566 LECTURE NOTES 6: NORMAL FAMILIES AND THE THEOREMS OF PICARD

MATH 566 LECTURE NOTES 6: NORMAL FAMILIES AND THE THEOREMS OF PICARD MATH 566 LECTURE NOTES 6: NORMAL FAMILIES AND THE THEOREMS OF PICARD TSOGTGEREL GANTUMUR 1. Introduction Suppose that we want to solve the equation f(z) = β where f is a nonconstant entire function and

More information

B. Differential Equations A differential equation is an equation of the form

B. Differential Equations A differential equation is an equation of the form B Differential Equations A differential equation is an equation of the form ( n) F[ t; x(, xʹ (, x ʹ ʹ (, x ( ; α] = 0 dx d x ( n) d x where x ʹ ( =, x ʹ ʹ ( =,, x ( = n A differential equation describes

More information

GENERALIZED CANTOR SETS AND SETS OF SUMS OF CONVERGENT ALTERNATING SERIES

GENERALIZED CANTOR SETS AND SETS OF SUMS OF CONVERGENT ALTERNATING SERIES Journal of Applied Analysis Vol. 7, No. 1 (2001), pp. 131 150 GENERALIZED CANTOR SETS AND SETS OF SUMS OF CONVERGENT ALTERNATING SERIES M. DINDOŠ Received September 7, 2000 and, in revised form, February

More information

Math From Scratch Lesson 28: Rational Exponents

Math From Scratch Lesson 28: Rational Exponents Math From Scratch Lesson 28: Rational Exponents W. Blaine Dowler October 8, 2012 Contents 1 Exponent Review 1 1.1 x m................................. 2 x 1.2 n x................................... 2 m

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

Limits at Infinity. Horizontal Asymptotes. Definition (Limits at Infinity) Horizontal Asymptotes

Limits at Infinity. Horizontal Asymptotes. Definition (Limits at Infinity) Horizontal Asymptotes Limits at Infinity If a function f has a domain that is unbounded, that is, one of the endpoints of its domain is ±, we can determine the long term behavior of the function using a it at infinity. Definition

More information

4 / Gaussian Ensembles. Level Density

4 / Gaussian Ensembles. Level Density 4 / Gaussian Ensembles. Level Density In this short chapter we reproduce a statistical mechanical argument of Wigner to "derive" the level density for the Gaussian ensembles. The joint probability density

More information

Module 10: Finite Difference Methods for Boundary Value Problems Lecture 42: Special Boundary Value Problems. The Lecture Contains:

Module 10: Finite Difference Methods for Boundary Value Problems Lecture 42: Special Boundary Value Problems. The Lecture Contains: The Lecture Contains: Finite Difference Method Boundary conditions of the second and third kind Solution of the difference scheme: Linear case Solution of the difference scheme: nonlinear case Problems

More information

2. Let S stand for an increasing sequence of distinct positive integers In ;}

2. Let S stand for an increasing sequence of distinct positive integers In ;} APPROXIMATION BY POLYNOMIALS By J. A. CLARKSON AND P. ERDÖS 1. Let In ;) be a set of distinct positive integers. According to a theorem of Müntz and Szász, the condition En -.' = - is necessary and sufficient

More information

ON REARRANGEMENTS OF SERIES H. M. SENGUPTA

ON REARRANGEMENTS OF SERIES H. M. SENGUPTA O REARRAGEMETS OF SERIES H. M. SEGUPTA In an interesting paper published in the Bulletin of the American Mathematical Society, R. P. Agnew1 considers some questions on rearrangement of conditionally convergent

More information

Properties of Sequences

Properties of Sequences Properties of Sequences Here is a FITB proof arguing that a sequence cannot converge to two different numbers. The basic idea is to argue that if we assume this can happen, we deduce that something contradictory

More information

RANDOM WALKS IN Z d AND THE DIRICHLET PROBLEM

RANDOM WALKS IN Z d AND THE DIRICHLET PROBLEM RNDOM WLKS IN Z d ND THE DIRICHLET PROBLEM ERIC GUN bstract. Random walks can be used to solve the Dirichlet problem the boundary value problem for harmonic functions. We begin by constructing the random

More information

MATH 5616H INTRODUCTION TO ANALYSIS II SAMPLE FINAL EXAM: SOLUTIONS

MATH 5616H INTRODUCTION TO ANALYSIS II SAMPLE FINAL EXAM: SOLUTIONS MATH 5616H INTRODUCTION TO ANALYSIS II SAMPLE FINAL EXAM: SOLUTIONS You may not use notes, books, etc. Only the exam paper, a pencil or pen may be kept on your desk during the test. Calculators are not

More information

Some Fun with Divergent Series

Some Fun with Divergent Series Some Fun with Divergent Series 1. Preliminary Results We begin by examining the (divergent) infinite series S 1 = 1 + 2 + 3 + 4 + 5 + 6 + = k=1 k S 2 = 1 2 + 2 2 + 3 2 + 4 2 + 5 2 + 6 2 + = k=1 k 2 (i)

More information

PRELIMINARIES FOR HYPERGEOMETRIC EQUATION. We will only consider differential equations with regular singularities in this lectures.

PRELIMINARIES FOR HYPERGEOMETRIC EQUATION. We will only consider differential equations with regular singularities in this lectures. PRELIMINARIES FOR HYPERGEOMETRIC EQUATION EDMUND Y.-M. CHIANG Abstract. We give a brief introduction to some preliminaries for Gauss hypergeometric equations. We will only consider differential equations

More information

Theorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.

Theorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u. 5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field

More information

Introduction to Series and Sequences Math 121 Calculus II Spring 2015

Introduction to Series and Sequences Math 121 Calculus II Spring 2015 Introduction to Series and Sequences Math Calculus II Spring 05 The goal. The main purpose of our study of series and sequences is to understand power series. A power series is like a polynomial of infinite

More information

ter. on Can we get a still better result? Yes, by making the rectangles still smaller. As we make the rectangles smaller and smaller, the

ter. on Can we get a still better result? Yes, by making the rectangles still smaller. As we make the rectangles smaller and smaller, the Area and Tangent Problem Calculus is motivated by two main problems. The first is the area problem. It is a well known result that the area of a rectangle with length l and width w is given by A = wl.

More information

Metric Spaces and Topology

Metric Spaces and Topology Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies

More information

Cauchy Integral Formula Consequences

Cauchy Integral Formula Consequences Cauchy Integral Formula Consequences Monday, October 28, 2013 1:59 PM Homework 3 due November 15, 2013 at 5 PM. Last time we derived Cauchy's Integral Formula, which we will present in somewhat generalized

More information

Standard forms for writing numbers

Standard forms for writing numbers Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,

More information

DISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k

DISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k DISTRIBUTION OF FIBONACCI AND LUCAS NUMBERS MODULO 3 k RALF BUNDSCHUH AND PETER BUNDSCHUH Dedicated to Peter Shiue on the occasion of his 70th birthday Abstract. Let F 0 = 0,F 1 = 1, and F n = F n 1 +F

More information

The Not-Formula Book for C2 Everything you need to know for Core 2 that won t be in the formula book Examination Board: AQA

The Not-Formula Book for C2 Everything you need to know for Core 2 that won t be in the formula book Examination Board: AQA Not The Not-Formula Book for C Everything you need to know for Core that won t be in the formula book Examination Board: AQA Brief This document is intended as an aid for revision. Although it includes

More information

Lecture 6: Lies, Inner Product Spaces, and Symmetric Matrices

Lecture 6: Lies, Inner Product Spaces, and Symmetric Matrices Math 108B Professor: Padraic Bartlett Lecture 6: Lies, Inner Product Spaces, and Symmetric Matrices Week 6 UCSB 2014 1 Lies Fun fact: I have deceived 1 you somewhat with these last few lectures! Let me

More information

Here are brief notes about topics covered in class on complex numbers, focusing on what is not covered in the textbook.

Here are brief notes about topics covered in class on complex numbers, focusing on what is not covered in the textbook. Phys374, Spring 2008, Prof. Ted Jacobson Department of Physics, University of Maryland Complex numbers version 5/21/08 Here are brief notes about topics covered in class on complex numbers, focusing on

More information

UNIT 1 DETERMINANTS 1.0 INTRODUCTION 1.1 OBJECTIVES. Structure

UNIT 1 DETERMINANTS 1.0 INTRODUCTION 1.1 OBJECTIVES. Structure UNIT 1 DETERMINANTS Determinants Structure 1.0 Introduction 1.1 Objectives 1.2 Determinants of Order 2 and 3 1.3 Determinants of Order 3 1.4 Properties of Determinants 1.5 Application of Determinants 1.6

More information

2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1

2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1 Lectures - Week 11 General First Order ODEs & Numerical Methods for IVPs In general, nonlinear problems are much more difficult to solve than linear ones. Unfortunately many phenomena exhibit nonlinear

More information

O N P O S I T I V E N U M B E R S n F O R W H I C H Q(n) D I V I D E S F n

O N P O S I T I V E N U M B E R S n F O R W H I C H Q(n) D I V I D E S F n O N P O S I T I V E N U M B E R S n F O R W H I C H Q(n) D I V I D E S F n Florian Luca IMATE de la UNAM, Ap. Postal 61-3 (Xangari), CP 58 089, Morelia, Michoacan, Mexico e-mail: fluca@matmor.unain.inx

More information

Notes on uniform convergence

Notes on uniform convergence Notes on uniform convergence Erik Wahlén erik.wahlen@math.lu.se January 17, 2012 1 Numerical sequences We begin by recalling some properties of numerical sequences. By a numerical sequence we simply mean

More information

MATH 117 LECTURE NOTES

MATH 117 LECTURE NOTES MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set

More information

EXISTENCE THEOREMS FOR SOLUTIONS OF DIFFERENTIAL EQUATIONS OF NON-INTEGRAL ORDER*

EXISTENCE THEOREMS FOR SOLUTIONS OF DIFFERENTIAL EQUATIONS OF NON-INTEGRAL ORDER* 100 EVERETT PITCHER AND W. E. SEWELL [February EXISTENCE THEOREMS FOR SOLUTIONS OF DIFFERENTIAL EQUATIONS OF NON-INTEGRAL ORDER* EVERETT PITCHER AND W. E. SEWELL 1. Introduction. In this paper we prove

More information

3 The language of proof

3 The language of proof 3 The language of proof After working through this section, you should be able to: (a) understand what is asserted by various types of mathematical statements, in particular implications and equivalences;

More information

A LITTLE REAL ANALYSIS AND TOPOLOGY

A LITTLE REAL ANALYSIS AND TOPOLOGY A LITTLE REAL ANALYSIS AND TOPOLOGY 1. NOTATION Before we begin some notational definitions are useful. (1) Z = {, 3, 2, 1, 0, 1, 2, 3, }is the set of integers. (2) Q = { a b : aεz, bεz {0}} is the set

More information

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 1998 Comments to the author at krm@maths.uq.edu.au Contents 1 LINEAR EQUATIONS

More information

Rings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.

Rings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R. Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over

More information

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

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2. Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real

More information

Hilbert spaces. 1. Cauchy-Schwarz-Bunyakowsky inequality

Hilbert spaces. 1. Cauchy-Schwarz-Bunyakowsky inequality (October 29, 2016) Hilbert spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/fun/notes 2016-17/03 hsp.pdf] Hilbert spaces are

More information

Power series and Taylor series

Power series and Taylor series Power series and Taylor series D. DeTurck University of Pennsylvania March 29, 2018 D. DeTurck Math 104 002 2018A: Series 1 / 42 Series First... a review of what we have done so far: 1 We examined series

More information

Ordinary Differential Equation Introduction and Preliminaries

Ordinary Differential Equation Introduction and Preliminaries Ordinary Differential Equation Introduction and Preliminaries There are many branches of science and engineering where differential equations arise naturally. Now days, it finds applications in many areas

More information

Multiple attractors in Newton's method

Multiple attractors in Newton's method Ergod. Th. & Dynam. Sys. (1986), 6, 561-569 Printed in Great Britain Multiple attractors in Newton's method MIKE HURLEY Department of Mathematics and Statistics, Case Western Reserve University, Cleveland,

More information

Finite Fields: An introduction through exercises Jonathan Buss Spring 2014

Finite Fields: An introduction through exercises Jonathan Buss Spring 2014 Finite Fields: An introduction through exercises Jonathan Buss Spring 2014 A typical course in abstract algebra starts with groups, and then moves on to rings, vector spaces, fields, etc. This sequence

More information

A function is actually a simple concept; if it were not, history would have replaced it with a simpler one by now! Here is the definition:

A function is actually a simple concept; if it were not, history would have replaced it with a simpler one by now! Here is the definition: 1.2 Functions and Their Properties A function is actually a simple concept; if it were not, history would have replaced it with a simpler one by now! Here is the definition: Definition: Function, Domain,

More information

Lecture for Week 2 (Secs. 1.3 and ) Functions and Limits

Lecture for Week 2 (Secs. 1.3 and ) Functions and Limits Lecture for Week 2 (Secs. 1.3 and 2.2 2.3) Functions and Limits 1 First let s review what a function is. (See Sec. 1 of Review and Preview.) The best way to think of a function is as an imaginary machine,

More information

A Geometrical Proof of a Theorem of Hurwitz.

A Geometrical Proof of a Theorem of Hurwitz. 59 A Geometrical Proof of a Theorem of Hurwitz. By Dr LESTER R. FOED. {Read 11th May 1917. Received 14th June 1917.) 1. In the study of rational approximations to irrational numbers the following problem

More information

Functional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...

Functional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability... Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................

More information

Maths 212: Homework Solutions

Maths 212: Homework Solutions Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then

More information

Section 2.8: The Existence and Uniqueness Theorem

Section 2.8: The Existence and Uniqueness Theorem Section 2.8: The Existence and Uniqueness Theorem MATH 351 California State University, Northridge March 10, 2014 MATH 351 (Differetial Equations) Sec. 2.8 March 10, 2014 1 / 26 Theorem 2.4.2 in Section

More information

Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10

Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10 Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10 Inductive sets (used to define the natural numbers as a subset of R) (1) Definition: A set S R is an inductive

More information

The Integers. Math 3040: Spring Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers Multiplying integers 12

The Integers. Math 3040: Spring Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers Multiplying integers 12 Math 3040: Spring 2011 The Integers Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers 11 4. Multiplying integers 12 Before we begin the mathematics of this section, it is worth

More information

8. Limit Laws. lim(f g)(x) = lim f(x) lim g(x), (x) = lim x a f(x) g lim x a g(x)

8. Limit Laws. lim(f g)(x) = lim f(x) lim g(x), (x) = lim x a f(x) g lim x a g(x) 8. Limit Laws 8.1. Basic Limit Laws. If f and g are two functions and we know the it of each of them at a given point a, then we can easily compute the it at a of their sum, difference, product, constant

More information

UNIT-II Z-TRANSFORM. This expression is also called a one sided z-transform. This non causal sequence produces positive powers of z in X (z).

UNIT-II Z-TRANSFORM. This expression is also called a one sided z-transform. This non causal sequence produces positive powers of z in X (z). Page no: 1 UNIT-II Z-TRANSFORM The Z-Transform The direct -transform, properties of the -transform, rational -transforms, inversion of the transform, analysis of linear time-invariant systems in the -

More information