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.
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.
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 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.
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 with .
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.
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 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 a function of period , its complex Fourier coefficients are
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.
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.