Convexity and unique minimum points
|
|
- Griffin Jefferson
- 5 years ago
- Views:
Transcription
1 Convexity and unique minimum points Josef Berger and Gregor Svindland February 17, 2018 Abstract We show constructively that every quasi-convex, uniformly continuous function f : C R with at most one minimum point has a minimum point, where C is a convex compact subset of a finite dimensional normed space. Applications include a result on strictly quasi-convex functions, a supporting hyperplane theorem, and a short proof of the constructive fundamental theorem of approximation theory. 1 Introduction Let (X, d) be a compact metric space. The infimum of a uniformly continuous function f : X R is given by inf f = inf {f(x) x X}. An element x of X is a minimum point of f if f(x) = inf f. The function f has at most one minimum point if d(x, y) > 0 inf f < f(x) inf f < f(y) for all x, y X. In Bishop s constructive mathematics [6, 7, 8], the framework of this paper, the following statements are equivalent: (I) Brouwer s fan theorem for detachable bars. (II) Every positive-valued, uniformly continuous function on a compact metric space has positive infimum. 1
2 (III) Every uniformly continuous function on a compact metric space which has at most one minimum point has a minimum point. The equivalence of (I) and (II) was proved in [2, 10] and the equivalence of (I) and (III) was proved in [1, 2, 11]. In [3], we proved (II) for quasi-convex functions whose domain C is a convex compact subset of R m. Quasi-convex means that f(λx + (1 λ)y) max (f(x), f(y)) for all λ [0, 1] and x, y C. That result was crucial for the constructive treatment of the fundamental theorem of asset pricing in [4] and corresponds to a constructively valid version of the fan theorem, see [5]. In this paper which is a sequel of [3] we show (III) for quasi-convex functions whose domain C is a convex compact subset of R m (Theorem 1) and generalise this result to finite-dimensional normed spaces (Theorem 2). As applications we obtain a supporting hyperplane theorem (Proposition 1) and a result on strictly quasi-convex functions (Proposition 2). Moreover, we obtain a new short proof of the fundamental theorem of approximation theory (Proposition 3). 2 Unique minimum points In this section, we prove the following theorem. Theorem 1. Let C be a convex compact subset of R m. Then every quasiconvex, uniformly continuous function f : C R with at most one minimum point has a minimum point. To this end, let C be a convex compact subset of R m. Fix a quasi-convex, uniformly continuous function f : C R which has at most one minimum point. Without loss of generality, we may assume that inf f = 0. For a subset S of C let f S denote the restriction of f to S. Lemma 1. Fix convex compact subsets A, B of C such that d(a, b) > 0 for all a A and b B. Then inf(f A ) > 0 or inf(f B ) > 0. Proof. The set A B is a convex compact subset of R 2m, and the function F : A B R, (a, b) max (f(a), f(b)) is positive-valued, quasi-convex, and uniformly continuous. By [3, Theorem 1] we can conclude that ε := inf F > 0. Since inf(f A ) > 0 inf(f A ) < ε 2
3 and inf(f B ) > 0 inf(f B ) < ε, this implies that inf(f A ) > 0 or inf(f B ) > 0. For x R m and j {1,..., m} the j-th component of x is denoted by x j. Lemma 2. For each ε > 0 there exists C C such that (i) C convex and compact (ii) inf(f C ) = 0 (iii) x, y C j (x j y j < ε). Proof. Consider the first coordinate. Since the projection mapping x x 1 is uniformly continuous and uniformly continuous images of totally bounded sets are totally bounded [8, Proposition 2.2.6], the set D = {x 1 x C} is totally bounded. Set ι = inf D and η = sup D. If η ι < ε, set C = C. We may therefore assume that ι < η. Define s = ι + 1(η ι) and t = ι + 2 (η ι). 3 3 By [3, Proof of Lemma 4], the sets and A = {x C x 1 s} B = {x C x 1 t} are convex and compact. For a A and b B we have d(a, b) > 0. By Lemma 1, we can conclude that In the first case, set and in the second case set inf(f A ) > 0 or inf(f B ) > 0. (1) C = {x C x 1 s} C = {x C x 1 t}. The the set C fulfils the properties (i) and (ii). Iterating this procedure, also over the coordinates, we eventually obtain a set C which fulfills (iii) as well. The diameter of a compact set S is defined by diam S = sup {d(x, y) x, y S}. 3
4 of Theorem 1. By Lemma 2, we can construct a sequence (C n ) of compact subsets of C such that (a) n (C n+1 C n ) (b) lim n diam C n = 0 (c) n (inf(f C n ) = 0). For each n, fix x n C n with f(x n ) < 1/n. The sequence (x n ) is a Cauchy sequence and its limit is a minimum point of f. 3 Applications 3.1 Finite-dimensional normed spaces A normed space V is finite-dimensional if either V = {0} or else there exist b 1,..., b m V such that the linear mapping κ : R m V, λ m λ i b i i=1 is bijective. (Injective in the sense that λ > 0 implies κ(λ) > 0.) In this case, both κ and its inverse κ 1 are uniformly continuous. See [6, 7, 8] for more information on finite-dimensional normed spaces. In view of the definition of a finite-dimensional normed space, we obtain a straightforward generalisation of Theorem 1. Theorem 2. Let C be a convex compact subset of a finite-dimensional normed space. Then every quasi-convex, uniformly continuous function f : C R with at most one minimum point has a minimum point. 3.2 Supporting hyperplanes A subset C of a normed space X is strictly convex if λa + (1 λ)b C for all a, b C with d(a, b) > 0 and all λ ]0, 1[. The set C, the interior of C, is defined as usual: x C ε > 0 y X (d(y, x) < ε y C) The following lemma is easy to prove. 4
5 Lemma 3. Fix a subset C of X. (a) If C is convex and open, then it is strictly convex. (b) If C is strictly convex and closed, then it is convex. Proposition 1. Let C be a compact, strictly convex subset of a finite dimensional normed space V. Let g : V R be a linear function, and v an element of V with g(v) > 0. Then the restriction of g to C has a minimum point z. Proof. Let f denote the restriction of g to C. Note that linear functions are quasi-convex. Fix a, b with d(a, b) > 0. Set c = (a + b)/2. Since C is strictly convex, there exists δ > 0 such that c δv C. We obtain f(c δv) < f(c) max (f(a), f(b)). Thus f has at most one minimum point. By Theorem 2, f has a minimum point. In the situation of Proposition 1, the set {x V g(x) = g(z)} is called a supporting hyperplane of C. 3.3 Strictly quasi-convex functions Let C be a convex subset of a normed space. A function f : C R is strictly quasi-convex if f(λx + (1 λ)y) < max (f(x), f(y)) for all λ ]0, 1[ and x, y C such that x y > 0. Lemma 4. Every strictly quasi-convex function is quasi-convex. Proof. Fix a strictly quasi-convex function f : C R. As a first step, we show that x, y C λ ]0, 1[ (f(λx + (1 λ)y) max (f(x), f(y))). (2) To this end, fix x, y C and λ ]0, 1[ and assume that f(λx + (1 λ)y) > max (f(x), f(y)). (3) 5
6 If x y > 0, we have f(λx + (1 λ)y) < max (f(x), f(y)) by the strict quasi-convexity of f. This contradicts (3), thus we can conclude that x = y. This implies that (3) is false. Therefore, we have proved (2). As a second step, we show that f is quasi-convex. Fix x, y C and λ [0, 1]. We either have λ < 1 or else λ > 0. Without loss of generality, we may assume that λ < 1. Assume (3). If λ > 0, then (2) implies that f(λx + (1 λ)y) max (f(x), f(y)), which contradicts (3). Thus λ = 0. This implies that (3) is false, therefore we have shown f(λx + (1 λ)y) max (f(x), f(y)). Remark 1. In a constructive proof, case distinctions are only allowed when we can decide which one of the cases holds. However, this restriction no longer applies when we prove a negated statement. This follows from the scheme ( A A). (4) Having (4) in mind, we observe that the proof of Lemma 4 kan be rephrased as follows. Assume that f is strictly quasi-convex. Fix x, y C and λ [0, 1]. We have to show that f(λx + (1 λ)y) max (f(x), f(y)). (5) This is the negation of (3). If x y = 0 or λ {0, 1}, the statement (5) holds anyway. In the case λ ]0, 1[ and x y > 0, the statement (5) follows from the quasi-convexity of f. Since strictly quasi-convex functions have at most one minimum point, Theorem 2 and Lemma 4 imply the following result. Proposition 2. Let C be a convex compact subset of a a finite-dimensional normed space. Then every strictly quasi-convex, uniformly continuous function f : C R has a minimum point. 6
7 3.4 Approximation theory Let Y be a subset of a normed linear space X. Let g : Y R be a function. An element y of Y is a minimum point of g if x Y (g(y) g(x)). The function g has at most one minimum point if x, y Y (d(x, y) > 0 z Y (g(z) < max (g(x), g(y)))). These definitions are compatible with those given in Section 1. For a X let fa Y be the function : Y y d(y, a). f Y a The set Y is quasiproximinal if for every a X the implication f Y a has at most one minimum point f Y a has a minimum point is valid. As a consequence of Theorem 2, we obtain the the constructive fundamental theorem of approximation theory from [9]. Proposition 3. Every finite-dimensional subspace V of a normed space X is quasiproximinal. Proof. Since {0} is quasiproximinal, we may assume that the dimension of V is positive. Fix a X. Set f = fa V and suppose that f has at most one minimum point. Since V is a positive-dimensional linear space, there exists b V such that ε := f(b) = d(b, a) > 0. The triangle inequality yields Set v V (d(v, b) > 2 ε f(v) > f(b)). (6) V 0 = {v V d(v, b) 3 d(a, b)}. The set V 0 is compact, see [8, Corollary 4.1.7], and convex. The function g = f V 0 is uniformly continuous and quasi-convex. By (6), g has at most one minimum point. Theorem 2 implies that g has a minimum point v 0. Applying (6) once again, we can conclude that v 0 is a minimum point of f. 7
8 References [1] Josef Berger, Douglas Bridges, and Peter Schuster. The fan theorem and unique existence of maxima. Journal of Symbolic Logic, 71(2): , [2] Josef Berger and Hajime Ishihara. Brouwer s fan theorem and unique existence in constructive analysis. Mathematical Logic Quarterly, 51(4): , [3] Josef Berger and Gregor Svindland. Convexity and constructive infima. Arch. Math. Log., 55(7-8), [4] Josef Berger and Gregor Svindland. A separating hyperplane theorem, the fundamental theorem of asset pricing, and Markov s principle. Ann. Pure Appl. Logic, 167(11): , [5] Josef Berger and Gregor Svindland. Constructive convex programming. In Klaus Mainzer, Peter Schuster, and Helmut Schwichtenberg, editors, Proof Computation Digitalization in Mathematics, Computer Science and Philosophy. World Scientific Publishing Co. Pte. Ltd., Singapore, forthcoming. [6] Errett Bishop and Douglas Bridges. Constructive Analysis. Springer- Verlag Berlin Heidelberg, [7] Douglas Bridges and Fred Richman. Varieties of Constructive Mathematics. Cambridge Univ. Press, [8] Douglas Bridges and Luminita Vîţă. Techniques of Constructive Analysis. Springer, [9] Douglas S. Bridges. A constructive proximinality property of finitedimensional linear subspaces. Rocky Mountain Journal of Mathematics, 11(4): , [10] William Julian and Fred Richman. A uniformly continuous function on [0, 1] that is everywhere different from its infimum. Pacific J. Math., 111(2): , [11] Ulrich Kohlenbach. Effective Moduli from Ineffective Uniqueness Proofs. An Unwinding of de La Vallée Poussin s Proof for Chebycheff Approximation. Ann. Pure Appl. Logic, 64(1):27 94,
Convexity and constructive infima
Convexity and constructive infima Josef Berger and Gregor Svindland May 13, 2016 Abstract We show constructively that every quasi-convex uniformly continuous function f : C R + has positive infimum, where
More informationConstructive convex programming
Constructive convex programming Josef Berger and Gregor Svindland August 15, 2017 Abstract Working within Bishop-style constructive mathematics, we show that positive-valued, uniformly continuous, convex
More informationConstructive (functional) analysis
Constructive (functional) analysis Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology (JAIST) Nomi, Ishikawa 923-1292, Japan Proof and Computation, Fischbachau,
More informationConstructive Proof of the Fan-Glicksberg Fixed Point Theorem for Sequentially Locally Non-constant Multi-functions in a Locally Convex Space
Constructive Proof of the Fan-Glicksberg Fixed Point Theorem for Sequentially Locally Non-constant Multi-functions in a Locally Convex Space Yasuhito Tanaka, Member, IAENG, Abstract In this paper we constructively
More informationADJOINTS, ABSOLUTE VALUES AND POLAR DECOMPOSITIONS
J. OPERATOR THEORY 44(2000), 243 254 c Copyright by Theta, 2000 ADJOINTS, ABSOLUTE VALUES AND POLAR DECOMPOSITIONS DOUGLAS BRIDGES, FRED RICHMAN and PETER SCHUSTER Communicated by William B. Arveson Abstract.
More informationThe Journal of Logic and Algebraic Programming
The Journal of Logic and Algebraic Programming 79 2010)2 9 Contents lists available at ScienceDirect The Journal of Logic and Algebraic Programming journal homepage: www.elsevier.com/locate/jlap Continuity
More informationProblem set 5, Real Analysis I, Spring, otherwise. (a) Verify that f is integrable. Solution: Compute since f is even, 1 x (log 1/ x ) 2 dx 1
Problem set 5, Real Analysis I, Spring, 25. (5) Consider the function on R defined by f(x) { x (log / x ) 2 if x /2, otherwise. (a) Verify that f is integrable. Solution: Compute since f is even, R f /2
More informationAnalysis Finite and Infinite Sets The Real Numbers The Cantor Set
Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered
More informationMATH 202B - Problem Set 5
MATH 202B - Problem Set 5 Walid Krichene (23265217) March 6, 2013 (5.1) Show that there exists a continuous function F : [0, 1] R which is monotonic on no interval of positive length. proof We know there
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationNear convexity, metric convexity, and convexity
Near convexity, metric convexity, and convexity Fred Richman Florida Atlantic University Boca Raton, FL 33431 28 February 2005 Abstract It is shown that a subset of a uniformly convex normed space is nearly
More informationBest approximations in normed vector spaces
Best approximations in normed vector spaces Mike de Vries 5699703 a thesis submitted to the Department of Mathematics at Utrecht University in partial fulfillment of the requirements for the degree of
More informationPDF hosted at the Radboud Repository of the Radboud University Nijmegen
PDF hosted at the Radboud Repository of the Radboud University Nijmegen The following full text is a preprint version which may differ from the publisher's version. For additional information about this
More informationCONSTRUCTIVE CONNECTIONS BETWEEN ANTI-SPECKER, POSITIVITY, AND FAN-THEORETIC PROPERTIES. Douglas Bridges, James Dent, and Maarten McKubre-Jordens
NEW ZEALAND JOURNAL OF MATHEMATICS Volume 44 (2014), 21 33 CONSTRUCTIVE CONNECTIONS BETWEEN ANTI-SPECKER, POSITIVITY, AND FAN-THEORETIC PROPERTIES Douglas Bridges, James Dent, and Maarten McKubre-Jordens
More informationThe binary expansion and the intermediate value theorem in constructive reverse mathematics
The binary expansion and the intermediate value theorem in constructive reverse mathematics Josef Berger, Hajime Ishihara, Takayuki Kihara and Takako Nemoto November 29, 2015 Abstract We introduce the
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationMA651 Topology. Lecture 10. Metric Spaces.
MA65 Topology. Lecture 0. Metric Spaces. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Linear Algebra and Analysis by Marc Zamansky
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. Determine whether the following statements are true or false. Justify your answer (i.e., prove the claim, derive a contradiction or give a counter-example). (a) (10
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationvan Rooij, Schikhof: A Second Course on Real Functions
vanrooijschikhof.tex April 25, 2018 van Rooij, Schikhof: A Second Course on Real Functions Notes from [vrs]. Introduction A monotone function is Riemann integrable. A continuous function is Riemann integrable.
More informationMath 140A - Fall Final Exam
Math 140A - Fall 2014 - Final Exam Problem 1. Let {a n } n 1 be an increasing sequence of real numbers. (i) If {a n } has a bounded subsequence, show that {a n } is itself bounded. (ii) If {a n } has a
More informationarxiv: v1 [math.lo] 24 Aug 2018
A continuity principle equivalent to the monotone Π 0 1 fan theorem arxiv:1808.08076v1 [math.lo] 24 Aug 2018 Tatsuji Kawai Japan Advanced Institute of Science and Technology 1-1 Asahidai, Nomi, Ishikawa
More informationContinuity. Chapter 4
Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of
More informationReal Analysis. Joe Patten August 12, 2018
Real Analysis Joe Patten August 12, 2018 1 Relations and Functions 1.1 Relations A (binary) relation, R, from set A to set B is a subset of A B. Since R is a subset of A B, it is a set of ordered pairs.
More informationConstructive analysis
Constructive analysis Philosophy, Proof and Fundamentals Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology (JAIST) Nomi, Ishikawa 923-1292, Japan Interval
More informationConvex Optimization Notes
Convex Optimization Notes Jonathan Siegel January 2017 1 Convex Analysis This section is devoted to the study of convex functions f : B R {+ } and convex sets U B, for B a Banach space. The case of B =
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationThe Mean Value Inequality (without the Mean Value Theorem)
The Mean Value Inequality (without the Mean Value Theorem) Michael Müger September 13, 017 1 Introduction Abstract Once one has defined the notion of differentiability of a function of one variable, it
More informationconverges as well if x < 1. 1 x n x n 1 1 = 2 a nx n
Solve the following 6 problems. 1. Prove that if series n=1 a nx n converges for all x such that x < 1, then the series n=1 a n xn 1 x converges as well if x < 1. n For x < 1, x n 0 as n, so there exists
More informationTools from Lebesgue integration
Tools from Lebesgue integration E.P. van den Ban Fall 2005 Introduction In these notes we describe some of the basic tools from the theory of Lebesgue integration. Definitions and results will be given
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Supplement A: Mathematical background A.1 Extended real numbers The extended real number
More informationJensen s inequality for multivariate medians
Jensen s inequality for multivariate medians Milan Merkle University of Belgrade, Serbia emerkle@etf.rs Given a probability measure µ on Borel sigma-field of R d, and a function f : R d R, the main issue
More informationDefinition 6.1. A metric space (X, d) is complete if every Cauchy sequence tends to a limit in X.
Chapter 6 Completeness Lecture 18 Recall from Definition 2.22 that a Cauchy sequence in (X, d) is a sequence whose terms get closer and closer together, without any limit being specified. In the Euclidean
More informationExam 2 extra practice problems
Exam 2 extra practice problems (1) If (X, d) is connected and f : X R is a continuous function such that f(x) = 1 for all x X, show that f must be constant. Solution: Since f(x) = 1 for every x X, either
More informationRemark on a Couple Coincidence Point in Cone Normed Spaces
International Journal of Mathematical Analysis Vol. 8, 2014, no. 50, 2461-2468 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.49293 Remark on a Couple Coincidence Point in Cone Normed
More informationMATH 426, TOPOLOGY. p 1.
MATH 426, TOPOLOGY THE p-norms In this document we assume an extended real line, where is an element greater than all real numbers; the interval notation [1, ] will be used to mean [1, ) { }. 1. THE p
More informationA UNIFORMLY CONTINUOUS FUNCTION ON [0,1] THAT IS EVERYWHERE DIFFERENT FROM ITS INFIMUM
PACIFIC JOURNAL OF MATHEMATICS Vol. Ill, No. 2, 1984 A UNIFORMLY CONTINUOUS FUNCTION ON [0,1] THAT IS EVERYWHERE IFFERENT FROM ITS INFIMUM WILLIAM JULIAN AN FRE RICHMAN An example of a uniformly continuous
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationMath 328 Course Notes
Math 328 Course Notes Ian Robertson March 3, 2006 3 Properties of C[0, 1]: Sup-norm and Completeness In this chapter we are going to examine the vector space of all continuous functions defined on the
More informationDivision of the Humanities and Social Sciences. Supergradients. KC Border Fall 2001 v ::15.45
Division of the Humanities and Social Sciences Supergradients KC Border Fall 2001 1 The supergradient of a concave function There is a useful way to characterize the concavity of differentiable functions.
More informationDocument downloaded from: This paper must be cited as:
Document downloaded from: http://hdl.handle.net/10251/50602 This paper must be cited as: Pedraza Aguilera, T.; Rodríguez López, J.; Romaguera Bonilla, S. (2014). Convergence of fuzzy sets with respect
More informationTHEOREMS, ETC., FOR MATH 515
THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every
More informationA NOTE ON LINEAR FUNCTIONAL NORMS
A NOTE ON LINEAR FUNCTIONAL NORMS YIFEI PAN AND MEI WANG Abstract. For a vector u in a normed linear space, Hahn-Banach Theorem provides the existence of a linear functional f, f(u) = u such that f = 1.
More informationMath 209B Homework 2
Math 29B Homework 2 Edward Burkard Note: All vector spaces are over the field F = R or C 4.6. Two Compactness Theorems. 4. Point Set Topology Exercise 6 The product of countably many sequentally compact
More informationMath 5210, Definitions and Theorems on Metric Spaces
Math 5210, Definitions and Theorems on Metric Spaces Let (X, d) be a metric space. We will use the following definitions (see Rudin, chap 2, particularly 2.18) 1. Let p X and r R, r > 0, The ball of radius
More informationHelly's Theorem and its Equivalences via Convex Analysis
Portland State University PDXScholar University Honors Theses University Honors College 2014 Helly's Theorem and its Equivalences via Convex Analysis Adam Robinson Portland State University Let us know
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
More informationA strongly rigid binary relation
A strongly rigid binary relation Anne Fearnley 8 November 1994 Abstract A binary relation ρ on a set U is strongly rigid if every universal algebra on U such that ρ is a subuniverse of its square is trivial.
More informationContinuous Functions on Metric Spaces
Continuous Functions on Metric Spaces Math 201A, Fall 2016 1 Continuous functions Definition 1. Let (X, d X ) and (Y, d Y ) be metric spaces. A function f : X Y is continuous at a X if for every ɛ > 0
More informationIowa State University. Instructor: Alex Roitershtein Summer Homework #5. Solutions
Math 50 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 205 Homework #5 Solutions. Let α and c be real numbers, c > 0, and f is defined
More informationd(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N
Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x
More informationZERO DUALITY GAP FOR CONVEX PROGRAMS: A GENERAL RESULT
ZERO DUALITY GAP FOR CONVEX PROGRAMS: A GENERAL RESULT EMIL ERNST AND MICHEL VOLLE Abstract. This article addresses a general criterion providing a zero duality gap for convex programs in the setting of
More informationIowa State University. Instructor: Alex Roitershtein Summer Homework #1. Solutions
Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 EXERCISES FROM CHAPTER 1 Homework #1 Solutions The following version of the
More information7 Complete metric spaces and function spaces
7 Complete metric spaces and function spaces 7.1 Completeness Let (X, d) be a metric space. Definition 7.1. A sequence (x n ) n N in X is a Cauchy sequence if for any ɛ > 0, there is N N such that n, m
More informationPrinciple of Mathematical Induction
Advanced Calculus I. Math 451, Fall 2016, Prof. Vershynin Principle of Mathematical Induction 1. Prove that 1 + 2 + + n = 1 n(n + 1) for all n N. 2 2. Prove that 1 2 + 2 2 + + n 2 = 1 n(n + 1)(2n + 1)
More informationMATH 54 - TOPOLOGY SUMMER 2015 FINAL EXAMINATION. Problem 1
MATH 54 - TOPOLOGY SUMMER 2015 FINAL EXAMINATION ELEMENTS OF SOLUTION Problem 1 1. Let X be a Hausdorff space and K 1, K 2 disjoint compact subsets of X. Prove that there exist disjoint open sets U 1 and
More informationLOCATING Ax, WHERE A IS A SUBSPACE OF B(H)
Logical Methods in Computer Science Vol. 10:9)014, pp. 1 10 www.lmcs-online.org Submitted Jan. 4, 013 Published Jun. 16, 014 LOCATING Ax, WHERE A IS A SUBSPACE OF BH) DOUGLAS S. BRIDGES University of Canterbury,
More information2) Let X be a compact space. Prove that the space C(X) of continuous real-valued functions is a complete metric space.
University of Bergen General Functional Analysis Problems with solutions 6 ) Prove that is unique in any normed space. Solution of ) Let us suppose that there are 2 zeros and 2. Then = + 2 = 2 + = 2. 2)
More informationMath 5052 Measure Theory and Functional Analysis II Homework Assignment 7
Math 5052 Measure Theory and Functional Analysis II Homework Assignment 7 Prof. Wickerhauser Due Friday, February 5th, 2016 Please do Exercises 3, 6, 14, 16*, 17, 18, 21*, 23*, 24, 27*. Exercises marked
More information08a. Operators on Hilbert spaces. 1. Boundedness, continuity, operator norms
(February 24, 2017) 08a. Operators on Hilbert spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2016-17/08a-ops
More informationON PARABOLIC HARNACK INEQUALITY
ON PARABOLIC HARNACK INEQUALITY JIAXIN HU Abstract. We show that the parabolic Harnack inequality is equivalent to the near-diagonal lower bound of the Dirichlet heat kernel on any ball in a metric measure-energy
More informationFunctions of Several Variables (Rudin)
Functions of Several Variables (Rudin) Definition: Let X and Y be finite-dimensional real vector spaces. Then L(X, Y ) denotes the set of all linear transformations from X to Y and L(X) denotes the set
More informationIterative Convex Optimization Algorithms; Part One: Using the Baillon Haddad Theorem
Iterative Convex Optimization Algorithms; Part One: Using the Baillon Haddad Theorem Charles Byrne (Charles Byrne@uml.edu) http://faculty.uml.edu/cbyrne/cbyrne.html Department of Mathematical Sciences
More informationLecture Notes on Metric Spaces
Lecture Notes on Metric Spaces Math 117: Summer 2007 John Douglas Moore Our goal of these notes is to explain a few facts regarding metric spaces not included in the first few chapters of the text [1],
More informationSolution Sheet 3. Solution Consider. with the metric. We also define a subset. and thus for any x, y X 0
Solution Sheet Throughout this sheet denotes a domain of R n with sufficiently smooth boundary. 1. Let 1 p
More informationChapter 3 Continuous Functions
Continuity is a very important concept in analysis. The tool that we shall use to study continuity will be sequences. There are important results concerning the subsets of the real numbers and the continuity
More informationBy (a), B ε (x) is a closed subset (which
Solutions to Homework #3. 1. Given a metric space (X, d), a point x X and ε > 0, define B ε (x) = {y X : d(y, x) ε}, called the closed ball of radius ε centered at x. (a) Prove that B ε (x) is always a
More informationOn Firmness of the State Space and Positive Elements of a Banach Algebra 1
Journal of Universal Computer Science, vol. 11, no. 12 (2005), 1963-1969 submitted: 14/10/05, accepted: 15/11/05, appeared: 28/12/05 J.UCS On Firmness of the State Space and Positive Elements of a Banach
More informationAnalysis and Linear Algebra. Lectures 1-3 on the mathematical tools that will be used in C103
Analysis and Linear Algebra Lectures 1-3 on the mathematical tools that will be used in C103 Set Notation A, B sets AcB union A1B intersection A\B the set of objects in A that are not in B N. Empty set
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationBrownian Motion and Stochastic Calculus
ETHZ, Spring 17 D-MATH Prof Dr Martin Larsson Coordinator A Sepúlveda Brownian Motion and Stochastic Calculus Exercise sheet 6 Please hand in your solutions during exercise class or in your assistant s
More informationAppendix A: Separation theorems in IR n
Appendix A: Separation theorems in IR n These notes provide a number of separation theorems for convex sets in IR n. We start with a basic result, give a proof with the help on an auxiliary result and
More informationReal Analysis Chapter 4 Solutions Jonathan Conder
2. Let x, y X and suppose that x y. Then {x} c is open in the cofinite topology and contains y but not x. The cofinite topology on X is therefore T 1. Since X is infinite it contains two distinct points
More informationProblem set 4, Real Analysis I, Spring, 2015.
Problem set 4, Real Analysis I, Spring, 215. (18) Let f be a measurable finite-valued function on [, 1], and suppose f(x) f(y) is integrable on [, 1] [, 1]. Show that f is integrable on [, 1]. [Hint: Show
More informationREVIEW OF ESSENTIAL MATH 346 TOPICS
REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations
More informationEcon Lecture 3. Outline. 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n
Econ 204 2011 Lecture 3 Outline 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n 1 Metric Spaces and Metrics Generalize distance and length notions
More informationA Common Fixed Points in Cone and rectangular cone Metric Spaces
Chapter 5 A Common Fixed Points in Cone and rectangular cone Metric Spaces In this chapter we have establish fixed point theorems in cone metric spaces and rectangular cone metric space. In the first part
More informationReal Analysis Notes. Thomas Goller
Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................
More informationAppendix B Convex analysis
This version: 28/02/2014 Appendix B Convex analysis In this appendix we review a few basic notions of convexity and related notions that will be important for us at various times. B.1 The Hausdorff distance
More informationMATH 131A: REAL ANALYSIS (BIG IDEAS)
MATH 131A: REAL ANALYSIS (BIG IDEAS) Theorem 1 (The Triangle Inequality). For all x, y R we have x + y x + y. Proposition 2 (The Archimedean property). For each x R there exists an n N such that n > x.
More informationA CONSTRUCTIVE CONVERSE OF THE MEAN VALUE THEOREM.
A CONSTRUCTIVE CONVERSE OF THE MEAN VALUE THEOREM. BAS SPITTERS AND WIM VELDMAN Abstract. Consider the following converse of the Mean Value Theorem. Let f be a differentiable function on [a, b]. If c (a,
More informationThe structure of ideals, point derivations, amenability and weak amenability of extended Lipschitz algebras
Int. J. Nonlinear Anal. Appl. 8 (2017) No. 1, 389-404 ISSN: 2008-6822 (electronic) http://dx.doi.org/10.22075/ijnaa.2016.493 The structure of ideals, point derivations, amenability and weak amenability
More informationAliprantis, Border: Infinite-dimensional Analysis A Hitchhiker s Guide
aliprantis.tex May 10, 2011 Aliprantis, Border: Infinite-dimensional Analysis A Hitchhiker s Guide Notes from [AB2]. 1 Odds and Ends 2 Topology 2.1 Topological spaces Example. (2.2) A semimetric = triangle
More informationGeometry and topology of continuous best and near best approximations
Journal of Approximation Theory 105: 252 262, Geometry and topology of continuous best and near best approximations Paul C. Kainen Dept. of Mathematics Georgetown University Washington, D.C. 20057 Věra
More informationTHE CONTRACTION MAPPING THEOREM, II
THE CONTRACTION MAPPING THEOREM, II KEITH CONRAD 1. Introduction In part I, we met the contraction mapping theorem and an application of it to solving nonlinear differential equations. Here we will discuss
More informationThus f is continuous at x 0. Matthew Straughn Math 402 Homework 6
Matthew Straughn Math 402 Homework 6 Homework 6 (p. 452) 14.3.3, 14.3.4, 14.3.5, 14.3.8 (p. 455) 14.4.3* (p. 458) 14.5.3 (p. 460) 14.6.1 (p. 472) 14.7.2* Lemma 1. If (f (n) ) converges uniformly to some
More information1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3
Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,
More informationConstructive (functional) analysis
Constructive (functional) analysis Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology (JAIST) Nomi, Ishikawa 923-1292, Japan Proof and Computation, Fischbachau,
More informationLecture 3. Econ August 12
Lecture 3 Econ 2001 2015 August 12 Lecture 3 Outline 1 Metric and Metric Spaces 2 Norm and Normed Spaces 3 Sequences and Subsequences 4 Convergence 5 Monotone and Bounded Sequences Announcements: - Friday
More informationCONVERGENCE OF APPROXIMATING FIXED POINTS FOR MULTIVALUED NONSELF-MAPPINGS IN BANACH SPACES. Jong Soo Jung. 1. Introduction
Korean J. Math. 16 (2008), No. 2, pp. 215 231 CONVERGENCE OF APPROXIMATING FIXED POINTS FOR MULTIVALUED NONSELF-MAPPINGS IN BANACH SPACES Jong Soo Jung Abstract. Let E be a uniformly convex Banach space
More informationLecture 5 - Hausdorff and Gromov-Hausdorff Distance
Lecture 5 - Hausdorff and Gromov-Hausdorff Distance August 1, 2011 1 Definition and Basic Properties Given a metric space X, the set of closed sets of X supports a metric, the Hausdorff metric. If A is
More informationMath 421, Homework #9 Solutions
Math 41, Homework #9 Solutions (1) (a) A set E R n is said to be path connected if for any pair of points x E and y E there exists a continuous function γ : [0, 1] R n satisfying γ(0) = x, γ(1) = y, and
More informationSelected solutions for Homework 9
Math 424 B / 574 B Due Wednesday, Dec 09 Autumn 2015 Selected solutions for Homework 9 This file includes solutions only to those problems we did not have time to cover in class. We need the following
More informationBounded uniformly continuous functions
Bounded uniformly continuous functions Objectives. To study the basic properties of the C -algebra of the bounded uniformly continuous functions on some metric space. Requirements. Basic concepts of analysis:
More informationThe small ball property in Banach spaces (quantitative results)
The small ball property in Banach spaces (quantitative results) Ehrhard Behrends Abstract A metric space (M, d) is said to have the small ball property (sbp) if for every ε 0 > 0 there exists a sequence
More informationMidterm 1. Every element of the set of functions is continuous
Econ 200 Mathematics for Economists Midterm Question.- Consider the set of functions F C(0, ) dened by { } F = f C(0, ) f(x) = ax b, a A R and b B R That is, F is a subset of the set of continuous functions
More informationEC9A0: Pre-sessional Advanced Mathematics Course. Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1
EC9A0: Pre-sessional Advanced Mathematics Course Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1 1 Infimum and Supremum Definition 1. Fix a set Y R. A number α R is an upper bound of Y if
More informationSOLUTIONS TO ADDITIONAL EXERCISES FOR II.1 AND II.2
SOLUTIONS TO ADDITIONAL EXERCISES FOR II.1 AND II.2 Here are the solutions to the additional exercises in betsepexercises.pdf. B1. Let y and z be distinct points of L; we claim that x, y and z are not
More information