The numerator equals , while . Thus, wherever the original quotient is defined,
In particular a zero numerator and denominator cannot be cancelled; the original expression requires . This is the rearrangement of Bayes' theorem.
The conditional probability product rule gives . Applying it once more gives
The conditionals in the original expression require their conditioning events to have positive probability.
The vector is constant, so . Also , by the same chain rule. The product rule therefore yields
The three components follow by differentiating .
For , the chain rule gives , with analogous formulas for the other components. Hence
On the right the numerator denotes the position vector, while its denominator is the cube of its magnitude.
The cofactor matrix is . Transpose it to form the adjugate matrix, and divide by the determinant :
Direct matrix multiplication gives , checking all entries.
The horizontal direction of steepest descent on a graph surface is parallel to . On the line , the component vanishes identically, so that line is invariant under the downhill path. Starting at , for , so decreases towards zero. The path reaches the minimum
At the minimum no strictly downhill direction remains. A constant-speed parametrization reaches it after the finite arc length divided by ; the unnormalized gradient flow approaches the same endpoint only asymptotically in its own time parameter.
A tangent displacement has the form . At the specified point, and , so the fastest decrease of height per unit surface distance has and . The unit downhill tangent is . Therefore, for speed measured along the surface,
Its Euclidean norm is , and it is orthogonal to the surface normal. The general construction is steepest descent on a graph surface; using a horizontal speed equal to would overestimate the full three-dimensional speed.
For the graph surface , an upward normal is . At , let ; then and . Normalizing gives the unit normal vector
Its negative is the equally valid downward normal.
The zero level set consists of the lines and . The height is positive where and negative where that product is negative. In each of the four resulting regions, closed nonzero contours surround its extremum; levels closer to zero extend further from the extremum towards the zero-level axes and towards large distance. The height tends to zero at infinity. The figure marks the four extrema and central saddle point, and includes the downhill path used below.
Figure 1.
Contours, stationary points and the steepest downhill path on the Gaussian-weighted surface
. Details.
At the Hessian matrix is , with eigenvalues and , so is a saddle point. At the other four points the mixed second derivative vanishes and the two diagonal entries both equal . Hence
The four extrema are global: because each factor has maximum at absolute argument one.
Put and . The gradient components are and . If either or vanishes, both must vanish. Otherwise both squared coordinates must be one. Therefore the five stationary points in the original coordinates are
To retain the finite term after cancellation, expand far enough before dividing. The Maclaurin series are
Thus
and hence
The linear terms cancel: , whereas . Also . Their leading nonzero terms therefore give
The Maclaurin series remainder orders justify division after factoring out .
The Maclaurin series give and . Dividing by in a punctured neighborhood of zero gives

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact