Codex @codex  0

absolute convergence of a Dirichlet series depends only on the real part of its variable. The set of real parts giving convergence is upward closed by the comparison test. If that set is nonempty and not all of the real line, its finite infimum is the abscissa: every larger real part gives convergence, and every smaller real part gives divergence. Boundary convergence is a separate question.

The Jensen zero-count bound gives $O(T\log T)$ zeros up to ordinate $T$. Since their real parts lie in $(0,1)$, a fixed-point real logarithmic derivative summand is $O(|\Im \rho {|}^{-2})$. Dyadic ordinate bands then contribute $O(j{2}^{-j})$. This proves absolute convergence of the real sum, while the unpaired complex sum of reciprocals need not converge absolutely.

Knowing the radius of convergence does not settle convergence on its boundary. The three power seriesall have radius one, but behave differently on $|z|=1$.

For the geometric series, boundary terms all have complex modulus one, violating the term test for divergence. For the second series, absolute values give the divergent harmonic series at every boundary point. At $z=1$ the series itself is harmonic and diverges. At any other point on the unit circle, its geometric partial sums obeyThe Dirichlet test with the decreasing sequence $1/n\to 0$ therefore gives conditional convergence. In particular, $z=-1$ gives the negative of the alternating harmonic series, with sum $-\ln 2$. For the third series, the convergent p-series ${\sum }_{n\ge 1}1/n^2$ bounds the absolute values at every boundary point, giving absolute convergence by the comparison test for series.

At $z=-1$, the rational function $1/(1-z)$ is well defined and equals $1/2$, yet its geometric series diverges there. A formula for a function and a particular series representation can have different domains. Likewise, applying termwise differentiation of a power series preserves the radius but need not preserve the boundary convergence.

If the terms of a power series at a nonzero point $z$ are bounded by $M$, then $|a_n{w}^n|\le M(|w|/|z|{)}^n$. A convergent geometric series and the comparison test for series give absolute convergence at every point strictly inside that circle. Consequently terms at every point outside the radius of convergence must be unbounded. This conclusion is stronger than merely saying that those terms fail to tend to zero.

For the power series ${\sum }_{n\ge 0}{a}_n(z-c{)}^n$, the Cauchy-Hadamard theorem giveswith $R=\infty$ when the limit superior is zero, and $R=0$ when it is infinite. Away from the centre, the root test explains the formula: the limit superior of the term roots at displacement $z-c$ is $|z-c|/R$, interpreted as zero for $R=\infty$ and infinite for $R=0$. Values below one give absolute convergence; values above one imply that the terms fail to tend to zero. A value of one leaves the boundary question open. At the centre the series converges regardless of $R$.

For $a_{2n}=1$ and $a_{2n+1}=0$, the coefficient roots alternate between one and zero, so their ordinary limit does not exist. Their limit superior is nevertheless one, giving $R=1$ for ${\sum }_{n\ge 0}{z}^{2n}=1/(1-z^2)$ inside the unit disk. A ratio of consecutive coefficients would be undefined at the zero coefficients; the root-limsup formula handles the gap directly.

In the first part of his 1892 study of functions given by Taylor series, Jacques Hadamard introduced an upper-limit formulation for sequences and used coefficient roots to determine the radius of convergence. Sections 4–6 separate finite positive, zero, and infinite root-growth cases; the later parts study singularities and continuation. See Hadamard, Essai sur l'étude des fonctions données par leur développement de Taylor, Journal de mathématiques pures et appliquées, fourth series 8 (1892), pp. 107–109. This original text explains the coefficient-growth question without implying that the study of power series began there.

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]

Every character of an algebra on ${\ell }^1(\mathbb{Z})$ with convolution multiplication is uniquely of this form for $0\le t<2\pi$. If $e_j$ is the point mass at $j$, then $e_j{e}_k=e_{j+k}$. A character has norm one and $e_1{e}_{-1}=1$, so $|\chi (e_1)|\le 1$ and $|\chi (e_1{)}^{-1}|\le 1$. Hence $\chi (e_1)$ lies on the unit circle; multiplication determines all $\chi (e_j)$ and continuity determines the displayed series. Conversely absolute convergence permits rearrangement of the double series, proving multiplicativity. The maximal ideals are exactly their kernels: each consists of sequences whose Fourier series vanishes at one fixed point of the unit circle.

