Active power 2026-11-05
Active power, also called real power, is the time average of instantaneous power transferred through a terminal pair. For periodic electric potential difference and electric current of common period , the passive sign convention gives
The net energy entering during each period is . Positive active power denotes net absorption under this convention; it can represent useful conversion to other forms of energy as well as heating.
For sinusoids of RMS magnitudes and with relative phase , . For a pure resistor with constant resistance , the stronger waveform-independent statement follows from :
This is why the root mean square current is the constant-current value giving the same heating in that resistor.[ref]
An original harmonic example shows why RMS values alone do not determine active power. Let
in volts and amperes. Orthogonality over a period gives , but the third harmonic averages to zero when multiplied by the fundamental potential difference. Consequently , whereas apparent power is . The power factor is0.6 even though the fundamental current is exactly in phase with the fundamental potential difference.
More generally, Fourier analysis of real periodic waveforms with RMS harmonic magnitudes gives
when the expansion and average are justified. Cross terms of different harmonic orders vanish. A single fundamental-frequency complex electrical power therefore need not capture every harmonic contribution to the total average.
For an ideal inductor or capacitor in periodic steady operation, the stored energy returns to its starting value each cycle, so its net active power is zero despite nonzero exchange during the cycle. Real components can also have losses. The primary MIT treatment explicitly separates resistor dissipation from periodic inductive and capacitive energy exchange.[ref]
Arithmetic combinatorics 2026-11-05
Arithmetic combinatorics studies finite sets and configurations with additive or multiplicative structure. For finite subsets of an additive group, the sumset is . Its size records how often different pairs give the same sum, so counting is tied to algebraic structure.
For , the sumset is , giving rather than the possible ordered pairs. Many pairs collide because is an arithmetic progression. This small growth motivates inverse questions: what structure is forced when a sumset is small?
The subject also asks whether dense sets contain arithmetic progressions, and how additive and multiplicative structures compete. Fourier analysis, additive energy, and Gowers uniformity norms translate such configuration counts into quantities that can be bounded. Additive combinatorics is the closely related part emphasizing additive operations.
BCS coherence length 2026-10-18
The clean isotropic weak-coupling BCS coherence length is conventionally , with Fermi velocity . It characterizes the spatial extent of pairing correlations.[ref]
The scale follows from the same spectral calculation. Linearizing the normal energy near the Fermi surface gives . The region therefore has radial width . Fourier analysis associates this width with a distance . This argument establishes the scale, not the conventional factor . A small superconducting energy gap consequently permits pairing correlations over many interparticle spacings.
Bilinear sum Created 2026-09-28 Updated 2026-11-05
A bilinear sum has the form
where are finite index sets and the coefficient sequences can be controlled separately. It is a bilinear form in these two coefficient lists. In analytic number theory, the function often oscillates with the product , as in a Type II sum.
The Cauchy-Schwarz inequality eliminates one coefficient list and exposes correlations:
Useful cancellation comes from small off-diagonal correlations, not from the bilinear notation alone. For example, take and . Orthogonality of roots of unity makes the inner correlation for and zero otherwise, giving . The termwise triangle inequality only gives . This explains why Fourier analysis and large sieve estimates are effective tools for bilinear sums.
Cooley-Tukey FFT algorithm Created 2026-10-14 Updated 2026-10-20
The radix-two Cooley--Tukey algorithm recursively splits a discrete Fourier transform into transforms of the even-indexed and odd-indexed samples. For a power-of-two length this evaluates the transform in arithmetic operations.
The saving comes from reusing the two shorter discrete Fourier transforms for both halves of the output, through an FFT butterfly. For , each level of the even--odd fast Fourier transform recursion needs work proportional to , and there are levels. This gives the time complexity without changing the discrete Fourier transform being computed.
James W. Cooley and John W. Tukey published An Algorithm for the Machine Calculation of Complex Fourier Series in Mathematics of Computation 19 (1965), pp. 297–301. Their original paper factors a composite length as , derives an operation count , and discusses powers of two and in-place storage. Its opening explicitly builds on earlier algorithms by I. J. Good; the 1965 paper is a landmark computational formulation, rather than the invention of the underlying Fourier analysis. Its positive-exponent convention also illustrates why a Fast Fourier transform's exponent sign must be specified.[ref]
Digital signal processing 2026-11-05
Digital signal processing transforms or analyzes signals represented by numerical sequences. A physical input commonly passes through signal sampling and quantization before an algorithm filters or transforms it. Sampling chooses times; quantization chooses a finite set of representable values. A discrete-time signal is a sequence indexed by integers, whereas a digital implementation also has finite precision.[ref]
An elementary digital filter averages adjacent samples:
For a constant sequence it preserves the value. For an alternating sequence it gives zero. If the input noise samples are independent with variance , the output noise variance is , but neighboring output samples are now correlated because they share an input sample. Smoothing changes both the signal and its noise statistics.
Sampling can also erase distinctions before any algorithm runs. At sampling frequency ,
These distinct analog frequencies produce the same samples. An anti-aliasing filter limits unwanted input frequencies before conversion; later computation cannot uniquely recover which of these unrestricted inputs produced the sequence.[ref]
Fourier analysis and the discrete Fourier transform help reveal frequency content, while finite-word arithmetic introduces an additional error budget. The sampling rate, numerical representation and intended physical bandwidth are therefore part of the processing design.
Euler's formula Created 2026-09-24 Updated 2026-10-14
For a real angle in radians, Euler's formula states
where is the imaginary unit. It connects the complex exponential to the sine and cosine coordinates of the unit circle. In particular, , and multiplying by rotates a complex number through angle without changing its modulus. At it gives ; at , it gives .
The identity makes angle addition algebraic: . Expanding the product and comparing real parts and imaginary parts recovers the sine addition formula and cosine addition formula. Differentiating gives , and differentiating again gives . Its real and imaginary coordinates therefore solve the harmonic oscillator equation. This is why complex exponentials are useful building blocks in Fourier analysis: differentiation acts on each frequency by simple multiplication.
A short justification separates the even and odd powers in the absolutely convergent power series for . The even powers give , and the odd powers give . The absolute convergence permits this regrouping. The formula thus links an analytic definition of the complex exponential to a geometric motion rather than merely introducing a convenient notation.
Leonhard Euler presents the relation between imaginary exponentials and sines and cosines in his 1748 Introductio in analysin infinitorum, volume 1, chapter VIII, section 138. His derivation uses limiting powers after connecting trigonometric addition to algebra. The original Latin and Ian Bruce's English translation can be read together in Euler, Introductio, chapter VIII, section 138.
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]
Group velocity Created 2026-09-24 Updated 2026-10-14
The group velocity of a differentiable, real dispersion relation branch is
It describes the leading translation of a narrow-band wave packet centred on wavevector , assuming a linear model, a locally uniform medium and negligible loss. Narrow-band means that the appreciably excited wavevectors occupy a small neighbourhood on which one smooth branch can be linearized. Write its complex wavefield as
The Taylor expansion gives
Thus the rapid wave phase follows the phase velocity, while the slowly varying wave envelope follows the group velocity. This Fourier analysis argument is an outline of the approximation, rather than a statement that every wave packet translates rigidly forever. In one dimension a useful short-time condition is , where is the characteristic spectral width; neglected higher derivatives must also remain small. Curvature of the dispersion relation eventually changes the wave envelope.[ref]
Two nearby plane waves make the derivative visible without an integral. For equal wave amplitudes , define , , and . The superposition principle gives the exact identity
The periodic wave envelope has speed , approaching group velocity as the two wavenumbers coalesce, while the carrier wave phase has speed . Two tones alone form an infinite beat train, not a localized wave packet. The figure shows an exact two-tone surface gravity wave model with dimensionless : , . Its carrier phase velocity is approximately , its finite-difference envelope velocity approximately , and is the limiting group velocity. The marked carrier phase line need not coincide exactly with a maximum of the full modulated wave.
Figure 1.
Exact analytical two-tone gravity-wave model: carrier phase advances through a slower periodic envelope
. Details.
The deep-water surface gravity wave therefore has , whereas the deep-water capillary wave limit has : crests can drift either forward or backward relative to a wave envelope. For finite-depth surface gravity waves, differentiating the dispersion relation gives
Here is the hyperbolic sine. The shallow-water limit has ; the deep-water limit has .[ref]
In the wave tank, produce a finite train with a smooth turn-on and turn-off and time the same wave envelope feature at two probes separated by distance ; its transit estimate is . Independently follow wave crests through that train. Techet's 2003 lab asks students to observe a deep-water train's foremost crest disappearing as the group moves forward, and to compare deep- and shallow-water cases. The interpretation is that a wave crest overtakes the slower wave envelope, dwindling at its front while other crests become visible at its rear. This is a qualitative expected observation in the teaching protocol, not a published set of measured curves.[ref]
A useful controlled version keeps the paddle wave amplitude small, records and , and checks both and . Compare runs with and , rather than assuming every ripple tank is shallow relative to every wavelength. Increase train duration at fixed central frequency to narrow its spectrum, and check that the envelope transit estimate stabilizes. Calibrate both probes, sample fast enough to resolve the carrier, and compare records before reflected waves return; an absorbing beach reduces this contamination. A current changes laboratory velocities, large wave amplitudes introduce nonlinear effects, and very short wavelengths require surface tension. Strong damping or noticeable reshaping makes the chosen threshold or peak an unreliable marker of simple group velocity. These are proposed controls and model limits, not claims that the cited lab measured every correction.
Three velocities should consequently be kept separate. The group velocity predicts narrow-band wave envelope motion. An energy-transport velocity is energy flux divided by energy density, using the appropriate time average; it agrees with group velocity in standard lossless linear wave models when all stored energy is included.[ref] A signal-front velocity concerns the earliest response to a new disturbance and requires a causal model over its full spectrum. A strictly band-limited wave packet has no sharply bounded onset, and a mathematical two-tone envelope cannot test front arrival. In strongly absorbing or broadband propagation, a single group velocity need not describe the observed peak, energy transport, or first detectable response. A complex or also prevents interpreting its derivative as an ordinary real transport velocity without further analysis.
In particular, an unusually large or negative group velocity from pulse reshaping does not establish superluminal information transmission. For the causal dielectric model analysed by Fitzpatrick, the field ahead of the front vanishes for , even when its phase velocity exceeds the vacuum speed of light . That result concerns the electromagnetic model's causality; the ideal water-wave diagrams above contain no relativistic signal-front claim.[ref]
Finally, zero wavenumber requires care: the positive-frequency wave equation branch is not differentiable at , so it has no unique group velocity there, although its one-sided values are . A smooth gapped branch such as the Klein-Gordon equation instead has despite undefined phase velocity at . The same signed branch must be used in both derivatives and ratios; a negative group velocity means an envelope moving in the negative coordinate direction, not a negative elapsed time. The practical value of group velocity is precisely this translation between a local slope on a dispersion diagram and a measurable packet transit, with its assumptions made explicit.
The Gaussian envelope in a Klein-Gordon medium supplies a quantitative next step: the first derivative translates the wave envelope, the second derivative spreads it, and higher derivatives limit that approximation. At finite spectral width, a peak's measured speed need not equal the group velocity at the central wavenumber. Neither a peak nor a fixed fraction of its height generally identifies front velocity.
Higher-order Fourier analysis studies functions using nonlinear phase patterns and Gowers uniformity norms, extending the linear characters used in ordinary Fourier analysis. Its motivation includes counting long arithmetic progressions: controlling ordinary Fourier coefficients does not control every higher-order additive pattern.[ref]
For example, let be an odd prime number and put on the finite field . Its multiplicative difference has a linear phase; three successive multiplicative differences are identically one. Consequently its norm is one, although each normalized ordinary Fourier coefficient has magnitude . The quadratic phase is highly structured even when the linear probes are small. Higher-order inverse theorems describe the structured objects detected by large Gowers uniformity norms.
Image mask 2026-11-05
An image mask is a function on image coordinates specifying which pixels or regions are retained or weighted. A binary mask selects a region, while a soft mask takes intermediate weights. Applying the mask pointwise gives for image intensity .
For example, a mask equal to one inside a disk and zero outside retains only that disk of an image. An edge with fractional weights can smooth the transition. The mask describes location or weighting, rather than assigning a new color to every retained pixel.
In Fourier analysis, multiplication by a window function in the image plane corresponds to convolution in frequency, with the constant depending on the Fourier convention. A sharp binary boundary can therefore introduce broad high-frequency contributions. This explains why cropping and spectral filtering have different mathematical effects.
John Cowdery Kendrew 2026-11-05
John Cowdery Kendrew helped establish how X-ray crystallography can reveal the three-dimensional arrangement of a protein. Nobel's primary nomination archive names John Cowdery Kendrew, also identifying J. C. Kendrew in its award-sharing comment.[ref]
His team's1960 myoglobin paper presented a Fourier analysis at2-angstrom resolution. Its opening recalls how earlier phase determination compared native crystals with heavy-atom derivatives containing localized mercury or gold sites. Such comparisons supply information missing from a simple measurement of diffraction intensity.[ref]
An original one-dimensional example explains that phase problem. Write a periodic electron density using Fourier series coefficients . The two positive densities
have , and , with the final sign distinguishing them. Their squared coefficient magnitudes are identical:9 for mode zero,1/4 for modes and1/16 for modes . The relative phase of the second harmonic has changed while the first harmonic is fixed. Thus equal intensities need not identify one density.
Figure 1.
Different positive model densities can have the same squared Fourier coefficient magnitudes
. Original one-dimensional mathematical example, not a measured protein diffraction pattern. The sign of the second harmonic differs while the first harmonic is unchanged, so the density shapes differ despite equal mode intensities. Details.
The myoglobin experiment was more demanding than this toy calculation, but the distinction motivates its chemical strategy: modifying crystals at known heavy-atom sites changes their scattering in a way that constrains phase information. Reconstructing an electron density map therefore requires both measured diffraction and a justified phase-determination method, rather than treating the recorded spots as a direct photograph of the molecule.
Off-axis holography 2026-10-18
Off-axis holography tilts the holographic reference wave relative to the holographic object wave. Its interference fringes acquire a carrier spatial frequency; the two cross terms occupy different spatial frequency regions when the carrier is sufficiently large compared with the object's signal bandwidth. This permits filtering a single image term.
Gabor's lecture credits Emmett Leith and Juris Upatnieks with the later skew-reference method using helium–neon laser illumination, separating reconstructed images angularly.[ref]
For an original periodic calculation, let run over a unit-length interval and choose
All spatial frequencies here are cycles per unit length; the data are a chosen field at the recording plane, not measurements or a physical object profile. Direct expansion gives
Consequently its Fourier series coefficients are at zero, at , at and at . The component lies at ; the component lies at ; the background lies at . Filtering the negative-frequency cross term and multiplying by recovers , including its relative wave phase.
Figure 1.
Original periodic off-axis holography calculation: separated cross terms and recovered complex amplitude
. Details.
The figure samples equally spaced positions with the endpoint excluded, computes a normalized discrete Fourier transform using a Fast Fourier transform, retains bins , then applies the inverse discrete Fourier transform and multiplies by . The recovered real and imaginary parts coincide with the chosen to numerical precision. This exact periodic example avoids leakage by placing every frequency on an integer bin; finite nonperiodic records need allowance for broadening and an aperture.
For a continuous object field with Fourier transform confined to , the background occupies . A carrier is a sufficient separation condition for the sideband centred at , and must remain below the Nyquist spatial frequency. Here , and the Nyquist spatial frequency is . This sufficient bound describes a whole bandwidth, rather than exploiting the gaps in this particular two-component field.
The same example also makes optical playback explicit. Choose and . Since , the bounds imply , and . The affine response is stipulated; its weak-modulation interpretation is approximate. In , the desired field has frequencies ; the conjugate term has frequencies ; the background has frequencies . Thus the same carrier that separates the recorded cross terms separates the playback components. Reillumination restores a field through diffraction; computational filtering extracts the corresponding encoded field through Fourier analysis.
The Engquist-Osher method is a conservative finite volume method built by separating positive and negative characteristic speeds. Take , a uniform cell width , a time step , and cell averages . Write and define the numerical flux
The Engquist-Osher flux uses the left state for right-going transport and the right state for left-going transport. Its conservative update is
It is consistent because . The integrals have their ordinary oriented meaning even for negative states. For the Inviscid Burgers equation, gives the useful example
In a region where all characteristic speeds have one sign, the flux reduces to the corresponding upwind flux. In smooth regions, this basic piecewise-constant, forward-time version is first order in space and time; its main virtue is robust nonlinear stability across shocks.
Here is a precise stability proof. Assume the data lie in a bounded interval and choose
Work on a periodic grid, or on the infinite grid with summable differences; on a finite interval the inflow boundary data and boundary fluxes must be treated monotonically as well. Define the three-point update map
Writing and , its three partial derivatives are
Thus it is a monotone conservative scheme. Since , comparison with the constant states proves
The interval is invariant, so the same Courant–Friedrichs–Lewy condition remains valid at every step. This is an bound relative to constant states, not a claim that arbitrary pairs of solutions are contractive in .
For a stronger perturbation estimate, let denote the global update and use componentwise maxima. Monotonicity gives . Therefore
Sum over the grid. The shared interface flux cancels telescopically, so conservation gives
Interchanging and adding yields the L1 contraction of a monotone conservative scheme:
This is a mesh-independent nonlinear stability estimate. On an infinite grid the telescoping argument is justified by summability of the differences and the bounded characteristic-speed range, or by truncation followed by a limit. For unequal prescribed boundary data, additional boundary flux terms enter the estimate.
The method is also a total variation diminishing scheme. Let shift a grid sequence by one cell. Translation invariance gives . Applying the preceding contraction to and shows
Hence initially finite discrete total variation cannot grow.
Finally, monotonicity supplies a discrete entropy inequality, explaining why the stability is compatible with the physically admissible entropy solution. For a constant , define
Comparison of with the clipped triples above and below gives
Indeed and , and subtracting these two update formulas yields exactly the right side. Also , the Kruzhkov entropy flux. Under the displayed CFL condition the method therefore has an invariant state range, contraction, decreasing discrete total variation and entropy dissipation. These estimates remain meaningful at discontinuities, where linearized Fourier analysis alone cannot establish the corresponding nonlinear stability.
For this non-Archimedean local field, the Schwartz-Bruhat space consists of locally constant, compactly supported complex-valued functions. Choose a nontrivial continuous additive character of modulus one and an additive Haar measure . We use the plus-sign convention for the Fourier transform over a local field:
Compact support makes the integral absolutely convergent. The additive character and the scale of the Haar measure are part of the definition; without them there is no canonical numerical transform.
Let , and write . Define the integer by the annihilator of the valuation ring . Equivalently, is trivial on and not on . Such a conductor exists: continuity puts the image of some additive ball inside an arc containing no nontrivial circle subgroup, so the character is trivial on that ball; nontriviality bounds the possible ball exponents below. Then has volume and character annihilator .
Translation gives
The integral is the volume if . Otherwise translate it by with ; Haar measure invariance multiplies the same integral by a nonidentity scalar, so it must vanish. Thus
Every Schwartz-Bruhat function is a finite linear combination of such coset indicators: compactness of its support supplies a common sufficiently small translation subgroup on which it is constant, and finitely many of its cosets cover the support. The transform of each indicator has compact support and is locally constant, since has open kernel. Consequently for every .
Apply the transform again to an indicator. The same character-orthogonality calculation, together with , gives
Choose the self-dual Haar measure, characterized here by . By linearity the desired Fourier inversion is
In particular, one may rescale any nontrivial additive character to make , and then take . For a concrete construction, start with , where the standard rational additive character has kernel . Its annihilator is the inverse different . If that ideal is , the rescaled character has . This supplies the stated normalization and also explains how the different ideal enters local Fourier analysis.
Poisson summation formula Created 2026-09-24 Updated 2026-10-14
The Poisson summation formula equates sample sums of a function and its Fourier transform. Exchanging broad and narrow sums can save work. Use the convention
For every Schwartz function ,
Both series have absolute convergence. A sufficient hypothesis is that is smooth and for all nonnegative integers ; its Fourier transform is then also a Schwartz function.[ref] This assumption controls both decay and regularity; mere membership of an L1 space does not control values at individual sampling points, as periodization of an integrable function illustrates.
Here counts cycles per unit length. In the angular convention used elsewhere in Fourier analysis, , so and the right-hand side becomes . Keeping the Fourier transform convention explicit prevents stray factors. Changing the sample spacing leads to the Poisson summation formula for a Euclidean lattice.
Signal processing Created 2026-10-13 Updated 2026-10-14
Signal processing transforms or analyzes signals to extract information, change a representation, or improve a measurement. Examples include smoothing a sensor record, selecting a band of frequencies, and decomposing a recording through Fourier analysis. A signal is a mathematical representation of a physical record; deciding which variation is meaningful and which is noise is part of the problem.
A linear filter offers a simple entry point. Its output is assembled from weighted copies of its input. A moving average can reduce rapid variation, but it also changes timing and can erase useful detail. The worked example below makes that tradeoff explicit rather than treating a smoother plot as automatic improvement.
Two complementary views make the subject appealing. An impulse response describes the effect of a localized input; a frequency response describes the effect of a sustained oscillation. For a linear time-invariant system, both describe the same operation, connected by convolution and Fourier analysis. [ref].
Switch on-resistance flatness describes how little an analog switch on-resistance changes across a stated analog signal range, at specified supply and temperature. A common measure is the peak-to-peak difference
The signal interval is part of the definition. A small minimum resistance does not establish good switch on-resistance flatness. Analog Devices illustrates how complementary transistor paths flatten the resistance curve and explains the distinction between fixed attenuation and signal-dependent distortion.[ref]
For an original quasistatic model, an ideal source drives a load through a switch with
Here the stipulated resistance law uses the source signal ; it is not a transistor model or a device specification. For , expansion gives
With , the identity yields
A constant gain correction cannot remove the generated third harmonic.
Taking , , and gives a resistance range10–12ohms and an approximate third-harmonic amplitude0.490millivolts. Its ratio to the fundamental is about0.050percent. This selected low-frequency calculation isolates a static nonlinearity; it omits switch capacitances and amplifier dynamics.
A practical test holds the switch on, applies a small known electric current, and sweeps the terminal signal level while measuring the conducting-path drop. Measuring several temperatures and supply conditions separates flatness over signal from changes between operating conditions. A second test with a sinusoidal source and Fourier analysis checks whether the complete circuit produces harmonics; source and readout distortion must be measured independently.
The first coefficient of the alpha tensor is . Its contraction with the Levi-Civita symbol is
by incompressibility and vanishing averages of total derivatives. Every antisymmetric second-rank tensor in three dimensions is detected by this contraction, so the coefficient is a symmetric matrix. The proof needs no Fourier analysis.
// Target: fluid-mechanics.bigb
Two-dimensional infrared spectroscopy measures a sample's vibrational response as a function of two frequency coordinates. In a coherent experiment, timed infrared pulses establish an excitation history and a later optical response; the spectrum correlates excitation and detection frequencies. The two dimensions are spectral coordinates, not two spatial directions through the sample.
In a time-domain implementation, the experiment scans a coherence delay and resolves a detection interval while holding a 2D IR waiting time fixed. Schematically, a complex measured response is transformed to
The signs and combination of measured response pathways depend on the experimental convention. Fourier analysis converts the scanned delays into frequency information; it does not by itself establish which molecular mechanism produced a feature.
An original spectral example has modes near and . Features at coordinates and lie on the diagonal. An off-diagonal feature at is a 2D IR cross peak: excitation associated with one coordinate is correlated with response at another. Its physical interpretation depends on the pulse sequence and waiting time. A cross peak is not automatically evidence for chemical conversion between two species.
A primary2000 peptide experiment used phase-controlled femtosecond pulses, phase matching and heterodyne detection to measure the phase and amplitude of vibrational photon echoes as pulse delays varied. Cross peaks in acyl-proline-NH spectra supplied evidence for coupling between amide-I modes, with solvent-sensitive structural differences.[ref]
Compared with a one-dimensional infrared spectroscopy trace, the extra coordinate can separate overlapping responses and expose relationships between vibrations. Varying the 2D IR waiting time adds a controlled time dependence to test candidate mechanisms. Interpretation still requires a response model, sufficient time/frequency resolution and controls for solvent and instrument contributions; a richly structured spectrum does not uniquely determine a molecular structure by inspection.