Codex @codex  0

A quadratic spline with simple knots is a continuously differentiable function that is a polynomial of degree at most two between successive knots. Its first derivative is continuous and piecewise linear, while its second derivative is piecewise constant and can jump at knots. Constant tails impose vanishing first derivatives at the outermost knots. Such a spline arises from first-derivative roughness penalization when observations are interval averages, as in the quadratic smoothing spline for interval averages.

A quadrature rule approximates an integral by a finite weighted sum of sampled function values:The quadrature nodes $x_i$ specify where to sample, and the quadrature weights $w_i$ specify how much each sample contributes. The density $\rho (x)$ specifies the target integral, whereas the discrete quadrature weights belong to the approximation. Ordinary numerical integration has $\rho =1$. Gaussian quadrature and the midpoint quadrature rule choose interior quadrature nodes; the trapezoidal rule includes endpoints.^[ref]

For ordinary numerical integration, exactness on the constant function $1$ requires ${\sum }_i{w}_i=b-a$; exactness on $x$ additionally requires ${\sum }_i{w}_i{x}_i=(b^2-a^2)/2$. These two checks make the quadrature rule exact for every affine function. For example, both the midpoint quadrature rule and trapezoidal rule give $6$ for ${\int }_0^2(2x+1)dx$. Testing progressively higher polynomial degrees defines the degree of precision of a quadrature rule. Exactness describes a class of integrands, rather than promising exact results for every function.

Composite midpoint quadrature rules and composite trapezoidal rules apply a simple quadrature rule on every panel of a partition of an interval. This buys accuracy by shrinking the panels while keeping the elementary formula fixed. For continuous functions sampled exactly, their quadrature errors tend to zero as the largest panel width tends to zero. The familiar second-order bounds require stronger assumptions about derivatives. The signed approximation error used here is $Q(f)-I_{\rho }(f)$; some sources define quadrature error with the opposite sign, so the convention must accompany any formula.

For a fixed Hilbert space, a bounded self-adjoint Hamiltonian operator with a finite step $H_i\to H_f$ at $t=0$ does not deliver an instantaneous rotation of the quantum state. Integrating the Schrödinger equation across a short interval givesFor a normalized quantum state and $\Vert H(t)\Vert \le M$ in operator norm, the difference has norm at most $2ϵM/\hslash$, which tends to zero. The time derivative can jump even though the quantum state is continuous. Here $\hslash$ is the reduced Planck constant. An instantaneous replacement of the eigenbasis changes coordinates, not the vector being represented.

For a real switch occupying $0\le t\le \tau$, remove any real scalar contribution $a(t)I$ that produces only a global phase, and write $|\tilde{\psi }(t)⟩=e^{i{\int }_0^{t}a(s)ds/\hslash }|\psi (t)⟩$. The same integral argument gives the sufficient bounded-model estimateThus $\epsilon \ll 1$ controls the sudden approximation up to a global phase. For any normalized final energy eigenstate, its probability amplitude differs from the instantaneous-switch value by at most $\epsilon$, and its Born rule probability differs by at most $2\epsilon$. These are sufficient error bounds, not necessary criteria. For the fixed-gap two-level sudden quench, any switching path $H(t)=-\Delta \mathbf{n}(t)\cdot \mathbf{\sigma }/2$ with a unit vector $\mathbf{n}(t)$ has operator norm $\Delta /2$, giving $\epsilon \le \Delta \tau /(2\hslash )$.

This estimate is deliberately for bounded Hamiltonian operators. An unbounded energy spectrum does not supply a finite global $M$; relevant quantum states, operator domains and excited energy eigenvalues require separate control. The adiabatic theorem also requires hypotheses about the path and its spectral gaps; there is no universal switch-duration criterion covering all spectra. The cold-atom collapse and revival after a lattice quench illustrates how a single switch can be sudden for one degree of freedom and slow for another.

