For a flux and a weak solution of , discrete integration by parts and the fundamental theorem of calculus along a line segment show that solves , with and . Coercive quadratic-form bounds and operator norm bounds for on all segments between these gradients pass to . This produces a divergence-form elliptic operator without initially assuming second partial derivatives of .
For small measurement errors, write . Its partial derivatives and first-order propagation of uncertainty are
Here the values are standard deviations used to describe uncertainty, and is the covariance. Independent carrier-reading errors give ; correlated readings require the term . Averaging repeated independent pairs reduces the random component of the uncertainty of the mean, but does not remove calibration or model errors.
As a stipulated uncertainty calculation, let , , and , with all three input errors independent. Then , , and . The result would be with this standard uncertainty in the stipulated thin lens model; these numbers are not a measured uncertainty budget. A small neglected principal-plane separation gives an additional first-order bias , distinct from that random budget.
Figure 1.
Bessel lens displacement method: merging settings and focal length sensitivity
. Original ideal-model curves. Left: settings versus object-screen separation for fixed ; below there is no real setting on the fixed screen. Right: inferred focal length versus measured displacement at fixed , with its tangent at the stipulated . The curves are predictions, not experimental points. Details.
The two kinds of sensitivity must be distinguished. At fixed focal length,
These derivatives diverge as approaches from above: a small change in object-screen spacing strongly changes the separation of the two settings. Yet the inferred focal length's displacement sensitivity tends to zero. That does not make coalescing settings easy to measure. For fixed , define the axial mismatch between the predicted real image and the screen as , for . At a focused setting,
Near , moving the optical lens changes this mismatch only weakly, making visual discrimination of the two settings difficult. At the example's settings and , so equal carrier motion produces different axial defocus responses. This is an axial mismatch calculation, not a full prediction of perceived image sharpness.
Choose sufficiently above to separate the two accepted focusing ranges, while retaining both real images on the available screen and rail. There is no universal best : focusing uncertainty itself depends on aperture, transverse magnification, optical aberrations and the target. Close to , the nonnegative measured separation and the quadratic term in also make first-order propagation of uncertainty unreliable if its error is comparable to its value. Repeatability, controls and the principal plane correction determine whether the elegant two-distance formula is an adequate measurement model.
Brownian motion Created 2026-09-24 Updated 2026-10-14
Standard one-dimensional Brownian motion is a real-valued stochastic process on a probability space with three defining properties: almost surely; its sample paths are continuous almost surely; and its Brownian increments over any finite collection of disjoint time intervals are independent, with
Here denotes the normal distribution with expectation and variance . The alternative symbol denotes the same kind of stochastic process. Continuity is a simultaneous statement about an entire sample path, rather than a separate assertion at each fixed time. Relative to its natural Brownian filtration, a future Brownian increment is independent of all observations up to its starting time.
The normalization gives , so the standard deviation of a Brownian increment over duration is . For , , and , the corresponding standard deviations are , , and . Time becoming one hundred times shorter makes typical displacement ten times smaller. Brownian scaling expresses this rule for the whole stochastic process, while the Brownian covariance kernel describes how positions at different times remain related despite independent increments.
For a concrete probability calculation, let be the cumulative distribution function of . At time four, has that normal distribution, hence
These numbers can be reproduced using the error function: . In particular, zero expectation does not mean small displacement: , but the same fixed interval contains only about of the probability at time four.
The probability density function of , for , is
Its partial derivatives satisfy
Thus the normal distribution spreads according to the heat equation. Starting at a fixed position replaces by . This is a useful bridge between individual random trajectories and the deterministic evolution of their probability density function: the same Brownian motion provides both descriptions.
Physical diffusion uses its own scale. For constant diffusion coefficient , the position model has variance , and its probability density function satisfies . For example, gives displacement variance after four seconds, hence standard deviation . Standard Brownian motion corresponds numerically to in chosen units; omitting the factor two changes the physical convention. Einstein's 1905 paper relates diffusion to the mean squared displacement in precisely this convention. [ref]
Continuity does not supply a smooth physical velocity. The difference quotient has normal distribution , so its standard deviation grows as : for the three durations above it is , , and . This calculation motivates the nowhere differentiability of Brownian motion, but it alone is not a proof of the simultaneous assertion at every time. The theorem says that, with probability one, no finite derivative exists anywhere along the sample path. A drawn polygon only displays a finite grid; its straight segments cannot establish this theorem. See Theorem 7.1.6 in Probability: Theory and Examples (fifth edition) by Rick Durrett.
For physical particles, Brownian motion is a model of position on suitable observation scales. It does not claim that microscopic velocity is a derivative of this idealized path. Einstein explicitly restricts his assumption of independent increments to intervals that are not too short. [ref]
Another way to measure the roughness is quadratic variation. On , divide time into equal intervals and form
Writing each Brownian increment as with independent standard normal random variables gives . Since and , the variance of is , and
This proves mean-square convergence to along uniform partitions. For and , the expectation is , the variance is , and the root mean square of the error is . For a general deterministic partition of an interval with lengths , the same calculation gives error variance , so shrinking the largest interval also suffices.
The resulting quadratic variation is , whereas the smooth function gives . This difference explains why the ordinary rules of calculus need the second-order correction in the Itô formula. In the figure, coarser sums reuse the same finest-grid Brownian increments; their individual values can oscillate with refinement even though the error tends to zero in mean-square convergence. Refining a fixed interpolating polygon forever would instead give zero quadratic variation, so the finite-grid illustration must not be confused with the limiting Brownian motion.
Historically, Brown's 1828 report describes microscopic observations made in 1827, starting with particles released from pollen and extending to inorganic materials; this challenged an explanation based solely on living matter. His observations and the later mathematical model are distinct contributions. [ref] Einstein's 1905 paper derived a quantitative connection between kinetic theory, diffusion, and displacement. [ref] Wiener's 1923 Differential-Space developed integration on spaces of paths, a foundation for Wiener measure; it also acknowledges earlier work and his own previous papers. These dates mark documented contributions rather than an assertion that each subject had a single discoverer. [ref]
For a hyperbolic partial differential equation in two variables, two independent characteristic coordinates remove both pure second partial derivatives, leaving a nonzero mixed second partial derivative. A nonzero Jacobian determinant is essential: two characteristic invariants that become dependent do not give a valid coordinate transformation.
Chemical potential Created 2026-09-24 Updated 2026-10-18
The chemical potential measures how a thermodynamic potential changes when matter is added under specified constraints. It plays for matter exchange the role that temperature plays for heat exchange: a difference supplies a direction, and equality characterizes thermodynamic equilibrium when the corresponding exchange is allowed. This connects diffusion, phase coexistence and chemical equilibrium through one quantity.
For a single component, the particle convention is
where is internal energy, counts particles, is entropy and is volume. This partial derivative holds entropy and volume fixed; it measures an incremental change rather than the average energy per particle. See David Tong, Statistical Physics, section 1.4.
In chemistry the molar convention instead uses amount of substance , measured in moles:
Here is Gibbs free energy, is temperature, is pressure and is the Avogadro constant. The units are per particle versus . For several chemical species, define each chemical potential by varying only its own particle count or amount of substance, with all other components' counts or amounts fixed. Many texts use for either convention, so the units and the variable being differentiated must identify it.
For a simple compressible system with variable component inventories, the fundamental differentials are
They describe changes between states in thermodynamic equilibrium with only pressure-volume work. If every component inventory is fixed, the sums vanish. The Gibbs free energy form follows by differentiating and using ; this is why the two definitions describe the same chemical potential in different units.
A chemical potential can be negative. Holding entropy fixed while adding matter need not increase internal energy; Tong explains this explicitly for a classical ideal gas in Statistical Physics, section 2.2.4. Its absolute sign also depends on the reference energy: replacing by shifts by . A common reference shift cancels from differences for the same chemical species, which are what determine exchange. Thus “energy cost” means a signed increment, not an always positive amount that must be supplied.
Clausius-Clapeyron relation Created 2026-09-24 Updated 2026-10-14
The Clapeyron equation connects the slope of a phase coexistence curve to the latent heat and the change in volume during a first-order phase transition. A steep boundary can indicate a large latent heat, a small change in volume, or both. This lets a measured boundary constrain caloric properties and predicts how changing pressure shifts a melting temperature.
For a pure substance in bulk phase coexistence, label the initial and final thermodynamic phases and . Both have the same absolute temperature , pressure , and chemical potential. With , , and denoting entropy, enthalpy, and volume on one common basis, define , , and . Then
The derivative follows the phase coexistence curve; it is not a partial derivative within one thermodynamic phase. Use molar volume with molar latent heat in , or specific volume with latent heat in . Both give in . For molar mass , and , so the predicted slope is independent of the chosen basis. This formulation assumes a simple compressible system, fixed composition, and negligible interface contributions; a curved interface can instead require the Young–Laplace equation.
For positive latent heat in the stated conversion direction, the sign of the slope is the sign of . Converting liquid to gas normally increases volume and gives a positive slope. The negative melting-point slope of water illustrates the opposite sign. At a thermodynamic critical point, the coexisting gas and liquid merge: both and vanish, so their ratio needs a limiting analysis rather than substitution of zero into the Clapeyron equation.[ref]
A short derivation uses the molar Gibbs free energy , equal to the chemical potential for a pure substance. Equality persists along the boundary, so with . Therefore . Equality of also gives . Eliminating yields the Clapeyron equation.
Complex derivative 2026-10-20
The complex derivative exists when this limit has the same finite value for increments approaching zero from every complex direction. For , real and imaginary increments give the necessary Cauchy-Riemann equations. Existence of those partial derivatives at one point alone is not sufficient for complex differentiability at a point; continuous partial derivatives in a neighbourhood, together with the Cauchy-Riemann equations there, give a standard sufficient condition for to be a holomorphic function.
Complex differentiability Created 2026-10-14 Updated 2026-10-25
A complex-valued function is complex differentiable at if
exists. The same limit must hold for every approach, including curved paths. Equivalently,
The error divided by tends to zero. Thus the derivative is a single complex multiplier, not an arbitrary real linear map of the plane. If the real coordinate map is differentiable, complex differentiability is equivalent to its satisfying the Cauchy-Riemann equations at that point.
The simplest failure is complex conjugation, . At every its increment quotient is . For real it is , while for it is . More generally, gives . Although complex conjugation is a smooth real reflection and has every real directional derivative, these incompatible quotients rule out a complex derivative everywhere.
Agreement on two axes is necessary, but does not by itself establish a limit over the whole complex plane. The Cauchy-Riemann equations need the real differentiability condition above, or a sufficient regularity condition such as continuous partial derivatives near the point. There is a second distinction: has complex derivative zero at zero because its quotient there is , but its Cauchy-Riemann equations fail at every nonzero point. It is complex differentiable at zero without being a holomorphic function on any neighbourhood of zero.
Compressibility Created 2026-10-14 Updated 2026-10-31
Compressibility measures how readily a sample's volume decreases when its pressure increases. For a simple compressible system with fixed particle number and composition, specify the constraint :
Here denotes pressure, also written elsewhere. The minus sign makes compressibility positive on a mechanically stable equilibrium branch. Its units are inverse pressure, ; its reciprocal is the constrained bulk modulus, measured in pascal units. Holding temperature fixed gives isothermal compressibility; holding entropy fixed gives isentropic compressibility along an isentropic process. The latter describes a reversible adiabatic compression, since an irreversible adiabatic process can increase entropy. [ref]
For an ideal gas, the ideal gas law and the reversible ideal-gas adiabat give, at the same equilibrium state,
Here and are the whole sample's heat capacity at constant pressure and heat capacity at constant volume, and is the heat capacity ratio. Constant is required for the finite-path formula . Reversible adiabatic compression raises the temperature, making the pressure rise more steeply than in an isothermal compression. Thus keeping entropy fixed makes the gas harder to compress locally. For a classical monatomic gas at , , so and ; the corresponding values of the bulk modulus are and .
For a smooth, stable single thermodynamic phase at positive temperature, Maxwell relations also imply
where is the coefficient of thermal expansion. The ideal gas result is one example of this broader link between mechanical and thermal responses. The equality is possible when and the other responses remain finite. These formulas compare equilibrium partial derivatives, rather than arbitrary fast or dissipative compression histories. [ref]
In Cartesian coordinates on four-dimensional Minkowski spacetime, all Conformal Killing vector fields have the form
Their conformal Killing factor is . There are four translation generators, six Lorentz transformation generators, one dilation generator, and four special conformal transformation generators. These form a fifteen-dimensional Lie algebra under the Lie bracket of vector fields.
For completeness, differentiate the Conformal Killing equation in three index orders to obtain
Its divergence gives ; its tensor contraction gives . Hence is an affine function. Subtracting the displayed quadratic and dilation terms leaves a Killing vector field whose second partial derivatives vanish, proving completeness of the list. The vector fields are globally smooth, but some special conformal transformations have incomplete flows on affine Minkowski spacetime; the dilation flow is global.
A vector field on an open subset of Euclidean space whose component functions have continuous first partial derivatives. Its Jacobian matrix is continuous; this is a standard regularity assumption for the divergence theorem and Stokes theorem.
Coordinate basis Created 2026-09-28 Updated 2026-10-14
A manifold chart with coordinates induces a smooth local frame of the tangent bundle, with tangent vectors forming a basis of each tangent space. Their Lie brackets of vector fields vanish because mixed partial derivatives of smooth functions commute. Under a change of coordinates they transform by the chain rule: , with coefficients given by the Jacobian matrix.
Let be a finite convex function on a neighbourhood of , and suppose its first partial derivatives exist at . For any fixed vector , convexity gives
The equality uses the one-dimensional first-order Taylor expansion along each coordinate line; no continuity of second partial derivatives is assumed. Applying this upper bound to and using gives the matching lower bound. Hence the displayed directional expansion holds. This supplies the expansion used in the supporting inequality for a differentiable convex function even when continuous second partial derivatives have not been postulated.
The displayed estimate, for all and real , defines a coordinate Lipschitz constant for the partial derivative in coordinate . It implies the coordinate descent lemma
by the fundamental theorem of calculus and integration of the Lipschitz continuity estimate. Subtracting an affine function leaves these constants unchanged.
The apparently weaker estimate along the singleton negative gradient direction is equivalent when every real step size is allowed: if the initial partial derivative is nonzero, any displacement can be written ; if it is zero but the final partial derivative is nonzero, reverse the endpoints; if both vanish the estimate is trivial.
Target: gradient-descent.bigb, under Lipschitz gradient.
Consider the top-right corner of a rectangle. Suppose the top Dirichlet boundary condition is and the right Neumann boundary condition, with outward normal in the positive direction, is . A solution that is a continuously differentiable function up to the corner necessarily satisfies : differentiating the top boundary trace in its tangential direction gives , while the right-edge condition gives the same partial derivative as .
This is a necessary compatibility condition, not an existence theorem. If it fails, a solution can still satisfy the interior equation and the boundary conditions on open edges while failing to have a continuous first derivative at that corner. In particular, homogeneous right-edge Neumann boundary conditions require for a solution continuously differentiable at the top-right corner. Boundary values may remain continuous even when this derivative requirement fails.
Critical point Created 2026-09-24 Updated 2026-10-13
For a smooth function on an open set , a critical point is an input where the gradient vanishes: . Equivalently, every first partial derivative is zero. Such a critical point is a stationary point; in one variable the condition is .
There is a broader convention in elementary one-variable calculus: a "critical number" is an interior input where the derivative is zero or does not exist, provided the function itself is defined there. Thus a corner can be a critical number without being a stationary point. Here the smooth meaning of critical point is used unless the broader convention is explicitly stated. [ref]
For the polynomial on the real line,
The stationary points at are strict local minima and attain the global minimum; the stationary point at is a strict local maximum. One can check the local classifications from , which is positive at and negative at zero. The identity proves the global minimum directly. Since as , there is no global maximum on .
Figure 1.
Three stationary points of : two global minima and one local maximum
. Details.
A zero derivative alone does not guarantee an extremum. The polynomial has but is strictly increasing through zero: every neighbourhood of zero contains both positive and negative values, so zero is neither a local minimum nor a local maximum. Conversely, the absolute value function has a strict local minimum and a unique global minimum at zero, but its left and right derivatives are and . It is not differentiable there, so zero is a critical number under the broader convention and is not a stationary point.
Figure 2.
A stationary point without an extremum, and a corner minimum without a derivative
. Details.
The usefulness of critical points is that they reduce the search for smooth interior extrema to equations. Every local minimum or local maximum of a differentiable function at an interior point has zero gradient; this condition is necessary, and shows that it is not sufficient. The striking feature is that all the first directional derivatives must vanish together, even though the surrounding values can form a valley, a peak, or a saddle point of a scalar function. [ref]
Proof outline: at an interior local minimum in one variable, the difference quotient is nonnegative for small and nonpositive for small . If the derivative exists, the two sides have the same limit, forcing . Reverse the inequalities for a local maximum. In several variables, apply this argument along each coordinate line to obtain zero partial derivatives and hence zero gradient. At a domain boundary, both directions may not be available: on attains its global minimum at zero although for its smooth extension.
Imagine folding a sheet along its horizontal axis by the smooth map , . The inputs and have the same output. Along , horizontal motion still changes the output, but vertical motion produces no first-order change: . These inputs are critical points of a smooth map even though their differential is not the zero linear map. The missing direction in the target tangent space is what matters.
Figure 1.
The fold : critical inputs, critical outputs, and fibers
. Details.
Precisely, let be a smooth map between smooth manifolds without boundary. An input is a critical point of a smooth map when its differential
is not surjective, equivalently when its rank of a linear map is less than . An input where it is surjective is a regular point; a map with no critical points of a smooth map is a submersion. The threshold is the target dimension, not . In manifold charts, compute the matrix rank of the Jacobian matrix; changes of charts preserve that matrix rank. [ref]
For the fold,
Thus its set of critical points of a smooth map is the entire horizontal axis. Away from that axis, its differential can produce every infinitesimal target displacement. At the axis, it can produce only horizontal ones. This diagnoses where the two inverse branches in the picture merge.
For a scalar smooth function , the target dimension is one. A linear map to fails to be surjective exactly when it is zero, so here a critical point of a smooth map means . In Euclidean space this is precisely the familiar critical point condition : every first partial derivative vanishes. On a Riemannian manifold, it is equivalently for the chosen Riemannian metric; the Riemannian gradient depends on that metric, but whether it vanishes does not. See Loring W. Tu, An Introduction to Manifolds, Proposition 8.23 for the scalar coordinate criterion. The scalar smooth function has a critical point at zero without a local maximum or local minimum.
A source of lower dimension gives a different warning. For the smooth map , , the Jacobian matrix is the column , of matrix rank one at every input. Every input is a critical point of a smooth map, since the target dimension is two, even though this parametric curve has nonzero velocity everywhere and is an immersion. More generally, if , no differential can be surjective, so every input is critical. The terminology measures the ability to fill target directions, rather than whether the parametrized curve looks smooth.
For a continuously differentiable vector field and a twice continuously differentiable parametric curve , the product rule and multivariable chain rule give
where is the Jacobian matrix. Indeed, first differentiate the dot product to obtain , and then substitute .
The first term describes variation in the sampled vector field; the second records the changing velocity vector of the parametric curve. In three dimensions one may take for a sufficiently smooth vector field . The formula then involves first and second spatial partial derivatives of and the velocity and acceleration of the parametric curve. Omitting the second term would be valid only when its dot product vanishes, for example for a straight path with constant velocity.
Differentiability Created 2026-10-05 Updated 2026-10-14
Differentiability is the existence of a derivative at a point. For maps between finite-dimensional normed vector spaces, the existence of a Fréchet derivative requires a single linear map approximating the increment with error . Merely having partial derivatives need not provide this approximation; continuous partial derivatives on a neighbourhood do suffice.
If all partial derivatives exist near a point and are continuous there, successive coordinate increments and the one-variable mean value theorem express as with . Subtracting the displayed linear map leaves , proving Fréchet differentiability. In two dimensions the absolute remainder is at most for small enough increments.