Differential Geometry of Plane Curves
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Polar Coordinates, Arc Length and the Lemniscate Curve
Ursinus College Digital Commons @ Ursinus College Transforming Instruction in Undergraduate Calculus Mathematics via Primary Historical Sources (TRIUMPHS) Summer 2018 Gaussian Guesswork: Polar Coordinates, Arc Length and the Lemniscate Curve Janet Heine Barnett Colorado State University-Pueblo, [email protected] Follow this and additional works at: https://digitalcommons.ursinus.edu/triumphs_calculus Click here to let us know how access to this document benefits ou.y Recommended Citation Barnett, Janet Heine, "Gaussian Guesswork: Polar Coordinates, Arc Length and the Lemniscate Curve" (2018). Calculus. 3. https://digitalcommons.ursinus.edu/triumphs_calculus/3 This Course Materials is brought to you for free and open access by the Transforming Instruction in Undergraduate Mathematics via Primary Historical Sources (TRIUMPHS) at Digital Commons @ Ursinus College. It has been accepted for inclusion in Calculus by an authorized administrator of Digital Commons @ Ursinus College. For more information, please contact [email protected]. Gaussian Guesswork: Polar Coordinates, Arc Length and the Lemniscate Curve Janet Heine Barnett∗ October 26, 2020 Just prior to his 19th birthday, the mathematical genius Carl Freidrich Gauss (1777{1855) began a \mathematical diary" in which he recorded his mathematical discoveries for nearly 20 years. Among these discoveries is the existence of a beautiful relationship between three particular numbers: • the ratio of the circumference of a circle to its diameter, or π; Z 1 dx • a specific value of a certain (elliptic1) integral, which Gauss denoted2 by $ = 2 p ; and 4 0 1 − x p p • a number called \the arithmetic-geometric mean" of 1 and 2, which he denoted as M( 2; 1). Like many of his discoveries, Gauss uncovered this particular relationship through a combination of the use of analogy and the examination of computational data, a practice that historian Adrian Rice called \Gaussian Guesswork" in his Math Horizons article subtitled \Why 1:19814023473559220744 ::: is such a beautiful number" [Rice, November 2009]. -
Geometric Representations of Graphs
1 Geometric Representations of Graphs Laszl¶ o¶ Lovasz¶ Microsoft Research One Microsoft Way, Redmond, WA 98052 e-mail: [email protected] 2 Contents I Background 5 1 Eigenvalues of graphs 7 1.1 Matrices associated with graphs ............................ 7 1.2 The largest eigenvalue ................................. 8 1.2.1 Adjacency matrix ............................... 8 1.2.2 Laplacian .................................... 9 1.2.3 Transition matrix ................................ 9 1.3 The smallest eigenvalue ................................ 9 1.4 The eigenvalue gap ................................... 11 1.4.1 Expanders .................................... 12 1.4.2 Random walks ................................. 12 1.5 The number of di®erent eigenvalues .......................... 17 1.6 Eigenvectors ....................................... 19 2 Convex polytopes 21 2.1 Polytopes and polyhedra ................................ 21 2.2 The skeleton of a polytope ............................... 21 2.3 Polar, blocker and antiblocker ............................. 22 II Representations of Planar Graphs 25 3 Planar graphs and polytopes 27 3.1 Planar graphs ...................................... 27 3.2 Straight line representation and 3-polytopes ..................... 28 4 Rubber bands, cables, bars and struts 29 4.1 Rubber band representation .............................. 29 4.1.1 How to draw a graph? ............................. 30 4.1.2 How to lift a graph? .............................. 32 4.1.3 Rubber bands and connectivity ....................... -
Digital and Discrete Geometry Li M
Digital and Discrete Geometry Li M. Chen Digital and Discrete Geometry Theory and Algorithms 2123 Li M. Chen University of the District of Columbia Washington District of Columbia USA ISBN 978-3-319-12098-0 ISBN 978-3-319-12099-7 (eBook) DOI 10.1007/978-3-319-12099-7 Springer Cham Heidelberg New York Dordrecht London Library of Congress Control Number: 2014958741 © Springer International Publishing Switzerland 2014 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com) To the researchers and their supporters in Digital Geometry and Topology. -
Calculus Terminology
AP Calculus BC Calculus Terminology Absolute Convergence Asymptote Continued Sum Absolute Maximum Average Rate of Change Continuous Function Absolute Minimum Average Value of a Function Continuously Differentiable Function Absolutely Convergent Axis of Rotation Converge Acceleration Boundary Value Problem Converge Absolutely Alternating Series Bounded Function Converge Conditionally Alternating Series Remainder Bounded Sequence Convergence Tests Alternating Series Test Bounds of Integration Convergent Sequence Analytic Methods Calculus Convergent Series Annulus Cartesian Form Critical Number Antiderivative of a Function Cavalieri’s Principle Critical Point Approximation by Differentials Center of Mass Formula Critical Value Arc Length of a Curve Centroid Curly d Area below a Curve Chain Rule Curve Area between Curves Comparison Test Curve Sketching Area of an Ellipse Concave Cusp Area of a Parabolic Segment Concave Down Cylindrical Shell Method Area under a Curve Concave Up Decreasing Function Area Using Parametric Equations Conditional Convergence Definite Integral Area Using Polar Coordinates Constant Term Definite Integral Rules Degenerate Divergent Series Function Operations Del Operator e Fundamental Theorem of Calculus Deleted Neighborhood Ellipsoid GLB Derivative End Behavior Global Maximum Derivative of a Power Series Essential Discontinuity Global Minimum Derivative Rules Explicit Differentiation Golden Spiral Difference Quotient Explicit Function Graphic Methods Differentiable Exponential Decay Greatest Lower Bound Differential -
CURVATURE E. L. Lady the Curvature of a Curve Is, Roughly Speaking, the Rate at Which That Curve Is Turning. Since the Tangent L
1 CURVATURE E. L. Lady The curvature of a curve is, roughly speaking, the rate at which that curve is turning. Since the tangent line or the velocity vector shows the direction of the curve, this means that the curvature is, roughly, the rate at which the tangent line or velocity vector is turning. There are two refinements needed for this definition. First, the rate at which the tangent line of a curve is turning will depend on how fast one is moving along the curve. But curvature should be a geometric property of the curve and not be changed by the way one moves along it. Thus we define curvature to be the absolute value of the rate at which the tangent line is turning when one moves along the curve at a speed of one unit per second. At first, remembering the determination in Calculus I of whether a curve is curving upwards or downwards (“concave up or concave down”) it may seem that curvature should be a signed quantity. However a little thought shows that this would be undesirable. If one looks at a circle, for instance, the top is concave down and the bottom is concave up, but clearly one wants the curvature of a circle to be positive all the way round. Negative curvature simply doesn’t make sense for curves. The second problem with defining curvature to be the rate at which the tangent line is turning is that one has to figure out what this means. The Curvature of a Graph in the Plane. -
Chapter 13 Curvature in Riemannian Manifolds
Chapter 13 Curvature in Riemannian Manifolds 13.1 The Curvature Tensor If (M, , )isaRiemannianmanifoldand is a connection on M (that is, a connection on TM−), we− saw in Section 11.2 (Proposition 11.8)∇ that the curvature induced by is given by ∇ R(X, Y )= , ∇X ◦∇Y −∇Y ◦∇X −∇[X,Y ] for all X, Y X(M), with R(X, Y ) Γ( om(TM,TM)) = Hom (Γ(TM), Γ(TM)). ∈ ∈ H ∼ C∞(M) Since sections of the tangent bundle are vector fields (Γ(TM)=X(M)), R defines a map R: X(M) X(M) X(M) X(M), × × −→ and, as we observed just after stating Proposition 11.8, R(X, Y )Z is C∞(M)-linear in X, Y, Z and skew-symmetric in X and Y .ItfollowsthatR defines a (1, 3)-tensor, also denoted R, with R : T M T M T M T M. p p × p × p −→ p Experience shows that it is useful to consider the (0, 4)-tensor, also denoted R,givenby R (x, y, z, w)= R (x, y)z,w p p p as well as the expression R(x, y, y, x), which, for an orthonormal pair, of vectors (x, y), is known as the sectional curvature, K(x, y). This last expression brings up a dilemma regarding the choice for the sign of R. With our present choice, the sectional curvature, K(x, y), is given by K(x, y)=R(x, y, y, x)but many authors define K as K(x, y)=R(x, y, x, y). Since R(x, y)isskew-symmetricinx, y, the latter choice corresponds to using R(x, y)insteadofR(x, y), that is, to define R(X, Y ) by − R(X, Y )= + . -
NOTES Reconsidering Leibniz's Analytic Solution of the Catenary
NOTES Reconsidering Leibniz's Analytic Solution of the Catenary Problem: The Letter to Rudolph von Bodenhausen of August 1691 Mike Raugh January 23, 2017 Leibniz published his solution of the catenary problem as a classical ruler-and-compass con- struction in the June 1691 issue of Acta Eruditorum, without comment about the analysis used to derive it.1 However, in a private letter to Rudolph Christian von Bodenhausen later in the same year he explained his analysis.2 Here I take up Leibniz's argument at a crucial point in the letter to show that a simple observation leads easily and much more quickly to the solution than the path followed by Leibniz. The argument up to the crucial point affords a showcase in the techniques of Leibniz's calculus, so I take advantage of the opportunity to discuss it in the Appendix. Leibniz begins by deriving a differential equation for the catenary, which in our modern orientation of an x − y coordinate system would be written as, dy n Z p = (n = dx2 + dy2); (1) dx a where (x; z) represents cartesian coordinates for a point on the catenary, n is the arc length from that point to the lowest point, the fraction on the left is a ratio of differentials, and a is a constant representing unity used throughout the derivation to maintain homogeneity.3 The equation characterizes the catenary, but to solve it n must be eliminated. 1Leibniz, Gottfried Wilhelm, \De linea in quam flexile se pondere curvat" in Die Mathematischen Zeitschriftenartikel, Chap 15, pp 115{124, (German translation and comments by Hess und Babin), Georg Olms Verlag, 2011. -
The Arc Length of a Random Lemniscate
The arc length of a random lemniscate Erik Lundberg, Florida Atlantic University joint work with Koushik Ramachandran [email protected] SEAM 2017 Random lemniscates Topic of my talk last year at SEAM: Random rational lemniscates on the sphere. Topic of my talk today: Random polynomial lemniscates in the plane. Polynomial lemniscates: three guises I Complex Analysis: pre-image of unit circle under polynomial map jp(z)j = 1 I Potential Theory: level set of logarithmic potential log jp(z)j = 0 I Algebraic Geometry: special real-algebraic curve p(x + iy)p(x + iy) − 1 = 0 Polynomial lemniscates: three guises I Complex Analysis: pre-image of unit circle under polynomial map jp(z)j = 1 I Potential Theory: level set of logarithmic potential log jp(z)j = 0 I Algebraic Geometry: special real-algebraic curve p(x + iy)p(x + iy) − 1 = 0 Polynomial lemniscates: three guises I Complex Analysis: pre-image of unit circle under polynomial map jp(z)j = 1 I Potential Theory: level set of logarithmic potential log jp(z)j = 0 I Algebraic Geometry: special real-algebraic curve p(x + iy)p(x + iy) − 1 = 0 Prevalence of lemniscates I Approximation theory: Hilbert's lemniscate theorem I Conformal mapping: Bell representation of n-connected domains I Holomorphic dynamics: Mandelbrot and Julia lemniscates I Numerical analysis: Arnoldi lemniscates I 2-D shapes: proper lemniscates and conformal welding I Harmonic mapping: critical sets of complex harmonic polynomials I Gravitational lensing: critical sets of lensing maps Prevalence of lemniscates I Approximation theory: -
Eigenvalues of Graphs
Eigenvalues of graphs L¶aszl¶oLov¶asz November 2007 Contents 1 Background from linear algebra 1 1.1 Basic facts about eigenvalues ............................. 1 1.2 Semide¯nite matrices .................................. 2 1.3 Cross product ...................................... 4 2 Eigenvalues of graphs 5 2.1 Matrices associated with graphs ............................ 5 2.2 The largest eigenvalue ................................. 6 2.2.1 Adjacency matrix ............................... 6 2.2.2 Laplacian .................................... 7 2.2.3 Transition matrix ................................ 7 2.3 The smallest eigenvalue ................................ 7 2.4 The eigenvalue gap ................................... 9 2.4.1 Expanders .................................... 10 2.4.2 Edge expansion (conductance) ........................ 10 2.4.3 Random walks ................................. 14 2.5 The number of di®erent eigenvalues .......................... 16 2.6 Spectra of graphs and optimization .......................... 18 Bibliography 19 1 Background from linear algebra 1.1 Basic facts about eigenvalues Let A be an n £ n real matrix. An eigenvector of A is a vector such that Ax is parallel to x; in other words, Ax = ¸x for some real or complex number ¸. This number ¸ is called the eigenvalue of A belonging to eigenvector v. Clearly ¸ is an eigenvalue i® the matrix A ¡ ¸I is singular, equivalently, i® det(A ¡ ¸I) = 0. This is an algebraic equation of degree n for ¸, and hence has n roots (with multiplicity). The trace of the square matrix A = (Aij ) is de¯ned as Xn tr(A) = Aii: i=1 1 The trace of A is the sum of the eigenvalues of A, each taken with the same multiplicity as it occurs among the roots of the equation det(A ¡ ¸I) = 0. If the matrix A is symmetric, then its eigenvalues and eigenvectors are particularly well behaved. -
Curvature of Riemannian Manifolds
Curvature of Riemannian Manifolds Seminar Riemannian Geometry Summer Term 2015 Prof. Dr. Anna Wienhard and Dr. Gye-Seon Lee Soeren Nolting July 16, 2015 1 Motivation Figure 1: A vector parallel transported along a closed curve on a curved manifold.[1] The aim of this talk is to define the curvature of Riemannian Manifolds and meeting some important simplifications as the sectional, Ricci and scalar curvature. We have already noticed, that a vector transported parallel along a closed curve on a Riemannian Manifold M may change its orientation. Thus, we can determine whether a Riemannian Manifold is curved or not by transporting a vector around a loop and measuring the difference of the orientation at start and the endo of the transport. As an example take Figure 1, which depicts a parallel transport of a vector on a two-sphere. Note that in a non-curved space the orientation of the vector would be preserved along the transport. 1 2 Curvature In the following we will use the Einstein sum convention and make use of the notation: X(M) space of smooth vector fields on M D(M) space of smooth functions on M 2.1 Defining Curvature and finding important properties This rather geometrical approach motivates the following definition: Definition 2.1 (Curvature). The curvature of a Riemannian Manifold is a correspondence that to each pair of vector fields X; Y 2 X (M) associates the map R(X; Y ): X(M) ! X(M) defined by R(X; Y )Z = rX rY Z − rY rX Z + r[X;Y ]Z (1) r is the Riemannian connection of M. -
Lecture 8: the Sectional and Ricci Curvatures
LECTURE 8: THE SECTIONAL AND RICCI CURVATURES 1. The Sectional Curvature We start with some simple linear algebra. As usual we denote by ⊗2(^2V ∗) the set of 4-tensors that is anti-symmetric with respect to the first two entries and with respect to the last two entries. Lemma 1.1. Suppose T 2 ⊗2(^2V ∗), X; Y 2 V . Let X0 = aX +bY; Y 0 = cX +dY , then T (X0;Y 0;X0;Y 0) = (ad − bc)2T (X; Y; X; Y ): Proof. This follows from a very simple computation: T (X0;Y 0;X0;Y 0) = T (aX + bY; cX + dY; aX + bY; cX + dY ) = (ad − bc)T (X; Y; aX + bY; cX + dY ) = (ad − bc)2T (X; Y; X; Y ): 1 Now suppose (M; g) is a Riemannian manifold. Recall that 2 g ^ g is a curvature- like tensor, such that 1 g ^ g(X ;Y ;X ;Y ) = hX ;X ihY ;Y i − hX ;Y i2: 2 p p p p p p p p p p 1 Applying the previous lemma to Rm and 2 g ^ g, we immediately get Proposition 1.2. The quantity Rm(Xp;Yp;Xp;Yp) K(Xp;Yp) := 2 hXp;XpihYp;Ypi − hXp;Ypi depends only on the two dimensional plane Πp = span(Xp;Yp) ⊂ TpM, i.e. it is independent of the choices of basis fXp;Ypg of Πp. Definition 1.3. We will call K(Πp) = K(Xp;Yp) the sectional curvature of (M; g) at p with respect to the plane Πp. Remark. The sectional curvature K is NOT a function on M (for dim M > 2), but a function on the Grassmann bundle Gm;2(M) of M. -
A Space Curve Is a Smooth Map Γ : I ⊂ R → R 3. in Our Analysis of Defining
What is a Space Curve? A space curve is a smooth map γ : I ⊂ R ! R3. In our analysis of defining the curvature for space curves we will be able to take the inclusion (γ; 0) and have that the curvature of (γ; 0) is the same as the curvature of γ where γ : I ! R2. Hence, in this part of the talk, γ will always be a space curve. We will make one more restriction on γ, namely that γ0(t) 6= ~0 for no t in its domain. Curves with this property are said to be regular. We now give a complete definition of the curves in which we will study, however after another remark, we will refine that definition as well. Definition: A regular space curve is the image of a smooth map γ : I ⊂ R ! R3 such that γ0 6= ~0; 8t. Since γ and it's image are uniquely related up to reparametrization, one usually just says that a curve is a map i.e making no distinction between the two. The remark about being unique up to reparametrization is precisely the reason why our next restriction will make sense. It turns out that every regular curve admits a unit speed reparametrization. This property proves to be a very remarkable one especially in the case of proving theorems. Note: In practice it is extremely difficult to find a unit speed reparametrization of a general space curve. Before proceeding we remind ourselves of the definition for reparametrization and comment on why regular curves admit unit speed reparametrizations.