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 , the kernels are positive with unit mass and . For every , as . Thus they form an approximate identity.
Facts & Assumptions
Given: Countable Choice, , and wherever it appears.
Countable Choice is the hypothesis carried by the cited integration interface (The Axiom of Countable Choice ()).
For every the kernel satisfies , , and the parabolic scaling identity for every and (Normalisation, parabolic scaling, heat equation and derivative bounds for the heat kernel).
An approximate identity on is a family with , with bounded independently of , and with as for every (An approximate identity on ).
If almost everywhere and almost everywhere for a single integrable nonnegative , then (Dominated convergence).
For a diffeomorphism of open sets and every nonnegative Lebesgue measurable , ; the scaling is such a diffeomorphism with (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions, A linear map of sends Lebesgue measurable sets to Lebesgue measurable sets, with when is invertible and Lebesgue null when it is not).
Proof
Work under [A1] and fix . By [F1] the kernel is strictly positive with , so , and .
Tail estimate: by the scaling clause of [F1] with and with replaced by , ; the diffeomorphism substitution of [F4] therefore gives for every . As the integrands are dominated by the fixed integrable function from step 1.1 and converge at every to , so dominated convergence [F3] gives .
Steps 1.1 and 2.1 verify the three clauses of [F2] for the family : unit integral, the uniform bound , and the vanishing of the tails; hence is an approximate identity.
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- An $L^1$ approximate identity on $\mathbb{R}^n$
- Normalisation, parabolic scaling, heat equation and derivative bounds for the heat kernel
- A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions
- Dominated convergence
- A linear map $T$ of $\mathbb{R}^n$ sends Lebesgue measurable sets to Lebesgue measurable sets, with $\lambda_n(T[E])=|\det T|\,\lambda_n(E)$ when $T$ is invertible and $T[E]$ Lebesgue null when it is not
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
- John K. Hunter, Notes on Partial Differential Equations (revised 18 June 2014, UC Davis) (standard reference, not scraped)
- Jared Speck, MIT 18.152 Introduction to Partial Differential Equations, Class Meeting #5: The Fundamental Solution for the Heat Equation (Fall 2011) (standard reference, not scraped)