Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedprecheck passjudge 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.

Schwartz functions with prescribed flatness of the Fourier transform at the origin

Statement

Assume Countable Choice. Let n≥1. For every integer m≥1 there is a real, even function φ∈Cc∞(Rn) with supp⁡φ⊆B(0,1),∫Rnφ≠0,∫Rnxαφ(x) dx=0  for 0<∣α∣≤m. Equivalently, under the Fourier convention of Fourier differentiation and multiplication identities on tempered distributions, φ^(0)≠0 and ∂αφ^(0)=0 for every multi-index with 0<∣α∣≤m. The construction is uniform in m: a single one-dimensional finite-difference construction achieves every prescribed finite flatness order, and its tensor product is used.

Facts & Assumptions

Given: Countable Choice, an integer n≥1 and an integer m≥1. The multi-index notation is that of Ck maps and multi-index derivative notation in Euclidean space and the seminorms are those of Schwartz space and its seminorms.

[A1]

Countable Choice is assumed, in particular for the Fourier differentiation identity and the Lebesgue change-of-variables formula cited below (The Axiom of Countable Choice (ACω)).

[F1]

There is a smooth bump: with σ the standard smooth step function of The standard smooth step function, which is smooth, vanishes on (−∞,0] and equals 1 on [1,∞), the function θ(x):=σ(116−x2) is smooth (composition of the smooth functions σ and x↦116−x2, The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c)), even, positive on (−1/4,1/4) (where 116−x2∈(0,116] and σ>0 on (0,∞)) and supported in [−1/4,1/4] (where 116−x2≥0).

[F2]

Newton-Leibniz with an interior derivative: if G is continuous on [a,b], differentiable on (a,b) and G′=g there with g Riemann integrable, then ∫abg=G(b)−G(a) (Newton–Leibniz needs only continuity on [a,b], differentiability on (a,b), and a Riemann-integrable extension of the interior derivative). Applied inductively this gives, for f∈Cm(R) and h>0, the iterated integral representation Δhmf(x)=∫[−h,h]mf(m)(x+s1+⋯+sm) ds1⋯dsm,Δhf(x)=f(x+h)−f(x−h). There is no factorial prefactor in this representation: each finite-difference factor introduces one integration over [−h,h]. Any factorial below comes from evaluating the derivative f(m), not from the integration formula.

[F3]

Under the Fourier convention of Fourier differentiation and multiplication identities on tempered distributions, for φ∈S and every multi-index α one has ∂αφ^(0)=(−2πi)∣α∣∫Rnxαφ(x) dx; equivalently, if all mixed moments ∫xαφ, 0<∣α∣≤m, vanish then ∂αφ^(0)=0 for those α, and conversely.

[F4]

Riemann Fubini on a product rectangle factors the integral of a continuous compactly supported tensor product; the coordinate dilation uses the change-of-variables formula (Riemann--Fubini on product rectangles, with lower and upper section integrals and content-zero exceptional sections, A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions).

Proof technique: finite differences of a bump in one dimension, then tensor product, dilation and normalisation.

Proof

technique · constructive
1.1givenconstruct

Reduction to even order. If m is odd, replace it by m+1: a function whose moments vanish through order m+1 also has all moments vanishing through order m. We may therefore assume m≥2 is even, and we write h=1/(8m). This uses no choice.

1.2F1givenalgebra

The one-dimensional construction. Let θ be the even bump of [F1] and put Θ(x)=θ(x+1/2)−θ(x−1/2). Then Θ∈Cc∞(R) is real, odd, and supported in [−3/4,−1/4]∪[1/4,3/4]; moreover Θ(x)=−θ(x−1/2)<0 on (1/4,3/4) and Θ(x)=θ(x+1/2)>0 on (−3/4,−1/4). Define ϕ(x)=x−1ΔhmΘ(x). Since supp⁡ΔhmΘ⊆[−3/4−mh,3/4+mh]=[−7/8,7/8] and is bounded away from 0, the factor x−1 is smooth on a neighbourhood of that support, so ϕ∈Cc∞(R) with support in [−7/8,7/8]. The reflection operator (Pf)(x)=f(−x) satisfies PΔh=−ΔhP; since Θ is odd and m is even, ΔhmΘ is odd, so ϕ is even and real.

