Constant function Created 2026-09-24 Updated 2026-10-14
On a nonempty domain of a function , a constant function has one fixed value in its codomain:For example, on the real line is a horizontal graph. Its image of a function is the singleton even though its domain of a function has infinitely many inputs. A constant function from the real line to the real numbers has derivative zero and every nonzero real period of a function; there is no smallest positive period. It supplies a reference level from which variation can be measured.
A constant map between vector spaces is a linear map only when its value is the zero vector, since a linear map must preserve zero. A nonzero constant map is still an affine map. In a Fourier series, the constant term records the period average, while the other terms describe oscillation around that level.
Finite-window lock-in response 2026-10-18
An observation interval of finite duration is not an infinitely sharp frequency selector. Combine the lock-in quadratures intoFor unwanted electric potential difference , where is an angular frequency offset and , expansion into complex exponentials gives the exact responseThe sinc function formula follows by integrating the exponential function and factoring ; its value at zero follows from a limit. The first term changes slowly after multiplication; the second oscillates at the sum frequency. It vanishes at exact matching when is an integer number of reference cycles, each lasting one period of a function, but cannot generally be discarded in a short-window calculation.
For and many reference cycles, the first term usually dominates: its modulus is and its complex argument includes . Thus gives almost no rejection. A longer observation separates closer frequencies, with the first zeros of this term at . Those zeros are not a brick-wall cutoff: the sinc function has nonzero lobes beyond them. At a synchronized contribution remains however large becomes.
For a numerical check, use , , and an unwanted frequency . Then and the exact expression giveswhereas the difference-frequency term alone gives . An interference amplitude therefore contributes to in this constructed example. A nearby frequency can survive strongly even though the three-times-frequency component in lock-in harmonic rejection cancels exactly.
A practical lock-in amplifier's low-pass filter weights past products differently from this rectangular observation interval. Its time constant and roll-off determine near-reference rejection and settling time; narrowing detection slows the response.[ref]
Model SR830 DSP Lock-In Amplifier manual by Stanford Research Systems. Model SR830 DSP Lock-In Amplifier manual, printed p. 3-2, “Narrow band detection”; pp. 3-11–3-12, time constants and filter roll-off
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 polynomialWith 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 asFine 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]
https://fab.cba.mit.edu/classes/S62.12/docs/Shannon_noise.pdf. Shannon 1949, Section III, p. 13: filtering in frequency coordinates
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]
https://fr.wikisource.org/wiki/Th%C3%A9orie_analytique_de_la_chaleur/Chapitre_3. Fourier 1822, Chapter III: trigonometric representations of heat profiles
[ref]https://fr.wikisource.org/wiki/Th%C3%A9orie_analytique_de_la_chaleur/Chapitre_9. Fourier 1822, Chapter IX, articles 355–359: from series to integrals
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.
Half-wave rectifier 2026-10-18
For an original ideal example, let an ideal voltage source supply the sinusoid , with and angular frequency . Connect its positive reference terminal to the diode anode, the diode cathode to the upper terminal of a load resistor with electrical resistance , and the lower terminal to the source return. Let be the upper-minus-lower load electric potential difference, and the downward load electric current. Assume the ideal diode model, zero source electrical resistance, and no filter capacitor, inductor or switching delay.
An ideal half-wave rectifier selects the positive half-cycle
. Original schematic and calculated load electric potential difference for and . The diode cathode is the bar at ; positive load electric current flows downward through the resistor. Dashed orange: source sinusoid. Blue: load output, zero during the negative half-cycle. Green: its cycle-average electric potential difference . No smoothing capacitor is present; these are ideal model predictions. Details.The Kirchhoff cycle law gives , and Ohm's law gives . If , the blocking assumption would give , contradicting the ideal diode model, so the diode conducts with . If , conduction would give , also forbidden, so the diode blocks. At the crossings both values vanish. ThusThe peak load electric current is . The output is unidirectional but still varies in time, reaching zero throughout every negative half-cycle. Over a period of a function , write the wave phase as . Its average value of a function and root mean square follow from two integrals:Consequently the average load power is , not . The ideal diode has zero loss; the resistor converts supplied energy into Joule heating. The same switching argument predicts when the diode is reversed. Directional selection changes the waveform and its average value of a function; it does not by itself produce a constant output.
Lock-in quadratures Created 2026-10-18 Updated 2026-10-20
Let the input electric potential difference be , with peak amplitude , angular frequency , and phase difference relative to . For an observation interval containing an integer number of cycles, each lasting one period of a function, , define the lock-in quadratures in a peak convention:These integrals average the products with dimensionless references and ; and have the input's units. The minus sign makes positive give positive . The trigonometric functions giveThe oscillating terms have zero integral over the stated interval, proving and . Their orthogonality turns an oscillating signal into two constant coordinates.
Represent those coordinates as a vector, or as the complex number . Its modulus and complex argument recover the peak amplitude and phase difference:Here selects the angle with the correct signs of both coordinates, rather than applying the arctangent to and losing the quadrant. When , the amplitude is zero and the phase difference is undefined. When , despite a nonzero signal; measuring prevents this blind spot. Rotating both references by a fixed angle rotates the coordinate vector but preserves .
The factors of two above deliberately recover peak amplitude. The SR830 instead reports the selected sinusoidal component in root mean square units: in a calibrated, zero-offset display, . For this is , while the peak-to-peak span of that component is . Display normalization, reference sign, gain and angle units must be checked for the particular instrument.[ref]
Model SR830 DSP Lock-In Amplifier manual by Stanford Research Systems. Model SR830 DSP Lock-In Amplifier manual, printed p. 3-3, “RMS or Peak?” and “Degrees or Radians?”; pp. 3-13–3-14, output scaling and display offsets
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 324 1 a Solution Created 2026-10-03 Updated 2026-10-06
Use the positive-exponent quantum Fourier transform convention . The period of a function here is the least positive translation leaving the function unchanged on the cyclic group . The injective promise means exactly when . In particular : the subgroup of period translations is generated by , and wrapping the argument by preserves its value. This is exact quantum period finding on a finite cyclic group, rather than the truncated, nondividing-period version requiring continued fractions.
Prepare a uniform superposition state in the first quantum register using , and perform a reversible computation of the function into a second quantum register, cleaning its workspace by uncomputation:A quantum measurement in the computational basis of the second quantum register leaves a periodic coset state in the first:For the quantum Fourier transform of this periodic coset state, the finite geometric series vanishes unless the measured label is . On those labels its normalized amplitude is . Thus has the uniform distribution on a finite set on , irrespective of .
Compute the greatest common divisor by the Euclidean algorithm, and set , with . Since ,The exact period recovery from a Fourier sample is therefore certified by testing . Every candidate divides and lies between and , so the injective promise makes that equality equivalent to . This includes , where the test uses input , and , which always succeeds. The test does not assert that an arbitrary equality of function values certifies an arbitrary period; the Fourier-derived divisor restriction is essential.
The concise result isHere is the Euler totient function, with . The totient lower bound from the Mertens product gives for . Each trial uses polynomial time quantum Fourier transforms, function evaluations and Euclidean algorithm arithmetic in . Repeating independent trials gives constant success probability; the herald accepts only correct answers.
The printed asymptotic bound has the wrong direction for this argument. In Big O notation, the stated upper bound on the number of coprime integers supplies no success lower bound and is itself false uniformly: for prime , , not . Likewise the single-trial success need not be , since it tends to one for prime. The meaningful corrected guarantee is the lower bound above. If an upper-bounded success rate is literally required, one may deliberately retain an accepted result with an independent probability proportional to ; this discards useful successes and is unnecessary for efficient recovery.
Past exam of the mathematics course of the University of Cambridge 2023 ii Paper 2 13E c Solution Created 2026-09-24 Updated 2026-09-25
Part (b) gives paths with the same endpoint but integral valuesApplying the local inverse and then continuing it shows thatSince , the first period is real and the second is purely imaginary, so they are linearly independent over . Hence is an elliptic function with two periodsIndeed, it is the Jacobi elliptic sine, and these generators give its period lattice.
Period average Created 2026-10-06 Updated 2026-10-14
The period average extracts the reference level of an integrable function that repeats. For a real- or complex-valued periodic function with positive period of a function , assume is Lebesgue integrable on every bounded interval. Its average isThe answer is independent of the starting point . Splitting a shifted interval at the old endpoint and using moves its extra piece back into the missing piece. The interval length must be a period; an arbitrary window can give a different average.
For , every length-one window has average : both oscillating integrals vanish over that window. A half-unit window instead has average , which depends on its start. Thus a short sample of an oscillation can bias an estimate of its reference level even when the full-cycle average is known exactly.
In the complex Fourier series convention with basis , the zero-frequency Fourier coefficient is . This assertion defines the coefficient even when an additional convergence theorem is needed to reconstruct from its series. Strang's §4.1 explicitly identifies that constant coefficient with the average.[ref]
Fourier Series for Periodic Functions. §4.1; pp. 317
Averaging a square measures something different from averaging its original function. For the illustrated , orthogonality of the trigonometric terms gives , whereas . Its root mean square is therefore . Similarly, the period average of is . A zero mean need not imply a zero mean square.
Period group of a function 2026-10-14
Include zero when forming this set, even though a period of a function is normally required to be nonzero. For , is a subgroup of the additive group of the real numbers: composing two preserving shifts adds them, and reversing a preserving shift negates it. A constant function has period group . A nonconstant continuous real-valued function that is periodic has period group , where is its fundamental period.
Periodic function Created 2026-09-24 Updated 2026-10-14
A periodic function repeats exactly after a nonzero shift of its input. For , a positive period of a function satisfiesOne interval of length therefore determines the whole function. For another domain of a function , a period must also preserve the domain, ; equality only where two domains happen to overlap is weaker. Periodicity is an exact translation of a function symmetry, rather than merely two similar-looking pieces of its graph.
The sine has fundamental period one. The function repeats after half a unit: the sine changes sign under that shift, but squaring removes the sign. The mixed function again has fundamental period one. All positive integer multiples of a period are periods, so specifying one period need not identify the shortest repetition.
If the input is time and is the fundamental period, the frequency is and the angular frequency is . Repetition lets a Fourier series describe a cycle using sines and cosines; the period average separates the reference level from the oscillating terms. Strang develops this representation and its Fourier coefficients in §4.1 of Computational Science and Engineering by Gilbert Strang.[ref]
Fourier Series for Periodic Functions. §4.1; pp. 317
This connection grew out of a physical problem. In his 1822 book Théorie analytique de la chaleur by Joseph Fourier, Joseph Fourier used periodic functions to extend profiles beyond their initial interval while treating heat conduction. Chapter III, §§233–234 combines even functions and odd functions into sine–cosine expansions and rescales their period.[ref] A modern Fourier series interpretation still requires the appropriate convergence conditions.
A constant function has every real shift as a period and no fundamental period. Without continuity, even a nonconstant periodic function can lack a smallest positive period; periodic function without a least positive period gives a concrete example. The period group of a function organizes all these possibilities.
Define the indicator function of the rational numbers on the real line by for rational and otherwise. Every rational shift preserves rationality and irrationality, so every nonzero rational number is a period of a function. Conversely, an irrational shift sends from value one to value zero, so it is not a period. The period group of a function is exactly , and the positive periods approach zero without a smallest one. The function is nonconstant and discontinuous everywhere; this is why continuity matters in continuous periodic functions have a least positive period.
Periodization of a Schwartz function Created 2026-10-05 Updated 2026-10-14
For a Schwartz function on the real numbers, its periodization is a smooth periodic function of period of a function one. Rapid decay gives uniform convergence on of the defining series and each differentiated series. Its th Fourier coefficient isThe change of variable uses . Rapidly decreasing Fourier coefficients give the absolutely and uniformly convergent Fourier series . Evaluation at proves the Poisson summation formula.[ref]
Lecture 17: The functional equation. Lecture 17, §17.1, Theorem 17.8 and proof, printed p. 3: periodization and Fourier coefficients
The same identity explains aliasing in the Nyquist–Shannon sampling theorem: applying the Poisson summation formula to the Schwartz function givesThe sampled spectrum is periodic in frequency, and shifted copies of the continuous Fourier transform add together. When those copies overlap, the samples cannot separate their contributions. The Nyquist–Shannon sampling theorem adds a bandlimited function hypothesis to make reconstruction possible.




