DOCSLIB.ORG

Lecture Notes

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Lecture Notes Honours Analysis III Math 354 Prof. Dmitry Jacobson Notes Taken By: R. Gibson Fall 2010 1 Contents 1 Overview 3 1.1 p-adic Distance . 4 2 Introduction 5 2.1 Normed Linear Spaces . 5 2.2 Inner Product Spaces . 5 2.3 Metric Space Techniques . 10 3 Completeness 21 3.1 Basics & Definitions . 21 3.2 Completion & Density Revisited . 25 3.3 O.D.E. & Contraction . 27 4 Compactness 30 4.1 Basics & Definitions . 30 4.2 Arzela & Compacta . 33 5 Basic Point-Set Topology 40 5.1 Product Topology . 40 5.2 Conectedness . 42 5.3 Connected Components/ Path Components . 44 6 Banach Space Techniques 46 6.1 Linear Functionals . 46 6.2 Baire's Category Theorem, Banach-Steinhaus Theorem & The Open Mapping Theorem . 48 6.3 Convex Sets . 53 6.4 Kernel . 57 6.5 Conjugate Space . 58 6.6 Linear Functionals Revisited . 60 6.7 Bernstein Polynomials . 63 6.8 Inverse & Implicit Function Theorem In Rn ............................ 65 7 Linear Operators & The Operator Norm 68 7.1 The Hahn-Banach Theorem . 68 7.2 Examples . 70 2 Chapter 1 Overview Definition 1. Let X be a metric space. We define Distance d : X × X ! R to satisfy (i) 8x 2 X; d(x; x) = 0 (ii) 8x 6= y 2 X; d(x; y) > 0 (iii) 8x; y 2 X; d(x; y) = d(y; x) (iv) 8x; y; z 2 X; d(x; z) + d(z; y) ≥ d(x; y) Example 1. The following are some of the main examples of metric spaces for this course. • Spaces of sequences (finite or infinite) - with lp norm. • 1 X p f(x1; : : : ; xn);:::): jxkj < 1g k=1 This leads us to a proposition. Proposition 1. If x = (x1; x2;:::); y = (y1; y2;:::), then 1 !1=p X p d(x; y) = jxk − ykj k=1 is a distance. Example 2. If x = 0 and y = (1; 1=2; 1=3; 1=4;:::), then can we prove that r r 1 1 1 π2 d(x; y) = 1 + + + ··· + + ··· = 4 9 h2 6 ...probably not. Example 3. For p ≥ 1, an example would be continuous functions f; g on [a; b]. Proposition 2. In the space of continuous functions on [a; b], 1=p "Z b # d(f; g) = jf(x) − g(x)jpdx a defines a distance. We recall the Lp norm to be 1=p Z b ! p jjfjjp = jf(x)j dx a 3 We now examine polygons in the plane. There is a problem in the assignment which asks if the difference of areas defines a distance. So we must prove that d(P1;P2) = Area(P1 4 P2) which is the area of (P1 [ P2)n(P1 \ P2) Section 1.1 p-adic Distance Let p 2 f2; 3; 5; 7; 11; 13;:::g = P rimes. Let x; y 2 Q so a a x = 1 y = 2 b1 b2 Definition 2. The p-adic Norm is defined as follows c x = pk · d where k 2 Z and −k jjxjjp = p Definition 3. The p-adic Norm is defined to be dp(x; y) = jjx − yjjp Example 4. Working with p-adic distance. Suppose that 24 x = 49 then we have that 24 x = 7−2 =) jjxjj = 72 1 7 8 x = 31 =) jjxjj = 3−1 49 3 3 x = 23 =) jjxjj = 2−3 49 2 Proposition 3. jjx − yjjp defines a p-adic distance on Q. NB: If x is as above, then jjxjjEucl · jjxjj2 · jjxjj3 · jjxjj7 = 1 Neat, eh? 4 Chapter 2 Introduction Section 2.1 Normed Linear Spaces Linear means exactly what you would think it means. A good way to show this is 1 1 1 (an)n=1 + (bn)n=1 = (an + bn)n=1 (f + g)(x) = f(x) + g(x) 8 x 2 [a; b] Definition 4. Suppose that X is a linear space, then we say that the Norm of x 2 X is a map jj · jj : X ! R+ such that (i) jjxjj = 0 () x = 0 (ii) jjt · xjj = jtj · jjxjj (iii) jjx + yjj ≤ jjxjj + jjyjj It is a fact that d(x; y) = jjx − yjj defines a distance since d(y; x) = jjy − xjj = jj − (x − y)jj = jjx − yjj = d(x; y) d(x; z) = jjx − zjj = jj(x − y) + (y − z)jj ≤ jjx − yjj + jjy − zjj = d(x; y) + d(y; z) Section 2.2 Inner Product Spaces An Inner Product Space is a space together with a map (·; ·): X × X ! R such that (i) 0 ≤ (x; x) (ii) (x; y) = 0 () x = 0 (iii) (x; αy + βz) = α(x; y) + β(x; z); x; y; z 2 X; α; β 2 R (iv) (γx + δy; z) = γ(x; z) + δ(y; z) Example 5. The following are some examples of inner products 5 • Dot Product (x; y) = x · y = x1y1 + ··· + xnyn • Function Space Inner Product Z b f; g 2 C([a; b]) =) (f; g) = f(x)g(x)dx a and s Z b jjfjj = [f(x)]2dx a Proposition 4. jjxjj := p(x; x) always defines a norm. Proof. We will need a lemma. Lemma 5. The following identity holds. (x; y) ≤ jjxjj · jjyjj Proof. (x + ty; x + ty) = (x; x) + 2t(x; y) + t2(y; y) we know that jjx + tyjj2 ≥ 0 now, D = 4(x; y)2 − 4(x; x) · (y; y) ≤ 0 (x; y) ≤ p(x; x) · p(y; y) = jjxjj · jjyjj With this lemma, we can now prove the above proposition. So Proof. The triangle inequality states that jjx + yjj ≤ jjxjj + jjyjj and now we can square both sides to obtain (jjx + yjj)2 ≤ (jjxjj + jjyjj)2 and now (x + y; x + y) = (x; x) + 2(x; y) + (y; y) and jjxjj2 + 2jjxjj · jjyjj + jjyjj2 = (x; x) + 2jjxjj · jjyjj + (y; y) by the lemma, and we cancel to obtain =) (x; y) ≤ jjxjj · jjyjj which yields our result. How to guess whether jjxjj comes from (x; x) or not? The answer is (x + y; x + y) + (x − y; x − y) = (x; x) + 2(x; y) + (y; y) + (x; x) − 2(x; y) + (y; y) 6 then (∗) jjx + yjj2 + jjx − yjj2 = 2jjxjj2 + 2jjyjj2 The norm comes from (·; ·) () (∗) holds for all x; y 2 X. Proposition 6. Let (a1; : : : ; an;:::) be such that X 2 ai < 1 and let (b1; : : : ; bn;:::) be such that X 2 bj < 1 and let 1 !1=2 X 2 jjajj = ai i=1 Then 1 X aibi ≤ jjajj · jjbjj i=1 and so v v u n u n uX 2 uX 2 (a; b) = a1b1 + ··· + anbn ≤ t ai · t bj ! jjajj · jjbjj i=1 j=1 as n ! 1. Proof. To prove convergence, v n+m s un+m X X 2 u X 2 aibi ≤ ak · t bk k=n k=n k=n the two components on the right converge separately to 0 as n ! 1. This is because 1 X 2 ak < 1 k=1 2 and the same goes for the sum of bk. Thus, the whole thing converges to 0. 2 2 Summarizing, we proved that (C([a; b]);L -norm) is a metric space, and so is l : Next, we look at Lp-norm which is (1=p) "Z b # p jjfjjp = jf(x)j dx a and at lp-space, p 6= 2, we have 1 !(1=p) X p jjajjlp = jakj k=1 Thus, lp is the space of all a such that 1 X p jakj < 1 k=1 To prove this we need a lemma. 7 Lemma 7. Let a > 0; b > 0, and p; q ≥ 1 and such that 1 1 + = 1 p q NB: We say that p; q are Conjugate Exponents. Then ap bq (∗) a · b ≤ + p q Proof. Let x > 0, then f(x) = log (x) which is a concave function. 1 1 f 0(x) = f 00(x) = − < 0 x x2 and since f is concave, we can say that f(αx + βy) ≥ αf(x) + βf(y) where α + β = 1. Also, we know that log (a · b) = log a + log b 1 1 = log (ap) + log (bq) p q 1 1 (∗∗) ≤ log ap + bq p q Theorem 8 (Holder's Inequality). Let p < 1 n n !1=p n !1=q X X p X q jakbkj ≤ jakj jbkj k=1 k=1 k=1 where 1 1 + = 1 p q Remark. Both sides are homogeneous of degree 1 in (ak); (bk). So WLOG, we can rescale ak − s so that n X p jakj = 1 k=1 and n X q jbkj = 1 k=1 so we say that n n p q X X jakj jbkj ja b j ≤ + k k p q k=1 k=1 n ! n ! 1 X 1 X = ja jp + jb jq p k q k k=1 k=1 1 1 = + p q = 1 8 by our normalization of the sums. Now, 1 n !1=p n ! q X p X q 1=p 1=q RHS = jakj jbkj = 1 1 = 1 k=1 k=1 and so LHS ≤ RHS Now, if we let n ! 1, then we get Holder for infinite series. The proof is left to the reader as an excercise. Theorem 9 (Minkowski Inequality). (For Sequences With n < 1) Recall that for x = (x1; : : : ; xn), we have n !1=p X p jjxjjp = jxkj k=1 We want jjx + yjjp ≤ jjxjjp + jjyjjp So, we know that n p X p jjx + yjjp = jxk + ykj k=1 n X p ≤ (jxkj + jykj) k=1 n X p−1 p−1 = [(jxkj + jykj) jxjk + (jxkj + jykj) jyjk] k=1 and we apply Holder to each inner sum and let bk = (jxkj + jykj); ak = jxkj 1=q 1=p n ! X n p X p−1 q ≤ k = 1 jxkj [(jxkj + jykj) ] k=1 1=q 1=p n ! X n p X p−1 q + k = 1 jykj [(jxkj + jykj) ] k=1 And now, 1 1 1 1 p − 1 1 + = 1 =) 1 − = =) = p q p q p q =) (p − 1)q = p and so 1=p 1=p 1=q X n p X n p hX n qi RHS = k = 1 jxkj + k = 1 jykj · k = 1 (jxkj + jykj) and n X p RHS ≤ LHS = (jxkj + jykj) k=1 " n #1−1=q X p =) (jxkj + jykj) ≤ jjxjjp + jjyjjp k=1 9 and we can conclude that jjx + yjjp ≤ jjxjjp + jjyjjp Example 6.
Load more

