Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The normalised sinc function

Definition

The normalised sinc function is sinc⁡:R→C, given for t≠0 by the quotient and at the origin by continuity,

sinc⁡(t):=sin⁡(πt)πt(t≠0),sinc⁡(0):=1.

The values displayed show that sinc⁡ is real-valued: the sine and the identity of The derivatives of sine and cosine are cosine and minus sine are real functions there, and the quotient of real numbers is real.

Well-definedness. At every t≠0 the numerator and denominator are defined and πt≠0, so the quotient of real numbers is defined (The complex exponential by its power series is needed only to fix the ambient convention in which π, sin⁡ and the real numbers are embedded in C). The value at t=0 is assigned separately; it is the correct limit, lim⁡t→0sinc⁡(t)=1, because πt→0 as t→0 and lim⁡u→0sin⁡(u)/u=1 (The limit of sin x divided by x at zero is one), the substitution u=πt being the case of Composition of limits holds under either hypothesis: f is defined at L with value M, or g avoids L on a punctured neighbourhood of c in which the inner function πt does not take the value 0 away from t=0; with this value sinc⁡ is continuous at 0, and it is continuous at every t≠0 because t↦sin⁡(πt) is a composite of continuous functions (The derivatives of sine and cosine are cosine and minus sine gives differentiability, hence continuity, and A composite of continuous functions is continuous, with no side hypothesis of the kind the composition of limits needs) and t↦1/(πt) is a quotient with nonvanishing denominator, so Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function gives the quotient.

Symmetry and integer values. Sine is odd (Parity and the Pythagorean identity for sine and cosine), so for t≠0, sinc⁡(−t)=sin⁡(−πt)/(−πt)=sin⁡(πt)/(πt)=sinc⁡(t), and the same identity holds at t=0; thus sinc⁡ is even. For an integer k≠0, sin⁡(πk)=0 by the zero set of sine (The zero sets of sine and cosine and the least positive common period 2 pi), so sinc⁡(k)=0, while sinc⁡(0)=1. Hence sinc⁡(k)=0 for every nonzero integer k, and the kernel vanishes at every sampling point except its own.

Bounds. For every real t, ∣sinc⁡(t)∣≤1: at t=0 this is an equality, and for t≠0 the one-Lipschitz estimate ∣sin⁡u−sin⁡0∣≤∣u∣ (Sine and cosine are 1-Lipschitz on R) with u=πt and sin⁡0=0 (The derivatives of sine and cosine are cosine and minus sine) gives ∣sin⁡(πt)∣≤π∣t∣, which proves the bound after division by ∣πt∣. For every t≠0 one also has ∣sinc⁡(t)∣≤1/(π∣t∣), since ∣sin⁡(πt)∣≤1 (Parity and the Pythagorean identity for sine and cosine) and division by ∣πt∣ gives this tail estimate.

This is the normalisation used by the sampling theorem on this page: the reconstruction series is f(x)=∑kf(hk)sinc⁡(x/h−k), and the kernel vanishes at every sampling point except its own, as proved above. The Fourier identity sinc⁡(t)=∫−1/21/2e−2πitξ dξ is not asserted by this definition; it is proved directly where the sampling theorem consumes it, from the complex primitive of the exponential. The complex exponential convention e2πit=exp⁡(2πit) underlying that display is exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0.

No choice principle is used in this item.

Depends on

Used by

Dependency tree · two levels

52 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources