Minimizing geodesic: Difference between revisions
No edit summary |
m (2 revisions) |
||
(One intermediate revision by the same user not shown) | |||
Line 5: | Line 5: | ||
A [[metric space]] <math>M</math> equipped with a metric <math>d</math>. | A [[metric space]] <math>M</math> equipped with a metric <math>d</math>. | ||
==Definition part | ==Definition part== | ||
A path <math>\gamma: [0,1] \to M</math> is termed a '''minimizing geodesic''' if it is the shortest path from <math>\gamma(0)</math> to <math>\gamma(1)</math>. | A path <math>\gamma: [0,1] \to M</math> is termed a '''minimizing geodesic''' if it is the shortest path from <math>\gamma(0)</math> to <math>\gamma(1)</math>. |
Latest revision as of 19:49, 18 May 2008
Definition
Given data
A metric space equipped with a metric .
Definition part
A path is termed a minimizing geodesic if it is the shortest path from to .
By shortest, we mean path of minimum length where the length of a path is defined as: