I realize that “rule 2” from the previous post is actually just a special case of the vector chain rule.

**Rule 4.** (Chain rule)

If , then

, or equivalently,

.

Here, I have used to denote the argument of . (That makes it look more like the usual chain rule.)

From this, you get the special case where is a scalar function. (I use the non-boldface in to suggest that is a scalar function that operates ‘element-wise’ on vector input.)

**Rule 4.** (Chain rule– special case for a scalar function)

If , then

, or equivalently,

.

In the last line, I use the fact that .

Finally, substituting gives the special case below.

These are just elementary applications of Tensor Calculus, an over a century old subject. Look for an elementary introduction as probably you only need calculations in Euclidean space.

There are tensor packages for Maple, Mathematica, Macsyma, Reduce, …, as well as standalone systems.

As I said, there is no doubt that these things are known. I am pretty confident that these rules (in the form I wrote them) must pre-date the invention of tensors. I wouldn’t be surprised if they were known in the early 18th century. If you have a specific reference, by all means share it.

Anyway, I’m not familiar with the packages for

symbolicmanipulation of tensors, but I do know that there is better/faster software available fornumericalcomputation using matrices. So it certainly seems useful to have results in a non-tensor form, when the result can be conveniently written with regular matrices and vectors.