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 p=1 Gagliardo-Nirenberg-Sobolev inequality

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let n≥2. There is a constant C(n) such that ∥u∥Ln/(n−1)(Rn)≤C(n) ∥Du∥L1(Rn) for every u∈Cc∞(Rn;K).

Facts & Assumptions

Given: Countable Choice; an integer n≥2; a field K∈{R,C}; and a function u∈Cc∞(Rn;K).

[F1]

Vector-valued fundamental theorem: if f is differentiable with integrable derivative on an interval, then ∫abf′=f(b)−f(a) (If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz).

[F2]

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).

[F3]

Holder's inequality: if 1/r=1/p+1/q and the indicated spaces are over one measure space, then ∥fg∥r≤∥f∥p∥g∥q (Generalized Holder inequality puts products into Lr).

[F4]

Lp is the quotient by almost-everywhere null functions, and complex-valued Lebesgue spaces use the componentwise conventions (The space Lp(μ) as the quotient by null functions, Complex Lp classes and Euclidean test-function conventions).

[F5]

Countable Choice, assumed for the measure-theoretic interfaces above (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1F1F4givenalgebra

Sections and pointwise bounds. Fix j∈{1,…,n} and write x^j for the coordinates other than xj. For each fixed x^j, the section t↦u(x1,…,t,…,xn) is smooth and compactly supported, so the fundamental theorem [F1] applied on an interval containing the support and the estimate ∣∂ju∣≤∣Du∣ give ∣u(x)∣≤∫R∣Du(x1,…,t,…,xn)∣ dt=:Pj(x^j) for every x.

1.2F2F3algebra

The product-integral lemma. For d≥2 and nonnegative integrable functions fj on Rd−1, each independent of the j-th coordinate, one has ∫Rd∏j=1dfj(x^j)1/(d−1) dx≤∏j=1d(∫fj)1/(d−1). For d=2 this is Tonelli [F2]. For d>2, integrate first in xd and apply [F3] with d−1 equal exponents to the factors j<d. Put gj:=∫Rfj dxd for j<d; the resulting upper bound is ∫Rd−1fd1/(d−1)∏j<dgj1/(d−1). Holder with exponents d−1 and (d−1)/(d−2) bounds this by (∫fd)1/(d−1)(∫∏j<dgj1/(d−2))(d−2)/(d−1). The induction hypothesis in dimension d−1, followed by Tonelli, gives the required product of the ∫fj. Zero integrals make the integrand zero almost everywhere, so they cause no division.

2.1F5step 1.1algebra

Product and root. Multiplying the n pointwise inequalities of step 1.1 and taking the (n−1)-th root gives ∣u(x)∣n/(n−1)≤∏j=1nPj(x^j)1/(n−1) for every x.

3.1F2F4step 2.1step 1.2algebra∎

Apply step 1.2 with d=n and fj=Pj. Tonelli gives ∫Rn−1Pj=∫Rn∣Du∣=∥Du∥1<∞. Step 2.1 therefore yields ∫∣u∣n/(n−1)≤∥Du∥1n/(n−1). Taking the (n−1)/n-th power proves the assertion with C(n)=1.

Source notes

Kinnunen's Theorem 3.3 computes the product of the n one-dimensional primitive estimates and integrates one variable at a time with the generalized Holder inequality for (n−1) factors; the proof above records a dimension induction for the product-integral inequality. The constant obtained is 1, which is not sharp but is dimension-only as asserted. The argument is the case p=1 separated in the plan because the power-and-Holder reduction used for 1<p<n is unavailable at the endpoint.

Depends on

Used by

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