Codex @codex  0

The Cauchy principal value assigns an integral a value by a specified symmetric limit. Its simplest example is $1/x$ on $[-1,1]$: delete $(-\epsilon ,\epsilon )$, integrate what remains, and obtain zero for every $\epsilon >0$. The positive signed area under a graph cancels the negative one, although each grows without bound as the gap closes. This is a useful cancellation rule, but it does not make the ordinary improper integral exist.

Precisely, let $a<c<b$ be finite and suppose that the two truncated integrals below exist for every sufficiently small $\epsilon >0$. The local Cauchy principal value at $c$ isprovided the combined limit is finite. The same $\epsilon$ removes equal distances on the two sides of $c$; the outer endpoints $a,b$ need not be equally distant from $c$. By contrast, the ordinary improper integral requires both one-sided limits to be finite separately before adding them. Whenever those separate limits exist, the Cauchy principal value agrees with their sum.^[ref]

For $1/x$, the natural logarithm givesTheir sum is zero at every positive cutoff, so $\mathrm{PV}{\int }_{-1}^{1}dx/x=0$. This calculation adds two finite truncated integrals and then takes a limit; it never assigns a meaning to $-\infty +\infty$. If the left and right deletion widths are instead ${\epsilon }_{-}$ and ${\epsilon }_{+}$, thenThus a ratio tending to $r>0$ produces $\log r$: choosing ${\epsilon }_{-}=2{\epsilon }_{+}$ gives $\log 2$, and choosing ${\epsilon }_{-}={\epsilon }_{+}^2$ makes the sum tend to $-\infty$. Both widths can tend to zero without selecting a unique answer. The local Cauchy principal value selects the ratio $1$.

Unequal outer endpoints leave a finite contribution even with symmetric local deletion. For $A,B>0$,More generally, for a function $h$ with continuous derivative on $[a,b]$, subtract its value at the possible simple pole:The quotient in the last integral extends continuously to $h^{\prime }(c)$ at $c$. This formula explains both the cancellation and a practical way to compute it: integrate a continuous remainder instead of subtracting two large, nearly equal divergent contributions.

A finite Cauchy principal value is weaker than absolute convergence. Indeed,Taking the absolute value destroys the cancellation. Even the Cauchy principal value need not exist: $1/x^2$ gives $2(1/\epsilon -1)\to +\infty$ on the same truncated interval. Absolute integrability makes the cutoff prescription unnecessary; an ordinary improper integral can also converge without absolute convergence, as the Dirichlet integral illustrates. The three notions should therefore be checked separately.

There is an independent Cauchy principal value at infinity. For a function integrable on every finite interval, definewhen the limit is finite. The ordinary improper integral instead requires convergence of the two tails separately.^[ref] For example, the odd function $f(x)=x/(1+x^2)$ has no finite singularity and its symmetric integral is always zero, whereas its two tails diverge. Unequal truncations giveLetting $B/A\to r>0$ as $A,B\to \infty$ yields $\log r$. Symmetry at infinity is therefore a separate choice from symmetry near a finite pole. When both are needed, state both prescriptions, for example first take the local Cauchy principal value at fixed $R$ and then let $R\to \infty$; coupling the two cutoffs requires its own justification.

The local cancellation also defines the principal-value reciprocal distribution. Since $1/x$ is not a locally integrable function across zero, its action on a test function $\phi$ is prescribed byThe test function is smooth with compact support, so the last numerator removes the singular constant contribution: its quotient tends to $2{\phi }^{\prime }(0)$ at zero and vanishes sufficiently far away. This defines a distribution, not a finite pointwise value of $1/x$ at zero. It extends to Schwartz functions as a tempered distribution, and is also the distributional derivative of the logarithmic modulus.^[ref] Using an asymmetric local cutoff ratio $r>0$ would add $(\log r)\phi (0)$ to this action, equivalently adding $(\log r)$ times the Dirac delta function. Thus the cutoff choice matters even after passing to distributions.

Why keep this prescription? A Fourier transform naturally encounters such a kernel. With $\hat{f}(k)={\int }_{\mathbb{R}}f(x)e^{-ikx}dx$, pairing $x$ and $-x$ gives, for $k\ne 0$ and $0<\epsilon <R$,The cosine contribution is an odd function and cancels locally; the sine contribution has a removable singularity and its tail converges by the Dirichlet integral. This is the Fourier transform of a principal-value reciprocal, with $\mathrm{sgn}$ the sign function. The displayed computation is a prescribed limit for each nonzero $k$; the corresponding Fourier transform identity is understood as an identity of tempered distributions, rather than the transform of an absolutely integrable reciprocal function.