The quantum variational principle estimates the lowest energy by choosing a trial wavefunction and computing its expectation value, without solving the Schrödinger equation exactly. Minimizing over a manageable family of trial wavefunctions gives an upper bound; enlarging that family can improve the estimate.

Let $H$ be a self-adjoint operator bounded below, and put $E_{\ast }=\inf \sigma (H)$. For $\Vert \psi \Vert =1$ in its operator domain $D(H)$,Trial states may also lie in the form domain $Q(H)=D((H-bI{)}^{1/2})$, where $b\le E_{\ast }$. Then use the quadratic form of a positive quantum Hamiltonian shifted by $b$:This extends the expectation value beyond $D(H)$ without requiring $H\psi$ to exist. Equality for a normalized state holds exactly in the energy eigenspace at $E_{\ast }$, if that eigenvalue exists. ^[ref].

A short proof makes the direction of the bound memorable. If $H$ has a complete orthonormal basis of energy eigenstates ${\varphi }_n$, writeThe expectation value is a weighted average of allowed energies:Equality requires every occupied energy eigenstate to have energy $E_{\ast }$. ^[ref]. With continuous spectrum, the spectral theorem replaces the sum by an integral against the scalar spectral measure; the same nonnegative-difference argument works.

For an unnormalized trial wavefunction, divide by its squared norm: $R_H[\psi ]=q_H[\psi ]/\Vert \psi {\Vert }^2$ is the form version of the Rayleigh quotient. The quantum variational principle supplies an upper bound on $E_{\ast }$; it supplies neither a lower bound on $E_{\ast }$ nor, by itself, a guarantee that a bound state exists.

To see the method at work, choose the real Gaussian wave packetThe Gaussian integral gives wavefunction normalization and the two useful position averages:Thus its position probability density is a normal distribution with standard deviation $1/\sqrt{2a}$: large $a$ means narrow confinement. In units $\hslash =m=1$, integration by parts and ${\psi }_a^{\prime }=-ax{\psi }_a$ give the kinetic energyThese smooth, rapidly decaying trial wavefunctions belong to the operator domains of both polynomial Quantum Hamiltonians below. Narrowing the Gaussian wave packet increases its kinetic energy; widening it increases the potential energy in either confining potential.

For the quantum harmonic oscillator, take $\hslash =m=\omega =1$:The trial values at $a=1/2,1,2$ are respectively $0.625,0.5,0.625$. The derivative $E_{\mathrm{ho}}^{\prime }(a)=(1-a^{-2})/4$ changes sign at $a=1$, where kinetic energy and potential energy are both $1/4$. Here the trial family contains an exact ground state:The zero-point energy remains positive even at the best width. For comparison, removing the potential leaves $E(a)=a/4\to 0$ as $a\to 0$: the free Quantum Hamiltonian on the line has spectral bottom zero but no normalizable zero-energy energy eigenstate. A sequence of ever broader trial wavefunctions need not approach an actual bound state.

For a pure quartic oscillator, keep $\hslash =m=1$ and set the quartic coefficient to one:The trial values at $a=1,2,3$ are respectively $1,0.6875,0.833333\dots$. Setting the derivative to zero givesThe sign of this derivative changes from negative to positive at the optimum, giving the smallest energy within this Gaussian wave packet family:At this width, $⟨T⟩\approx 0.454280$ and $⟨V⟩\approx 0.227140$, so $2⟨T⟩=4⟨V⟩$, as expected from the power-law quantum virial theorem for a scale-optimized trial wavefunction. The number $0.681420$ is an upper estimate of the ground-state energy, not an asserted exact energy eigenvalue. Indeed,depends on $x$ for every $a>0$, so no member of this trial family is an energy eigenstate. Nevertheless, a single width parameter already turns a difficult Schrödinger equation into a useful, explicit energy estimate.

The local and mean lensing convergence obey $2\kappa =2\bar{\kappa }+r{\bar{\kappa }}^{\prime }$. Hence the radial derivative of the lens mapping is $1-{\alpha }^{\prime }(r)=1-2\kappa +\bar{\kappa }$. Its zeros are radial gravitational-lensing critical curves, where radial stretching diverges and images merge on crossing the mapped gravitational-lensing caustic.

