ON FIBER DIAMETERS OF CONTINUOUS MAPS



Similar documents
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

Fixed Point Theorems in Topology and Geometry

FIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.

Metric Spaces Joseph Muscat 2003 (Last revised May 2009)

No: Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

Metric Spaces. Chapter 1

MA651 Topology. Lecture 6. Separation Axioms.

THE BANACH CONTRACTION PRINCIPLE. Contents

1. Prove that the empty set is a subset of every set.

Section 1.1. Introduction to R n

Mathematics Course 111: Algebra I Part IV: Vector Spaces

1 if 1 x 0 1 if 0 x 1

Mathematical Methods of Engineering Analysis

Properties of BMO functions whose reciprocals are also BMO

Metric Spaces. Chapter Metrics

CHAPTER 1 BASIC TOPOLOGY

Introduction to Topology

Numerical Analysis Lecture Notes

Baltic Way Västerås (Sweden), November 12, Problems and solutions

Breaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and

SOLUTIONS TO ASSIGNMENT 1 MATH 576

Lectures notes on orthogonal matrices (with exercises) Linear Algebra II - Spring 2004 by D. Klain

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

Continued Fractions and the Euclidean Algorithm

Notes on metric spaces

FIBER PRODUCTS AND ZARISKI SHEAVES

Chapter 7. Continuity

11 Ideals Revisiting Z

Rotation Rate of a Trajectory of an Algebraic Vector Field Around an Algebraic Curve

ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction

The Ideal Class Group

Factoring Patterns in the Gaussian Plane

Surface bundles over S 1, the Thurston norm, and the Whitehead link

About the inverse football pool problem for 9 games 1

Solutions to Homework 10

MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem

ISOMETRIES OF R n KEITH CONRAD

MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao

Ideal Class Group and Units

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

BANACH AND HILBERT SPACE REVIEW

Mathematics for Econometrics, Fourth Edition

Adaptive Online Gradient Descent

TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS

1.7 Graphs of Functions

Cartesian Products and Relations

Mathematics 31 Pre-calculus and Limits

Point Set Topology. A. Topological Spaces and Continuous Maps

1 Norms and Vector Spaces

The Mean Value Theorem

2.3 Convex Constrained Optimization Problems

RIGIDITY OF HOLOMORPHIC MAPS BETWEEN FIBER SPACES

1 Local Brouwer degree

Duality of linear conic problems

Applied Algorithm Design Lecture 5

How To Know The Limit Set Of A Fuchsian Group On A Boundary Of A Hyperbolic Plane

Orthogonal Projections

Lecture 14: Section 3.3

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

How To Prove The Dirichlet Unit Theorem

UNIFORMLY DISCONTINUOUS GROUPS OF ISOMETRIES OF THE PLANE

3. INNER PRODUCT SPACES

INTRODUCTORY SET THEORY

FIBRATION SEQUENCES AND PULLBACK SQUARES. Contents. 2. Connectivity and fiber sequences. 3

Row Ideals and Fibers of Morphisms

Geometric Transformations

FIXED POINT SETS OF FIBER-PRESERVING MAPS

Persuasion by Cheap Talk - Online Appendix

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

THREE DIMENSIONAL GEOMETRY

You know from calculus that functions play a fundamental role in mathematics.

On the existence of G-equivariant maps

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

An example of a computable

Arrangements And Duality

6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives

x a x 2 (1 + x 2 ) n.

F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

