Math 497C Sep 17, Curves and Surfaces Fall 2004, PSU

Similar documents
7.2 Volume. A cross section is the shape we get when cutting straight through an object.

Review of linear algebra. Nuno Vasconcelos UCSD

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

Principle Component Analysis

Spectral Graph Theory and its Applications September 16, Lecture 5

UNIVERSITY OF IOANNINA DEPARTMENT OF ECONOMICS. M.Sc. in Economics MICROECONOMIC THEORY I. Problem Set II

Partially Observable Systems. 1 Partially Observable Markov Decision Process (POMDP) Formalism

MTH 263 Practice Test #1 Spring 1999

The Schur-Cohn Algorithm

COMPLEX NUMBER & QUADRATIC EQUATION

More metrics on cartesian products

p (i.e., the set of all nonnegative real numbers). Similarly, Z will denote the set of all

MAT 578 Functional Analysis

The Second Eigenvalue of Planar Graphs

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

CENTROID (AĞIRLIK MERKEZİ )

Appendix B. Criterion of Riemann-Stieltjes Integrability

4. Eccentric axial loading, cross-section core

An Introduction to Support Vector Machines

Jens Siebel (University of Applied Sciences Kaiserslautern) An Interactive Introduction to Complex Numbers

Announcements. Image Formation: Outline. The course. Image Formation and Cameras (cont.)

A Quantum Gauss-Bonnet Theorem

Lecture 4: Piecewise Cubic Interpolation

REAL ANALYSIS I HOMEWORK 1

The Number of Rows which Equal Certain Row

PES 1120 Spring 2014, Spendier Lecture 6/Page 1

Exercise Solutions to Real Analysis

Least squares. Václav Hlaváč. Czech Technical University in Prague

Physics 121 Sample Common Exam 2 Rev2 NOTE: ANSWERS ARE ON PAGE 7. Instructions:

DCDM BUSINESS SCHOOL NUMERICAL METHODS (COS 233-8) Solutions to Assignment 3. x f(x)

1 Matrix representations of canonical matrices

Math1110 (Spring 2009) Prelim 3 - Solutions

Many-Body Calculations of the Isotope Shift

Dirichlet s Theorem In Arithmetic Progressions

Statistics and Probability Letters

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)

VECTORS VECTORS VECTORS VECTORS. 2. Vector Representation. 1. Definition. 3. Types of Vectors. 5. Vector Operations I. 4. Equal and Opposite Vectors

Module 2. Random Processes. Version 2 ECE IIT, Kharagpur

INTRODUCTION TO COMPLEX NUMBERS

( dg. ) 2 dt. + dt. dt j + dh. + dt. r(t) dt. Comparing this equation with the one listed above for the length of see that

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Affine and Riemannian Connections

Torsion, Thermal Effects and Indeterminacy

Complex Variables. Chapter 18 Integration in the Complex Plane. March 12, 2013 Lecturer: Shih-Yuan Chen

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

Some basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C

APPENDIX A Some Linear Algebra

Statistical Mechanics and Combinatorics : Lecture III

Regulated functions and the regulated integral

THE COMBINED SHEPARD ABEL GONCHAROV UNIVARIATE OPERATOR

International Journal of Pure and Applied Sciences and Technology

The path of ants Dragos Crisan, Andrei Petridean, 11 th grade. Colegiul National "Emil Racovita", Cluj-Napoca

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

Lecture 7: Gluing prevarieties; products

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

Section 8.3 Polar Form of Complex Numbers

Section 14.3 Arc Length and Curvature

A 2D Bounded Linear Program (H,c) 2D Linear Programming

ODE: Existence and Uniqueness of a Solution

The Geometry of Logit and Probit

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws

Marginal Effects in Probit Models: Interpretation and Testing. 1. Interpreting Probit Coefficients

90 S.S. Drgomr nd (t b)du(t) =u()(b ) u(t)dt: If we dd the bove two equltes, we get (.) u()(b ) u(t)dt = p(; t)du(t) where p(; t) := for ll ; t [; b]:

Multiple view geometry

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

Abhilasha Classes Class- XII Date: SOLUTION (Chap - 9,10,12) MM 50 Mob no

MA 323 Geometric Modelling Course Notes: Day 13 Bezier Curves & Bernstein Polynomials

Lecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES

Least Squares Fitting of Data

CS-433: Simulation and Modeling Modeling and Probability Review

Phil Wertheimer UMD Math Qualifying Exam Solutions Analysis - January, 2015

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Chapter Newton-Raphson Method of Solving a Nonlinear Equation

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

Formulas for the Determinant

Chapter 2 Introduction to Algebra. Dr. Chih-Peng Li ( 李 )

Assortment Optimization under MNL

Trigonometry. Trigonometry. Solutions. Curriculum Ready ACMMG: 223, 224, 245.

First day August 1, Problems and Solutions

Affine transformations and convexity

Lecture 3: Shannon s Theorem

Solutions to exam in SF1811 Optimization, Jan 14, 2015

Math 702 Midterm Exam Solutions

Module 14: THE INTEGRAL Exploring Calculus

Week 2. This week, we covered operations on sets and cardinality.

20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.

Some modelling aspects for the Matlab implementation of MMA

STEINHAUS PROPERTY IN BANACH LATTICES

2.3 Nilpotent endomorphisms

Math 205A Homework #2 Edward Burkard. Assume each composition with a projection is continuous. Let U Y Y be an open set.

Digital Signal Processing

INTERPOLATION(1) ELM1222 Numerical Analysis. ELM1222 Numerical Analysis Dr Muharrem Mercimek

Week 9 Chapter 10 Section 1-5

Lecture 1: Introduction to integration theory and bounded variation

Lecture 21: Numerical methods for pricing American type derivatives

General viscosity iterative method for a sequence of quasi-nonexpansive mappings

Proof that if Voting is Perfect in One Dimension, then the First. Eigenvector Extracted from the Double-Centered Transformed

Probability Theory. The nth coefficient of the Taylor series of f(k), expanded around k = 0, gives the nth moment of x as ( ik) n n!

Available online through

Transcription:

Mth 497C Sep 17, 004 1 Curves nd Surfces Fll 004, PSU Lecture Notes 3 1.8 The generl defnton of curvture; Fox-Mlnor s Theorem Let α: [, b] R n be curve nd P = {t 0,...,t n } be prtton of [, b], then the pproxmton of the totl curvture of α wth respect to P s defned s n 1 totl κ[α, P ]:= ngle αt αt 1,αt +1 αt, =1 nd the totl curvture of α s gven by totl κ[α] := sup{ κ[α, P ] P P rtton[, b] }. Our mn m here s to prove the followng observton due to Rlph Fox nd John Mlnor: Theorem 1 Fox-Mnor. If α: [, b] R n s C unt speed curve, then totl κ[α] = α t dt. Ths theorem mples, by the men vlue theorem for ntegrls, tht for ny t, b, 1 [ κt = lm ɛ 0 ɛ totl κ α ] t+ɛ. t ɛ The bove formul my be tken s the defnton of curvture for generl not necessrly C curves. To prove the bove theorem frst we need to develop some bsc sphercl geometry. Let 1 Lst revsed: September 17, 004 S n := {p R n+1 p =1}. 1

denote the n-dmensonl unt sphere n R n+1. Defne mppng from S n S n to R by dst S np, q := nglep, q. Exercse. Show tht S n, dst S n s metrc spce. The bove metrc hs smple geometrc nterpretton descrbed s follows. By gret crcle C S n we men the ntersecton of S n wth two dmensonl plne whch psses through the orgn o of R n+1. For ny pr of ponts p, q S, there exsts plne pssng through them nd the orgn. When p ±q ths plne s gven by the lner combntons of p nd q nd thus s unque; otherwse, p, q nd o le on lne nd there exsts nfntely mny two dmensonl plnes pssng through them. Thus through every prs of ponts of S n there psses gret crcle, whch s unque whenever p ±q. Exercse 3. For ny prs of ponts p, q S n, let C be gret crcle pssng through them. If p q, let l 1 nd l denote the length of the two segments n C determned by p nd q, then dst S np, q = mn{l 1,l }.Hnt: Let p C be vector orthogonl to p, then C my be prmetrzed s the set of ponts trced by the curve p cost+p snt. Let α: [, b] S n be sphercl curve,.e., Euclden curve α: [, b] R n+1 wth α = 1. For ny prtton P = {t 0,...,t n } of [, b], the sphercl length of α wth respect the prtton P s defned s length S n[α, P ]= n dst S n αt,αt 1. =1 The norm of ny prtton P of [, b] s defned s P := mx{t t 1 1 n}. If P 1 nd P re prtons of [, b], we sy tht P s refnement of P 1 provded tht P 1 P. Exercse 4. Show tht f P s refnement of P 1, then length S n[α, P ] length S n[α, P 1 ]. Hnt:Use the fct tht dst S n stsfes the trngle nequlty, see Exc..

