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

Monotonicity and Lp contractivity of the heat flow

Statement

Assume Countable Choice, let n≥1 and 1≤p≤∞. If f,g∈Lp(Rn) satisfy f≤g almost everywhere, then Htf≤Htg almost everywhere for every t>0; and ∥Htf∥p≤∥f∥p for every f∈Lp(Rn) and every t≥0.

Facts & Assumptions

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

[A1]

Countable Choice is the hypothesis carried by the evolution and convolution suppliers below (The Axiom of Countable Choice (ACω)).

[F1]

Each Ht is a complex-linear operator on Lp(Rn), H0 is the identity, and Htf is the class of Γt∗f (The heat evolution Ht of initial data).

[F2]

If f∈Lp satisfies f≥0 almost everywhere, then Htf≥0 almost everywhere (Mass conservation and positivity of the heat flow).

[F3]

For 1≤p<∞ and f∈Lp, ∥Htf∥p≤∥f∥p (The heat Cauchy problem for Lp data).

[F4]

For 1≤p,q,r≤∞ with 1/r=1/p+1/q−1 and f∈Lp, g∈Lq, ∥f∗g∥r≤∥f∥p∥g∥q; with exponent triple (p,1,p) this bounds convolution by an L1 kernel (Young's convolution inequality under Countable Choice).

Proof

technique · direct
1.1A1F1F2given

Order preservation: assume f≤g almost everywhere and fix t>0. The difference g−f is a class in Lp with g−f≥0 almost everywhere, so Ht(g−f)≥0 almost everywhere by [F2]; by linearity of Ht in [F1], Htg−Htf=Ht(g−f) as classes, so any representatives satisfy Htf≤Htg almost everywhere, the comparison being independent of representatives because changing them on null sets does not affect an almost-everywhere inequality.

2.1step 1.1F1F3F4givenalgebra

Contractivity: for 1≤p<∞ the bound ∥Htf∥p≤∥f∥p for every t>0 is [F3], while at t=0 it is the identity case of [F1]; for p=∞ Young's inequality [F4] with the exponent triple (∞,1,∞), which satisfies 1/∞=1/∞+1−1, gives ∥Htf∥∞≤∥Γt∥1∥f∥∞=∥f∥∞ for every t>0, and again ∥H0f∥∞=∥f∥∞.

3.1step 1.1step 2.1given∎

Steps 1.1 and 2.1 prove the almost-everywhere monotonicity for f≤g and the Lp contraction for all t≥0 and all 1≤p≤∞.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

31 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