For integers , adding to a frequency index changes the complex exponential by . Thus different continuous Fourier modes become identical discrete Fourier modes on the sampling grid. This is aliasing, caused by sampling before any discrete Fourier transform is computed.
For , compare the continuous functions and with and , sampled at , . With , both cosines give exactly the first row and both sines give exactly the second:
The nine-cycle sine agrees in sign as well as magnitude with the one-cycle sine: the frequency indices differ by , rather than by a sign reversal. Consequently, either cosine produces the same discrete Fourier transform, with all other coefficients zero; either sine produces , , with all other coefficients zero.
Figure 1.
One-cycle and nine-cycle cosine and sine waves have exactly the same eight samples
. Details.
An observed low frequency therefore does not establish that physical high frequencies are absent. To exclude such alternatives, the Nyquist–Shannon sampling theorem requires a specified class of bandlimited functions. For arbitrary pure sinusoids with frequencies at most , choose sampling rate ; equality needs care because vanishes at every . The finite-energy L2 space version of the Nyquist–Shannon sampling theorem permits equality under its own hypotheses. In either case, exact continuous reconstruction generally requires the entire infinite sample sequence; eight observed samples alone do not supply it. Demanet derives the grid aliasing condition as a difference by an integer multiple of the sampling angular frequency.[ref]
Consider an original stipulated model, not measured material data: thermal diffusivity , period , driven temperature amplitude , and thermometers at and . Without side losses, and thermal penetration depth . Thus
The two no-loss estimates and the combined estimate all return .
Now retain the same thermal diffusivity and drive but introduce . The exact complex wavenumber gives and , hence
Using attenuation alone with the no-loss formula would give ; using lag alone would give . Their disagreement is informative. If an independent volumetric heat capacity measurement gives , the combined estimate implies thermal conductivity and .
Figure 1.
Solved Ångström method example: spatial amplitude, wave phase lag, time traces and finite-end bias
. Original analytical predictions using the stipulated parameters above. Dots in the upper panels independently solve the spatial heat equation with finite differences. The lower-left traces show the linear-loss case at the two sensor positions. The lower-right curve applies the semi-infinite inference to an exact finite rod with an insulated far end: the resulting apparent thermal diffusivity can lie above or below the true value. None of these curves are experimental data. Details.
The exact complex amplitudes can be checked independently by discretizing and solving the resulting linear system with a tridiagonal matrix. Halving the spatial step quarters the discrepancy, as expected for centered finite differences. Separately fitting the real time traces to a constant plus sine and cosine terms recovers both amplitudes and their lag; this also checks the sign convention used in the combined estimate.
Apparent depth 2026-10-14
A submerged object looks shallower because its emerging light rays bend away from the surface normal vector. Their backward extensions give an approximate virtual image nearer the surface. For an object at perpendicular depth in a medium of refractive index , viewed through a flat boundary from a medium of refractive index , the near-normal paraxial approximation gives . Thus the model water depth appears approximately from air. This is a bundle-of-light rays statement, not a deflection of the axial light ray.[ref]
For general transmitted light rays, specify what “depth” means. Put the object at below a horizontal boundary . A light ray reaches the boundary at , with object-side angle and observer-side angle , both measured from the upward normal vector. For , its backward extension meets the object's normal line at , where
This axis-intercept depth is exact for that one transmitted light ray in the stated model. It tends to as the angles tend to zero; at exactly zero the quotient is interpreted as a limit. These elementary tangent, sine and cosine relations show precisely where the small-angle approximation enters.
The original calculations below use , and :
Outgoing air angle Water angle Boundary position in cmAxis-intercept depth in cm
Figure 1.
Exact light ray extensions and the near-normal apparent-depth approximation
. Original model of an object below a planar water–air boundary, with refractive indices and . The left panel has equal coordinate scales; solid lines are forward light rays and dashed lines are backward extensions to the object's normal line. The two outgoing light rays are different viewing directions, not a bundle entering one eye. The right panel compares their exact axis-intercept depths with the near-normal value . Marked points are calculated predictions, not observations. Details.
At appreciable obliquity these depths differ, so the full outgoing bundle has no single exact virtual image on the object's normal line. An oblique eye samples a narrow bundle; its local apparent position also depends on that bundle and cannot be inferred by declaring to be a universal image depth. A plane refracting boundary gives approximate image formation near normal incidence, with departures at larger angles. The construction assumes a flat surface, uniform transparent media with isotropy, and a propagating transmitted light ray; it does not extend to total internal reflection.
Choose with uniform distribution on and set . Since the sine is increasing on this interval,
Differentiation gives , and , prove normalization. This also evaluates the density's improper integral without treating its divergent endpoint values as infinite probability.
For the circle construction, instead choose with uniform distribution on and put . Each has two preimages in one revolution. The change of variables formula adds both contributions:
The affine change of variables gives the standard arcsine distribution. A single monotone-branch calculation without the second preimage would give only half the total probability.
The same geometry explains the ideal harmonic oscillator , with amplitude and angular frequency . Choose uniformly in any complete period of duration . Its oscillation phase modulo is uniform, and has density
Near a turning point, is small, so a fixed position interval takes more time to cross. For the chosen amplitude , exactly one third of the period is spent in , and two thirds outside that central interval. These are calculations for an ideal sinusoid, rather than measured oscillator data.
The sampling assumption matters. Taking one observation every full period returns the same position each time. It does not produce this probability distribution. Uniformly random observation times and a fixed regularly spaced sampling scheme are different models; aliasing can conceal the motion altogether.
Paul Lévy used a related geometric construction in his work on stochastic processes: project a uniformly chosen point on a circle onto its diameter to divide a segment. The projection description appears explicitly in §5 of his paper, following its arcsine density calculation.[ref]
Area-angle tradeoff 2026-10-14
When both endpoint bundles have the filled circular-cone geometry of etendue of a circular aperture and cone, conservation of etendue gives
For the same refractive index, quadrupling the area halves the sine of the cone half-angle. In the , example, an ideal output of diameter must have , so . The exact result differs from simply halving . Conversely, reducing the diameter to requires a complete forward hemisphere, , as a limiting case.
Figure 1.
Equal etendue: four times the spatial area exchanges for one quarter of the directional area
. The circles are cross-sections of the four-dimensional phase space: spatial disks in and direction disks in . Scales agree within each row. The displayed transformation preserves their product volume; it is a schematic of endpoint bundles, not a claim that a particular optical lens exactly realizes the transformation at every angle. Details.
Equal bounding area and solid angle do not alone prove equal etendue: an actual output can have unoccupied directions or position-direction correlations. The filled-cone equation is an exact model of the specified bundles and a capacity constraint on an optical instrument, not a guarantee of an aberration-free implementation.
Bragg angle 2026-10-18
The Bragg angle is the glancing angle from the incident beam to the selected lattice planes, with . If is instead the angle from the beam to the plane normal, and Bragg's law becomes . Defining the angle explicitly prevents a sine-versus-cosine error as well as a factor-of-two error in the detector deflection.
Choose and as an illustrative model, not historical measurements. For the first diffraction order,
The second diffraction order has and ; the third would require and is impossible. These are different diffraction orders of the same interplanar spacing at the same wavelength.
Conversely, a first-order reflection at a measured deflection gives the interplanar spacing
Using recovers . This is the useful reversal: a known wavelength turns an angular measurement into an atomic length. An unassigned diffraction order or an unknown wavelength prevents that single measurement from determining uniquely.
William Lawrence Bragg introduced the plane interpretation; his father William Henry Bragg built the X-ray spectrometer. Their joint 1913 paper, The Reflection of X-rays by Crystals, reports the experiment. [ref] [ref]
An X-ray tube supplied radiation through lead slits to a crystal mounted with its cleavage face through the rotation axis. A rotating ionization chamber replaced a spectrometer telescope; electric current measured the scattered signal, and a circular scale supplied angular readings. They first scanned the chamber at fixed crystal orientation, then swept crystal and chamber together to follow the reflection. [ref]
Changing chamber gas checked detector dependence; readings on opposite sides checked face-setting errors. Repeated peaks with sines of half-deflections in integer ratios, together with matching absorption coefficients, distinguished repeated diffraction orders of the same wavelength from different radiation components. Comparing crystal faces constrained interplanar spacings. Their limits included slit broadening, face alignment and incomplete interception at glancing incidence; assigning absolute wavelengths still required a structural choice for . [ref]
Bragg's law Created 2026-10-14 Updated 2026-10-18
Bragg's law selects directions of constructive interference in coherent elastic scattering from equally spaced lattice planes:
Here is the perpendicular interplanar spacing, the incident wavelength, the positive integer diffraction order, and the Bragg angle, measured between the incoming beam and the lattice planes. The scattering deflection, between incoming and outgoing propagation directions, is . Thus a plotted detector angle must be halved before insertion into Bragg's law. The in the parent elastic Bragg scattering condition denotes the full deflection; the present denotes half of it. [ref]
The lattice planes organize wave interference throughout a crystal structure; they are not literal metal mirrors or separate reflecting surfaces. The picture assumes elastic scattering, hence an unchanged wavelength, and sufficiently stable relative wave phases across the contributing lattice planes. X-ray wavelengths comparable with atomic interplanar spacings make these directions experimentally accessible. The sine cannot exceed one: an order exists geometrically only if . For , even the first diffraction order is inaccessible. A geometrically possible direction need not have nonzero wave intensity; the crystal lattice structure factor and crystal basis structure factor also matter. [ref]
William Lawrence Bragg's 1913 structure paper connects a slit-selected beam, an oriented crystal and an ionization chamber to strength-versus-angle curves. Repeated sine ratios and matching absorption coefficients identify common radiation. Narrower slits resolve blended lines. Absolute wavelengths remain undetermined there; intercrystal comparisons first give relative scales. The Bragg crystal reflection experiment of 1913 covers the alignment controls.[ref]
William Henry Bragg's 1915 Bakerian lecture, X-rays and Crystal Structure, separates the geometric and intensity arguments. Its Figure 9 compares reflection positions and strengths from three sodium chloride orientations; odd and even diffraction orders differ in strength along one orientation. The interpretation uses alternating scattering layers. Later, the calcite example identifies an internal oxygen coordinate that symmetry alone cannot fix. Improved wave intensity measurements revise a previously rough estimate. Thus a lattice assignment can precede determination of positions inside the unit cell; intensity interpretation also has experimental and theoretical limits. This is the father's 1915 lecture, distinct from the joint 1913 reflection paper.[ref]
Cauchy principal value Created 2026-09-24 Updated 2026-10-14
The Cauchy principal value assigns an integral a value by a specified symmetric limit. Its simplest example is on : delete , integrate what remains, and obtain zero for every . The positive signed area under a graph cancels the negative one, although each grows without bound as the gap closes. This is a useful cancellation rule, but it does not make the ordinary improper integral exist.
Figure 1.
Equal local cutoffs cancel the signed areas of 1/x; unequal cutoffs leave a logarithmic remainder, even when both shrink to zero
. Details.
Precisely, let be finite and suppose that the two truncated integrals below exist for every sufficiently small . The local Cauchy principal value at is
provided the combined limit is finite. The same removes equal distances on the two sides of ; the outer endpoints need not be equally distant from . By contrast, the ordinary improper integral requires both one-sided limits to be finite separately before adding them. Whenever those separate limits exist, the Cauchy principal value agrees with their sum.[ref]
For , the natural logarithm gives
Their sum is zero at every positive cutoff, so . This calculation adds two finite truncated integrals and then takes a limit; it never assigns a meaning to . If the left and right deletion widths are instead and , then
Thus a ratio tending to produces : choosing gives , and choosing makes the sum tend to . Both widths can tend to zero without selecting a unique answer. The local Cauchy principal value selects the ratio .
Unequal outer endpoints leave a finite contribution even with symmetric local deletion. For ,
More generally, for a function with continuous derivative on , subtract its value at the possible simple pole:
The quotient in the last integral extends continuously to at . This formula explains both the cancellation and a practical way to compute it: integrate a continuous remainder instead of subtracting two large, nearly equal divergent contributions.
A finite Cauchy principal value is weaker than absolute convergence. Indeed,
Taking the absolute value destroys the cancellation. Even the Cauchy principal value need not exist: gives on the same truncated interval. Absolute integrability makes the cutoff prescription unnecessary; an ordinary improper integral can also converge without absolute convergence, as the Dirichlet integral illustrates. The three notions should therefore be checked separately.
There is an independent Cauchy principal value at infinity. For a function integrable on every finite interval, define
when the limit is finite. The ordinary improper integral instead requires convergence of the two tails separately.[ref] For example, the odd function has no finite singularity and its symmetric integral is always zero, whereas its two tails diverge. Unequal truncations give
Letting as yields . Symmetry at infinity is therefore a separate choice from symmetry near a finite pole. When both are needed, state both prescriptions, for example first take the local Cauchy principal value at fixed and then let ; coupling the two cutoffs requires its own justification.
The local cancellation also defines the principal-value reciprocal distribution. Since is not a locally integrable function across zero, its action on a test function is prescribed by
The test function is smooth with compact support, so the last numerator removes the singular constant contribution: its quotient tends to at zero and vanishes sufficiently far away. This defines a distribution, not a finite pointwise value of at zero. It extends to Schwartz functions as a tempered distribution, and is also the distributional derivative of the logarithmic modulus.[ref] Using an asymmetric local cutoff ratio would add to this action, equivalently adding times the Dirac delta function. Thus the cutoff choice matters even after passing to distributions.
Why keep this prescription? A Fourier transform naturally encounters such a kernel. With , pairing and gives, for and ,
The cosine contribution is an odd function and cancels locally; the sine contribution has a removable singularity and its tail converges by the Dirichlet integral. This is the Fourier transform of a principal-value reciprocal, with the sign function. The displayed computation is a prescribed limit for each nonzero ; the corresponding Fourier transform identity is understood as an identity of tempered distributions, rather than the transform of an absolutely integrable reciprocal function.
Figure 2.
Fourier cancellation for 1/x: the odd cosine contribution disappears, the sine contribution approaches minus i times pi, and the Hilbert transform turns a cosine into a sine
. Details.
The Hilbert transform uses exactly this principal-value reciprocal distribution as a convolution kernel. In the convention already used here,
for Schwartz functions , with the second identity interpreted through tempered distributions. Hence the singular integral has a simple description as a Fourier multiplier.[ref] For the bounded pure tone with , the same calculation with symmetric deletion about and symmetric truncation of at infinity gives and . These tones lie outside the Schwartz space; their prescribed Cauchy principal values explain the quarter-cycle shift in the figure. Both figures are calculated mathematical illustrations. Reversing the Hilbert denominator reverses these signs; NIST uses that opposite convention.[ref]
Chain rule Created 2026-09-24 Updated 2026-10-14
The chain rule calculates the derivative of a function composition by combining local rates. If the inner function is differentiable at and the outer function is differentiable at , then
The evaluation point matters: the outer derivative is evaluated at the inner output , not at . A small input change first scales by ; the resulting intermediate change then scales by . In terms of linear approximations, composing those two local descriptions multiplies their scale factors. [ref].
For example, applies a quadratic function and then the sine. With and , the chain rule gives
Here all angles are in radians. Near , increasing the input by changes by about , and the sine changes by about times that intermediate change. For , the linear approximation predicts an output increase of ; the exact increase is .
Figure 1.
The chain rule multiplies the local rates through two successive functions
. The inner quadratic function has derivative at , and the outer sine has derivative at its input . Their composite has derivative . Each panel shows the corresponding tangent line and the exact output of the input change from to . Tangents describe linear approximations, not exact finite changes. Details.
The same rule handles several nested stages. For , the derivative is under the corresponding differentiability assumptions. Writing each intermediate output prevents evaluating a derivative at the wrong stage. It also makes the chain rule useful for propagating sensitivities through a mathematical model, where one measured quantity influences another through several transformations.
For a quick proof idea, replace near by its linear approximation, then replace near by its linear approximation. The composite leading term is their product; differentiability ensures the remaining error is smaller than the original input change. This argument still applies when , so the informal cancellation should not be interpreted as division by a possibly zero finite change. The hypotheses are sufficient, but are not necessary for every composite to be differentiable, as the nondifferentiable inner function with a differentiable nondegenerate composite example shows.
Coarse-grid correction Created 2026-10-06 Updated 2026-10-14
A coarse-grid correction improves a fine-grid approximation by solving a smaller equation for the part of its approximation error representable on a coarse mesh. Use the signed convention and the linear-system residual . A prolongation linear map interpolates coarse corrections into fine-grid corrections, and a restriction linear map transfers the linear-system residual. Solve exactly or approximately and update . The plus sign follows from defining the approximation error as exact minus approximate. It is the correction equation's right-hand side , rather than merely restricted solution values, that determines the update.
For the multigrid method model , take , so and the coarse nodes coincide with every second fine node. Use linear interpolation with zero boundary corrections :
Use full-weighting restriction for the interior linear-system residual:
Here is the matrix transpose in ordinary unweighted coordinates. With these specific transfers, the Galerkin coarse-grid operator is
Thus it equals the rediscretized Poisson equation operator on this constant-coefficient one-dimensional mesh. The equality is special to the stated model and transfers. In particular, dropping from the fine matrix while using on the coarse mesh changes the correction unless the right-hand sides and transfers are rescaled consistently.
Take seven interior points, , three coarse unknowns, and the deliberately constructed approximation error
For example, choose , so and . Direct matrix multiplication gives
The exact coarse solve returns , so adding removes the entire chosen approximation error. A broad triangular error can have a sharply localized linear-system residual: the latter measures discrete curvature, not error height. This is why the two should not be confused. A smooth sine mode instead has linear-system residual , so interpreting its magnitude also requires the eigenvalue and the equation's scaling.
Figure 1.
Constructed seven-point Poisson example: residual restriction, coarse solve, interpolation, and the error remaining after exact or partial correction
. Details.
The algebra explains the exact cancellation beyond this example. Assume has linearly independent columns and choose an invertible Galerkin coarse-grid operator . With an exact coarse solve, the iteration matrix for the remaining approximation error is
The short proof is to substitute . Thus every vector in the column space of is eliminated, and the corrected linear-system residual restricts to zero. These are exact projection identities, not a statement that every visually smooth vector belongs to that column space. If is a symmetric matrix and a positive-definite matrix, and with , then is also a positive-definite matrix. Moreover : is an orthogonal projection onto the complement of the column space of in the energy norm . Equivalently, the added correction is the best approximation to from that column space in this energy norm. Without these symmetry and transfer assumptions, the projection need not be orthogonal.[ref]
For an approximate coarse solve represented by a fixed linear map , replace by . Then
There is no exact cancellation of coarse-representable approximation error unless on the relevant directions. For the triangular example, deliberately returning half the exact correction, , leaves , as the figure shows. This controlled mathematical comparison illustrates an incomplete coarse solve; it is not a measured performance result or a prescription for a geometric multigrid V-cycle. More generally, if , then an approximate leaves , separating the nonrepresentable remainder from the coarse-solve defect.
With pre- and post-relaxation iteration matrices and , a two-grid error step has iteration matrix . A geometric multigrid V-cycle supplies by one recursive coarse cycle from zero, with a direct solve only at the bottom. Effective smoothing, a coarse column space that approximates the surviving approximation error, and a sufficiently accurate coarse correction must work together. Coarsening alone supplies no convergence guarantee, and correcting an arbitrary fine-grid vector exactly would require a coarse column space large enough to contain it.
Complex sine 2026-10-25
The sine function extends to an entire function on the complex plane by the displayed exponential formula. Substituting and grouping the real and imaginary terms gives , for real . Thus its values grow exponentially in imaginary directions, even though the real sine is bounded.
The sine maps bijectively onto the upper half-plane: its imaginary part is , and the equality of two sine values forces either equal arguments modulo or arguments summing to an odd multiple of . Only equality is possible in this domain. For surjectivity, solve for . When , exactly one root has modulus below one and it has positive real part. The inverse therefore belongs to the half-strip. Composing with gives a conformal map onto the unit disc.
Cosecant Created 2026-10-05 Updated 2026-10-06
The cosecant is , wherever the sine denominator is nonzero. The square of the cosecant occurs in the derivative of the cotangent.
Factor the sine expansion as . To invert the bracket, put and equate coefficients after multiplication. The coefficient gives , while the coefficient gives . Dividing by proves the displayed Laurent series truncation for , . This reciprocal-series calculation is useful when a small sine argument is itself an inverse power of a large variable; multiply the remainder by any outside prefactor when assigning its final order.
Cosine Created 2026-09-24 Updated 2026-10-14
For a real angle , is the horizontal coordinate on the unit circle reached by a counterclockwise rotation through radians. For an acute angle in a right triangle, it is the adjacent side divided by the hypotenuse. Basic values include
At , the horizontal coordinate is even though the vertical sine coordinate remains positive. A positive angle need not produce a positive cosine.
Reflection across the horizontal axis leaves this coordinate unchanged, giving : cosine is an even function. A full turn gives . For real arguments, its range is and its zeros of a function occur at . A quarter-turn shifts between the two coordinate traces, with .
Cosine addition formula Created 2026-09-29 Updated 2026-10-14
The cosine addition formula gives the horizontal coordinate after two successive rotations:
The minus sign comes from the way a counterclockwise rotation mixes horizontal and vertical coordinates:
The two rows recover the cosine addition formula and sine addition formula together.
Figure 1.
Adding angles rotates a coordinate pair and mixes its sine and cosine components
. Details.
With and , the resulting angle is , and
Although the horizontal coordinate becomes small, the vertical one approaches one; their squared sum still obeys the Pythagorean trigonometric identity. Taking in the cosine addition formula, together with the even function property of cosine and odd function property of sine, also recovers that identity.
Cotangent 2026-10-05
The cotangent is the quotient , wherever the sine denominator is nonzero. Its meromorphic continuation has simple poles at integer multiples of .
Diffraction order Created 2026-10-05 Updated 2026-10-18
A diffraction order is the integer labeling a principal constructive interference direction of a diffraction grating: adjacent elements differ in path length by wavelengths. In the normal-incidence transmission geometry described above,
Positive and negative diffraction orders lie on opposite sides of the forward normal. The condition expresses the range of the sine of a real angle, so it also limits the propagating diffraction orders.
For and , . Taking the inverse sine gives
These are seven allowed propagating diffraction orders. Order would require , and would require , so neither has a propagating far-field direction. The allowed diffraction orders are equally spaced in , while their actual angles become farther apart toward grazing propagation.
Each principal peak has finite width. For the ideal uniform coherent array, the nearest zeros around order obey
Thus the one-sided distance from the order direction to the first zero is . Near the first diffraction order in our example, puts the zeros at and , while puts them at and . The respective one-sided widths are and ; the full zero-to-zero widths are and . These are calculated coherent peak widths, with the slit envelope omitted, and do not describe a measured instrument response. [ref].
Figure 1.
Single-slit diffraction envelope and calculated first-order peak widths for and
. Details.
Four times as many illuminated slits therefore give a fourfold narrowing in this coordinate without moving the diffraction order. That sharper directional selection helps distinguish nearby wavelengths in a spectrograph. Actual performance also depends on illumination, optical coherence, and source width; the separate slit-limited resolving power of a grating describes the contribution of the entrance slit.