DOCSLIB.ORG

Vector Spaces of Functions

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Vector Spaces of Functions Part 2 Vector spaces of functions part:vector-spaces The main goal for this part of the course is to establish a framework where we can treat functions in the same way that we treated vectors in the multivariable course. To do this, we first introduce the idea of a vector space, a generalization of the Euclidean space Rn. While there are many interesting examples of vector spaces, we focus primarily on collections of functions. We show how many features of the Euclidean space Rn can be generalized to these other vector spaces. CHAPTER 5 Introduction to vector spaces 5.1. Vector spaces From our multivariable calculus course, we know many things we can do with vectors. The most basic properties of vectors in Euclidean space is that they can be scaled and can be added. This motivates the following definition. A collection V DefineRealVectorSpace of mathematical objects is called a real vector space if (1) for any two items v1 and v2 in V the sum v1 + v2 is also in V, (2) for any item v in V and real number ↵ the rescaled item ↵v is also in V, and if all the “usual rules” (associativity, commutativity, distributive property, etc.) hold true; see Exercise 5.1. Here are some examples. E 5.1. The collection of vectors in Rn forms a real vector space. E 5.2. The collection of all polynomials p(x) such that p(1) = 0 forms a vector space. To see this, notice that if p1 and p2 are such polynomials, then p(x) = p1(x)+p2(x) is also a polynomial such that p(1) = 0. Similarly, if p(1) = 0, then any multiple of p is also a polynomial having that property. E 5.3. The collection of all continuous functions R R forms a vector ! space that is denoted C0(R). E 5.4. The collection of all functions R R with continuous derivative ! forms a vector space that is denoted C1(R). VS:ode-solutions E 5.5. The collection of solutions u(t) to the differential equation d2u + 17u = 0 dt2 form a vector space. (In differential equations course, the fact that the space of solutions is a vector space is as the linearity principle or the principle of superpo- sition.) 33 5.1. VECTOR SPACES 34 define-l2 2 E 5.6. The collection of sequences ak such that the sum 1k=1(ak ) con- verges is a vector space, and is given the l2(N). P 2 To verify that it is a vector space, we need to verify that if ak and bk are in l (N) and ↵ is a real number, then the sums 1 2 1 2 (↵ak ) and (ak + bk ) Xk=1 Xk=1 converge. To see this, we consider the Nth partial sums, noting that N N 2 2 2 (↵ak ) ↵ (ak ) Xk=1 Xk=1 N N N 2 2 2 (ak + bk ) 2 (ak ) + 2 (bk ) . Xk=1 Xk=1 Xk=1 2 The desired convergences now follows from the fact that ak and bk are in l (N). We remark that one may also consider sequences ak where the index k rangers over all integers. The corresponding vector space is denoted l2(Z). L2-Interval-VectorSpace E 5.7. The collection of functions u:[ 1, 1] R such that − ! 1 u(x) 2dx < (5.1) L2IntervalCondition 1 | | 1 Z− is a vector space. This vector space is given the symbol L2([ 1, 1]); see Exercise 5.3. − Notice that u(x) does not need to be continuous – for example the following function is in L2([ 1, 1]): − 1/4 x− if > 0, u(x) = >80 if x 0. <> > : These examples show that the concept of a vector space is very general; indeed in linear algebra class one learns many tools for studying general vector spaces. We make these remarks: Example 5.5 is a hint that the concept of a vector space is very useful for • studying differential equations. We sometimes refer to the objects in a vector space V as “vectors”, even • when they are other types of mathematical gadgets. The numbers ↵ are sometimes called “scalars” as they serve to rescale the vectors in V. 5.2. SUBSPACES 35 We use the convention that vectors (and vector-valued functions) in Rn • are typeset in boldface. However, vectors in other vector spaces are not distinguished in any way. Pay close attention to contextual clues in order to determine which objects are being considered as vectors. Sometimes it is convenient to use complex numbers for scalars; in this • case we say that V is a complex vector space. It is also useful to consider some examples of collections of objects that are not vector spaces. E 5.8. The collection of unit vectors (i.e. vectors of magnitude 1) in Rn is not a vector space. This is straightforward to see: If two vectors each have magnitude 1, then their sum will (almost always) not have magnitude 1. Furthermore, if we rescale a unit vector, then it is no longer unit! E 5.9. The collection of polynomials p(x) such that p(1) = 2 is not a vector space. If polynomials p1(x) and p2(x) have this property, then their sum is a polynomial, but will not have the desired property. E 5.10. The collection of solutions u(t) to the differential equation d2u + 17u = cos t dt2 does not form a vector space. (Recall from differential equations class that inho- mogeneous equations satisfy a somewhat more complicated version of the super- position principle.) 5.2. Subspaces Suppose that v1,...,vk are elements of some vector space V. For any scalars ↵1,...,↵k , the quantity ↵ v + + ↵k vk 1 1 ··· is called a linear combination of the objects v1,...,vk . The collection of all possible linear combinations is called the span of the vectors, and is denoted span v ,...,vk . { 1 } 2 E 5.11. The span of the polynomials p0(x) = 1, p1(x) = x, and p2(x) = x is the collection of all polynomials of degree less than or equal to 2. 5.2. SUBSPACES 36 An important fact is that is that the span of any collection of vectors is itself a vector space. Since all of the vectors in this vector space are also in the vector space V, we say that span v ,...,vk is a “subspace” of V. { 1 } It is important that the phrase “linear combination” only refers to finite sums! Here are two examples. E 5.12. Consider the vectors v = 1, 1, 1 and v = 1, 0, 1 in the vector 1 h i 2 h − i space R3. The subspace span v , v is a plane in R3; the equation of the plane is { 1 2} x 2y + z = 0. − VS:poly-degree-three E 5.13. The collection of polynomials of degree less than 4 is span 1, x, x2, x3 , { } a subspace of the vector space of polynomials. More generally, we say that a vector space W is a subspace of vector space V if W is a vector space, and • all objects in W are also in V. • E 5.14. The collection of all functions u(x) such that u(0) = 0 is a subspace of C0(R). The following is a very important example. E 5.15. A function u:[ 1, 1] R is said to be piecewise continuous if − ! u is continuous, except at a finite number of points in [ 1, 1]. Furthermore, the − function is required to be bounded. The collection of piecewise continuous functions u:[ 1, 1] R such that the − ! integral (5.1) is finite forms a subspace of L2([ 1, 1]). We denote this subspace by − L2 ([ 1, 1]). PC − An example of a piecewise continuous function is the following: 1 if x 0, u(x) = ≥ >8 1 if x < 0. <>− > The function u(x) defined in Example: 5.7 is not an example of a piecewise contin- uous function, because it is not bounded. A type of subspace that is important in this class is a subspace defined by imposing a boundary condition. The following example appears repeatedly in this class. 5.3. FINITE AND INFINITE DIMENSIONAL VECTOR SPACES 37 ex:PeriodicTrig E 5.16 (P ). A function u:[ 1, 1] R is − ! said to satisfy periodic boundary conditions if u( 1) = u(1) and u0( 1) = u0(1). − − The reason that these conditions are called “periodic” is that any function satisfying these conditions can be periodically extended to a larger domain in such a way that both the function, and its first derivative, are continuous. Functions that satisfy periodic boundary conditions and also satisfy the condition (5.1) form a subspace of L2 ([ 1, 1]). We explore this subspace via the following PC − activities. (1) Show that the function f (x) = x3 x satisfies periodic boundary condi- − tions. Draw a sketch of the graph of f on the interval [ 1, 1]. Then extend − the graph to a larger domain by periodic repeating. Plot the periodic extension of f 0(x) on this extended domain. (2) For what values of ! does the function sin(!x) satisfy the periodic bound- ary condition? (3) For what values of ! does the function cos(!x) satisfy the periodic boundary condition? Two other boundary conditions – the Dirichlet and Neumann conditions – are explored in the exercises. 5.3. Finite and infinite dimensional vector spaces Consider the vector space of all polynomials, and let W = span 1, x, x2, x3 be the { } subspace from Example 5.13.
Load more