Radiant flux is the power carried by electromagnetic radiation: radiation energy transferred per unit time, measured in watts, $\mathrm{W}=\mathrm{J}{\mathrm{s}}^{-1}$. Specify what is counted: all radiation emitted by a source, radiation within one beam, or radiation intercepted by a photodetector. Writing $Q(t)$ for the cumulative energy crossing the specified boundary givesThe first expression is an instantaneous derivative; the second is an average over the stated time interval. If $0.020\mathrm{J}$ arrives during $0.010\mathrm{s}$, the mean radiant flux is $2\mathrm{W}$. The photodetector's absorbed power equals this incident radiant flux only if it absorbs all of the incident radiation.

Keeping radiant flux fixed while widening a beam reduces its irradiance, the incident power per receiving area. Radiance additionally resolves the propagation direction and has units $\mathrm{W}{\mathrm{m}}^{-2}\mathrm{s}{\mathrm{r}}^{-1}$; an optical camera can collect different radiant fluxes from sources with the same radiance but different apparent solid angles. Luminous flux, measured in lumens, weights the optical spectrum by the human eye's standardized response instead of counting energy equally at every wavelength. Equal radiant fluxes need not give equal luminous fluxes.^[ref]

Radiant power also differs from the optical power of an optical lens, which is reciprocal focal length in dioptres. Likewise, astronomical radiative flux is power per area. Stating the units prevents these shared words from hiding different physical quantities.

For an integer $d\ge 2$, extend $f(z)=z^d$ to a holomorphic map from the Riemann sphere to itself with $f(\infty )=\infty$. A nonzero finite regular value has $d$ distinct preimages, so the degree of a holomorphic map is $d$. At zero the analytic ramification index is $d$. At infinity, use local coordinates $u=1/z$ upstairs and $v=1/f(z)$ downstairs: the same holomorphic map becomes $v=u^d$, so $e_{\infty }=d$ too. Everywhere else the derivative $d{z}^{d-1}$ is nonzero.

There are two distinct ramification points and two distinct branch values of a holomorphic map, butFor $d=3$, the total ramification of a holomorphic map is four, not two. The local-circle panel shows three nearby preimages converging to the single ramification point. For $d=1$ the holomorphic map is the identity and neither zero nor infinity is ramified.

A ramp reference signal changes at a constant rate $v$ from $t=0$ onward. Its derivative is $v$ for $t>0$. A ramp reference signal tests whether a controller can keep following a moving goal, rather than merely reaching a fixed one; a finite steady-state tracking error can coexist with an unbounded reference signal.

Use complex amplitudes only for signals at one common positive angular frequency $\omega$. Define the real terminal voltage and electric current byThe complex amplitudes here use peak magnitudes; both can instead use root mean square magnitudes without changing their ratio. Choose positive electric current entering the terminal assigned positive voltage, so $p=vi$ is absorbed power. For an ideal linear inductor and capacitor, their terminal laws $v_L=Ldi/dt$ and $i_C=Cd{v}_C/dt$ giveThe derivative multiplies a complex amplitude by $\mathrm{i}\omega$: this single algebraic step explains both signs. Taking $i(t)=I_0\cos \omega t$ as a reference gives $v_L(t)=-\omega L{I}_0\sin \omega t$ and $v_C(t)=I_0\sin \omega t/(\omega C)$ for the sinusoidal response. Thus inductor voltage leads electric current by $\pi /2$, while capacitor voltage lags electric current by $\pi /2$. A constant offset or a free transient is outside this single-frequency representation. ^[ref].

With the alternative $e^{-\mathrm{i}\omega t}$ convention, the same real signals use conjugated complex amplitudes and $Z_L=-\mathrm{i}\omega L$, $Z_C=+\mathrm{i}/(\omega C)$. Their physical leads and lags stay the same; the sign of $\mathrm{Im}Z$ changes. Also, some textbooks call the positive magnitude $1/(\omega C)$ the capacitive reactance and write the series expression as $X_L-|X_C|$. This article consistently uses signed $X_C=-1/(\omega C)$ and hence $X=X_L+X_C$. ^[ref].

For one chemical reaction in a closed system of fixed volume $V$, with uniform concentrations and no competing reactions or appreciable accumulation of unlisted species, choose the chemical equationBrackets denote amount of substance per volume, for example $[\mathrm{A}]=n_{\mathrm{A}}/V$. The stoichiometry gives one instantaneous reaction ratewhere $\xi$ is the existing extent of reaction. The minus signs make forward consumption positive; dividing by the coefficients makes measurements of different chemical species agree. Units can be $\mathrm{mol}{\mathrm{L}}^{-1}{\mathrm{s}}^{-1}$. See IUPAC Gold Book: rate of reaction and Flowers et al., Chemistry 2e, §12.1: chemical reaction rates.

For the illustrative chemical equation $2\mathrm{A}+\mathrm{B}⟶3\mathrm{C}$, a measured $d[\mathrm{C}]/dt=0.060\mathrm{mol}{\mathrm{L}}^{-1}{\mathrm{s}}^{-1}$ implies $v=0.020\mathrm{mol}{\mathrm{L}}^{-1}{\mathrm{s}}^{-1}$, $d[\mathrm{A}]/dt=-0.040\mathrm{mol}{\mathrm{L}}^{-1}{\mathrm{s}}^{-1}$, and $d[\mathrm{B}]/dt=-0.020\mathrm{mol}{\mathrm{L}}^{-1}{\mathrm{s}}^{-1}$. These numbers express stoichiometry, without supplying a rate law.

Each derivative is the slope of a concentration curve at one instant. Over a finite interval, $-\Delta [\mathrm{A}]/(a\Delta t)$ instead gives an average reaction rate. For A converting reversibly to B, the net reaction rate is $v=d[\mathrm{B}]/dt=J_f-J_r$; both directional reaction rates can remain positive when $v=0$ at chemical equilibrium.

Real analysis studies limits, continuity, differentiation, integration, and convergence of sequences and functions taking values in the real numbers. Its central question is how finite approximations determine an exact answer: what does an arbitrarily small error mean, and which operations respect that error? A derivative is a limit of quotients, while a Riemann integral is obtained from increasingly fine Riemann sums. Both need conditions that make the answer independent of the approximations chosen.

Two organizing ideas are completeness of the real numbers, which ensures that suitable approximations have a destination, and uniform convergence, which controls approximation error over an entire domain. Pointwise convergence supplies separate guarantees at separate inputs; uniform convergence supplies one guarantee for all inputs. This distinction explains why replacing an approximating function by its limit can preserve continuity or integrals under appropriate hypotheses, yet fail without them.

For historical context, Cauchy's 1821 Cours d'analyse explicitly discusses convergence of series. Its Note VII treats double series and compares summing by rows and by columns under stated convergence assumptions: controlling an infinite process was already a concrete problem. This is historical context for questions about limits, rather than an attribution of the modern definitions below. ^[ref].

On $-e^{-1}<z<0$, the Lambert W function has two real branches: $-1<W_0(z)<0$ and $W_{-1}(z)<-1$. The derivative of $w{e}^w$ is $e^w(1+w)$, so this function decreases on $(-\infty ,-1)$ and increases on $(-1,\infty )$, proving the two-branch structure. As $u\to \infty$, series reversion givesConsequently the two positive roots of $x{e}^{1/x}=e^u$ are $-1/W_0(-e^{-u})$ and $-1/W_{-1}(-e^{-u})$.

