LINEAR DIFFERENTIAL EQUATIONS IN DISTRIBUTIONS
|
|
|
- Edward Young
- 9 years ago
- Views:
Transcription
1 LINEAR DIFFERENTIAL EQUATIONS IN DISTRIBUTIONS LESLIE D. GATES, JR.1 1. Introduction. The main result of this paper is an extension of the analysis of Laurent Schwartz [l ] concerning the primitive of a distribution. We follow the definitions and notation of Schwartz. In particular, let D denote the linear space of "testing functions" <t>(x) of the real variable x. The functions 0(x) are indefinitely differentiable and vanish identically outside of some bounded interval. Convergence in D is defined by: Definition 1. The sequence of testing functions {qb \ converges to the function <f> = 0 ({< y} >0) if and only if (a) <j>f\x) approaches zero uniformly in x (but not necessarily in k) for all k. (b) Every qb vanishes identically outside of a bounded interval common to all. Let D' denote the space of linear continuous functionals (distributions) on D. Continuity requires that if the sequence {< y}»0, the sequence of (real) numbers T<f>, where F is a distribution, also approaches zero. The linear space D' is the dual or conjugate space of D. If fix) is a function Lesbesgue integrable over every finite interval, and Td> = I J -00 fix)d>ix)dx, we shall say that T corresponds to/(7v»/). Actually the correspondence is to a class of functions identical except on a set of measure zero. Let E denote the space of real, indefinitely differentiable functions of x. We shall use small Greek letters for testing functions and capital Roman letters for distributions, except when a distribution corresponds to a function, when small Roman letters will be used; i.e., The spaces D and D' are paired orthogonally in the sense of Lefschetz. It follows from Lefschetz [2], that if 7\, T2,, Tm are a linearly independent set of distributions, a linearly independent set Received by the editors July 20, 1955 and, in revised form, October 24, This paper is based on a doctoral dissertation written under the direction of Professor H. D. Block and submitted to Iowa State College in July, The author is indebted to Professor Block for guidance and encouragement. The author is presently at the U. S. Naval Proving Ground. 933
2 934 L. D. GATES JR. [October of testing functions <f>i, <f>2,, 0m exists such that Ti<j)j da (Kronecker symbol). A product of two distributions can always be defined if one of them corresponds to a function in E. If /<-»/(x) EE, then (/D-«>= (r/)-*- T-(j<t>) for arbitrary T. The derivative of a distribution is defined by T'-4> = - T<j>'. 2. A theorem on linear differential equations in distributions. Definition 2. The equation L[T] = p0tm + pj-^n + + PnT = S, where each pi*->pi(x)ee, and 5 is a given distribution, is a linear differential equation in distributions of order n, with coefficients in E. If 5 = 0, the equation is homogeneous. Theorem 1. L[T]<b=T- L[<f>], where L is the differential operator adjoint to L. Proof. L[T]1> = ( fcr<-»y* = r<"~«(*<*) \ 1=0 / t'=0 = r-( (-l)',-i(m)(n-i)) = T-L[<p\. Theorem 2. The operation defined by 8 = L[<f>] maps D onto De, a linear subspace of D, continuously in the sense of D. Proof. The linearity of the operator L insures that D) is a linear subspace of D. Also if {</>.,} >0, it is easy to see that M = {![*,]} = { (-D-^Mí)^0} = {è?.^0} -o where ÇiEE for all i. Theorem 3. a. If Ti and T2 are solutions of L[T] =0, then CiTi + C2T2 is also a solution, where G and C2 are arbitrary constants. b. If Ti and T2 are solutions of L[T] =S, then Ti T2 is a solution ofl[t] = 0.
3 1956] LINEAR DIFFERENTIAL EQUATIONS IN DISTRIBUTIONS 935 c. The totality of solutions of L [T] =0 forms a linear subspace of D' which is the annihilator of De. Proof. Statements a and b follow immediately from the linearity of the operator L. Statement c follows from a and Theorem 1. Theorem 4. If (a) the mapping of D onto De defined by L is one-toone and has an inverse Z,-1 continuous in the sense of D, and (b) Ti<j> = T2< >= Tm-(f> = 0 are necessary and sufficient conditions that d> be in De, then the differential equation has a solution which can be written L[T] = S T-<t> = CiTi<b + S Yz^L - aflfcjy where o = Ti<f>, the d are arbitrary testing functions such that constants, and the \ /i are a set of m Ti\f>k = oik, i, k = 1,2,,m. * Proof. The existence of the ^,- is assured by the result quoted from [2]. Since L~l is the inverse of a linear operator, it is itself linear and this insures that T as defined is a linear functional. If a sequence {<f>j} *0, then the a,j= F,-0y»0, so that the sequence *j<»í - 2 flfiv'.-?- -»0. Since the operator L~x is continuous in the sense of D and 5 is a distribution s Yl-1 [<*>,- >^,l)-+o and thus T<j>,»0. This shows that T is continuous and thus indeed a distribution. Now for an arbitrary <p~(e.d, L[T]qb = TL[<ß]. By hypothesis (b), Ti-L[<b] = 0, so that the a< corresponding to L[(b] are zero. Thus we have L[T]<t>= JtCiTcL[4>] + S-I-i{L[4]] i-l = S-<t>
4 936 L. D. GATES JR. [October as desired. Also, since for all j Ti-U - Z «flm = Tr<t> - 2~1 aitrti \ i-i / 1=1 = T,-< ) Oj the testing function <b 2~2?-i a«^< is m Do by hypothesis (b). It is, therefore, a suitable operand for L~l. It will be immediately noticed that the sum 2~lT+i CíTí is a linear combination of solutions of the homogeneous equation L[r]=0, while the remainder of T corresponds to the "particular integral" of differential equations in functions. m 0 3. Examples. We give first an example where hypothesis (b) fails. Let the function p(x) be defined by Consider the differential equation We have pt' + p't = S, iexp(x2- l)-1, * <1, lo, * èl. p^p(x). (pt' + p't)-<p= T-(-(p4>)' + p'4>) = T-(-p<t>'). The subspace De is composed of testing functions of the form 6 = Z[*] = - p<t>' for 0 arbitrary in D. But it is evident that L could not have an inverse since a sequence {< ;} could fail to converge by reason of diverging supports, and yet the corresponding {0,} could converge, since each 0/ vanishes outside of ( 1, 1). (The support of a testing function is the closure of the set on which it is different from zero.) If /DO <t>(x)dx and a sequence {0,} is chosen such that till J exp---i i2 x' j2 I * <j, 0, * Ü,
5 1956] LINEAR DIFFERENTIAL EQUATIONS IN DISTRIBUTIONS 937 where k satisfies then it can be shown that although for all j, so that k f exp (xs - \)-Hx = 1, {-Hl}-*0. T-[-p4t] 5-^=1 = S-d> does not define a distribution, and the differential equation can not have a solution on an interval which includes 1 or 1. As an example of a well behaved equation, consider xt' + F = S(x<->/(x) = x), a special case of an equation whose solution was given by Schwartz [l], for the homogeneous case 5=0. We have (xt'+ T)-4>= T-(-x<p') =S-4>. The corresponding equation in testing functions is 0 = - xtf. Obviously, 0(0) =0. For all x<0, we can define a solution by /* e dx. -o» x Integrating by parts, we get <t>(x) = - 6(x) In x + J In x B'(x)dx J -00 = z-ih and this definition will serve for all x. The condition 0( o) =0 gives the necessary condition on 6 LIn x e'(x)dx = 0 (the condition cb( <») =0 requires that the constant of integration be zero). It can be shown that these conditions on 6 are also sufficient to insure that <b is a testing function. The first condition is expressed by the "Dirac" distribution
6 938 L. D. GATESJR. [October Tv4> - 0(0)1= 0 while the second can be expressed by the "pseudo function 1/x" T,<t> = f In at 4>'(x)dx = 0. The entire solution obtainable from Theorem 4 is then T-<j> = G7V0 ~\~ C2T2-<I> + S-(-0(*)ln * + f In * 6'(x)dxJ where 6 = 0 a^-i a202, a = 7Y0, Tityj = Si,: In the above example, take 5 = 5, the Dirac distribution. particular integral above becomes Then the /o p o In * <p'(x)dx ai I In * 0i (x)dx -» «J» The last two of these terms are multiples The first term is the "pseudo function" Thus the complete solution of is given by /o In * \ /í(x)dx. -00 [0(0) In 0 is defined to be lim^o 0(x) In x =0.] of ai = 7V0 and a2= T2<f>., a/x, x<o, f(x) = < I 0, * ^ 0. xt' + T = Ô T<t> = G0(O) + C2 f In x <j>'(x)dx J In x < }'(x)dx. J _oo
7 1956] LINEAR DIFFERENTIAL EQUATIONS IN DISTRIBUTIONS 939 An analysis equivalent to the above for the equation xt - at = S for 00 <o < 00 as well as for a few other equations is given by Gates in [3]. This example illustrates the fact that the solution to a differential equation in distributions is equivalent to a solution of the adjoint equation in testing functions, together with a characterization of the subspace L[<p] in terms of its annihilator. 4. Some remaining questions. Additional questions which the author would like to see answered concern two aspects of the general problem. First, are the hypotheses of Theorem 4 sufficient to insure that a complete solution has been obtained? If it is true for the space D and its dual D' that the annihilators of subspaces have the reflexive property (that is, that DeQD is the annihilator of D QD' implies that De is the annihilator of De), then the question is answered in the affirmative. For the hypothesis 'Ti<b = T2<l>= =Tm<j> = 0 is equivalent to 0G-CV would then be sufficient to insure that the subspace spanned by the F, * = 1, 2,, m, is the annihilator of De and therefore the complete subspace of solutions of the homogeneous equation L [T] = 0. Secondly, it will have been observed that the number of independent solutions is not necessarily equal to the order of the equation. This fact is related to the occurrence of zeros in the coefficients of the equation. Also, the example of the equation where no solution existed was characterized by an "essential" singularity in the leading coefficient. It would be interesting to have a theory which related the existence and number of independent solutions to the order of the zeros in the several coefficients. Such a theory would undoubtedly be related to the corresponding theory for ordinary equations. References 1. L. Schwartz, Théorie des distributions, vol. 1, Paris, (Coll. A.S.I., No ) 2. S. Lefschetz, Algebraic topology, Amer. Math. Soc. Colloquium Publications, vol. 27, New York, 1942, p L. D. Gates, Jr., Differential equations in the distributions of Schwartz, Doctoral Thesis, Iowa State College, Iowa State College
BANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
Math 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
RINGS WITH A POLYNOMIAL IDENTITY
RINGS WITH A POLYNOMIAL IDENTITY IRVING KAPLANSKY 1. Introduction. In connection with his investigation of projective planes, M. Hall [2, Theorem 6.2]* proved the following theorem: a division ring D in
1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
ON THE EMBEDDING OF BIRKHOFF-WITT RINGS IN QUOTIENT FIELDS
ON THE EMBEDDING OF BIRKHOFF-WITT RINGS IN QUOTIENT FIELDS DOV TAMARI 1. Introduction and general idea. In this note a natural problem arising in connection with so-called Birkhoff-Witt algebras of Lie
Duality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
α = u v. In other words, Orthogonal Projection
Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v
Continued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
LINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
16.3 Fredholm Operators
Lectures 16 and 17 16.3 Fredholm Operators A nice way to think about compact operators is to show that set of compact operators is the closure of the set of finite rank operator in operator norm. In this
Mathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
Inner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
Recall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
LS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
Metric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
TOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
Inner product. Definition of inner product
Math 20F Linear Algebra Lecture 25 1 Inner product Review: Definition of inner product. Slide 1 Norm and distance. Orthogonal vectors. Orthogonal complement. Orthogonal basis. Definition of inner product
State of Stress at Point
State of Stress at Point Einstein Notation The basic idea of Einstein notation is that a covector and a vector can form a scalar: This is typically written as an explicit sum: According to this convention,
THE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
1 2 3 1 1 2 x = + x 2 + x 4 1 0 1
(d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which
MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
Lecture 13 Linear quadratic Lyapunov theory
EE363 Winter 28-9 Lecture 13 Linear quadratic Lyapunov theory the Lyapunov equation Lyapunov stability conditions the Lyapunov operator and integral evaluating quadratic integrals analysis of ARE discrete-time
Notes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
9 More on differentiation
Tel Aviv University, 2013 Measure and category 75 9 More on differentiation 9a Finite Taylor expansion............... 75 9b Continuous and nowhere differentiable..... 78 9c Differentiable and nowhere monotone......
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
Mathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
Prime Numbers and Irreducible Polynomials
Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.
The Mean Value Theorem
The Mean Value Theorem THEOREM (The Extreme Value Theorem): If f is continuous on a closed interval [a, b], then f attains an absolute maximum value f(c) and an absolute minimum value f(d) at some numbers
The Convolution Operation
The Convolution Operation Convolution is a very natural mathematical operation which occurs in both discrete and continuous modes of various kinds. We often encounter it in the course of doing other operations
A note on companion matrices
Linear Algebra and its Applications 372 (2003) 325 33 www.elsevier.com/locate/laa A note on companion matrices Miroslav Fiedler Academy of Sciences of the Czech Republic Institute of Computer Science Pod
The Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
NOV - 30211/II. 1. Let f(z) = sin z, z C. Then f(z) : 3. Let the sequence {a n } be given. (A) is bounded in the complex plane
Mathematical Sciences Paper II Time Allowed : 75 Minutes] [Maximum Marks : 100 Note : This Paper contains Fifty (50) multiple choice questions. Each question carries Two () marks. Attempt All questions.
CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXXI, 1 (2012), pp. 71 77 71 CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC E. BALLICO Abstract. Here we study (in positive characteristic) integral curves
4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
ON DEGREE OF APPROXIMATION ON A JORDAN CURVE TO A FUNCTION ANALYTIC INTERIOR TO THE CURVE BY FUNCTIONS NOT NECESSARILY ANALYTIC INTERIOR TO THE CURVE
ON DEGREE OF APPROXIMATION ON A JORDAN CURVE TO A FUNCTION ANALYTIC INTERIOR TO THE CURVE BY FUNCTIONS NOT NECESSARILY ANALYTIC INTERIOR TO THE CURVE J. L. WALSH It is our object here to consider the subject
Polynomial Invariants
Polynomial Invariants Dylan Wilson October 9, 2014 (1) Today we will be interested in the following Question 1.1. What are all the possible polynomials in two variables f(x, y) such that f(x, y) = f(y,
Computing divisors and common multiples of quasi-linear ordinary differential equations
Computing divisors and common multiples of quasi-linear ordinary differential equations Dima Grigoriev CNRS, Mathématiques, Université de Lille Villeneuve d Ascq, 59655, France [email protected]
SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
Zeros of Polynomial Functions
Zeros of Polynomial Functions The Rational Zero Theorem If f (x) = a n x n + a n-1 x n-1 + + a 1 x + a 0 has integer coefficients and p/q (where p/q is reduced) is a rational zero, then p is a factor of
Orthogonal Diagonalization of Symmetric Matrices
MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding
How To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra
54 CHAPTER 5 Product Measures Given two measure spaces, we may construct a natural measure on their Cartesian product; the prototype is the construction of Lebesgue measure on R 2 as the product of Lebesgue
Methods for Finding Bases
Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,
Zeros of Polynomial Functions
Review: Synthetic Division Find (x 2-5x - 5x 3 + x 4 ) (5 + x). Factor Theorem Solve 2x 3-5x 2 + x + 2 =0 given that 2 is a zero of f(x) = 2x 3-5x 2 + x + 2. Zeros of Polynomial Functions Introduction
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
ARBITRAGE-FREE OPTION PRICING MODELS. Denis Bell. University of North Florida
ARBITRAGE-FREE OPTION PRICING MODELS Denis Bell University of North Florida Modelling Stock Prices Example American Express In mathematical finance, it is customary to model a stock price by an (Ito) stochatic
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
CONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation
Chapter 2 CONTROLLABILITY 2 Reachable Set and Controllability Suppose we have a linear system described by the state equation ẋ Ax + Bu (2) x() x Consider the following problem For a given vector x in
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
Math 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
These axioms must hold for all vectors ū, v, and w in V and all scalars c and d.
DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
Short Programs for functions on Curves
Short Programs for functions on Curves Victor S. Miller Exploratory Computer Science IBM, Thomas J. Watson Research Center Yorktown Heights, NY 10598 May 6, 1986 Abstract The problem of deducing a function
Properties of BMO functions whose reciprocals are also BMO
Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and
NONASSOCIATIVE ALGEBRAS SATISFYING IDENTITIES OF DEGREE THREE(i)
NONASSOCIATIVE ALGEBRAS SATISFYING IDENTITIES OF DEGREE THREE(i) BY FRANK ROSIER AND J. MARSHALL OSBORN A number of different authors have studied classes of nonassociative algebras or rings satisfying
a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)
ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)
MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of
I. Pointwise convergence
MATH 40 - NOTES Sequences of functions Pointwise and Uniform Convergence Fall 2005 Previously, we have studied sequences of real numbers. Now we discuss the topic of sequences of real valued functions.
1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: [email protected] Proof: For any element x of the empty set, x is also an element of every set since
P NP for the Reals with various Analytic Functions
P NP for the Reals with various Analytic Functions Mihai Prunescu Abstract We show that non-deterministic machines in the sense of [BSS] defined over wide classes of real analytic structures are more powerful
Matrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
Chapter 5. Banach Spaces
9 Chapter 5 Banach Spaces Many linear equations may be formulated in terms of a suitable linear operator acting on a Banach space. In this chapter, we study Banach spaces and linear operators acting on
RAJALAKSHMI ENGINEERING COLLEGE MA 2161 UNIT I - ORDINARY DIFFERENTIAL EQUATIONS PART A
RAJALAKSHMI ENGINEERING COLLEGE MA 26 UNIT I - ORDINARY DIFFERENTIAL EQUATIONS. Solve (D 2 + D 2)y = 0. 2. Solve (D 2 + 6D + 9)y = 0. PART A 3. Solve (D 4 + 4)x = 0 where D = d dt 4. Find Particular Integral:
March 29, 2011. 171S4.4 Theorems about Zeros of Polynomial Functions
MAT 171 Precalculus Algebra Dr. Claude Moore Cape Fear Community College CHAPTER 4: Polynomial and Rational Functions 4.1 Polynomial Functions and Models 4.2 Graphing Polynomial Functions 4.3 Polynomial
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity
Math 241, Exam 1 Information.
Math 241, Exam 1 Information. 9/24/12, LC 310, 11:15-12:05. Exam 1 will be based on: Sections 12.1-12.5, 14.1-14.3. The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/241fa12/241.html)
You know from calculus that functions play a fundamental role in mathematics.
CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.
PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 005-06-15 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem)
Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem) In order to understand the details of the Fingerprinting Theorem on fingerprints of different texts from Chapter 19 of the
MATH2210 Notebook 1 Fall Semester 2016/2017. 1 MATH2210 Notebook 1 3. 1.1 Solving Systems of Linear Equations... 3
MATH0 Notebook Fall Semester 06/07 prepared by Professor Jenny Baglivo c Copyright 009 07 by Jenny A. Baglivo. All Rights Reserved. Contents MATH0 Notebook 3. Solving Systems of Linear Equations........................
9 Multiplication of Vectors: The Scalar or Dot Product
Arkansas Tech University MATH 934: Calculus III Dr. Marcel B Finan 9 Multiplication of Vectors: The Scalar or Dot Product Up to this point we have defined what vectors are and discussed basic notation
8.1 Examples, definitions, and basic properties
8 De Rham cohomology Last updated: May 21, 211. 8.1 Examples, definitions, and basic properties A k-form ω Ω k (M) is closed if dω =. It is exact if there is a (k 1)-form σ Ω k 1 (M) such that dσ = ω.
Practice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
Lecture 13: Martingales
Lecture 13: Martingales 1. Definition of a Martingale 1.1 Filtrations 1.2 Definition of a martingale and its basic properties 1.3 Sums of independent random variables and related models 1.4 Products of
POLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS
POLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS N. ROBIDOUX Abstract. We show that, given a histogram with n bins possibly non-contiguous or consisting
NOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
RESULTANT AND DISCRIMINANT OF POLYNOMIALS
RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results
Zeros of a Polynomial Function
Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we
HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
( ) which must be a vector
MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are
Taylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
Absolute Value Equations and Inequalities
Key Concepts: Compound Inequalities Absolute Value Equations and Inequalities Intersections and unions Suppose that A and B are two sets of numbers. The intersection of A and B is the set of all numbers
God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)
Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work
On the representability of the bi-uniform matroid
On the representability of the bi-uniform matroid Simeon Ball, Carles Padró, Zsuzsa Weiner and Chaoping Xing August 3, 2012 Abstract Every bi-uniform matroid is representable over all sufficiently large
A power series about x = a is the series of the form
POWER SERIES AND THE USES OF POWER SERIES Elizabeth Wood Now we are finally going to start working with a topic that uses all of the information from the previous topics. The topic that we are going to
Systems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
DATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 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
Application of Fourier Transform to PDE (I) Fourier Sine Transform (application to PDEs defined on a semi-infinite domain)
Application of Fourier Transform to PDE (I) Fourier Sine Transform (application to PDEs defined on a semi-infinite domain) The Fourier Sine Transform pair are F. T. : U = 2/ u x sin x dx, denoted as U
4.3 Lagrange Approximation
206 CHAP. 4 INTERPOLATION AND POLYNOMIAL APPROXIMATION Lagrange Polynomial Approximation 4.3 Lagrange Approximation Interpolation means to estimate a missing function value by taking a weighted average
MATH PROBLEMS, WITH SOLUTIONS
MATH PROBLEMS, WITH SOLUTIONS OVIDIU MUNTEANU These are free online notes that I wrote to assist students that wish to test their math skills with some problems that go beyond the usual curriculum. These