Recommended publications
  • Construction of Determinantal Representation of Trigonometric Polynomials ∗ Mao-Ting Chien A, ,1, Hiroshi Nakazato B
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Linear Algebra and its Applications 435 (2011) 1277–1284 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Construction of determinantal representation of trigonometric polynomials ∗ Mao-Ting Chien a, ,1, Hiroshi Nakazato b a Department of Mathematics, Soochow University, Taipei 11102, Taiwan b Department of Mathematical Sciences, Faculty of Science and Technology, Hirosaki University, Hirosaki 036-8561, Japan ARTICLE INFO ABSTRACT Article history: For a pair of n × n Hermitian matrices H and K, a real ternary homo- Received 6 December 2010 geneous polynomial defined by F(t, x, y) = det(tIn + xH + yK) is Accepted 10 March 2011 hyperbolic with respect to (1, 0, 0). The Fiedler conjecture (or Lax Available online 2 April 2011 conjecture) is recently affirmed, namely, for any real ternary hyper- SubmittedbyR.A.Brualdi bolic polynomial F(t, x, y), there exist real symmetric matrices S1 and S such that F(t, x, y) = det(tI + xS + yS ).Inthispaper,we AMS classification: 2 n 1 2 42A05 give a constructive proof of the existence of symmetric matrices for 14Q05 the ternary forms associated with trigonometric polynomials. 15A60 © 2011 Elsevier Inc. All rights reserved. Keywords: Hyperbolic polynomial Bezoutian matrix Trigonometric polynomial Numerical range 1. Introduction Let p(x) = p(x1, x2,...,xm) be a real homogeneous polynomial of degree n. The polynomial p(x) is called hyperbolic with respect to a real vector e = (e1, e2,...,em) if p(e) = 0, and for all vectors w ∈ Rm linearly independent of e, the univariate polynomial t → p(w − te) has all real roots.
    [Show full text]
  • 7: Inner Products, Fourier Series, Convolution
    7: FOURIER SERIES STEVEN HEILMAN Contents 1. Review 1 2. Introduction 1 3. Periodic Functions 2 4. Inner Products on Periodic Functions 3 5. Trigonometric Polynomials 5 6. Periodic Convolutions 7 7. Fourier Inversion and Plancherel Theorems 10 8. Appendix: Notation 13 1. Review Exercise 1.1. Let (X; h·; ·i) be a (real or complex) inner product space. Define k·k : X ! [0; 1) by kxk := phx; xi. Then (X; k·k) is a normed linear space. Consequently, if we define d: X × X ! [0; 1) by d(x; y) := ph(x − y); (x − y)i, then (X; d) is a metric space. Exercise 1.2 (Cauchy-Schwarz Inequality). Let (X; h·; ·i) be a complex inner product space. Let x; y 2 X. Then jhx; yij ≤ hx; xi1=2hy; yi1=2: Exercise 1.3. Let (X; h·; ·i) be a complex inner product space. Let x; y 2 X. As usual, let kxk := phx; xi. Prove Pythagoras's theorem: if hx; yi = 0, then kx + yk2 = kxk2 + kyk2. 1 Theorem 1.4 (Weierstrass M-test). Let (X; d) be a metric space and let (fj)j=1 be a sequence of bounded real-valued continuous functions on X such that the series (of real num- P1 P1 bers) j=1 kfjk1 is absolutely convergent. Then the series j=1 fj converges uniformly to some continuous function f : X ! R. 2. Introduction A general problem in analysis is to approximate a general function by a series that is relatively easy to describe. With the Weierstrass Approximation theorem, we saw that it is possible to achieve this goal by approximating compactly supported continuous functions by polynomials.
    [Show full text]
  • A Corrective View of Neural Networks: Representation, Memorization and Learning
    Proceedings of Machine Learning Research vol 125:1{54, 2020 33rd Annual Conference on Learning Theory A Corrective View of Neural Networks: Representation, Memorization and Learning Guy Bresler [email protected] Department of EECS, MIT Cambridge, MA, USA. Dheeraj Nagaraj [email protected] Department of EECS, MIT Cambridge, MA, USA. Editors: Jacob Abernethy and Shivani Agarwal Abstract We develop a corrective mechanism for neural network approximation: the total avail- able non-linear units are divided into multiple groups and the first group approx- imates the function under consideration, the second approximates the error in ap- proximation produced by the first group and corrects it, the third group approxi- mates the error produced by the first and second groups together and so on. This technique yields several new representation and learning results for neural networks: 1. Two-layer neural networks in the random features regime (RF) can memorize arbi- Rd ~ n trary labels for n arbitrary points in with O( θ4 ) ReLUs, where θ is the minimum distance between two different points. This bound can be shown to be optimal in n up to logarithmic factors. 2. Two-layer neural networks with ReLUs and smoothed ReLUs can represent functions with an error of at most with O(C(a; d)−1=(a+1)) units for a 2 N [ f0g when the function has Θ(ad) bounded derivatives. In certain cases d can be replaced with effective dimension q d. Our results indicate that neural networks with only a single nonlinear layer are surprisingly powerful with regards to representation, and show that in contrast to what is suggested in recent work, depth is not needed in order to represent highly smooth functions.
    [Show full text]
  • Trigonometric Interpolation and Quadrature in Perturbed Points∗
    SIAM J. NUMER.ANAL. c 2017 Society for Industrial and Applied Mathematics Vol. 55, No. 5, pp. 2113{2122 TRIGONOMETRIC INTERPOLATION AND QUADRATURE IN PERTURBED POINTS∗ ANTHONY P. AUSTINy AND LLOYD N. TREFETHENz Abstract. The trigonometric interpolants to a periodic function f in equispaced points converge if f is Dini-continuous, and the associated quadrature formula, the trapezoidal rule, converges if f is continuous. What if the points are perturbed? With equispaced grid spacing h, let each point be perturbed by an arbitrary amount ≤ αh, where α 2 [0; 1=2) is a fixed constant. The Kadec 1/4 theorem of sampling theory suggests there may be trouble for α ≥ 1=4. We show that convergence of both the interpolants and the quadrature estimates is guaranteed for all α < 1=2 if f is twice continuously differentiable, with the convergence rate depending on the smoothness of f. More precisely, it is enough for f to have 4α derivatives in a certain sense, and we conjecture that 2α derivatives are enough. Connections with the Fej´er{Kalm´artheorem are discussed. Key words. trigonometric interpolation, quadrature, Lebesgue constant, Kadec 1/4 theorem, Fej´er–Kalm´artheorem, sampling theory AMS subject classifications. 42A15, 65D32, 94A20 DOI. 10.1137/16M1107760 1. Introduction and summary of results. The basic question of robustness of mathematical algorithms is \What happens if the data are perturbed?" Yet little literature exists on the effect on interpolants, or on quadratures, of perturbing the interpolation points. The questions addressed in this paper arise in two almost equivalent settings: in- terpolation by algebraic polynomials (e.g., in Gauss or Chebyshev points) and periodic interpolation by trigonometric polynomials (e.g., in equispaced points).
    [Show full text]
  • Smooth Bumps, a Borel Theorem and Partitions of Smooth Functions on P.C.F. Fractals
    SMOOTH BUMPS, A BOREL THEOREM AND PARTITIONS OF SMOOTH FUNCTIONS ON P.C.F. FRACTALS. LUKE G. ROGERS, ROBERT S. STRICHARTZ, AND ALEXANDER TEPLYAEV Abstract. We provide two methods for constructing smooth bump functions and for smoothly cutting off smooth functions on fractals, one using a prob- abilistic approach and sub-Gaussian estimates for the heat operator, and the other using the analytic theory for p.c.f. fractals and a fixed point argument. The heat semigroup (probabilistic) method is applicable to a more general class of metric measure spaces with Laplacian, including certain infinitely ramified fractals, however the cut off technique involves some loss in smoothness. From the analytic approach we establish a Borel theorem for p.c.f. fractals, showing that to any prescribed jet at a junction point there is a smooth function with that jet. As a consequence we prove that on p.c.f. fractals smooth functions may be cut off with no loss of smoothness, and thus can be smoothly decom- posed subordinate to an open cover. The latter result provides a replacement for classical partition of unity arguments in the p.c.f. fractal setting. 1. Introduction Recent years have seen considerable developments in the theory of analysis on certain fractal sets from both probabilistic and analytic viewpoints [1, 14, 26]. In this theory, either a Dirichlet energy form or a diffusion on the fractal is used to construct a weak Laplacian with respect to an appropriate measure, and thereby to define smooth functions. As a result the Laplacian eigenfunctions are well un- derstood, but we have little knowledge of other basic smooth functions except in the case where the fractal is the Sierpinski Gasket [19, 5, 20].
    [Show full text]
  • Extremal Positive Trigonometric Polynomials Dimitar K
    APPROXIMATION THEORY: A volume dedicated to Blagovest Sendov 2002, 1-24 Extremal Positive Trigonometric Polynomials Dimitar K. Dimitrov ∗ In this paper we review various results about nonnegative trigono- metric polynomials. The emphasis is on their applications in Fourier Series, Approximation Theory, Function Theory and Number The- ory. 1. Introduction There are various reasons for the interest in the problem of constructing nonnegative trigonometric polynomials. Among them are: Ces`aromeans and Gibbs’ phenomenon of the the Fourier series, approximation theory, univalent functions and polynomials, positive Jacobi polynomial sums, or- thogonal polynomials on the unit circle, zero-free regions for the Riemann zeta-function, just to mention a few. In this paper we summarize some of the recent results on nonnegative trigonometric polynomials. Needless to say, we shall not be able to cover all the results and applications. Because of that this short review represents our personal taste. We restrict ourselves to the results and problems we find interesting and challenging. One of the earliest examples of nonnegative trigonometric series is the Poisson kernel ∞ X 1 − ρ2 1 + 2 ρk cos kθ = , −1 < ρ < 1, (1.1) 1 − 2ρ cos θ + ρ2 k=1 which, as it was pointed out by Askey and Gasper [8], was also found but not published by Gauss [30]. The problem of constructing nonnegative trigonometric polynomials was inspired by the development of the theory ∗Research supported by the Brazilian science foundation FAPESP under Grant No. 97/06280-0 and CNPq under Grant No. 300645/95-3 2 Positive Trigonometric Polynomials of Fourier series and by the efforts for giving a simple proof of the Prime Number Theorem.
    [Show full text]
  • Stepanov and Weyl Almost Periodic Functions on Locally Compact
    STEPANOV AND WEYL ALMOST PERIODICITY IN LOCALLY COMPACT ABELIAN GROUPS TIMO SPINDELER Abstract. We study Stepanov and Weyl almost periodic functions on locally compact Abelian groups, which naturally appear in the theory of aperiodic order. 1. Introduction Almost periodic functions are natural generalisations of periodic functions, and they ap- pear in many different areas of mathematics. They are well studied objects on the real line because they are used in boundary value problems for differential equations [13]. A system- atic treatment of these functions can be found in [5]. Also, there is a well established theory for Bohr almost periodic functions and weakly almost periodic functions on locally compact Abelian groups [6, 8]. Bohr almost periodic functions turned out to be an important tool in harmonic analysis. Firstly, they are used to study finite-dimensional representations of locally compact Abelian groups [7, Ch. 16.2]. Secondly, they describe those autocorrelations which give rise to a pure point diffraction measure; more on that below. However, recent progress in the study of aperiodic order and dynamical systems [10, 11, 18] makes it clear that we also need to aim at a better understanding of Stepanov and Weyl almost periodic functions on locally compact Abelian groups. Let us be more precise. Meyer sets and cut and project sets are important tools in the study of aperiodic order, since they are used to model quasicrystals. If µ denotes a translation bounded measure (e.g. the Dirac comb of a Meyer set), then the diffraction measure γµ, which −1 is the Fourier transform of the autocorrelation γµ := limn An (µ A µ A ), indicates →∞ | | | n ∗ | n how (dis)ordered the system that µ models is [1]; note that (An)n∈N is a suitable averagingc sequence.
    [Show full text]
  • Robinson Showed That It Is Possible to Rep- Resent Each Schwartz Distribution T As an Integral T(4) = Sf4, Where F Is Some Nonstandard Smooth Function
    Indag. Mathem., N.S., 11 (1) 129-138 March 30,200O Constructive nonstandard representations of generalized functions by Erik Palmgren* Department of Mathematics,Vppsala University, P. 0. Box 480, S-75106 Uppa& &v&n, e-mail:[email protected] Communicated by Prof. A.S. Troelstra at the meeting of May 31, 1999 ABSTRACT Using techniques of nonstandard analysis Abraham Robinson showed that it is possible to rep- resent each Schwartz distribution T as an integral T(4) = sf4, where f is some nonstandard smooth function. We show that the theory based on this representation can be developed within a constructive setting. I. INTRODUCTION Robinson (1966) demonstrated that Schwartz’ theory of distributions could be given a natural formulation using techniques of nonstandard analysis, so that distributions become certain nonstandard smooth functions. In particular, Dirac’s delta-function may then be taken to be the rational function where E is a positive infinitesimal. As is wellknown, classical nonstandard analysis is based on strongly nonconstructive assumptions. In this paper we present a constructive version of Robinson’s theory using the framework of constructive nonstandard analysis developed in Palmgren (1997, 1998), which was based on Moerdijk’s (1995) sheaf-theoretic nonstandard models. The main *The author gratefully acknowledges support from the Swedish Research Council for Natural Sciences (NFR). 129 points of the present paper are the elimination of the standard part map from Robinson’s theory and a constructive proof of the representation of distribu- tions as nonstandard smooth functions (Theorem 2.6). We note that Schmieden and Laugwitz already in 1958 introduced their ver- sion of nonstandard analysis to give an interpretation of generalized functions which are closer to those of the Mikusinski-Sikorski calculus.
    [Show full text]
  • Delta Functions and Distributions
    When functions have no value(s): Delta functions and distributions Steven G. Johnson, MIT course 18.303 notes Created October 2010, updated March 8, 2017. Abstract x = 0. That is, one would like the function δ(x) = 0 for all x 6= 0, but with R δ(x)dx = 1 for any in- These notes give a brief introduction to the mo- tegration region that includes x = 0; this concept tivations, concepts, and properties of distributions, is called a “Dirac delta function” or simply a “delta which generalize the notion of functions f(x) to al- function.” δ(x) is usually the simplest right-hand- low derivatives of discontinuities, “delta” functions, side for which to solve differential equations, yielding and other nice things. This generalization is in- a Green’s function. It is also the simplest way to creasingly important the more you work with linear consider physical effects that are concentrated within PDEs, as we do in 18.303. For example, Green’s func- very small volumes or times, for which you don’t ac- tions are extremely cumbersome if one does not al- tually want to worry about the microscopic details low delta functions. Moreover, solving PDEs with in this volume—for example, think of the concepts of functions that are not classically differentiable is of a “point charge,” a “point mass,” a force plucking a great practical importance (e.g. a plucked string with string at “one point,” a “kick” that “suddenly” imparts a triangle shape is not twice differentiable, making some momentum to an object, and so on.
    [Show full text]
  • Numerical Methods I Trigonometric Polynomials and the FFT
    Numerical Methods I Trigonometric Polynomials and the FFT Aleksandar Donev Courant Institute, NYU1 [email protected] 1MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 Nov 13th, 2014 A. Donev (Courant Institute) Lecture X 11/2014 1 / 41 Outline 1 Trigonometric Orthogonal Polynomials 2 Fast Fourier Transform 3 Applications of FFT 4 Wavelets 5 Conclusions A. Donev (Courant Institute) Lecture X 11/2014 2 / 41 Trigonometric Orthogonal Polynomials Periodic Functions Consider now interpolating / approximating periodic functions defined on the interval I = [0; 2π]: 8x f (x + 2π) = f (x); as appear in practice when analyzing signals (e.g., sound/image processing). Also consider only the space of complex-valued square-integrable 2 functions L2π, Z 2π 2 2 2 8f 2 Lw :(f ; f ) = kf k = jf (x)j dx < 1: 0 Polynomial functions are not periodic and thus basis sets based on orthogonal polynomials are not appropriate. Instead, consider sines and cosines as a basis function, combined together into complex exponential functions ikx φk (x) = e = cos(kx) + i sin(kx); k = 0; ±1; ±2;::: A. Donev (Courant Institute) Lecture X 11/2014 3 / 41 Trigonometric Orthogonal Polynomials Fourier Basis ikx φk (x) = e ; k = 0; ±1; ±2;::: It is easy to see that these are orhogonal with respect to the continuous dot product Z 2π Z 2π ? (φj ; φk ) = φj (x)φk (x)dx = exp [i(j − k)x] dx = 2πδij x=0 0 The complex exponentials can be shown to form a complete 2 trigonometric polynomial basis for the space L2π, i.e., 1 2 X ^ ikx 8f 2 L2π : f (x) = fk e ; k=−∞ where the Fourier coefficients can be computed for any frequency or wavenumber k using: Z 2π (f ; φk ) 1 −ikx f^k = = : f (x)e dx: 2π 2π 0 A.
    [Show full text]
  • [Math.FA] 1 Apr 1998 E Words Key 1991 Abstract *)Tersac Fscn N H Hr Uhrhsbe Part Been Has Author 93-0452
    RENORMINGS OF Lp(Lq) by R. Deville∗, R. Gonzalo∗∗ and J. A. Jaramillo∗∗ (*) Laboratoire de Math´ematiques, Universit´eBordeaux I, 351, cours de la Lib´eration, 33400 Talence, FRANCE. email : [email protected] (**) Departamento de An´alisis Matem´atico, Universidad Complutense de Madrid, 28040 Madrid, SPAIN. email : [email protected] and [email protected] Abstract : We investigate the best order of smoothness of Lp(Lq). We prove in particular ∞ that there exists a C -smooth bump function on Lp(Lq) if and only if p and q are even integers and p is a multiple of q. arXiv:math/9804002v1 [math.FA] 1 Apr 1998 1991 Mathematics Subject Classification : 46B03, 46B20, 46B25, 46B30. Key words : Higher order smoothness, Renormings, Geometry of Banach spaces, Lp spaces. (**) The research of second and the third author has been partially supported by DGICYT grant PB 93-0452. 1 Introduction The first results on high order differentiability of the norm in a Banach space were given by Kurzweil [10] in 1954, and Bonic and Frampton [2] in 1965. In [2] the best order of differentiability of an equivalent norm on classical Lp-spaces, 1 < p < ∞, is given. The best order of smoothness of equivalent norms and of bump functions in Orlicz spaces has been investigated by Maleev and Troyanski (see [13]). The work of Leonard and Sundaresan [11] contains a systematic investigation of the high order differentiability of the norm function in the Lebesgue-Bochner function spaces Lp(X). Their results relate the continuously n-times differentiability of the norm on X and of the norm on Lp(X).
    [Show full text]
  • FOURIER ANALYSIS 1. the Best Approximation Onto Trigonometric
    FOURIER ANALYSIS ERIK LØW AND RAGNAR WINTHER 1. The best approximation onto trigonometric polynomials Before we start the discussion of Fourier series we will review some basic results on inner–product spaces and orthogonal projections mostly presented in Section 4.6 of [1]. 1.1. Inner–product spaces. Let V be an inner–product space. As usual we let u, v denote the inner–product of u and v. The corre- sponding normh isi given by v = v, v . k k h i A basic relation between the inner–productp and the norm in an inner– product space is the Cauchy–Scwarz inequality. It simply states that the absolute value of the inner–product of u and v is bounded by the product of the corresponding norms, i.e. (1.1) u, v u v . |h i|≤k kk k An outline of a proof of this fundamental inequality, when V = Rn and is the standard Eucledian norm, is given in Exercise 24 of Section 2.7k·k of [1]. We will give a proof in the general case at the end of this section. Let W be an n dimensional subspace of V and let P : V W be the corresponding projection operator, i.e. if v V then w∗ =7→P v W is the element in W which is closest to v. In other∈ words, ∈ v w∗ v w for all w W. k − k≤k − k ∈ It follows from Theorem 12 of Chapter 4 of [1] that w∗ is characterized by the conditions (1.2) v P v, w = v w∗, w =0 forall w W.
    [Show full text]