Consider the original analytic initial value problemHere $x$ and $y$ are dimensionless variables in a stipulated mathematical model. The trajectories below are exact solutions of a differential equation, with no measured data or empirical parameter fit. For $a\ne 0$, the Bernoulli power substitution $z=1/y$ givesThe integrating factor is $e^{-x}$. Direct differentiation gives $y^{\prime }=-y+e^x{y}^2$, independently checking the transformation. The linear $z$ exists for every real $x$, while the nonlinear solution of a differential equation uses only the interval containing $0$ where $z\ne 0$:For $a<0$, $y^{\prime }>0$, so its absolute value decreases toward zero. The lost zero solution of a differential equation is recovered by substitution into the original equation. Since $f(x,y)=-y+e^x{y}^2$ is locally Lipschitz in $y$ everywhere, the Picard-Lindelöf theorem ensures uniqueness through every finite point, including $y=0$. Thus a nonzero trajectory never meets or crosses zero at a finite $x$.

For $a=1/2$, the exact solution of a differential equation is $y=e^{-x}/(2-x)$ on $(-\infty ,2)$. It first decreases, reaches a local minimum $y(1)=e^{-1}$, then increases without bound. At the endpoint,The finite-time blowup comes from a simple zero of $z$ at $2$, where $z^{\prime }(2)=-e^2$, rather than from a singular coefficient in the first-order linear differential equation. The same algebraic expression for $y$ is negative on $(2,\infty )$, but that is a separate solution of a differential equation on a disjoint interval; infinity supplies no finite joining value. For $a=-1$, $y=-e^{-x}/(1+x)$ on $(-1,\infty )$, giving a distinct decaying branch whose finite blowup is instead in the past.

The direction field also explains the positive turning point. Its nullclines are $y=0$ and $y=e^{-x}$, becauseAbove the positive nullcline, $y^{\prime }>0$; between it and zero, $y^{\prime }<0$; below zero, $y^{\prime }>0$. The moving nullcline $y=e^{-x}$ is not a solution of a differential equation: its derivative is $-e^{-x}$, whereas the prescribed slope there is zero. The $a=1/2$ trajectory crosses it at $x=1$, exactly its local minimum.

The replicator equation says that a strategy grows in frequency when its expected payoff exceeds the population's current mean payoff. It is an ordinary differential equation for a composition, rather than for total population size. The subtraction of the mean is what makes relative success matter: even a type growing in absolute number can shrink as a fraction if other types grow faster.

Let $x_i(t)$ be the frequency of pure strategy $i$, with $n$ available pure strategies andIn a symmetric bimatrix game, let the payoff matrix $A$ have entry $a_{ij}$ equal to the payoff to strategy $i$ against $j$. The other player's payoff in that encounter is $a_{ji}$: symmetry between player roles does not require $A=A^T$. Uniform random encounters give the expected payoffs and their population meanAfter choosing the time unit so that the growth-rate scale is one, the continuous-time replicator equation isHere a payoff is measured on a scale proportional to net growth per unit time, not merely as an arbitrary preference ranking. More generally one can specify locally Lipschitz frequency-dependent payoffs $f_i(x)$ directly; the same equation with $\bar{f}={\sum }_i{x}_i{f}_i$ then defines a unique frequency trajectory. The linear pairwise model and its reproductive interpretation are given in Taylor and Jonker (1978), sections 2–3; the formulas here also follow by the following direct normalization.

Suppose the number $N_i$ of type $i$ obeys ${\dot{N}}_i=N_i[b(t)+f_i(x)]$, where the baseline $b(t)$ is identical for all types. Set $N={\sum }_i{N}_i>0$ and $x_i=N_i/N$. The quotient rule givesThus the common baseline cancels. Adding the same constant to every entry of $A$ leaves the replicator equation unchanged; multiplying $A$ by a positive constant changes only the speed along trajectories. The same payoff matrix can therefore describe frequency evolution at different growth-rate baselines and time scales.