1.3A1algebra

The flatness of the one-dimensional Fourier transform. For 1≤ν≤m, differentiating ϕ^(ξ)=∫e−2πiξxϕ(x) dx under the integral sign and using the polynomial identity Δhm(xν−1)=0 (the m-th finite difference of a polynomial of degree ν−1≤m−1 vanishes) gives ϕ^(ν)(0)=(−2πi)ν∫Rxν−1ΔhmΘ(x) dx=(−2πi)ν∫R(Δhmxν−1)(x) Θ(x) dx=0, where the middle equality is the self-adjointness ∫f (Δhmg)=∫(Δhmf) g of the even-order finite difference, which follows from the translation invariance of Lebesgue measure and (Δh)∗=−Δh.

1.4A1F2algebra

Nonvanishing of the mean. Using self-adjointness again, ∫Rϕ=∫Rx−1ΔhmΘ(x) dx=∫R(Δhmx−1)(x) Θ(x) dx. On the support of Θ one has ∣x∣≥1/4, and all points x+s1+⋯+sm in the iterated integral representation of [F2] stay on the same side of zero. Since m is even, (x−1)(m)=m!x−m−1 has the sign of x, while Θ has the opposite sign on each of its two support components. Thus the integrand (Δhmx−1)Θ has one constant sign and there is no cancellation. By [F2], Δhm(x−1)(x)=m!∫[−h,h]m(x+s1+⋯+sm)−m−1 ds1⋯dsm. The integrand has a constant sign on this box, so its absolute value is the integral of the absolute value. The factor m! comes from (x−1)(m); the iterated integral contributes the box volume (2h)m. Therefore ∣Δhm(x−1)(x)∣=m!∫[−h,h]m∣x+s1+⋯+sm∣−m−1 ds1⋯dsm≥(2h)mm!(7/8)−m−1 for every x∈supp⁡Θ, because ∣x+s1+⋯+sm∣≤3/4+mh=7/8. Hence ∣∫Rϕ∣=∫R∣Δhmx−1∣ ∣Θ∣≥(2h)mm!(7/8)−m−1∫R∣Θ∣>0, since Θ is continuous and not identically zero.

2.1A1step 1.3step 1.4F3F4algebra

The tensor product and its moments. Put ψ(x)=ϕ(x1)ϕ(x2)⋯ϕ(xn) and Ψ(x)=ψ(λx) with λ=n+1>7n/8; then Ψ∈Cc∞(Rn) is real and even and supp⁡Ψ⊆[−7/(8λ),7/(8λ)]n⊆B(0,1), since the euclidean circumradius of that cube is (7/8)n/λ<(7/8)n/(7n/8)=1. For a multi-index α with 0<∣α∣≤m the substitution x=λ−1t gives the factorisation ∫RnxαΨ(x) dx=λ−n−∣α∣∏j=1n∫Rtαjϕ(t) dt. If αj=0 the corresponding factor is ∫ϕ≠0 by step 1.4; if αj≥1 then αj≤∣α∣≤m, and ∫tαjϕ(t) dt=0 by step 1.3 combined with [F3] applied in one dimension. Hence every factor with αj≥1 vanishes and the product is zero.

3.1A1step 2.1F3discharge-construct∎

Normalisation and conclusion. Step 2.1 gives ∫Ψ=λ−n(∫ϕ)n≠0, so φ=(∫RnΨ)−1Ψ is real, even, smooth and compactly supported in B(0,1), with ∫φ=1 and all moments ∫xαφ, 0<∣α∣≤m, still vanishing. The Fourier form of the statement follows from the differentiation identity of [F3] and Ψ^(0)=∫Ψ≠0, together with the linearity of the Fourier transform under the real scalar normalisation. This proves the lemma.

Depends on

Used by

Dependency tree · two levels

56 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