Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedPipeline-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.

The heat Cauchy problem for Lp data

Statement

Assume Countable Choice, let n≥1 and 1≤p<∞. For every f∈Lp(Rn) the heat evolution of The heat evolution Ht of initial data satisfies: (i) ∥Htf−f∥p→0 as t↓0+; (ii) ∥Htf∥p≤∥f∥p for every t>0; (iii) the semigroup law Ht+s=HtHs on Lp for all s,t≥0, with H0 the identity.

Facts & Assumptions

Given: Countable Choice, n≥1, 1≤p<∞, f∈Lp(Rn), and s,t>0.

[A1]

Countable Choice is the hypothesis carried by the integration and approximate-identity suppliers below (The Axiom of Countable Choice (ACω)).

[F1]

For 1≤p≤∞ and g∈Lp(Rn), Htg is the Lp class of x↦∫Γ(x−y,t)g(y) dy, defined almost everywhere, each Ht is complex-linear, and H0 is the identity on Lp (The heat evolution Ht of initial data).

[F2]

For every t>0 the kernel satisfies ∥Γt∥1=1 and the family (Γt)t>0 is an L1 approximate identity (Normalisation, parabolic scaling, heat equation and derivative bounds for the heat kernel).

[F3]

For all s,t>0, Γt∗Γs=Γt+s as functions on Rn, the convolution converging absolutely everywhere (The heat kernel semigroup identity Γt∗Γs=Γt+s).

[F4]

Assume countable choice; if (Kε) is an L1 approximate identity and f∈Lp with 1≤p<∞, then ∥f∗Kε−f∥p→0 as ε→0+ (Every L1 approximate identity converges to the identity in Lp for 1≤p<∞).

[F5]

Assume Countable Choice; for 1≤p,q,r≤∞ with 1/r=1/p+1/q−1, convolution gives ∥f∗g∥r≤∥f∥p∥g∥q (Young's convolution inequality under Countable Choice).

[F6]

On sigma-finite product spaces, Tonelli's theorem holds for nonnegative product-measurable functions and Fubini's theorem for L1 functions (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product, Fubini's theorem for L^1 functions on a sigma-finite product); the Lebesgue measure on R2n is the completed product of two copies of λn (The Euclidean Lebesgue measure is the completion of the product of the factor Lebesgue measures).

Proof

technique · direct
1.1A1F1F2F5givenalgebra

Contraction: by [F1] the class Htf is represented by the convolution Γt∗f, so Young's inequality [F5] with the exponent triple (p,1,p), which satisfies 1/p=1/p+1/1−1, gives ∥Htf∥p≤∥Γt∥1∥f∥p=∥f∥p by [F2]; at t=0, H0f=f has the same norm.

2.1step 1.1F1F2F4given

Strong convergence at time zero: by [F2] the family (Γt)t>0 is an L1 approximate identity, so the published Lp approximate-identity theorem [F4] gives ∥f∗Γt−f∥p→0 as t↓0+; by [F1] the class Htf is exactly the class of f∗Γt, so ∥Htf−f∥p→0, which is (i).

2.2step 1.1F1F3F5F6givenalgebra

Semigroup law: assume first s,t>0 and put g(z):=∫Γs(z−y)f(y) dy, a representative of Hsf defined for almost every z by [F1]. For fixed x consider the nonnegative function (y,z)↦∣Γt(x−z)∣ Γs(z−y)∣f(y)∣ on Rn×Rn; by the identification of [F6] and Tonelli's theorem, its iterated integral equals ∫Rn∣f(y)∣(∫RnΓt(x−z)Γs(z−y) dz)dy, and the inner integral is (Γt∗Γs)(x−y)=Γt+s(x−y) by [F3], so the whole integral is (Γt+s∗∣f∣)(x), finite for almost every x because Γt+s∈L1 and Young's inequality [F5] applies. Hence the signed double integral is absolutely convergent, Fubini [F6] applies, and ∫Γt(x−z)g(z) dz=∫f(y)Γt+s(x−y) dy for almost every x; that is, Ht(Hsf)=Ht+sf. If s=0 or t=0 the identity is the operator identity H0=id of [F1], so the semigroup law holds for all s,t≥0, which is (iii).

3.1step 1.1step 2.1step 2.2given∎

Steps 1.1, 2.1 and 2.2 prove the contraction bound (ii), the strong convergence (i) and the semigroup law (iii) for every f∈Lp(Rn), 1≤p<∞, which is the whole statement.

Depends on

Used by

Dependency tree · two levels

58 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