Littlewood-Paley Theory and Function Spaces
Activate this skill when the user needs to decompose a function into dyadic frequency pieces, bound a Fourier multiplier on L^p, define or compare Sobolev, Besov and Triebel-Lizorkin spaces, apply Bernstein inequalities, or estimate products and nonlinear terms with paraproducts in a PDE argument. Triggers on "Littlewood-Paley," "dyadic decomposition," "square function," "Besov space," "Triebel-Lizorkin," "Sobolev embedding," "Bernstein inequality," "paraproduct," "Fourier multiplier," "harmonic analysis," "fractional Leibniz," "commutator estimate." Covers the construction of the decomposition, the square function theorem, frequency-localized and heat-flow definitions of the classical spaces, Bony's paraproduct calculus, and step-by-step procedures for proving a multiplier bound and estimating a nonlinear term.
You are an analyst who works across classical Fourier analysis, singular integrals and applied signal processing, and who has taught the graduate harmonic analysis sequence. Littlewood–Paley theory is the part of the course you consider a technology rather than a topic: once a student can split a function into octaves, estimate each octave with Bernstein's inequality, and sum, they can prove most of the inequalities they will ever need in dispersive or fluid PDE. You also know it as the continuous ancestor of every wavelet and filter-bank algorithm, and you keep the numerical picture in view when you teach it.
## Key Points
- Split by frequency in octaves, estimate each piece with single-scale tools (Bernstein, Hölder, Young), then sum. This is the proof skeleton for nearly every modern inequality.
- On a single dyadic piece, derivatives are numbers: ∇ ≈ 2^j. Sobolev norms are weighted ℓ² sums over j, Besov norms are weighted ℓ^q sums, Triebel–Lizorkin norms put the L^p norm outside instead.
- The square function theorem is the license to move between "sum over j" and "L^p norm": ‖f‖_p ≈ ‖(Σ_j |P_j f|²)^{1/2}‖_p for 1 < p < ∞.
- Products of localized pieces are localized: two annuli at the same scale add up to a ball, a low frequency times a high frequency stays near the high one. That geometry is the paraproduct.
- A multiplier bound is a Calderón–Zygmund bound in disguise. Check the Mikhlin condition scale by scale, sum the kernels, and hand the result to the Calderón–Zygmund theorem.
- P_j P_k = 0 unless |j − k| ≤ 1, and P̃_j P_j = P_j with P̃_j = P_{j−1} + P_j + P_{j+1}, whose symbol equals 1 on the support of ψ̂(2^{-j}·). Σ_j P_j² is not the identity; Σ_j P̃_j P_j is.
- ‖ψ_j‖₁ = ‖ψ‖₁ for every j, so P_j and P_{≤j} are bounded on every L^p uniformly in j, and P_{≤j} f → f in L^p for 1 ≤ p < ∞.
- Each P_j f is smooth and frequency-localized, so it obeys the Bernstein inequalities.
- Besov: ‖f‖_{B^s_{p,q}} = ‖P_{≤0} f‖_p + (Σ_{j≥1} (2^{js} ‖P_j f‖_p)^q)^{1/q}.
- Triebel–Lizorkin (p < ∞): ‖f‖_{F^s_{p,q}} = ‖P_{≤0} f‖_p + ‖(Σ_{j≥1} (2^{js} |P_j f|)^q)^{1/q}‖_p.
- B^s_{p,min(p,q)} ⊂ F^s_{p,q} ⊂ B^s_{p,max(p,q)}, so Besov and Triebel–Lizorkin differ only in the fine index.
- B^s_{p,q} ⊂ B^{s − n(1/p − 1/r)}_{r,q} for p ≤ r (apply Bernstein piece by piece); the same for F and for W^{s,p} ⊂ L^{np/(n − sp)} when sp < n.skilldb get harmonic-analysis-skills/littlewood-paley-and-function-spacesFull skill: 165 linesLittlewood-Paley Theory and Function Spaces
You are an analyst who works across classical Fourier analysis, singular integrals and applied signal processing, and who has taught the graduate harmonic analysis sequence. Littlewood–Paley theory is the part of the course you consider a technology rather than a topic: once a student can split a function into octaves, estimate each octave with Bernstein's inequality, and sum, they can prove most of the inequalities they will ever need in dispersive or fluid PDE. You also know it as the continuous ancestor of every wavelet and filter-bank algorithm, and you keep the numerical picture in view when you teach it.
Core Principles
- Split by frequency in octaves, estimate each piece with single-scale tools (Bernstein, Hölder, Young), then sum. This is the proof skeleton for nearly every modern inequality.
- On a single dyadic piece, derivatives are numbers: ∇ ≈ 2^j. Sobolev norms are weighted ℓ² sums over j, Besov norms are weighted ℓ^q sums, Triebel–Lizorkin norms put the L^p norm outside instead.
- The square function theorem is the license to move between "sum over j" and "L^p norm": ‖f‖_p ≈ ‖(Σ_j |P_j f|²)^{1/2}‖_p for 1 < p < ∞.
- Products of localized pieces are localized: two annuli at the same scale add up to a ball, a low frequency times a high frequency stays near the high one. That geometry is the paraproduct.
- A multiplier bound is a Calderón–Zygmund bound in disguise. Check the Mikhlin condition scale by scale, sum the kernels, and hand the result to the Calderón–Zygmund theorem.
The Dyadic Decomposition
Take a smooth radial χ with χ = 1 on |ξ| ≤ 1 and χ = 0 for |ξ| ≥ 2, and set ψ̂(ξ) = χ(ξ) − χ(2ξ), which vanishes for |ξ| ≤ 1/2 (both terms equal 1) and for |ξ| ≥ 2 (both vanish), so supp ψ̂ ⊂ {1/2 ≤ |ξ| ≤ 2}. Then Σ_{j∈Z} ψ̂(2^{-j}ξ) = Σ_j [χ(2^{-j}ξ) − χ(2^{-j+1}ξ)] = 1 for ξ ≠ 0 by telescoping. Define
P_j f = (ψ̂(2^{-j}·) f̂)^∨ = ψ_j ∗ f, ψ_j(x) = 2^{jn} ψ(2^j x), P_{≤j} f = (χ(2^{-j}·) f̂)^∨,
so P_j f has frequencies in 2^{j−1} ≤ |ξ| ≤ 2^{j+1} and P_{≤j} f in |ξ| ≤ 2^{j+1}. Homogeneous decomposition: f = Σ_{j∈Z} P_j f, modulo polynomials. Inhomogeneous: f = P_{≤0} f + Σ_{j≥1} P_j f. Facts used constantly:
- P_j P_k = 0 unless |j − k| ≤ 1, and P̃_j P_j = P_j with P̃_j = P_{j−1} + P_j + P_{j+1}, whose symbol equals 1 on the support of ψ̂(2^{-j}·). Σ_j P_j² is not the identity; Σ_j P̃_j P_j is.
- ‖ψ_j‖₁ = ‖ψ‖₁ for every j, so P_j and P_{≤j} are bounded on every L^p uniformly in j, and P_{≤j} f → f in L^p for 1 ≤ p < ∞.
- Each P_j f is smooth and frequency-localized, so it obeys the Bernstein inequalities.
Bernstein inequalities. If supp f̂ ⊂ B(0, 2^j), then for 1 ≤ p ≤ q ≤ ∞ and every multi-index α:
‖∂^α f‖_p ≤ C 2^{j|α|} ‖f‖_p, ‖f‖_q ≤ C 2^{jn(1/p − 1/q)} ‖f‖_p.
If supp f̂ lies in the annulus 2^{j−1} ≤ |ξ| ≤ 2^{j+1}, the reverse also holds: ‖f‖_p ≤ C 2^{-j} ‖∇f‖_p. Proof: f = φ_j ∗ f with φ̂_j equal to 1 on the support; ∂^α f = (∂^α φ_j) ∗ f and ‖∂^α φ_j‖₁ = 2^{j|α|} ‖∂^α φ‖₁; Young's inequality with ‖φ_j‖_r gives the second; for the reverse, ξ_k/|ξ|² times a fattened annular cutoff has an L¹ kernel of size 2^{-j}.
The Square Function Theorem
Let Sf = (Σ_j |P_j f|²)^{1/2}. For 1 < p < ∞ there are constants with c_p ‖f‖_p ≤ ‖Sf‖_p ≤ C_p ‖f‖_p.
Upper bound: f ↦ (P_j f)_j is a Calderón–Zygmund operator with ℓ²-valued kernel (ψ_j(x))_j, L² bounded by Plancherel and almost orthogonality, so the vector-valued Calderón–Zygmund theorem applies. Lower bound: duality plus Σ P̃_j P_j = I. An alternative route uses Khintchine's inequality: ‖Σ_j ε_j P_j f‖_p averaged over random signs is comparable to ‖Sf‖p, and each Σ ε_j P_j is a Mikhlin multiplier uniformly in the signs. Endpoints: ‖Sf‖₁ ≈ ‖f‖{H¹} (the Hardy space) and p = ∞ becomes a Carleson measure condition characterizing BMO.
Immediate consequences: any multiplier of the form Σ_j a_j ψ̂(2^{-j}ξ) with bounded a_j is bounded on L^p; the Marcinkiewicz multiplier theorem (in one dimension, bounded variation on each dyadic interval suffices); and the equivalence of the Bessel-potential Sobolev norm with the Littlewood–Paley norm for 1 < p < ∞.
Function Spaces by Frequency
For s ∈ R and 1 ≤ p, q ≤ ∞ (inhomogeneous versions; homogeneous ones sum over all j ∈ Z, drop P_{≤0}, and are defined modulo polynomials):
- Besov: ‖f‖{B^s{p,q}} = ‖P_{≤0} f‖p + (Σ{j≥1} (2^{js} ‖P_j f‖_p)^q)^{1/q}.
- Triebel–Lizorkin (p < ∞): ‖f‖{F^s{p,q}} = ‖P_{≤0} f‖p + ‖(Σ{j≥1} (2^{js} |P_j f|)^q)^{1/q}‖_p.
| Classical space | Littlewood–Paley description |
|---|---|
| H^s = W^{s,2} | B^s_{2,2} = F^s_{2,2}: Σ_j 2^{2js} ‖P_j f‖₂² |
| L^p, 1 < p < ∞ | F^0_{p,2} (square function theorem) |
| W^{s,p} Bessel potential space, 1 < p < ∞ | F^s_{p,2} |
| Hölder C^s, s > 0 not an integer | B^s_{∞,∞}: sup_j 2^{js} ‖P_j f‖_∞ |
| Zygmund class at integer s | B^s_{∞,∞}; strictly larger than C^s (Lipschitz is not a Besov space) |
| Hardy space H¹ | F^0_{1,2} |
| BMO | homogeneous Ḟ^0_{∞,2} |
Embeddings you use without thinking:
- B^s_{p,min(p,q)} ⊂ F^s_{p,q} ⊂ B^s_{p,max(p,q)}, so Besov and Triebel–Lizorkin differ only in the fine index.
- B^s_{p,q} ⊂ B^{s − n(1/p − 1/r)}_{r,q} for p ≤ r (apply Bernstein piece by piece); the same for F and for W^{s,p} ⊂ L^{np/(n − sp)} when sp < n.
- B^s_{p,q} ⊂ B^{s'}_{p,q'} whenever s' < s, for any q, q'.
- B^{n/p}{p,1} ⊂ C₀; in particular B^{n/2}{2,1} ⊂ L^∞ while H^{n/2} is not in L^∞ (the missing factor is a logarithm).
- Real interpolation gives Besov spaces, (L^p, W^{k,p}){θ,q} = B^{θk}{p,q}; complex interpolation between Sobolev spaces stays Sobolev.
- Duality: (B^s_{p,q})' = B^{-s}_{p',q'} for 1 ≤ p, q < ∞.
The classical definition of B^s_{p,q} through moduli of continuity, ‖f‖_p + (∫₀¹ (t^{-s} ω^m_p(f, t))^q dt/t)^{1/q} with m > s, agrees with the dyadic one. That equivalence is why "s derivatives in L^p, measured with ℓ^q fine tuning" is the right way to read the indices.
Heat-flow characterization. For s > 0 and 1 ≤ p, q ≤ ∞, ‖f‖{Ḃ^{-s}{p,q}} ≈ ‖t^{s/2} ‖e^{tΔ} f‖p‖{L^q((0,∞), dt/t)}: the heat semigroup at time t ≈ 2^{-2j} is a smooth version of P_{≤j}, and for negative regularity the low-pass pieces carry the norm. This is the form in which negative-order spaces enter fluid mechanics. For three-dimensional Navier–Stokes the scaling-critical spaces line up as Ḣ^{1/2} ⊂ L³ ⊂ Ḃ^{-1+3/p}{p,∞} ⊂ BMO^{-1} ⊂ Ḃ^{-1}{∞,∞} for 3 < p < ∞; Koch and Tataru proved well-posedness for small data in BMO^{-1}, whose norm is sup_{x,R} (R^{-3} ∫₀^{R²} ∫{B(x,R)} |e^{tΔ} f|² dy dt)^{1/2}, and Bourgain and Pavlović showed norm inflation in Ḃ^{-1}{∞,∞}, so the chain ends exactly where the theory does.
Paraproducts
Bony's decomposition of a product:
fg = T_f g + T_g f + R(f, g), T_f g = Σ_j P_{≤j−3} f · P_j g, R(f, g) = Σ_{|j−k|≤2} P_j f · P_k g.
Support geometry: P_{≤j−3} f · P_j g has Fourier support in 2^{j−2} ≤ |ξ| ≤ 2^{j+2}, so T_f g is a sum of pieces living at scale 2^j and inherits the regularity of g, with f entering only through low-frequency averages. The pieces of R live in balls |ξ| ≤ 2^{j+4} (the product of two annuli at comparable scales has no lower frequency bound): low frequencies pile up, which is why R is controlled only when the total regularity is positive.
Basic estimates, s ∈ R unless stated:
- ‖T_f g‖{H^s} ≤ C ‖f‖∞ ‖g‖_{H^s}.
- ‖T_f g‖{H^{s−t}} ≤ C ‖f‖{B^{-t}{∞,∞}} ‖g‖{H^s} for t > 0: a rough coefficient costs exactly its negative regularity.
- ‖R(f, g)‖{H^{s₁+s₂−n/2}} ≤ C ‖f‖{H^{s₁}} ‖g‖_{H^{s₂}} when s₁ + s₂ > 0.
Consequences: the fractional Leibniz rule ‖fg‖{H^s} ≤ C(‖f‖∞ ‖g‖{H^s} + ‖f‖{H^s} ‖g‖_∞) for s > 0; H^s is an algebra for s > n/2; H^{s₁} · H^{s₂} ⊂ H^{s₁+s₂−n/2} for s₁, s₂ < n/2 with s₁ + s₂ > 0; the Kato–Ponce commutator estimate ‖[Λ^s, f] g‖p ≤ C(‖∇f‖∞ ‖Λ^{s−1} g‖p + ‖Λ^s f‖p ‖g‖∞) with Λ = (1 − Δ)^{1/2}; and paralinearization, F(u) = T{F'(u)} u + (smoother remainder) for smooth F, which lets a nonlinear term be treated as a linear one with a rough coefficient. The Coifman–Meyer theorem is the general statement: a bilinear symbol σ(ξ, η) with Mikhlin-type bounds in (ξ, η) defines an operator bounded L^p × L^q → L^r for 1/r = 1/p + 1/q, 1 < p, q ≤ ∞, including r < 1 by the later work of Kenig–Stein and Grafakos–Torres.
Procedure: Proving a Multiplier Bound
- Write the symbol m and find its scaling. If it is homogeneous of degree s ≠ 0, factor m = |ξ|^s m₀ and treat |ξ|^s as a map between Sobolev spaces; bound m₀.
- Check the Mikhlin condition |∂^α m(ξ)| ≤ C_α |ξ|^{-|α|} up to order ⌊n/2⌋ + 1. Homogeneous of degree 0 and smooth on the sphere is sufficient. If the condition fails (a jump across a surface, oscillation like e^{i|ξ|}), stop: the operator is probably unbounded for p ≠ 2 and needs oscillatory-integral methods.
- Localize: m_j = m · ψ̂(2^{-j}·). Integrating by parts n + 1 times shows ‖K_j‖₁ ≤ C and ‖∇K_j‖₁ ≤ C 2^j for K_j = m_j^∨, with constants depending only on the Mikhlin constants.
- Sum: K = Σ_j K_j converges away from the origin and satisfies |K(x)| ≤ C |x|^{-n} and |∇K(x)| ≤ C |x|^{-n-1}: for fixed x sum the pieces with 2^j ≤ 1/|x| using size and those with 2^j > 1/|x| using the decay obtained from the derivative bounds. L² boundedness is |m| ≤ C. Hand K to the Calderón–Zygmund theorem.
- If m is not smooth but is constant, or of bounded variation, on dyadic pieces, skip the kernel: use the square function and bound P_j T uniformly.
- Record the constant as C max(p, p'). Nothing in this route gives a p-independent bound; the endpoint is BMO.
- Sanity-test against known cases: ξ_jξ_k/|ξ|² (bounded), |ξ|^{it} (bounded, norm polynomial in t), the indicator of an interval in one dimension (bounded, via the Hilbert transform), the indicator of a ball in n ≥ 2 (unbounded for p ≠ 2).
Procedure: Estimating a Nonlinear Term
- Write the term as a product or a composition and apply Bony's decomposition; for F(u) use paralinearization first.
- Sort the three pieces: low-high (T_f g) inherits the regularity of the high factor and needs only L^∞ or negative-Besov control of the low one; high-low symmetrically; high-high (R) needs positive total regularity.
- For each piece, put the norm on the localized product, use Bernstein to convert derivatives to powers of 2^j and, where needed, to move between L^p exponents.
- Sum over j: the resulting sequence estimate is a discrete Young's inequality, and the condition for the ℓ¹ factor to be summable is where the hypothesis on s appears.
- If a derivative sits on the high-frequency factor and the low factor is the solution itself (transport, u·∇u), do not estimate the product directly; use a commutator so the top-order term is handled by integration by parts.
- Write the final inequality with the regularity of each factor visible, and check it against scaling: both sides must transform the same way under u ↦ u(λ·).
Worked Examples
H^s ⊂ L^∞ for s > n/2. Using Bernstein and Cauchy–Schwarz:
‖f‖∞ ≤ ‖P{≤0} f‖∞ + Σ{j≥1} ‖P_j f‖∞ ≤ C ‖f‖₂ + C Σ_j 2^{jn/2} ‖P_j f‖₂ = C ‖f‖₂ + C Σ_j 2^{j(n/2 − s)} (2^{js} ‖P_j f‖₂) ≤ C (1 + (Σ_j 2^{2j(n/2−s)})^{1/2}) ‖f‖{H^s},
finite exactly when s > n/2. Dropping Cauchy–Schwarz gives B^{n/2}_{2,1} ⊂ L^∞ for free, and keeping track of where the geometric series diverges at s = n/2 yields the Brezis–Gallouet logarithmic inequality.
Product estimate in H^s, s > 0. For T_f g: each piece P_{≤j−3} f · P_j g is supported at scale 2^j with L² norm at most ‖f‖∞ ‖P_j g‖₂; since any P_k sees at most a fixed number of such pieces, ‖T_f g‖²{H^s} ≤ C Σ_j 2^{2js} ‖f‖∞² ‖P_j g‖₂² = C ‖f‖∞² ‖g‖{H^s}². Symmetrically for T_g f. For R: ‖P_ℓ R(f, g)‖₂ ≤ Σ{j≥ℓ−3} ‖P_j f‖∞ ‖P̃_j g‖₂, so 2^{ℓs} ‖P_ℓ R‖₂ ≤ ‖f‖∞ Σ_{j≥ℓ−3} 2^{(ℓ−j)s} (2^{js} ‖P̃_j g‖₂), a convolution of the ℓ² sequence 2^{js}‖P̃_j g‖₂ with the ℓ¹ sequence 2^{-ms}1_{m ≥ −3}. Young's inequality for sequences closes it, and s > 0 is exactly what makes that sequence summable.
The transport term u·∇u in H^s. For ∂t u + u·∇u = 0 the H^s energy identity is (1/2) d/dt ‖Λ^s u‖₂² = −⟨Λ^s(u·∇u), Λ^s u⟩. Split Λ^s(u·∇u) = u·∇Λ^s u + [Λ^s, u·∇]u. The first term is the top-order low-high piece and cannot be estimated as a product without losing a derivative; integrate by parts instead: ⟨u·∇Λ^s u, Λ^s u⟩ = −(1/2) ∫ (div u) |Λ^s u|², bounded by ‖∇u‖∞ ‖u‖²_{H^s}. The commutator is what the paraproduct calculus is for: Kato–Ponce gives ‖[Λ^s, u]∇u‖₂ ≤ C(‖∇u‖∞ ‖Λ^{s−1}∇u‖₂ + ‖Λ^s u‖₂ ‖∇u‖∞) ≤ C ‖∇u‖∞ ‖u‖{H^s}. Altogether d/dt ‖u‖{H^s} ≤ C ‖∇u‖∞ ‖u‖{H^s}: the H^s norm is controlled by the time integral of ‖∇u‖∞, which is the Beale–Kato–Majda structure, and since ‖∇u‖∞ ≤ C ‖u‖{H^s} for s > n/2 + 1 by the embedding above, local existence in H^s follows for exactly that range of s.
Building the partition numerically.
import numpy as np
def chi(r): # smooth cutoff: 1 for r <= 1, 0 for r >= 2
h = lambda t: np.where(t > 0, np.exp(-1.0/np.maximum(t, 1e-300)), 0.0)
s = np.clip(r - 1.0, 0.0, 1.0)
return h(1 - s) / (h(1 - s) + h(s))
xi = np.logspace(-3, 3, 2001) # |xi| from 1e-3 to 1e3
J = np.arange(-12, 13)
psi = np.array([chi(xi/2.0**j) - chi(xi/2.0**(j-1)) for j in J]) # psi-hat(2^-j xi) = chi(2^-j xi) - chi(2^(1-j) xi): lives in [2^(j-1), 2^(j+1)]
print(np.abs(psi.sum(axis=0) - 1).max()) # ~1e-16
print((psi > 0).sum(axis=0).max()) # 2: adjacent pieces overlap, nothing else does
Multiply the FFT of a signal by these pieces to see P_j f in practice; each piece is a band-pass filter one octave wide, and the sum of squares of the outputs is the discrete square function.
Checklist
- The cutoff ψ̂ vanishes near the origin and is supported in one annulus; the pieces overlap only with neighbors.
- Bernstein used with the correct support (ball for the direct inequalities, annulus for the reverse).
- Sobolev norms written as weighted ℓ² sums before estimating; Besov as ℓ^q.
- Paraproduct terms sorted into low-high, high-low, high-high and the high-high term checked for positive total regularity.
- Top-order transport terms handled by commutator plus integration by parts, not by a product estimate.
- For multipliers, Mikhlin condition verified to order ⌊n/2⌋ + 1, or a dyadic argument used instead.
- Every constant that depends on p recorded as such.
- Homogeneous versus inhomogeneous spaces distinguished; the low-frequency piece handled separately.
- Final inequality checked against scaling.
Common Mistakes
- Using P_j² in place of P̃_j P_j and losing the identity.
- Defining ψ̂ as χ(ξ/2) − χ(ξ) and then asserting support in 1/2 ≤ |ξ| ≤ 2; that choice lives in 1 ≤ |ξ| ≤ 4 and every index in the argument shifts by one.
- Applying the reverse Bernstein inequality to a piece supported in a ball rather than an annulus.
- Claiming H^{n/2} ⊂ L^∞; the borderline fails and the fix costs a logarithm or a change to B^{n/2}_{2,1}.
- Estimating R(f, g) with s₁ + s₂ ≤ 0 and hoping the low frequencies cancel; they do not.
- Confusing B^s_{p,q} with F^s_{p,q} when p ≠ q; L^p itself is an F-space, not a B-space.
- Treating the Lipschitz class as B^1_{∞,∞}; the latter is the Zygmund class and strictly larger.
- Estimating ‖u·∇u‖{H^s} by ‖u‖{H^s} ‖∇u‖_{H^s} and concluding the energy estimate closes; it loses a derivative and needs the commutator.
- Proving a multiplier bound at p = 2 by Plancherel and calling it an L^p bound.
Limits
This file handles inhomogeneous and homogeneous dyadic decompositions on R^n and the spaces they characterize. Anisotropic scalings (parabolic, product-type Marcinkiewicz theory), decompositions on domains and manifolds, and the endpoint spaces H¹ and BMO in detail are outside it. Sharp Strichartz, restriction and decoupling estimates use the same first step but different single-scale tools. The wavelet file gives the discrete orthonormal version of the same decomposition, and the singular integrals file supplies the Calderón–Zygmund theorem that every multiplier proof here ends with.
Install this skill directly: skilldb add harmonic-analysis-skills
Related Skills
Singular Integrals and Calderón-Zygmund Theory
Activate this skill when the user is working with the Hilbert or Riesz transforms, proving or applying L^p bounds for an operator with a singular kernel, running a Calderón-Zygmund decomposition, using the Hardy-Littlewood maximal function, or asking why elliptic regularity holds in L^p but fails at p = 1 and p = ∞. Triggers on "singular integral," "Calderón-Zygmund," "Hilbert transform," "Riesz transform," "maximal function," "weak type (1,1)," "Muckenhoupt weights," "A_p weights," "harmonic analysis," "elliptic regularity," "Mikhlin multiplier," "BMO." Covers the kernel conditions, the decomposition and the weak (1,1) proof, interpolation to L^p, the multiplier theorem, the endpoint spaces H^1 and BMO, the weighted theory in outline, and the PDE consequences.
Applied Spectral Estimation
Activate this skill when the user is estimating a power spectrum from sampled data and needs to choose between the periodogram, Welch averaging and multitaper methods, pick a window, understand leakage and the resolution-variance trade-off, detect sinusoidal lines against noise, or interpret a plotted spectrum without fooling themselves. Triggers on "power spectral density," "periodogram," "Welch method," "multitaper," "spectral leakage," "window function," "PSD," "spectrum estimation," "line detection," "scipy.signal.welch," "harmonic analysis." Covers the statistics of each estimator, a window table, scaling and units, confidence intervals, line tests, working numpy and scipy recipes, and an honest reading of the result.
Spherical Harmonics
Activate this skill when the user is expanding a function on the sphere, solving Laplace's equation in spherical coordinates, using the addition theorem or Funk-Hecke formula, choosing normalizations and phase conventions, or computing spherical harmonic transforms for geodesy, graphics lighting or cosmology. Triggers on "spherical harmonics," "Legendre polynomials," "associated Legendre," "addition theorem," "Funk-Hecke," "angular power spectrum," "Laplace equation on the sphere," "multipole expansion," "harmonic analysis," "HEALPix." Covers the degree-ℓ spaces and their dimensions, the separation of variables, the zonal-kernel calculus, expansion and quadrature on the sphere, application conventions in three fields, and the numerics that keep high degrees stable.
Uncertainty Principles and Sampling
Activate this skill when the user is reasoning about how concentrated a function and its Fourier transform can simultaneously be, reconstructing a band-limited signal from samples, diagnosing aliasing, choosing a sampling rate or a window for time-frequency analysis, or citing Heisenberg, Hardy, Donoho-Stark, Shannon-Nyquist or Paley-Wiener correctly. Triggers on "uncertainty principle," "Heisenberg," "band-limited," "Nyquist," "Shannon sampling," "aliasing," "sinc interpolation," "Paley-Wiener," "STFT," "Gabor," "spectrogram," "time-frequency," "harmonic analysis." Covers the classical, entropic and discrete uncertainty principles with exact constants, the sampling theorem and its failure modes, nonuniform and Slepian-type results, a procedure for diagnosing aliasing in recorded data, and the windowed-transform picture with its resolution trade-off.
Wavelets and Multiresolution Analysis
Activate this skill when the user is building, choosing, or debugging a wavelet decomposition: setting up a multiresolution analysis, deriving scaling and wavelet filters, running the fast wavelet transform, thresholding coefficients for denoising or compression, or dealing with artifacts at signal boundaries. Triggers on "wavelet," "multiresolution analysis," "MRA," "Haar," "Daubechies," "scaling function," "fast wavelet transform," "wavelet denoising," "wavelet compression," "PyWavelets," "harmonic analysis." Covers the MRA axioms, the two-scale equations, orthogonality conditions, Mallat's algorithm, thresholding rules, wavelet selection, and the boundary-handling pitfalls that ruin results in practice.
Fourier Series and Convergence
Activate this skill when the user is expanding a periodic function in a Fourier series, computing coefficients for standard functions, or asking in what sense and how fast the series converges: pointwise, in L^2, uniformly, or through Cesàro and Abel summability. Triggers on "Fourier series," "harmonic analysis," "Dirichlet kernel," "Fejér kernel," "Gibbs phenomenon," "Parseval," "Carleson," "pointwise convergence," "Cesàro summation," "Fourier coefficients," "trigonometric series." Covers the kernels, the convergence theorems with their exact hypotheses, the rates given by Lebesgue constants and Jackson's theorem, the coefficient table with its Parseval consequences, and the numerical checks that expose ringing and aliasing.