Let be a continuous -periodic function and on . On a circle about the axis, , giving the displayed line integral. A single-valued potential of a conservative vector field on the full punctured space exists if and only if this integral is zero. Necessity is the fundamental theorem for line integrals. For sufficiency, the primitive is -periodic when the mean is zero, and the gradient in cylindrical coordinates gives .
On a domain with one angular cut removed, the same primitive gives a potential of a conservative vector field even when the mean is nonzero, because the angle has a single-valued continuous branch there. For example has integral around the full circle but primitive on .
Cardinality of integer-periodic function spaces Created 2026-10-07 Updated 2026-10-14
For fixed positive integer period , integer-valued periodic functions on are in bijection with and hence form a countable set. Their union over periods is a countable union of countable sets. In contrast, period-one integer-valued functions on can prescribe arbitrary binary values on its infinitely many distinct classes modulo . The power set of a countably infinite set injects into them, proving uncountability.
A feedback delay is a time interval between an event and its returning influence. Multiple biochemical steps can introduce an effective lag; a fixed delay is an idealization, not a universal description of signal transduction. To isolate timing, let be a signed displacement from an equilibrium point and use normalized dimensionless variables:
The local removal is and the returning influence is negative at every delay. At the ordinary differential equation reduces to the decay already illustrated under signaling feedback. For a delay differential equation requires a history on , not just an initial condition at one instant. Negative values of are displacements, not negative chemical concentrations.
An exponential function gives the characteristic equation of a delay differential equation
Putting and equating real and imaginary parts gives and . The first crossing with therefore occurs at
For this particular mathematical model, the equilibrium point is asymptotically stable for . No nonnegative real delayed feedback characteristic root can satisfy the equation; the first loss of asymptotic stability is the indicated pair of imaginary delayed feedback characteristic roots. Differentiating the characteristic equation of a delay differential equation along a root yields
Thus the pair moves into growth as the delay increases through . The neutral mode at is a periodic function, but its amplitude depends on history: this linear mathematical model does not select an attracting limit cycle.
The figure plots using a delayed feedback characteristic root and that same formula on the history interval. At the displayed mode decays; at it grows. These are exact modes up to numerical root accuracy, not step responses with identical histories. Molecular bounds and a changed return law would be needed to interpret what happens after an unstable biological response becomes large.
Fourier analysis Created 2026-09-24 Updated 2026-10-14
Fourier analysis describes a function by the oscillations that compose it. A graph records values at successive positions or times; a frequency spectrum records how much of each frequency is present, together with its wave phase. The same complicated shape can become a short list of simple components. For periodic functions, the components form a Fourier series; on the whole real line, the Fourier transform uses a continuous range of frequencies, and the Fourier inversion theorem puts them back together.
For a concrete example, consider the trigonometric polynomial
With measured in seconds, its three Fourier harmonics have frequencies , , and cycles per second and amplitudes , , and . Each cosine has zero wave phase. Adding them creates the sharper peaks in the figure. The frequency spectrum makes the recipe immediately visible; changing an amplitude changes the shape without changing the component's frequency. Fourier orthogonality lets us recover each Fourier coefficient by averaging against the corresponding sine or cosine, because the other Fourier harmonics cancel over a full period of a function.
The deeper reason these components are so useful is that they simplify operations. By Euler's formula, the exponential function packages a cosine and a sine into one Fourier mode. A translation or a derivative changes only its multiplier:
Thus Fourier modes are simultaneous eigenfunctions of these operations. In Fourier series, this gives a literal diagonalization in the Fourier basis; on the real line, the Fourier transform gives the continuous counterpart, with each frequency handled separately. The Translation property of the Fourier transform and the Fourier transform of a derivative turn shifting and differentiating a whole function into multiplication of its Fourier transform. A convolution likewise becomes multiplication by the convolution theorem. This is beautiful because one description simplifies several apparently different operations at once.
For example, the heat equation , with thermal diffusivity , evolves a spatial Fourier mode as
Fine ripples have larger angular frequencies and decay faster: the formula explains why heating smooths a jagged temperature profile. For a general initial profile with sufficient regularity, the Fourier transform gives , and Fourier inversion recovers the temperature. Similarly, multiplying selected parts of a frequency spectrum suppresses unwanted components. Claude E. Shannon's Communication in the Presence of Noise (1949), Section III, describes ideal filtering as a projection that retains some frequency coordinates and removes others.[ref]
The physical motivation is already visible in Joseph Fourier's Théorie analytique de la chaleur (1822). Chapter III constructs heat profiles using sums of sines and cosines; Chapter IX, articles 355–359, passes from Fourier series to integrals as the spatial interval becomes unbounded. These heat problems explain the motivation for the discrete and continuous descriptions. Their modern formulations specify which functions admit reconstruction and in what sense the expansions converge.[ref][ref]
Fourier series Created 2026-09-24 Updated 2026-10-13
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].
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
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.
Fractional part Created 2026-09-24 Updated 2026-10-20
The fractional part of a real number is
It is the amount left after removing the lower enclosing integer, even for negative inputs. Thus . It is not the signed string of digits obtained by truncation toward zero.
Translation by an integer leaves the fractional part unchanged: . It is therefore a periodic function with period one, increasing from zero toward one on each unit interval, then returning to zero at the next integer. In Euclidean division with , ; for , this is .
The notation is useful for following repeated motion modulo an integer. In normality and equidistribution under integer multiplication, the values shift the digits of a positional notation; the fractional part discards the leading integer portion without losing the remaining digits. Its braces must be distinguished by context from the braces denoting a set.
Fundamental period of a function Created 2026-10-14 Updated 2026-10-20
The fundamental period is the least positive period of a function, when one exists. For it is one; for it is . A periodic function need not have a fundamental period: a constant function has every positive period, and periodic function without a least positive period is a nonconstant exception. Every nonconstant real-valued function that is continuous and periodic on the real line does have a least positive period.
Monodromy matrix of a periodic linear system Created 2026-10-06 Updated 2026-10-14
For the homogeneous linear differential equation with continuous coefficient matrix of period , the monodromy matrix of a periodic linear system is the one-period map from to . If is any fundamental matrix,
Its eigenvalues are the Floquet multipliers. Multipliers are nonzero, since a fundamental matrix is invertible. Changing the starting phase conjugates , so the Floquet multipliers and Jordan blocks are independent of that choice.[ref]
This turns a continuous-time problem into repeated matrix multiplication:
If , the associated solution of a differential equation obeys at every time, not merely at the sampled times. In particular, gives a nonzero -periodic solution, and every nonzero -periodic solution arises this way. If , the state changes sign after one period and repeats after two. A unit-modulus Floquet multiplier different from need not give repetition after one period, and a generalized eigenvector in a nontrivial Jordan block need not even give bounded motion.
For the scalar example under periodic solution, is the one-by-one matrix . Numerically solving a matrix problem uses the same idea: integrate one initial value problem for each column of through one period, then compute the eigenvalues of . This is useful when an explicit solution of a differential equation is unavailable: one period determines the Floquet growth rate over arbitrarily many periods.
For piecewise constant coefficients, which are also covered by the one-period construction, is the time-ordered product of the segment matrix exponentials, with the earliest segment on the right. For example, take period and alternate
Since ,
Replacing the coefficient by its mean would instead give and the incorrect rate . The matrices do not commute. The scalar mean-coefficient formula therefore cannot simply be transferred to matrix systems. Nevertheless the Liouville formula for a fundamental matrix gives the correct determinant even in the noncommuting case:
In the example, this is ; it fixes the product of the Floquet multipliers, rather than either multiplier separately.
In Sur les équations différentielles linéaires à coefficients périodiques (1883), Gaston Floquet calls a function satisfying periodic of the second kind, and distinguishes the genuinely periodic function obtained when . This historical terminology captures precisely the difference between repetition of the coefficient and repetition of the state.[ref]
On the circle group , normalized Haar measure is the pushforward measure of uniform angle on . For a continuous function , define
The factor makes the integral of the constant function equal to . For , a change of angle gives
The last equality uses the -periodic function . Since the circle group is an abelian group, this also verifies right invariance. An arc of angular length has normalized Haar measure . In particular, the arc and its quarter-turn both have measure .
Figure 1.
A quarter-turn changes the position of an arc but preserves its normalized Haar measure
. Multiplication by carries the blue arc onto the orange arc. Both span and have Haar measure . The diagram is generated by circle-group-rotation-invariance.py. Details.
The continuous unitary characters , indexed by integers, give a fully computed family of integrals:
Here must be an integer, so is well defined and . Every nonconstant mode cancels exactly over a full turn. For example, the integral of is , and the integral of is . More generally,
This is the orthogonality of complex exponentials underlying the Fourier basis and Fourier series: invariant averaging separates distinct frequencies and retains the constant component.
If , evaluation at zero gives and differentiation at zero gives . Thus the solutions are linearly independent. For ,
so .
Variation of parameters sets with , . Solving gives and . Zero integration constants enforce both initial conditions. Therefore
For fixed , this kernel is a linear combination of homogeneous solutions, so . On the diagonal and . Differentiating the integral twice now verifies the forced equation as well as . Standard uniqueness of the linear initial-value problem makes this the solution, for continuous .
If have period , their derivatives do also, hence is periodic. The kernel is periodic in its first variable. With , split the integral at and use this periodicity to get
At , the right side is , because and ensures is not identically zero. Thus , so cannot have period . This direct sign argument also rules out any apparent cancellation between the two terms.
Write the Fourier coefficients as . The partial sum through frequencies is therefore a convolution with
The last expression follows by summing a finite geometric series, with its removable value at zero. Periodicity and the evenness of give
This also proves linearity and that the image lies in . We use the continuous periodic function space, consistent with the premise and the displayed maximum norm.
The convolution formula gives the upper bound
To prove sharpness within continuous functions, take
It is continuous and periodic, with norm at most one. At , dominated convergence gives . Hence that upper bound is the actual operator norm. Evenness yields
The approximating continuous signs avoid assuming that the discontinuous sign of the kernel belongs to the domain space.
Let be the Dirac comb. Pair the given identity with the Schwartz function . On the left this gives . On the right,
Therefore the Fourier series is
The Fourier bounds for Schwartz functions imply for every . For each nonnegative integer , choose to obtain . Thus the Fourier series and every differentiated Fourier series converge absolutely and uniformly on all of . In particular convergence holds in the topology of smooth periodic functions, defined by uniform convergence of every derivative on one period, and also in tempered distributions.
The periodization of a Schwartz function is
For every nonnegative integer , the Schwartz seminorms give uniformly for . The Weierstrass M-test gives absolute and uniform convergence there of the defining series and all its differentiated series. Termwise differentiation proves that is a smooth function, with . Reindexing the absolutely convergent series proves , so it is a periodic function.
For an explicit smooth periodic partition of unity, choose the bump function
It is a test function, positive on . The smooth function is periodic and strictly positive, since every has a translate in . Set
Division preserves smoothness because , and the support remains contained in .
Use the smooth periodic partition of unity above and define the Fourier coefficients of the periodic distribution by
These are the smooth-window Fourier coefficients of a periodic distribution for period . The finite Schwartz seminorm bound for , restricted to the fixed compact support of , gives for some . Indeed, only finitely many derivatives of occur, and each contributes at most a fixed power of .
For a Schwartz function , the preceding Fourier series formula and yield
All derivatives of this series converge uniformly. The localization formula in the previous answer therefore gives
Consequently the Fourier transform of a periodic distribution is
The polynomial bound on and rapid decay of make every displayed pairing absolutely convergent. In particular there are no derivatives of Dirac delta distributions in this formula.
The inverse Fourier transform of is . Applying continuous Fourier inversion on tempered distributions to the symmetric partial sums gives
Explicitly, for every Schwartz function , the pairing of the partial sum with is , which converges absolutely to . The Fourier transform formula also proves that is independent of the chosen smooth periodic partition of unity. For a locally integrable periodic function it reduces, by splitting the integral into periods, to .
Put and form its period-one periodization of an integrable function
The function is not a Schwartz function, so justify the needed Poisson summation formula directly. For every , its derivative satisfies as . Thus the Weierstrass M-test gives uniform convergence on of this series and each differentiated series. It follows that is a smooth period-one periodic function.
Absolute integrability and Fubini's theorem allow its Fourier coefficients to be computed by splitting the real line into unit intervals:
These Fourier coefficients are absolutely summable. Their Fourier series defines a continuous periodic function with the same Fourier coefficients as ; uniqueness of Fourier coefficients in L1 identifies the two almost everywhere, and continuity then identifies them everywhere. Evaluating at zero gives the rigorously justified Poisson summation formula
Rearranging proves
The last series is a geometric series with sum . Equivalently, the left side is , where is the hyperbolic cotangent.
Let denote the actual horizontal velocity field. With constant nonzero Coriolis parameter , geostrophic balance and hydrostatic balance, using pressure per reference density , give
Differentiate the first equation in to obtain thermal-wind balance:
Taking the dot product with proves
Thus the horizontal velocity is tangent to the horizontal buoyancy contours at every height. For a fluid whose thermal equation of state makes horizontal buoyancy contours coincide with horizontal temperature contours, there is no horizontal advection across those contours. In a dry terrestrial atmosphere, use potential temperature as the materially conserved thermal variable. A salinity contribution to buoyancy would require separate treatment before interpreting the result as a statement about temperature.
The usual statement about net meridional heat transport also follows explicitly. Introduce a horizontal streamfunction such that . Integration of thermal-wind balance gives
and hence
For a zonally periodic function , or vanishing endpoint contributions, the zonal integral is zero. Likewise, the anomalous eddy buoyancy flux is
The required correlation between meridional velocity and thermal anomaly is absent. A nonzero vertical phase tilt, as in the next part, permits that correlation.
Qualification of the wording. The result does not say that the local heat flux vector vanishes, or that an arbitrary open-domain integral vanishes without boundary conditions. For a concrete counterexample to that literal reading, take and . These satisfy the displayed thermal-wind balance, but is generally nonzero. What the hypotheses alone guarantee is zero transport across horizontal buoyancy contours; the vanishing zonally integrated heat transport uses the stated endpoint condition.
Use the inclusive convention: a set is countable if it admits an injective function into . This includes every finite set and the empty set. If is injective and , its restriction to is still injective, proving directly that every subset of a countable set is countable.
Enumerate pairs by diagonals. The positive-integer Cantor pairing function
is a bijection : on the diagonal , its values are through , each once, and these consecutive blocks partition . This proves countability without assuming any product theorem.
For a sequence of countable sets , choose injections . For in their union, let be the least index containing . The map
is injective: its encoded index and the injective within-set code recover . Thus a countable union of countable sets is countable. Selecting the injections for an arbitrary given family uses the usual axiom of countable choice; when the encodings are supplied, the displayed construction is entirely explicit.
For finite Cartesian powers, start with the identity injection on and recursively encode as . This proves that is countable for every positive integer and is the constructive proof of the finite Cartesian power of a countable set property.
For each positive integer , let consist of the functions for which is a period. Restriction to the residues is a bijection : any tuple extends uniquely to all of by taking residues modulo , including negative arguments. Hence is countable. Every periodic function belongs to some , so
There is no need to assume the chosen period is minimal; multiple descriptions only create overlap, which does not invalidate the union argument. This is an instance of the cardinality of integer-periodic function spaces principle.
Use and normalized measure . The Fourier partial sum at zero is the real linear functional
where the Dirichlet kernel is
The quotient follows by summing the finite geometric progression, with its removable value . It is a real continuous periodic function. If
then . This bound is its exact operator norm even on the real continuous functions. Indeed, for set
It is real, continuous and periodic with norm at most one, and
by dominated convergence. At zeros of the kernel the integrand is zero, and elsewhere its limit is .
For , . Using evenness and putting gives
For the last inequality, split into the first complete intervals : their sine integrals are two and . The harmonic sum tends to infinity. This proves the Dirichlet kernel harmonic lower bound.
Choose with , then choose sufficiently small that . Thus
This constructs continuous near-maximizers, rather than using the discontinuous sign of the kernel as the desired function.