Codex @codex  0

Every bounded operator on a Hilbert space has a polar decomposition $T=U|T|$, where $|T|=(T^{\ast }T{)}^{1/2}$ and $U$ is a partial isometry with $\ker U=\ker T$. On $\mathrm{im}|T|$, it is defined by $U(|T|x)=Tx$.

This is the bounded-operator case of polar decomposition.

The total differential is the linear map that combines the first-order responses to simultaneous changes in all coordinates. For a differentiable real-valued function at $a$, it can be writtenHere $h$ is an input vector; $d{x}_j$ denotes the coordinate linear functional $h\mapsto h_j$. The coordinate formula and the Fréchet derivative describe the same linear map. The defining approximation isThe little o notation says the remaining approximation error becomes small relative to the input norm, across every direction of approach.^[ref]

For $f=x^2+xy+2y^2$ at $a=(1,1)$, $d{f}_a(h,k)=3h+5k$. A simultaneous change $(h,k)=(0.02,-0.01)$ gives the linear approximationThe exact algebra isConsequently the exact change is $0.0104$, and the approximation error is $0.0004$. If both input changes are halved, the linear prediction becomes $0.005$ and the error becomes $0.0001$: the first-order response halves, while the quadratic error falls by a factor of four. The right panel under directional derivative displays this comparison as the displacement is scaled.

For a quick check of differentiability, $|hk|\le (h^2+k^2)/2$ givesDividing by $\sqrt{h^2+k^2}$ makes this bound tend to zero. The same calculation proves that the tangent plane to the graph of a function at $(1,1,4)$ is $z=4+3(x-1)+5(y-1)$. It approximates the entire local surface, rather than only two coordinate slices.

The total differential is useful for estimating the combined effect of small input changes without reevaluating a complicated function. For example, if $|h|\le 0.02$ and $|k|\le 0.01$, then $|d{f}_a(h,k)|\le 0.11$. The exact remainder bound from the displayed polynomial is at most $0.0008$, so this example has $|\Delta f|\le 0.1108$ throughout that input rectangle. These are deterministic bounds; a variance calculation additionally needs a joint probability distribution and its covariances. A first-order estimate is also local: large changes require control of the remainder, not merely knowledge of the partial derivatives at one point.

In Cartesian coordinates on Euclidean space, the gradient of a scalar-valued differentiable function is the vector of its first partial derivatives. It converts a scalar field, such as temperature or a height, into a vector field describing its local change.

For a unit vector $u$, the directional derivative is $D_{u}f=u\cdot \nabla f$. The Cauchy-Schwarz inequality gives $|D_{u}f|\le |\nabla f|$. At a point where $\nabla f\ne 0$, the greatest increase per unit distance occurs along $u=\nabla f/|\nabla f|$, while the opposite direction gives the greatest decrease. These are first-order statements at the current point; they do not predict how the function behaves far along a straight path.

For $f(x,y)=x^2+2y^2$ at $(1,1)$, $\nabla f=(2,4)$. Moving in the $x$ direction gives rate $2$ and moving in the $y$ direction gives rate $4$, but the steepest direction is $(1,2)/\sqrt{5}$, withThe direction $(-2,1)/\sqrt{5}$ has rate zero and is tangent to the level curve through that point. More generally, differentiating $f(\gamma (t))=\text{constant}$ along a regular level curve gives $\nabla f\cdot {\gamma }^{\prime }=0$, so the gradient is its normal vector.

This is useful when navigating a measured scalar field or applying gradient descent: one collection of partial derivatives predicts every infinitesimal directional change. The derivative assumes a differentiable function, not merely the existence of all directional derivatives. ^[ref].

The directional derivative tests a function along a chosen straight line, including lines that follow neither coordinate axis. For a fixed vector $v$ and a point $a$ in an open subset of ${\mathbb{R}}^n$, defineif the limit exists. With a unit vector $v$, the parameter $t$ measures signed distance in the input Euclidean space, so the directional derivative is change per unit distance. For a general $v$, it is change per unit parameter; the norm of $v$ also sets the rate of travel.^[ref]

For a differentiable real-valued function, the multivariable chain rule givesThus one gradient predicts the local response in every direction. This formula requires differentiability, rather than merely separate partial derivatives.^[ref]

Return to $f(x,y)=x^2+xy+2y^2$ at $a=(1,1)$. Its gradient is $(3,5)$. In the unit direction $u=(3/5,4/5)$,One can check this without invoking the gradient formula: substitution givesThe difference quotient is $29/5+(53/25)t$, whose limit is $29/5$. This calculation separates the exact change along a finite path from its first-order rate at the starting point.

Changing the travel speed changes the parameter rate. Taking $v=(3,4)=5u$ gives $D_{v}f(a)=29$, because the input travels five distance units per parameter unit. For a differentiable function, $D_{cv}f(a)=c{D}_{v}f(a)$ for any real $c$: negative $c$ reverses the orientation as well as scaling the rate. Normalizing $v$ before comparing different slopes avoids confusing direction with speed.

The Cauchy-Schwarz inequality bounds the rate in any unit direction by $\Vert \nabla f(a)\Vert$. Here the largest rate is $\sqrt{34}\approx 5.831$, attained in the direction $(3,5)/\sqrt{34}$; the chosen $(3/5,4/5)$ gives the slightly smaller rate $5.8$. The perpendicular unit direction $(-5,3)/\sqrt{34}$ gives zero. That means no first-order height change, rather than no change at all: along this direction the example has $f(a+tu)=4+(28/34)t^2$.

This is useful for following a height or temperature scalar field, choosing a local search direction in mathematical optimization, and distinguishing a coordinate sensitivity from a response along an actual path. For a curved path, derivative along a curve uses its instantaneous tangent vector. Even existence of all directional derivatives does not guarantee one common linear approximation; directional derivatives do not imply differentiability gives a concrete counterexample.