The sphercl length of α s defned by length S n[α] = sup { length S n[α, P ] P P rtton[, b] }. Lemm 5. If α: [, b] S n s unt speed sphercl curve, then length S n[α] = length[α]. Proof. Let P k := {t k 0,...,t k n} be sequence of prttons of [, b] wth lm P k =0, nd θ k := dst S n α k t,α k t 1 = ngle α k t,α k t 1 be the correspondng sphercl dstnces. Then, snce α hs unt speed, θ k sn = αt k αt k 1 t k t k 1 P k. In prtculr, θ k lm sn =0. Now, snce lm x 0 snx/x = 1, t follows tht, for ny ɛ>0, there exsts N>0, dependng only on P k, such tht f k>n, then θ 1 ɛθ k k sn 1 + ɛθ k, whch yelds tht 1 ɛ length S n[α, P k ] length[α, P k ] 1 + ɛ length S n[α, P k ]. The bove nequltes re stsfed by ny ɛ>0provded tht k s lrge enough. Thus lm length S n[α, P k ] = length[α]. Further, note tht f P s ny prttons of [, b] we my construct sequnce of prttons by successve refnements of P so tht lm P k =0. By Exercse 4, length S n[α, P k ] length S n[α, P k+1 ]. Thus the bove expresson shows tht, for ny prtton P of [, b], length S n[α, P ] length[α]. 3

The lst two expressons now yed tht sup{ length S n[α, P ] P P rtton[, b] } = length[α], whch completes the proof. Exercse 6. Show tht f P s refnement of P 1, then totlκ[α, P ] totlκ[α, P 1 ]. Now we re redy to prove the theorem of Fox-Mlnor: Proof of Theorem 1. As n the proof of the prevous lemm, let P k = {t k 0,...,t k n} be sequence of prttons of [, b] wth lm P k = 0. Set θ k := ngle αt k αt k 1,αt k +1 αt k, where =1,...,n 1. Further, set nd Recll tht, by the prevous lemm, lm t k := tk + t k 1 φ k := ngle α t k,α t k +1. φ k = length S n 1[α ] = length[α ]= α t dt. Thus to complete the proof t suffces to show tht, for every ɛ>0, there exsts N such tht for ll k N, for then t would follow tht θ k φ k ɛt k +1 t k 1; 1 ɛ[, b] θ k φ k ɛ[, b], whch would n turn yeld lm totl κ[α, P k ] = lm θ k = lm 4 φ k = α t dt.

Now, smlr to the proof of Lemm 5, note tht gven ny prtton P of [, b], we my construct by subsequent refnements sequnce of prttons P k, wth P 0 = P, such tht lm P k = 0. Thus the lst expresson, together wth Excercse 6, yelds tht totlκ[α, P ] α t dt. The lst two expressons complete the proof; so t remns to estblsh 1. To ths end let := ngle α t k, αt k αt k 1. β k By the trngle nequlty for ngles Exercse. whch yelds φ k β k + θ k + β k +1, nd θ k β k + φ k + β k +1, φ k θ k β k + β k +1. So to prove 1 t s enough to show tht for every ɛ>0 β k ɛ t t 1 provded tht k s lrge enough. See Exercse 7. Exercse* 7. Let α: [, b] R n be C curve. For every t, s [, b], t s, defne t + s ft, s := ngle α,αt αs. Show tht ft, s lm t s t s =0. In prtculr, f we set ft, t = 0, then the resultng functon f :[, b] [, b] R s contnuous. So, snce [, b] s compct, f s unformly contnuous,.e., for every ɛ>0, there s δ such tht ft fs ɛ, whever t s δ. Does ths result hold for C 1 curves s well? 5