Recommended publications
  • Synthetic Topology and Constructive Metric Spaces
    University of Ljubljana Faculty of Mathematics and Physics Department of Mathematics Davorin Leˇsnik Synthetic Topology and Constructive Metric Spaces Doctoral thesis Advisor: izr. prof. dr. Andrej Bauer arXiv:2104.10399v1 [math.GN] 21 Apr 2021 Ljubljana, 2010 Univerza v Ljubljani Fakulteta za matematiko in fiziko Oddelek za matematiko Davorin Leˇsnik Sintetiˇcna topologija in konstruktivni metriˇcni prostori Doktorska disertacija Mentor: izr. prof. dr. Andrej Bauer Ljubljana, 2010 Abstract The thesis presents the subject of synthetic topology, especially with relation to metric spaces. A model of synthetic topology is a categorical model in which objects possess an intrinsic topology in a suitable sense, and all morphisms are continuous with regard to it. We redefine synthetic topology in order to incorporate closed sets, and several generalizations are made. Real numbers are reconstructed (to suit the new background) as open Dedekind cuts. An extensive theory is developed when metric and intrinsic topology match. In the end the results are examined in four specific models. Math. Subj. Class. (MSC 2010): 03F60, 18C50 Keywords: synthetic, topology, metric spaces, real numbers, constructive Povzetek Disertacija predstavi podroˇcje sintetiˇcne topologije, zlasti njeno povezavo z metriˇcnimi prostori. Model sintetiˇcne topologije je kategoriˇcni model, v katerem objekti posedujejo intrinziˇcno topologijo v ustreznem smislu, glede na katero so vsi morfizmi zvezni. Definicije in izreki sintetiˇcne topologije so posploˇseni, med drugim tako, da vkljuˇcujejo zaprte mnoˇzice. Realna ˇstevila so (zaradi sin- tetiˇcnega ozadja) rekonstruirana kot odprti Dedekindovi rezi. Obˇsirna teorija je razvita, kdaj se metriˇcna in intrinziˇcna topologija ujemata. Na koncu prouˇcimo dobljene rezultate v ˇstirih izbranih modelih. Math. Subj. Class. (MSC 2010): 03F60, 18C50 Kljuˇcne besede: sintetiˇcen, topologija, metriˇcni prostori, realna ˇstevila, konstruktiven 8 Contents Introduction 11 0.1 Acknowledgements .................................
    [Show full text]
  • University of Cape Town Department of Mathematics and Applied Mathematics Faculty of Science
    The copyright of this thesis vests in the author. No quotation from it or information derived from it is to be published without full acknowledgementTown of the source. The thesis is to be used for private study or non- commercial research purposes only. Cape Published by the University ofof Cape Town (UCT) in terms of the non-exclusive license granted to UCT by the author. University University of Cape Town Department of Mathematics and Applied Mathematics Faculty of Science Convexity in quasi-metricTown spaces Cape ofby Olivier Olela Otafudu May 2012 University A thesis presented for the degree of Doctor of Philosophy prepared under the supervision of Professor Hans-Peter Albert KÄunzi. Abstract Over the last ¯fty years much progress has been made in the investigation of the hyperconvex hull of a metric space. In particular, Dress, Espinola, Isbell, Jawhari, Khamsi, Kirk, Misane, Pouzet published several articles concerning hyperconvex metric spaces. The principal aim of this thesis is to investigateTown the existence of an injective hull in the categories of T0-quasi-metric spaces and of T0-ultra-quasi- metric spaces with nonexpansive maps. Here several results obtained by others for the hyperconvex hull of a metric space haveCape been generalized by us in the case of quasi-metric spaces. In particular we haveof obtained some original results for the q-hyperconvex hull of a T0-quasi-metric space; for instance the q-hyperconvex hull of any totally bounded T0-quasi-metric space is joincompact. Also a construction of the ultra-quasi-metrically injective (= u-injective) hull of a T0-ultra-quasi- metric space is provided.
    [Show full text]
  • Basic Functional Analysis Master 1 UPMC MM005
    Basic Functional Analysis Master 1 UPMC MM005 Jean-Fran¸coisBabadjian, Didier Smets and Franck Sueur October 18, 2011 2 Contents 1 Topology 5 1.1 Basic definitions . 5 1.1.1 General topology . 5 1.1.2 Metric spaces . 6 1.2 Completeness . 7 1.2.1 Definition . 7 1.2.2 Banach fixed point theorem for contraction mapping . 7 1.2.3 Baire's theorem . 7 1.2.4 Extension of uniformly continuous functions . 8 1.2.5 Banach spaces and algebra . 8 1.3 Compactness . 11 1.4 Separability . 12 2 Spaces of continuous functions 13 2.1 Basic definitions . 13 2.2 Completeness . 13 2.3 Compactness . 14 2.4 Separability . 15 3 Measure theory and Lebesgue integration 19 3.1 Measurable spaces and measurable functions . 19 3.2 Positive measures . 20 3.3 Definition and properties of the Lebesgue integral . 21 3.3.1 Lebesgue integral of non negative measurable functions . 21 3.3.2 Lebesgue integral of real valued measurable functions . 23 3.4 Modes of convergence . 25 3.4.1 Definitions and relationships . 25 3.4.2 Equi-integrability . 27 3.5 Positive Radon measures . 29 3.6 Construction of the Lebesgue measure . 34 4 Lebesgue spaces 39 4.1 First definitions and properties . 39 4.2 Completeness . 41 4.3 Density and separability . 42 4.4 Convolution . 42 4.4.1 Definition and Young's inequality . 43 4.4.2 Mollifier . 44 4.5 A compactness result . 45 5 Continuous linear maps 47 5.1 Space of continuous linear maps . 47 5.2 Uniform boundedness principle{Banach-Steinhaus theorem .
    [Show full text]
  • The Range of Ultrametrics, Compactness, and Separability
    The range of ultrametrics, compactness, and separability Oleksiy Dovgosheya,∗, Volodymir Shcherbakb aDepartment of Theory of Functions, Institute of Applied Mathematics and Mechanics of NASU, Dobrovolskogo str. 1, Slovyansk 84100, Ukraine bDepartment of Applied Mechanics, Institute of Applied Mathematics and Mechanics of NASU, Dobrovolskogo str. 1, Slovyansk 84100, Ukraine Abstract We describe the order type of range sets of compact ultrametrics and show that an ultrametrizable infinite topological space (X, τ) is compact iff the range sets are order isomorphic for any two ultrametrics compatible with the topology τ. It is also shown that an ultrametrizable topology is separable iff every compatible with this topology ultrametric has at most countable range set. Keywords: totally bounded ultrametric space, order type of range set of ultrametric, compact ultrametric space, separable ultrametric space 2020 MSC: Primary 54E35, Secondary 54E45 1. Introduction In what follows we write R+ for the set of all nonnegative real numbers, Q for the set of all rational number, and N for the set of all strictly positive integer numbers. Definition 1.1. A metric on a set X is a function d: X × X → R+ satisfying the following conditions for all x, y, z ∈ X: (i) (d(x, y)=0) ⇔ (x = y); (ii) d(x, y)= d(y, x); (iii) d(x, y) ≤ d(x, z)+ d(z,y) . + + A metric space is a pair (X, d) of a set X and a metric d: X × X → R . A metric d: X × X → R is an ultrametric on X if we have d(x, y) ≤ max{d(x, z), d(z,y)} (1.1) for all x, y, z ∈ X.
    [Show full text]
  • Metric Spaces
    Chapter 1. Metric Spaces Definitions. A metric on a set M is a function d : M M R × → such that for all x, y, z M, Metric Spaces ∈ d(x, y) 0; and d(x, y)=0 if and only if x = y (d is positive) MA222 • ≥ d(x, y)=d(y, x) (d is symmetric) • d(x, z) d(x, y)+d(y, z) (d satisfies the triangle inequality) • ≤ David Preiss The pair (M, d) is called a metric space. [email protected] If there is no danger of confusion we speak about the metric space M and, if necessary, denote the distance by, for example, dM . The open ball centred at a M with radius r is the set Warwick University, Spring 2008/2009 ∈ B(a, r)= x M : d(x, a) < r { ∈ } the closed ball centred at a M with radius r is ∈ x M : d(x, a) r . { ∈ ≤ } A subset S of a metric space M is bounded if there are a M and ∈ r (0, ) so that S B(a, r). ∈ ∞ ⊂ MA222 – 2008/2009 – page 1.1 Normed linear spaces Examples Definition. A norm on a linear (vector) space V (over real or Example (Euclidean n spaces). Rn (or Cn) with the norm complex numbers) is a function : V R such that for all · → n n , x y V , x = x 2 so with metric d(x, y)= x y 2 ∈ | i | | i − i | x 0; and x = 0 if and only if x = 0(positive) i=1 i=1 • ≥ cx = c x for every c R (or c C)(homogeneous) • | | ∈ ∈ n n x + y x + y (satisfies the triangle inequality) Example (n spaces with p norm, p 1).
    [Show full text]
  • Metric Spaces
    Empirical Processes: Lecture 06 Spring, 2010 Introduction to Empirical Processes and Semiparametric Inference Lecture 06: Metric Spaces Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics and Operations Research University of North Carolina-Chapel Hill 1 Empirical Processes: Lecture 06 Spring, 2010 §Introduction to Part II ¤ ¦ ¥ The goal of Part II is to provide an in depth coverage of the basics of empirical process techniques which are useful in statistics: Chapter 6: mathematical background, metric spaces, outer • expectation, linear operators and functional differentiation. Chapter 7: stochastic convergence, weak convergence, other modes • of convergence. Chapter 8: empirical process techniques, maximal inequalities, • symmetrization, Glivenk-Canteli results, Donsker results. Chapter 9: entropy calculations, VC classes, Glivenk-Canteli and • Donsker preservation. Chapter 10: empirical process bootstrap. • 2 Empirical Processes: Lecture 06 Spring, 2010 Chapter 11: additional empirical process results. • Chapter 12: the functional delta method. • Chapter 13: Z-estimators. • Chapter 14: M-estimators. • Chapter 15: Case-studies II. • 3 Empirical Processes: Lecture 06 Spring, 2010 §Topological Spaces ¤ ¦ ¥ A collection of subsets of a set X is a topology in X if: O (i) and X , where is the empty set; ; 2 O 2 O ; (ii) If U for j = 1; : : : ; m, then U ; j 2 O j=1;:::;m j 2 O (iii) If U is an arbitrary collection of Tmembers of (finite, countable or f αg O uncountable), then U . α α 2 O S When is a topology in X, then X (or the pair (X; )) is a topological O O space, and the members of are called the open sets in X.
    [Show full text]
  • Categorical Aspects of the Classical Ascoli Theorems Cahiers De Topologie Et Géométrie Différentielle Catégoriques, Tome 22, No 3 (1981), P
    CAHIERS DE TOPOLOGIE ET GÉOMÉTRIE DIFFÉRENTIELLE CATÉGORIQUES JOHN W. GRAY Categorical aspects of the classical Ascoli theorems Cahiers de topologie et géométrie différentielle catégoriques, tome 22, no 3 (1981), p. 337-342 <http://www.numdam.org/item?id=CTGDC_1981__22_3_337_0> © Andrée C. Ehresmann et les auteurs, 1981, tous droits réservés. L’accès aux archives de la revue « Cahiers de topologie et géométrie différentielle catégoriques » implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/conditions). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques http://www.numdam.org/ CAHIERS DE TOPOLOGIE 3e COLLOQUE SUR LES CATEGORIES E T GEOMETRIE DIFFERENTIELLE DEDIE A CHARLES EHRESMANN Vol. XXII -3 (1981) Amiens, Juillet 1980 CATEGORICALASPECTS OF THE CLASSICALASCOLI THEOREMS by John W. GRAY 0. INTRODUCTION In a forthcoming paper [4] ( summarized below) a version of Ascoli’s Theorem for topological categories enriched in bomological sets is proved. In this paper it is shown how the two classical versions as found in [1] or [9] fit into this format. 1. GENERAL THEORY Let Born denote the category of bomological sets and bounded maps. (See [7 .) It is well known that Born is a cartesian closed topolo- gical category. ( See (6 ] . ) Let T denote a topological category ( cf. 5] or [11] ) which is enriched in Bom in such a way that the enriched hom func- tors T (X, -) preserve sup’s of structures and commute with f *, with dual assumptions on T (-, Y) .
    [Show full text]
  • Topology (H) Lecture 9 Lecturer: Zuoqin Wang Time: April 8, 2021
    Topology (H) Lecture 9 Lecturer: Zuoqin Wang Time: April 8, 2021 COMPACTNESS IN METRIC SPACE 1. Topological and non-topological aspects of metric spaces { Some topological properties of all metrics spaces. Let (X; d) be a metric space, with metric topology Td generated by the basis B = fB(x; r) j x 2 X; r 2 R>0g: Compared with general topological spaces, metric spaces have many nice properties: (1) Any metric space is first countable, since at each x 2 X, there is a countable neighborhood basis Bx = fB(x; r) j r 2 Q>0g: As a consequence, we get (c.f. Lecture 7, Prop. 1.10 and PSet 4-1-1) • F ⊂ X is closed if and only if it contains all its sequential limit points. • A map f : X ! Y is continuous if and only if it is sequentially continuous. (2) Any metric space is Hausdorff, since for each x 6= y 2 X, if we take δ = d(x; y)=2 > 0, then B(x; δ) \ B(y; δ) = ;: As a consequence, we get • every compact set in a metric space is closed. • (in particular,) any single point set fxg is closed. • any convergent sequence in a metric space has a unique limit.[Prove this!] Note: This fact together with first countability implies: any sequentially compact set in X is closed. [Prove this!] (3) In fact, in metric spaces, not only we can \separate" different points by disjoint open sets, but also we can \separate" disjoint closed sets by disjoint open sets: According to Urysohn's lemma in metric space (c.f.
    [Show full text]
  • Mcshane-Whitney Extensions in Constructive Analysis
    Logical Methods in Computer Science Volume 16, Issue 1, 2020, pp. 18:1–18:23 Submitted Apr. 24, 2018 https://lmcs.episciences.org/ Published Feb. 17, 2020 MCSHANE-WHITNEY EXTENSIONS IN CONSTRUCTIVE ANALYSIS IOSIF PETRAKIS Mathematics Institute, Ludwig-Maximilians-Universit¨atM¨unchen e-mail address: [email protected] Abstract. Within Bishop-style constructive mathematics we study the classical McShane- Whitney theorem on the extendability of real-valued Lipschitz functions defined on a subset of a metric space. Using a formulation similar to the formulation of McShane-Whitney theorem, we show that the Lipschitz real-valued functions on a totally bounded space are uniformly dense in the set of uniformly continuous functions. Through the introduced notion of a McShane-Whitney pair we describe the constructive content of the original McShane-Whitney extension and we examine how the properties of a Lipschitz function defined on the subspace of the pair extend to its McShane-Whitney extensions on the space of the pair. Similar McShane-Whitney pairs and extensions are established for H¨older functions and ν-continuous functions, where ν is a modulus of continuity. A Lipschitz version of a fundamental corollary of the Hahn-Banach theorem, and the approximate McShane-Whitney theorem are shown. Introduction A central theme in mathematical analysis, classical or constructive, is the extension of a continuous function f, defined on a subspace A of a space X and satisfying some property P , to a continuous function f ∗ defined on X and satisfying the property P . A \general extension theorem" is a statement providing conditions on X and A such that such an extension of f to f ∗ is possible1.
    [Show full text]
  • Arxiv:1306.3925V1 [Quant-Ph] 17 Jun 2013 System Usatrsm Ieitra)And Interval) Time I Some Re- Point After Extensions
    Recurrence Theorems: a unified account David Wallace∗ Balliol College, University of Oxford (Dated: June 18, 2013) I discuss classical and quantum recurrence theorems in a unified manner, treating both as gener- alisations of the fact that a system with a finite state space only has so many places to go. Along the way I prove versions of the recurrence theorem applicable to dynamics on linear and metric spaces, and make some comments about applications of the classical recurrence theorem in the foundations of statistical mechanics. I. INTRODUCTION An evolution rule U, which maps to itself. • S The idea is that U maps each state to the state into which The Poincar´erecurrence theorem plays an important it will evolve after 1 time-step. We can then define a time role in the foundations of statistical mechanics, dating evolution operator U(n) as follows: U(1) = U, U(2) = back to Zermelo’s original objection to Boltzmann’s H U U, U(3) = U U U, etc. (or, more formally: U(1) = U, theorem.[11] The theorem exists in both classical and U(·n +1) = U U·(n·)), satisfying U(n + m)= U(n)U(m)). quantum forms, but only the classical version is widely Although in this· model of dynamics time is discrete, this discussed. This is unfortunate, as there are foundation- is no real limitation: given a continuous-time evolution ally important differences between the two. Furthermore, operator V (t), we can pick some arbitrarily short time τ in proofs of the classical theorem measure-theoretic tech- and define U = V (τ); then U(n)= V (nτ).
    [Show full text]
  • Totally Bounded Metric Spaces and the Axiom of Choice
    Totally bounded metric spaces and the Axiom of Choice Gonc¸alo Gutierres – CMUC/Universidade de Coimbra A metric space is totally bounded if it has a finite -net for every > 0. One can prove that a metric space is topologically equivalent to a totally bounded metric space if and only if it has a countable -net for every > 0 if and only if it is a Lindelof¨ space if and only if it is second countable if and only if it is separable if and only if ... These equivalences do not remain valid in ZF (Zermelo-Fraenkel set theory without the Axiom of Choice). In this talk we will discuss the set-theoretic status of these equivalences as well as of the other results related with totally boundness. ZF – Zermelo-Fraenkel set theory without the Axiom of Choice. ZFC – Zermelo-Fraenkel set theory with the Axiom of Choice. ZF – Zermelo-Fraenkel set theory without the Axiom of Choice. ZFC – Zermelo-Fraenkel set theory with the Axiom of Choice. CC – the Axiom of Countable Choice. Every countable family of non-empty sets has a choice function. CC(R) – Every countable family of non-empty subsets of R has a choice function. ZF – Zermelo-Fraenkel set theory without the Axiom of Choice. ZFC – Zermelo-Fraenkel set theory with the Axiom of Choice. CC – the Axiom of Countable Choice. Every countable family of non-empty sets has a choice function. CC(R) – Every countable family of non-empty subsets of R has a choice function. CUC – Countable Union Condition. The countable union of countable sets is countable.
    [Show full text]
  • A Constructive Function-Theoretic Approach to Topological Compactness
    A constructive function-theoretic approach to topological compactness Iosif Petrakis University of Munich [email protected] Abstract topological space, the latter concept also is left with no useful We introduce 2-compactness, a constructive function-theoretic al- function to perform. ternative to topological compactness, based on the notions of Later research in constructive algebraic topology in the context Bishop space and Bishop morphism, which are constructive function- of formal topology, has shown that we need to have a more general theoretic alternatives to topological space and continuous function, constructive theory of topological spaces. In [27], p.237, Palmgren respectively. We show that the notion of Bishop morphism is re- notes the following. duced to uniform continuity in important cases, overcoming one of the obstacles in developing constructive general topology posed by To be able to make certain quotient and glueing constructions Bishop. We prove that 2-compactness generalizes metric compact- it is necessary to have a constructive theory of more general ness, namely that the uniformly continuous real-valued functions topological spaces than metric spaces. on a compact metric space form a 2-compact Bishop topology. Among other properties of 2-compact Bishop spaces, the count- If there is though a notion of space which does not copy or able Tychonoff compactness theorem is proved for them. We work follow the pattern of the notion of topological space, and if the within BISH∗, Bishop’s informal system of constructive mathemat- corresponding notion of morphism between two such spaces, despite ics BISH equipped with inductive definitions with rules of countably the fact that uniform continuity is not part of its definition, is many premises, a system strongly connected to Martin-Lof’s¨ Type reduced to uniform continuity in important cases, then one could Theory.
    [Show full text]