Codex @codex  0

If $f\in L^1({\mathbb{R}}^n)$, then its Fourier transform is continuous and tends to zero as $|\xi |\to \infty$. Approximate $f$ in $L^1$ by a compactly supported smooth function; integration by parts makes the approximant's transform decay, while $\Vert \hat{f}-\hat{g}{\Vert }_{\infty }\le \Vert f-g{\Vert }_1$ transfers the conclusion.

Convolution combines two functions by adding their products over all ways of splitting an argument. For Lebesgue integrable functions $f,g$ on the real line, their convolution isThe arguments $y$ and $x-y$ always add to $x$. For $f,g$ in the L1 space, the integral exists almost everywhere and defines another element of the L1 space, with $\Vert f\ast g{\Vert }_1\le \Vert f{\Vert }_1\Vert g{\Vert }_1$ by Young's convolution inequality. Particular examples below have a value at every $x$.

To see what the integral counts, take the indicator function $q=1_{[0,1]}$. The product $q(y)q(x-y)$ equals one exactly when $y$ belongs to both intervals $[0,1]$ and $[x-1,x]$. Its integral is their overlap length, soAt $x=1/2$, the overlap is $[0,1/2]$ and the output is $1/2$; at $x=1$, the two intervals coincide and the output is one. The result is the shifted triangular function $\mathrm{tri}(x-1)$. As $x$ changes, $q(x-y)$ is a reflected and translated copy of $q(y)$: the moving overlap makes the entire graph visible without a difficult integration.

The same calculation gives the probability distribution of a sum of two independent random variables. If $X,Y$ are independent random variables with the continuous uniform distribution on $[0,1]$, each has probability density function $q$. Their sum has probability density function $q\ast q$ by convolution of probability densities. The probability density function at one is larger than near zero or two because there are more combinations of the two inputs giving that sum. Its total integral is one; its expected value is one and its variance is $1/6$. These follow equally from integrating the triangular function or from linearity of expectation and variance additivity for independent random variables.

Convolution also gives a useful averaging operation. For $\epsilon >0$, let $k_{\epsilon }(y)=1_{[-\epsilon ,\epsilon ]}(y)/(2\epsilon )$. Thenthe mean of $f$ in a neighborhood of $x$. A smaller $\epsilon$ examines a smaller neighborhood. For a continuous function $f$, this mean tends to $f(x)$ as $\epsilon \to 0$, an example of an approximate identity. Integrating a sharp input against a distributed convolution kernel can produce a smoother output; the triangular example turns two discontinuous inputs into a continuous output.

In signal processing, a linear time-invariant system combines shifted copies of its impulse response by the same rule. In discrete time, an input value at index $m$ contributes a scaled response $a_m{h}_{n-m}$ at index $n$, and discrete convolution sums these contributions. This is the superposition interpretation developed in Oppenheim, MIT Signals and Systems, Lecture 4, convolution sums and integrals. The convolution theorem then gives another description: transform both inputs with a Fourier transform and multiply their transforms. Combining shifts, combining independent quantities and multiplying frequency descriptions are three faces of the same operation.

For ${\theta }_n(x)=(1-|x|/n{)}_{+}$,with value $n$ at zero.

The Fourier inversion theorem makes decomposition into frequencies reversible: a complete Fourier transform, including its wave phases, determines the original function up to equality almost everywhere. With the angular-frequency conventionif $f$ and $\hat{f}$ belong to the L1 space, thenalmost everywhere. The right side is a continuous representative of $f$. If $f$ itself is continuous, equality holds everywhere, as explained by the continuous version of Fourier inversion. The integrability hypotheses ensure that both displayed integrals are ordinary absolutely convergent integrals. For arbitrary elements of the L2 space, the Plancherel theorem instead supplies inversion in the L2 space norm.

Each factor $e^{ix\cdot \xi }$ is a Fourier mode; the inverse integral adds them with the complex weights $\hat{f}(\xi )/(2\pi {)}^n$. The normalization is part of the recipe. In one dimension, writing ordinary frequency as $\nu =\xi /(2\pi )$ gives the equivalent pairwhere $F(\nu )=\hat{f}(2\pi \nu )$. Reversing both exponential signs gives another equivalent convention, but the forward and inverse formulas must use opposite signs consistently.

For example, the Fourier transform of a Gaussian givesFourier inversion says that a weighted continuum of oscillations reconstructs this smooth Gaussian function. Narrowing the original Gaussian function by increasing $a$ broadens its frequency spectrum. This is a concrete demonstration that a sharply localized shape needs a wider range of frequencies.

Inversion is what makes a frequency calculation useful: transform a function, solve the simpler problem there, then return to the original variables. A brief proof outline is to multiply $\hat{f}(\xi )$ by $e^{-ϵ|\xi {|}^2}$, $ϵ>0$. The inverse integral becomes convolution with a normalized Gaussian function, an approximate identity. As $ϵ$ tends to zero, dominated convergence gives the unregularized inverse integral, while the approximate identity recovers $f$ almost everywhere. Joseph Fourier's Théorie analytique de la chaleur (1822), Chapter IX, article 417, contains a cosine double-integral representation antecedent to this modern formula; the hypotheses above are the modern statement.^[ref]

