[Math] Shortest path between two points in a cone with a condition that the path should always be uphill.

calculuscoordinate systemsdifferentialgeometryreal-analysis

Let there be a right-circular cone with vertex O, radius$=20$ units and slant height$=60$ units. Let $A$ be a point on the base of the cone and B be a point on the line joining $OA$. Also $AB=10$ units. Find the shortest path and hence the shortest distance from $A$ to $B$ that goes around the cone with a condition that the path should always go strictly uphill.

I can solve it without that condition "strictly". I can understand that $OB<OX$ for any $X$ in the path from $A$ to $B$.

A complete solution or an idea is deeply appreciated.

Best Answer

If the condition were merely that the path cannot go downhill, to find the shortest path you could unroll the cone to a circular wedge with radius $60$ and vertex angle $\frac23\pi.$ The shortest path would run along a straight segment from one end of the radius-$60$ arc to a tangent point on a concentric arc of radius $50$ and then follow the radius-$50$ arc to the other end. If $L$ is the length of this path, then $$L=\sqrt{60^2-50^2} + 50\left(\frac23\pi - \arccos\frac56\right).$$

Here's a rough sketch of the unrolled cone and the key features of the shortest never-downhill path:

enter image description here

Angle $\angle AOB = \frac23\pi,$ angle $\angle AOT = \arccos\frac56,$ the line $AT$ is tangent to the arc $BT$ at $T,$ and the path consists of the segment $AT$ and the arc $BT.$

Intuitively, since we can never get closer than distance $50$ from $O$ (since otherwise we'd have to go downhill to get to $B$), the path is constrained to the region between the two arcs. If we imagine running a string from $A$ to $B$ and then pull the string as tight as possible, all while staying within that region, the string will follow the path shown.

Any other path that goes around the cone from $A$ to $B$ will either go downhill at some point or will be longer than $L.$ But you can construct a path that is uphill everywhere and whose length is as close to $L$ as you want simply by replacing the arc of radius $50$ by a suitable spiral. For example, construct a spiral path from $B$ to a point $C$ on $OA$ such that $OC = 50.000001,$ then construct a line through $A$ tangent to that spiral at a point $T'$; the path is the segment $AT'$ plus the part of the spiral from $T'$ to $B,$ all of it strictly uphill. To make an even shorter path, set $OC = 50.000000001$ instead of $50.000001.$ The only limit on how short you can make this path is that if you reduce $OC$ to $50$ exactly, then you have a path of exactly length $L,$ but then the path is not strictly uphill the whole way.

Hence the number you are seeking, the length of the shortest uphill path around the cone from $A$ to $B,$ is the smallest number greater than $L.$