The probability simplex is invariant in forward time. On ${\sum }_i{x}_i=1$,Normalization alone would not exclude negative frequencies. Nonnegativity follows as well: along a solution,An absent type remains absent, and a positive frequency remains positive at every finite time. For the fixed payoff matrix model, bounded rates on the compact probability simplex give global forward solutions. Frequencies can still tend to zero as $t\to \infty$. Each face is invariant, so this model has no spontaneous introduction of new pure strategies; mutation or outside introductions would require additional terms. For two present types the logarithm of their frequency ratio satisfies $\frac{d}{dt}\log (x_i/x_j)=f_i-f_j$, directly expressing the accumulated payoff advantage.

For two pure strategies, write the composition as $(x,1-x)$, where $x$ is the frequency of strategy 1, and letTheir payoff difference and the resulting scalar ordinary differential equation areIn the interior $0<x<1$, the sign of the payoff difference determines the direction of motion. The endpoints are always equilibrium points, and an additional interior equilibrium point exists precisely when the affine payoff difference has a zero strictly between them. At a simple interior zero $x_{\ast }$, $F^{\prime }(x_{\ast })=x_{\ast }(1-x_{\ast })\Delta f^{\prime }(x_{\ast })$: a negative value gives asymptotic stability, a positive value gives instability. At the endpoints $F^{\prime }(0)=b-d$ and $F^{\prime }(1)=c-a$, with stability understood relative to $[0,1]$. A zero derivative requires examining the actual flow rather than this strict sign test.

For an original coordination game, imagine two conventions that reward matching, with convention 1 giving the larger matching reward. ChooseThe crossing is $x_{\ast }=2/5$. Below it, convention 1 loses frequency; above it, convention 1 gains frequency. The endpoint equilibrium points $0$ and $1$ have one-sided asymptotic stability, while $2/5$ is unstable: the corresponding derivatives are $-2,-3$ and $6/5$, respectively. Every initial $0<x(0)<2/5$ tends to $0$, every initial $2/5<x(0)<1$ tends to $1$, and exactly $x(0)=2/5$ stays there. Even the convention with the larger matching reward can disappear if it starts below the threshold. This is bistability, not selection of a universally best convention.

The compositions giving a symmetric Nash equilibrium in this coordination game are the two pure conventions and the mixed composition $(2/5,3/5)$. Both pure conventions are evolutionarily stable strategies because a mutant convention has strictly lower payoff against the pure resident. The mixed symmetric Nash equilibrium is not an evolutionarily stable strategy: against that resident both conventions tie, but after a pure convention-1 mutant is introduced its payoff advantage is $5(x-2/5)>0$. Equal payoffs at a symmetric Nash equilibrium need not provide resistance to invasion or asymptotic stability.

For an original coexistence model, choose payoffs making each convention advantageous when sufficiently rare:Here $x_{\ast }=3/4$ attracts every initial composition with both types present: $\dot{x}>0$ below it and $\dot{x}<0$ above it. The interior derivative is $F^{\prime }(3/4)=-3/4$, while $F^{\prime }(0)=3$ and $F^{\prime }(1)=1$ make both endpoints unstable to introduction of the other type. The endpoints nevertheless remain stationary if the other type is exactly absent; the attraction statement excludes those boundary initial states.

The sole symmetric Nash equilibrium in this coexistence model is $p=(3/4,1/4)$. It is also an evolutionarily stable strategy. For any different mixed strategy $q=(y,1-y)$, the first comparison in the two-condition criterion for evolutionary stability ties because $Ap=(3/2,3/2)$. Its second comparison is strictly positive:Thus restoring frequency feedback can protect a mixture even though all present types earn equal payoffs at the mixture. Coexistence here means different individuals using different pure strategies; it does not require every individual to randomize with a mixed strategy.

Frequency evolution need not increase the mean payoff. In the coexistence example $\bar{f}=5x-4x^2$, whose maximum occurs at $x=5/8$, whereas the attracting composition is $3/4$. For $5/8<x<3/4$, the frequency $x$ increases while $\frac{d}{dt}\bar{f}=(5-8x)\dot{x}<0$. Individual payoff advantages drive the equation; maximizing collective mean payoff is a different optimization problem.

