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 Gagliardo-Nirenberg-Sobolev inequality for
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let , and . There is a constant such that for every ; here is the Euclidean norm of the weak gradient.
Facts & Assumptions
Given: The Axiom of Choice, whose Countable-Choice consequence is used for the density and completeness interfaces; integers and an exponent ; the conjugate ; a field .
The Sobolev conjugate satisfies and , so and , (The Sobolev conjugate exponent and the scaling identity).
The endpoint inequality: there is with for every (The p=1 Gagliardo-Nirenberg-Sobolev inequality).
Holder's inequality in the form for conjugate exponents (Holder's inequality for integrals, including the endpoint cases).
is dense in for , whose elements are classes with weak gradients in (Compactly supported smooth functions are dense in W^{k,p}(R^n), Integer-order Sobolev spaces and their norms, The space as the quotient by null functions).
is complete and every norm-convergent sequence has an almost-everywhere convergent subsequence (Riesz-Fischer completeness of for , Complex Lp completeness and almost-everywhere subsequences).
The classical chain rule computes the gradient of a smooth composition, and for smooth functions the classical derivatives are the weak derivatives (The chain rule for total derivatives: , Classical derivatives agree with weak derivatives).
Dominated convergence: pointwise almost-everywhere convergence under one integrable majorant implies convergence in (Dominated convergence).
A compact subset of an open set admits a smooth cutoff equal to on it (A Euclidean bump for a compact set inside an open set). Apply this to a compact neighbourhood of inside a bounded open ball. The resulting support is closed and bounded, hence compact, and the cutoff equals near .
Proof
The smooth real case. Let and choose with and on a neighborhood of . Put , , and for . Then . By [F6], on its gradient has modulus , while off that support the only derivative term is . Thus [F2] gives .
Let . Since pointwise and is dominated by the bounded compactly supported function , [F7] gives . Also almost everywhere. If , then ; if , then for , . These majorants are integrable because is smooth and compactly supported, so [F7] gives , while . Taking limits in the endpoint estimate yields .
Holder [F3] and [F1] give . If in , divide by ; if almost everywhere, the estimate is immediate. Thus the real smooth case holds with constant .
The smooth complex case. Let with real and imaginary parts and . Applying step 2.1 to both parts and using gives .
Passage to by density. Let . By [F4] choose with in . Applying step 2.1 (real case) or step 3.1 (complex case) to the differences gives , so is Cauchy in . By [F5] it converges in to a class , and a subsequence converges to almost everywhere. Since in , a further subsequence converges to almost everywhere, so almost everywhere. Passing to the limit in the smooth inequality gives , and renaming this constant proves the claim.
Source notes
This is Kinnunen's Theorem 3.3 for , printed pp. 63-65: the device is to apply the endpoint () inequality to with and to use the Holder pairing . The smooth compact cutoff makes the endpoint application legitimate; dominated convergence removes the regularisation, including the cutoff-gradient term, before the density passage. Hunter's Theorems 3.28 and 3.31 and Teschl's Theorem 9.22 record the same proof; Laugesen's Theorem 3.17 is the endpoint form used here as the p=1 input.
Depends on
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The space $L^p(\mu)$ as the quotient by null functions
- Integer-order Sobolev spaces and their norms
- The Sobolev conjugate exponent and the scaling identity
- The p=1 Gagliardo-Nirenberg-Sobolev inequality
- Holder's inequality for integrals, including the endpoint cases
- Riesz-Fischer completeness of $L^p$ for $1 \le p \le \infty$
- Compactly supported smooth functions are dense in W^{k,p}(R^n)
- The chain rule for total derivatives: $D(g\circ f)(a)=Dg(f(a))\circ Df(a)$
- Dominated convergence
- Test function space d of an open set
- A Euclidean bump for a compact set inside an open set
- Classical derivatives agree with weak derivatives
- Complex Lp completeness and almost-everywhere subsequences
Used by
Dependency tree · two levels
70 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)
- Gerald Teschl, Partial Differential Equations: From Classical to Modern (archived 2025 author manuscript) (standard reference, not scraped)