SlideShare a Scribd company logo
1 of 4
Left endpoint A
Above all, the Pythagorean theorem is a distance formula between two points.C
represents the straight-line distance between the two points, where the difference
between the x-coordinates of the points is ±a and the difference between the y-
coordinates of the points is ±b, or vice-versa, since any two points can be
represented in one x-y plane. The Pythagorean theorem is of fundamental
importance and is far-reaching in mathematics. Here is one example why:
Right endpoint B
Let’s say that the graph on the left
represents the path of an object
through two-dimensional space,
and that its x and y values at each
point represent perpendicular
components of displacement from a
reference point.To be clear, this
would actually be a parametric
function of some other variable
such as time, but right now that fact
is irrelevant. The left endpoint on
the graph of the object’s path
indicates the object’s location
relative to the reference point at
the beginning of the interval and
the right endpoint indicates its
relative location at the end of the
interval, which can be thought of as a time interval but not necessarily. Obviously,
the Pythagorean theorem allows us to calculate the shortest distance between the
object’s starting location and ending location, but it also allows us to calculate the
length of the curve on the graph, and since x and y are components of a parametric
function of some other variable and represent perpendicular directions in two-
dimensional space, the length of the curve (in the same units of measurement as
stated by the graph) is equal to the total length of the object’s path during the
interval, or more simply put, the total distance the object travelled during the
interval.
Unfortunately for us, we do not have formulas for lengths of nonlinear curves yet,
but we will, after we use the Pythagorean theorem, which only applies to line
segments, to help us derive such formulas. We can treat the straight-line distance
between endpoints as a crude approximation of the curve’s length, and we calculate
this distance using the Pythagorean theorem. What happens if we do this for two
subintervals and add up the distances between the endpoints of each to
approximate the curve’s length? The approximation will automatically be more
accurate, and in fact, as n, the number of subintervals taken into account, increases,
the accuracy of the approximations using n subintervals increases or stays the same.
More important than the number of subintervals is the requirement that all of their
lengths get smaller and smaller and approach zero. This infinitely small interval
involves infinitely small changes in x and y, called differentials. What matters more
than their respective quantities, which they do not actually have since they are
infinitely small, is their relative quantities, the ratio of the y differential to x
differential or vice versa, over each infinitely small subinterval.
The picture on the left shows Δx as h and Δy as
f(x+h) – f(x) over the interval from x to x+h. The
straight-line distance between the interval’s two
endpoints is ((Δx)2 + (Δy)2)1/2, the square root
of c2 in the Pythagorean equation. As h
approaches 0, the error in approximating the
curve length over each interval with the
Pythagorean straight-line distance formula
approaches 0, or in other words the Pythagorean
approximation of curve length becomes more
accurate as the interval over which it is used gets
smaller. If ((Δx)2 + (Δy)2)1/2 equals the curve
length over infinitely small intervals, how can
we add up the curve lengths of all the infinitely small subintervals to get the total
curve length of the whole interval? It is impossible to calculate the hypotenuse of
each right triangle formed by the x and y differentials over each subinterval because
differentials don’thave absolute sizes. However, as stated earlier, the x and y
differentials over infinitely small intervals do have relative sizes and that should
make sense because every point on a differentiable curve has a derivative that
represents the quotient dy/dx at that point, and dy/dx represents the Δy per
infinitely small Δx, where Δx and Δy are differentials.
((Δx)2 + (Δy)2)1/2 equals the curve length over an infinitely
small interval, where Δx and Δy are called differentials.
Δy = Δy Δx = dy dx because infinitely small Δy = dy and
---------- ----------
Δx dx infinitely small Δx = dx
Let y’ denote the derivative of y with respect to x even if the
two variables are actually independent of each other (due to
the fact that x and y model positions in perpendicular
directions of two dimensional space as part of a parametric
function), since all we care about right now is length.
(Δx)2 = (dx)2 (Δy)2 = (y’dx)2 = (y’)2(dx)2
((Δx)2 + (Δy)2)1/2 = ((dx)2 + (y’)2(dx)2)1/2 = ((dx)2(1 + (y’)2))1/2
= dx(1 + (y’)2)1/2 = length of curve over infinitely small interval
How do we add up all of the infinitely small curve lengths?
By integrating.
(1 (y')
2
)
1 / 2
dx
a
b
where a is the left endpoint and b is the right endpoint of the
interval over which we integrate.
For what we are trying to accomplish, which is derive a
formula for curve length, we can arbitrarily call y “f(x)” if the
curves we are dealing with represent y as functions of x,
because even though the example situation called for a
parametric functionwith x and y as separate functions of the
same variable, like t for time, all we may want to know is the
length of the curve on the graph and not what the length of the
curve represents or means in the specific situation in which it
is calculated. If y cannot be written as a function of x but x can
be written as a function of y, then the length of the curve over
the interval from y = c to y = d equals
(1 ( f '(y))
2
c
d
)
1 / 2
dy ,
or, using more common notation,
1 ( f '(y))
2
c
d
dy
*Picture taken from http://www.eldamar.org.uk/maths/calculus/node2.html

More Related Content

What's hot

Connectivity of graphs
Connectivity of graphsConnectivity of graphs
Connectivity of graphssana younas
 
Unit26 shortest pathalgorithm
Unit26 shortest pathalgorithmUnit26 shortest pathalgorithm
Unit26 shortest pathalgorithmmeisamstar
 
AndersSchreiber_ThesisFinal
AndersSchreiber_ThesisFinalAndersSchreiber_ThesisFinal
AndersSchreiber_ThesisFinalAnders Schreiber
 
Closest point on line segment to point
Closest point on line segment to point Closest point on line segment to point
Closest point on line segment to point Melissa Joyce Diego
 
2 borgs
2 borgs2 borgs
2 borgsYandex
 
case study of curve fitting
case study of curve fittingcase study of curve fitting
case study of curve fittingAdarsh Patel
 
Numerical Methods in Mechanical Engineering - Final Project
Numerical Methods in Mechanical Engineering - Final ProjectNumerical Methods in Mechanical Engineering - Final Project
Numerical Methods in Mechanical Engineering - Final ProjectStasik Nemirovsky
 
Vector analysis & matrix
Vector analysis & matrixVector analysis & matrix
Vector analysis & matrixMdTouhidIslam
 
Equivalent condition and two algorithms for hamiltonian graphs
Equivalent condition and two algorithms for hamiltonian graphsEquivalent condition and two algorithms for hamiltonian graphs
Equivalent condition and two algorithms for hamiltonian graphsgraphhoc
 
Modern physics paul a. tipler 6ª edição solutio manual
Modern physics   paul a. tipler 6ª edição solutio manualModern physics   paul a. tipler 6ª edição solutio manual
Modern physics paul a. tipler 6ª edição solutio manualIzabela Ferreira
 
Shortest path (Dijkistra's Algorithm) & Spanning Tree (Prim's Algorithm)
Shortest path (Dijkistra's Algorithm) & Spanning Tree (Prim's Algorithm)Shortest path (Dijkistra's Algorithm) & Spanning Tree (Prim's Algorithm)
Shortest path (Dijkistra's Algorithm) & Spanning Tree (Prim's Algorithm)Mohanlal Sukhadia University (MLSU)
 

What's hot (20)

Connectivity of graphs
Connectivity of graphsConnectivity of graphs
Connectivity of graphs
 
VECTOR ANALYSIS-1
VECTOR ANALYSIS-1VECTOR ANALYSIS-1
VECTOR ANALYSIS-1
 
Unit26 shortest pathalgorithm
Unit26 shortest pathalgorithmUnit26 shortest pathalgorithm
Unit26 shortest pathalgorithm
 
Calculus Ppt
Calculus PptCalculus Ppt
Calculus Ppt
 
AndersSchreiber_ThesisFinal
AndersSchreiber_ThesisFinalAndersSchreiber_ThesisFinal
AndersSchreiber_ThesisFinal
 
Graphical presentation
Graphical presentationGraphical presentation
Graphical presentation
 
Data structure
Data structureData structure
Data structure
 
Closest point on line segment to point
Closest point on line segment to point Closest point on line segment to point
Closest point on line segment to point
 
2 borgs
2 borgs2 borgs
2 borgs
 
Buckingham's theorem
Buckingham's  theoremBuckingham's  theorem
Buckingham's theorem
 
case study of curve fitting
case study of curve fittingcase study of curve fitting
case study of curve fitting
 
Numerical Methods in Mechanical Engineering - Final Project
Numerical Methods in Mechanical Engineering - Final ProjectNumerical Methods in Mechanical Engineering - Final Project
Numerical Methods in Mechanical Engineering - Final Project
 
Vector analysis & matrix
Vector analysis & matrixVector analysis & matrix
Vector analysis & matrix
 
Chapter 16 2
Chapter 16 2Chapter 16 2
Chapter 16 2
 
Connectivity of graph
Connectivity of graphConnectivity of graph
Connectivity of graph
 
Fluid Mechanics
Fluid MechanicsFluid Mechanics
Fluid Mechanics
 
Equivalent condition and two algorithms for hamiltonian graphs
Equivalent condition and two algorithms for hamiltonian graphsEquivalent condition and two algorithms for hamiltonian graphs
Equivalent condition and two algorithms for hamiltonian graphs
 
Modern physics paul a. tipler 6ª edição solutio manual
Modern physics   paul a. tipler 6ª edição solutio manualModern physics   paul a. tipler 6ª edição solutio manual
Modern physics paul a. tipler 6ª edição solutio manual
 
Lo2
Lo2Lo2
Lo2
 
Shortest path (Dijkistra's Algorithm) & Spanning Tree (Prim's Algorithm)
Shortest path (Dijkistra's Algorithm) & Spanning Tree (Prim's Algorithm)Shortest path (Dijkistra's Algorithm) & Spanning Tree (Prim's Algorithm)
Shortest path (Dijkistra's Algorithm) & Spanning Tree (Prim's Algorithm)
 

Viewers also liked

Different types of_triangles
Different types of_trianglesDifferent types of_triangles
Different types of_trianglesWorserbay
 
Geometry 201 unit 5.4
Geometry 201 unit 5.4Geometry 201 unit 5.4
Geometry 201 unit 5.4Mark Ryder
 
Midpoints (Geometry 2_5)
Midpoints (Geometry 2_5)Midpoints (Geometry 2_5)
Midpoints (Geometry 2_5)rfant
 
G.2 teacher types of triangle and angles of triangles
G.2 teacher types of triangle and angles of trianglesG.2 teacher types of triangle and angles of triangles
G.2 teacher types of triangle and angles of trianglesmbennett78
 
Types Of Triangles
Types Of TrianglesTypes Of Triangles
Types Of Trianglesstarbuck
 
Scientific notation powerpoint
Scientific notation powerpointScientific notation powerpoint
Scientific notation powerpointEdison Orgil
 

Viewers also liked (12)

Section 3
Section 3Section 3
Section 3
 
Different types of_triangles
Different types of_trianglesDifferent types of_triangles
Different types of_triangles
 
Geometry 201 unit 5.4
Geometry 201 unit 5.4Geometry 201 unit 5.4
Geometry 201 unit 5.4
 
Midpoints (Geometry 2_5)
Midpoints (Geometry 2_5)Midpoints (Geometry 2_5)
Midpoints (Geometry 2_5)
 
G.2 teacher types of triangle and angles of triangles
G.2 teacher types of triangle and angles of trianglesG.2 teacher types of triangle and angles of triangles
G.2 teacher types of triangle and angles of triangles
 
Triangle &types by sides
Triangle &types by sidesTriangle &types by sides
Triangle &types by sides
 
110 module1 2
110 module1 2110 module1 2
110 module1 2
 
Types Of Triangles
Types Of TrianglesTypes Of Triangles
Types Of Triangles
 
4 triangles
4 triangles4 triangles
4 triangles
 
Coordinate geometry
Coordinate geometryCoordinate geometry
Coordinate geometry
 
Scientific notation powerpoint
Scientific notation powerpointScientific notation powerpoint
Scientific notation powerpoint
 
Triangles
TrianglesTriangles
Triangles
 

Similar to Lengths

Activity 1 (Directional Derivative and Gradient with minimum 3 applications)....
Activity 1 (Directional Derivative and Gradient with minimum 3 applications)....Activity 1 (Directional Derivative and Gradient with minimum 3 applications)....
Activity 1 (Directional Derivative and Gradient with minimum 3 applications)....loniyakrishn
 
C3L1_Tangent Lines and Velocity_G12A.pptx
C3L1_Tangent Lines and Velocity_G12A.pptxC3L1_Tangent Lines and Velocity_G12A.pptx
C3L1_Tangent Lines and Velocity_G12A.pptxkaran11dhawan
 
CALCULUS chapter number one presentation
CALCULUS chapter number one presentationCALCULUS chapter number one presentation
CALCULUS chapter number one presentationkdoha825
 
Applied III Chapter 4(1).pdf
Applied III  Chapter 4(1).pdfApplied III  Chapter 4(1).pdf
Applied III Chapter 4(1).pdfDawitThomas
 
Mathematical blog #1
Mathematical blog #1Mathematical blog #1
Mathematical blog #1Steven Pauly
 
Hssc ii introduction of limits
Hssc ii   introduction of limitsHssc ii   introduction of limits
Hssc ii introduction of limitsSadiq Hussain
 
1.2 deflection of statically indeterminate beams by moment area method
1.2 deflection of statically indeterminate beams by moment area method1.2 deflection of statically indeterminate beams by moment area method
1.2 deflection of statically indeterminate beams by moment area methodNilesh Baglekar
 
6_nome_e_numero_Chapra_Canale_1998_Numerical_Differentiation_and_Integration.pdf
6_nome_e_numero_Chapra_Canale_1998_Numerical_Differentiation_and_Integration.pdf6_nome_e_numero_Chapra_Canale_1998_Numerical_Differentiation_and_Integration.pdf
6_nome_e_numero_Chapra_Canale_1998_Numerical_Differentiation_and_Integration.pdfOke Temitope
 
dynamics chapter 2.pptx
dynamics chapter 2.pptxdynamics chapter 2.pptx
dynamics chapter 2.pptxJibrilJundi
 
Derivación e integración de funciones de varias variables
Derivación e integración de funciones de varias variablesDerivación e integración de funciones de varias variables
Derivación e integración de funciones de varias variablesRicardoAzocar3
 

Similar to Lengths (20)

Distance
DistanceDistance
Distance
 
Activity 1 (Directional Derivative and Gradient with minimum 3 applications)....
Activity 1 (Directional Derivative and Gradient with minimum 3 applications)....Activity 1 (Directional Derivative and Gradient with minimum 3 applications)....
Activity 1 (Directional Derivative and Gradient with minimum 3 applications)....
 
C3L1_Tangent Lines and Velocity_G12A.pptx
C3L1_Tangent Lines and Velocity_G12A.pptxC3L1_Tangent Lines and Velocity_G12A.pptx
C3L1_Tangent Lines and Velocity_G12A.pptx
 
CALCULUS chapter number one presentation
CALCULUS chapter number one presentationCALCULUS chapter number one presentation
CALCULUS chapter number one presentation
 
Curves in space
Curves in spaceCurves in space
Curves in space
 
Applied III Chapter 4(1).pdf
Applied III  Chapter 4(1).pdfApplied III  Chapter 4(1).pdf
Applied III Chapter 4(1).pdf
 
Calculus I basic concepts
Calculus I basic conceptsCalculus I basic concepts
Calculus I basic concepts
 
Mathematical blog #1
Mathematical blog #1Mathematical blog #1
Mathematical blog #1
 
Network Theory
Network TheoryNetwork Theory
Network Theory
 
Junior Seminar copy
Junior Seminar  copyJunior Seminar  copy
Junior Seminar copy
 
Hssc ii introduction of limits
Hssc ii   introduction of limitsHssc ii   introduction of limits
Hssc ii introduction of limits
 
Glossary ib
Glossary ibGlossary ib
Glossary ib
 
1543 integration in mathematics b
1543 integration in mathematics b1543 integration in mathematics b
1543 integration in mathematics b
 
1.2 deflection of statically indeterminate beams by moment area method
1.2 deflection of statically indeterminate beams by moment area method1.2 deflection of statically indeterminate beams by moment area method
1.2 deflection of statically indeterminate beams by moment area method
 
Siegel
SiegelSiegel
Siegel
 
6_nome_e_numero_Chapra_Canale_1998_Numerical_Differentiation_and_Integration.pdf
6_nome_e_numero_Chapra_Canale_1998_Numerical_Differentiation_and_Integration.pdf6_nome_e_numero_Chapra_Canale_1998_Numerical_Differentiation_and_Integration.pdf
6_nome_e_numero_Chapra_Canale_1998_Numerical_Differentiation_and_Integration.pdf
 
dynamics chapter 2.pptx
dynamics chapter 2.pptxdynamics chapter 2.pptx
dynamics chapter 2.pptx
 
Design & Analysis of Algorithms Assignment Help
Design & Analysis of Algorithms Assignment HelpDesign & Analysis of Algorithms Assignment Help
Design & Analysis of Algorithms Assignment Help
 
Derivación e integración de funciones de varias variables
Derivación e integración de funciones de varias variablesDerivación e integración de funciones de varias variables
Derivación e integración de funciones de varias variables
 
Hsieh etal spl
Hsieh etal splHsieh etal spl
Hsieh etal spl
 

Recently uploaded

Emixa Mendix Meetup 11 April 2024 about Mendix Native development
Emixa Mendix Meetup 11 April 2024 about Mendix Native developmentEmixa Mendix Meetup 11 April 2024 about Mendix Native development
Emixa Mendix Meetup 11 April 2024 about Mendix Native developmentPim van der Noll
 
Time Series Foundation Models - current state and future directions
Time Series Foundation Models - current state and future directionsTime Series Foundation Models - current state and future directions
Time Series Foundation Models - current state and future directionsNathaniel Shimoni
 
The Future Roadmap for the Composable Data Stack - Wes McKinney - Data Counci...
The Future Roadmap for the Composable Data Stack - Wes McKinney - Data Counci...The Future Roadmap for the Composable Data Stack - Wes McKinney - Data Counci...
The Future Roadmap for the Composable Data Stack - Wes McKinney - Data Counci...Wes McKinney
 
How to write a Business Continuity Plan
How to write a Business Continuity PlanHow to write a Business Continuity Plan
How to write a Business Continuity PlanDatabarracks
 
TrustArc Webinar - How to Build Consumer Trust Through Data Privacy
TrustArc Webinar - How to Build Consumer Trust Through Data PrivacyTrustArc Webinar - How to Build Consumer Trust Through Data Privacy
TrustArc Webinar - How to Build Consumer Trust Through Data PrivacyTrustArc
 
What is DBT - The Ultimate Data Build Tool.pdf
What is DBT - The Ultimate Data Build Tool.pdfWhat is DBT - The Ultimate Data Build Tool.pdf
What is DBT - The Ultimate Data Build Tool.pdfMounikaPolabathina
 
Assure Ecommerce and Retail Operations Uptime with ThousandEyes
Assure Ecommerce and Retail Operations Uptime with ThousandEyesAssure Ecommerce and Retail Operations Uptime with ThousandEyes
Assure Ecommerce and Retail Operations Uptime with ThousandEyesThousandEyes
 
The Fit for Passkeys for Employee and Consumer Sign-ins: FIDO Paris Seminar.pptx
The Fit for Passkeys for Employee and Consumer Sign-ins: FIDO Paris Seminar.pptxThe Fit for Passkeys for Employee and Consumer Sign-ins: FIDO Paris Seminar.pptx
The Fit for Passkeys for Employee and Consumer Sign-ins: FIDO Paris Seminar.pptxLoriGlavin3
 
Generative Artificial Intelligence: How generative AI works.pdf
Generative Artificial Intelligence: How generative AI works.pdfGenerative Artificial Intelligence: How generative AI works.pdf
Generative Artificial Intelligence: How generative AI works.pdfIngrid Airi González
 
Merck Moving Beyond Passwords: FIDO Paris Seminar.pptx
Merck Moving Beyond Passwords: FIDO Paris Seminar.pptxMerck Moving Beyond Passwords: FIDO Paris Seminar.pptx
Merck Moving Beyond Passwords: FIDO Paris Seminar.pptxLoriGlavin3
 
The Ultimate Guide to Choosing WordPress Pros and Cons
The Ultimate Guide to Choosing WordPress Pros and ConsThe Ultimate Guide to Choosing WordPress Pros and Cons
The Ultimate Guide to Choosing WordPress Pros and ConsPixlogix Infotech
 
Testing tools and AI - ideas what to try with some tool examples
Testing tools and AI - ideas what to try with some tool examplesTesting tools and AI - ideas what to try with some tool examples
Testing tools and AI - ideas what to try with some tool examplesKari Kakkonen
 
Modern Roaming for Notes and Nomad – Cheaper Faster Better Stronger
Modern Roaming for Notes and Nomad – Cheaper Faster Better StrongerModern Roaming for Notes and Nomad – Cheaper Faster Better Stronger
Modern Roaming for Notes and Nomad – Cheaper Faster Better Strongerpanagenda
 
Moving Beyond Passwords: FIDO Paris Seminar.pdf
Moving Beyond Passwords: FIDO Paris Seminar.pdfMoving Beyond Passwords: FIDO Paris Seminar.pdf
Moving Beyond Passwords: FIDO Paris Seminar.pdfLoriGlavin3
 
From Family Reminiscence to Scholarly Archive .
From Family Reminiscence to Scholarly Archive .From Family Reminiscence to Scholarly Archive .
From Family Reminiscence to Scholarly Archive .Alan Dix
 
UiPath Community: Communication Mining from Zero to Hero
UiPath Community: Communication Mining from Zero to HeroUiPath Community: Communication Mining from Zero to Hero
UiPath Community: Communication Mining from Zero to HeroUiPathCommunity
 
The State of Passkeys with FIDO Alliance.pptx
The State of Passkeys with FIDO Alliance.pptxThe State of Passkeys with FIDO Alliance.pptx
The State of Passkeys with FIDO Alliance.pptxLoriGlavin3
 
So einfach geht modernes Roaming fuer Notes und Nomad.pdf
So einfach geht modernes Roaming fuer Notes und Nomad.pdfSo einfach geht modernes Roaming fuer Notes und Nomad.pdf
So einfach geht modernes Roaming fuer Notes und Nomad.pdfpanagenda
 
Sample pptx for embedding into website for demo
Sample pptx for embedding into website for demoSample pptx for embedding into website for demo
Sample pptx for embedding into website for demoHarshalMandlekar2
 
A Framework for Development in the AI Age
A Framework for Development in the AI AgeA Framework for Development in the AI Age
A Framework for Development in the AI AgeCprime
 

Recently uploaded (20)

Emixa Mendix Meetup 11 April 2024 about Mendix Native development
Emixa Mendix Meetup 11 April 2024 about Mendix Native developmentEmixa Mendix Meetup 11 April 2024 about Mendix Native development
Emixa Mendix Meetup 11 April 2024 about Mendix Native development
 
Time Series Foundation Models - current state and future directions
Time Series Foundation Models - current state and future directionsTime Series Foundation Models - current state and future directions
Time Series Foundation Models - current state and future directions
 
The Future Roadmap for the Composable Data Stack - Wes McKinney - Data Counci...
The Future Roadmap for the Composable Data Stack - Wes McKinney - Data Counci...The Future Roadmap for the Composable Data Stack - Wes McKinney - Data Counci...
The Future Roadmap for the Composable Data Stack - Wes McKinney - Data Counci...
 
How to write a Business Continuity Plan
How to write a Business Continuity PlanHow to write a Business Continuity Plan
How to write a Business Continuity Plan
 
TrustArc Webinar - How to Build Consumer Trust Through Data Privacy
TrustArc Webinar - How to Build Consumer Trust Through Data PrivacyTrustArc Webinar - How to Build Consumer Trust Through Data Privacy
TrustArc Webinar - How to Build Consumer Trust Through Data Privacy
 
What is DBT - The Ultimate Data Build Tool.pdf
What is DBT - The Ultimate Data Build Tool.pdfWhat is DBT - The Ultimate Data Build Tool.pdf
What is DBT - The Ultimate Data Build Tool.pdf
 
Assure Ecommerce and Retail Operations Uptime with ThousandEyes
Assure Ecommerce and Retail Operations Uptime with ThousandEyesAssure Ecommerce and Retail Operations Uptime with ThousandEyes
Assure Ecommerce and Retail Operations Uptime with ThousandEyes
 
The Fit for Passkeys for Employee and Consumer Sign-ins: FIDO Paris Seminar.pptx
The Fit for Passkeys for Employee and Consumer Sign-ins: FIDO Paris Seminar.pptxThe Fit for Passkeys for Employee and Consumer Sign-ins: FIDO Paris Seminar.pptx
The Fit for Passkeys for Employee and Consumer Sign-ins: FIDO Paris Seminar.pptx
 
Generative Artificial Intelligence: How generative AI works.pdf
Generative Artificial Intelligence: How generative AI works.pdfGenerative Artificial Intelligence: How generative AI works.pdf
Generative Artificial Intelligence: How generative AI works.pdf
 
Merck Moving Beyond Passwords: FIDO Paris Seminar.pptx
Merck Moving Beyond Passwords: FIDO Paris Seminar.pptxMerck Moving Beyond Passwords: FIDO Paris Seminar.pptx
Merck Moving Beyond Passwords: FIDO Paris Seminar.pptx
 
The Ultimate Guide to Choosing WordPress Pros and Cons
The Ultimate Guide to Choosing WordPress Pros and ConsThe Ultimate Guide to Choosing WordPress Pros and Cons
The Ultimate Guide to Choosing WordPress Pros and Cons
 
Testing tools and AI - ideas what to try with some tool examples
Testing tools and AI - ideas what to try with some tool examplesTesting tools and AI - ideas what to try with some tool examples
Testing tools and AI - ideas what to try with some tool examples
 
Modern Roaming for Notes and Nomad – Cheaper Faster Better Stronger
Modern Roaming for Notes and Nomad – Cheaper Faster Better StrongerModern Roaming for Notes and Nomad – Cheaper Faster Better Stronger
Modern Roaming for Notes and Nomad – Cheaper Faster Better Stronger
 
Moving Beyond Passwords: FIDO Paris Seminar.pdf
Moving Beyond Passwords: FIDO Paris Seminar.pdfMoving Beyond Passwords: FIDO Paris Seminar.pdf
Moving Beyond Passwords: FIDO Paris Seminar.pdf
 
From Family Reminiscence to Scholarly Archive .
From Family Reminiscence to Scholarly Archive .From Family Reminiscence to Scholarly Archive .
From Family Reminiscence to Scholarly Archive .
 
UiPath Community: Communication Mining from Zero to Hero
UiPath Community: Communication Mining from Zero to HeroUiPath Community: Communication Mining from Zero to Hero
UiPath Community: Communication Mining from Zero to Hero
 
The State of Passkeys with FIDO Alliance.pptx
The State of Passkeys with FIDO Alliance.pptxThe State of Passkeys with FIDO Alliance.pptx
The State of Passkeys with FIDO Alliance.pptx
 
So einfach geht modernes Roaming fuer Notes und Nomad.pdf
So einfach geht modernes Roaming fuer Notes und Nomad.pdfSo einfach geht modernes Roaming fuer Notes und Nomad.pdf
So einfach geht modernes Roaming fuer Notes und Nomad.pdf
 
Sample pptx for embedding into website for demo
Sample pptx for embedding into website for demoSample pptx for embedding into website for demo
Sample pptx for embedding into website for demo
 
A Framework for Development in the AI Age
A Framework for Development in the AI AgeA Framework for Development in the AI Age
A Framework for Development in the AI Age
 

Lengths

  • 1. Left endpoint A Above all, the Pythagorean theorem is a distance formula between two points.C represents the straight-line distance between the two points, where the difference between the x-coordinates of the points is ±a and the difference between the y- coordinates of the points is ±b, or vice-versa, since any two points can be represented in one x-y plane. The Pythagorean theorem is of fundamental importance and is far-reaching in mathematics. Here is one example why: Right endpoint B Let’s say that the graph on the left represents the path of an object through two-dimensional space, and that its x and y values at each point represent perpendicular components of displacement from a reference point.To be clear, this would actually be a parametric function of some other variable such as time, but right now that fact is irrelevant. The left endpoint on the graph of the object’s path indicates the object’s location relative to the reference point at the beginning of the interval and the right endpoint indicates its relative location at the end of the interval, which can be thought of as a time interval but not necessarily. Obviously, the Pythagorean theorem allows us to calculate the shortest distance between the object’s starting location and ending location, but it also allows us to calculate the length of the curve on the graph, and since x and y are components of a parametric function of some other variable and represent perpendicular directions in two- dimensional space, the length of the curve (in the same units of measurement as stated by the graph) is equal to the total length of the object’s path during the interval, or more simply put, the total distance the object travelled during the interval. Unfortunately for us, we do not have formulas for lengths of nonlinear curves yet, but we will, after we use the Pythagorean theorem, which only applies to line segments, to help us derive such formulas. We can treat the straight-line distance between endpoints as a crude approximation of the curve’s length, and we calculate this distance using the Pythagorean theorem. What happens if we do this for two subintervals and add up the distances between the endpoints of each to approximate the curve’s length? The approximation will automatically be more accurate, and in fact, as n, the number of subintervals taken into account, increases, the accuracy of the approximations using n subintervals increases or stays the same.
  • 2. More important than the number of subintervals is the requirement that all of their lengths get smaller and smaller and approach zero. This infinitely small interval involves infinitely small changes in x and y, called differentials. What matters more than their respective quantities, which they do not actually have since they are infinitely small, is their relative quantities, the ratio of the y differential to x differential or vice versa, over each infinitely small subinterval. The picture on the left shows Δx as h and Δy as f(x+h) – f(x) over the interval from x to x+h. The straight-line distance between the interval’s two endpoints is ((Δx)2 + (Δy)2)1/2, the square root of c2 in the Pythagorean equation. As h approaches 0, the error in approximating the curve length over each interval with the Pythagorean straight-line distance formula approaches 0, or in other words the Pythagorean approximation of curve length becomes more accurate as the interval over which it is used gets smaller. If ((Δx)2 + (Δy)2)1/2 equals the curve length over infinitely small intervals, how can we add up the curve lengths of all the infinitely small subintervals to get the total curve length of the whole interval? It is impossible to calculate the hypotenuse of each right triangle formed by the x and y differentials over each subinterval because differentials don’thave absolute sizes. However, as stated earlier, the x and y differentials over infinitely small intervals do have relative sizes and that should make sense because every point on a differentiable curve has a derivative that represents the quotient dy/dx at that point, and dy/dx represents the Δy per infinitely small Δx, where Δx and Δy are differentials. ((Δx)2 + (Δy)2)1/2 equals the curve length over an infinitely small interval, where Δx and Δy are called differentials. Δy = Δy Δx = dy dx because infinitely small Δy = dy and ---------- ---------- Δx dx infinitely small Δx = dx Let y’ denote the derivative of y with respect to x even if the two variables are actually independent of each other (due to the fact that x and y model positions in perpendicular directions of two dimensional space as part of a parametric function), since all we care about right now is length.
  • 3. (Δx)2 = (dx)2 (Δy)2 = (y’dx)2 = (y’)2(dx)2 ((Δx)2 + (Δy)2)1/2 = ((dx)2 + (y’)2(dx)2)1/2 = ((dx)2(1 + (y’)2))1/2 = dx(1 + (y’)2)1/2 = length of curve over infinitely small interval How do we add up all of the infinitely small curve lengths? By integrating. (1 (y') 2 ) 1 / 2 dx a b where a is the left endpoint and b is the right endpoint of the interval over which we integrate. For what we are trying to accomplish, which is derive a formula for curve length, we can arbitrarily call y “f(x)” if the curves we are dealing with represent y as functions of x, because even though the example situation called for a parametric functionwith x and y as separate functions of the same variable, like t for time, all we may want to know is the length of the curve on the graph and not what the length of the curve represents or means in the specific situation in which it is calculated. If y cannot be written as a function of x but x can be written as a function of y, then the length of the curve over the interval from y = c to y = d equals (1 ( f '(y)) 2 c d ) 1 / 2 dy ,
  • 4. or, using more common notation, 1 ( f '(y)) 2 c d dy *Picture taken from http://www.eldamar.org.uk/maths/calculus/node2.html