Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

Smooth integral functionals approximate bounded functionals on compact sets

Statement

Assume Countable Choice. Let D⊂Rd be a bounded Lipschitz domain, and let X=Lp(D), X=Wm,p(D), or X=Cm(Dˉ), where 1≤p<∞ and m≥0 wherever applicable. For every bounded linear functional L:X→R, every compact K⊂X, and every ε>0, there is κ∈Cc∞(D) such that sup⁡a∈K∣L(a)−∫Dκ(y)a(y) dy∣<ε.

The input function in this integral is its zeroth derivative. The conclusion is compact-uniform, without an assertion of operator-norm density of these functionals.

Facts & Assumptions

Given: D,X,L,K,ε as in the Statement.

[F1]

The inward smoothing construction supplies Sta(x)=∫Dkt(x,y)a(y) dy, where kt is ambient smooth, has fixed compact support in x, and Sta→a uniformly on each compact subset of X. Its explicit kernel is kt(x,y)=∑jψj(x)ρt(x+tvj−y) (Inward mollification and smooth finite-rank approximation on Lipschitz domains).

[F2]

All listed X embed continuously into L1(D); this follows directly from Hölder's inequality on the bounded domain, or the sup norm in the continuous case. Countable Choice is used by the local smoothing supplier (The Axiom of Countable Choice (ACω)).

[F3]

The finite normalized-bump construction gives an ambient smooth cutoff equal to one near any compact subset of an open set, taking values between zero and one and compactly supported in that open set (Finite ambient partitions near compact sets).

Proof

1.1givenF1F2chooseconstruct

Empty K or L=0 is handled by κ=0. Otherwise [F1] permits choosing t>0 with sup⁡K∥Sta−a∥X<ε/(2∥L∥). For fixed t, the map y↦kt(⋅,y)∣D is ambient C∞ with values in X: every mixed x and y derivative is uniformly continuous on compact products, so the ordinary finite-dimensional Taylor remainders in y, uniformly for x derivatives through order m, tend to zero in the Cm norm and hence in the X norm. Thus κt(y)=L(kt(⋅,y)∣D) is ambient smooth, with Dyακt=L(Dyαkt(⋅,y)∣D). It is bounded on Dˉ.

1.2F2F3chooseconstructalgebra

Compactness of K in X implies its compactness in L1(D) by [F2]. Given θ>0, take a finite θ/2 net a1,…,as in that L1 image. By integrability and an exhaustion of D by compact subsets, there is one compact F⊂D with ∫D∖F∣ai∣<θ/2 for all i. Therefore sup⁡a∈K∫D∖F∣a∣<θ. Choose a smooth cutoff 0≤ζ≤1, compactly supported in D, equal to one on F; use [F3] for the one-set open cover {D} of F. Then sup⁡K∫D(1−ζ)∣a∣<θ. This uses a finite net and finitely many integrable tails, including at p=1; it requires no L∞ approximation of a dual coefficient.

2.1step 1.1F1F2constructalgebra

For each a∈X, one has L(Sta)=∫Dκt(y)a(y) dy. To justify the identity without assuming a vector-integration theorem, partition a box containing D into cells of diameter tending to zero and replace kt(⋅,y) on each cell by kt(⋅,yl). Uniform continuity of every x derivative through order m makes the error in X at most cXη∥a∥1, where η→0 is the uniform kernel derivative error and cX converts a Cm bound to an X bound. Applying bounded L to the finite sums is legitimate by linearity. Their scalar integral errors are at most ∥L∥cXη∥a∥1 as well, so passing to the limit proves the identity. Consequently sup⁡K∣L(a)−∫Dκta∣<ε/2.

3.1step 2.1step 1.2constructalgebra∎

If ∥κt∥L∞(D)=0, choose κ=0. Otherwise use step 1.2 with θ=ε/(2∥κt∥∞) and set κ=ζκt∈Cc∞(D). The cutoff error satisfies sup⁡K∣∫D(κt−κ)a∣≤∥κt∥∞sup⁡K∫D(1−ζ)∣a∣<ε/2. Combining with step 2.1 proves the claim.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

23 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