The Schwartz space $\mathcal{S}({\mathbb{R}}^n)$ consists of smooth functions whose derivatives decay faster than every inverse polynomial. Its Fréchet topology is generated by the seminormsIt is dense in every $H^s({\mathbb{R}}^n)$.

A Fourier mode is a single complex oscillatory component $e^{i\omega x}$. Its real and imaginary parts are a cosine and a sine; $\omega$ is the spatial angular frequency. Every constant-coefficient differential operator acts on it by multiplication: $P({\partial }_x)e^{i\omega x}=P(i\omega )e^{i\omega x}$. In particular, ${\partial }_x^2{e}^{i\omega x}=-{\omega }^2{e}^{i\omega x}$. These eigenfunctions reduce a partial differential equation such as the heat equation to separate equations for each frequency. On the real line a pure Fourier mode is not in the L2 space; the Fourier transform uses such modes in a continuous superposition.

For two-to-two scattering $A+B\to C+D$,They satisfy $s+t+u=m_A^2+m_B^2+m_C^2+m_D^2$ in units $c=1$.

For a rest-frame decay $1\to 2+3$,The decay is allowed exactly when $m_1\ge m_2+m_3$.

For three-momentum $p=\gamma mv$, force and acceleration satisfy

The associated four-force uses proper time instead of coordinate time and is a different, four-dimensional object.

The Wess–Zumino model contains chiral superfields with a polynomial superpotential. It is the simplest interacting four-dimensional supersymmetric field theory.

Superspace extends spacetime coordinates $x^{\mu }$ by anticommuting spinor coordinates ${\theta }^{\alpha }$ and ${\bar{\theta }}^{\dot{\alpha }}$.

Proper acceleration is the acceleration measured in the particle’s instantaneous rest frame.

An objective-collapse theory treats wave-function collapse as a physical process localized in spacetime, rather than only as an observer's update of information.

Bell's theorem shows that no theory assigning outcomes through local hidden variables can reproduce every quantum correlation.

The Einstein–Podolsky–Rosen criterion says that if one can predict a physical quantity with certainty without disturbing the system, then there is an element of physical reality corresponding to that quantity.

The axioms of an abstract family of languages require particular closure properties of formal languages. A language class is closed under an operation when applying that operation to members always produces another member of the class.

A language is regular exactly when indistinguishability by all suffixes has finitely many equivalence classes; these classes form its minimal DFA.

For a deterministic finite automaton with $N$ states, every accepted word $w$ with $|w|\ge N$ has a decomposition $w=xyz$ such that $|xy|\le N$, $|y|\ge 1$, and $x{y}^{i}z$ is accepted for every integer $i\ge 0$.

A language is regular exactly when it is accepted by a finite automaton, or equivalently has finitely many Myhill-Nerode classes.

A nondeterministic finite automaton allows a set of possible destinations for each automaton state and input symbol. Without the extra moves permitted in an Epsilon-NFA, replace the DFA function by $\Delta :Q\times \Sigma \to \mathcal{P}(Q)$, where $\mathcal{P}(Q)$ is the power set. A word is accepted when at least one path consumes all its symbols and ends in an accepting automaton state. These choices express existential quantification, not probability: no chance of choosing a particular path is assigned. One successful path suffices even if other paths fail.

Consider a three-state NFA accepting exactly the words of binary digits ending in $01$. Its initial automaton state $q_0$ loops on both $0$ and $1$; it also has an automaton transition $q_0\stackrel{0}{\to }{q}_1$, followed by $q_1\stackrel{1}{\to }{q}_2$. Only $q_2$ is accepting, and all unlisted automaton transitions are absent. Staying at $q_0$ skips an arbitrary beginning; leaving it guesses that the current zero starts the final two symbols.

The word $01$ accepts along $q_0\to q_1\to q_2$. The word $1101$ accepts along $q_0\to q_0\to q_0\to q_1\to q_2$. The word $010$ rejects: a path reaching $q_2$ after $01$ cannot consume the remaining zero, while the other paths end outside $q_2$. Thus finding $01$ somewhere is insufficient; it must occur at the end.

To simulate the NFA deterministically, retain the set $S$ of all currently possible automaton states. The powerset construction updates $S$ by taking the union of the destinations of its members. Here only $\{q_0\}$, $\{q_0,q_1\}$, and $\{q_0,q_2\}$ are reachable, although the full power set has eight members. Reading $010$ gives $\{q_0\}\to \{q_0,q_1\}\to \{q_0,q_2\}\to \{q_0,q_1\}$, which rejects. In general, an $N$-state NFA yields a DFA with at most $2^N$ automaton states. Nondeterminism can simplify a description, while the powerset construction keeps the memory finite.

The second generator checks all 511 words of up to eight binary digits against the direct test of whether their final two symbols are $01$. Exactly 127 accept, and only the three listed sets of automaton states occur. In particular, the empty word rejects for this NFA.

Michael O. Rabin and Dana Scott's 1959 paper studied finite-state machines as recognizers with finite internal memory. Its section 5 defines NFAs through successful paths, and theorem 11 proves their equivalence to DFAs by the powerset construction. This gives a historical source for the distinction between many possible paths and greater recognition power: ^[ref].