Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (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.

Finite-order analytic cutoff sequence

Statement

Let n≥1, let U⊂Rn be open, and let K⊂U be compact. There are constants A,C>0 and functions χN∈Cc∞(U) for each integer N≥1 such that 0≤χN≤1, χN=1 on a fixed neighborhood of K, and

∣∂αχN(x)∣≤C(AN)∣α∣(x∈Rn, ∣α∣≤N).

These are smooth compact cutoffs; no compactly supported analytic function is asserted.

Facts & Assumptions

Given: A compact set K contained in an open set U⊂Rn.

[F1]

A smooth bump between concentric Euclidean balls: nested balls admit a smooth function between zero and one, equal to one on the smaller ball and supported in the larger ball.

[F2]

Ck maps and multi-index derivative notation in Euclidean space: ∂α denotes the specified iterated coordinate derivatives, with ∣α∣ their order.

[F3]

Every continuous function on a closed nondegenerate rectangle in Rm is Riemann integrable: every continuous real function on a closed nondegenerate rectangle is Riemann integrable. Thus a continuous compactly supported function, restricted to a rectangle containing its support in the interior, has the finite Euclidean-space integral of The support of a function on Rn and its compactly supported Riemann integral.

[F4]

Riemann--Fubini on product rectangles, with lower and upper section integrals and content-zero exceptional sections: for continuous functions on compact product rectangles, iterated integrals equal the product integral.

Proof

Given: The compact set K and open neighborhood U.

1.1givenF1choosealgebra

If K=∅, set χN=0 for all N; the empty set is a neighborhood of K, so every assertion holds. Assume henceforth K≠∅. Consider all pairs of concentric balls Br(x)⋐BR(x)⋐U with x∈K and 0<r<R. Their smaller balls cover K, so compactness supplies finitely many pairs Brj(xj)⋐BRj(xj), 1≤j≤m, whose smaller balls cover K. Choose their finitely many bumps bj by [F1], translated to xj, with 0≤bj≤1, bj=1 on Brj(xj) and compact support in BRj(xj). The smooth function g=1−∏j=1m(1−bj) satisfies 0≤g≤1, equals one on the open set O=⋃j=1mBrj(xj) containing K, and has compact support S⋐U. Only finitely many bumps are selected.

2.1F1F3step 1.1choose

Choose a nonnegative smooth bump ρ0 supported in the unit ball and equal to one on the ball of radius 1/2, using [F1]. Its compactly supported integral is finite by [F3] and positive: a closed nondegenerate rectangle inside B1/2(0) has positive volume and ρ0=1 there. Normalize ρ=ρ0/∫ρ0, so ∫ρ=1, ρ≥0, and supp⁡ρ⊂B‾1(0). Since K⋐O and S⋐U, choose ε>0 smaller than one third of each distance dist⁡(K,Oc) and dist⁡(S,Uc), omitting the second restriction when U=Rn.

3.1F1F3F4step 1.1step 2.1given

For each N≥1, put δ=ε/N, ρδ(x)=δ−nρ(x/δ), and recursively η1=ρδ, ηj+1=ηj∗ρδ for 1≤j<N. Compact-rectangle Fubini [F4] and change of variables give ∫ηN=1 and supp⁡ηN⊂B‾ε(0); [F4] also permits reassociation of these compact convolution integrals. Define χN=g∗ηN. The integral defining χN is over a fixed compact rectangle. Differentiating the smooth kernel under this compact integral is justified by uniform convergence of its difference quotients on that rectangle, so χN is smooth. Positivity and unit mass give 0≤χN≤1. If dist⁡(x,K)<ε, then every y∈supp⁡ηN satisfies dist⁡(x−y,K)<2ε<dist⁡(K,Oc), hence g(x−y)=1 and χN(x)=1. Also supp⁡χN⊂S+B‾ε(0)⋐U.

4.1F2F3F4step 2.1step 3.1algebra

For smooth compactly supported f,h, write ∥h∥1=∫Rn∣h∣. Fubini on a rectangle containing their supports and the triangle inequality give ∥f∗h∥1≤∫ ⁣ ⁣∫∣f(x−y)∣∣h(y)∣ dy dx=∥f∥1∥h∥1. Also ∂j(f∗h)=(∂jf)∗h=f∗(∂jh) by differentiating under the compact integral and integration by parts; there is no boundary term because the factors have compact support. For k=∣α∣≤N, distribute the k coordinate derivatives to k distinct convolution factors in ηN. Scaling gives ∥∂jρδ∥1=δ−1∥∂jρ∥1, so repeated use of the preceding inequality yields ∥∂αηN∥1≤(AN)k,A=ε−1max⁡(1,max⁡j∥∂jρ∥1). For k=0 this is ∥ηN∥1=1.

5.1F1step 1.1step 3.1step 4.1algebra∎

Since ∥g∥∞≤1, ∣∂αχN(x)∣=∣g∗(∂αηN)(x)∣≤∥g∥∞∥∂αηN∥1≤(AN)∣α∣. Thus the lemma holds with C=1 (or any larger fixed constant), uniformly for every ∣α∣≤N. The cutoffs are smooth and no analytic bump is used.

Depends on

Used by

Dependency tree · two levels

32 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