Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (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.

Gaussian kernels form an approximate identity

Statement

Assume Countable Choice. For n≥1, the kernels Γt are positive with unit mass and ∥Γt∥1=1. For every δ>0, ∫∣x∣>δΓ(x,t) dx→0 as t↓0. Thus they form an L1 approximate identity.

Facts & Assumptions

Given: Countable Choice, n≥1, and δ>0 wherever it appears.

[A1]

Countable Choice is the hypothesis carried by the cited integration interface (The Axiom of Countable Choice (ACω)).

[F1]

For every t>0 the kernel satisfies Γ(⋅,t)>0, ∫RnΓ(x,t) dx=1, and the parabolic scaling identity Γ(λx,λ2t)=λ−nΓ(x,t) for every λ>0 and x∈Rn (Normalisation, parabolic scaling, heat equation and derivative bounds for the heat kernel).

[F2]

An L1 approximate identity on Rn is a family (Kε)ε>0⊆L1(Rn) with ∫Kε=1, with ∥Kε∥1 bounded independently of ε, and with ∫∣x∣>δ∣Kε∣→0 as ε→0+ for every δ>0 (An L1 approximate identity on Rn).

[F3]

If fn→f almost everywhere and ∣fn∣≤g almost everywhere for a single integrable nonnegative g, then ∫fn→∫f (Dominated convergence).

[F4]

For a C1 diffeomorphism T:U→V of open sets and every nonnegative Lebesgue measurable f:V→[0,∞], ∫Vf(y) dy=∫Uf(T(x))∣det⁡DT(x)∣ dx; the scaling x=t z is such a diffeomorphism with ∣det⁡DT∣=tn/2 (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions, A linear map T of Rn sends Lebesgue measurable sets to Lebesgue measurable sets, with λn(T[E])=∣det⁡T∣ λn(E) when T is invertible and T[E] Lebesgue null when it is not).

Proof

technique · direct
1.1A1F1given

Work under [A1] and fix t>0. By [F1] the kernel is strictly positive with ∫RnΓ(x,t) dx=1, so Γt∈L1(Rn), Γt>0 and ∥Γt∥1=1.

2.1step 1.1F1F3F4given

Tail estimate: by the scaling clause of [F1] with λ=t and with x replaced by x/t, Γ(x,t)=t−n/2Γ(x/t,1); the diffeomorphism substitution x=t z of [F4] therefore gives ∫∣x∣>δΓ(x,t) dx=∫∣z∣>δ/tΓ(z,1) dz for every δ>0. As t↓0+ the integrands 1{∣z∣>δ/t}Γ(z,1) are dominated by the fixed integrable function Γ(⋅,1) from step 1.1 and converge at every z≠0 to 0, so dominated convergence [F3] gives ∫∣z∣>δ/tΓ(z,1) dz→0.

3.1step 1.1step 2.1F2given∎

Steps 1.1 and 2.1 verify the three clauses of [F2] for the family Kε:=Γ(⋅,ε): unit integral, the uniform L1 bound ∥Kε∥1=1, and the vanishing of the tails; hence (Γ(⋅,t))t>0 is an L1 approximate identity.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

67 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