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 contractivity of the heat flow
Statement
Assume Countable Choice, let and . If satisfy almost everywhere, then almost everywhere for every ; and for every and every .
Facts & Assumptions
Given: Countable Choice, , , , and .
Countable Choice is the hypothesis carried by the evolution and convolution suppliers below (The Axiom of Countable Choice ()).
Each is a complex-linear operator on , is the identity, and is the class of (The heat evolution of initial data).
If satisfies almost everywhere, then almost everywhere (Mass conservation and positivity of the heat flow).
For and , (The heat Cauchy problem for data).
For with and , , ; with exponent triple this bounds convolution by an kernel (Young's convolution inequality under Countable Choice).
Proof
Order preservation: assume almost everywhere and fix . The difference is a class in with almost everywhere, so almost everywhere by [F2]; by linearity of in [F1], as classes, so any representatives satisfy almost everywhere, the comparison being independent of representatives because changing them on null sets does not affect an almost-everywhere inequality.
Contractivity: for the bound for every is [F3], while at it is the identity case of [F1]; for Young's inequality [F4] with the exponent triple , which satisfies , gives for every , and again .
Steps 1.1 and 2.1 prove the almost-everywhere monotonicity for and the contraction for all and all .
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
- Gerald Teschl, Partial Differential Equations: From Classical to Modern (2025 archived author manuscript, AMS Graduate Studies in Mathematics) (standard reference, not scraped)
- 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)