Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Mollifier approximation in distributions

Statement

Assume Countable Choice for Lebesgue integration. Let n≥1, let Ω⊆Rn be open, and let u∈D′(Ω). Fix ρ∈D(Rn) with ∫ρ=1, and put ρε(x)=ε−nρ(x/ε) for ε>0. The smooth local convolution fε(x)=u(ρε(x−⋅)) is defined on Vε={x:x−εsupp⁡ρ⊆Ω}. Its regular distribution converges weakly to u locally: every test ψ∈D(Ω) is supported in Vε for all sufficiently small positive ε, and ∫fεψ→u(ψ).

Facts & Assumptions

[F1]

The stated scaling defines a unit-mass-bump mollifier family (The mollifier family generated by a unit-mass smooth bump).

[F2]

Local convolution on the safe domain is smooth, and all derivatives commute with the distribution pairing (Convolution with a test function is smooth).

[F3]

For compactly supported smooth parameter integrands, integration commutes with distribution pairing under Countable Choice (Distribution pairing with smooth parameter families).

[F4]

Compactly supported Riemann substitution is valid, and real and imaginary parts of bounded smooth box integrands have equal Riemann and Lebesgue integrals under Countable Choice (A compactly supported Riemann integrand admits the global change-of-variables formula from a diffeomorphism near the relevant compact preimage, Riemann–Lebesgue comparison for distribution test integrands).

[F5]

A distribution has a finite-order estimate on every fixed compact test support (Local finite order characterization of distributions).

[F6]

Locally integrable functions have regular functionals (Regular distribution from a locally integrable function), and under Countable Choice these embed into distributions (Locally integrable functions embed in distributions). Countable Choice is assumed exactly for the Lebesgue-integral interfaces (The Axiom of Countable Choice (ACω)).

Proof

Given: an integer n≥1, u,Ω,ρ, and Countable Choice.

1.1givenF1F2F6

Choose R>0 with supp⁡ρ⊆B‾(0,R). For a nonempty compact test support K⊆Ω choose d>0 such that K+B‾(0,2d)⊆Ω. If εR<d, then K⊆Vε, even with a fixed compact neighborhood inside it. F2 gives smoothness there. Hence fε is Borel and bounded on every compact subset of its safe domain, so it is locally integrable; F6 types its integral functional as a regular distribution. No nonnegativity or symmetry of ρ is required.

2.1step 1.1F3F4F6

Apply F3 to F(x,y)=ψ(x)ρε(x−y), with parameter x in Vε, integrating on a compact neighborhood of K contained in that domain. Its slices have a common compact support in Ω there. Outside K the integrand is zero. Thus F3 and F6 give [step 1.1, F3, F6] ∫fε(x)ψ(x) dx=u(ψε),ψε(y)=∫ρε(x−y)ψ(x) dx. By the affine substitution x=y+εz, justified for these compact smooth integrands by F4, ψε(y)=∫ρ(z)ψ(y+εz) dz. All these tests are supported in K+B‾(0,d).

3.1step 2.1F3F4F5F6

Extend ψ smoothly by zero to Rn. Its every derivative is uniformly continuous. Differentiating the last compact integral (by uniform difference-quotient estimates, or F3's derivative clause) yields [step 2.1, F3, F4] pm(ψε−ψ)≤∥ρ∥L1max⁡∣α∣≤msup⁡y, ∣h∣≤εR∣∂αψ(y+h)−∂αψ(y)∣⟶0. Here unit mass subtracts ψ(y) inside the integral; the displayed estimate is also the Riemann integral triangle estimate for continuous compact functions. F5 on the common compact support now gives u(ψε)→u(ψ). This proves the assertion with step 2.1. If the test or domain is empty, both sides are zero; ε=0 is a limit endpoint, not a defined kernel. Countable Choice enters only through F3, F4 and the Lebesgue regular-distribution interpretation. □

Depends on

Used by

Dependency tree · two levels

55 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