Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge 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 Gagliardo-Nirenberg-Sobolev inequality for 1<p<n

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let n≥2, 1<p<n and p∗=npn−p. There is a constant C(n,p) such that ∥u∥Lp∗(Rn)≤C(n,p) ∥Du∥Lp(Rn) for every u∈W1,p(Rn;K); here ∣Du∣ 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 n≥2 and an exponent 1<p<n; the conjugate p∗=np/(n−p); a field K∈{R,C}.

[F1]

The Sobolev conjugate satisfies p∗>p and 1p∗=1p−1n, so γ:=p(n−1)n−p>1 and (γ−1)pp−1=p∗, γnn−1=p∗ (The Sobolev conjugate exponent and the scaling identity).

[F2]

The endpoint inequality: there is C1(n) with ∥v∥Ln/(n−1)(Rn)≤C1(n)∥Dv∥L1(Rn) for every v∈Cc∞(Rn;K) (The p=1 Gagliardo-Nirenberg-Sobolev inequality).

[F3]

Holder's inequality in the form ∫∣fg∣≤∥f∥r∥g∥s for conjugate exponents r,s (Holder's inequality for integrals, including the endpoint cases).

[F4]

Cc∞(Rn;K) is dense in W1,p(Rn;K) for 1≤p<∞, whose elements are Lp classes with weak gradients in Lp (Compactly supported smooth functions are dense in W^{k,p}(R^n), Integer-order Sobolev spaces and their norms, The space Lp(μ) as the quotient by null functions).

[F5]

Lp∗ is complete and every norm-convergent sequence has an almost-everywhere convergent subsequence (Riesz-Fischer completeness of Lp for 1≤p≤∞, Complex Lp completeness and almost-everywhere subsequences).

[F6]

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: D(g∘f)(a)=Dg(f(a))∘Df(a), Classical derivatives agree with weak derivatives).

[F7]

Dominated convergence: pointwise almost-everywhere convergence under one integrable majorant implies convergence in L1 (Dominated convergence).

[F8]

A compact subset of an open set admits a smooth cutoff equal to 1 on it (A Euclidean bump for a compact set inside an open set). Apply this to a compact neighbourhood of supp⁡u inside a bounded open ball. The resulting support is closed and bounded, hence compact, and the cutoff equals 1 near supp⁡u.

Proof

1.1F1F2F6F8choosealgebra

The smooth real case. Let u∈Cc∞(Rn;R) and choose χ∈Cc∞(Rn) with 0≤χ≤1 and χ=1 on a neighborhood of supp⁡u. Put s:=∣u∣, q:=n/(n−1), and vδ:=χ(u2+δ2)γ/2 for 0<δ≤1. Then vδ∈Cc∞. By [F6], on supp⁡u its gradient has modulus Mδ:=γs(s2+δ2)(γ−2)/2∣Du∣, while off that support the only derivative term is δγDχ. Thus [F2] gives ∥vδ∥Lq≤C1(n)(∫Mδ+δγ∫∣Dχ∣).

1.2F1F2F6F7algebra

Let δj↓0. Since vδj→∣u∣γ pointwise and is dominated by the bounded compactly supported function χ(s2+1)γ/2, [F7] gives ∥vδj∥Lq→∥u∥Lp∗γ. Also Mδj→γsγ−1∣Du∣ almost everywhere. If 1<γ≤2, then Mδ≤γsγ−1∣Du∣; if γ>2, then for 0<δ≤1, Mδ≤Cγ(sγ−1+s)∣Du∣. These majorants are integrable because u is smooth and compactly supported, so [F7] gives ∫Mδj→γ∫sγ−1∣Du∣, while δjγ∫∣Dχ∣→0. Taking limits in the endpoint estimate yields ∥u∥Lp∗γ≤C1(n)γ∫sγ−1∣Du∣.

2.1step 1.2F1F3algebra

Holder [F3] and (γ−1)p/(p−1)=p∗ [F1] give ∫sγ−1∣Du∣≤∥u∥Lp∗γ−1∥Du∥Lp. If u≠0 in Lp∗, divide by ∥u∥Lp∗γ−1; if u=0 almost everywhere, the estimate is immediate. Thus the real smooth case holds with constant C1(n)γ.

3.1step 2.1algebra

The smooth complex case. Let u∈Cc∞(Rn;C) with real and imaginary parts a and b. Applying step 2.1 to both parts and using ∣u∣≤∣a∣+∣b∣ gives ∥u∥Lp∗≤C1(n)γ(∥Da∥Lp+∥Db∥Lp)≤2C1(n)γ∥Du∥Lp.

4.1F4F5step 2.1step 3.1algebra∎

Passage to W1,p by density. Let u∈W1,p(Rn;K). By [F4] choose uk∈Cc∞(Rn;K) with uk→u in W1,p(Rn). Applying step 2.1 (real case) or step 3.1 (complex case) to the differences gives ∥uk−uj∥Lp∗≤C′(n,p)∥D(uk−uj)∥Lp, so (uk) is Cauchy in Lp∗. By [F5] it converges in Lp∗ to a class w, and a subsequence converges to w almost everywhere. Since uk→u in Lp, a further subsequence converges to u almost everywhere, so w=u almost everywhere. Passing to the limit in the smooth inequality gives ∥u∥Lp∗≤C′(n,p)∥Du∥Lp, and renaming this constant proves the claim.

Source notes

This is Kinnunen's Theorem 3.3 for 1<p<n, printed pp. 63-65: the device is to apply the endpoint (p=1) inequality to v=∣u∣γ with γ=p(n−1)/(n−p) and to use the Holder pairing (γ−1)p/(p−1)=p∗. The smooth compact cutoff χ(u2+δ2)γ/2 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

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