Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Existence of a smooth inhomogeneous dyadic frequency partition

Statement

For every n≥1 there is a radial function ψ∈Cc∞(Rn) with 0≤ψ≤1, ψ(ξ)=1 for ∣ξ∣≤1, ψ(ξ)=0 for ∣ξ∣≥3/2, and supp⁡ψ⊂{∣ξ∣<2}. For any radial ψ∈Cc∞(Rn) with 0≤ψ≤1, ψ=1 on ∣ξ∣≤1 and supp⁡ψ⊂{∣ξ∣<2} set φ0:=ψ and φj(ξ):=ψ(2−jξ)−ψ(2−(j−1)ξ) for j≥1. Then each φj is radial, real-valued, lies in Cc∞(Rn), and:

  1. ∑j≥0φj(ξ)=1 for every ξ, the sum being locally finite;
  2. supp⁡φ0⊂{∣ξ∣≤2} and, for j≥1, supp⁡φj⊂{2j−1≤∣ξ∣≤2j+1};
  3. φj≥0 for every j, at every ξ at most three of the functions φj are nonzero, and 13≤∑j≥0φj(ξ)2≤1;
  4. for every multi-index α there is Cα=Cα(n,ψ)<∞ with ∣∂αφj(ξ)∣≤Cα2−j∣α∣ for j≥1 and all ξ, and ∣∂αφ0(ξ)∣≤Cα for all ξ; consequently ∣∂αφj(ξ)∣≤2∣α∣Cα∣ξ∣−∣α∣ for j≥1 and ξ≠0.

Facts & Assumptions

Given: an integer n≥1, Gaussian brackets and multi-indices as in Ck maps and multi-index derivative notation in Euclidean space, and the support convention of The support of a function on Rn and its compactly supported Riemann integral. Write ∥f∥∞:=sup⁡ξ∣f(ξ)∣ for bounded functions.

[F1]

The standard smooth step σ(t):=β(t)/(β(t)+β(1−t)), with β the standard flat function, satisfies σ∈C∞(R), 0≤σ≤1, σ(t)=0 for t≤0 and σ(t)=1 for t≥1 (The standard smooth step function); β is smooth on R (The standard flat function is smooth and flat at zero).

[F2]

If q:Rn→R is smooth and σ:R→R is smooth, then σ∘q is smooth: the chain rule for total derivatives gives the first derivative and iteration gives all higher ones (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a), Ck Euclidean maps and diffeomorphisms).

[F3]

Cc∞(Rn)⊂S(Rn): a compactly supported smooth function has all its derivatives bounded, hence finite seminorms (Schwartz space and its seminorms).

[F4]

For h∈C∞(Rn) and R>0 the chain rule (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)) gives ∂i(h(⋅/R))(ξ)=R−1(∂ih)(ξ/R). Iterating this identity in the prescribed multi-index order gives ∂β(h(⋅/R))(ξ)=R−∣β∣(∂βh)(ξ/R), with β=0 the identity itself.

Proof

technique · direct
1.1F1F2F3algebra

Construction. Put q(ξ):=(9−4∣ξ∣2)/5, a polynomial, and ψ:=σ∘q. Then ψ is smooth by [F2], 0≤ψ≤1 by [F1], and ψ is radial because q depends on ∣ξ∣ only. Moreover q(ξ)≥1  ⟺  ∣ξ∣2≤1  ⟺  ∣ξ∣≤1 and q(ξ)≤0  ⟺  ∣ξ∣2≥9/4  ⟺  ∣ξ∣≥3/2, so by [F1] ψ(ξ)=1 for ∣ξ∣≤1 and ψ(ξ)=0 for ∣ξ∣≥3/2. Hence supp⁡ψ⊂{∣ξ∣≤3/2}⊂{∣ξ∣<2}, ψ is compactly supported, and ψ∈Cc∞(Rn)⊂S by [F3]. This proves the existence clause and, since every subsequent step uses only the listed properties (0≤ψ≤1, ψ=1 on ∣ξ∣≤1, ψ=0 for ∣ξ∣≥3/2 after the construction, or more generally ψ vanishing for ∣ξ∣≥2 when only supp⁡ψ⊂{∣ξ∣<2} is assumed), the corresponding clauses for an arbitrary such ψ.

2.1F1step 1.1algebra