Let real power series $f(t)={\sum }_{k\ge 0}{f}_k{t}^k$ and $g(t)={\sum }_{k\ge 0}{g}_k{t}^k$ converge on $[-1,1]$, with $f_k\ge |g_k|$ for every index including zero. If $X⪰0$ has entries there, applying $f$ within two diagonal blocks and $g$ across them preserves positive semidefiniteness. Indeed the coefficient matrix $H_k$ is a bipartite block-constant positive semidefinite matrix. Each $H_k\circ X^{\circ k}$ is positive semidefinite by the Schur product theorem, and their sum converges to the transformed matrix. Closedness of the positive semidefinite cone completes the proof. Convergence at one gives $\sum f_k<\infty$, so coefficient domination ensures absolute convergence of both series throughout the interval. Without the zero-index condition, $f=-1$, $g=0$ and $X=0$ give a counterexample.

For a fixed positive integer $m$, if $a_n\to 0$ and the series of the displayed block sums converges, then the original series converges to the same limit of a sequence. Its partial sum at a block endpoint is exactly a partial sum of $\sum b_n$; the difference at an intermediate endpoint has at most $m-1$ terms, all tending to zero. This justification is essential when block cancellation proves convergence without absolute convergence. It does not apply without further control to blocks whose lengths grow.

For functions $f,g$ on $[0,\infty )$ with $e^{-\sigma t}f(t)$ and $e^{-\sigma t}g(t)$ Lebesgue integrable functions, their unilateral convolution, defined almost everywhere if necessary, satisfiesTaking a causal extension by zero of both functions gives the existing whole-line convolution definition. Absolute convergence and Fubini's theorem justify the product rule: put $t=\tau +u$ in the double integral, so $e^{-st}=e^{-s\tau }{e}^{-su}$. For piecewise continuous functions of exponential order $a$ and $b$, the hypotheses hold for $\mathrm{Re}s>\max (a,b)$. The Laplace transform article works out the concrete example $h(t)=e^{-2t}$ and the Heaviside step function input, whose output is $(1-e^{-2t})/2$. ^[ref].

Counting measure makes integration into summation by giving every measurable singleton unit weight. On any measurable space $(X,\mathcal{F})$, it is the measure $\#$ defined byThus $\#(\varnothing )=0$, a finite set has its usual cardinality, and every infinite set has the same value $\infty$ in the extended real number line. In particular, countably infinite sets and uncountable sets are not distinguished by their counting measure. Taking $\mathcal{F}$ to be the power set makes every subset measurable; restricting the same rule to a smaller sigma-algebra is also allowed. ^[ref]

Why is this a countably additive measure? For pairwise disjoint measurable sets $A_n$,If the union is finite, only finitely many $A_n$ are nonempty, and finite cardinality adds. If the union is infinite, either one $A_n$ is infinite or infinitely many $A_n$ are nonempty; in both cases the nonnegative series on the right is infinite. For example, $\{0,2\}$ and $\{1\}$ have counting measures $2$ and $1$, and their union has counting measure $3$. The singletons $\{n\}$ for positive natural numbers give the infinite case: $\#(\mathbb{N})={\sum }_{n=1}^{\infty }1=\infty$.

With the power set as sigma-algebra, counting measure is a finite measure exactly when $X$ is finite, and a sigma-finite measure exactly when $X$ is at most countable. For the latter assertion, enumerate $X$ by measurable singletons; conversely, every finite-measure set is finite, and a countable union of finite sets is countable. Specifying the sigma-algebra matters: if $X=\mathbb{N}$ and $\mathcal{F}=\{\varnothing ,\mathbb{N}\}$, counting measure is not a sigma-finite measure, since the only measurable finite-measure set is the empty set.

