Almost Everywhere Convex Functions in Generalized Sobolev Spaces
|
|
- Merilyn Ethel Holmes
- 7 years ago
- Views:
Transcription
1 International Journal of Mathematical Analysis Vol. 9, 2015, no. 42, HIKARI Ltd, Almost Everywhere Convex Functions in Generalized Sobolev Spaces Matloob Anwar and Hina Urooj School of Natural Sciences National University of Sciences and Technology Islamabad, Pakistan Copyright c 2015 Matloob Anwar and Hina Urooj. This article is distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract In this paper we characterize almost every where convex functions using generalized Sobolev space W 1,p(x) () under some condition imposed on the generalized weak gradient. We assume in this paper that the variable exponent p(x) is bounded on, an open convex subset of R n. Keywords: Sobolev Spaces, Generalized Sobolev Spaces, mollification 1. Introduction Lebesgue and Sobolev spaces are most important spaces in mathematical analysis and these spaces have several interesting properties. We refer [2] and [4] for the basic theory of the variable exponent Lebesgue and Sobolev spaces, but give the main definitions for the reader s convenience. Let p(x) be a measurable function on R n with values in [1, ). Denote p + = ess sup p(x) x and p = ess inf p(x) x The generalized Lebesgue space L p(x) () is the space of all measurable functions f : R such that I p (f) :=. f(x) p(x) dx <. With respect to the norm given below this is a Banach space:
2 2054 Matloob Anwar and Hina Urooj f L p(x) = inf{λ > 0 : I p (f/λ) 1}. We say that is compactly contained in denoted as if there exists a compact set K such that K. L p(x) () is the space of functions f such that f L p(x) ( ) for all. The generalized Sobolev space W 1,p(x) () is the space of functions in L p(x) () whose generalized weak gradient f exists and lies in L p(x) (), with the norm f W 1,p(x) = f L p(x) + f L p(x). The space W 1,p(x) () is defined in the same manner as L p(x) (). La Torre [5] has proved the inclusion of convex functions in the usual Sobolev space W 1,p () for all p 1, he also proved the converse for a.e.convex functions; see ref. [1] for the basic theory in the usual Sobolev space. This paper investigates the results in [5] for generalized Sobolev space W 1,p(x) (). 2. Main Results We assume, throughout the paper, that the variable exponent p(x) is bounded that is p + <. is an open convex subset in R n. Definition 2.1. A function defined on f : R is said to be ally Lipschitz if for each x 0 there exists a neibourhood B(x 0, r) of x 0 and a positive constant C such that f(y) f(x) C y x for all y, x B(x 0, r). C is called a Lipschitz constant, which will vary with x 0. Definition 2.2. A function f on is said to be ally bounded if for each x 0, there exists a neighbourhood U of x 0 and a positive constant M such that f(x) M for all x U. Lemma 2.3. Let f : R be a ally Lipschitz function then each of its partial derivatives, if exists, is ally bounded. Proof. For x 0, let B(x 0, r) be a neighbourhood of x 0. For x in B(x 0, r), choose h > 0 and the unit vectors e i = (0, 0,.., 1,..0, 0, 0) (1 at the i th position, i = 1,,,, n ) in the direction of each coordinate axes, such that x + he i B(x 0, r). We can choose such h for each x: for instance, h with h < dist(x, B(x 0, r)) will work. Given f is ally Lipschitz with Lipschitz constant say C, we have f(x + he i ) f(x) C h for all x B(x 0, r). Dividing by h and applying limit h 0, lim f(x + he i) f(x)/h C for all x B(x 0, r). h 0
3 Almost everywhere convex functions 2055 Using continuity of modulus function and definition of partial derivative, we finally have f(x) C for all x B(x 0, r). Theorem 2.4. Let the function f : R be a ally Lipschitz. Then f (). W 1,p(x) Proof. Since the given function f is a ally Lipschitz function, by Rademacher s theorem f is almost everywhere differentiable and hence the gradient f exists a.e in. The Lipschitz continuity of f also assures the al boundedness of f and f(x). Considering al boundedness of f, we have for every open set U there exists a constant m U such that f(x) m U for all x U, and hence we have I p (f) = U f(t) p(t) dt U (m U ) p(x) dx max{m p U, mp+ U }µ(u) <. Thus f L p(x) f(x) () and on applying the same argument as above on, we conclude that f(x) L p(x) (). Next we shall show that the classical ith partial derivative of f is indeed the weak i th partial derivative of f. For an arbitrary ϕ C0 () and h sufficiently small we have f(x + he i ) f(x) φ(x)dx = h φ(x) φ(x he i ) f(x)dx. h Above integrals are defined since the product of a function in L p(x) () with a function in C0 () is an integrable function. Applying limit h 0 and using the Lebesgue convergence theorem for integrable functions, we have f φ(x)dx = Since φ was arbitrary we have our desired result. φ f(x)dx. Remark 2.5. Since convex functions on an open set are ally Lipschitz, above theorem also holds for convex functions. Theorem 2.6. Let f : R be a function in W 1,p(x) () satisfies f(y) f(x) < f(x), y x > almost everywhere y, x then < y x, f(y) f(x) > 0 almost everywhere y, x. f denotes the weak gradient of f. Proof. The proof follows by adding the given inequality with the inequality obtained from it by interchanging x and y.
4 2056 Matloob Anwar and Hina Urooj Theorem 2.7. [6] Let the function f : R be a Gâteaux differentiable. Then f is convex iff < f(x) f(y), x y > 0 for all x, y. Theorem 2.8. [6] Suppose f is Gâteaux differentiable function on then f is convex if and only if f(x) f(y) < f(y), x y > holds for all x, y. Definition 2.9. The function { Ce ( x 2 1) 1 if x < 1, φ(x) = 0 if x 1 belongs to C 0 (R n ) for any constant C, which can be chosen such that R n φ(x)dx = 1. For any ɛ > 0, the function φ(x) generates a sequence of smooth functions φ ε on R n called the standard sequence of mollifiers, defined as φ ε (x) = 1 φ ( ) x ε n ε, satisfying φ ε (x)dx = 1 and having compact support B(0, ε). R n Definition Let f L 1 (), its mollification f ɛ : ɛ R is defined using the following convolution as f ɛ (x) = (φ ε f)(x) = φ(x t)f(t)dt, where ɛ = {x : dist(x, ) > ɛ}, that is for x ɛ, B(x, ɛ) and for each x, y in B(x, ɛ), the vector x y lies in B(0, ɛ). Theorem Let the function f : R belongs to W 1,p(x) () and satisfies < y x, f(y) f(x) > 0 for a.e. y, x. Then for any compact set K in there exists ɛ 0 > 0 such that the mollifications f ɛ are convex for all ɛ such that 0 < ɛ < ɛ 0. Proof. Let K be a compact set in then we can find some ɛ 0 > 0 such that K ɛ0. This can be done by choosing ɛ 0 such that ɛ 0 < min{dist(x, )}. x K Also it follows from the definition of ɛ that ɛ0 ɛ for 0 < ɛ < ɛ 0 and hence for such ɛ, K ɛ. We have for all x, y K and ɛ (0, ɛ 0 ) : n ( fε < x y, f ɛ (x) f ɛ (y) >= (x i y i ) (x) f ) ε (y) = = n (x i y i ) n (x i y i ) 1 ε n (φ ε (x z) φ ε (y z)) f (z)dz ( ) ( x z y z φ f(z)dz φ ε ε ) f(z)dz
5 = n (x i y i ) = B(0,1) Almost everywhere convex functions 2057 B(0,1) ( f φ(s) (x εs) f ) (y εs) ds φ(s) < x y, f(x) f(y) > ds 0. Hence f ɛ are convex on K, follows from Theorem 2.7. Corollary If f satisfies f(y) f(x) < f(x), y x > almost everywhere y, x and is continuous then f is convex. Corollary Let the function f : R belongs to W 1,p(x) () and satisfies < x y, f(x) f(y) > 0 almost everywhere in. Then f satisfies f(x) f(y) < f(y), x y > almost everywhere in. Proof. The given function f belongs to W 1,p(x) (), hence being ally integrable function, f and its weak gradient f can be approximated by the mollified functions f ɛ and f ɛ almost everywhere in, that is f ɛ f and f ɛ f everywhere in except a set A of measure zero. Also we have given < x y, f(x) f(y) > 0 for all x, y \A. Let x, y \A. Let K be the compact set containing x and y. For this compact set K, by using Theorem 2.11, we can find a number ɛ 0 > 0 such that the f ɛ are convex for all ɛ (0, ɛ 0 ). The functions f ɛ being convex on K, for all ɛ (0, ɛ 0 ), and differentiable will satisfy f ɛ (x) f ɛ (y) < f ɛ (y), x y >. On applying limit ɛ 0 to this inequality we get the desired result. Theorem Let f : R be an almost everywhere convex function then f belongs to W 1,p(x) () and satisfies f(x) f(y) < f(y), x y > almost everywhere in. Proof. The given function f is almost everywhere convex, hence can be written as a sum of two functions g and h, that is, f = g + h, where g is a convex function while h is a zero function almost everywhere in. The function g being a convex function is ally Lipschitz and hence almost everywhere differentiable on. Since g is differentiable on \A, where µ(a) is zero, using Theorem 2.7 we have g(x) g(y) < g(y), x y > for all x, y \A, where g(y) is the weak gradient of g. Since f and g are equivalent the weak gradient of f is the same as for g, hence f W 1,p(x) () and above equation can be written as f(x) f(y) < g(y), x y > for all x, y \A.
6 2058 Matloob Anwar and Hina Urooj Definition A function f defined on an open set of R n is said to be differentiable at c if there exists a linear functional df(c; v), defined for all v in R n such that for all δ > 0 satisfies the following: f(x) f(c) df(c; x c) δ x c for x. Theorem Suppose that f : R be a function in W 1,p(x) () which satisfies f(x) f(y) < f(y), x y >, f ɛ (x) f(x) and f ɛ (x) f(x) for all x in \A, with µ(a) = 0. Then f is almost everywhere convex on. Proof. To reach the desired conclusion, we will first prove that f is an element of W 1, (), that is, f and its weak gradient f are essentially ally bounded on. We prove that f is essentially ally bounded on by proving the al boundedness of f ɛ on some compact set in. Choose a cube Q in \A centered at x 0 with vertices v 1, v 2,..., v 2 n. Since Q is compact there is a positive number ɛ 0 such that f ɛ are convex on Q for all ɛ in (0, ɛ 0 ). Also, it is given that f ɛ converges to f a.e in \A, there exists a constant C 1 such that f ɛ (x i ) C 1 for all ɛ in (0, ɛ 0 ) i = 1, 2,...2 n. Using convexity of f ɛ on Q and the fact that every x in Q is a convex combination of its vertices, we have f ɛ (x) C 1 for all x in Q and for all ɛ in (0, ɛ 0 ). Hence f ɛ is bounded above on Q. Now by symmetry of Q, for every x Q there exists y Q such that x 0 = (x + y)/2. Hence f ɛ (x 0 ) (f ɛ (x) + f ɛ (y))/2 which implies f ɛ (x) 2f ɛ (x 0 ) f ɛ (y) 2f ɛ (x 0 ) C 1 = C 2. Hence f ɛ is bounded on Q by the constant C = max(c 1, C 2 ), and there exists an open ball B(x 0, δ) such that f is bounded a.e. on B(x 0, δ), that is f L (B(x 0,δ)) < C To prove the essential al boundedness of f we will show that for sufficiently small ɛ > 0, f ɛ are Lipschitzian on B(x 0, δ). Since for each sufficiently small ɛ, the functions f ɛ are defined, also bounded on B(x 0, δ), we can apply the definition of differentiability at x 0 to each f ɛ as follows: For some η > 0 and x B(x 0, δ), we have f ɛ (x) f ɛ (x 0 ) df ɛ (x 0, x x 0 ) η x x 0 for all x B(x 0, δ), which implies f ɛ (x) f ɛ (x 0 ) < df ɛ (x 0, x x 0 ) + η x x 0. (1) Since df ɛ (x 0 ; x x 0 ) =< f ɛ (x 0 ), x x 0 >, the Cauchy Schwartz inequality implies that df ɛ (x 0 ; x x 0 ) f ɛ (x 0 ) x x 0, hence inequality (2.1) becomes f ɛ (x) f ɛ (x 0 ) f ɛ (x 0 ) x x 0 + η x x 0 = C x x 0, for all x B(x 0, δ), where C = η+ f(x 0 ). Hence for ɛ small enough, f ɛ are Lipschitz on B(x 0, δ) and therefore have gradient f ɛ which are bounded by C. This implies that the weak gradient f is essentially ally bounded on B(x 0, δ). Hence it is proved that f is an element of W 1, (). Since functions
7 Almost everywhere convex functions 2059 in W 1, () can be identified as ally Lipschitz functions (see [3]), we can find a continuous function F on such that F = f almost everywhere on. Also, the function F satisfies the inequality given in the hypothesis almost everywhere x in, hence convex by Corollary 2.12, which in turn implies that f is almost every where convex. Conclusion. In this paper we have discussed some interesting properties of almost every where convex functions in Generalized Sobolev spaces. These results are useful to study some further applications of convex functions in Generalized Sobolev Spaces. Like in Sobolev Spaces convex functions are used to solve differential equations. Acknowledgements. This research work is funded by School of Natural Sciences, National University of Sciences and Technology, Islamabad Pakistan. References [1] H. Brezis, Functional Analysis Sobolev Spaces and Partial Differential Equations, Springer, New York, [2] L. Diening, P. Harjulehto, P. Hästö, M. Ruzicka, Lebesgue and Sobolev Spaces with Variable Exponents, Springer Verlag, [3] L.C. Evans, Partial differential equations, Berkeley Mathematics Lectures Notes, Berkeley, [4] O. Kováčik, J. Rákosník, On spaces L p(x) and W k,p(x), Czechoslovak Mathematical Journal, 41 (1991), [5] D. La Torre, M. Rocca, Almost everywhere convex functions on R n and weak derivatives, Rendiconti del Circolo Matematico di Palermo, 50 (2001), [6] C.P. Niculescu and L.E. Persson, Convex Functions and Their Applications: A Contemporary Approach, Springer Verlag, New York, Received: June 23, 2015; Published: August 12, 2015
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
More informationBANACH 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
More informationNotes 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.
More information1 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
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationMetric 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
More informationON 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
More information1 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)
More informationMetric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
More information0 <β 1 let u(x) u(y) kuk u := sup u(x) and [u] β := sup
456 BRUCE K. DRIVER 24. Hölder Spaces Notation 24.1. Let Ω be an open subset of R d,bc(ω) and BC( Ω) be the bounded continuous functions on Ω and Ω respectively. By identifying f BC( Ω) with f Ω BC(Ω),
More informationChapter 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
More informationQuasi Contraction and Fixed Points
Available online at www.ispacs.com/jnaa Volume 2012, Year 2012 Article ID jnaa-00168, 6 Pages doi:10.5899/2012/jnaa-00168 Research Article Quasi Contraction and Fixed Points Mehdi Roohi 1, Mohsen Alimohammady
More informationTHE 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,
More informationTHE 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
More informationThe Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line
The Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line D. Bongiorno, G. Corrao Dipartimento di Ingegneria lettrica, lettronica e delle Telecomunicazioni,
More information1. Let X and Y be normed spaces and let T B(X, Y ).
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: NVP, Frist. 2005-03-14 Skrivtid: 9 11.30 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
More informationResearch Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative
More informationand s n (x) f(x) for all x and s.t. s n is measurable if f is. REAL ANALYSIS Measures. A (positive) measure on a measurable space
RAL ANALYSIS A survey of MA 641-643, UAB 1999-2000 M. Griesemer Throughout these notes m denotes Lebesgue measure. 1. Abstract Integration σ-algebras. A σ-algebra in X is a non-empty collection of subsets
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationReference: Introduction to Partial Differential Equations by G. Folland, 1995, Chap. 3.
5 Potential Theory Reference: Introduction to Partial Differential Equations by G. Folland, 995, Chap. 3. 5. Problems of Interest. In what follows, we consider Ω an open, bounded subset of R n with C 2
More informationExtremal equilibria for reaction diffusion equations in bounded domains and applications.
Extremal equilibria for reaction diffusion equations in bounded domains and applications. Aníbal Rodríguez-Bernal Alejandro Vidal-López Departamento de Matemática Aplicada Universidad Complutense de Madrid,
More informationFixed Point Theorems
Fixed Point Theorems Definition: Let X be a set and let T : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation
More informationFIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.
FIRST YEAR CALCULUS WWLCHENW L c WWWL W L Chen, 1982, 2008. 2006. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It It is is
More informationHow 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
More informationMathematical 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.............................
More information1. 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: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationAdaptive Online Gradient Descent
Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650
More informationSeparation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More information10. Proximal point method
L. Vandenberghe EE236C Spring 2013-14) 10. Proximal point method proximal point method augmented Lagrangian method Moreau-Yosida smoothing 10-1 Proximal point method a conceptual algorithm for minimizing
More informationUNIVERSITETET I OSLO
NIVERSITETET I OSLO Det matematisk-naturvitenskapelige fakultet Examination in: Trial exam Partial differential equations and Sobolev spaces I. Day of examination: November 18. 2009. Examination hours:
More informationShape Optimization Problems over Classes of Convex Domains
Shape Optimization Problems over Classes of Convex Domains Giuseppe BUTTAZZO Dipartimento di Matematica Via Buonarroti, 2 56127 PISA ITALY e-mail: buttazzo@sab.sns.it Paolo GUASONI Scuola Normale Superiore
More informationConvex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
More informationFurther Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1
Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing
More informationGeometrical Characterization of RN-operators between Locally Convex Vector Spaces
Geometrical Characterization of RN-operators between Locally Convex Vector Spaces OLEG REINOV St. Petersburg State University Dept. of Mathematics and Mechanics Universitetskii pr. 28, 198504 St, Petersburg
More informationHOMEWORK 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
More informationExistence and multiplicity of solutions for a Neumann-type p(x)-laplacian equation with nonsmooth potential. 1 Introduction
Electronic Journal of Qualitative Theory of Differential Equations 20, No. 7, -0; http://www.math.u-szeged.hu/ejqtde/ Existence and multiplicity of solutions for a Neumann-type p(x)-laplacian equation
More informationit is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
More informationThe 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
More informationQuasi-static evolution and congested transport
Quasi-static evolution and congested transport Inwon Kim Joint with Damon Alexander, Katy Craig and Yao Yao UCLA, UW Madison Hard congestion in crowd motion The following crowd motion model is proposed
More informationAn optimal transportation problem with import/export taxes on the boundary
An optimal transportation problem with import/export taxes on the boundary Julián Toledo Workshop International sur les Mathématiques et l Environnement Essaouira, November 2012..................... Joint
More informationRate of growth of D-frequently hypercyclic functions
Rate of growth of D-frequently hypercyclic functions A. Bonilla Departamento de Análisis Matemático Universidad de La Laguna Hypercyclic Definition A (linear and continuous) operator T in a topological
More informationMetric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More informationAn Introduction to the Navier-Stokes Initial-Boundary Value Problem
An Introduction to the Navier-Stokes Initial-Boundary Value Problem Giovanni P. Galdi Department of Mechanical Engineering University of Pittsburgh, USA Rechts auf zwei hohen Felsen befinden sich Schlösser,
More informationElasticity Theory Basics
G22.3033-002: Topics in Computer Graphics: Lecture #7 Geometric Modeling New York University Elasticity Theory Basics Lecture #7: 20 October 2003 Lecturer: Denis Zorin Scribe: Adrian Secord, Yotam Gingold
More informationDERIVATIVES AS MATRICES; CHAIN RULE
DERIVATIVES AS MATRICES; CHAIN RULE 1. Derivatives of Real-valued Functions Let s first consider functions f : R 2 R. Recall that if the partial derivatives of f exist at the point (x 0, y 0 ), then we
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction
ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE J.M. CALABUIG, J. RODRÍGUEZ, AND E.A. SÁNCHEZ-PÉREZ Abstract. Let m be a vector measure taking values in a Banach space X. We prove that
More informationMATH10212 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
More informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the
More informationMathematics for Econometrics, Fourth Edition
Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents
More information3. 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.
More information1. 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
More informationContinuity of the Perron Root
Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North
More informationCONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian. Pasquale Candito and Giuseppina D Aguí
Opuscula Math. 34 no. 4 2014 683 690 http://dx.doi.org/10.7494/opmath.2014.34.4.683 Opuscula Mathematica CONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian Pasquale
More informationMetric Spaces. Lecture Notes and Exercises, Fall 2015. M.van den Berg
Metric Spaces Lecture Notes and Exercises, Fall 2015 M.van den Berg School of Mathematics University of Bristol BS8 1TW Bristol, UK mamvdb@bristol.ac.uk 1 Definition of a metric space. Let X be a set,
More informationA PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS. In memory of Rou-Huai Wang
A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS XAVIER CABRÉ, MANEL SANCHÓN, AND JOEL SPRUCK In memory of Rou-Huai Wang 1. Introduction In this note we consider semistable
More informationAdvanced Microeconomics
Advanced Microeconomics Ordinal preference theory Harald Wiese University of Leipzig Harald Wiese (University of Leipzig) Advanced Microeconomics 1 / 68 Part A. Basic decision and preference theory 1 Decisions
More informationF. 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
More informationON NONNEGATIVE SOLUTIONS OF NONLINEAR TWO-POINT BOUNDARY VALUE PROBLEMS FOR TWO-DIMENSIONAL DIFFERENTIAL SYSTEMS WITH ADVANCED ARGUMENTS
ON NONNEGATIVE SOLUTIONS OF NONLINEAR TWO-POINT BOUNDARY VALUE PROBLEMS FOR TWO-DIMENSIONAL DIFFERENTIAL SYSTEMS WITH ADVANCED ARGUMENTS I. KIGURADZE AND N. PARTSVANIA A. Razmadze Mathematical Institute
More informationSOLUTIONS 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
More information(Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties
Lecture 1 Convex Sets (Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties 1.1.1 A convex set In the school geometry
More informationClass Meeting # 1: Introduction to PDEs
MATH 18.152 COURSE NOTES - CLASS MEETING # 1 18.152 Introduction to PDEs, Fall 2011 Professor: Jared Speck Class Meeting # 1: Introduction to PDEs 1. What is a PDE? We will be studying functions u = u(x
More informationMATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
More informationDuality 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
More informationx a x 2 (1 + x 2 ) n.
Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number
More informationSystems with Persistent Memory: the Observation Inequality Problems and Solutions
Chapter 6 Systems with Persistent Memory: the Observation Inequality Problems and Solutions Facts that are recalled in the problems wt) = ut) + 1 c A 1 s ] R c t s)) hws) + Ks r)wr)dr ds. 6.1) w = w +
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics GLOBAL EXISTENCE AND DECREASING PROPERTY OF BOUNDARY VALUES OF SOLUTIONS TO PARABOLIC EQUATIONS WITH NONLOCAL BOUNDARY CONDITIONS Sangwon Seo Volume 193 No. 1 March 2000
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More information1 Formulating The Low Degree Testing Problem
6.895 PCP and Hardness of Approximation MIT, Fall 2010 Lecture 5: Linearity Testing Lecturer: Dana Moshkovitz Scribe: Gregory Minton and Dana Moshkovitz In the last lecture, we proved a weak PCP Theorem,
More information16.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
More informationDIFFERENTIABILITY OF CONE-MONOTONE FUNCTIONS ON SEPARABLE BANACH SPACE
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 132, Number 4, Pages 1067 1076 S 0002-9939(03)07149-1 Article electronically published on July 14, 2003 DIFFERENTIABILITY OF CONE-MONOTONE FUNCTIONS
More informationFUNCTIONAL ANALYSIS LECTURE NOTES CHAPTER 2. OPERATORS ON HILBERT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES CHAPTER 2. OPERATORS ON HILBERT SPACES CHRISTOPHER HEIL 1. Elementary Properties and Examples First recall the basic definitions regarding operators. Definition 1.1 (Continuous
More informationON FIBER DIAMETERS OF CONTINUOUS MAPS
ON FIBER DIAMETERS OF CONTINUOUS MAPS PETER S. LANDWEBER, EMANUEL A. LAZAR, AND NEEL PATEL Abstract. We present a surprisingly short proof that for any continuous map f : R n R m, if n > m, then there
More informationMathematics 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
More informationNumerical Verification of Optimality Conditions in Optimal Control Problems
Numerical Verification of Optimality Conditions in Optimal Control Problems Dissertation zur Erlangung des naturwissenschaftlichen Doktorgrades der Julius-Maximilians-Universität Würzburg vorgelegt von
More informationA STABILITY RESULT ON MUCKENHOUPT S WEIGHTS
Publicacions Matemàtiques, Vol 42 (998), 53 63. A STABILITY RESULT ON MUCKENHOUPT S WEIGHTS Juha Kinnunen Abstract We prove that Muckenhoupt s A -weights satisfy a reverse Hölder inequality with an explicit
More information88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a
88 CHAPTER. VECTOR FUNCTIONS.4 Curvature.4.1 Definitions and Examples The notion of curvature measures how sharply a curve bends. We would expect the curvature to be 0 for a straight line, to be very small
More informationContinued 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
More informationAbout the inverse football pool problem for 9 games 1
Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute
More informationGROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
More informationPractice 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
More informationUniversity of Ostrava. Fuzzy Transforms
University of Ostrava Institute for Research and Applications of Fuzzy Modeling Fuzzy Transforms Irina Perfilieva Research report No. 58 2004 Submitted/to appear: Fuzzy Sets and Systems Supported by: Grant
More informationGambling Systems and Multiplication-Invariant Measures
Gambling Systems and Multiplication-Invariant Measures by Jeffrey S. Rosenthal* and Peter O. Schwartz** (May 28, 997.. Introduction. This short paper describes a surprising connection between two previously
More informationTwo Fundamental Theorems about the Definite Integral
Two Fundamental Theorems about the Definite Integral These lecture notes develop the theorem Stewart calls The Fundamental Theorem of Calculus in section 5.3. The approach I use is slightly different than
More informationMATH 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
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More informationn k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...
6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationLet H and J be as in the above lemma. The result of the lemma shows that the integral
Let and be as in the above lemma. The result of the lemma shows that the integral ( f(x, y)dy) dx is well defined; we denote it by f(x, y)dydx. By symmetry, also the integral ( f(x, y)dx) dy is well defined;
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number
More informationTOPIC 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
More informationt := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).
1. Line Search Methods Let f : R n R be given and suppose that x c is our current best estimate of a solution to P min x R nf(x). A standard method for improving the estimate x c is to choose a direction
More informationNotes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand
Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such
More informationSection 4.4 Inner Product Spaces
Section 4.4 Inner Product Spaces In our discussion of vector spaces the specific nature of F as a field, other than the fact that it is a field, has played virtually no role. In this section we no longer
More informationTheory of Sobolev Multipliers
Vladimir G. Maz'ya Tatyana O. Shaposhnikova Theory of Sobolev Multipliers With Applications to Differential and Integral Operators ^ Springer Introduction Part I Description and Properties of Multipliers
More informationFactoring Cubic Polynomials
Factoring Cubic Polynomials Robert G. Underwood 1. Introduction There are at least two ways in which using the famous Cardano formulas (1545) to factor cubic polynomials present more difficulties than
More information1 Local Brouwer degree
1 Local Brouwer degree Let D R n be an open set and f : S R n be continuous, D S and c R n. Suppose that the set f 1 (c) D is compact. (1) Then the local Brouwer degree of f at c in the set D is defined.
More information