The partition identity. Fix ψ as in the statement and define φ0:=ψ, φj:=ψ(2−jξ)−ψ(2−(j−1)ξ) for j≥1; each φj is radial and lies in Cc∞(Rn) as a difference of rescalings of ψ. Telescoping gives, for every N≥0 and every ξ, ∑j=0Nφj(ξ)=ψ(2−Nξ), and ψ(2−Nξ)→ψ(0)=1 as N→∞ because ψ is continuous and ψ=1 on the unit ball. Hence ∑j≥0φj(ξ)=1 for every ξ. The sum is locally finite: if ∣ξ∣≤R and j≥1 with 2−(j−1)R≤1, then ∣2−jξ∣≤∣2−(j−1)ξ∣≤1 and both ψ values equal 1, so φj(ξ)=0; thus only finitely many j with 2j−1<R contribute on the ball of radius R.

3.1step 1.1step 2.1F3algebra

Supports. For j≥1 put u:=2−j∣ξ∣, so that the two arguments have moduli u and 2u. If 2u≤1 then both moduli are at most 1 and both ψ values equal 1, so φj(ξ)=0; if u≥2 then both moduli are at least 2 and, since supp⁡ψ⊂{∣ξ∣<2}, both ψ values vanish, so φj(ξ)=0. Therefore φj(ξ)≠0 forces 2j−1<∣ξ∣<2j+1, which proves supp⁡φj⊂{2j−1≤∣ξ∣≤2j+1}. The case j=0 is supp⁡φ0=supp⁡ψ⊂{∣ξ∣<2}⊂{∣ξ∣≤2}.

4.1step 2.1step 3.1algebra

Sign and overlap. We claim φj≥0 for every j and every ξ without any monotonicity hypothesis. For j=0 this is ψ≥0. For j≥1 keep u=2−j∣ξ∣: if u≤1/2 then both moduli are at most 1 and φj(ξ)=0; if 1/2<u≤1 then the smaller modulus u gives ψ(2−jξ)=1 and φj(ξ)=1−ψ(2−(j−1)ξ)∈[0,1]; if 1<u<2 then the larger modulus 2u exceeds 2, so ψ(2−(j−1)ξ)=0 and φj(ξ)=ψ(2−jξ)∈[0,1]; finally if u≥2 then both moduli are at least 2 and φj(ξ)=0. Thus every nonzero value lies in [0,1], so φj≥0 and φj2≤φj. Since ∑jφj=1 by step 2.1, summing the pointwise inequality gives ∑jφj(ξ)2≤1. For the lower bound, at most three φj are nonzero at any fixed ξ: by the four cases above, a nonzero value requires u=2−j∣ξ∣∈(1/2,2), and three consecutive halvings u,u/2,u/4 span the factor 4 while the interval (1/2,2) has multiplicative length exactly 4, so at most two of the values 2−j∣ξ∣ lie in (1/2,2) (in particular at most three). Hence, by Cauchy-Schwarz at the fixed ξ, 1=(∑jφj(ξ))2≤(∑j1φj(ξ)≠0)(∑jφj(ξ)2)≤3∑jφj(ξ)2, which gives ∑jφj(ξ)2≥1/3.

4.2F3F4step 3.1algebra

Derivative bounds. Fix a multi-index α and put Cα:=(1+2∣α∣)∥∂αψ∥∞<∞; the value is finite because ψ∈Cc∞ has bounded derivatives. For j≥1, [F4] with R=2j and h=ψ gives ∂α(ψ(2−jξ))=2−j∣α∣(∂αψ)(2−jξ), and similarly with R=2j−1; hence ∣∂αφj(ξ)∣≤2−j∣α∣∥∂αψ∥∞+2−(j−1)∣α∣∥∂αψ∥∞=Cα2−j∣α∣, while ∣∂αφ0(ξ)∣=∣∂αψ(ξ)∣≤Cα. On the support of φj (j≥1) step 3.1 gives ∣ξ∣≤2j+1, so 2−j∣α∣≤2∣α∣∣ξ∣−∣α∣ and therefore ∣∂αφj(ξ)∣≤2∣α∣Cα∣ξ∣−∣α∣ for ξ≠0; off the support the left-hand side is zero.

5.1step 1.1step 2.1step 3.1step 4.1step 4.2∎

The four numbered clauses are steps 2.1 (partition), 3.1 (supports), 4.1 (sign, overlap, square sums) and 4.2 (derivative bounds and their consequence), and the existence clause with the strict support is step 1.1. Since steps 2.1 to 4.2 used only the properties ψ∈Cc∞, 0≤ψ≤1, ψ=1 on ∣ξ∣≤1 and supp⁡ψ⊂{∣ξ∣<2} (the last only through ψ=0 for ∣ξ∣≥2), the conclusions hold for every ψ with those properties.

Depends on

Used by

Dependency tree · two levels

31 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