How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
For a differentiable scalar field, and the unit direction of steepest ascent is the normalized gradient
Statement
If a scalar-valued is totally differentiable at , then for every . Among unit vectors , this is at most ; if the gradient is nonzero, equality holds exactly in the direction . If the gradient is zero, every unit direction has directional derivative zero.
Facts & Assumptions
Given: A scalar-valued totally differentiable at and a direction .
A total derivative computes every directional derivative, and its matrix is the Jacobian (A total derivative computes every directional derivative, and its matrix is the Jacobian).
Proof
By [L1], is the Jacobian row applied to , namely .
If and , [L2] gives , with equality at .
If , step 1.1 makes every directional derivative zero; together with step 2.1 this proves the stated alternatives.
Depends on
- A total derivative computes every directional derivative, and its matrix is the Jacobian
- The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
Used by
Dependency tree · two levels
19 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- J. Lebl, Basic Analysis I, §8.3 (standard reference, not scraped)