1 = (a 0 + b 0 α) (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain

CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC. 1. Introduction

Removing Even Crossings

How To Know If A Domain Is Unique In An Octempo (Euclidean) Or Not (Ecl)

1.3. DOT PRODUCT If θ is the angle (between 0 and π) between two non-zero vectors u and v,

Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA

Pythagorean vectors and their companions. Lattice Cubes

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

The Banach-Tarski Paradox

Tilings of the sphere with right triangles III: the asymptotically obtuse families

A Short Proof that Compact 2-Manifolds Can Be Triangulated

Rolle s Theorem. q( x) = 1

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1

CONTRIBUTIONS TO ZERO SUM PROBLEMS

PETER HÄSTÖ, RIKU KLÉN, SWADESH KUMAR SAHOO, AND MATTI VUORINEN

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

α = u v. In other words, Orthogonal Projection

Advanced Microeconomics

1 VECTOR SPACES AND SUBSPACES

CSU Fresno Problem Solving Session. Geometry, 17 March 2012

Transcription:

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 exists no bound on the diameter of fibers of f. Moreover, we show that when m = 1, the union of small fibers of f is bounded; when m > 1, the union of small fibers need not be bounded. Applications to data analysis are considered. High-dimensional data sets are often difficult to analyze directly and, consequently, methods of simplifying them are important to modern data-intensive sciences. Continuous mappings f : R n R m are frequently used to reduce the dimension of large data sets. Indeed, a classic result of Johnson and Lindenstrauss [6] shows that for N points in any Euclidean space, there exists an injective Lipschitz function which maps these points into R O(log N) with minimal distortion in pairwise distances. However, while continuous maps enjoy many desirable properties, the following suggests that a measure of caution should be exercised before employing them for high-dimensional data analysis. We present a simple proof that for any continuous map f : R n R m, if n > m then there exists no bound on the diameter of fibers of f. Therefore, points can be arbitrarily far apart in R n, yet map to the same point under f. Definition. The fibers of a map f : X Y are the preimages f 1 (y) = {x X : f(x) = y} of points in Y. Definition. The diameter of a set A is the supremum sup{d(x, y) : x, y A}, where d(x, y) denotes the Euclidean distance between x and y. We begin by considering real-valued functions. Proposition. Let f : R n R be a continuous function where n > 1. Then for any M > 0, there exists y R whose fiber has diameter greater than M. Proof. Assume that some M > 0 bounds all fiber diameters. Consider three points a, b, c R n such that the distance between any two is 2M, as in Figure 1. As M bounds the fiber diameters, f(a), f(b), and f(c) must be distinct; without loss of generality, suppose f(a) < f(b) < f(c). By the intermediate value theorem, the line segment ac contains a point x such that f(x) = f(b). As the distance from b to any point on ac is greater than M, the fiber containing b must have diameter greater than M, contradicting our assumption that M bounds all fiber diameters. The intermediate value theorem plays a central role in the proof above, and will turn up again several times in what follows. A generalization of this proposition can be established using the Borsuk-Ulam theorem [1], a result about continuous mappings from an n-sphere S n to R n. Date: September 1, 2015. 1

2 PETER S. LANDWEBER, EMANUEL A. LAZAR, AND NEEL PATEL Figure 1. Three points in R n such that the distance between each pair is 2M. If f(a) < f(b) < f(c), then by the intermediate value theorem there exists a point x on the segment connecting a to c such that f(a) < f(x) = f(b) < f(c), and so x and b belong to the same fiber. Since the distance from x to b is greater than M, M cannot bound all fiber diameters. Theorem (Borsuk-Ulam, 1933). For every continuous map f : S n R n there exist antipodal points x, x S n such that f(x) = f( x). The Borsuk-Ulam theorem holds for n-dimensional spheres of any radius centered at the origin, and also for spheres centered at any point in a Euclidean space of dimension greater than n. In the latter case, the antipodal map is the symmetry about the center of the sphere. We can now show the following. Theorem 1. Let f : R n R m be a continuous map where n > m. Then for any M > 0, there exists y R m whose fiber has diameter greater than M. Proof. Consider an m-sphere S m R n with radius M and centered at the origin. By Borsuk-Ulam, there are antipodal points x, x S m such that f(x) = f( x). The points x and x lie in the same fiber of f and d(x, x) = 2M, so this fiber has diameter at least 2M. An analogous result will hold for any domain X R n in which we can isometrically embed m-spheres of arbitrarily large diameter and any co-domain Y R m, where X and Y are endowed with the subspace topology. Small Fibers At this point we consider the union of all small fibers. For the remainder of the paper, we consider an arbitrarily chosen but fixed M > 0. Definition. We call a nonempty fiber small if its diameter is less than M. Small fiber lemma. Let f : R n R be a continuous map where n > 1. Given three points a, b, c R n such that the distance between each pair is at least M, no more than two belong to small fibers of f. Proof. Assume that a, b, c R n all belong to small fibers. If the distance between each pair is at least M, then f(a), f(b), and f(c) must be distinct; without loss of generality, suppose f(a) < f(b) < f(c). Since the complement in R n of the open ball of radius M centered at b is path-connected, being homeomorphic to the product S n 1 [M, ), a curve can be drawn from a to c such that the distance from b to every point along the curve is at least M. However, by the intermediate

ON FIBER DIAMETERS OF CONTINUOUS MAPS 3 value theorem, for some point x on the curve, f(a) < f(x) = f(b) < f(c). The fiber containing b therefore has diameter at least M, and so cannot be small. We now show that the small fiber lemma places restrictions on the union of small fibers for real-valued functions. Theorem 2. Let f : R n R m be a continuous map where n > m. When m = 1, the union of small fibers is bounded; when m > 1 the union of small fibers can be unbounded. Proof. We begin with the case where m = 1. Recall that a fiber is small if its diameter is less than M. If the union of all small fibers is contained in an open ball of radius M, then of course the union of small fibers is bounded. If the union of all small fibers is not contained in an open ball of radius M, then there must exist points a, b such that both belong to small fibers and such that d(a, b) M. It then follows from the small fiber lemma that for any point x belonging to any small fiber, either d(x, a) < M or else d(x, b) < M. The set of all such points is of course bounded. When m > 1, a simple example shows that the union of small fibers of f can be unbounded. Consider the continuous map f : R n R m given by: (1) f(x 1, x 2,..., x n ) = (x 1, Σ n i=2 x2 i, 0, 0,..., 0). Note that fibers of f are (n 2)-spheres with centers along the x 1 axis. The union of all small fibers is the set of points whose distance to the x 1 axis is less than M/2. Although the union of small fibers is bounded when m = 1, two small fibers can be located arbitrarily far apart. Consider for example the Urysohn-like function f : R n R, for n > 1, given by (2) f(x) = d(x, a) 2 d(x, a) 2 + d(x, b) 2, for distinct points a and b; an example in the case n = 2 is illustrated in Figure 2. With one exception, all fibers of f are (n 1)-spheres whose centers lie on the line that passes through a and b, but not on the segment ab. An additional fiber is the perpendicular bisector of ab, a hyperplane that becomes a sphere when the point at infinity is adjoined. The spherical fibers are smallest when their centers are closest to ab, and grow as their centers move away from it. The distance between the sets of small fibers can be made arbitrarily large by moving a and b arbitrarily far apart. Small Fibers and Boundedness Aside from illustrating that small fibers can be located arbitrarily far apart, Figure 2 also highlights a general property of continuous real-valued functions with small fibers. In particular, we can use an approach similar to that used in proving the small fiber lemma to show the following. Theorem 3. Let f : R n R be a continuous function where n > 1. If f has a small fiber, then f is bounded from above or from below. Further, if a, b R n both belong to small fibers and d(a, b) M, then f is bounded from above and below.

4 PETER S. LANDWEBER, EMANUEL A. LAZAR, AND NEEL PATEL Figure 2. Circular fibers of a continuous function f : R 2 R given by (2). All small fibers are contained in two regions centered near a and b; these regions can be located arbitrarily far apart. Proof. If f has a small fiber f 1 (y), then this fiber is contained in some closed ball B of radius M; since B is closed, f is bounded on it. If f is unbounded from above and from below, then there exist points a, b B such that f(a) < y < f(b). As in the proof of the small fiber lemma, since the complement of B in R n is path-connected, a curve can be drawn in it from a to b. By the intermediate value theorem there exists a point x on that curve such that y = f(x), and so the fiber over y is not small, contradicting our assumption. The second part of the theorem can be proven in a similar manner. If a, b R n both belong to small fibers and d(a, b) M, then f(a) and f(b) must be distinct; without loss of generality, suppose f(a) < f(b). Consider the closed ball B of radius M centered at b. Since B is closed, f is bounded on it. If f is unbounded from above, then there exists a point c B such that f(a) < f(b) < f(c). As above, a curve can be drawn from a to c such that the distance from b to every point along the curve is at least M. By the intermediate value theorem, there exists a point x along that curve such that f(x) = f(b). Since d(x, b) M, b cannot belong to a small fiber, contradicting our assumption and showing that f must be bounded from above. An analogous argument shows that f is bounded from below. Note that discontinuous functions, even those that are bounded, integrable, and decay to zero, need not have fibers of arbitrarily large diameter. Consider, for example, the following function f : R 2 R: 1 x 1 y 2 3 x 0, y 0 1 x 1 y f(x, y) = 5 7 x < 0, y 0 (3) 1 x 1 y 11 13 x 0, y < 0 y x < 0, y < 0. 1 17 x 1 19 Here f takes a unique rational value on each unit square in the plane, and so every nonempty fiber of f has diameter 2. Note that f tends to 0 as x 2 + y 2 tends to. Moreover, f is in L 1 and L, and hence in L p for all 1 p. This example can be generalized for arbitrary n > m, with a suitable choice of prime numbers. Conclusions The analysis above provides a cautionary tale for data science analysts. The use of continuous maps to reduce the dimension of point sets in high-dimensional

ON FIBER DIAMETERS OF CONTINUOUS MAPS 5 Euclidean spaces entails what we might call the curse of continuity there will exist points arbitrarily far apart that are identified under such maps. Not only will knowledge of f(x) not allow us to recover x exactly, but we will generally be unable to determine x to within any finite error. Under suitable restriction of the domain this issue might be avoided, but knowledge of such restrictions is not always available a priori. In contrast, discontinuous mappings suffer no such inherent limitations. Equation (3), for example, can be scaled such that its fibers are n-dimensional cubes of edge length ɛ. The diameter of each fiber is then precisely ɛ n. Knowledge of f(x) then allows us to determine x to within a maximal error ɛ n. An application highlighting some limitations of continuous maps in analyzing structure in large point sets can be found in [7]. In computational materials science research, continuous order parameter mappings are often constructed to summarize structural information near each particle in a system of particles. This order parameter is subsequently used to identify larger-scale structural features of the system. The continuity of the order-parameter entails that points arbitrarily far apart in a relevant configuration space will map to the same order-parameter value. Consequently, continuous order-parameters regularly fail to distinguish structurally distinct configurations of points, making automated analysis difficult or impossible. In that paper, the authors suggest a discrete order-parameter, based on Voronoi cell topology, which largely avoids this degeneracy. We note that Theorem 1 can be obtained as a consequence of Corollary 0.3 in [4], though the proof here is simpler. Also, a similar result for proper mappings can be found as a consequence of an exercise presented at the end of Section 3.3 in [2]. Finally, Theorem 1 can also be obtained as a simple corollary of what Larry Guth has called the Large fiber lemma [3, Section 7.6], [5, Section 6], itself a corollary of the Lebesgue covering lemma which is used in topological dimension theory. Large fiber lemma. If f : [0, 1] n R m is a continuous map where n > m, then one of the fibers of f has diameter at least 1. The technique used in the proof of Theorem 1 can also be used to strengthen this lemma in two ways. First, we can replace the unit n-cube with the inscribed (n 1)-sphere of unit diameter. Second, the inequality of the conclusion becomes an equality. Questions This paper is concerned with fibers in R n equipped with the standard Euclidean metric. It is easily shown that Theorem 1 can fail when R n is equipped with other metrics. For example, we can map R 2 homeomorphically to the cylinder capped by a half-sphere on one end and unbounded on the other. If the origin is mapped to the center of the spherical cap, then fibers of the distance function to the origin are circles whose diameters are all bounded by that of the cylinder. Thus, one might wonder about necessary and sufficient conditions on the metric for Theorem 1 to hold. In this paper, we proved that the union of small fibers can have unbounded diameter when m > 1. However, one might ask if there must exist a line through the origin in R n onto which the projection of this set is bounded. If so, is there a lower bound on the number of such orthogonal lines, depending on n and m?

6 PETER S. LANDWEBER, EMANUEL A. LAZAR, AND NEEL PATEL Acknowledgements The authors would like to thank the anonymous referee for numerous helpful remarks on an earlier draft. References [1] K. Borsuk, Drei Sätze über die n-dimensionale euklidische Sphäre. Fund. Math. 20 (1933) 177 190. [2] B. H. Bowditch, A Course on Geometric Group Theory, MSJ Memoirs, Vol. 16, Mathematical Society of Japan, Tokyo, 2006. [3] D. Burago et al., A few snapshots from the work of Mikhail Gromov, in The Abel Prize 2008-2012, H. Holden and R. Piene, eds., Springer, 2014, 139 234. [4] D. Calegari, A degree one Borsuk-Ulam theorem. Bull. Aust. Math. Soc. 61 (2000) 267 268. [5] L. Guth, Metaphors in systolic geometry, in Proc. Intern. Congr. Math., Vol. II, Hindustan Book Agency, New Delhi, 2010, 745 768. [6] W. B. Johnson and J. Lindenstrauss, Extensions of Lipschitz mappings into a Hilbert space, in Conference in Modern Analysis and Probability New Haven 1982, Vol. 26, American Mathematical Society, Providence, RI, 1984, 189 206. [7] E. A. Lazar, J. Han and D. J. Srolovitz, A topological framework for local structure analysis in condensed matter (2015), http://arxiv.org/abs/1508.05937. Department of Mathematics, Rutgers University, Piscataway, NJ 08854 E-mail address: landwebe@math.rutgers.edu Department of Mathematics, University of Pennsylvania, Philadelphia, PA 19104 E-mail address: mlazar@math.upenn.edu URL: www.math.upenn.edu/~mlazar Department of Mathematics, University of Pennsylvania, Philadelphia, PA 19104 E-mail address: neelpa@sas.upenn.edu URL: www.math.upenn.edu/~neelpa