Properties of the Heat Fundamental Solution, Solution to the Initial Value Problem #
This file establishes key qualitative properties of the solution formula to the heat equation, involving the convolution of the heat kernel and the initial condition g
Main Results #
heat_maximum_principle: The maximum principle - solutions are bounded by the supremum of the initial dataheatKernel_IVP_limit_textbook: Continuity property - the solution converges to the initial data as t → 0⁺
Key Lemmas #
heatKernel_mass_one_x_sub_y_even: The solution formula integrates to 1 (translation invariance)heatTail_changeOfVariables: Change of variables formula for analyzing kernel tailsgaussian_tail_bound_by_weighted: Analytical bound on Gaussian tail integrals
Reference #
This formalization follows Chapter 7.2.3, "Partial Differential Equations, A First Course" by Professor Rustom Choksi.
Symmetry and Mass Properties #
The heat kernel is an even function in its spatial argument.
The Maximum Principle #
The Maximum Principle for the Heat Equation
If the initial data g satisfies |g(y)| ≤ B for all y, then the solution at any later time and position also satisfies |u(x,t)| ≤ B.
This fundamental property expresses the fact that the heat equation is a diffusion process that redistributes heat but does not create new temperature extrema. The maximum and minimum temperatures can only decrease over time. -
Equations
Instances For
Gaussian Tail Analysis #
This section contains technical lemmas for analyzing the decay of Gaussian tail integrals, which are needed to prove that the solution converges to the initial data as t → 0⁺.
Change of variables formula for heat kernel tail integrals.
Transforms the integral ∫_{|y-x| ≥ δ} Φ(x-y,t) dy into a standard Gaussian tail integral via the substitution z = (x-y)/√(4αt).
Integrability of z² exp(-z²). Used in Gaussian tail bounds.
Helper lemma for splitting integrals into near and far regions.
For even functions, the two-sided tail integral equals twice the one-sided integral.
Key Gaussian tail bound:
This is the analytical estimate that allows us to bound Gaussian tail integrals and prove convergence as t → 0.
Convergence to Initial Data #
This section proves that the solution u(x,t) → g(x) as t → 0⁺, establishing that the convolution formula satisfies the initial condition.
Main Theorem: The solution converges to the initial data as t → 0⁺
Given bounded, continuous, integrable initial data g, the solution u(x,t) = ∫ Φ(x-y,t) g(y) dy converges to g(x) as t → 0⁺.
Proof Strategy #
The proof follows the textbook approach:
Rewrite using mass-one property: |u(x,t) - g(x)| = |∫ Φ(x-y,t)[g(y) - g(x)] dy|
Split into near and far regions: Choose δ > 0 from continuity of g at x.
- Near: |y-x| < δ where |g(y) - g(x)| < ε/2
- Far: |y-x| ≥ δ where we use boundedness
Estimate near integral: ∫{near} Φ |g(y) - g(x)| dy ≤ (ε/2) ∫{near} Φ dy ≤ ε/2
Estimate far integral using Gaussian tail bounds: ∫{far} Φ |g(y) - g(x)| dy ≤ 2B ∫{far} Φ dy ≤ C√t
Choose t small enough: For t < δ₀, have C√t < ε/2, giving total < ε.