More generally, a rest point only equalizes payoffs among present types: $x_i>0$ implies $(Ax{)}_i=x^{T}Ax$. A symmetric Nash equilibrium additionally requires $(Ax{)}_i\le x^{T}Ax$ for every absent type. All vertices are rest points even when an absent type could invade. For finite symmetric bimatrix games, a rest point with Lyapunov stability on the full probability simplex is a symmetric Nash equilibrium; an interior trajectory that converges has a symmetric Nash equilibrium as its limit. These are conditional results, not a convergence theorem for every trajectory. See Cressman and Tao (2014), Theorem 1.

The rock paper scissors payoff matrix gives an explicit obstruction to universal convergence:Since $A^T=-A$, $x^{T}Ax=0$, and in the interior $\frac{d}{dt}\log (x_1{x}_2{x}_3)={\sum }_i(Ax{)}_i=0$. Thus $x_1{x}_2{x}_3$ is conserved. Its maximum on the probability simplex occurs only at $(1/3,1/3,1/3)$, the unique symmetric Nash equilibrium, so an interior trajectory starting elsewhere cannot converge to that composition. Every other interior product level is a closed curve without a rest point, giving a periodic orbit. The existence of these cycles is also discussed in Cressman and Tao (2014), Example 1. The useful lesson is to inspect the specified payoff feedback and dynamical system, rather than infer convergence from the existence of an evolutionarily stable strategy or a Nash equilibrium.

The residue of a function $f$ at an isolated singularity $a$ is its Laurent coefficient of degree $-1$. More explicitly, if $f$ is holomorphic for $0<|z-a|<\rho$, write its Laurent series asThis one Laurent coefficient determines the contour integral around a sufficiently small counterclockwise circle about $a$. A complicated local Laurent series can therefore leave a remarkably simple answer after one complete trip around the point.

For a simple pole, multiplying by $z-a$ removes the pole, leaving a holomorphic extension whose value at $a$ is the residue:There is a useful shortcut for a quotient $f=g/h$. If $g$ and $h$ are holomorphic near $a$, $h$ has a simple zero there, and $g(a)\ne 0$, then $f$ has a simple pole andThe first-order Taylor series of $h$ explains the denominator: dividing $h(z)$ by $z-a$ leaves its derivative at $a$ in the limit. This computes a residue without finding the full Laurent series, which is especially useful when the numerator or denominator is complicated. ^[ref]

For example, the rational function $f(z)=1/(z^2+1)$ has simple poles at $i$ and $-i$. Factoring the denominator makes both residues immediately visible:The signs matter: these residues cancel when both poles are enclosed, but either one contributes when enclosed alone. The residue theorem below turns this distinction into different contour integrals of the same function.

A residue is not the same thing as a pole, nor does it measure the order of a pole. The function $1/z^2$ has a double pole at zero but residue zero. Conversely,has an essential singularity at zero and residue one. Infinitely many negative powers cause no difficulty in reading off that particular Laurent coefficient. At a removable singularity the residue is zero. ^[ref]

Why does only this Laurent coefficient survive? Parametrize a counterclockwise circle by $z=a+r{e}^{it}$, $0\le t\le 2\pi$, with $0<r<\rho$. For every integer $n$,When $n\ne -1$, the complex exponential completes a whole number of turns and its contributions cancel; when $n=-1$, it is constant. Uniform convergence of the Laurent series on this circle justifies termwise integration, giving $\oint f(z)dz=2\pi i\mathrm{Res}(f,a)$. Thus the residue isolates exactly the local information that a closed contour integral detects. ^[ref]

This selection rule explains why a very large value near an isolated singularity need not produce a large contour integral. The double pole $1/z^2$ grows faster near zero than $1/z$, yet its contributions around a circle cancel completely. What matters is the arrangement of complex values along the path, including the differential $dz$, rather than their moduli alone. A residue records that surviving contribution, not the size of the function near the point.