The Great Wall of David Shin
|
|
- Andrea McCoy
- 5 years ago
- Views:
Transcription
1 The Great Wall of David Shin Tiankai Liu 115 June 015 On 9 May 010, David Shin posed the following puzzle in a Facebook note: Problem 1. You're blindfolded, disoriented, and standing one mile from the Great Wall of China. How far do you have to walk to guarantee that you will run into the wall? Assume that the wall is innitely long and straight. Though Ian Le posted the correct answer on 7 August, no one posted a proof of optimality. After various unhelpful remarks by the author, such as yan and i convinced each other that we have an convincing argument, the problem seems to have languished for nearly half a decade. Update (19 January 016): Never mind, the proof was given in H. Joris, Le chasseur perdu dans la forêt, Elemente der Mathematik 35 (1), 10 January It is available at 0_0.pdf. 1 The shortest path Before giving the answer to Problem 1, let us slightly reformulate the problem. Let O be the origin in the real plane R, and let be the closed unit disk, = {(x, y) R x + y 1}. Problem 1 asks for the shortest curve C starting at O that (a) meets every line tangent to. We claim this is equivalent to saying (b) the convex hull H of C contains. Proof. To show (a) implies (b): If H misses some point P, then, since H is the intersection of all open half-planes containing C, there must exist some open half-plane R + containing C but not P. Say R + is bounded by the line l ; then let l be the unique line parallel to l, tangent to, and lying outside R +. Then evidently C fails to meet l. To show (b) implies (a): If C fails to meet a line l tangent to at a point P, then C lies entirely in the open half-plane R + containing O and bounded by l. Since R + is convex, the convex hull H also lies in R +, and in particular P / H. 1
2 x = -1 y A (-, 0) O = (0, 0) x B = (-1, -1) (0, -1) Figure 1: The optimal path Let us say a curve C starting at O touches the Great Wall of Shin if it starts at O and satises the equivalent conditions (a) and (b). Problem 1 asks for the minimum possible length of C. The answer is 3 + 7π 6 at (0, 0), and walk straight for 3 1 miles, say, to A := ( 1, + 1 and can be realized by the following curve (Figure 1). Start 3 ). Make a 10 turn and walk 1 straight for 3 mile, say, to ( 1, 3), which lies on. Without making an abrupt turn, walk 7π miles around, to (0, 1). Continue straight for 1 mile, to B := ( 1, 1), and stop. 6 This curve clearly satises condition (b), and therefore touches the Great Wall of Shin. The proof of optimality We would like to show that the curve of length 3 + 7π + 1 in answer to Problem 1 cannot 6 be beaten. For technical reasons, we would like to restrict our attention to contenders that are polygonal paths. 1 Here's why this reduction is justied: Lemma. If C is a nite-length curve that touches the Great Wall of Shin, then for every ɛ > 0 there exists a polygonal path C, also touching the Great Wall of Shin, that has length at most C + ɛ. Proof. Fix some 0 < δ 1. Let O = P 0, P 1,..., P n 1 I'll use path interchangeably with rectiable curve, so paths may intersect themselves. I only feel like doing this because it sounds weird to talk about straight paths as curves.
3 be points on C, spaced less than δ apart in arc length, such that P n is the endpoint of C. Then every point of C is within δ/ of one of the points P i. Therefore, every point of the convex hull of C, being a weighted average of points of C, is also with δ/ of the convex hull H of {P 0,..., P n }. It follows that the disk of radius 1 δ centered at the origin lies within H. Therefore, if we let C be the polygonal path obtained from P 0 P n via a dilation of ratio 1/(1 δ ) from the origin, then C < C 1 δ and C touches the Great Wall of Shin. For suciently small δ depending on C, we can ensure that C C + ɛ, as desired. Therefore, the solution to Problem 1 is completed by the following Proposition: Proposition 3. For any n N and any points P 1,..., P n R, let P denote the polygonal path OP 1 P n, and H the convex hull of {O, P 1,..., P n }. Suppose that P touches the Great Wall of Shin. Then P must have length greater than 3 + 7π Proof. Our proof proceeds by a sequence of reductions. Let us say P is non-redundant if, for any i {1,..., n}, the convex hull of {O, P 1,..., P i,..., P n } does not contain. P is non-self-intersecting if the interiors of the line segments OP 1, P 1 P,..., P n 1 P n are pairwise disjoint. (Caution: a priori we allow the endpoint of one segment to lie in the interior of another segment, so our denition may be a bit dierent from standard terminology.) The violence of P is the number of segments P k 1 P k ( k n) that cut in two. We say P is non-violent if its violence equals zero. Given any polygonal path P that touches the Great Wall of Shin, we will explain how to construct another one, P, of lesser or equal length, that is non-redundant, non-selfintersecting, and non-violent. Then we will prove Proposition 3 for P under these additional assumptions. Step 1: Reduction to non-redundant P. This should be pretty obvious; we just repeatedly throw away one redundant vertex at a time. Henceforth, assume P is non-redundant. Let us pause and introduce some new notation. The convex hull H of {O, P 1,..., P n } is a polygon with exactly n vertices, namely P 1,..., P n. However, a priori, these vertices may not be in order. So let us write A 0,..., A n 1, with indices taken modulo n, to be the vertices of H in some order (either clockwise or counterclockwise). The following lemma is pretty obvious, and I will dispense with the proof. We say that a closed line segment σ cuts a convex region R R in two if R\σ is disconnected. 3
4 Lemma 4. With A 0,..., A n 1 arising as above from a non-redundant path that touches the Great Wall of Shin, let i and j be two dierent members of Z/nZ. Then there are two mutually exclusive possibilities: (a) j = i ± 1, and the segment A i A j is either disjoint from or tangent to the unit circle. (b) j i ± 1, and the segment A i A j cuts in two. It also cuts H in two, and any line segment joining points of these two components together must meet the segment A i A j. Step : Reduction to non-self-intersecting P. Recall that we are assuming P is nonredundant. For this step, imagine that the set {P 1,..., P n } is xed. There are n! polygonal paths that start at O and visit all the points of {P 1,..., P n } in some order. Each such path is non-redundant and touches the Great Wall of Shin. Therefore, we may assume that, among all n! such paths, P = OP 1 P n happens to be one of minimum length. We claim that this implies that P is non-self-intersecting. If not, there exist 1 i < j n such that the interiors of segments P i 1 P i and P j 1 P j meet, where we temporarily write P 0 for O for the duration of Step. There are two cases to consider. Case 1: The segments P i 1 P i and P j 1 P j meet transversely at a point X. Then by the triangle inequality so P i 1 P i + P j 1 P j = P i 1 X + XP i + P j 1 X + XP j P := P 0 P i 1 }{{} increasing indices = P i 1 X + XP j 1 + P i X + XP j > P i 1 P j 1 + P i P j, decreasing indices {}}{ P j 1 P i P j P n }{{} increasing indices is strictly shorter than P, a contradiction. Case : The segments P i 1 P i and P j 1 P j are collinear. This is an unusual situation: since P 1,..., P n are all vertices of the convex polygon H, it must be that (i, j) = (0, 1), and O P 1 P. In particular, P 1 P cuts in two. Therefore, by Lemma 4, P 1 P also cuts H in two. There must then exist some k {3,..., n} such that P k 1 and P k lie in dierent components of H\P 1 P. But this means that P 1 P and P k 1 P k intersect transversely, as in Case 1 above, which was shown to be impossible. Therefore, Case is also impossible. Henceforth, we may assume that P is non-self-intersecting. Step 3: Reduction to non-violent P. Recall that we are assuming P is non-redundant and non-self-intersecting. Assuming that the violence v of P is positive, we will construct a non-redundant, non-self-intersecting path Q = OQ 1 Q m 4
5 that touches the Great Wall of Shin, has violence equal to v 1, and has length at most the length of P. (Possibly m > n, but this does not matter.) Since v > 0, we may let k {,..., n} be the largest index for which P k 1 P k cuts (and therefore also H) in two. By maximality of k, Lemma 4 implies that P k, P k+1,..., P n must traverse some of the vertices of the convex polygon H in order. So without loss of generality, let us suppose A i = P i for k i n. Since P is non-self-intersecting, Lemma 4(b) tells us that P 1,..., P k must all lie in one component of H\P k 1 P k, and P k+1,..., P n must all lie in the other component. It follows that A 1 = P k 1. And since P touches the Great Wall of Shin, we must have 3 k n 1. Therefore, it makes sense to let R and R + be the two open half-planes, separated by the line P k 1 P k, that contain P k and P n, respectively. Set Q i = P i for i k 1. If it happens that P k 1 P n = A 1 A n A 1 A k = P k 1 P k, (1) then we may simply let Q := O P 1 P k 1 }{{} increasing indices decreasing indices {}}{ P n P k, and be done; Q has violence v 1 because P k 1 P n = A 1 A n no longer cuts H in two, and inequality (1) ensures that Q is not longer than P. Unfortunately, we cannot simply assume that inequality (1) holds, but there is an easy x. Let l be the unique line through P k 1 that is tangent to at a point T R +. Note that the path P k P n must meet l at some point, because P k P k 1 cuts in two but P n P k 1 doesn't. Intuitively, we want to consider the shortest curve γ from P k to anywhere on the line l that lies entirely within the closure of R + \, and replace the path P k P n by a suciently good polygonal approximation P k P m of C, so that by setting Q := O P 1 P k 1 }{{} increasing indices decreasing indices {}}{ P m P k, () we can carry on just as above. To say this rigorously, we claim that there is a unique shortest path γ from P k to l within clos(r + \ ), namely: Case 1: γ is the perpendicular from P k to l, if this perpendicular lies in clos(r + \ ). Case : Otherwise, let X, Y R + be the unique points such that P k X is tangent to, and OY l. Let Z be the foot of the perpendicular from Y to l, so that Y Z is tangent to. Then γ is the union of the segment P k X, the arc XY of in R +, and the segment Y Z. 5
6 The rst case is trivial. In the second case, it is easy to deduce from Proposition 5 in the Appendix that the shortest path γ exists and is (in the notation of that Proposition) of the form γ(p k, W ;, R + ) for some W on the ray P k T beyond T. Such a γ comes in three parts: a line segment starting from P k, an arc of, and nally a line segment ending on W. The nal line segment must be perpendicular to l, or else γ could be shortened by replacing a tiny portion of the end with a segment perpendicular to l. Thus, W must be the point Z dened above, as claimed. So indeed we can dene P k P m and Q by equation () above, such that P m is the endpoint of γ. (In case, we can perform the polygonal approximation in such a way that P i 1 P i is tangent to for every i {k + 1,..., m}.) We must verify that P k 1 P k P k 1 P m. To this end, note that, since P is non-self-intersecting, the interiors of segments OP 1 and P k 1 P k are disjoint, so O doesn't lie in R +. Then it is easy to see that the distance to P k 1 decreases monotonically as we travel along γ from P k to P m. So indeed we have replaced P by a shorter, less violent Q. Henceforth, we may assume P is non-violent. Step 4: Solution for non-violent P. Since P is non-redundant and non-violent, the path P 1 P n must avoid int( ) entirely, and therefore Lemma 4 implies that it must wind around in order, so that we may assume P i = A i for all i {1,..., n}. If P n P 1 isn't tangent to, then we can always move P n closer to P n 1 so that it is tangent. Let l = P n P 1, and let R + be the open half-plane bounded by l and containing most of. Then Proposition 5 applies directly, and it suces to show that, if (using the notation of that Proposition) C := OA γ(a, B;, R + ) for two points A, B l on opposite sides of the point l, then then C 3 + 7π Let's impose some coordinates to help with the calculation (see Figure 1). Say l is the line x = 1 and A = ( 1, a) for some a > 0. As in Step 3, our ability to wiggle B along l implies that the nal straight segment of γ is perpendicular to l, so that B = ( 1, 1). By reecting O across l, we see that A is optimal when the ray from (, 0) to A is tangent to, or in other words a = 1 3. Then C is exactly the curve given as the answer in Section 1. This completes the proof of Proposition 3 and the solution to Problem 1. Appendix: Paths avoiding convex bodies Here we prove a basic fact (Proposition 5) about paths with given endpoints that avoid a given convex region of the plane, which was used in steps 3 and 4 of the proof of Proposition 3 above. Let A, B R be two distinct points, and R + R one of the open half-planes bounded by the line AB. Let D R be a compact, strictly 3 convex set such that A, B / D, but D meets both R + and the line segment AB. 3 By strictly we mean every line either splits D in two, or else meets D in at most one point. However, the strictness assumption is not essential, and we include it only to avoid a few technical annoyances. 6
7 Let A denote the unique point on D R + such that AA D = {A }. Dene B D R + likewise with respect to B. Let γ(a, B; D, R + ) denote the path from A to B that consists of the line segment AA, the arc along D from A to B inside R +, and the line segment B B. Proposition 5. With the above notation and assumptions, γ := γ(a, B; D, R + ) is the shortest path from A to B that lies in R + (except at its endpoints) and avoids the interior of D. Proof. Suppose for the sake of contradiction that there were a shorter alternative β to γ. Step 1: Reduction to the case where β is polygonal. any point O D AB, and let { ɛ := min dist({a, B}, D), Choose a sequence of points } η 3 dist(o, β), η 6 γ > 0. A = P 0, P 1,..., P n, P n+1 = B Fix η := 1 β γ > 0. Choose along β, spaced less than ɛ apart in arc length along β. For each i {1,..., n}, let Q i be the point on the ray OP i lying a distance 3ɛ beyond P i. Let β be the polygonal path AQ 1 Q n B. We claim that β avoids D. Since ɛ dist({a, B}, D) and, by assumption, AP 0, P n B < ɛ, it is easy to see that the segments AQ 1 and Q n B avoid D. We claim that all segments Q i Q i+1 avoid D as well. Indeed, suppose for the sake of contradiction that X D Q i Q i+1. By the law of cosines, OP i + OP i+1 OP i OP i+1 cos P i OP i+1 = P i P i+1, so Moreover, 0 1 cos P i OP i+1 = P ip i+1 ( OP i OP i+1 ) OP i OP i+1 P i P i+1 OP i OP i+1. Q i Q i+1 = OQ i + OQ i+1 OQ i OQ i+1 cos Q i OQ i+1 = (3ɛ + OP i ) + (3ɛ + OP i+1 ) (3ɛ + OP i )(3ɛ + OP i+1 ) cos P i OP i+1 = P i P i+1 + 6ɛ(3ɛ + OP i + OP i+1 )(1 cos P i OP i+1 ), Since OP i, OP i+1 dist(o, β) 3ɛ η, 7
8 we therefore have and In particular, and 1 Q iq i+1 P i P i ɛ(3ɛ + OP i + OP i+1 ) OP i OP i+1 1 Q iq i+1 P i P i+1 Q i X Q i Q i+1 (1 + η) P i P i+1 < ɛ, 1 + η + η + η = (1 + η), 1 + η. (3) OX OQ i Q i X > OP i + 3ɛ ɛ = OP i + ɛ. Now between P i and P i+1, by assumption, the arc of β has length less than ɛ, and yet this arc must meet the ray OX at some point Y outside int(d). So P i Y OY OP i OX OP i > ɛ, by the previous inequality. This is a contradiction, so our assumption of the existence of X must have been false. So indeed the polygonal path β is disjoint from D. Moreover, inequality (3) implies that β < P 1 Q 1 + (1 + η) β + P n Q n = (1 + η) β + 6ɛ (1 + η)(1 η) γ + η γ = γ. We have thus reduced to the case where β is a polygonal path, which henceforth we will call where P 0 = A and P n+1 = B. P := P 0 P n+1, Step : Reduction to the case where each segment P i P i+1 meets D at one point. Let us induct primarily on n (the number of intermediate vertices in the polygonal path P), and, in cases of equal n, on the number of segments P i P i+1 (0 i n) disjoint from D. If, for some pair of indices (i, j) (0, n+1) with j i+, the segment P i P j fails to cut in two, then throw away P i+1,..., P j 1. The resulting polygonal path P := P 0 P i P j P n is no longer than the original P, so we are done by induction on n. Therefore, we may assume that no such pair (i, j) exists. If there exists a segment of the form P i P i+1 disjoint from D, then either i 0 or i n. Without loss of generality, assume the former. Then, as either (i 1, i + 1) = (0, n) or P i 1 P i+1 cuts D in two, there must exist a unique point P i strictly between P i and P i+1 such that P i 1 P i meets D in exactly one point. Then replacing P i by P i, we are done by induction, since n stays the same, and the polygonal path P := P 0 P i 1 P i P i+1 P n+1 is shorter than P and has fewer segments disjoint from D. So we are reduced to the case where P i P i+1 meets D at a unique point W i, for every i {0,..., n}. Then W 0 = A and W n = B. Moreover, since all segments of the form P i P i+ cut D in two, we must have W i W i+1. It follows that W 0,..., W n are in order along the arc of D in R +. 8
9 Step 3: a local calculation. It remains to show that, for i {1,..., n}, W i 1 W i D < W i 1 P i + P i W i, where W i 1 W i D denotes the length of the arc between W i 1 and W i along D in R +. To this end, let us introduce some coordinates. Suppose that P i = (0, 0) R, and the y-axis bisects W i 1 P i W i, so that W i 1 = ( a, ta) and W i = (b, tb) for some a, b, t > 0. The arc of D in question is the graph of a convex function f : [ a, b] R 0 with f( a) = ta and f(b) = tb; this graph remains above the graph of for all x [ a, b]. Then if f is dierentiable, convexity says so that W i 1 W i D = ˆ b a x t x t f (a) f (x) f(b) t, 1 + f (x) dx (a + b) 1 + t = W i 1 P i + P i W i, as needed. If f is not dierentiable, the same idea works by taking piecewise linear approximations to f. 9
A Pair in a Crowd of Unit Balls
Europ. J. Combinatorics (2001) 22, 1083 1092 doi:10.1006/eujc.2001.0547 Available online at http://www.idealibrary.com on A Pair in a Crowd of Unit Balls K. HOSONO, H. MAEHARA AND K. MATSUDA Let F be a
More informationMathematics 5 Worksheet 14 The Horizon
Mathematics 5 Worksheet 14 The Horizon For the problems below, we will assume that the Earth is a sphere whose radius is 4,000 miles. Note that there are 5,280 feet in one mile. Problem 1. If a line intersects
More informationTOPICS IN GEOMETRY: THE GEOMETRY OF THE EUCLIDEAN PLANE. 1. Introduction
TOPIS IN GEOMETRY: THE GEOMETRY OF THE EULIEN PLNE TUGHT Y PIOTR PRZYTYKI. NOTES Y YLN NT. Note. These course notes are based on a course taught by Piotr Przytycki at McGill University in the fall of 2016.
More information12 Inversion by a Circle
12 Inversion by a Circle 12.1 Definition and construction of the inverted point Let D be a open circular disk of radius R and center O, and denote its boundary circle by D. Definition 12.1 (Inversion by
More informationMA 323 Geometric Modelling Course Notes: Day 11 Barycentric Coordinates and de Casteljau s algorithm
MA 323 Geometric Modelling Course Notes: Day 11 Barycentric Coordinates and de Casteljau s algorithm David L. Finn December 16th, 2004 Today, we introduce barycentric coordinates as an alternate to using
More informationRose-Hulman Undergraduate Mathematics Journal
Rose-Hulman Undergraduate Mathematics Journal Volume 17 Issue 1 Article 5 Reversing A Doodle Bryan A. Curtis Metropolitan State University of Denver Follow this and additional works at: http://scholar.rose-hulman.edu/rhumj
More informationUniqueness of Optimal Cube Wrapping
CCCG 014, Halifax, Nova Scotia, August 11 13, 014 Uniqueness of Optimal Cube Wrapping Qinxuan Pan EECS, MIT qinxuan@mit.edu Abstract Consider wrapping the unit cube with a square without stretching or
More informationDefinitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg
Definitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg Undefined Terms: Point, Line, Incident, Between, Congruent. Incidence Axioms:
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationDefinitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg ( )
Definitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg (2005-02-16) Logic Rules (Greenberg): Logic Rule 1 Allowable justifications.
More informationExercises for Unit V (Introduction to non Euclidean geometry)
Exercises for Unit V (Introduction to non Euclidean geometry) V.1 : Facts from spherical geometry Ryan : pp. 84 123 [ Note : Hints for the first two exercises are given in math133f07update08.pdf. ] 1.
More informationDiscrete Geometry. Problem 1. Austin Mohr. April 26, 2012
Discrete Geometry Austin Mohr April 26, 2012 Problem 1 Theorem 1 (Linear Programming Duality). Suppose x, y, b, c R n and A R n n, Ax b, x 0, A T y c, and y 0. If x maximizes c T x and y minimizes b T
More informationARE202A, Fall Contents
ARE202A, Fall 2005 LECTURE #2: WED, NOV 6, 2005 PRINT DATE: NOVEMBER 2, 2005 (NPP2) Contents 5. Nonlinear Programming Problems and the Kuhn Tucker conditions (cont) 5.2. Necessary and sucient conditions
More informationHW Graph Theory SOLUTIONS (hbovik) - Q
1, Diestel 3.5: Deduce the k = 2 case of Menger s theorem (3.3.1) from Proposition 3.1.1. Let G be 2-connected, and let A and B be 2-sets. We handle some special cases (thus later in the induction if these
More informationGreen s Theorem in the Plane
hapter 6 Green s Theorem in the Plane Introduction Recall the following special case of a general fact proved in the previous chapter. Let be a piecewise 1 plane curve, i.e., a curve in R defined by a
More informationA PLANAR SOBOLEV EXTENSION THEOREM FOR PIECEWISE LINEAR HOMEOMORPHISMS
A PLANAR SOBOLEV EXTENSION THEOREM FOR PIECEWISE LINEAR HOMEOMORPHISMS EMANUELA RADICI Abstract. We prove that a planar piecewise linear homeomorphism ϕ defined on the boundary of the square can be extended
More informationThe Multi-Agent Rendezvous Problem - Part 1 The Synchronous Case
The Multi-Agent Rendezvous Problem - Part 1 The Synchronous Case J. Lin 800 Phillips Road MS:0128-30E Webster, NY 14580-90701 jie.lin@xeroxlabs.com 585-422-4305 A. S. Morse PO Box 208267 Yale University
More informationDefinitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg ( )
Definitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg (2009-03-26) Logic Rule 0 No unstated assumptions may be used in a proof.
More information36th United States of America Mathematical Olympiad
36th United States of America Mathematical Olympiad 1. Let n be a positive integer. Define a sequence by setting a 1 = n and, for each k > 1, letting a k be the unique integer in the range 0 a k k 1 for
More informationSMT Power Round Solutions : Poles and Polars
SMT Power Round Solutions : Poles and Polars February 18, 011 1 Definition and Basic Properties 1 Note that the unit circles are not necessary in the solutions. They just make the graphs look nicer. (1).0
More informationarxiv:math/ v1 [math.dg] 25 Feb 2005
arxiv:math/0502551v1 [math.dg] 25 Feb 2005 A GENERALIZATION OF RADO S THEOREM FOR ALMOST GRAPHICAL BOUNDARIES BRIAN DEAN AND GIUSEPPE TINAGLIA Abstract. In this paper, we prove a generalization of Rado
More informationConnectedness. Proposition 2.2. The following are equivalent for a topological space (X, T ).
Connectedness 1 Motivation Connectedness is the sort of topological property that students love. Its definition is intuitive and easy to understand, and it is a powerful tool in proofs of well-known results.
More informationSydney University Mathematical Society Problems Competition Solutions.
Sydney University Mathematical Society Problems Competition 005 Solutions 1 Suppose that we look at the set X n of strings of 0 s and 1 s of length n Given a string ɛ = (ɛ 1,, ɛ n ) X n, we are allowed
More informationSolutions and scoring for 1st Midterm Exam Geometry 515 Fall Oct 2 Mon 4:00-5:20 pm
Solutions and scoring for 1st Midterm Exam Geometry 515 Fall 2017 Oct 2 Mon 4:00-5:20 pm 1. On the line AB you have the point O between the points A and B (i.e. rays OA and OB form a straight angle AOB).
More informationIsometries. Chapter Transformations of the Plane
Chapter 1 Isometries The first three chapters of this book are dedicated to the study of isometries and their properties. Isometries, which are distance-preserving transformations from the plane to itself,
More informationAfter taking the square and expanding, we get x + y 2 = (x + y) (x + y) = x 2 + 2x y + y 2, inequality in analysis, we obtain.
Lecture 1: August 25 Introduction. Topology grew out of certain questions in geometry and analysis about 100 years ago. As Wikipedia puts it, the motivating insight behind topology is that some geometric
More informationDef. A topological space X is disconnected if it admits a non-trivial splitting: (We ll abbreviate disjoint union of two subsets A and B meaning A B =
CONNECTEDNESS-Notes Def. A topological space X is disconnected if it admits a non-trivial splitting: X = A B, A B =, A, B open in X, and non-empty. (We ll abbreviate disjoint union of two subsets A and
More information(x 1, y 1 ) = (x 2, y 2 ) if and only if x 1 = x 2 and y 1 = y 2.
1. Complex numbers A complex number z is defined as an ordered pair z = (x, y), where x and y are a pair of real numbers. In usual notation, we write z = x + iy, where i is a symbol. The operations of
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)
More informationInternational Mathematics TOURNAMENT OF THE TOWNS
International Mathematics TOURNAMENT OF THE TOWNS Senior A-Level Paper Fall 2010 1 1 There are 100 points on the plane All 4950 pairwise distances between two points have been recorded (a) A single record
More informationON SPACE-FILLING CURVES AND THE HAHN-MAZURKIEWICZ THEOREM
ON SPACE-FILLING CURVES AND THE HAHN-MAZURKIEWICZ THEOREM ALEXANDER KUPERS Abstract. These are notes on space-filling curves, looking at a few examples and proving the Hahn-Mazurkiewicz theorem. This theorem
More informationAN INTRODUCTION TO THE FUNDAMENTAL GROUP
AN INTRODUCTION TO THE FUNDAMENTAL GROUP DAVID RAN Abstract. This paper seeks to introduce the reader to the fundamental group and then show some of its immediate applications by calculating the fundamental
More informationINTRODUCTION TO NETS. limits to coincide, since it can be deduced: i.e. x
INTRODUCTION TO NETS TOMMASO RUSSO 1. Sequences do not describe the topology The goal of this rst part is to justify via some examples the fact that sequences are not sucient to describe a topological
More informationWeek 3: Faces of convex sets
Week 3: Faces of convex sets Conic Optimisation MATH515 Semester 018 Vera Roshchina School of Mathematics and Statistics, UNSW August 9, 018 Contents 1. Faces of convex sets 1. Minkowski theorem 3 3. Minimal
More information1.1 Line Reflections and Point Reflections
1.1 Line Reflections and Point Reflections Since this is a book on Transformation Geometry, we shall start by defining transformations of the Euclidean plane and giving basic examples. Definition 1. A
More informationBaltic Way 2008 Gdańsk, November 8, 2008
Baltic Way 008 Gdańsk, November 8, 008 Problems and solutions Problem 1. Determine all polynomials p(x) with real coefficients such that p((x + 1) ) = (p(x) + 1) and p(0) = 0. Answer: p(x) = x. Solution:
More informationCauchy s Theorem (rigorous) In this lecture, we will study a rigorous proof of Cauchy s Theorem. We start by considering the case of a triangle.
Cauchy s Theorem (rigorous) In this lecture, we will study a rigorous proof of Cauchy s Theorem. We start by considering the case of a triangle. Given a certain complex-valued analytic function f(z), for
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 informationGreen s Theorem in the Plane
hapter 6 Green s Theorem in the Plane Recall the following special case of a general fact proved in the previous chapter. Let be a piecewise 1 plane curve, i.e., a curve in R defined by a piecewise 1 -function
More informationHMMT November 2013 Saturday 9 November 2013
. [5] Evaluate + 5 + 8 + + 0. 75 There are 0 HMMT November 0 Saturday 9 November 0 Guts Round = 4 terms with average +0, so their sum is 7 0 = 75.. [5] Two fair six-sided dice are rolled. What is the probability
More informationRichard DiSalvo. Dr. Elmer. Mathematical Foundations of Economics. Fall/Spring,
The Finite Dimensional Normed Linear Space Theorem Richard DiSalvo Dr. Elmer Mathematical Foundations of Economics Fall/Spring, 20-202 The claim that follows, which I have called the nite-dimensional normed
More informationDecompositions of graphs into cycles with chords
Decompositions of graphs into cycles with chords Paul Balister Hao Li Richard Schelp May 22, 2017 In memory of Dick Schelp, who passed away shortly after the submission of this paper Abstract We show that
More informationGLOBAL PROPERTIES OF PLANE AND SPACE CURVES
GLOBAL PROPERTIES OF PLANE AND SPACE CURVES KEVIN YAN Abstract. The purpose of this paper is purely expository. Its goal is to explain basic differential geometry to a general audience without assuming
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 informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 3
EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 3 Induction Induction is an extremely powerful tool in mathematics. It is a way of proving propositions that hold for all
More informationLECTURE-13 : GENERALIZED CAUCHY S THEOREM
LECTURE-3 : GENERALIZED CAUCHY S THEOREM VED V. DATAR The aim of this lecture to prove a general form of Cauchy s theorem applicable to multiply connected domains. We end with computations of some real
More informationTopological properties of Z p and Q p and Euclidean models
Topological properties of Z p and Q p and Euclidean models Samuel Trautwein, Esther Röder, Giorgio Barozzi November 3, 20 Topology of Q p vs Topology of R Both R and Q p are normed fields and complete
More informationOn the maximum number of isosceles right triangles in a finite point set
On the maximum number of isosceles right triangles in a finite point set Bernardo M. Ábrego, Silvia Fernández-Merchant, and David B. Roberts Department of Mathematics California State University, Northridge,
More informationRevisiting Poincaré's Theorem on presentations of discontinuous groups via fundamental polyhedra
Revisiting Poincaré's Theorem on presentations of discontinuous groups via fundamental polyhedra E. Jespers a, A. Kiefer a, Á. del Río b a Department of Mathematics, Vrije Universiteit Brussel, Pleinlaan
More informationRamsey Theory. May 24, 2015
Ramsey Theory May 24, 2015 1 König s Lemma König s Lemma is a basic tool to move between finite and infinite combinatorics. To be concise, we use the notation [k] = {1, 2,..., k}, and [X] r will denote
More information1. Vectors and Matrices
E. 8.02 Exercises. Vectors and Matrices A. Vectors Definition. A direction is just a unit vector. The direction of A is defined by dir A = A, (A 0); A it is the unit vector lying along A and pointed like
More information(D) (A) Q.3 To which of the following circles, the line y x + 3 = 0 is normal at the point ? 2 (A) 2
CIRCLE [STRAIGHT OBJECTIVE TYPE] Q. The line x y + = 0 is tangent to the circle at the point (, 5) and the centre of the circles lies on x y = 4. The radius of the circle is (A) 3 5 (B) 5 3 (C) 5 (D) 5
More informationGRAPHS OF CONVEX FUNCTIONS ARE σ1-straight
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 33, Number 3, Fall 2003 GRAPHS OF CONVEX FUNCTIONS ARE σ1-straight RICHARD DELAWARE ABSTRACT. A set E R n is s-straight for s>0ife has finite Method II outer
More informationWARDROP EQUILIBRIA IN AN INFINITE NETWORK
LE MATEMATICHE Vol. LV (2000) Fasc. I, pp. 1728 WARDROP EQUILIBRIA IN AN INFINITE NETWORK BRUCE CALVERT In a nite network, there is a classical theory of trafc ow, which gives existence of a Wardrop equilibrium
More informationInternational Mathematics TOURNAMENT OF THE TOWNS
1 International Mathematics TOURNAMENT OF THE TOWNS Senior A-Level Paper Spring 2006. 1. Assume a convex polygon with 100 vertices is given. Prove that one can chose 50 points inside the polygon in such
More informationTeam Solutions. November 19, qr = (m + 2)(m 2)
Team s November 19, 2017 1. Let p, q, r, and s be four distinct primes such that p + q + r + s is prime, and the numbers p 2 + qr and p 2 + qs are both perfect squares. What is the value of p + q + r +
More informationMATH Max-min Theory Fall 2016
MATH 20550 Max-min Theory Fall 2016 1. Definitions and main theorems Max-min theory starts with a function f of a vector variable x and a subset D of the domain of f. So far when we have worked with functions
More informationarxiv: v3 [math.mg] 17 Mar 2008
arxiv:0801.1929v3 [math.mg] 17 Mar 2008 The DNA Inequality in Non-Convex Regions Eric Larson May 10, 2009 Abstract The DNA Inequality states that the average curvature of a curve inside of a given closed
More informationModule 16 : Line Integrals, Conservative fields Green's Theorem and applications. Lecture 48 : Green's Theorem [Section 48.
Module 16 : Line Integrals, Conservative fields Green's Theorem and applications Lecture 48 : Green's Theorem [Section 48.1] Objectives In this section you will learn the following : Green's theorem which
More informationProving languages to be nonregular
Proving languages to be nonregular We already know that there exist languages A Σ that are nonregular, for any choice of an alphabet Σ. This is because there are uncountably many languages in total and
More informationOn Powers of some Intersection Graphs
On Powers of some Intersection Graphs Geir Agnarsson Abstract We first consider m-trapezoid graphs and circular m-trapezoid graphs and give new constructive proofs that both these classes are closed under
More informationMORE EXERCISES FOR SECTIONS II.1 AND II.2. There are drawings on the next two pages to accompany the starred ( ) exercises.
Math 133 Winter 2013 MORE EXERCISES FOR SECTIONS II.1 AND II.2 There are drawings on the next two pages to accompany the starred ( ) exercises. B1. Let L be a line in R 3, and let x be a point which does
More informationbe a path in L G ; we can associated to P the following alternating sequence of vertices and edges in G:
1. The line graph of a graph. Let G = (V, E) be a graph with E. The line graph of G is the graph L G such that V (L G ) = E and E(L G ) = {ef : e, f E : e and f are adjacent}. Examples 1.1. (1) If G is
More informationGarrett: `Bernstein's analytic continuation of complex powers' 2 Let f be a polynomial in x 1 ; : : : ; x n with real coecients. For complex s, let f
1 Bernstein's analytic continuation of complex powers c1995, Paul Garrett, garrettmath.umn.edu version January 27, 1998 Analytic continuation of distributions Statement of the theorems on analytic continuation
More informationf(z)dz = 0. P dx + Qdy = D u dx v dy + i u dy + v dx. dxdy + i x = v
MA525 ON CAUCHY'S THEOREM AND GREEN'S THEOREM DAVID DRASIN (EDITED BY JOSIAH YODER) 1. Introduction No doubt the most important result in this course is Cauchy's theorem. Every critical theorem in the
More informationDisjoint paths in unions of tournaments
Disjoint paths in unions of tournaments Maria Chudnovsky 1 Princeton University, Princeton, NJ 08544, USA Alex Scott Mathematical Institute, University of Oxford, Oxford OX2 6GG, UK Paul Seymour 2 Princeton
More information1. Suppose that a, b, c and d are four different integers. Explain why. (a b)(a c)(a d)(b c)(b d)(c d) a 2 + ab b = 2018.
New Zealand Mathematical Olympiad Committee Camp Selection Problems 2018 Solutions Due: 28th September 2018 1. Suppose that a, b, c and d are four different integers. Explain why must be a multiple of
More informationRECOVERY OF NON-LINEAR CONDUCTIVITIES FOR CIRCULAR PLANAR GRAPHS
RECOVERY OF NON-LINEAR CONDUCTIVITIES FOR CIRCULAR PLANAR GRAPHS WILL JOHNSON Abstract. We consider the problem of recovering nonlinear conductances in a circular planar graph. If the graph is critical
More informationNotes on Complex Analysis
Michael Papadimitrakis Notes on Complex Analysis Department of Mathematics University of Crete Contents The complex plane.. The complex plane...................................2 Argument and polar representation.........................
More informationSupplementary File: Proof of Proposition 1
Supplementary File: Proof of Proposition 1 Tong Tong Wu and Kenneth Lange The expected loss E ( Y f(x) ɛ ) can be written as [ ] E [E ( Y f(x) ɛ X)] = E p (X) v f(x) ɛ X, where p (x) = Pr(Y = v X = x).
More informationMath 341: Convex Geometry. Xi Chen
Math 341: Convex Geometry Xi Chen 479 Central Academic Building, University of Alberta, Edmonton, Alberta T6G 2G1, CANADA E-mail address: xichen@math.ualberta.ca CHAPTER 1 Basics 1. Euclidean Geometry
More informationLECTURE 15: COMPLETENESS AND CONVEXITY
LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other
More informationarxiv: v1 [cs.cg] 25 Dec 2018
Evacuating Equilateral Triangles and Squares in the Face-to-Face Model Huda Chuangpishit 1, Saeed Mehrabi 2, Lata Narayanan 3, and Jaroslav Opatrny 3 1 Department of Mathematics, Ryerson University, Toronto,
More informationBichain graphs: geometric model and universal graphs
Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United
More informationWhat can you prove by induction?
MEI CONFERENCE 013 What can you prove by induction? Martyn Parker M.J.Parker@keele.ac.uk Contents Contents iii 1 Splitting Coins.................................................. 1 Convex Polygons................................................
More informationUnsplittable coverings in the plane
Unsplittable coverings in the plane János Pach Dömötör Pálvölgyi May 26, 2015 Abstract Et tu mi li, Brute? (Julius Caesar) A system of sets forms an m-fold covering of a set X if every point of X belongs
More informationShortest paths with negative lengths
Chapter 8 Shortest paths with negative lengths In this chapter we give a linear-space, nearly linear-time algorithm that, given a directed planar graph G with real positive and negative lengths, but no
More informationA Decidable Class of Planar Linear Hybrid Systems
A Decidable Class of Planar Linear Hybrid Systems Pavithra Prabhakar, Vladimeros Vladimerou, Mahesh Viswanathan, and Geir E. Dullerud University of Illinois at Urbana-Champaign. Abstract. The paper shows
More informationLifting to non-integral idempotents
Journal of Pure and Applied Algebra 162 (2001) 359 366 www.elsevier.com/locate/jpaa Lifting to non-integral idempotents Georey R. Robinson School of Mathematics and Statistics, University of Birmingham,
More informationIntroduction to Real Analysis
Introduction to Real Analysis Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 13, 2013 1 Sets Sets are the basic objects of mathematics. In fact, they are so basic that
More informationLimits and Continuity
Chapter Limits and Continuity. Limits of Sequences.. The Concept of Limit and Its Properties A sequence { } is an ordered infinite list x,x,...,,... The n-th term of the sequence is, and n is the index
More informationThus, X is connected by Problem 4. Case 3: X = (a, b]. This case is analogous to Case 2. Case 4: X = (a, b). Choose ε < b a
Solutions to Homework #6 1. Complete the proof of the backwards direction of Theorem 12.2 from class (which asserts the any interval in R is connected). Solution: Let X R be a closed interval. Case 1:
More information16 circles. what goes around...
16 circles. what goes around... 2 lesson 16 this is the first of two lessons dealing with circles. this lesson gives some basic definitions and some elementary theorems, the most important of which is
More informationFoundations of Neutral Geometry
C H A P T E R 12 Foundations of Neutral Geometry The play is independent of the pages on which it is printed, and pure geometries are independent of lecture rooms, or of any other detail of the physical
More informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H 1, H 2 ) so that H 1 H 2 = G E(H 1 ) E(H 2 ) = V (H 1 ) V (H 2 ) = k Such a separation is proper if V (H
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 informationAlhazen s Hyperbolic Billiard Problem
Alhazen s Hyperbolic Billiard Problem Nathan Poirier and Michael McDaniel Aquinas College May 2011 Alhazen s billiard problem, rst posed in 150 BC, starts with a given circle and two points A and B inside.
More informationPacking cycles with modularity constraints
Packing cycles with modularity constraints Paul Wollan Mathematisches Seminar der Universität Hamburg Bundesstr. 55 20146 Hamburg, Germany Abstract We prove that for all positive integers k, there exists
More information14 th Annual Harvard-MIT Mathematics Tournament Saturday 12 February 2011
14 th Annual Harvard-MIT Mathematics Tournament Saturday 1 February 011 1. Let a, b, and c be positive real numbers. etermine the largest total number of real roots that the following three polynomials
More informationHIGHER RANK NUMERICAL RANGES OF NORMAL MATRICES
HIGHER RANK NUMERICAL RANGES OF NORMAL MATRICES HWA-LONG GAU, CHI-KWONG LI, YIU-TUNG POON, AND NUNG-SING SZE Abstract. The higher rank numerical range is closely connected to the construction of quantum
More informationThe Minimum Speed for a Blocking Problem on the Half Plane
The Minimum Speed for a Blocking Problem on the Half Plane Alberto Bressan and Tao Wang Department of Mathematics, Penn State University University Park, Pa 16802, USA e-mails: bressan@mathpsuedu, wang
More informationOHSx XM521 Multivariable Differential Calculus: Homework Solutions 13.1
OHSx XM521 Multivariable Differential Calculus: Homework Solutions 13.1 (37) If a bug walks on the sphere x 2 + y 2 + z 2 + 2x 2y 4z 3 = 0 how close and how far can it get from the origin? Solution: Complete
More informationLaw of Trichotomy and Boundary Equations
Law of Trichotomy and Boundary Equations Law of Trichotomy: For any two real numbers a and b, exactly one of the following is true. i. a < b ii. a = b iii. a > b The Law of Trichotomy is a formal statement
More informationENGI 4430 Line Integrals; Green s Theorem Page 8.01
ENGI 4430 Line Integrals; Green s Theorem Page 8.01 8. Line Integrals Two applications of line integrals are treated here: the evaluation of work done on a particle as it travels along a curve in the presence
More informationSolutions to Exercises Chapter 10: Ramsey s Theorem
Solutions to Exercises Chapter 10: Ramsey s Theorem 1 A platoon of soldiers (all of different heights) is in rectangular formation on a parade ground. The sergeant rearranges the soldiers in each row of
More informationThe Skorokhod reflection problem for functions with discontinuities (contractive case)
The Skorokhod reflection problem for functions with discontinuities (contractive case) TAKIS KONSTANTOPOULOS Univ. of Texas at Austin Revised March 1999 Abstract Basic properties of the Skorokhod reflection
More informationThe Stong Isoperimetric Inequality of Bonnesen
Department of Mathematics Undergraduate Colloquium University of Utah January, 006 The Stong Isoperimetric Inequality of Bonnesen Andres Treibergs University of Utah Among all simple closed curves in the
More informationQUESTION BANK ON STRAIGHT LINE AND CIRCLE
QUESTION BANK ON STRAIGHT LINE AND CIRCLE Select the correct alternative : (Only one is correct) Q. If the lines x + y + = 0 ; 4x + y + 4 = 0 and x + αy + β = 0, where α + β =, are concurrent then α =,
More informationHOW TO MAKE ELEMENTARY GEOMETRY MORE ROBUST AND THUS, MORE PRACTICAL: GENERAL ALGORITHMS. O. Kosheleva. 1. Formulation of the Problem
Ìàòåìàòè åñêèå ñòðóêòóðû è ìîäåëèðîâàíèå 2014, âûï. XX, ñ. 1?? ÓÄÊ 000.000 HOW TO MAKE ELEMENTARY GEOMETRY MORE ROBUST AND THUS, MORE PRACTICAL: GENERAL ALGORITHMS O. Kosheleva Many results of elementary
More information