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 p=1 Gagliardo-Nirenberg-Sobolev inequality
Statement
Assume Countable Choice (The Axiom of Countable Choice ()). Let . There is a constant such that for every .
Facts & Assumptions
Given: Countable Choice; an integer ; a field ; and a function .
Vector-valued fundamental theorem: if is differentiable with integrable derivative on an interval, then (If is differentiable with integrable then ; and a bounded derivative makes Lipschitz).
Tonelli's theorem on sigma-finite products: iterated integrals of nonnegative product-measurable functions may be computed in any order and partial integrals may be renamed (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).
Holder's inequality: if and the indicated spaces are over one measure space, then (Generalized Holder inequality puts products into ).
is the quotient by almost-everywhere null functions, and complex-valued Lebesgue spaces use the componentwise conventions (The space as the quotient by null functions, Complex Lp classes and Euclidean test-function conventions).
Countable Choice, assumed for the measure-theoretic interfaces above (The Axiom of Countable Choice ()).
Proof
Sections and pointwise bounds. Fix and write for the coordinates other than . For each fixed , the section is smooth and compactly supported, so the fundamental theorem [F1] applied on an interval containing the support and the estimate give for every .
The product-integral lemma. For and nonnegative integrable functions on , each independent of the -th coordinate, one has . For this is Tonelli [F2]. For , integrate first in and apply [F3] with equal exponents to the factors . Put for ; the resulting upper bound is . Holder with exponents and bounds this by . The induction hypothesis in dimension , followed by Tonelli, gives the required product of the . Zero integrals make the integrand zero almost everywhere, so they cause no division.
Product and root. Multiplying the pointwise inequalities of step 1.1 and taking the -th root gives for every .
Apply step 1.2 with and . Tonelli gives . Step 2.1 therefore yields . Taking the -th power proves the assertion with .
Source notes
Kinnunen's Theorem 3.3 computes the product of the one-dimensional primitive estimates and integrates one variable at a time with the generalized Holder inequality for factors; the proof above records a dimension induction for the product-integral inequality. The constant obtained is , which is not sharp but is dimension-only as asserted. The argument is the case separated in the plan because the power-and-Holder reduction used for is unavailable at the endpoint.
Depends on
- Generalized Holder inequality puts products into $L^r$
- If $f : [a,b] \to \mathbb{R}^m$ is differentiable with integrable $f'$ then $\int_a^b f' = f(b)-f(a)$; and a bounded derivative makes $f$ Lipschitz
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- The space $L^p(\mu)$ as the quotient by null functions
- Complex Lp classes and Euclidean test-function conventions
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Subcritical compactness for W^1,p₀ on arbitrary bounded open sets Corollary
- The Sobolev inequality for zero-boundary Sobolev closures on open sets Corollary
- Outward dilation defeats subcritical inclusion and homogeneous Poincare on Euclidean space Counterexample
- Higher-order Sobolev embedding Theorem
- Sobolev embedding on bounded extension domains for p<n Theorem
- The Gagliardo-Nirenberg-Sobolev inequality for 1<p<n Theorem
- The Rellich--Kondrachov theorem for 1≤ p<n on bounded extension domains Theorem
- Weak maximum principle for coercive divergence-form equations Theorem
Dependency tree · two levels
59 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
- Juha Kinnunen, Sobolev Spaces (Aalto University, 2026, complete graduate lecture notes) (standard reference, not scraped)
- John K. Hunter, Notes on Partial Differential Equations (UC Davis, revised 18 June 2014, complete 242-page two-quarter notes) (standard reference, not scraped)
- Richard S. Laugesen, Linear Analysis and Partial Differential Equations (University of Illinois, complete 158-page graduate notes) (standard reference, not scraped)