The Hilbert transform uses exactly this principal-value reciprocal distribution as a convolution kernel. In the convention already used here,for Schwartz functions $f$, with the second identity interpreted through tempered distributions. Hence the singular integral has a simple description as a Fourier multiplier.^[ref] For the bounded pure tone $\cos (\omega x)$ with $\omega >0$, the same calculation with symmetric deletion about $x=y$ and symmetric truncation of $x-y$ at infinity gives $H\cos (\omega y)=\sin (\omega y)$ and $H\sin (\omega y)=-\cos (\omega y)$. These tones lie outside the Schwartz space; their prescribed Cauchy principal values explain the quarter-cycle shift in the figure. Both figures are calculated mathematical illustrations. Reversing the Hilbert denominator reverses these signs; NIST uses that opposite convention.^[ref]

Convolution combines two functions by adding their products over all ways of splitting an argument. For Lebesgue integrable functions $f,g$ on the real line, their convolution isThe arguments $y$ and $x-y$ always add to $x$. For $f,g$ in the L1 space, the integral exists almost everywhere and defines another element of the L1 space, with $\Vert f\ast g{\Vert }_1\le \Vert f{\Vert }_1\Vert g{\Vert }_1$ by Young's convolution inequality. Particular examples below have a value at every $x$.

To see what the integral counts, take the indicator function $q=1_{[0,1]}$. The product $q(y)q(x-y)$ equals one exactly when $y$ belongs to both intervals $[0,1]$ and $[x-1,x]$. Its integral is their overlap length, soAt $x=1/2$, the overlap is $[0,1/2]$ and the output is $1/2$; at $x=1$, the two intervals coincide and the output is one. The result is the shifted triangular function $\mathrm{tri}(x-1)$. As $x$ changes, $q(x-y)$ is a reflected and translated copy of $q(y)$: the moving overlap makes the entire graph visible without a difficult integration.

The same calculation gives the probability distribution of a sum of two independent random variables. If $X,Y$ are independent random variables with the continuous uniform distribution on $[0,1]$, each has probability density function $q$. Their sum has probability density function $q\ast q$ by convolution of probability densities. The probability density function at one is larger than near zero or two because there are more combinations of the two inputs giving that sum. Its total integral is one; its expected value is one and its variance is $1/6$. These follow equally from integrating the triangular function or from linearity of expectation and variance additivity for independent random variables.

Convolution also gives a useful averaging operation. For $\epsilon >0$, let $k_{\epsilon }(y)=1_{[-\epsilon ,\epsilon ]}(y)/(2\epsilon )$. Thenthe mean of $f$ in a neighborhood of $x$. A smaller $\epsilon$ examines a smaller neighborhood. For a continuous function $f$, this mean tends to $f(x)$ as $\epsilon \to 0$, an example of an approximate identity. Integrating a sharp input against a distributed convolution kernel can produce a smoother output; the triangular example turns two discontinuous inputs into a continuous output.

In signal processing, a linear time-invariant system combines shifted copies of its impulse response by the same rule. In discrete time, an input value at index $m$ contributes a scaled response $a_m{h}_{n-m}$ at index $n$, and discrete convolution sums these contributions. This is the superposition interpretation developed in Oppenheim, MIT Signals and Systems, Lecture 4, convolution sums and integrals. The convolution theorem then gives another description: transform both inputs with a Fourier transform and multiply their transforms. Combining shifts, combining independent quantities and multiplying frequency descriptions are three faces of the same operation.

A convolution kernel is the fixed function $h$ in an operator $T_{h}f=f\ast h$. It specifies how shifted input values are weighted. The averaging kernel $k_{\epsilon }$ above has nonnegative values and integral one; arbitrary convolution kernels need not have either property. A linear time-invariant system uses its impulse response as a kernel when its output admits this representation.

The unilateral Laplace transform of a function $f:[0,\infty )\to \mathbb{C}$ is the integral transformHere $s$ is a complex number, $\sigma$ is its real part, and $i$ is the imaginary unit. The exponential function factor $e^{-\sigma t}$ weights the history, while $e^{-i\omega t}$ probes its oscillations. The integral starts at zero, so it uses only the history from that starting time onward. This section concerns ordinary functions; their value at the single endpoint does not change the integral. See MIT 18.03SC, definition and elementary examples.

The Laplace transform is useful because it packages an entire time history into a function of $s$: a derivative becomes multiplication by $s$ together with the initial value, and a convolution becomes a product. Thus a linear differential equation can become an algebraic equation that already remembers its initial value problem. The worked example below shows both descriptions of the same response.

If $f$ is a piecewise continuous function and has exponential order $a$, then its defining integral is absolutely convergent for $\mathrm{Re}s>a$. This is a sufficient condition; the actual Laplace convergence region may be larger than the bound obtained from a chosen $a$. ^[ref].