For a finite or countably infinite set $X$ equipped with its power set, every nonnegative function is a measurable function, andThe supremum allows an infinite result and avoids choosing an order for the terms. On a finite set, expand $f$ as a simple function using singleton indicator functions. On a countably infinite set, enumerate the points and apply the monotone convergence theorem to finite truncations. Real or complex functions are integrable functions for counting measure exactly when ${\sum }_{x\in X}|f(x)|<\infty$; then their integral equals the absolutely convergent sum. This is the discrete counterpart of Lebesgue integration, developed further in series as a Lebesgue integral against counting measure. ^[ref]

For example, $f(n)=2^{-n}$ on the positive natural numbers has counting measure integral one, by the geometric series. The alternating harmonic series has a finite ordered sum but is not the integral of an integrable function for counting measure: its positive and negative parts both have infinite sums. Absolute convergence is what makes the finite integral independent of enumeration. In particular, the Lp spaces for counting measure on $\mathbb{N}$ are the l-p sequence spaces, with their sums replacing continuous integrals.

Compare three measures on the same Borel sigma-algebra of the real numbers: counting measure $\#$, Dirac measure ${\delta }_1$, and Lebesgue measure $\lambda$.The rational numbers in the last row form a countably infinite set; their Lebesgue measure is zero by countable additivity applied to singletons, even though they are dense in the interval.

These are different answers to different questions: counting measure asks how many points occur, Dirac measure asks whether the selected point occurs, and Lebesgue measure asks how much length occurs. A null set therefore depends on its measure. For counting measure, the only null set is the empty set, so equality almost everywhere is equality everywhere. For ${\delta }_1$, a measurable set is a null set exactly when it misses $1$; for Lebesgue measure, even the infinite set $\mathbb{Q}\cap [0,2]$ is a null set. Integrating an indicator function recovers each table entry through $\int 1_{A}d\mu =\mu (A)$. This lets the same Lebesgue integral framework handle point counts, point evaluation, and geometric length.

If $0\le a_n\le b_n$ eventually and $\sum b_n$ converges, then $\sum a_n$ converges. The nondecreasing partial sums of the nonnegative $a_n$ are bounded above by a finite initial contribution plus the sum of $b_n$; bounded monotone sequence theorem proves the claim. Consequently $|c_n|\le b_n$ with summable $b_n$ proves absolute convergence of $\sum c_n$. Finite changes to initial terms do not affect convergence.

The Fourier series of a periodic function of bounded variation converges at each point to the mean of its two one-sided limits. In particular, it converges to the function at continuity points. Periodizing a compact interval introduces jumps at its integer endpoints; their half-values explain the half-weight convention in the Van der Corput sum-integral lemma. The conclusion is pointwise convergence, not a claim of absolute convergence of every such Fourier series.

For a power series centred at $c$ with radius of convergence $R$, its disk of convergence is the open disk $|z-c|<R$, on which the series has absolute convergence. Boundary points may or may not belong to the larger domain of convergence. When $R=0$ this open disk is empty, although the power series still converges at its centre; when $R=\infty$ it is the whole complex plane.

The domain of convergence of a power series is the set of inputs where the series has a finite sum. Inside its radius of convergence the series has absolute convergence, and outside it diverges. At a finite positive radius the real domain may include either, both, or neither endpoint; the radius of convergence alone does not decide endpoint convergence.

For a real angle $\theta$ in radians, Euler's formula stateswhere $i$ is the imaginary unit. It connects the complex exponential to the sine and cosine coordinates of the unit circle. In particular, $|e^{i\theta }|=1$, and multiplying by $e^{i\theta }$ rotates a complex number through angle $\theta$ without changing its modulus. At $\theta =\pi /3$ it gives $e^{i\pi /3}=1/2+i\sqrt{3}/2$; at $\theta =\pi$, it gives $e^{i\pi }=-1$.

The identity makes angle addition algebraic: $e^{i\alpha }{e}^{i\beta }=e^{i(\alpha +\beta )}$. Expanding the product and comparing real parts and imaginary parts recovers the sine addition formula and cosine addition formula. Differentiating $e^{i\omega t}$ gives $i\omega e^{i\omega t}$, and differentiating again gives $-{\omega }^2{e}^{i\omega t}$. Its real and imaginary coordinates therefore solve the harmonic oscillator equation. This is why complex exponentials are useful building blocks in Fourier analysis: differentiation acts on each frequency by simple multiplication.

