A Fourier series describes a periodic function through sines and cosines whose frequencies are integer multiples of one base frequency. These Fourier harmonics give a useful alternative to describing the value at every input: each Fourier coefficient measures how much of one oscillating pattern is present. For a real, integrable function of period , the real form is
The cosine formula includes ; the sine formula uses . Thus is the mean value over a period, not itself. The symbol associates a function with its Fourier coefficients; an equality requires a specified kind of convergence, such as pointwise convergence. For general period , replace by and the coefficient prefactor by . Fourier orthogonality explains why integrating against one mode removes the others. [ref].
For a finite example, take
Its mean is , its real Fourier coefficients are , , , and all other vanish. At , the three contributions add to . The function is already a trigonometric polynomial, so retaining these modes reconstructs it exactly. Here is an angular coordinate in radians; if it instead represents time, a base angular frequency must supply the corresponding units.
Figure 1.
Three simple components reconstruct a periodic signal exactly
. The constant function , the cosine , and the sine add to the displayed trigonometric polynomial. The marked input has output . Each contribution can be measured separately by its Fourier coefficient. Details.
The change of viewpoint is useful because many linear problems act separately on these modes. The second derivative maps to and maps in the same way. Consequently a differential equation that is complicated for a whole profile can become a simpler calculation for each Fourier harmonic. A linear time-invariant system similarly has a separate response to each complex exponential. Superposition combines the responses when the relevant sums and operations are justified. [ref].
The infinite case contains a subtlety absent from the finite example. Under pointwise convergence of a piecewise smooth Fourier series, the value at a jump discontinuity is the average of the two one-sided limits. For a square-integrable function, the complex Fourier series instead converges in the norm: the integrated squared error tends to zero. Neither statement says that the error becomes small everywhere at once. A square wave shows the difference vividly through the Gibbs phenomenon.
A historical source for this connection between profiles and modes is Joseph Fourier's 1822 book Théorie analytique de la chaleur. Chapter III develops expansions in sines and cosines while studying the propagation of heat. The heat equation gives a continuing application of this approach. [ref].
For an integrable periodic function with one-sided limits at , the displayed condition implies that its classical Fourier partial sums converge to . To prove it use the Dirichlet kernel and its integral . Subtract the target value and combine the positive and negative halves of the convolution integral. The resulting difference is
The coefficient of the sine is integrable near zero by the Dini condition, and away from zero by integrability of . The Riemann-Lebesgue lemma therefore makes this expression tend to zero. Step functions satisfy the condition because the numerator vanishes in a sufficiently small punctured neighborhood. This is a local Fourier convergence test, distinct from Dini's theorem on uniform convergence of monotone sequences of continuous functions.
A Hadamard-lacunary Fourier series has nonzero frequencies supported on a positive sequence with the displayed gap ratio, possibly together with its negatives and finitely many extra modes. Such gaps strongly restrict additive frequency relations. They make moment estimates resemble those of independent random variables. For a ratio greater than three, the strongly lacunary polynomial L1-L2 bound follows directly by enumerating fourth-moment pairings.
Use normalized measure on the circle. If a trigonometric polynomial has frequency support with , every zero sum of four signed frequencies pairs into opposite equal frequencies: the largest unpaired term would exceed the sum of the other three. Expanding the fourth moment and bounding its three possible pairings gives . The Holder inequality gives and hence the displayed estimate. Therefore an function with only these lacunary frequencies has square-summable coefficients: apply the estimate to its uniformly -bounded Fejér sums and then pass to finite coefficient blocks. Finitely many extra modes do not affect the conclusion.
For positive integers , the sine functions form an orthogonal family on :
The same formula holds for the corresponding cosine functions when both indices are positive. Product-to-sum identities reduce the distinct-index products to cosines with nonzero integer frequencies, each with zero integral; for matching indices, the squared sine or cosine has mean . This proves the formula and explains why separate normal modes of a uniform fixed-end string make additive contributions to its kinetic energy and potential energy. The constant cosine has squared norm rather than .
One standard sufficient form states that the Fourier series of a piecewise continuously differentiable periodic function converges at to . At a continuity point it equals . This modern sufficient form should be distinguished from the exact hypotheses of the 1829 original.[ref]
An even train of rectangular pulses of width , period and unit area per pulse has Fourier coefficients for . Here the sinc function is normalized as , and the constant contribution is . Integrating the cosine over the pulse proves the formula; evenness eliminates the sine coefficients. At a pulse edge, pointwise convergence of a piecewise smooth Fourier series gives the mean of the one-sided values rather than a prescribed endpoint value.
For the Fourier series of a periodic rectangular pulse, the sinc function is nearly one when and has its first zero at . Thus narrowing a pulse increases the range of significant Fourier coefficients. Only integer harmonic indices occur, so an envelope zero need not be an exactly vanishing coefficient.
Extend on with period two. Its Fourier coefficients in the basis are , , and , by integration by parts on . Thus
Its even part is the periodic extension of and its odd part is the Fourier series of a periodic sawtooth for . The cosine terms converge absolutely and uniformly; the sine terms account for the jump at odd integers. At each jump, the full Fourier series has value , the average of the two one-sided limits and .
Extend from with period . It is an even function, so all sine Fourier coefficients vanish. The product-to-sum identity gives
Indeed, integrate on and use . Thus
The coefficients are , so the series converges absolutely and uniformly. The Dirichlet-Jordan convergence theorem identifies it with the periodic function everywhere, including the endpoints because the two endpoint values agree. Substituting a noninteger rational frequency and a convenient yields explicit series sums. Integer frequencies require taking removable limits rather than substituting into a zero denominator.
Let be nonzero real constants and let be a smooth periodic function of period , with real Fourier coefficients . Write the unknown periodic solution with Fourier coefficients . Fourier orthogonality applied to the equation gives
Solving these two-by-two linear systems gives
The smooth forcing has rapidly decreasing Fourier coefficients, so the resulting series and its derivatives converge and satisfy the equation. Uniqueness follows because the difference of two solutions is , which is periodic only when . A single sinusoidal forcing therefore gives a single sinusoidal response with changed amplitude and phase.
Let and real . Extend with period . In the Fourier series convention , put . Direct integration gives
For example, the required antiderivatives are and . The Dirichlet-Jordan convergence theorem gives the exponential value away from the jumps and their midpoint at odd multiples of . For , the function is identically one, with and all other Fourier coefficients zero.
For , with period , half-wave rectification gives
The Fourier coefficients are , , , with all remaining coefficients zero. To derive the cosine coefficients, integrate over and use the product-to-sum identity. The sine coefficients follow from orthogonality. A half-period delay reverses only the fundamental sine term and leaves the constant and even-frequency cosine terms unchanged, by translation of a Fourier series.
For a period- Fourier series written as , where , translating the function by to rotates each pair of Fourier coefficients:
The constant coefficient is unchanged. These formulas follow by the sine and cosine subtraction identities. In the complex Fourier series, the same statement is . An integer-period translation changes no Fourier coefficient.
For , periodically extend and from with period . Their Fourier series are
and, away from odd integers,
The first identity follows by integration of on , using the antiderivative
For the second identity, integration by parts and show that its sine coefficient is times the first series' cosine coefficient. This avoids assuming that a Fourier series can always be differentiated term by term. The periodic hyperbolic cosine is continuous, so its series converges to it everywhere. The periodic hyperbolic sine has a jump discontinuity at each odd integer: the Dirichlet-Jordan convergence theorem gives the average of its two limiting values, namely zero, there. Both identities hold in the sense of mean-square convergence, which suffices for Parseval's identity.
A square wave alternates between two constant levels for equal halves of a period. Choose a -periodic function equal to on and on , with value zero at the jumps. Its odd function symmetry makes the mean and every cosine Fourier coefficient vanish. Directly integrating the two constant pieces gives
Thus only odd sine Fourier harmonics occur, with amplitudes decreasing like the reciprocal of their frequency multiplier. Every finite Fourier partial sum is smooth, yet their pointwise limit has jumps. At those jumps the Fourier series converges to zero, the midpoint of the two levels, regardless of which value we assign to the original function there.
This example explains how smooth components can encode sharp transitions. Increasing the number of Fourier harmonics narrows the transition region, but also produces the persistent overshoot described by the Gibbs phenomenon. The illustrated square wave and coefficient calculation are mathematical constructions, not measurements of a physical device.
A zero-mean square wave of amplitude has total mean-square signal power . Each positive odd Fourier harmonic and its negative-frequency partner contribute , by its exact Fourier coefficients. The fundamental pair therefore accounts for of the total. The sum of contributions above harmonic index decays on the order of , although the discontinuous waveform still requires arbitrarily high harmonics for exact reconstruction.
The Gibbs phenomenon is the persistent overshoot near a jump discontinuity in ordinary truncated Fourier series. For this square wave, retain nonzero odd modes:
As grows, the first peak approaches the jump while its height tends to approximately . This is an excess of about above the upper level , or of the jump size . The narrower region does not imply a vanishing maximum error. At the jump itself every . These observations are compatible with pointwise convergence and convergence but exclude uniform convergence to the discontinuous square wave. [ref].
Figure 1.
More Fourier harmonics narrow a transition while leaving a persistent overshoot
. Left: the constructed square wave and sums of , and nonzero odd Fourier harmonics. Right: the same sums near the jump at zero, with each first positive peak marked. The highest frequency retained is , so a count of nonzero terms differs from a cutoff at frequency . The limiting peak is approximately , while the level above the jump is . Details.
For this particular sum, its derivative is away from multiples of , so the first positive peak is exactly at . There,
This is a midpoint Riemann sum tending to , where is the sine integral. It gives a short explanation of the nonzero limiting excess.
The phenomenon matters whenever a sharp boundary is represented by a limited set of Fourier harmonics: a visible ripple can be a property of the approximation rather than an oscillation in the original profile. Josiah Willard Gibbs reported the phenomenon in his 1899 letter “Fourier's Series” in Nature, volume 59, page 606. This is a documented historical report, without a claim of first discovery. [ref].
For real noninteger , the periodic extension from has the displayed Fourier series, obtained by the product-to-sum identity in the sine coefficient integral. It equals the original function in the open interval and zero at the periodic endpoint jumps. At , Parseval's identity gives . Integer frequencies instead already belong to the ordinary sine basis and should not be substituted into the removable coefficient singularities without taking limits.
The complex exponential functions , for integers , are orthogonal under the normalized integral inner product over a complete period. If , the integrand is one; otherwise its antiderivative has equal endpoint values, giving zero. For the real modes, for , while every mixed sine-cosine integral and every unequal-frequency pairing vanishes.
This makes the coefficient formulas useful: multiply a trigonometric polynomial by one mode and integrate, and all other modes cancel. For , integration against gives , and against gives , recovering and . Division by the squared norm of the mode supplies the normalization. A full period matters; truncating the integration interval generally destroys these cancellations.
If the symmetric partial sums of tend to zero at every point outside a finite set, then all coefficients vanish. Almost-everywhere convergence first gives . The twice-integrated series is continuous. Riemann summation of a convergent trigonometric series makes its symmetric second derivative zero away from the exceptional points, so it is affine on each intervening interval. Sinc-squared summation of a sequence tending to zero makes its symmetric first-order quotient zero everywhere, removing all possible affine corners. The globally affine function differs from a periodic function by , forcing ; periodicity then makes it constant, and integration against each nonzero frequency gives .
Suppose the symmetric partial sums converge at a fixed point. Group positive and negative frequencies together, let be the resulting partial sums and set , with . Summation by parts expresses the weighted sum as , where . The total variation of these weights is at most , independently of , and each fixed difference tends to zero. Subtract the limiting value of and split into a finite prefix and a uniformly small tail to prove convergence to that value. This is a regular summation method even though the sinc-squared weights need not decrease monotonically.
If symmetric partial sums converge almost everywhere on the circle, then . Their successive differences tend to zero almost everywhere. If failed to tend to zero, choose a subsequence with . The normalized are bounded by one and tend to zero almost everywhere, so dominated convergence makes their squared integrals tend to zero. Fourier orthogonality instead makes those integrals , a contradiction.
For , this continuous function on has nonnegative Fourier coefficients
It is times the periodic convolution of two indicators of . Its Fourier series is absolutely convergent, , and . Consequently, if all points avoid the interval , some frequency satisfies . This detects missing small neighborhoods by a large exponential sum.
There are continuous functions whose Fourier series diverges at a prescribed point. In contrast, the Fejér kernel is nonnegative and has integral one, so Fejér summation is a uniform-norm contraction. The resulting Fejér sums need not be positive: for the constant function , every sum is .
A smooth compactly supported window with permits multiplying every periodic distribution unambiguously. Its Fourier transform sampled at integer harmonics gives the periodic coefficients. The sharp window works for locally integrable functions but can be undefined at singular period endpoints, such as delta derivatives.
For the period-one continuation of , symmetry and integration by parts give for . Thus the sine integral asymptotic gives as . Translation of the logarithmic singularity causes the alternating phase; the endpoint derivative mismatch causes the next term.
For a Diophantine frequency vector, the equation on a periodic torus has an analytic solution on each smaller complex strip exactly when has zero average. Its nonzero Fourier coefficients are , and its zero coefficient is arbitrary. Thus the normalized zero-mean solution is unique.
For a sufficiently small analytic periodic vector field , a near-identity angular diffeomorphism and a constant vector solve . They satisfy , ; if , then . For the defect , set , choose , and solve with zero mean. Updating by leaves a quadratic defect . The torus small-divisor estimate and geometrically decreasing strip losses yield a convergent analytic iteration.
If is analytic on a complex strip of width and has zero mean, the normalized solution satisfies . Fourier decay supplies after the strip loss, and lattice-shell counting bounds the remaining sum . This simple bound is sufficient for analytic conjugacy iterations even when sharper estimates are available.
Every null subset of the circle lies in the divergence set of the Fourier series of some continuous complex-valued function. One can arrange unbounded Fourier partial sums there. The compact-set Fourier amplification lemma, compact batching of a small open set and frequency-separated Fourier block series construct the function by a summable series of small blocks. The result covers nonclosed and dense null sets; it does not require the divergence set to equal the originally specified set.
For an integer , direct integration gives zero unless , in which case it gives one. Products of this identity on the unit cube turn integrals of finite exponential sums into counts of integer solutions. This is the elementary orthogonality used in the Vinogradov mean value.
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.
The period-one extension of on has Fourier series . Endpoint agreement makes the periodic function continuous. Its derivative series is , which equals in the open unit interval and converges to zero at integers, the midpoint of the derivative's jump. Termwise differentiation of a Fourier series applies locally away from the corners.
For a periodic function that is piecewise continuously differentiable with finitely many pieces, its Fourier series converges at each point to the average of the two one-sided limits. At a point of continuity this is the function value. This includes the identified interval endpoints, whose two limits belong to the periodic extension. Absolute summability of the Fourier coefficients additionally gives uniform convergence.
The complex form of a Fourier series for period uses coefficients and complex exponentials . For square-integrable functions it converges in the norm, and the Parseval identity is . Real functions satisfy .
The absolutely convergent sine series has the integral representation . The integrand is positive for , proving there without incorrectly maximizing individual Fourier terms.
The Wiener algebra consists of periodic functions with absolutely summable Fourier coefficients, with norm . Multiplication corresponds to discrete convolution of coefficients, so the norm is submultiplicative. Consequently also belongs to the algebra when does. Every such Fourier series is uniformly convergent and defines a continuous function.
Every algebra character of the Wiener algebra is evaluation at a unique point of the unit circle. Writing , both and have norm one. Thus satisfies and , hence . Continuity then gives . Conversely, evaluation defines a continuous algebra character. The resulting bijection is a homeomorphism for the Gelfand topology.
The analytic Wiener algebra consists of the power series with , identified with their values on the unit circle. The norm is . Discrete convolution gives multiplication and a submultiplicative norm; completeness follows from the absolutely summable sequence space. Each series converges uniformly on the closed unit disk and is holomorphic in its interior.
Every algebra character of the analytic Wiener algebra is evaluation at a unique point of the closed unit disk. Indeed, for , continuity and multiplicativity give , and . Conversely, this formula defines a continuous algebra character for every such . The evaluation correspondence is a homeomorphism for the Gelfand topology, since the power series are uniformly convergent on the closed unit disk.
A sinusoidal component at an integer multiple of a fundamental angular frequency. For a -periodic angular coordinate , real Fourier series use and . Summing over equally spaced phases removes every component whose integer is not a multiple of , since in that case. Indeed, the geometric series has ratio and sum . When divides , all terms are one. This cancellation isolates higher-order feedback in resonant conjunction geometry.
For an integer and , differentiating the partial-fraction expansion of gives
Both differentiated series converge locally uniformly. This kernel computes the Fourier expansion of a modular form for holomorphic Eisenstein series.
For , integrate around large squares whose sides have half-integer coordinates. The cotangent is uniformly bounded on these sides and the integral tends to zero. The residue theorem gives residues at the integers and at , proving the identity. For , the geometric-series formula for the cotangent also gives .
On the circle of circumference , the functions for form an orthogonal basis of .
A Fourier sine series expands a function on an interval in the eigenfunctions of the Dirichlet Laplacian. It is the odd Fourier-series extension across the interval endpoints.
On a rectangle , products of the one-dimensional Fourier sine basis give an orthogonal basis of L2 space. Fourier orthogonality in each variable gives
For a constant function one, these coefficients are : only odd indices occur. The product modes vanish on the rectangle's boundary, making them natural Dirichlet Laplacian eigenfunctions. In the heat equation, their amplitudes decay as . Initial data not vanishing at the boundary are still represented in the interior and in the square-integrable sense; the positive-time boundary values need not agree continuously with the initially assigned boundary values.
On , with , the tent has Fourier sine series coefficients . Split the coefficient integral at 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 bound gives absolute convergence and uniform convergence; the series equals the continuous tent, including its zero endpoints.
On , integration by parts gives the displayed Fourier sine series. For normalized Dirichlet eigenfunctions , indexed from , it has the form , with and . Its Rayleigh quotient for is , since and . Reflection symmetry forces , because that first excited eigenfunction is antisymmetric about . Thus the first excited state's contribution to the error is exactly zero; the first nonzero correction is .
The period- extension of on has Fourier coefficients and . Consequently
The Fourier series converges to the ramp away from its jumps and to zero at every jump, the average of the one-sided limits. For , Termwise differentiation of a Fourier series fails here as an ordinary convergent series: the differentiated summands have nondecaying amplitude . The classical derivative equals between jumps, whereas the periodic distributional derivative includes negative point masses of weight at the jumps.
On , the Fourier sine series of has zero even-index coefficients and odd-index coefficients . Substitute in the coefficient integral and use . For odd , integrating gives ; reflection about the midpoint makes the even coefficients zero. The decay gives absolute and uniform convergence, and Fourier orthogonality identifies the sum. In the heat equation with zero endpoint temperatures, multiply each coefficient by . With insulated endpoints, the same initial profile is instead just the constant and second cosine modes of a Fourier cosine series.
Extend from to a periodic function of period , with . It is odd and continuous, so its Fourier series contains only sine terms. Its Fourier coefficients are
Two applications of integration by parts prove the coefficient formula. The first has no endpoint contribution because vanishes at both endpoints; the second leaves a multiple of . Thus only odd frequencies survive, giving the displayed Fourier sine series. Its absolutely summable coefficients give uniform convergence, and Fourier orthogonality identifies its sum with .
Taking , . Parseval's identity therefore gives
For , split the sum at . The first part is bounded using ; summation by parts and the geometric bound on interval sine sums control the rest. The harmonic coefficient sum grows like , but cancellations keep the whole trigonometric polynomial uniformly bounded. Modulating this polynomial lets a Fourier partial sum expose the large uncancelled half.
The functions , , form a complete orthonormal basis of . An odd extension to reduces completeness to that of the Fourier series. Equality of all sine coefficients therefore implies equality almost everywhere; if both functions are continuous, it implies equality everywhere.
The normalized functions , , have completeness of an orthonormal system in L2 space on . If a function is orthogonal to every sine, extend it oddly to . All its Fourier coefficients vanish: the cosine and constant ones by oddness, and the sine ones by assumption. Completeness of the Fourier basis makes the extension zero almost everywhere. This proves the required dense-span property.
The Leibniz formula is the conditionally convergent alternating series
A trigonometric polynomial is a finite linear combination of complex exponentials , or equivalently of sines and cosines. If it vanishes on an interval, all its coefficients vanish.
A trigonometric polynomial of degree at most obeys the displayed derivative bound. Iteration gives . Applied to differences of approximants at dyadic degrees, this inequality underlies the inverse theorem for trigonometric approximation. It differs from the endpoint-weighted Bernstein inequality for algebraic polynomials.
Use the convention . Multiplying by gives Fourier coefficients for . A trigonometric polynomial of degree at most has no other frequencies, so convolution proves the displayed identity. Positivity and integral one of the Fejér kernel then give . This is a useful elementary estimate; the sharp Bernstein inequality for trigonometric polynomials improves to .
Under the displayed diagonal-sum convention, set on the unit circle. A Hermitian matrix then gives
Consequently proves nonnegativity. Conversely the Fejér–Riesz theorem produces the rank-one spectral-factor Gram matrix. This gives a semidefinite programming representation of nonnegative trigonometric polynomials. The reversed convention instead uses the unconjugated monomial vector.
For coefficient column , is a Hermitian matrix and a positive semidefinite matrix because . Expanding on the unit circle gives coefficient . Thus has matrix rank one when and zero otherwise. General feasible Gram matrices need not have matrix rank one.
A trigonometric polynomial nonnegative on the unit circle has a polynomial modulus-square factor of polynomial degree at most its trigonometric order. For a nonzero trigonometric polynomial of actual order , conjugate symmetry of trigonometric polynomial coefficients yields reciprocal-conjugate root pairing for . Even multiplicity of unit-circle roots of a nonnegative trigonometric polynomial permits pairing all roots of a polynomial. Select representatives and use
It follows that with . Evaluating away from the roots of a polynomial gives . Thus works. Constant and zero trigonometric polynomials have constant or zero factors. Different selections of roots of a polynomial and constant phases can give different factors.
If and is nonnegative on the unit circle, a root of a polynomial there has even multiplicity of a root. Indeed is a real analytic nonnegative function, whose first nonzero term in its Taylor series at a zero must have even order. The map has a simple zero, and multiplication by is nonvanishing, so the order equals the polynomial multiplicity.
A trigonometric polynomial is real on the unit circle precisely when its finite coefficients have the displayed symmetry. To prove necessity, conjugate its values on the circle, use , and compare coefficients. Multiplying a coefficient difference by gives an ordinary polynomial vanishing at infinitely many points, so it is zero. Symmetry also gives for every nonzero complex .
For a nonzero real-on-the-circle trigonometric polynomial of actual order , the polynomial satisfies . Its constant term is the nonzero conjugate of its leading coefficient. Hence its nonzero roots of a polynomial occur in pairs with the same multiplicity of a root. The coefficient reversal and complex conjugation preserve the exponents of the paired factors. Fixed roots of a polynomial on the unit circle require nonnegativity, rather than this symmetry alone, to have even multiplicity.
A Fourier partial sum retains the modes whose integer frequency multipliers satisfy in a complex Fourier series:
For a real function of period , this is equivalently . It is a trigonometric polynomial, even when the original function is discontinuous. For a square wave, retaining nonzero odd sine modes gives ; all even-frequency coefficients are zero. The Gibbs phenomenon illustrates why more retained modes need not reduce the maximum error.
For each integer , the set of continuous functions satisfying for every is closed in the uniform norm. If it contained a ball of radius , subtracting two members of that ball would bound every partial-sum functional norm by . The Dirichlet kernel harmonic lower bound excludes this, so these sets are nowhere dense. By the Baire category theorem, their complement is a dense set. Every function in that complement has unbounded Fourier partial sums at zero. Translation gives the same conclusion at any prescribed point. This is a direct Uniform boundedness principle argument on the real Banach space of continuous functions on the circle.
This average of Fourier partial sums reproduces every degree-at-most- trigonometric polynomial. With ,
The bound follows because Fejér summation is a uniform-norm contraction. For , the term involving is omitted.
A continuous complex-valued function can have uniformly bounded Fourier partial sums which fail to converge at one point. Normalize harmonic sine polynomials by their harmonic coefficient sums, modulate them into disjoint high-frequency intervals and choose their degrees so that the complete norms are summable. At zero, complete blocks vanish while their midpoint prefixes have a common nonzero value. The frequency-separated Fourier block series gives a uniform bound on every partial sum as well as two distinct subsequential values.
If trigonometric polynomials have spectra in increasing disjoint positive-frequency intervals, the displayed summability gives a continuous uniform sum. At any cutoff its Fourier partial sum contains complete earlier blocks, at most one active prefix and no later blocks. Differences across an active prefix therefore isolate that block exactly. Fixed-size excursions occurring in arbitrarily late blocks contradict the Cauchy criterion, even when the complete blocks vanish at the point under consideration.
For a compact circle set with normalized Lebesgue measure at most , where and , the displayed bounds can be realized by a trigonometric polynomial with spectrum in a positive-frequency interval arbitrarily far from zero. Take the logarithm of a positive-real-part Schwarz integral on the unit disk of a small-mean cutoff, truncate after radial dilation, and modulate its bounded imaginary part. A prefix isolates one analytic half and thus reveals the large real part. The separation between small function norm and large Fourier partial sums drives the Kahane-Katznelson divergence theorem.
Let finitely many arcs have centers , half-lengths and . Each summand has positive real part on the closed disk, and . On the th arc its contribution has real part at least . Thus the analytic logarithm obeys , , and throughout the arc union. Approximate by an analytic polynomial and modulate its bounded imaginary part; a partial Fourier sum isolates one half of the polynomial, producing a large value from a bounded function.
For , define . Evenness and on give . The first complete sine periods of length have absolute sine integral two, and on the th such interval . This proves the displayed unbounded lower bound. The real functional on continuous functions has norm exactly : the upper bound is its kernel integral, and the continuous functions approach that bound as by dominated convergence.
The Fejér kernel is the arithmetic mean of the Dirichlet kernels. It is nonnegative and has normalized integral one.
The th Fejér sum is the arithmetic mean of the first Fourier partial sums. Equivalently, it is the convolution of the function with the Fejér kernel.
The Cesàro means of the Fourier series of a continuous periodic function converge uniformly to that function. The Fejér kernel is nonnegative with total mass one after normalization, and its mass outside every fixed neighborhood of zero tends to zero. Uniform continuity controls the near contribution, while the vanishing tail controls the rest. For an function the same positive-kernel argument gives an contraction, which is useful even when pointwise behavior is unavailable.
For a periodic Hölder continuous function of Hölder exponent and Hölder seminorm at most , the degree- Fejér sum has the displayed supremum norm error bound. In the half-kernel normalization , use . Splitting the convolution error integral at gives the valid constant . At the endpoint this argument instead gives .
The normalized Fejér kernel satisfies on . Splitting its first absolute moment at gives . The chaining inequality for the modulus of continuity, , then bounds the Fejér sum error by . Taking proves the stated bound for and hence uniform convergence for continuous periodic functions. The logarithm vanishes at , so the displayed estimate is not intended at that index.
The positive normalized Fejér kernel has a tail. Split the error integral at and use the chaining inequality . Its tail contributes at most a constant times . The factor is uniformly bounded for each fixed , proving the displayed estimate. Its constant need not remain bounded as tends to one.
The even positive Fejér kernel of total mass one gives . The scaling property of the second modulus of smoothness bounds this by . On , gives . Choose . For twice continuously differentiable functions, the second-difference integral formula makes the error .
For fixed positive integer and , the Fourier coefficient of the Fejér kernel at frequency multiplies the mode by . The displayed error is exact. Consequently the order cannot be replaced by for all twice continuously differentiable periodic functions, even though each fixed Fourier mode is infinitely differentiable.
The Fejér kernel is nonnegative and has unit mass in its convolution normalization. The integral triangle inequality therefore bounds the supremum norm of a Fejér sum by that of the original function. In the half-kernel convention , its integral is and the convolution prefactor is .
For an integrable function of period , its complex Fourier coefficients measure its inner product with each complex exponential mode:
For a real function of period , the real coefficient convention of Fourier series gives and for , with . For , the only nonzero complex Fourier coefficients are , , , and . This explains why the real and complex lists look different while representing the same function.
The rate at which Fourier coefficients approach zero as their index increases. The differentiability of the periodic extension, including matching values and derivatives at its joins, controls this rate through integration by parts. An absolutely bounded tail with gives a uniform truncation error .
For an integrable function on , with and integer , the displayed Fourier coefficient multiplies the mode in its real Fourier series. Fourier orthogonality fixes the normalization because the squared mode has integral . If is odd, the product with the sine is even, so . These are also the coefficients of the Fourier sine series of the restriction to .
If is integrable and -periodic and is a positive integer, then for every integer with . Split the integral into equal intervals and substitute to obtain
The root of unity sum vanishes by the finite geometric series formula. The zero mode is , so a mean-zero dilated function is orthogonal to all trigonometric polynomials of degree at most .
For a periodic absolutely continuous function with derivative in , integration by parts gives . Bessel's inequality and the Cauchy-Schwarz inequality prove the displayed bound in the normalized circle norm. Adding the constant coefficient gives an absolutely and uniformly convergent Fourier series. Merely bounding individual coefficients by would not establish absolute convergence.
If a periodic integrable function has all Fourier coefficients zero, it vanishes almost everywhere. Its Fejér sums vanish, whereas the Fejér kernel is an approximate identity and converges to that function in the integrable norm. Applied to a periodized squared Fourier transform, this detects orthogonality of integer translates.
If a periodic function extends analytically and remains bounded in a nonzero complex strip around the real axis, contour shifting gives constants such that
This exponential decay underlies spectral convergence of Fourier approximation and periodic trapezoidal quadrature.
When regularity and convergence justify termwise differentiation, the derivative of a Fourier mode multiplies its coefficient by its frequency. For period ,
A Fourier cosine series has the form
It represents the even function obtained by reflecting its data across the origin.
For and , set . The cosine modes satisfy a homogeneous Neumann boundary condition at zero and a homogeneous Dirichlet boundary condition at . Their squared norm is , and integration by parts gives
Thus their Fourier coefficients are , proving the displayed formula by Sturm-Liouville theory. One can also obtain completeness by extending evenly across zero and oddly across : the resulting continuous -periodic extension has only odd-index cosine modes. The coefficient bound proves uniform convergence, including both endpoints. This expansion supplies the initial transient for a heat equation with mixed endpoint conditions.
The even extension of a function is for . It is an even function. Its -periodic extension is the function expanded by the half-range Fourier cosine series.
For and , the even quadratic polynomial has the displayed expansion in even Dirichlet eigenfunctions. Put . Their squared norm on is . Two integrations by parts, using , give
Division by gives the displayed Fourier coefficients. The cubic decay gives uniform convergence. The half-integer frequencies arise from requiring both evenness and zero values at the endpoints, rather than from a periodic boundary condition. This expansion is useful in rectangular duct flow.
On , the Fourier cosine series convention uses the displayed coefficients, including . Orthogonality of the cosine modes gives these formulas for square-integrable functions; the expansion is interpreted in the L2 norm until stronger convergence is established.
For a function prescribed on , its half-range Fourier cosine series is the Fourier series of the even extension, made -periodic. Its coefficients are , including . At a jump the usual piecewise-smooth convergence theorem gives the average of the two one-sided limits of the periodic extension.
For a positive integer , take on and form its half-range Fourier cosine series. The product-to-sum identity gives
Thus for opposite parity and zero for the same parity. The exceptional integral is zero. The constant term is , not . These coefficients represent the even periodic extension, not the original sine wave on negative arguments. Their quadratic decay gives absolute convergence.
On ,
Parseval's identity and direct integration of the square give

Ancestors (4)

  1. Analysis
  2. Area of mathematics
  3. Mathematics
  4. Home

Synonyms (1)

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Fourier series by Ciro Santilli 40 Updated 2025-07-16
Approximates an original function by sines. If the function is "well behaved enough", the approximation is to arbitrary precision.
Fourier's original motivation, and a key application, is solving partial differential equations with the Fourier series.
The Fourier series behaves really nicely in , where it always exists and converges pointwise to the function: Carleson's theorem.
Video 1.
But what is a Fourier series? by 3Blue1Brown (2019)
Source. Amazing 2D visualization of the decomposition of complex functions.