TITLE: Why the negative gradient gives the direction of the steepest decrease in the gradient descent algorithm?
QUESTION [5 upvotes]: I understand that the gradient vector gives the direction of the maximum growth. What I don't get is why going the exact opposite direction is going to get the maximum decrease? 
By sure that holds for a single variable function because it only have 2 ways to go. But in a multivariable domain I can imagine that just going the opposite may not be the maximum decrease as I could go many other paths and maybe some of them are better.
Is is the case that the only happens in the case the function is differentiable?

REPLY [3 votes]: This is really related to the very definition of differentiable. I can imagine, why you have doubts about this, as thinking of real surfaces that occur in nature gives the impression that the directions of steepest increase and decrease are not opposite of each other.
But now recall that a function is called differentiable, if it can approximated locally by a plane. In other words: a differentiable function looks like a plane locally, and for a plane it is pretty clear why the directions of steepest descent and increase are opposite of each other.
Another thing: Just "existence of partial derivatives" (i.e. the gradient can be computed) does not imply that the negative gradient is the steepest descent direction.