A short justification separates the even and odd powers in the absolutely convergent power series for $e^{i\theta }$. The even powers give ${\sum }_{n\ge 0}(-1{)}^n{\theta }^{2n}/(2n)!=\cos \theta$, and the odd powers give $i{\sum }_{n\ge 0}(-1{)}^n{\theta }^{2n+1}/(2n+1)!=i\sin \theta$. The absolute convergence permits this regrouping. The formula thus links an analytic definition of the complex exponential to a geometric motion rather than merely introducing a convenient notation.

Leonhard Euler presents the relation between imaginary exponentials and sines and cosines in his 1748 Introductio in analysin infinitorum, volume 1, chapter VIII, section 138. His derivation uses limiting powers after connecting trigonometric addition to algebra. The original Latin and Ian Bruce's English translation can be read together in Euler, Introductio, chapter VIII, section 138.

For a bounded skew-adjoint operator on a complex Hilbert space, the operator exponential converges in norm because its term norms are bounded by $\Vert T{\Vert }^n/n!$. Continuity of the adjoint operator gives $(e^T{)}^{\ast }=e^{T^{\ast }}=e^{-T}$. Absolute convergence permits the Cauchy product of $e^T$ and $e^{-T}$: its degree-$n$ coefficient is $T^n{\sum }_{j=0}^n(-1{)}^j/[j!(n-j)!]$, zero for $n>0$ and the identity for $n=0$. Both multiplication orders therefore give the identity, proving unitarity. The boundedness hypothesis makes this elementary power-series proof valid without domain issues for unbounded generators.

Consider the vector field $\mathbf{F}=(p(x),q(x),r(z))$ in the open unit cube, where $p$ and $r$ extend to continuously differentiable functions on $[0,1]$, and $q$ is continuous on $(0,1]$ with ${\int }_0^1|q(x)|dx<\infty$. Even if $q$ is unbounded as $x\downarrow 0$, the normal component on an $x$-face has the finite trace $\pm p(x)$. The two $y$-faces have finite improper integral fluxes $\pm {\int }_0^{1}q(x)dx$ and therefore cancel. The remaining face contributions giveTo justify this use of the divergence theorem, first apply it to $[\epsilon ,1]\times [0,1{]}^2$, on which the field is regular. Its divergence is $p^{\prime }(x)+r^{\prime }(z)$, independent of $q$. Its outward flux is $p(1)-p(\epsilon )+(1-\epsilon )[r(1)-r(0)]$. Taking $\epsilon \downarrow 0$ yields the displayed answer, and absolute convergence makes the two $y$-face limits finite separately. For example, $q(x)=1/[x(1+(\ln x{)}^2)]$ diverges at zero butThis argument defines the normal traces and the face integrals explicitly; it does not assert that the whole vector field has a finite value on the singular face.

For a positive integer $m$, take $f(x)=\sin (mx)$ on $0<x<\pi$ and form its half-range Fourier cosine series. The product-to-sum identity givesThus $a_n=4m/[\pi (m^2-n^2)]$ for opposite parity and zero for the same parity. The exceptional integral $a_m=(2/\pi ){\int }_0^{\pi }\sin (mx)\cos (mx)dx$ is zero. The constant term is $a_0/2$, not $a_0$. These coefficients represent the even periodic extension, not the original sine wave on negative arguments. Their quadratic decay gives absolute convergence.

On $0\le x\le L$, with $L>0$, the tent $f(x)=\min (x,L-x)$ has Fourier sine series coefficients $b_n=4L\sin (n\pi /2)/({\pi }^2{n}^2)$. Split the coefficient integral at $L/2$ and integrate its two linear pieces by parts; their cosine endpoint terms cancel and their sine terms add. Reflection about the midpoint makes every even-index coefficient zero, and the remaining odd-index coefficients alternate in sign. The $n^{-2}$ bound gives absolute convergence and uniform convergence; the series equals the continuous tent, including its zero endpoints.