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.

Second-order kernel convolution has an L² bias bound

Statement

Assume ACω. Let f be a density version in W2,2(Rd), and let K be a normalized Borel kernel with K∈L1, ∫ujK(u) du=0 for every j, and M2(K):=∫Rd∣K(u)∣ ∥u∥2du<∞. Define the convolution Shf=∫K(u)f(⋅−hu)du as an L2 equivalence class. With ∥D2f∥2,F2:=∑j,k=1d∥∂jkf∥L22, one has, for every h>0, ∥Shf−f∥L2≤h22M2(K) ∥D2f∥2,F.

Facts & Assumptions

Given: ACω, d≥1, a density version f∈W2,2(Rd), and a normalized Borel kernel K with the displayed moment conditions.

[A1]

The Axiom of Countable Choice, written ACω (The Axiom of Countable Choice (ACω)).

[F1]

Under ACω, W2,2 consists of L2 classes whose weak partial derivatives through order two are in L2 (Integer-order Sobolev spaces and their norms).

[F2]

Under ACω, Cc∞(Rd) is dense in W2,2(Rd): for every ϵ>0 there is a smooth compactly supported g with ∥g−f∥W2,2<ϵ (Compactly supported smooth functions are dense in W^{k,p}(R^n)).

[F4]

Under ACω, a C1 diffeomorphism satisfies the change-of-variables formula for integrable functions; translations therefore preserve L2 norms (A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions).

[F5]

Holder's inequality with exponents 2,2 gives ∣∫ab∣2≤(∫∣a∣2)(∫∣b∣2) when the square integrals are finite (Holder's inequality for integrals, including the endpoint cases).

[F6]

The total-derivative chain rule differentiates a smooth function along an affine line (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)).

Proof

1.1givenA1F3F4F5F6F7algebra

First take g∈Cc∞(Rd). For each x,u, set q(t)=g(x−thu). The chain rule [F6] gives q′(0)=−h∇g(x)⋅u and q′′(t)=h2uTD2g(x−thu)u. Integration by parts and the second fundamental theorem [F7] give g(x−hu)=g(x)−h∇g(x)⋅u+h2∫01(1−t) uTD2g(x−thu)u dt. The first moments are absolutely integrable since ∣uj∣≤1+∥u∥2 and K∈L1 with M2(K)<∞. Integrating against K(u) therefore cancels the constant and linear terms by ∫K=1 and ∫ujK(u)du=0. Euclidean Cauchy–Schwarz gives ∣uTD2g(y)u∣≤∥u∥ ∥D2g(y)u∥≤∥u∥2∥D2g(y)∥F. Apply Holder [F5] with the finite measure ∣K(u)∣(1−t)∥u∥2du dt, whose total mass is M2(K)/2, to obtain ∣Shg(x)−g(x)∣2≤h4(M2(K)2)∫Rd ⁣∫01∣K(u)∣(1−t)∥u∥2∥D2g(x−thu)∥F2dt du. Tonelli [F3] and translation invariance from [F4] then give ∥Shg−g∥22≤h4(M2(K)2)2∥D2g∥2,F2.

2.1givenA1F1F2F3F4F5step 1.1algebra∎

For every Borel representative q∈L2, the integrand (x,u)↦K(u)q(x−hu) is product-measurable. Holder [F5] and Tonelli [F3] show its defining integral exists absolutely for almost every x and ∥Shq∥22≤∥K∥1∫Rd∣K(u)∣∫Rd∣q(x−hu)∣2dx du=∥K∥12∥q∥22, by Holder [F5], Tonelli [F3], and translation invariance [F4]. If two Borel representatives agree almost everywhere, translation invariance makes their translates agree almost everywhere for each u; Tonelli [F3] then makes their convolution integrals agree for almost every x. Thus Sh is well-defined as an L2 equivalence class on the classes used here. Given ϵ>0, choose g∈Cc∞ as in [F2]. The finite sum defining ∥D2(g−f)∥2,F is at most d∥g−f∥W2,2, so step 1.1 and the operator bound just proved imply ∥Shf−f∥2≤(∥K∥1+1)ϵ+h22M2(K)(∥D2f∥2,F+dϵ). Letting ϵ↓0 proves the asserted bound.

Depends on

Used by

Dependency tree · two levels

94 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