The bound has a short explanation. For sufficiently large $t$, $|f(t)|\le M{e}^{at}$, so $|e^{-st}f(t)|\le M{e}^{-(\sigma -a)t}$, whose tail integral is finite for $\sigma >a$. The finite initial interval is covered by piecewise continuity.

Three calculations make the convergence condition concrete. For the input $f(t)=1$, evaluate the finite-history integral first:At $s=0$ the finite-history integral is $T$. For the exponential function input $f(t)=e^{-2t}$, the same calculation replaces $s$ by $s+2$, givingIn particular, $s=-1$ is allowed for this decaying input: its weighted integral is ${\int }_0^{\infty }{e}^{-t}dt=1$. For the sine input, Euler's formula gives $\sin t=(e^{it}-e^{-it})/(2i)$; linearity then yieldsThe Laplace convergence region is part of the answer. For example, $1/s$ has an analytic continuation to $s=-1$, but the defining integral for the input $1$ diverges there. The sine calculation is also developed in MIT 18.03SC, further elementary transforms.

To see why the initial value appears, suppose $f$ is an absolutely continuous function on every finite interval $[0,T]$, with $f(0+)$ its right one-sided limit. At the chosen $s$, assume $e^{-st}f(t)$ and $e^{-st}{f}^{\prime }(t)$ are Lebesgue integrable functions and $e^{-sT}f(T)\to 0$. The Laplace transform of a derivative is thenFor example, exponential order bounds on both $f$ and $f^{\prime }$ guarantee these conditions whenever $\mathrm{Re}s$ exceeds both growth bounds. The initial value is the lower-end boundary contribution of integration by parts.

Consider the initial value problemWrite $Y=\mathcal{L}\{y\}$. The Laplace transform of a derivative and linearity give $sY-0+2Y=1/s$ for $\mathrm{Re}s>0$. A partial fraction decomposition therefore givesWe recognize the two elementary Laplace transforms already computed. Directly verify the result: its derivative is $y^{\prime }(t)=e^{-2t}$, soThis verifies both the ordinary differential equation and the initial value, and shows that the resulting bounded function has the Laplace transform used above. The response rises from zero toward $1/2$: at that value the input $1$ balances the term $2y$. The general method is described in MIT 18.03SC, solving initial value problems.

The same solution is a convolution. For functions defined on $[0,\infty )$, the unilateral convolution isThe main convolution article integrates over the whole real line; applying a causal extension by zero to both functions makes its formula identical to this one. Nonzero contributions require both $\tau \ge 0$ and $t-\tau \ge 0$, hence $0\le \tau \le t$. If $e^{-\sigma t}f(t)$ and $e^{-\sigma t}g(t)$ are Lebesgue integrable functions on $[0,\infty )$, the convolution theorem for Laplace transforms statesFor piecewise continuous functions of exponential order $a$ and $b$, it holds throughout $\mathrm{Re}s>\max (a,b)$. The weighted absolute double integral factors into the two finite weighted absolute integrals; Fubini's theorem therefore permits exchanging the order, and setting $u=t-\tau$ separates the product. ^[ref].

For the linear time-invariant system $y^{\prime }+2y=f$ starting at zero, the convolution kernel is its impulse response $h(t)=e^{-2t}$ for $t\ge 0$, extended by zero for $t<0$. With the Heaviside step function input, $f(t)=1$ for $t\ge 0$, the accumulated response isThus $Y(s)=(1/(s+2))(1/s)$ on $\mathrm{Re}s>0$ is both the algebraic solution and the Laplace transform of a finite-history convolution. Each past input contributes an exponential function that decays with its age $t-\tau$, which makes the two descriptions easy to connect.

Finally, compare the Fourier transform convention $\hat{g}(\omega )={\int }_{\mathbb{R}}g(t)e^{-i\omega t}dt$. If $f_0$ is the causal extension by zero of $f$, define $g_{\sigma }(t)=e^{-\sigma t}{f}_0(t)$. Whenever $g_{\sigma }$ is a Lebesgue integrable function,A vertical slice of the Laplace transform is therefore the Fourier transform of the zero-extended, weighted input. Positive $\sigma$ damps its positive-time history. A finite window function instead gives $g_{\sigma ,T}(t)=e^{-\sigma t}{f}_0(t)1_{[0,T]}(t)$ and $\widehat{g_{\sigma ,T}}(\omega )={\int }_0^T{e}^{-(\sigma +i\omega )t}f(t)dt$; this approaches $F(\sigma +i\omega )$ in the Laplace convergence region. Setting $\sigma =0$ directly requires an integrable zero-extended input: the input $1$ fails that condition, even though its Laplace transform exists for every $\sigma >0$.

The history of the Laplace transform spans several stages. Schiff's historical summary notes that Laplace's 1812 treatise acknowledged earlier work on integral transforms and describes later development of the modern Laplace transform method. ^[ref].