Alphabeta Math
Pipeline-generated
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.

Sobolev Poincare and Morrey Inequalities

1 · Prerequisites

2 · Summary

This page develops the first-order Sobolev inequalities and the Poincare and Morrey inequalities on Euclidean domains. The Sobolev conjugate p∗=np/(n−p) is defined with its scaling identity and iterated form, and the endpoint p=1 Gagliardo-Nirenberg-Sobolev inequality is proved by multiplying the n one-dimensional primitive bounds. The pointwise potential bound for compactly supported smooth functions and the W1,p ball-mean oscillation estimate by the Riesz potential of the gradient provide the analytic engine: they are the substitutes for the maximal-function and p>n arguments of the classical treatments, and they are proved from polar coordinates, Fubini, and the smooth approximation of Sobolev classes. The 1<p<n inequality is obtained from the p=1 case through the ∣u∣γ device with γ=p(n−1)/(n−p) and Holder's inequality, first for compactly supported smooth functions and then for all of W1,p(Rn) by density and completeness; the zero-boundary closure corollary follows by extension by zero.

The Poincare theory is developed for three domain classes. On a ball the convex-domain Poincare-Wirtinger corollary gives the mean-zero estimate with an explicit dimension-only constant linear in the radius. On bounded John domains the John curve is converted into a bounded-overlap chain of balls; telescoping the ball means along the chain, bounding the differences by the ball Poincare inequality, and summing with the truncated Riesz kernel bound gives the mean-zero inequality for every 1≤p<∞. Bounded convex domains and the cone-condition classes are compared with the John class, and a positive-measure zero set normalisation is shown to control the mean, giving the zero-set Poincare inequality. On bounded connected extension domains the mean-zero estimate for 1<p<n is proved by an extension-cutoff-mollification argument with Arzela-Ascoli, and the Sobolev-Poincare form at the critical exponent p∗ follows from the extension-domain embedding. On the whole space W1,p does not include into Lq for q<p, even with the full Sobolev norm; an explicit power tail witnesses the set-inclusion failure, while dilation disproves the continuous bound and the homogeneous Poincare estimate; the consequences are recorded on the examples page.

Morrey's inequality for p>n is proved by combining the ball oscillation bound with Holder's inequality in the exponent 1−n/p, comparing ball means at two scales, and identifying the continuous representative by Lebesgue differentiation; the same computation yields the local Holder bound with the norm taken on a fixed doubled ball. At p=∞ the W1,∞ classes of a bounded convex domain are identified with Lipschitz classes through a multiplicity estimate for segment integrals, a.e.-pair Lipschitz bounds, Lebesgue points and the dense-subset extension theorem. The higher-order embedding iterates the first-order Sobolev and Morrey inequalities through the lower-order weak derivatives, covering the subcritical, critical and supercritical orders, and the Sobolev algebra property above the critical index follows from the higher-order Leibniz identity together with the iterated embeddings. Closing remarks record the p=n endpoint, where the critical space embeds into every finite Lq but not into L∞, and the domain classes covered by the mean-zero Poincare inequality.

Conventions: Ω⊆Rn is open, n≥2, K is R or C, and ∣Du∣ denotes the Euclidean norm of the weak gradient. The Axiom of Choice is stated on the items whose proofs invoke the ACL, extension, density or Arzela-Ascoli interfaces; the mean-zero estimates are stated with their exact exponent ranges, and the constants depend only on the data named in each statement.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

The Sobolev conjugate exponent and the scaling identity

Definition

Let n≥2 and 1≤p<n. The Sobolev conjugate of p is p∗=npn−p. The denominator n−p is positive, so p∗ is a finite real number greater than 1. Conjugate exponents in the sense of Conjugate exponents, including the endpoint conventions and real powers in the sense of Real powers for positive bases, with the zero-base positive-exponent convention are used below.

The following elementary identities are part of the definition and record how p∗ is used. 1p∗=n−pnp=1p−1n,p∗−p=np−p(n−p)n−p=p2n−p>0, so p∗>p and 1/p∗+1/n=1/p; in particular p∗=n/(n−1) when p=1. Equivalently p∗=n/(np−1).

For k≥1 with kp<n the k-fold Sobolev conjugate pk∗ is defined recursively by 1p1∗=1p−1n,1pj+1∗=1pj∗−1n(1≤j<k). Induction on j gives 1pj∗=1p−jn and hence pk∗=npn−kp; the recursion is well posed because jp<n for j≤k keeps every pj∗ finite and greater than 1.

Finally, the map p↦p∗=n/(np−1) is continuous on (1,n), since n/p−1>0 there and the reciprocal and affine maps are continuous; it is strictly increasing on (1,n), because p↦n/p is strictly decreasing and t↦n/(t−1) is strictly decreasing on (1,∞); and p∗→∞ as p→n−, because n/p−1→0+. No finite Sobolev conjugate is attached to p≥n: for p=n the formula has denominator 0, and for p>n the expression np/(n−p) is negative.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Pointwise potential bound for compactly supported smooth functions

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let n≥2 and u∈Cc∞(Rn;K), K∈{R,C}. Then for every x∈Rn, ∣u(x)∣≤1σ(Sn−1)∫Rn∣Du(y)∣ ∣x−y∣1−n dy, where σ is the polar surface measure of The polar surface set function on the unit sphere and ∣Du∣ is the Euclidean norm of the gradient. In particular ∣u(x)∣≤C(n)∫Rn∣Du(y)∣ ∣x−y∣1−ndy.

Facts & Assumptions

Given: Countable Choice; an integer n≥2; a field K∈{R,C}; a function u∈Cc∞(Rn;K); the polar surface measure σ on Sn−1; and a point x∈Rn.

[F2]

Polar coordinates: for every Borel measurable f:Rn→[0,∞], ∫Rnf dλn=∫0∞∫Sn−1f(rω)rn−1 dσ(ω) dr (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma).

[F4]

For a vector-valued differentiable f with integrable derivative, ∫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).

[F6]

Every Euclidean ball has positive finite Lebesgue measure: 0<λ(B(x,r))<∞ (Euclidean balls have positive finite Lebesgue measure).

Proof

technique · direct
1.1F4givenalgebra

The radial primitive. Fix ω∈Sn−1 and put g(t):=u(x+tω) for t≥0. Since u is smooth and compactly supported, g is differentiable with g′(t)=Du(x+tω)⋅ω, and g(t)=0 for all t≥T once T is so large that x+[0,∞)ω leaves the support of u. Applying the fundamental theorem [F4] on [0,T] and letting T→∞ gives g(0)=−∫0∞g′(t) dt, hence ∣u(x)∣≤∫0∞∣Du(x+tω)∣ dt.

1.2F2F6algebra

Surface normalisation. By [F2] applied to 1B(0,1), λn(B(0,1))=σ(Sn−1)∫01tn−1dt=σ(Sn−1)/n. Thus [F6] gives 0<σ(Sn−1)=nλn(B(0,1))<∞.

1.3F2F3givenalgebra

Translation to polar coordinates at x. Define G(y):=∣Du(y)∣ ∣x−y∣1−n for y≠x and G(x):=0; this is Borel measurable because ∣Du∣ is continuous and y↦∣x−y∣1−n is Borel. Applying [F2] to the nonnegative Borel function z↦G(x+z) and then [F3] gives ∫Sn−1∫0∞∣Du(x+tω)∣ dt dσ(ω)=∫Sn−1∫0∞G(x+tω)tn−1 dt dσ(ω)=∫RnG(y) dy, where the first equality uses ∣x−(x+tω)∣1−n=t1−n and the two integrations are the iterated polar integral of the nonnegative function z↦G(x+z); the singularity at y=x is a single point and does not affect the value of the integral.

2.1F5F7step 1.1algebra

Integrating the pointwise bound over the sphere. The function (t,ω)↦∣Du(x+tω)∣ is continuous on [0,∞)×Sn−1, hence product measurable, and it is nonnegative; by Tonelli [F5] its iterated integral over the sigma-finite product [0,∞)×Sn−1 is well defined. Integrating the inequality of step 1.1 over Sn−1 against σ therefore gives ∣u(x)∣ σ(Sn−1)≤∫Sn−1∫0∞∣Du(x+tω)∣ dt dσ(ω).

3.1step 1.2step 2.1step 1.3algebra∎

Conclusion. Combining steps 2.1 and 1.3 with the positivity of σ(Sn−1) from step 1.2 gives ∣u(x)∣≤1σ(Sn−1)∫Rn∣Du(y)∣∣x−y∣1−n dy, and C(n):=1/σ(Sn−1)=1/(nλn(B(0,1))) is the asserted dimension-only constant.

Source notes

Kinnunen's Lemma 5.22 proves the corresponding oscillation bound on a ball by slicing spheres and changing variables; the proof above uses the same radial computation in the global polar-coordinate form suited to compactly supported functions, with the sphere average normalised by σ(Sn−1). Hunter's display (3.14) gives the related ball-averaged oscillation bound; the compact-support ray argument above gives the global estimate with 1/σ(Sn−1).

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

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.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

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.

CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Sobolev inequality for zero-boundary Sobolev closures on open sets

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let Ω⊆Rn be open, n≥2, 1≤p<n and p∗=npn−p. There is C(n,p) with ∥u∥Lp∗(Ω)≤C(n,p)∥Du∥Lp(Ω) for every u∈W01,p(Ω;K).

Facts & Assumptions

Given: The Axiom of Choice; an open set Ω⊆Rn; n≥2; 1≤p<n; a field K∈{R,C}; and a class u∈W01,p(Ω;K).

[F1]

W01,p(Ω) is the closure of Cc∞(Ω) in the W1,p norm, and its elements are Lp classes with weak gradients in Lp (Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms).

[F2]

Extension by zero sends W01,p(Ω;K) into W1,p(Rn;K), the weak derivatives of the extension are the zero extensions of the weak derivatives, and all Lp component norms are preserved (Zero extension of W_0^{1,p} has no boundary derivative).

[F3]

For 1<p<n, the whole-space inequality holds for every v∈W1,p(Rn) (The Gagliardo-Nirenberg-Sobolev inequality for 1<p<n). For p=1 it holds for v∈Cc∞ (The p=1 Gagliardo-Nirenberg-Sobolev inequality). Here p∗=np/(n−p) (The Sobolev conjugate exponent and the scaling identity).

[F4]

Every Lr space for 1≤r≤∞ is complete and norm convergence has an almost-everywhere convergent subsequence (Riesz-Fischer completeness of Lp for 1≤p≤∞, Complex Lp completeness and almost-everywhere subsequences).

Proof

technique · direct
1.1F1F2givenalgebra

Zero extension. Let E0u be the extension of u by zero. By [F2], E0u∈W1,p(Rn;K), its weak gradient is the zero extension of Du, and ∥E0u∥Lp∗(Rn)=∥u∥Lp∗(Ω), ∥D(E0u)∥Lp(Rn)=∥Du∥Lp(Ω) componentwise.

2.1F1F2F3F4step 1.1algebra∎

For 1<p<n, apply [F3] to E0u and use step 1.1. For p=1, choose φj∈Cc∞(Ω) converging to u in W1,1(Ω) by [F1]; their zero extensions converge to E0u in W1,1(Rn) by [F2]. The endpoint estimate [F3] applied to differences shows that these extensions are Cauchy in Ln/(n−1). By [F4] their limit in that space exists; an almost-everywhere subsequence, followed by an L1 almost-everywhere subsequence, identifies it with E0u. Passing to the limit in the endpoint estimate gives ∥E0u∥n/(n−1)≤C(n)∥D(E0u)∥1. Step 1.1 transfers both cases to Ω, proving the assertion.

Source notes

The corollary is the zero-trace case of the whole-space Sobolev inequality, Kinnunen's Remark 3.4(3) and Laugesen's Theorem 3.18: the extension by zero has the same weak gradient up to the boundary of Ω, so the whole-space result transfers verbatim. At p=1 the smooth endpoint estimate is extended by the closure approximation and Ln/(n−1) completeness.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Poincare inequality on a ball

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let n≥1, B=B(x0,r)⊆Rn with r>0, 1≤p<∞, and u∈W1,p(B;K) with ball average uB=∣B∣−1∫Bu. Then ∥u−uB∥Lp(B)≤C(n,p) r ∥Du∥Lp(B).

Facts & Assumptions

Given: The Axiom of Choice; an integer n≥1; a ball B=B(x0,r)⊆Rn with r>0; an exponent 1≤p<∞; a field K∈{R,C}; and a class u∈W1,p(B;K).

[F1]

The convex-domain Poincare-Wirtinger estimate: for every open bounded convex nonempty Ω and every v∈W1,p(Ω;K), ∥v−vΩ∥Lp(Ω)≤C(n)diam⁡(Ω)∥Dv∥Lp(Ω) with C(n)=2(2n−1)/n, where vΩ=∣Ω∣−1∫Ωv (Poincare-Wirtinger on bounded convex domains by the direct pairwise argument).

[F2]

The ball average uB=∣B∣−1∫Bu is the mean of u over B; it is defined because every ball has positive finite Lebesgue measure (The average of a locally integrable function over a Euclidean ball, Euclidean balls have positive finite Lebesgue measure).

[F3]

W1,p(B;K) consists of the Lp classes with weak first derivatives in Lp, and Lp consists of almost-everywhere classes (Integer-order Sobolev spaces and their norms, The space Lp(μ) as the quotient by null functions).

Proof

technique · direct
1.1F2F3givenalgebra

The ball is admissible for [F1]. The ball B=B(x0,r) is open, bounded, convex and nonempty, and its diameter is diam⁡(B)=2r; the class u lies in W1,p(B;K) by hypothesis. Its mean over B as a convex set is exactly the ball average uB=∣B∣−1∫Bu of [F2], because both are ∣B∣−1∫Bu; the value is a finite element of K by [F2] and [F3].

2.1F1step 1.1algebra∎

Applying the convex-domain estimate. By [F1] applied to Ω=B and v=u, ∥u−uB∥Lp(B)≤C(n)diam⁡(B)∥Du∥Lp(B)=2C(n) r ∥Du∥Lp(B). Hence the asserted inequality holds with the dimension-and-exponent constant C(n,p):=2C(n)=4(2n−1)/n, which depends only on n and p.

Source notes

Kinnunen proves the ball case by the pointwise potential estimate and the maximal-function bound; Laugesen records it as an exercise with a constant linear in r. The proof above derives the ball statement from the more general convex-domain Poincare-Wirtinger corollary proved earlier on this page, with the explicit constant 4(2n−1)/n, which is not sharp but is dimension-only and linear in r as asserted.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let Ω⊆Rn be open and bounded in one direction: there are a unit vector e and a<b with a<x⋅e<b for every x∈Ω. Let 1≤p<∞. Then ∥u∥Lp(Ω)≤C(p) (b−a) ∥Du∥Lp(Ω) for every u∈W01,p(Ω;K).

Facts & Assumptions

Given: Countable Choice; an open set Ω⊆Rn bounded in the direction e∈Sn−1 between a<b; an exponent 1≤p<∞; a field K∈{R,C}; and a class u∈W01,p(Ω;K).

[F1]

W01,p(Ω;K) is the closure in W1,p(Ω;K) of the compactly supported smooth functions Cc∞(Ω;K), and every such smooth function lies in W1,p with its classical derivatives as weak derivatives (Zero-boundary Sobolev space as a norm closure).

[F2]

Vector-valued fundamental theorem: if f:[a,b]→Rm is differentiable with integrable derivative, 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).

[F4]

Tonelli's theorem on sigma-finite products, allowing iterated integrals of nonnegative measurable functions in either order (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).

[F5]

Linear change of variables: an invertible linear map T of Rn scales Lebesgue measure by ∣det⁡T∣ and the integral substitution formula holds for nonnegative Borel integrands; in particular an orthogonal change of orthonormal coordinates preserves the integral (A linear map T of Rn sends Lebesgue measurable sets to Lebesgue measurable sets, with λn(T[E])=∣det⁡T∣ λn(E) when T is invertible and T[E] Lebesgue null when it is not).

[F6]

W1,p consists of Lp classes with weak derivatives in Lp and the norm is the ℓp norm of u and its coordinate weak derivatives (Integer-order Sobolev spaces and their norms); Lp classes are almost-everywhere classes (The space Lp(μ) as the quotient by null functions).

[F7]

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

Proof

technique · direct
1.1F2F3givenalgebra

The smooth case: pointwise bound. Let φ∈Cc∞(Ω;K) and extend it by zero to Rn. Write x=x⊥+xne with x⊥⊥e. For each fixed x⊥, the profile g(s):=φ(x⊥+se) is smooth and supported in (a,b), since Ω⊂{a<y⋅e<b}. If x=x⊥+xne∈Ω, then a<xn<b and g(a)=0. Applying [F2] componentwise (in R or R2 according to the scalar field) gives φ(x)=g(xn)−g(a)=∫axnDφ(x⊥+se)⋅e ds. Hence ∣φ(x)∣≤∫axn∣Dφ(x⊥+se)∣ ds. Holder [F3], followed by xn−a≤b−a and enlargement of the integration interval, yields ∣φ(x)∣p≤(b−a)p−1∫ab∣Dφ(x⊥+se)∣p ds.

2.1F4F5step 1.1algebra

The smooth case: integration. If n=1, then ∣Ω∣≤b−a, so integrating step 1.1 gives ∫Ω∣φ∣p≤(b−a)p∫ab∣Dφ(se)∣p ds=(b−a)p∫Ω∣Dφ∣p by the change of variable y=se and the support of Dφ in Ω. Now suppose n≥2. Choose orthonormal coordinates with last vector e and write x=x⊥+xne; by [F5] integration on Rn is integration over (x⊥,xn)∈Rn−1×R. For each x⊥, the slice Sx⊥:={xn:(x⊥,xn)∈Ω} is a measurable subset of (a,b), so ∣Sx⊥∣≤b−a. Integrating step 1.1 over Ω and applying Tonelli [F4] gives ∫Ω∣φ∣p dx≤(b−a)p−1∫Rn−1∫Sx⊥∫ab∣Dφ(x⊥+se)∣p ds dxn dx⊥≤(b−a)p∫Rn−1∫ab∣Dφ(x⊥+se)∣p ds dx⊥. The last integral equals ∫Rn∣Dφ∣p dx=∫Ω∣Dφ∣p, since φ and its gradient vanish outside Ω and Ω lies in the slab. Therefore ∥φ∥Lp(Ω)p≤(b−a)p∥Dφ∥Lp(Ω)p.

3.1F1F6F7step 2.1algebra∎

The general class. By [F1] there are φk∈Cc∞(Ω;K) with φk→u in W1,p(Ω;K); by step 2.1, ∥φk∥Lp≤(b−a)∥Dφk∥Lp for every k. Both sides are continuous in the W1,p norm: ∥φk∥p→∥u∥p and ∥Dφk∥p→∥Du∥p by [F6]. Passing to the limit gives ∥u∥Lp(Ω)≤(b−a)∥Du∥Lp(Ω), so the asserted inequality holds with C(p)=1.

Source notes

Kinnunen's Theorem 3.10 proves the estimate on bounded open sets by taking the primitive in one coordinate direction and applying Holder; the proof above runs the same argument along the unit vector e of the hypothesis, uses the orthonormal coordinate decomposition for the integration, and then extends from Cc∞(Ω) to W01,p(Ω) by the definition of the latter as a closure. The constant obtained is 1, independent of p; the statement permits a p-dependent constant.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Mean-zero Poincare estimate on bounded connected extension domains below the dimension

Statement

Assume the Axiom of Choice (and hence Countable Choice and Dependent Choice). Let n≥2, 1<p<n, K∈{R,C}, and let Ω⊂Rn be a nonempty bounded connected W1,p-extension domain. Then there exists CP=CP(n,p,Ω,K) such that ∥u−uΩ∥Lp(Ω)≤CP∥Du∥Lp(Ω) for every u∈W1,p(Ω;K), where uΩ=∣Ω∣−1∫Ωu.

Facts & Assumptions

Given: The Axiom of Choice; integers n≥2; an exponent 1<p<n; a field K∈{R,C}; a nonempty bounded connected W1,p-extension domain Ω⊂Rn; a bounded linear extension operator E:W1,p(Ω;K)→W1,p(Rn;K) with (Eu)∣Ω=u and operator norm ∥E∥; a nonnegative unit-mass ρ∈Cc∞(Rn) with supp⁡ρ⊆B‾1(0) and radial mollifiers ρε.

[F1]

The Axiom of Choice is the statement that every family of nonempty sets has a choice function, and it implies Countable Choice (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

[F2]

Dependent Choice is the statement that every entire relation on a nonempty set admits a sequence with prescribed first term (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[F3]

W1,p(Ω;K) consists of the Lp classes with weak first derivatives in Lp, and Lp is the quotient by almost-everywhere null functions (Integer-order Sobolev spaces and their norms, The space Lp(μ) as the quotient by null functions).

[F4]

A W1,p-extension domain carries a bounded linear E with (Eu)∣Ω=u (Sobolev extension domains and extension operators).

[F5]

Weak Leibniz rule: for smooth η with bounded value and first derivatives and v∈W1,p the product ηv lies in W1,p and D(ηv)=(Dη)v+ηDv (Weak Leibniz rule with a smooth factor).

[F6]

For a compact K inside an open U there is a smooth χ with χ=1 on K and support in U (A Euclidean bump for a compact set inside an open set).

[F7]

Cc∞(Rn;K) is dense in W1,p(Rn;K) for 1≤p<∞ (Compactly supported smooth functions are dense in W^{k,p}(R^n)).

[F9]

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

[F10]

The family ρε(x)=ε−nρ(x/ε) is the radial mollifier family generated by ρ, with ρε≥0, ∫ρε=1 and supp⁡ρε⊆B‾ε(0) (A radial mollifier family in Rn).

[F11]

For locally integrable f the convolution f∗ρε is smooth with ∂α(f∗ρε)=f∗(∂αρε) (Convolution with a mollifier is smooth, and derivatives pass under the integral sign).

[F12]
[F13]

Minkowski's integral inequality: for a measurable F on a product with ∫Y∥F(⋅,y)∥Lp(X) dν(y)<∞, the function x↦∫Y∣F(x,y)∣ dν(y) lies in Lp(X) with norm at most ∫Y∥F(⋅,y)∥Lp(X) dν(y) (Minkowski's integral inequality).

[F14]

Arzela-Ascoli: for a nonempty compact metric space K, a subset of C(K,R) has compact closure in the supremum metric exactly when it is equicontinuous and pointwise bounded (Arzelà--Ascoli for real C(K) under Countable Choice and Dependent Choice: compact closure iff equicontinuous and pointwise bounded).

[F17]

Weak derivatives are unique almost everywhere, and the weak derivative is defined by the test-function identity (Uniqueness of a weak derivative as an almost-everywhere class, Weak derivative of a locally integrable function).

[F18]

If u∈Wloc1,p(Ω;K) has Diu=0 almost everywhere for every i, then u is almost everywhere constant on each connected component of Ω (Zero weak gradient gives componentwise constants).

[F19]

On a completed sigma-finite product, nonnegative measurable functions may be integrated in either order, and Tonelli-Fubini applies to measurable integrands of the form G(x,y) (Tonelli and Fubini for the completed product, with only almost-everywhere section measurability).

[F20]

Every Euclidean ball has positive finite Lebesgue measure (Euclidean balls have positive finite Lebesgue measure), λ is monotone under inclusion (Measures are monotone), and bounded subsets have finite outer measure (Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure).

[F21]

Under Countable Choice, Lebesgue measure is the completion of its Borel restriction (L(Rn) is exactly the completion of the restriction of λn to the Borel sets), and every completion-measurable real function has an almost-everywhere equal Borel representative (A function measurable for a completion is almost everywhere equal to one measurable for the original sigma-algebra); apply this to real and imaginary parts for complex functions.

Proof

technique · contradiction
1.1F1F3F20givenchoose

The contradiction setup. Because Ω is nonempty open and bounded, it contains a ball and 0<∣Ω∣<∞ by [F20], so the mean uΩ is defined for every u∈Lp(Ω;K). Suppose the asserted constant does not exist. Then for every j≥1 there is uj∈W1,p(Ω;K) with ∥uj−(uj)Ω∥Lp(Ω)>j∥Duj∥Lp(Ω); the left side is positive, and Countable Choice [F1] selects such a sequence. Put vj:=(uj−(uj)Ω)/∥uj−(uj)Ω∥Lp(Ω). Then vj∈W1,p(Ω;K), (vj)Ω=0, ∥vj∥Lp(Ω)=1 and ∥Dvj∥Lp(Ω)<1/j.

1.2F7F8F9F13algebra

Translation differences. Every W∈W1,p(Rn;K) and h∈Rn satisfy ∥W(⋅−h)−W∥Lp(Rn)≤∣h∣ ∥DW∥Lp(Rn). For smooth compactly supported φ the fundamental theorem [F9] applied to t↦φ(x−th) gives φ(x−h)−φ(x)=−∫01Dφ(x−th)h dt, so Minkowski [F13] and translation invariance [F8] give ∥φ(⋅−h)−φ∥p≤∣h∣∫01∥Dφ(⋅−th)∥p dt=∣h∣∥Dφ∥p. For general W, [F7] provides φk∈Cc∞ with φk→W in W1,p(Rn); applying the smooth bound to φk and letting k→∞, using translation invariance [F8] on the left and strong convergence on the right, gives the claim.

2.1F4F5F6step 1.1algebra

Extension and cutoff. Fix E as in [F4] and put M0:=∥E∥. The closure Ω‾ is compact. Choose a bounded open ball U containing it; [F6] gives a smooth χ equal to 1 on Ω‾ with closed support contained in U. That support is bounded and hence compact, so χ∈Cc∞(Rn); put K:=supp⁡χ, a compact set. Define Fj:=χ Evj. By [F5] each Fj lies in W1,p(Rn;K), has support in K, restricts to vj on Ω (because χ=1 there) and satisfies ∥Fj∥Lp(Rn)+∥DFj∥Lp(Rn)≤(n+1)(1+∥χ∥∞+∥Dχ∥∞)∥Evj∥W1,p(Rn)≤M with M:=(n+1)2(1+∥χ∥∞+∥Dχ∥∞)M0, using ∥vj∥W1,p≤n+1 and the elementary bound of the Euclidean gradient norm by the sum of its coordinate norms from step 1.1 and the operator bound of [F4].

3.1F10F11F12step 2.1algebra

Mollification and equicontinuity at one scale. Fix 0<ε≤1. By [F10] and [F11], Fj∗ρε is smooth on Rn with D(Fj∗ρε)=Fj∗Dρε and support in the compact set K′:=K+B‾1(0). Holder [F12] gives, uniformly in j and x, ∣(Fj∗ρε)(x)∣≤∥Fj∥Lp∥ρε∥Lp′≤M∥ρε∥Lp′ and ∣D(Fj∗ρε)(x)∣≤M∥Dρε∥Lp′, using step 2.1. The second bound makes the family {Fj∗ρε}j equicontinuous on the compact metric space K′ and the first makes it pointwise bounded.

3.2F10F13F19F21step 1.2step 2.1algebra

Uniform mollification error. By [F10], Fj∗ρε−Fj=∫ρε(y)(Fj(⋅−y)−Fj) dy on Rn. Choose finite-valued Borel representatives of each Fj using [F21], changing them to zero on a Borel null set and outside K. Then (x,y)↦Fj(x−y) and Fj(x) are Borel measurable, since subtraction and projection are continuous. The integrand is therefore product measurable, with measurable absolute section integrals by [F19]. Minkowski [F13], the translation bound of step 1.2 and supp⁡ρε⊆B‾ε(0) give ∥Fj∗ρε−Fj∥Lp(Rn)≤∫ρε(y)∥Fj(⋅−y)−Fj∥Lp dy≤ε∥DFj∥Lp≤εM, the last inequality by step 2.1.

4.1F14F15step 3.1given

One scale at a time. Fix 0<ε≤1. The family {Fj∗ρε}j is uniformly bounded and equicontinuous on the compact set K′ by step 3.1, so by Arzela-Ascoli [F14] its closure in C(K′;C)≅C(K′;R)2 is compact; applying [F14] to the real and imaginary parts componentwise and then the sequential compactness of [F15], there is a subsequence (jk)k and Gε∈C(K′;K) with Fjk∗ρε→Gε uniformly on K′.

5.1F2step 4.1chooseconstruct

Diagonalisation over the scales. Apply step 4.1 successively to the scales εm=2−m, each time to the previously selected subsequence, and select the m-th extracted subsequence at stage m in such a way that the diagonal sequence (jk), where jk is the k-th index of the k-th subsequence, is strictly increasing; Dependent Choice [F2] formalises the recursion. Then for every fixed m the tail (Fjk∗ρεm)k≥m is a subsequence of the m-th extracted subsequence, hence converges uniformly on K′ and in particular is Cauchy in Lp(K′).

6.1F16step 3.2step 5.1algebra

Cauchy and the Lp limit. For k,l≥m, step 3.2 applied at scale εm and the uniform convergence on K′ of step 5.1 give ∥Fjk−Fjl∥Lp(Rn)≤2Mεm+∥Fjk∗ρεm−Fjl∗ρεm∥Lp(K′). Given δ>0 choose m with 2M2−m<δ/2, then k,l large enough that the second term is below δ/2; hence (Fjk)k is Cauchy in Lp(Rn;K) and converges by [F16] to some F∈Lp(Rn;K).

7.1F3F12step 1.1step 2.1step 6.1algebra

Properties of the limit. Restrict v:=F∣Ω. Since Fjk∣Ω=vjk by step 2.1 and ∥v−vjk∥Lp(Ω)≤∥F−Fjk∥Lp(Rn)→0 by step 6.1, the limit of the norms gives ∥v∥Lp(Ω)=1, and Holder [F12] with ∣Ω∣<∞ gives ∣∫Ωv∣=lim⁡k∣∫Ωvjk∣=0 because every vjk has mean zero (step 1.1). Thus v∈Lp(Ω;K) has unit norm and mean zero.

8.1F3F12F17step 1.1step 7.1algebra

The weak gradient of the limit vanishes. Let φ∈Cc∞(Ω) and 1≤i≤n. Since vjk is the weak i-th derivative pair, ∫Ωvjk∂iφ=−∫ΩDivjkφ for every k by [F17]. Holder [F12] gives ∣∫ΩDivjkφ∣≤∥Divjk∥Lp∥φ∥Lp′≤jk−1∥φ∥Lp′→0, using step 1.1, and ∫Ωvjk∂iφ→∫Ωv ∂iφ by step 7.1 and Holder. Hence ∫Ωv ∂iφ=0 for every test function and every i, so the zero function is a weak i-th derivative of v; by uniqueness of weak derivatives [F17], Div=0 almost everywhere on Ω and v∈W1,p(Ω;K).

9.1F18step 7.1step 8.1givencontradiction∎

The contradiction. By step 8.1 the class v∈W1,p(Ω;K) has all weak derivatives zero almost everywhere, so [F18] and the connectedness of Ω give a constant c∈K with v=c almost everywhere on Ω. Step 7.1 gives 0=∫Ωv=c∣Ω∣, hence c=0 and v=0 almost everywhere, contradicting ∥v∥Lp(Ω)=1 from step 7.1. Therefore a constant CP=CP(n,p,Ω,K) with the asserted property exists.

Source notes

Kinnunen proves the mean-zero estimate as the inner step of Theorem 3.47 (printed pp. 90-91) using the Rellich-Kondrachov compactness theorem. The proof above replaces that compactness input by an internal argument: the extension operator of the definition of an extension domain, a fixed smooth cutoff, mollification at every scale, Arzela-Ascoli on a fixed compact set, a diagonal subsequence and the completeness of Lp. The weak derivative of the limit is obtained from the test-function identity rather than from strong convergence of gradients, so no compactness theorem from the later compactness page is used. The argument uses Countable Choice to select the minimising sequence and Dependent Choice for the nested subsequences; both are supplied by the Axiom of Choice assumed in the Statement.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

John domains and the John constant

Definition

Assume Countable Choice. Let n≥2 and let Ω⊆Rn be open, bounded and nonempty. Its boundary ∂Ω is then a nonempty compact subset of Rn contained in a sufficiently large closed ball (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, For n≥1, every Euclidean closed ball and every Euclidean sphere of positive radius is compact), and the distance dist⁡(x,∂Ω) is defined for every x and is a 1-Lipschitz function of x (∣d(x,A)−d(y,A)∣≤d(x,y), so the distance to a fixed nonempty set is 1-Lipschitz).

Rectifiable curves, their arclength functions are used with the conventions of The arc-length function sγ(t)=L(γ∣[a,t]) of a rectifiable path.

John domain and John constant. A pair (Ω,x0) with x0∈Ω satisfies the John condition with constant c≥1 if for every x∈Ω there is a rectifiable curve γ:[0,l]→Ω parametrised by arclength, with γ(0)=x, γ(l)=x0 and dist⁡(γ(t),∂Ω)≥c−1∣x−γ(t)∣for every t∈[0,l]. Write cJ(Ω,x0) for the infimum of the admissible constants c≥1; with the convention inf⁡∅=+∞, this value belongs to [1,+∞]. The domain Ω is a John domain if cJ(Ω,x0)<∞ for some x0∈Ω, and cJ(Ω,x0) is the John constant of the pair (Ω,x0). The estimates below use an admissible constant, never the finiteness of the infimum alone, and whether the infimum is attained is immaterial.

Arclength form. If γ is arclength parametrised from x, then t≥∣γ(t)−x∣ for 0≤t≤l, because the straight segment from x to γ(t) is no longer than the curve. Hence a curve satisfying the arclength normalisation dist⁡(γ(t),∂Ω)≥c−1t for all t also satisfies the displayed relative-distance condition with the same constant c. Only this implication is used here; the chain construction below uses the displayed relative-distance condition.

Connectedness. A John domain is path-connected and hence connected: given x,y∈Ω, choose curves γx from x to x0 and γy from y to x0 as in the definition (under Countable Choice the two curves may be chosen simultaneously) and traverse γx followed by the reverse of γy. No regularity of ∂Ω is assumed beyond what the definition uses.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Bounded-overlap ball chains in a bounded John domain

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let n≥2 and let Ω⊆Rn be a bounded John domain with distinguished point x0 and admissible constant cJ≥1; set r0=14dist⁡(x0,∂Ω) and B0=B(x0,r0). There is a constant M=M(n,cJ)≥1 such that for every x∈Ω there are balls Bi=B(xi,ri)⊆Ω, i≥0, with:

  1. ∣Bi∪Bi+1∣≤M ∣Bi∩Bi+1∣ for all i≥0;
  2. dist⁡(x,Bi)≤Mri for all i≥0, and ri→0, xi→x as i→∞;
  3. no point of Ω belongs to more than M of the balls Bi.

For x∉B(x0,2r0) the chain starts with B0=B(x0,r0) and follows a John curve from x0 to x; for x∈B(x0,2r0) it is the explicit geometric chain constructed below. The choice assumption supplies Countable Choice for the John-domain and Lebesgue-measure interfaces; selecting a curve for one fixed x needs no choice axiom.

Facts & Assumptions

Given: The Axiom of Choice; n≥2; a bounded John domain Ω with distinguished point x0 and admissible constant cJ≥1; r0=14dist⁡(x0,∂Ω)>0; and a point x∈Ω.

[F1]

There is a path γ:[0,1]→Ω with γ(0)=x, γ(1)=x0 and dist⁡(γ(t),∂Ω)≥cJ−1∣x−γ(t)∣ for every t∈[0,1] (John domains and the John constant). Evaluating at t=1 gives ∣x−x0∣≤cJdist⁡(x0,∂Ω)=4cJr0.

[F2]

For every ball λn(B(z,ρ))=ωn−1ρn/n with 0<ωn−1=σ(Sn−1)<∞; hence λn(B(z,ρ))/λn(B(z′,ρ′))=(ρ/ρ′)n and every ball has positive finite measure (Sphere and ball measures scale in Rn, Euclidean balls have positive finite Lebesgue measure).

[F3]

A measure is countably additive on pairwise disjoint measurable sets and monotone under inclusion (Measures on sigma-algebras, Measures are monotone).

[F4]

The curve γ is uniformly continuous on [0,1]. Indeed, for each t continuity gives a radius at>0 such that ∣s−t∣<2at implies ∣γ(s)−γ(t)∣<ε/2. Compactness gives a finite subcover of the intervals ∣s−t∣<at; the minimum of its at is positive. If two parameters are closer than this minimum, place the first in a covering interval and apply the two continuity bounds to obtain image distance <ε.

Proof

technique · direct
1.1F1givenalgebra

Setup. By [F1] fix a John curve γ from x to x0; the John inequality at t=1 gives ∣x−x0∣≤4cJr0. If x∈B(x0,2r0) we use the explicit geometric chain below; if x∉B(x0,2r0) we use the recursive construction below along the John curve. In both cases all constants below depend only on n and cJ, and we collect them at the end into a single M. Also x∉B(x0,2r0) implies ∣x−x0∣≥2r0>r0, so x∉B0 in that case.

1.2F2F3givenalgebra

The near case x∈B(x0,2r0). Put d:=∣x−x0∣≤2r0. If d>0 put xi:=x+2−i(x0−x) and ri:=2−i−1d for i≥0; if d=0 fix the first standard basis vector e1 and put xi:=x0+2−i(r0/2)e1, ri:=2−i−2r0. In both cases ri+1=ri/2, ∣xi−x∣=2ri, ∣xi−xi+1∣=ri, ri≤r0 and ∣xi−x0∣≤2r0, so dist⁡(xi,∂Ω)≥4r0−∣xi−x0∣≥2r0>ri and Bi=B(xi,ri)⊆Ω. Consecutive balls: Bi∪Bi+1⊆B(xi,32ri), because a point of Bi+1 is within ∣xi−xi+1∣+ri+1=ri+ri/2 of xi, while the ball of radius ri/4 centred at the point of the segment from xi to xi+1 at distance 3ri/4 from xi lies in Bi∩Bi+1 (its centre is at distance 3ri/4<ri from xi and at distance ri/4<ri+1=ri/2 from xi+1); hence ∣Bi∪Bi+1∣≤6n∣Bi∩Bi+1∣ by [F2] and [F3]. Also dist⁡(x,Bi)≤∣x−xi∣=2ri, and ri→0, xi→x. Finally, if y∈Bi then ri≤∣x−y∣≤3ri; the radii halve at each step, so the interval [∣x−y∣/3,∣x−y∣] of ratio 3 contains at most two of the numbers ri, and y therefore belongs to at most two of the balls Bi. Hence (1), (2) and (3) hold in the near case, with ratio 6n and multiplicity 2.

1.3F1givenalgebra

The far case: the recursive construction and comparability. Assume now x∉B(x0,2r0), so x∉B0 and ∣x−x0∣≥2r0. We construct Bi=B(xi,ri) recursively, starting with x0, B0=B(x0,r0). Suppose Bi with centre xi=γ(ti) has been constructed, Bi⊆Ω, and x∉Bi. Put Ti:={t∈[0,ti]:γ(t)∈Bi}, a nonempty set containing a relative neighbourhood of ti in [0,ti], and define ti+1:=inf⁡Ti, xi+1:=γ(ti+1), ri+1:=14cJ∣x−xi+1∣ and Bi+1:=B(xi+1,ri+1). Then ti+1<ti. For every t<ti+1 one has γ(t)∉Bi, while points of Ti arbitrarily close to ti+1 lie in Bi; by continuity xi+1∈∂Bi, so ∣xi−xi+1∣=ri, and xi+1≠x. The John inequality [F1] at xi+1 gives dist⁡(xi+1,∂Ω)≥cJ−1∣x−xi+1∣=4ri+1>ri+1, so Bi+1⊆Ω; and x∉Bi+1 because ∣x−xi+1∣=4cJri+1>ri+1 as cJ≥1. For the first transition, ∣x0−x1∣=r0 and ∣x−x0∣≥2r0, so ∣x−x1∣≥∣x−x0∣−r0≥r0; also [F1] gives ∣x−x0∣≤4cJr0, hence ∣x−x1∣≤(4cJ+1)r0. Since r1=∣x−x1∣/(4cJ), this yields r0/(4cJ)≤r1≤(1+1/(4cJ))r0. For every i≥1, the defining identity ∣x−xi∣=4cJri and ∣xi−xi+1∣=ri give (1−1/(4cJ))ri≤ri+1≤(1+1/(4cJ))ri. Thus consecutive radii are comparable with ratio at most 5/4 from the second transition onward, and ∣xi−xi+1∣=ri is comparable to both radii for i≥1.

2.1F1F4step 1.3givenalgebra

The far case: limit properties. The times ti are strictly decreasing in [0,1], so the intervals [ti+1,ti] are pairwise disjoint and ∑i(ti−ti+1)≤1. If ri≥ε>0 for an index i, then ∣xi−xi+1∣=ri≥ε, and uniform continuity [F4] of γ on [0,1] gives ti−ti+1≥δ(ε)>0; since the intervals are disjoint, only finitely many indices satisfy ri≥ε. Hence ri→0; and since ∣x−xi∣=4cJri for every i≥1, also xi→x. Consequently dist⁡(x,Bi)≤∣x−xi∣=4cJri for i≥1, while for i=0 we have dist⁡(x,B0)≤∣x−x0∣−r0≤4cJr0. This gives (2) in the far case.

3.1F2F3step 1.3step 2.1algebra

The far case: multiplicity. Suppose y belongs to Bi1∩⋯∩Bik with i1<⋯<ik. Since y∈Bij and ∣x−xij∣=4cJrij for ij≥1 (while for ij=0 one has ∣x−x0∣≤4cJr0 and ∣x−y∣≥∣x−x0∣−r0≥r0), the triangle inequality gives c1rij≤∣x−y∣≤c2rij for constants c1,c2 depending only on cJ: the upper bound is ∣x−y∣≤(4cJ+1)rij, and the lower bound is ∣x−y∣≥(4cJ−1)rij for ij≥1, while for ij=0 one has r0≤∣x−y∣≤(4cJ+1)r0, so r0≥∣x−y∣/(4cJ+1) and ∣x−y∣≥r0/(4cJ+1)⋅1, which is the same shape with adjusted constants. Hence all the radii rij are comparable to ∣x−y∣. For j<m one has xim∉Bij, because tim≤tij+1 and γ(t)∉Bij for every t<tij+1 by step 1.3; hence ∣xij−xim∣≥rij, while ∣xij−xim∣≤∣xij−x∣+∣x−xim∣≤4cJ(rij+rim). So the k centres have pairwise distances between c1′∣x−y∣ and c2′∣x−y∣ with constants depending only on cJ. If y=x this is impossible, because ∣x−xi∣=4cJri>ri for i≥1 and ∣x−x0∣≥2r0>r0 for i=0, so x lies in no Bi. The balls B(xij,c1′∣x−y∣/3) are pairwise disjoint and all lie in B(xi1,(c2′+c1′/3)∣x−y∣), so by [F2] and [F3], k(c1′/3)n≤(c2′+c1′/3)n, an explicit bound N(n,cJ).

4.1step 1.2step 1.3step 2.1step 3.1givenalgebra∎

Assembly. In the near case step 1.2 gives (1), (2) and (3) with constants depending only on n: ratio at most 6n, dist⁡(x,Bi)≤2ri, ri→0, xi→x, and multiplicity 2. In the far case, the first pair has a separate overlap bound: the ball from step 1.3 of radius r1/2≥r0/(8cJ), centred halfway from x1 toward x0 by r1/2, lies in B0∩B1, while B0∪B1⊆B(x0,r0+r1) and r1≤(1+1/(4cJ))r0, so ∣B0∪B1∣≤(16cJ+2)n∣B0∩B1∣. For i≥1, step 1.3 gives ri+1≥(3/4)ri and centre separation ri; the midpoint ball of radius ri/4 lies in Bi∩Bi+1, while the union is contained in B(xi,3ri), giving ratio at most 12n. Step 2.1 gives dist⁡(x,Bi)≤4cJri, ri→0 and xi→x; and step 3.1 gives multiplicity at most N(n,cJ). Taking M≥max⁡(6n,(16cJ+2)n,12n,4cJ,N(n,cJ),2,1) completes the proof. A John curve was selected once, for the given x, in step 1.1.

Source notes

The construction and properties are Kinnunen's, printed pp. 141-142: the radius ri+1=∣x−xi+1∣/(4cJ) at the last exit point of the ball, the comparability of consecutive radii and centre distances, the packing bound on centres with pairwise comparable distances, and the terminal convergence ri→0, xi→x. Kinnunen leaves the case x∈B(x0,2r0) as an exercise; the explicit overlapping geometric chain of step 1.2 supplies it. The roles of the constants are kept separate: the John inequality is used only to put every ball inside Ω and to bound ∣x−x0∣, the packing bound uses only the comparability of the radii to ∣x−y∣, and no monotonicity of the radii is claimed.

LemmaStatement: AI-adaptedProof: AI-adaptedOpen item page →

The truncated Riesz kernel is bounded on Lp of a bounded set

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let n≥2, let z0∈Rn, ρ>0, and let Ω⊆B(z0,ρ) be measurable, 1≤p<∞ and f∈Lp(Ω;K). Then ∥∫Ω∣x−y∣1−n∣f(y)∣ dy∥Lp(Ω)≤C(n) ρ ∥f∥Lp(Ω). In particular, for a bounded John domain the John condition gives diam⁡Ω≤c∣Ω∣1/n, so the bound holds with coefficient C(n,cJ)∣Ω∣1/n.

Facts & Assumptions

Given: Countable Choice; n≥2; z0∈Rn, ρ>0; a measurable Ω⊆B(z0,ρ); 1≤p<∞; f∈Lp(Ω;K); and, for the final claim, a bounded John domain Ω with distinguished point x0 and admissible constant cJ≥1.

[F1]

The polar surface measure is σ(E)=nλn({rω:ω∈E, 0<r≤1}) on Borel E⊆Sn−1 (The polar surface set function on the unit sphere).

[F2]

Polar coordinates: ∫Rnh dλn=∫0∞∫Sn−1h(rω)rn−1 dσ(ω) dr for nonnegative Borel h (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma).

[F3]

Every Euclidean ball has positive finite Lebesgue measure (Euclidean balls have positive finite Lebesgue measure).

[F4]

Minkowski's integral inequality: ∥∫Y∣F(⋅,y)∣ dν(y)∥Lp(X)≤∫Y∥F(⋅,y)∥Lp(X) dν(y) for measurable F with the right side finite (Minkowski's integral inequality).

[F5]

Tonelli-Fubini on completed sigma-finite products gives measurability and equality of the nonnegative iterated integrals (Tonelli and Fubini for the completed product, with only almost-everywhere section measurability). Lebesgue translation invariance gives ∥g(⋅−z)∥p=∥g∥p (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation).

[F6]

A measure is countably additive on pairwise disjoint measurable sets, and monotone under inclusion (Measures on sigma-algebras, Measures are monotone).

[F7]

A John domain with admissible constant cJ and point x0 admits, for every x∈Ω, a curve from x to x0 with dist⁡(γ(t),∂Ω)≥cJ−1∣x−γ(t)∣ (John domains and the John constant).

[F9]

Measurability is preimage measurability, and Lp consists of almost-everywhere classes of measurable functions with finite norm (A measurable function between measurable spaces, The space Lp(μ) as the quotient by null functions).

[F10]

Countable Choice, used by the cited measure-theoretic interfaces (The Axiom of Countable Choice (ACω)).

[F11]

Under Countable Choice, every completion-measurable real function has a base-measurable representative equal to it almost everywhere (A function measurable for a completion is almost everywhere equal to one measurable for the original sigma-algebra); Lebesgue measure is the completion of Borel Lebesgue measure (L(Rn) is exactly the completion of the restriction of λn to the Borel sets). Applying this componentwise gives a finite Borel representative of every Lp(Rn;K) class.

[F12]

Under Countable Choice, reflection in the origin preserves Lebesgue measurability and measure (For a nonzero real c, dilation by c multiplies Lebesgue outer measure by ∣c∣n, and reflection in the origin preserves it).

Proof

technique · direct
1.1F1F2F3F10algebra

The truncated kernel has finite mass. Put k(z):=∣z∣1−n1B(0,2ρ)(z) for z≠0 and k(0):=0. By [F2] applied to the nonnegative Borel function k and by [F1], [F3], ∥k∥L1(Rn)=∫Sn−1∫02ρt1−ntn−1 dt dσ(ω)=2ρ σ(Sn−1)=2ρ n λn(B(0,1))=:C0(n)ρ, so ∥k∥1 is finite and equals a dimension-only multiple of ρ.

1.2F2F6F7algebra

John-domain volume control. Put a:=dist⁡(x0,∂Ω)>0. The ball B(x0,a) lies in Ω: a segment from x0 to any point outside Ω first meets the boundary, so an outside point cannot be closer than a. Polar coordinates [F2] therefore give ∣Ω∣≥σ(Sn−1)an/n. Evaluating [F7] at the endpoint of the curve gives ∣x−x0∣≤cJa for every x∈Ω, hence diam⁡Ω≤2cJa≤2cJ(n/σ(Sn−1))1/n∣Ω∣1/n.

2.1F2F3F4F5F11F12step 1.1algebra

The convolution bound. For g∈Lp(Rn;K), choose a finite Borel representative g0 by [F11] (replace any infinite values on a Borel null set by zero). The function F0(x,z)=k(z)g0(x−z) is Borel, hence measurable for the product of the Lebesgue sigma-algebras. The two Lebesgue spaces are sigma-finite, being exhausted by bounded balls of finite measure [F2, F3]. Translation invariance [F5] and step 1.1 give ∫∥F0(⋅,z)∥p dz=∫k(z)∥g0(⋅−z)∥p dz=∥k∥1∥g∥p<∞. Minkowski [F4] therefore shows that the absolute integral is finite almost everywhere and ∥Tg0∥p≤∥k∥1∥g∥p, where Tg0(x)=∫k(z)g0(x−z) dz. This also defines Tg for any Lebesgue representative g: for each fixed x, the exceptional set of z is the translate and reflection x−N of the null set N where g≠g0, and has measure zero by reflection invariance [F12] and translation invariance [F5]. Thus the section integrals agree wherever finite, and the measurable almost-everywhere representative Tg0 supplies ∥Tg∥p≤∥k∥1∥g∥p.

2.2step 1.2algebra

In particular step 1.2 gives diam⁡Ω≤2c(n,cJ)∣Ω∣1/n with c(n,cJ):=cJ(n/σ(Sn−1))1/n; taking a supremum does not require that a farthest point exist.

3.1F5F9F12step 2.1givenalgebra

The bound on Ω for a set inside a ball. Extend f by zero to Rn and put g:=∣f∣1Ω, a measurable function with ∥g∥Lp(Rn)=∥f∥Lp(Ω) by [F9]. By translation and reflection invariance [F5, F12], the substitution y=x−z gives Tg(x)=∫k(x−y)g(y) dy wherever finite. Since x,y∈Ω⊆B(z0,ρ) implies ∣x−y∣≤2ρ, for almost every x∈Ω one has Tg(x)=∫Ω∣x−y∣1−n∣f(y)∣ dy: the kernel truncation in the convolution is inactive exactly on the pairs with ∣x−y∣<2ρ. Hence, by step 2.1, ∥∫Ω∣x−y∣1−n∣f(y)∣ dy∥Lp(Ω)≤∥Tg∥Lp(Rn)≤∥k∥L1∥f∥Lp(Ω)≤C(n)ρ∥f∥Lp(Ω).

4.1step 3.1step 2.2algebra∎

The John-domain form of the bound. Apply step 3.1 with z0:=x0 and ρ:=2c(n,cJ)∣Ω∣1/n, which is admissible by step 2.2 because then Ω⊆B(x0,ρ). The resulting coefficient is C(n)ρ=C(n,cJ)∣Ω∣1/n.

Source notes

Kinnunen proves Lemma 5.15 by Holder and Fubini, using the kernel integral estimate of Lemma 5.14; the proof above instead uses Minkowski's integral inequality for the truncated radial kernel, which gives the bound on every Lp with the single constant ∥k∥1=C(n)ρ and avoids interpolation. The John-domain volume estimate follows from the interior ball at the distinguished point and the endpoint John inequality.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The mean-zero Poincare inequality on bounded John domains

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let n≥2, let Ω⊆Rn be a bounded John domain with admissible constant cJ, and let 1≤p<∞. There is a constant C(n,p,cJ) with ∥u−uΩ∥Lp(Ω)≤C(n,p,cJ)diam⁡(Ω)∥Du∥Lp(Ω) for every u∈W1,p(Ω;K), where uΩ=∣Ω∣−1∫Ωu. The factor diam⁡(Ω) is necessary: for the function u(x)=x1 on a ball of radius R with the centre as distinguished point, the ratio ∥u−uB∥Lp(B)/∥Du∥Lp(B) grows linearly in R, while the John constant of that pair is 1 for every R.

Facts & Assumptions

Given: The Axiom of Choice, whose Countable-Choice consequence is used for the measure-theoretic interfaces; a bounded John domain Ω with distinguished point x0 and admissible constant cJ; 1≤p<∞; a field K; and a class u∈W1,p(Ω;K).

[F1]

The John chain lemma: with r0=14dist⁡(x0,∂Ω) and B0=B(x0,r0) there is M=M(n,cJ) such that for every x∈Ω there are balls Bi=B(xi,ri)⊆Ω with ∣Bi∪Bi+1∣≤M∣Bi∩Bi+1∣, dist⁡(x,Bi)≤Mri, ri→0, xi→x, and multiplicity at most M (Bounded-overlap ball chains in a bounded John domain; x0,cJ as in John domains and the John constant).

[F2]

Ball oscillation and ball Poincare: for v∈W1,p(B), ∥v−vB∥Lp(B)≤C1(n,p)r∥Dv∥Lp(B) and ∫B∣v−vB∣≤C2(n)r∫B∣Dv∣ for a ball B=B(x,r) (Poincare inequality on a ball, Ball-mean oscillation bound by the Riesz potential of the gradient).

[F3]

At almost every Lebesgue point x of u, the centered averages Aru(x) converge to u(x) as r↓0 (Lebesgue differentiation theorem on Rn, The average of a locally integrable function over a Euclidean ball).

[F4]

The truncated Riesz kernel bound: for measurable Ω′⊆B(z0,ρ) and f∈Lp(Ω′), ∥∫Ω′∣x−y∣1−n∣f(y)∣dy∥Lp(Ω′)≤C(n)ρ∥f∥Lp(Ω′) (The truncated Riesz kernel is bounded on Lp of a bounded set).

[F5]
[F6]

Linear substitution scales Lebesgue measure by the absolute determinant (A linear map T of Rn sends Lebesgue measurable sets to Lebesgue measurable sets, with λn(T[E])=∣det⁡T∣ λn(E) when T is invertible and T[E] Lebesgue null when it is not); smooth classical derivatives are weak derivatives (Classical derivatives agree with weak derivatives), and balls have positive finite measure scaling with the nth power of the radius (Sphere and ball measures scale in Rn).

Proof

technique · direct
1.1F1F2F3algebra

Lebesgue points and the near case. Extend u by zero outside Ω; it is locally integrable. The cited differentiation theorem implies As(∣u−u(x)∣)(x)→0 at almost every x: apply it simultaneously to ∣u−a∣ for the countable dense set a∈Q (or Q+iQ), and bound lim sup⁡s↓0As(∣u−u(x)∣)(x)≤2∣a−u(x)∣; let a→u(x). Write B0=B(x0,r0) for the fixed central ball and B∗:=B(x0,2r0)⊂Ω. For almost every x∈B∗, [F2] gives ∣u(x)−uB∗∣≤C(n)∫B∗∣Du(y)∣∣x−y∣1−ndy. Also ∣uB∗−uB0∣≤∣B0∣−1∫B∗∣u−uB∗∣≤C(n)r01−n∫B∗∣Du∣ by the L1 ball Poincare estimate. Since ∣x−y∣≤4r0 for x,y∈B∗, this last bound is at most C(n)∫B∗∣Du(y)∣∣x−y∣1−ndy. Thus ∣u(x)−uB0∣≤C(n)∫Ω∣Du(y)∣∣x−y∣1−ndy in the near case, with the same fixed B0 for all x.

1.2F1F2F3givenalgebra

Telescoping along the chain. Fix a Lebesgue point x∉B(x0,2r0) of u and a chain {Bi=B(xi,ri)} from [F1], with overlap and distance constant M. Since dist⁡(x,Bi)≤Mri, we have ∣xi−x∣≤(M+1)ri and hence Bi⊆B(x,(M+2)ri). The volume ratio is ∣B(x,(M+2)ri)∣/∣Bi∣=(M+2)n, so [F3] gives ∣uBi−u(x)∣≤1∣Bi∣∫Bi∣u(y)−u(x)∣ dy≤(M+2)nA(M+2)ri(∣u−u(x)∣)(x)⟶0. Thus uBi→u(x), and ∣u(x)−uB0∣≤∑i≥0∣uBi−uBi+1∣. Writing each difference of means as an average over the intersection and using ∣Bi∣,∣Bi+1∣≤M∣Bi∩Bi+1∣ from [F1], ∣uBi−uBi+1∣≤M(∫Bi∣u−uBi∣∣Bi∣+∫Bi+1∣u−uBi+1∣∣Bi+1∣). Applying the L1 ball Poincare inequality [F2] on each ball and using the radius comparability supplied by [F1] gives ∣uBi−uBi+1∣≤C3(n,cJ)∑j∈{i,i+1}rj∫Bj∣Du∣∣Bj∣.

2.1F1F5step 1.1step 1.2givenalgebra

The potential bound. From step 1.2, ∣u(x)−uB0∣≤C3∑iri∫Bi∣Du∣/∣Bi∣ (each ball counted with a bounded number of neighbours with comparable radii, the constant absorbed into C3). For y∈Bi the chain property dist⁡(x,Bi)≤Mri gives ∣x−y∣≤(M+2)ri, hence ∣Bi∣=ωn−1rin/n and ri/∣Bi∣=c(n)ri1−n≤c(n,M)∣x−y∣1−n; summing over i and using the multiplicity bound of [F1], ∑iri∫Bi∣Du∣/∣Bi∣≤c(n,M)∫Ω∣Du(y)∣ ∣x−y∣1−nN(x,y) dy≤c(n,M)∫Ω∣Du(y)∣ ∣x−y∣1−ndy with N(x,y)≤M the number of balls containing y; the exchange of sum and integral is Tonelli [F5]. The index i=0 needs the separate bound r0∫B0∣Du∣/∣B0∣≤c(n,cJ)∫B0∣Du(y)∣∣x−y∣1−ndy: the John condition at x gives diam⁡Ω≤8cJr0, so ∣x−y∣≤8cJr0 for y∈B0 and r01−n≤(8cJ)n−1∣x−y∣1−n. Together with step 1.1, this gives ∣u(x)−uB0∣≤C4(n,cJ)∫Ω∣Du(y)∣ ∣x−y∣1−ndy for almost every x∈Ω.

3.1F1F4F5step 2.1givenalgebra

Lp norms and the mean. Take Lp(Ω) norms in step 2.1 and apply the truncated kernel bound [F4] with Ω′=Ω⊆B(x0,diam⁡Ω) and f=∣Du∣: ∥u−uB0∥Lp(Ω)≤C5(n,cJ)diam⁡(Ω)∥Du∥Lp(Ω). Since uB0 is a constant, uΩ−uB0=∣Ω∣−1∫Ω(u−uB0), so by Holder [F5] ∣uB0−uΩ∣≤∣Ω∣−1∫Ω∣u−uB0∣≤∣Ω∣−1/p∥u−uB0∥Lp(Ω). Hence ∥u−uΩ∥Lp(Ω)≤∥u−uB0∥Lp(Ω)+∣Ω∣1/p∣uB0−uΩ∣≤2∥u−uB0∥Lp(Ω)≤C(n,p,cJ)diam⁡(Ω)∥Du∥Lp(Ω) with C(n,p,cJ):=2C5(n,cJ).

4.1F1F6algebra∎

Necessity of length scaling. On B=B(0,R) take u(x)=x1. By [F6] its weak gradient is e1, and reflection in the first coordinate gives uB=0. Substituting x=Ry yields ∥u∥Lp(B)=R1+n/p(∫B(0,1)∣y1∣pdy)1/p and ∥Du∥Lp(B)=Rn/p∣B(0,1)∣1/p. The first integral is finite and positive, since the unit ball contains a ball on which ∣y1∣ is bounded below by a positive number. Their ratio is therefore c(n,p)R with c(n,p)>0. The radial segment from any x to 0 satisfies R−∣γ(t)∣≥∣x∣−∣γ(t)∣=∣x−γ(t)∣, so this distinguished pair admits John constant 1 for every R. Thus no dimension-and-John-constant bound can omit the length factor.

Source notes

Kinnunen proves the Sobolev-Poincare inequality on John domains (Theorem 5.33, printed pp. 141-143) by exactly this chaining: the telescoping over ∣uBi−uBi+1∣, the ball Poincare inequality, the comparison ri≈∣x−y∣ on Bi, the multiplicity bound, and the truncated-kernel estimate. The present item states the Lp (rather than Lp∗) mean-zero form, which is what the surrounding page promises; the chaining argument is the same, and no Sobolev exponent is used. The endpoint index i=0 is absorbed with the John bound diam⁡Ω≤8cJr0.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Poincare inequality with a positive-measure zero set

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let n≥2, let Ω be a bounded John domain with admissible constant cJ, let 1≤p<∞, and let A⊆Ω be measurable with ∣A∣≥γ∣Ω∣ for some γ∈(0,1]. If u∈W1,p(Ω;K) vanishes almost everywhere on A, then ∥u∥Lp(Ω)≤C(n,p,cJ,γ)diam⁡(Ω)∥Du∥Lp(Ω).

Facts & Assumptions

Given: The Axiom of Choice; a bounded John domain Ω with constant cJ (John domains and the John constant); 1≤p<∞; a measurable A⊆Ω with ∣A∣≥γ∣Ω∣, γ∈(0,1]; and a class u∈W1,p(Ω;K) vanishing almost everywhere on A.

[F1]

The mean-zero Poincare inequality on the John domain: ∥w−wΩ∥Lp(Ω)≤C1(n,p,cJ)diam⁡(Ω)∥Dw∥Lp(Ω) for every w∈W1,p(Ω;K), where wΩ=∣Ω∣−1∫Ωw (The mean-zero Poincare inequality on bounded John domains, The average of a locally integrable function over a Euclidean ball).

[F2]

Weak derivatives are linear: D(w−c)=Dw for every constant c (Linearity, locality, and commutation of weak derivatives); W1,p consists of Lp classes with weak gradient in Lp, and Lp is a space of almost-everywhere classes (Integer-order Sobolev spaces and their norms, The space Lp(μ) as the quotient by null functions).

[F3]

Holder's inequality: ∫A∣v∣≤∣A∣1−1/p∥v∥Lp(Ω) for the finite measure set A (Holder's inequality for integrals, including the endpoint cases).

Proof

technique · direct
1.1F1F2givenalgebra

The mean-zero part. Since constants have zero weak derivative, v:=u−uΩ satisfies v∈W1,p(Ω;K) and Dv=Du by [F2]; by [F1], ∥v∥Lp(Ω)≤C1(n,p,cJ)diam⁡(Ω)∥Du∥Lp(Ω). Also v=u−uΩ almost everywhere on A, so u vanishes there if and only if v=−uΩ there.

2.1F3step 1.1givenalgebra

Recovering the mean from the zero set. Because u=0 almost everywhere on A and ∣A∣≤∣Ω∣<∞, ∫Av=∫A(u−uΩ)=−∣A∣uΩ; hence ∣A∣ ∣uΩ∣≤∫A∣v∣≤∣A∣1−1/p∥v∥Lp(Ω)≤∣A∣1−1/pC1diam⁡(Ω)∥Du∥Lp(Ω) by [F3] and step 1.1, and therefore ∣uΩ∣≤∣A∣−1/pC1diam⁡(Ω)∥Du∥Lp(Ω)≤(γ∣Ω∣)−1/pC1diam⁡(Ω)∥Du∥Lp(Ω).

3.1step 1.1step 2.1givenalgebra∎

Conclusion. By the triangle inequality and steps 1.1 and 2.1, ∥u∥Lp(Ω)≤∥u−uΩ∥Lp(Ω)+∣Ω∣1/p∣uΩ∣≤C1diam⁡(Ω)∥Du∥Lp(Ω)+C1γ−1/pdiam⁡(Ω)∥Du∥Lp(Ω)=C(n,p,cJ,γ)diam⁡(Ω)∥Du∥Lp(Ω) with C(n,p,cJ,γ):=C1(1+γ−1/p), which is the asserted inequality.

Source notes

Kinnunen's Remark 3.20 records the zero-set variant: a function vanishing on a set of positive measure can be normalised without the mean, and the mean itself is controlled by the amount of mass on the complement. The proof above implements that normalisation: the mean-zero inequality controls u−uΩ, and the value uΩ is recovered from the zero set by integrating u−uΩ over A. The exponent −1/p in the mean bound is what produces the constant γ−1/p.

CorollaryStatement: AI-adaptedProof: AI-adaptedOpen item page →

Poincare-Wirtinger on bounded convex domains by the direct pairwise argument

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let Ω⊆Rn be open, bounded, convex and nonempty, and let 1≤p<∞. Then ∥u−uΩ∥Lp(Ω)≤C(n)diam⁡(Ω)∥Du∥Lp(Ω) for every u∈W1,p(Ω;K).

Here uΩ=∣Ω∣−1∫Ωu dx is the mean of u over Ω, which is well defined because Ω is nonempty open and bounded. The proof below gives the explicit choice C(n)=2 (2n−1)n, which depends only on the dimension; no dependence on p, on the shape of Ω, on ∣Ω∣ or on the regularity of ∂Ω is used.

Facts & Assumptions

Given: The Axiom of Choice; an integer n≥1; an open, bounded, convex, nonempty set Ω⊆Rn with d:=diam⁡(Ω); an exponent 1≤p<∞; a field K∈{R,C}; and a class u∈W1,p(Ω;K).

[F1]

W1,p(Ω;K) consists of the Lp(Ω;K) classes whose weak first derivatives exist as Lp classes, and ∥Du∥Lp(Ω) is the Lp norm of the weak gradient (Integer-order Sobolev spaces and their norms); an element of Lp is an almost-everywhere equivalence class of measurable representatives (The space Lp(μ) as the quotient by null functions).

[F2]

The Axiom of Choice is the statement that every family of nonempty sets has a choice function (The Axiom of Choice); it implies the Axiom of Countable Choice, the statement that every at most countable family of nonempty sets has a choice function (The Axiom of Countable Choice (ACω)).

[F3]

Under Countable Choice, for every open U⊂⊂Ω the interior mollifications uε of u satisfy uε→u in W1,p(U;K) as ε→0+ (Local smooth approximation in integer-order Sobolev spaces).

[F4]

On a completed sigma-finite product, nonnegative measurable functions may be integrated in either order and the iterated integrals agree, and integrable functions obey the same identity; this is Tonelli-Fubini (Tonelli and Fubini for the completed product, with only almost-everywhere section measurability).

[F5]

Jensen's inequality: for a probability space, an integrable real function f with values in an interval I and a convex φ on I such that φ∘f∈L1(P), one has φ(∫f dP)≤∫φ(f) dP (Jensen's integral inequality for a probability measure).

[F6]

Holder's inequality: for conjugate exponents p,q and measurable real f,g in the corresponding L-spaces, ∫∣fg∣ dμ≤∥f∥p∥g∥q (Holder's inequality for integrals, including the endpoint cases).

[F7]

For a C1 diffeomorphism T:U→V between open subsets of Rm and every nonnegative Borel h:V→[0,∞], ∫Vh(y) dy=∫Uh(T(x))∣det⁡DT(x)∣ dx, with equality in [0,∞] and the convention 0⋅∞=0 (Borel change of variables from the compact-support formula and Radon uniqueness).

[F8]

If f:[a,b]→Rm is differentiable with integrable derivative 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); if g∘f is formed from totally differentiable maps then D(g∘f)(a)=Dg(f(a))∘Df(a) (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)).

[F9]

Every Euclidean ball has positive finite Lebesgue measure (Euclidean balls have positive finite Lebesgue measure), a measure is monotone under inclusion (Measures are monotone), and every bounded subset of Rn has finite outer measure (Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure).

[F10]

Dominated convergence applies to integrable majorants (Dominated convergence).

Proof

technique · direct
1.1F1F6F9givenalgebra

Means and integrability. Since Ω is nonempty and open it contains a Euclidean ball B⊆Ω, and [F9] gives 0<λ(B)≤λ(Ω) by monotonicity; since Ω is bounded, [F9] gives ∣Ω∣<∞. Thus 0<∣Ω∣<∞ and uΩ is defined once u is integrable. For 1<p<∞ Holder's inequality [F6] with g=1Ω gives ∥u∥1≤∣Ω∣1−1/p∥u∥p<∞, and for p=1 integrability is immediate; in both cases u∈L1(Ω;K) and uΩ is an element of K, understood componentwise when K=C≅R2.

1.2F5F8givenalgebra

The smooth segment inequality. Let V⊆Ω be open and convex and let v∈C∞(V;K)∩W1,p(V;K). Fix x,y∈V and put γ(t)=x+t(y−x) for t∈[0,1]; convexity gives γ([0,1])⊆V. By the chain rule [F8], v∘γ is differentiable with (v∘γ)′(t)=Dv(γ(t))(y−x), and the vector-valued fundamental theorem [F8] gives v(x)−v(y)=∫01Dv(γ(t))(x−y) dt. Hence ∣v(x)−v(y)∣≤∣x−y∣∫01∣Dv(γ(t))∣ dt, and, since Dv is continuous on the compact segment, ∣Dv∘γ∣p is integrable. Jensen's inequality [F5] applied to the probability measure dt on [0,1] and the convex function φ(s)=sp on [0,∞) yields ∣v(x)−v(y)∣p≤∣x−y∣p∫01∣Dv(γ(t))∣p dt.

2.1F4F7step 1.2algebra

The first half of the substitution. For t∈[1/2,1] and fixed x∈V, the affine diffeomorphism y↦z=(1−t)x+ty has image (1−t)x+tV⊆V and inverse Jacobian t−n. Bound ∣x−y∣≤d before substituting in [F7]; this gives ∫V∣x−y∣p∣Dv((1−t)x+ty)∣p dy≤dpt−n∫V∣Dv∣p. Integrating over x∈V and t∈[1/2,1] yields cndp∣V∣∫V∣Dv∣p, where cn:=∫1/21t−n dt.

2.2F4F7step 1.2algebra

The second half. For t∈[0,1/2] and fixed y∈V, substitute z=(1−t)x+ty∈V in the x integral. The bound ∣x−y∣≤d and [F7] give ∫V∣x−y∣p∣Dv((1−t)x+ty)∣p dx≤dp(1−t)−n∫V∣Dv∣p. Integration over y and t, with s=1−t, gives the same cndp∣V∣∫V∣Dv∣p.

3.1F4F5step 2.1step 2.2algebra

The mean-zero bound for smooth functions. Adding steps 2.1 and 2.2 and using [F4] to identify the iterated integral over V×V×[0,1] of the nonnegative integrand with the sum of its two halves, ∫V∫V∣v(x)−v(y)∣p dx dy≤2cn dp∣V∣∫V∣Dv∣p. The normalized Lebesgue measure dy/∣V∣ is a probability measure, so using ∣∫h∣≤∫∣h∣ and scalar Jensen [F5] for s↦sp, with vV=∣V∣−1∫Vv, the required integrability holds because v∈Lp(V) implies ∣v(x)−v(⋅)∣p∈L1(V) for every fixed x; hence one has ∣v(x)−vV∣p≤∣V∣−1∫V∣v(x)−v(y)∣p dy for every x∈V, and integrating in x yields ∫V∣v−vV∣p≤2cn dp∫V∣Dv∣p.

4.1F1F2F3step 3.1givenalgebra

Passage to W1,p and to the whole of Ω. Choose open convex sets V1⊆V2⊆⋯⊂⊂Ω with ⋃jVj=Ω, for instance Vj={x∈Ω:dist⁡(x,Rn∖Ω)>1/j}∩B(0,j). Fix j; by [F3] the mollifications uε of u converge to u in W1,p(Vj;K) as ε→0+, and each uε is smooth on a neighbourhood of Vj. Step 3.1 applied to v=uε on the convex set Vj, followed by the limits ∥uε−u∥Lp(Vj)→0, ∥Duε−Du∥Lp(Vj)→0 and (uε)Vj→uVj as ε→0+, gives ∫Vj∣u−uVj∣p≤2cn dp∫Vj∣Du∣p≤2cn dp∫Ω∣Du∣p.

5.1F10step 4.1algebra∎

Exhaustion and the constant. Discard the finitely many empty Vj. Since Vj↑Ω and u∈L1, dominated convergence [F10] gives ∣Vj∣→∣Ω∣ and uVj→uΩ. The means are bounded; hence 1Vj∣u−uVj∣p is dominated by 2p−1(∣u∣p+sup⁡j∣uVj∣p) on the finite-measure set Ω. By [F10] it converges in integral to ∣u−uΩ∣p, and similarly ∫Vj∣Du∣p→∫Ω∣Du∣p. Step 4.1 yields ∥u−uΩ∥p≤(2cn)1/pd∥Du∥p. For 1/2≤t≤1, t−n≥1 and t−n≤t−n−1, so 1≤2cn≤2∫1/21t−n−1 dt=2(2n−1)/n. Thus (2cn)1/p≤2cn≤2(2n−1)/n for every p≥1, proving the stated dimension-only constant.

Source notes

The computation follows Kinnunen's ball proof of the pointwise oscillation estimate and the Poincare inequality, printed pp. 133-136, with the segment argument of Lemma 5.22: the ball is replaced by the convex set, polar coordinates and the maximal function are not needed, and the two halves of the parameter interval carry the substitution from the moving interior point to a fixed one. The constant is not claimed to be sharp; the dimension-only bound is the conclusion used here.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Sobolev embedding on bounded extension domains for p<n

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let n≥2, let Ω⊆Rn be a bounded W1,p-extension domain with a bounded extension operator E, and let 1≤p<n, p≤q≤p∗=npn−p. Then W1,p(Ω)↪Lq(Ω) continuously: ∥u∥Lq(Ω)≤C(n,p,q,Ω)∥u∥W1,p(Ω)(u∈W1,p(Ω;K)).

Facts & Assumptions

Given: The Axiom of Choice; n≥2; a bounded extension domain Ω with a bounded extension operator E and operator norm ∥E∥ (Sobolev extension domains and extension operators); 1≤p<n; p≤q≤p∗; a field K.

[F1]

For 1<p<n, the whole-space Gagliardo-Nirenberg-Sobolev inequality holds (The Gagliardo-Nirenberg-Sobolev inequality for 1<p<n). For p=1, compactly supported smooth density (Compactly supported smooth functions are dense in W^{k,p}(R^n)) extends The p=1 Gagliardo-Nirenberg-Sobolev inequality to W1,1(Rn): the smooth estimate on differences gives an Ln/(n−1) Cauchy sequence, completeness gives its limit, and successive almost-everywhere subsequences in that space and in L1 identify the limit with the Sobolev class (Riesz-Fischer completeness of Lp for 1≤p≤∞, Complex Lp completeness and almost-everywhere subsequences). Thus ∥F∥p∗≤C(n,p)∥DF∥p for every 1≤p<n (The Sobolev conjugate exponent and the scaling identity).

[F2]

The transfer corollary: if N is a whole-space functional with NΩ(F∣Ω)≤N(F) and N(F)≤C∥F∥W1,p(Rn), then NΩ(u)≤C∥E∥∥u∥W1,p(Ω) for all u in W1,p(Ω) (Whole-space inequalities transfer through a Sobolev extension).

[F3]

Holder's inequality gives the Lq interpolation bound ∥v∥Lq(Ω)≤∥v∥Lp(Ω)θ∥v∥Lp∗(Ω)1−θ whenever 1≤p≤q≤p∗<∞ and 1q=θp+1−θp∗, on a finite measure set (Holder's inequality for integrals, including the endpoint cases).

[F4]

W1,p consists of Lp classes with weak gradient in Lp, and ∥v∥Lp(Ω)≤∥v∥W1,p(Ω) (Integer-order Sobolev spaces and their norms, The space Lp(μ) as the quotient by null functions); every bounded Ck domain supplies an admissible extension operator through the extension theorem (Bounded C^k domains admit integer-order Sobolev extension).

Proof

technique · direct
1.1F1F2givenalgebra

The endpoint q=p∗. Apply the transfer corollary [F2] with N(F)=∥F∥Lp∗(Rn), which satisfies the two hypotheses by [F1], enlarging C(n,p) by the finite-dimensional comparison between the Euclidean gradient and the coordinate Sobolev norm: ∥F∥Lp∗(Rn)≤C(n,p)∥F∥W1,p(Rn) and, since Eu restricts to u almost everywhere, ∥u∥Lp∗(Ω)=∥(Eu)∣Ω∥Lp∗(Ω)≤∥Eu∥Lp∗(Rn). Hence ∥u∥Lp∗(Ω)≤C(n,p)∥E∥∥u∥W1,p(Ω).

2.1F3F4step 1.1givenalgebra

Intermediate exponents. For p≤q≤p∗ write 1q=θp+1−θp∗ with θ=1/q−1/p∗1/p−1/p∗∈[0,1] (at q=p take θ=1, at q=p∗ take θ=0). By [F3], ∥u∥Lq(Ω)≤∥u∥Lp(Ω)θ∥u∥Lp∗(Ω)1−θ≤max⁡(1,C(n,p)∥E∥)∥u∥W1,p(Ω) using ∥u∥Lp≤∥u∥W1,p from [F4] and step 1.1; the case q=p is the same inequality with θ=1.

3.1F4step 1.1step 2.1givenalgebra∎

The constant and the domain class. The constant obtained depends only on n,p,q and ∥E∥, hence only on n,p,q,Ω for a fixed extension domain; every bounded Ck domain, k≥1, supplies an admissible E through [F4], so the embedding applies in particular to that class.

Source notes

The endpoint case is the whole-space Sobolev inequality transferred through a bounded extension operator, Kinnunen's Theorem 3.43 (printed pp. 84–85) and Definition 3.42; the intermediate exponents are the standard Holder interpolation between Lp and Lp∗ on the finite measure set Ω. The constant is not asserted to be uniform over all extension domains, matching the transfer corollary's dependence on ∥E∥.

TheoremStatement: AI-adaptedProof: AI-adaptedOpen item page →

Sobolev-Poincare on bounded connected extension domains

Statement

Assume the Axiom of Choice (and hence Countable Choice and Dependent Choice). Let n≥2, 1<p<n, p∗=npn−p, let K∈{R,C}, and let Ω⊂Rn be a nonempty bounded connected W1,p-extension domain. There is C=C(n,p,Ω,K) such that every u∈W1,p(Ω;K) satisfies ∥u−uΩ∥Lp∗(Ω)≤C∥Du∥Lp(Ω),uΩ=∣Ω∣−1∫Ωu. The domain constant is not uniform over arbitrary extension domains.

Facts & Assumptions

Given: The Axiom of Choice, hence Countable Choice and Dependent Choice; n≥2; 1<p<n; a nonempty bounded connected W1,p-extension domain Ω (Sobolev extension domains and extension operators); a field K; and a class u∈W1,p(Ω;K).

[F1]

The local mean-zero estimate on bounded connected extension domains: there is CP=CP(n,p,Ω,K) with ∥w−wΩ∥Lp(Ω)≤CP∥Dw∥Lp(Ω) for every w∈W1,p(Ω;K) (Mean-zero Poincare estimate on bounded connected extension domains below the dimension).

[F2]

Constants have zero weak derivative and weak derivatives are linear, so D(w−c)=Dw (Linearity, locality, and commutation of weak derivatives); W1,p consists of Lp classes with weak gradient in Lp (Integer-order Sobolev spaces and their norms, The space Lp(μ) as the quotient by null functions).

[F3]

The extension-domain embedding: for 1≤p<n and p≤q≤p∗, ∥w∥Lq(Ω)≤CE(n,p,q,Ω)∥w∥W1,p(Ω) (Sobolev embedding on bounded extension domains for p<n, The Sobolev conjugate exponent and the scaling identity).

[F4]

On the finite measure set Ω, Holder's inequality gives w∈L1(Ω) for every w∈Lp(Ω) with ∥w∥1≤∣Ω∣1−1/p∥w∥p, so the mean uΩ is defined (Holder's inequality for integrals, including the endpoint cases).

Proof

technique · direct
1.1F1F2F4givenalgebra

Centering and the local estimate. By [F4] the mean uΩ is a well-defined scalar; put v:=u−uΩ. By [F2], v∈W1,p(Ω;K) with Dv=Du and vΩ=0, and by [F1] applied to v, ∥v∥Lp(Ω)≤CP∥Du∥Lp(Ω).

2.1F3step 1.1givenalgebra∎

The critical exponent. Apply the extension-domain embedding [F3] to v with q=p∗: ∥v∥Lp∗(Ω)≤CE∥v∥W1,p(Ω); since ∥v∥W1,p(Ω) is, up to a dimension-only factor, ∥v∥Lp(Ω)+∥Dv∥Lp(Ω)≤(1+CP)∥Du∥Lp(Ω) by step 1.1, renaming the product constant gives ∥u−uΩ∥Lp∗(Ω)≤C(n,p,Ω,K)∥Du∥Lp(Ω), which is the asserted inequality.

Source notes

Kinnunen's Theorem 3.47 is the mean-zero Lp∗ estimate, whose proof first establishes the mean-zero Lp estimate on bounded connected extension domains, proved there by Rellich compactness; the local item cited as [F1] supplies it directly with the extension-cutoff-mollification and Arzela-Ascoli argument on this page. The step from the Lp mean-zero estimate to the critical exponent is the extension-domain embedding, exactly as Kinnunen combines Theorem 3.47 with the Sobolev embedding. The constant depends on the extension operator through CE; no uniformity over all extension domains is claimed, matching the statement.

TheoremStatement: AI-adaptedProof: AI-adaptedOpen item page →

The critical Sobolev embedding into every finite Lq

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let n≥2 and let Ω⊆Rn be nonempty, open, bounded and a W1,p-extension domain for every p∈(n/2,n) (the extension operator may depend on p). For every 1≤q<∞ there is C(n,q,Ω) with ∥u∥Lq(Ω)≤C(n,q,Ω)∥u∥W1,n(Ω)(u∈W1,n(Ω;K)); that is, W1,n(Ω)↪Lq(Ω) continuously for every finite q. The constant necessarily blows up as q→∞, so no L∞ bound is asserted.

Facts & Assumptions

Given: The Axiom of Choice; n≥2; a bounded nonempty open set Ω that is a W1,p-extension domain for every p∈(n/2,n), with the operator allowed to depend on p (Sobolev extension domains and extension operators); 1≤q<∞; and a class u∈W1,n(Ω;K).

[F1]

Holder's inequality on the finite measure set Ω: for 1≤a≤b<∞, ∥w∥La(Ω)≤∣Ω∣1/a−1/b∥w∥Lb(Ω) (Holder's inequality for integrals, including the endpoint cases).

[F2]

Subcritical Sobolev embedding: for 1≤p<n and p≤r≤p∗=npn−p, ∥w∥Lr(Ω)≤C(n,p,r,Ω)∥w∥W1,p(Ω) on a bounded extension domain (Sobolev embedding on bounded extension domains for p<n).

[F3]

W1,n consists of the Ln classes with all first weak derivatives in Ln, and the Sobolev norm is the ℓn norm of the component Ln norms (Integer-order Sobolev spaces and their norms, The space Lp(μ) as the quotient by null functions, The Sobolev conjugate exponent and the scaling identity).

[F4]

If B(a,2R)‾⊂Ω, there is η∈Cc∞(B(a,2R)) equal to 1 on B(a,R) (A Euclidean bump for a compact set inside an open set). Polar coordinates give the radial integral formula (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma, The polar surface set function on the unit sphere), and weak derivatives are defined by integration by parts against compactly supported smooth tests (Weak derivative of a locally integrable function).

Proof

technique · direct
1.1F1F3givenalgebra

The case q≤n. By [F1] with a=q and b=n, ∥u∥Lq(Ω)≤∣Ω∣1/q−1/n∥u∥Ln(Ω)≤∣Ω∣1/q−1/n∥u∥W1,n(Ω).

1.2F1F2F3givenalgebra

The case q>n. Put s:=nqn+q. Then n/2<s<n and s∗=nsn−s=q by [F3]. By the domain hypothesis, Ω is a W1,s-extension domain, so the subcritical embedding [F2] with p=s and r=q=s∗ gives ∥u∥Lq(Ω)≤C(n,s,q,Ω)∥u∥W1,s(Ω). Holder [F1] applied to each component with a=s<b=n gives ∥Dαu∥Ls≤∣Ω∣1/s−1/n∥Dαu∥Ln for ∣α∣≤1; summing over the finitely many multi-indices yields ∥u∥W1,s(Ω)≤C(∣Ω∣,n,s)∥u∥W1,n(Ω). Combining the two estimates proves the case q>n; since s=nq/(n+q), the resulting constant depends only on n,q,Ω.

2.1F3F4step 1.1step 1.2givenalgebra∎

Conclusion. Steps 1.1 and 1.2 cover q≤n and q>n, so every finite q is covered with a constant depending only on n,q,Ω. To see that these constants cannot remain bounded as q→∞, choose a∈Ω and R>0 with B(a,2R)‾⊂Ω, and choose η as in [F4]. Define w(x)=η(x)log⁡log⁡(1+R/∣x−a∣) for x≠a, assigning any finite value at a. If r=∣x−a∣≤R/2, then ∣Dlog⁡log⁡(1+R/r)∣=Rr(r+R)log⁡(1+R/r)≤1rlog⁡(R/r). Thus polar coordinates [F4] give ∫B(a,R/2)∣Dw∣n dx≤C∫0R/2drr(log⁡(R/r))n<∞ for n≥2; also w∈Ln near a because log⁡log⁡(1+R/r)=O(r−1/2) and the polar Ln integral of r−1/2 converges for n≥2, and on the rest of its compact support w is smooth with bounded derivatives. For every coordinate line with nonzero transverse displacement from a, w is smooth and compactly supported on that line. Apply the fundamental theorem (If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz) to w times a test function. The transverse singleton of excluded lines is null since n≥2, and w,Dw∈Ln⊆L1 on their bounded support. Fubini (Tonelli and Fubini for the completed product, with only almost-everywhere section measurability) therefore integrates the section identities to the weak derivative identity, proving w∈W1,n(Ω). It is essentially unbounded on every neighbourhood of a: for every M>0 it exceeds M on a punctured ball about a, so EM has positive measure. If qj→∞ and admissible constants satisfied C(qj)≤C∗, then for each M>0, the set EM={x:∣w(x)∣>M} has positive measure and C∗∥w∥W1,n(Ω)≥∥w∥Lqj(Ω)≥M∣EM∣1/qj. Letting j→∞ gives C∗∥w∥W1,n≥M for every M, a contradiction. Hence the best constants necessarily diverge as q→∞, and no L∞ endpoint is asserted.

Source notes

Kinnunen's Remark 3.16 and Hunter's discussion at p=n record the critical embedding W1,n↪Lq for finite q and the failure of the L∞ endpoint. The proof above reduces q>n to the subcritical embedding with source exponent s=nq/(n+q)∈(n/2,n) and uses Holder on the finite measure domain to compare W1,s with W1,n. The all-exponents hypothesis supplies exactly this W1,s extension operator for each finite q>n; the case q≤n is direct Holder.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Ball-mean oscillation bound by the Riesz potential of the gradient

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let n≥2, let 1≤p<∞, let B(x,r)⊆Rn be a ball, and let u∈W1,p(B(x,r);K) with ball average uB(x,r). Then ∣u(z)−uB(x,r)∣≤C(n)∫B(x,r)∣Du(y)∣ ∣z−y∣1−n dy for almost every z∈B(x,r); here ∣Du∣ is the Euclidean norm of the weak gradient and C(n) depends only on n.

Facts & Assumptions

Given: Countable Choice; n≥2; x∈Rn and r>0; 1≤p<∞; a field K∈{R,C}; and a class u∈W1,p(B(x,r);K).

[F1]

The polar surface measure is normalized by σ(E)=nλn({tω:ω∈E, 0<t≤1}) on Borel E⊆Sn−1, and for nonnegative Borel h one has ∫Rnh dλn=∫0∞∫Sn−1h(tω)tn−1 dσ(ω) dt (The polar surface set function on the unit sphere, Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma).

[F2]

For every ball λn(B(z,ρ))=σ(Sn−1)ρn/n, and this is positive and finite (Sphere and ball measures scale in Rn).

[F3]

If a curve is composed from differentiable maps then the chain rule computes its derivative, and a differentiable curve with integrable derivative satisfies the fundamental theorem of calculus (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a), If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz).

[F5]

Truncated Riesz kernel bound: for measurable Ω⊆B(z0,ρ) and f∈Lp(Ω;K), ∥∫Ω∣x−y∣1−n∣f(y)∣ dy∥Lp(Ω)≤C(n)ρ∥f∥Lp(Ω) (The truncated Riesz kernel is bounded on Lp of a bounded set).

[F6]

Interior mollifications converge to u in W1,p(U) on every U⋐B(x,r) (Local smooth approximation in integer-order Sobolev spaces). Norm convergence has an almost-everywhere convergent subsequence (Riesz-Fischer completeness of Lp for 1≤p≤∞, Complex Lp completeness and almost-everywhere subsequences). Dominated convergence applies to integrable majorants (Dominated convergence).

[F7]

The ball average uB=∣B∣−1∫Bu is the normalized integral of the class, and W1,p consists of the Lp classes with weak gradient in Lp (The average of a locally integrable function over a Euclidean ball, Integer-order Sobolev spaces and their norms, The space Lp(μ) as the quotient by null functions).

[F8]

On a finite measure space Lp includes into L1, so ui→u in Lp implies (ui)B→uB (Finite-measure Lr includes into Lp for p<r).

[F9]

The Axiom of Countable Choice is available and is used through the cited measure-theoretic and approximation interfaces (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1F1F3F4givenalgebra

Spherical oscillation bound for a smooth function. Let v∈C∞(Rn;K), B:=B(x,r), and fix z∈B and ρ>0. For y∈B the chain rule and the fundamental theorem [F3] applied to t↦v(ty+(1−t)z) give v(y)−v(z)=∫01Dv(ty+(1−t)z)⋅(y−z) dt, hence ∣v(y)−v(z)∣≤∣y−z∣∫01∣Dv(ty+(1−t)z)∣ dt. Writing Sρ:=∂B(z,ρ) for the sphere equipped with its surface measure, and using that the homothety y↦ty+(1−t)z maps Sρ onto Stρ with surface element scaled by tn−1; its image of B∩Sρ is contained in B∩Stρ by convexity, so enlargement gives the inequality below (the surface measures are the polar measures of cones, so this is the linear change-of-variables property of [F1] and [F4]), ∫B∩Sρ∣v(y)−v(z)∣ dS(y)≤ρ∫01∫B∩Sρ∣Dv(ty+(1−t)z)∣ dS(y) dt≤ρ∫01t1−n∫B∩Stρ∣Dv(w)∣ dS(w) dt. Since ∣w−z∣=tρ on Stρ, the inner integral equals ρn−1tn−1∫B∩Stρ∣Dv(w)∣ ∣z−w∣1−n dS(w); substituting s=tρ, so that dt=ds/ρ, the last display becomes ρn−1∫0ρ∫B∩Ss∣Dv(w)∣ ∣z−w∣1−n dS(w) ds=ρn−1∫B∩B(z,ρ)∣Dv(w)∣ ∣z−w∣1−n dw, the final equality being the polar-coordinate formula [F1] for the nonnegative function w↦∣Dv(w)∣∣z−w∣1−n on B∩B(z,ρ) (whose singularity at w=z is integrable; a single point is null).

2.1F1F2F7step 1.1algebra

The oscillation bound for a smooth function. Let v∈C∞(Rn;K) and keep B=B(x,r). Since uB is the normalized integral, ∣v(z)−vB∣=∣B∣−1∣∫B(v(z)−v(y)) dy∣; writing the integral over B in polar coordinates around z and using B⊆B(z,2r), step 1.1 gives ∣v(z)−vB∣≤∣B∣−1∫02r∫B∩Sρ∣v(y)−v(z)∣ dS(y) dρ≤∣B∣−1∫02rρn−1 dρ∫B∣Dv(y)∣ ∣z−y∣1−n dy for every z∈B. By [F2], ∣B∣=σ(Sn−1)rn/n and ∫02rρn−1dρ=(2r)n/n, so ∣B∣−1∫02rρn−1dρ=2n/σ(Sn−1)=:c(n); hence ∣v(z)−vB∣≤c(n)∫B∣Dv(y)∣∣z−y∣1−ndy for every z∈B.

3.1F5F6F8F9step 2.1algebra

First pass to the Sobolev class on an inner ball Bj:=B(x,r(1−1/j)), j≥2. Its closure lies in B, so [F6] supplies smooth mollifications ui→u in W1,p(Bj). By [F8] their Bj means converge. Apply step 2.1 on Bj. The potential operator on Bj satisfies [F5], and ∣∫Bj∣Dui(y)∣∣z−y∣1−ndy−∫Bj∣Du(y)∣∣z−y∣1−ndy∣≤∫Bj∣Dui−Du∣(y)∣z−y∣1−ndy tends to zero in Lp(Bj) by [F5]. Successive almost-everywhere subsequences from [F6] for ui and these potentials therefore give ∣u(z)−uBj∣≤c(n)∫Bj∣Du(y)∣∣z−y∣1−ndy for almost every z∈Bj.

4.1F6F8step 3.1algebra∎

Take the union of the countably many exceptional null sets from step 3.1. For z outside this union, z∈Bj for every sufficiently large j, and each right side is at most c(n)∫B∣Du(y)∣∣z−y∣1−ndy. Since u∈L1(B), dominated convergence [F6] gives uBj→uB. Letting j→∞ proves the asserted inequality on B, without any approximation claim at its boundary.

Source notes

The computation is Kinnunen's Lemma 5.22, printed pp. 133-135: the spherical change of variables w=ty+(1−t)z, the radius substitution s=tρ and the final polar-coordinate identity are reproduced with their justification, and the explicit constant 2n/σ(Sn−1) is recorded. Kinnunen states the lemma for C1(Rn) functions and then passes to Wloc1,p by mollification and the Lp bound for the Riesz potential of the gradient; the passage above uses the library's interior mollification and its truncated-kernel bound, which already carries the John-domain rescaling used later on the companion page.

TheoremStatement: AI-adaptedProof: AI-adaptedOpen item page →

Morrey's inequality for p>n

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let n≥2, n<p<∞, let Ω⊆Rn be open and let u∈W1,p(Ω;K). Then u has a continuous representative u∗, and for every ball B(x,r) with B(x,2r)⋐Ω one has ∣u∗(z)−u∗(y)∣≤C(n,p) ∣z−y∣1−n/p ∥Du∥Lp(B(x,2r))(z,y∈B(x,r)); equivalently [u∗]C0,1−n/p(B(x,r))≤C(n,p)∥Du∥Lp(B(x,2r)).

Facts & Assumptions

Given: The Axiom of Choice, used through the Countable-Choice interfaces of the cited measure-theoretic and approximation results; n≥2; n<p<∞; an open set Ω⊆Rn; a field K∈{R,C}; and a class u∈W1,p(Ω;K).

[F1]

The ball oscillation estimate: for a ball B(x,ρ) and u∈W1,p(B(x,ρ)), ∣u(z)−uB(x,ρ)∣≤C0(n)∫B(x,ρ)∣Du(y)∣ ∣z−y∣1−ndy for almost every z∈B(x,ρ) (Ball-mean oscillation bound by the Riesz potential of the gradient).

[F2]

Holder's inequality ∫∣fg∣≤∥f∥p∥g∥p′ for conjugate exponents (Holder's inequality for integrals, including the endpoint cases), and ∫B(z,R)∣z−y∣(1−n)p′dy=ωn−1R n−(n−1)p′/(n−(n−1)p′) with n−(n−1)p′>0 because p>n, while (n−(n−1)p′)/p′=1−n/p by polar coordinates (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma).

[F3]

The ball average is the normalized integral, and Aρu(x)→u(x) as ρ↓0 for almost every x (The average of a locally integrable function over a Euclidean ball, Lebesgue differentiation theorem on Rn).

[F4]

W1,p consists of the Lp classes with weak gradient in Lp; Lp classes are determined up to null sets; for α=1−n/p∈(0,1) the local Holder norm is [v]C0,α(B)=sup⁡z≠y∈B∣v(z)−v(y)∣/∣z−y∣α (Integer-order Sobolev spaces and their norms, The space Lp(μ) as the quotient by null functions, Local Hölder and scaled C-two-alpha norms on balls).

[F5]

Countable Choice is available from the Axiom of Choice and is the hypothesis of the cited differentiation interface; the cited Holder theorem requires no choice hypothesis (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1F1F2givenalgebra

Oscillation on a ball. Fix a ball B(x,ρ)⊆Ω. By [F1], for almost every z∈B(x,ρ), ∣u(z)−uB(x,ρ)∣≤C0(n)∫B(x,ρ)∣Du(y)∣ ∣z−y∣1−ndy. Holder [F2] with exponents p and p′ bounds this by C0(n)∥Du∥Lp(B(x,ρ))(∫B(z,2ρ)∣z−y∣(1−n)p′dy)1/p′, where the integration region has been enlarged from B(x,ρ)⊆B(z,2ρ) to B(z,2ρ). By [F2] the kernel integral equals c(n,p)ρ n−(n−1)p′ with n−(n−1)p′>0 and exponent (n−(n−1)p′)/p′=1−n/p, so ∣u(z)−uB(x,ρ)∣≤C1(n,p) ρ1−n/p∥Du∥Lp(B(x,ρ)) for almost every z∈B(x,ρ).

2.1F2F3F4F5step 1.1givenalgebra

Convergence of the ball means and the representative. Fix a ball B(x,r) with B(x,2r)⋐Ω and let 0<ρ≤σ≤r. For almost every z∈B(x,ρ) step 1.1 applied on B(x,σ) gives ∣u(z)−uB(x,σ)∣≤C1σ1−n/p∥Du∥Lp(B(x,σ))≤C1σ1−n/p∥Du∥Lp(B(x,r)); averaging in z over B(x,ρ) yields ∣uB(x,ρ)−uB(x,σ)∣≤C1σ1−n/p∥Du∥Lp(B(x,r)). Hence the net (uB(x,ρ))ρ↓0 is Cauchy and we may define u∗(x):=lim⁡ρ↓0uB(x,ρ) for every x such that some B(x,2r)⋐Ω, with ∣u∗(x)−uB(x,ρ)∣≤C1ρ1−n/p∥Du∥Lp(B(x,r)) for 0<ρ≤r. The zero extension of u to Rn lies in Lloc1(Rn) by Holder [F2] on bounded balls, since u∈Lp(Ω); its sufficiently small ball means at each interior point are those of u. Thus [F3] and [F4] give uB(x,ρ)→u(x) for almost every x, so u∗=u almost everywhere: u∗ is a representative of the class. The Countable-Choice interface used here is supplied by [F5].

3.1F4step 1.1step 2.1givenalgebra∎

The Holder bound and continuity. Let z,y∈B(x,r) and put ℓ:=∣z−y∣; the case ℓ=0 is trivial. If ℓ≤r/2, apply step 1.1 on the balls B(z,ℓ) and B(y,ℓ) and step 2.1 on their means: ∣u∗(z)−uB(z,ℓ)∣≤C1ℓ1−n/p∥Du∥Lp(B(z,ℓ)) and similarly at y; both balls lie in B(x,r+ℓ)⊆B(x,2r) when ℓ≤r/2, so the two norms are at most ∥Du∥Lp(B(x,2r)). For the difference of the two means, both balls B(z,ℓ) and B(y,ℓ) lie in B(z,2ℓ)⊆B(x,r+2ℓ)⊆B(x,2r), and step 1.1 on B(z,2ℓ) bounds ∣u(a)−u(b)∣≤2C1(2ℓ)1−n/p∥Du∥Lp(B(x,2r)) for almost every a∈B(z,ℓ), b∈B(y,ℓ); averaging gives ∣uB(z,ℓ)−uB(y,ℓ)∣≤2C1(2ℓ)1−n/p∥Du∥Lp(B(x,2r)). Combining the three terms, ∣u∗(z)−u∗(y)∣≤C2(n,p)ℓ1−n/p∥Du∥Lp(B(x,2r)). If ℓ>r/2, use the mean over the fixed ball B(x,2r): by step 1.1 on B(x,2r), for almost every a∈B(x,2r) one has ∣u(a)−uB(x,2r)∣≤C1(2r)1−n/p∥Du∥Lp(B(x,2r)), and since B(z,ρ)⊆B(x,2r) for 0<ρ<r, averaging over B(z,ρ) and letting ρ↓0 gives ∣u∗(z)−uB(x,2r)∣≤C1(2r)1−n/p∥Du∥Lp(B(x,2r)), with the same bound at y; hence ∣u∗(z)−u∗(y)∣≤2C1(2r)1−n/p∥Du∥Lp(B(x,2r))≤C2′ ℓ1−n/p∥Du∥Lp(B(x,2r)) because (2r)1−n/p≤41−n/pℓ1−n/p when ℓ>r/2. This proves the displayed estimate with a constant depending only on n and p; since the exponent 1−n/p is positive, u∗ is continuous on every ball B(x,r) with B(x,2r)⋐Ω, hence on all of Ω, and the equivalent Holder-norm statement follows from [F4].

Source notes

Kinnunen proves Morrey's inequality by combining the ball oscillation estimate (Lemma 5.22, reproduced in the preceding item) with Holder's inequality in the form ∫B(x,r)∣Du(w)∣∣y−w∣1−ndw≤cr1−n/p∥Du∥Lp(B(x,r)), printed pp. 140 and 77-79; the present proof follows that route and records the two-regime comparison of means needed because the statement normalizes the right-hand norm on the fixed ball B(x,2r). The continuity of the representative and the identification u∗=u almost everywhere are the standard Lebesgue-point argument.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

W1,∞ functions on convex domains have Lipschitz representatives

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let n≥1 and let Ω⊆Rn be open, bounded and convex. If u∈W1,∞(Ω;K), then u has a representative u∗ with ∣u∗(x)−u∗(y)∣≤∥Du∥L∞(Ω) ∣x−y∣(x,y∈Ω), and u∗=u almost everywhere on Ω. Conversely, every Lipschitz function f:Ω→K with constant L lies in W1,∞(Ω) and ∥Df∥L∞(Ω)≤L for real scalars, while ∥Df∥L∞(Ω)≤2L for complex scalars. In both cases the real-linear derivative has operator norm at most L almost everywhere.

Gradient convention. For a weak gradient Dv=(D1v,…,Dnv) we write ∣Dv∣=(∑i=1n∣Div∣2)1/2 for its Euclidean norm and ∥Dv∥L∞(Ω):=∥∣Dv∣∥L∞(Ω) for the essential supremum of that norm, as in Pointwise potential bound for compactly supported smooth functions. For real scalars this norm equals the derivative operator norm. For complex scalars it is the Frobenius norm of the real-linear map Rn→R2 and can exceed its operator norm: f(x)=x1+ix2 is 1-Lipschitz but ∣Df∣=2. If Ω=∅ both assertions hold vacuously.

Facts & Assumptions

Given: The Axiom of Choice; an integer n≥1; an open, bounded, convex set Ω⊆Rn; a field K∈{R,C}; for the first assertion a class u∈W1,∞(Ω;K) and the finite number L:=∥Du∥L∞(Ω); for the second assertion a function f:Ω→K that is Lipschitz with constant L.

[F1]

Wk,p(Ω;K) consists of the Lp classes whose weak derivatives of order at most k exist as Lp classes; membership of u in W1,∞ means that u and all Diu lie in L∞ (Integer-order Sobolev spaces and their norms); an element of Lp is an almost-everywhere class of measurable functions (The space Lp(μ) as the quotient by null functions).

[F2]

Diu is the weak ∂i-derivative of u exactly when ∫Ωu ∂iφ=−∫ΩDiu φ for every φ∈Cc∞(Ω), and weak derivatives are linear in the class (Weak derivative of a locally integrable function, Linearity, locality, and commutation of weak derivatives).

[F3]

The Axiom of Choice gives choice functions for arbitrary families of nonempty sets and implies Countable Choice and the prescribed-start form of Dependent Choice (The Axiom of Choice, The Axiom of Countable Choice (ACω), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, AC supplies the countable and dependent choices used in Banach integration).

[F4]

Every Euclidean ball has positive finite Lebesgue measure, measures are monotone under inclusion, and a bounded subset of Rn has finite measure; in particular a nonempty open subset of Rn contains a ball (Euclidean balls have positive finite Lebesgue measure, Measures are monotone, Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure).

[F5]

On a finite measure space every L∞ class lies in Lp for every finite p, with ∥g∥p≤μ(X)1/p∥g∥∞ (Finite-measure Lr includes into Lp for p<r).

[F6]

Under Countable Choice the interior mollifications uε=ρε∗u~ of a representative of u extended by zero are smooth on Rn and satisfy uε→u in Wk,p(U;K) for every open U⊂⊂Ω, for 1≤p<∞ (Local smooth approximation in integer-order Sobolev spaces).

[F7]

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

[F8]

The ball average Arf(x)=∣B(x,r)∣−1∫B(x,r)f is defined for f∈Lloc1(Rn), and Arf(x)→f(x) as r↓0 for almost every x (The average of a locally integrable function over a Euclidean ball, Lebesgue differentiation theorem on Rn).

[F9]

On completed sigma-finite products, nonnegative measurable functions may be integrated in either order (Tonelli-Fubini) (Tonelli and Fubini for the completed product, with only almost-everywhere section measurability).

[F10]

For a C1 diffeomorphism T:U→V and nonnegative Borel h one has ∫Vh=∫Uh∘T ∣det⁡DT∣ (Borel change of variables from the compact-support formula and Radon uniqueness); an invertible linear map scales Lebesgue measure by ∣det⁡∣ (A linear map T of Rn sends Lebesgue measurable sets to Lebesgue measurable sets, with λn(T[E])=∣det⁡T∣ λn(E) when T is invertible and T[E] Lebesgue null when it is not).

[F11]

If v:[a,b]→Rm is differentiable with integrable derivative then ∫abv′=v(b)−v(a), and the chain rule computes the derivative of t↦uε(x+t(y−x)) (If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz, The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)).

[F12]

A Lipschitz function on a compact interval is absolutely continuous, and an absolutely continuous function is differentiable almost everywhere with derivative in L1 and satisfies the fundamental theorem of calculus (C1 implies Lipschitz, Lipschitz implies absolutely continuous, and absolutely continuous implies continuous and bounded variation, Fundamental theorem of calculus for absolutely continuous functions).

[F13]

If gk→g almost everywhere and ∣gk∣≤G almost everywhere for a single integrable G, then ∫gk→∫g (Dominated convergence).

[F14]

A uniformly continuous map from a dense subset of a metric space into a complete metric space extends uniquely to a continuous map of the whole space (A uniformly continuous map from a dense subspace into a complete metric space extends uniquely to a uniformly continuous map on the whole space).

[F15]

Lipschitz with constant L means ∣f(x)−f(y)∣≤L∣x−y∣ for all x,y (Lipschitz map, α-Hölder map for rational 0<α≤1, and contraction).

[F16]

Under Countable Choice, Lebesgue measure is the completion of Borel Lebesgue measure, and completion-measurable functions have almost-everywhere equal Borel representatives (L(Rn) is exactly the completion of the restriction of λn to the Borel sets, A function measurable for a completion is almost everywhere equal to one measurable for the original sigma-algebra); apply this to each real component.

Proof

technique · direct
1.1F1F2F4F5givenalgebra

Prepare the W1,1 class. If Ω=∅ both assertions hold vacuously; assume Ω≠∅. Then 0<λ(Ω)<∞ by [F4]. Since u∈W1,∞(Ω;K), the class u and every Diu lie in L∞ by [F1], and ∣Du∣≤L almost everywhere. By [F5] applied to the finite measure space Ω, also u∈L1(Ω;K) and Diu∈L1(Ω;K). The test-function identities of [F2] that define the weak derivatives Diu are the same identities with the same test functions, so they remain valid with the L1 in place of the L∞ classes: u∈W1,1(Ω;K), its W1,1 weak gradient is the given Du, and ∣Du∣≤L almost everywhere.

1.2F3F6F7givenconstruct

Choose smooth approximations and a single subsequence. Let uε=ρε∗u~ be the interior mollifications of [F6], where u~ is the zero extension of a representative of u; then uε∈C∞(Rn;K) and uε→u in W1,1(U;K) for every open U⊂⊂Ω. Put Um:={x∈Ω:dist⁡(x,Rn∖Ω)>1/m}∩B(0,m) for m≥1; each Um is open and convex, Um⊆Um+1⊂⊂Ω, and ⋃mUm=Ω. Countable Choice, available from the Axiom of Choice by [F3], is what [F6] uses here. For every m the family (uε)ε>0 converges to u in W1,1(Um;K) as ε→0, so by [F7] we may extract recursively for m=1,2,… a subsequence converging almost everywhere on Um; the resulting diagonal sequence, rewritten as εk↓0, satisfies: uεk→u almost everywhere on Ω, and for every m, uεk→u in W1,1(Um;K) and Duεk→Du in L1(Um;K). Each uεk is smooth on all of Rn.

1.3F9F10algebra

A multiplicity estimate. Let U⊆Ω be open convex with λ(U)<∞ and let g:Rn→[0,∞] be Borel measurable. Then ∫U∫U∫01g((1−t)x+ty) dt dy dx≤C(n)λ(U)∫Rng, where C(n):=2∫1/21t−n dt is finite and depends only on n. Indeed, fix t∈[1/2,1] and x∈U. The map y↦z=(1−t)x+ty is an affine diffeomorphism of Rn with linear part tI and ∣det⁡(tI)∣=tn, so change of variables [F10] gives ∫Ug((1−t)x+ty) dy=t−n∫(1−t)x+tUg(z) dz≤t−n∫Rng; integrating over x∈U and t∈[1/2,1] gives at most (∫1/21t−n dt)λ(U)∫g. Symmetrically, for fixed t∈[0,1/2] and y∈U the substitution x↦z=(1−t)x+ty has linear part (1−t)I, so ∫Ug((1−t)x+ty) dx≤(1−t)−n∫g; integrating over y∈U and t∈[0,1/2] and substituting t↦1−s gives the same bound. Tonelli's theorem [F9] justifies all iterated integrals, and adding the two halves gives the estimate.

1.4F5F9F12F15givenconstruct

The converse: f is bounded and its a.e. partial derivatives are bounded functions. Assume Ω≠∅ and fix x0∈Ω. For every x∈Ω the Lipschitz condition [F15] gives ∣f(x)∣≤∣f(x0)∣+L∣x−x0∣≤∣f(x0)∣+Ldiam⁡(Ω)<∞, so f is bounded, hence f∈L∞(Ω;K) and f∈L1(Ω;K) by [F5]. For i∈{1,…,n} define gi(x) to be the limit of (f(x+ei/k)−f(x))/(1/k) where that limit exists, and 0 elsewhere, the quotient being declared 0 when x+ei/k∉Ω. Each quotient is continuous on its open domain and has modulus at most L there, so gi is measurable with ∣gi∣≤L everywhere (use componentwise convergence for complex values) on Ω. Moreover gi=∂if almost everywhere: for each fixed value of the other n−1 coordinates the section t↦f(…,t,… ) is L-Lipschitz on an interval, hence absolutely continuous and differentiable at almost every t by [F12], and by Fubini [F9] the set of x∈Ω at which the classical partial derivative fails to exist has measure zero.

2.1F7F11F16step 1.2step 1.3algebra

Segment identities and the integrated error. Each uεk is smooth on Rn, so for all x,y∈Rn the chain rule and the fundamental theorem of calculus [F11] give uεk(y)−uεk(x)=∫01Duεk(x+t(y−x))⋅(y−x) dt. Choose finite-valued Borel representatives of the components of Du by [F16]. Fix m and apply step 1.3 with U=Um and g=1Um∣Duεk−Du∣, extended by zero: by convexity x+t(y−x)∈Um whenever x,y∈Um, so ∫Um∫Um∫01∣Duεk−Du∣(x+t(y−x)) dt dy dx≤C(n)λ(Um)∥Duεk−Du∥L1(Um;K), and the right-hand side tends to 0 as k→∞ by step 1.2. Passing to a further subsequence, once more chosen diagonally over m and relabelled, we may suppose that for every m and almost every (x,y)∈Um×Um the integral ∫01∣Duεk−Du∣(x+t(y−x)) dt tends to 0.

2.2F2F10F13step 1.4givenalgebra

The converse: the functions gi are the weak derivatives and f∈W1,∞. Let φ∈Cc∞(Ω;K). Fix i and write h=1/k. Since φ is smooth with compact support, the difference quotients (φ(x)−φ(x−hei))/h converge uniformly to ∂iφ as h→0, and f∈L1(Ω;K) by step 1.4, so ∫Ωf(x)(φ(x)−φ(x−hei))/h dx→∫Ωf ∂iφ. Substituting x=y+hei and using the translation case of the change-of-variables identity [F10] (determinant one) turns that integral into ∫Ω(f(x)−f(x+hei))/h φ(x) dx. On the compact set supp⁡φ⊂⊂Ω and for k large both x and x+ei/k lie in Ω, so there the quotient qk(x):=(f(x+ei/k)−f(x))/(1/k) is a Lipschitz difference quotient with ∣qk∣≤L, and qk→∂if almost everywhere by step 1.4; dominated convergence [F13] with dominating function L∣φ∣ on the finite measure set supp⁡φ therefore gives ∫Ωf ∂iφ=−∫Ωgiφ. By the defining identity [F2], gi=Dif for every i, and with f∈L∞ from step 1.4 and gi∈L∞ this shows f∈W1,∞(Ω;K).

3.1F9step 1.1step 1.2step 1.3step 2.1givenalgebra

The almost-everywhere pair bound. Fix m. By Fubini [F9], for almost every (x,y)∈Um×Um both x and y are points of almost-everywhere convergence of uεk toward u and at the same time the integral convergence of step 2.1 holds. For such a pair define u∗(x):=lim⁡kuεk(x) and u∗(y) similarly, and extend u∗ arbitrarily elsewhere. Passing to the limit in the identity of step 2.1, the left-hand side tends to u∗(y)−u∗(x), while the difference of the right-hand sides obeys ∣∫01[Duεk−Du](x+t(y−x))⋅(y−x) dt∣≤∣y−x∣∫01∣Duεk−Du∣(x+t(y−x)) dt→0; hence u∗(y)−u∗(x)=∫01Du(x+t(y−x))⋅(y−x) dt, where ∣Du∣≤L for almost every parameter on almost every pair segment: apply step 1.3 to the Borel null set where the chosen gradient exceeds L, whose indicator has zero integral. Thus the integral is finite for these pairs. Therefore ∣u∗(y)−u∗(x)∣≤L∣y−x∣. Since Ω×Ω=⋃m(Um×Um) and a countable union of null sets is null, there is one measurable representative u∗ of u (the almost-everywhere limit of the subsequence of step 1.2) and one null set N⊆Ω×Ω such that ∣u∗(x)−u∗(y)∣≤L∣x−y∣ whenever (x,y)∉N.

3.2F2F9F10F12F13step 2.2givenalgebra

The converse: the derivative operator norm bound. Let v be a unit vector. Choose j with vj≠0 and define the invertible linear map T by Tej=v and Tei=ei for i≠j; then ∣det⁡T∣=∣vj∣>0. The function g:=f∘T is Lipschitz on the open set T−1Ω, and for each fixed value of the other coordinates its sections t↦g(…,t,… ) are Lipschitz on intervals, hence differentiable at almost every t by [F12]; Fubini [F9] shows that the set of w∈T−1Ω at which the ej-directional derivative of g fails to exist is null, and therefore, by the linear change-of-variables identity [F10], the set of x∈Ω at which the v-directional derivative of f fails to exist is null. Define qk(x):=(f(x+v/k)−f(x))/(1/k) when x∈Ω and x+v/k∈Ω, and qk(x):=0 otherwise; then qk is measurable, ∣qk∣≤L wherever the quotient is defined, and qk→∂vf almost everywhere on Ω. For φ∈Cc∞(Ω;K) the same difference-quotient computation as in step 2.2, now in the direction v, gives ∫Ωf ∂vφ=−lim⁡k∫Ωqkφ=−∫Ωhvφ, where hv is the limit of qk where it exists, and 0 elsewhere satisfies ∣hv∣≤L everywhere and equals ∂vf almost everywhere. Hence hv is a representative of the weak directional derivative Dvf:=∑iviDif of [F2], and ∣∑iviDif∣≤L almost everywhere for every unit vector v. Now let V be a countable dense subset of the unit sphere. Choosing representatives of D1f,…,Dnf, for each v∈V the identity ∑iviDif=hv holds almost everywhere, so on a set of full measure all the countably many inequalities ∣∑iviDif∣≤L hold simultaneously. At every such x one has ∥Df(x)∥op=sup⁡∣w∣=1∣∑iwiDif(x)∣=sup⁡v∈V∣∑iviDif(x)∣≤L, because w↦∑iwiDif(x) is continuous and V is dense in the unit sphere. For real f this operator norm is ∣Df∣. For f=a+ib, each row gradient satisfies ∣Da∣,∣Db∣≤L, so ∣Df∣2=∣Da∣2+∣Db∣2≤2L2. This gives the asserted real and complex Euclidean bounds and completes the converse.

4.1F8step 3.1algebra

Lebesgue points and the doubling comparison. Let Arf be the ball average of [F8], applied to the zero extension of a representative of u; by [F8] the set E of x∈Ω with Aru(x)→u(x) as r↓0 has full measure in Ω, and on E the limit equals u∗(x) because u∗=u almost everywhere. Replace E by its intersection with the full-measure set where u∗=u. For x,y∈E and 0<r<min⁡(dist⁡(x,∂Ω),dist⁡(y,∂Ω)) one has Aru(x)−Aru(y)=∣B(x,r)∣−1∣B(y,r)∣−1∫B(x,r)∫B(y,r)(u∗(z)−u∗(z′)) dz′ dz, so using that the exceptional set N of step 3.1 is null, ∣Aru(x)−Aru(y)∣≤L∣B(x,r)∣−1∣B(y,r)∣−1∫B(x,r)∫B(y,r)∣z−z′∣ dz′ dz≤L(∣x−y∣+2r), because ∣z−z′∣≤∣z−x∣+∣x−y∣+∣y−z′∣≤2r+∣x−y∣ on the two balls. Letting r↓0 yields ∣u∗(x)−u∗(y)∣≤L∣x−y∣ for all x,y∈E.

5.1F4F14step 4.1givenalgebra∎

Extending to a Lipschitz representative and completing the first assertion. The full-measure set E is dense in Ω: otherwise E would be disjoint from some ball B⊆Ω, and λ(B)>0 by [F4], contradicting λ(Ω∖E)=0. On E the restriction of u∗ is L-Lipschitz, hence uniformly continuous. By [F14] applied with X:=Ω‾, the dense subset E and the complete target K, there is a continuous g:Ω‾→K with g∣E=u∗∣E. For arbitrary x,y∈Ω‾ choose xj,yj∈E with xj→x and yj→y; by continuity g(x)=lim⁡jg(xj) and g(y)=lim⁡jg(yj), so step 4.1 gives ∣g(x)−g(y)∣=lim⁡j∣u∗(xj)−u∗(yj)∣≤Llim⁡j∣xj−yj∣=L∣x−y∣. Thus g∣Ω is an L-Lipschitz representative of u on Ω that equals u almost everywhere, and the first assertion of the theorem is proved.

Source notes

Kinnunen proves Theorem 3.31 in Rn by reducing to Wloc1,p for p>n, importing the p>n Sobolev embedding and finishing by mollification with uniform convergence. That route is not available at this position in the reading order, where the p>n theory is still to come, so the proof above uses only the density of smooth functions, Fubini, the one-dimensional theory of absolutely continuous functions and Lebesgue's differentiation theorem. The key substitute for the p>n embedding is the multiplicity estimate 1.3, which lets the classical segment identities for smooth approximations pass to the limit for almost every pair of points; the sharp constant is then obtained from ball averages and the dense-subset extension theorem. The converse direction identifies the weak gradient of a Lipschitz function by difference quotients rather than by Rademacher's theorem; the v-directional derivative is transferred to a coordinate direction by an explicit invertible linear map, whose only measure-theoretic input is the linear change-of-variables identity for Lebesgue measure. Hunter's notes and Teschl's chapter cover the Lipschitz/absolute-continuity interface used in the converse; no result of those sources is used beyond that interface.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Weak partial derivatives lower the Sobolev order

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let Ω⊆Rn be open, k≥1, 1≤p≤∞ and u∈Wk,p(Ω;K). For every multi-index β with ∣β∣≤k the weak derivative Dβu, viewed as an Lp class, belongs to Wk−∣β∣,p(Ω), and Dα(Dβu)=Dα+βu a.e. whenever ∣α∣+∣β∣≤k.

Facts & Assumptions

Given: Countable Choice; an open Ω⊆Rn with n≥1; integers k≥1; an exponent 1≤p≤∞; a class u∈Wk,p(Ω;K); and multi-indices β,α with ∣β∣≤k and ∣α∣+∣β∣≤k.

[F1]

u∈Wk,p(Ω;K) means that u and all weak derivatives Dγu with ∣γ∣≤k have representatives in Lp(Ω;K) (Integer-order Sobolev spaces and their norms).

[F2]

A weak derivative is defined by the test-function integration-by-parts identity against Cc∞(Ω) test functions (Weak derivative of a locally integrable function).

[F3]

If Dαu and Dβu exist in Lloc1(Ω) and Dα+βu also exists in Lloc1(Ω), then Dα(Dβu) exists and equals Dα+βu almost everywhere (Linearity, locality, and commutation of weak derivatives).

[F4]

Weak derivatives in Lloc1 are unique as almost-everywhere classes (Uniqueness of a weak derivative as an almost-everywhere class).

[F5]

Countable Choice, assumed throughout (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1F1F2F5given

Regularity bookkeeping. Since u∈Wk,p(Ω;K) and ∣β∣,∣α+β∣≤k, the classes Dαu, Dβu and Dα+βu are defined and lie in Lp(Ω;K) by [F1]; representatives of Lp classes are locally integrable on the open set Ω, so both are classes in Lloc1(Ω;K) to which the weak-differentiation calculus of [F2] applies.

2.1F3step 1.1given

Commutation. With α,β as in the Given, the hypotheses of [F3] are met by step 1.1: Dαu, Dβu and Dα+βu exist in Lloc1(Ω), hence Dα(Dβu) exists and satisfies Dα(Dβu)=Dα+βu almost everywhere on Ω.

3.1F1F2F4step 1.1step 2.1algebra∎

Descent of the order. By step 2.1, for every multi-index α with ∣α∣≤k−∣β∣ the weak derivative Dα(Dβu) exists and equals Dα+βu, which lies in Lp(Ω;K) by step 1.1; also Dβu∈Lp(Ω;K). By [F1] this says exactly that the class Dβu belongs to Wk−∣β∣,p(Ω;K). The identity Dα(Dβu)=Dα+βu is an almost-everywhere identity of classes, and by uniqueness [F4] it is independent of the representatives chosen for Dβu and Dα+βu.

Source notes

The source records the commutation of weak partial derivatives as part of the elementary calculus of weak derivatives; the proof above isolates the two uses: existence of the higher derivative and uniqueness of the Lloc1 classes. No regularity of ∂Ω and no boundedness of Ω is needed.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Higher-order Sobolev embedding

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let n≥2, let Ω be a bounded Wk,p-extension domain, k≥1 and 1≤p<∞. Let K∈{R,C} and u∈Wk,p(Ω;K). Then:

  1. if kp<n, ∥u∥Lq(Ω)≤C∥u∥Wk,p(Ω) for every q with 1q≥1p−kn (equivalently 1≤q≤npn−kp);
  2. if kp=n, ∥u∥Lq(Ω)≤C(q)∥u∥Wk,p(Ω) for every finite q;
  3. if kp>n, then for every integer m≥0 and every 0<α<1 with m+α<k−np there is a representative in Cm,α(Ω‾) with ∥u∥Cm,α(Ω‾)≤C∥u∥Wk,p(Ω); when k−np∉Z one may take m=⌊k−np⌋ and α=k−np−m.

Here Cm,α(Ω‾) uses the continuous derivatives of the constructed representative on an ambient neighbourhood of Ω‾, with norm ∥g∥Cm,α(Ω‾):=∑∣β∣≤msup⁡Ω‾∣Dβg∣+∑∣β∣=msup⁡x,y∈Ω‾x≠y∣Dβg(x)−Dβg(y)∣∣x−y∣α. For Ω=∅ set these norm values to 0. The proof supplies such an ambient representative, so no boundary differentiability or regularity of ∂Ω is assumed.

Facts & Assumptions

Given: The Axiom of Choice; n≥2; a bounded extension domain Ω; k≥1; 1≤p<∞; a class u∈Wk,p(Ω;K).

[F1]

Lower-order derivatives: for every multi-index β with ∣β∣≤k, Dβu∈Wk−∣β∣,p(Ω) and ∥Dβu∥Wk−∣β∣,p≤C∥u∥Wk,p (Weak partial derivatives lower the Sobolev order, Integer-order Sobolev spaces and their norms, The notation Hk and the reserved zero-boundary symbol, The space Lp(μ) as the quotient by null functions).

[F2]

For 1≤q<n, the Sobolev conjugate q∗=nq/(n−q) is finite and satisfies 1/q∗=1/q−1/n; iterating this relation gives pk∗=np/(n−kp) when kp<n (The Sobolev conjugate exponent and the scaling identity).

[F3]

The local Morrey estimate: for n<q<∞, w∈W1,q has a continuous representative and [w]C0,1−n/q(B(a,r))≤C(n,q)∥Dw∥Lq(B(a,2r)) when the doubled ball is compactly contained in its domain (Morrey's inequality for p>n, Local Hölder and scaled C-two-alpha norms on balls).

[F4]

Holder's inequality on a bounded measurable set B compares Lr(B) and Ls(B) for 1≤r≤s<∞ (Holder's inequality for integrals, including the endpoint cases).

[F5]

The extension operator and the whole-space results are used through the extension domain hypothesis (Sobolev extension domains and extension operators); the Axiom of Choice is inherited from the suppliers.

[F6]

Because Ω is bounded, Ω‾ is compact. Choose a ball B containing Ω‾, a smooth cutoff η∈Cc∞(B) equal to 1 on a neighbourhood of Ω‾, and a bounded extension operator E:Wk,p(Ω)→Wk,p(Rn). Then v:=ηEu is compactly supported in B, belongs to Wk,p(Rn), satisfies v=u on Ω, and ∥v∥Wk,p(Rn)≤C∥u∥Wk,p(Ω); its weak derivatives restrict to those of u on Ω (Sobolev extension domains and extension operators, A Euclidean bump for a compact set inside an open set, Weak Leibniz rule with a smooth factor).

[F7]

The whole-space first-order inequality holds for 1<q<n (The Gagliardo-Nirenberg-Sobolev inequality for 1<p<n). At q=1 it extends to W1,1 from The p=1 Gagliardo-Nirenberg-Sobolev inequality using Compactly supported smooth functions are dense in W^{k,p}(R^n): apply the smooth estimate to differences; use Riesz-Fischer completeness of Lp for 1≤p≤∞, Complex Lp completeness and almost-everywhere subsequences for the Ln/(n−1) limit and successive almost-everywhere subsequences in that space and L1 to identify it with the original class.

[F8]

For q>n, apply the local Morrey estimate [F3] on a ball containing the compact support of v; it bounds the Holder seminorm of a representative by C∥Dv∥Lq; its supremum on that ball is bounded by the average, at most ∣B∣−1/q∥v∥Lq(B), plus the oscillation bound. Hence it gives a C0,1−n/q representative with norm bounded by C∥v∥W1,q(Rn), in particular on Ω‾ (Morrey's inequality for p>n, Local Hölder and scaled C-two-alpha norms on balls).

[F9]

Continuous weak first derivatives are classical derivatives. On an inner ball, convolution of a continuous function converges uniformly on smaller compact balls, because ∣(ρε∗f)(x)−f(x)∣≤sup⁡∣h∣≤ε∣f(x−h)−f(x)∣ and continuity on the compact neighbourhood is uniform. The same applies to its continuous weak derivatives; Interior mollification commutes with weak derivatives identifies their convolutions with derivatives of the smooth mollification. Pass to the limit in the coordinate segment identity from If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz to obtain f(x+tei)−f(x)=∫0tgi(x+sei)ds. Differentiating this identity gives ∂if=gi; repeat for higher orders. Weak representatives are unique (Uniqueness of a weak derivative as an almost-everywhere class).

Proof

1.1F1F2F5F6F7algebra

Whole-space iteration. Let B be the fixed bounded support ball from [F6]. Suppose 1≤q0<n and w∈Wℓ,q0(Rn) is supported in B, with ℓ≥1, and put 1/q1=1/q0−1/n, so q1=q0∗. For every ∣β∣≤ℓ−1, [F1] gives Dβw∈W1,q0(Rn) with norm bounded by C∥w∥Wℓ,q0. Applying the whole-space inequality [F7] to each derivative gives Dβw∈Lq1; summing the finitely many norms shows w∈Wℓ−1,q1(Rn) with controlled norm. Compact support is retained, and [F2] gives the invariant ℓ−n/q0=(ℓ−1)−n/q1. The q0=1 case uses the p=1 inequality and its density passage in [F7].

1.2F1F3F6F7F8algebra

Assertion (3): global Holder representatives. Assume kp>n and choose m≥0, 0<α<1 with m+α≤k−np; for the endpoint equality, require k−np∉Z and m=⌊k−np⌋. Fix β with ∣β∣≤m and put ℓ:=k−∣β∣ and t:=n/p, so ℓ−t≥α. By [F1] and [F6], w:=Dβv is compactly supported in Wℓ,p(Rn) with norm at most C∥u∥Wk,p(Ω). Starting from (ℓ,p), whenever the current exponent q<n and current order r≥2, apply [F7] to every derivative of w of order at most r−1; this gives w∈Wr−1,q∗, where 1/q∗=1/q−1/n, with controlled norm. The invariant r−n/q=ℓ−n/p≥α>0 shows the process cannot stop with order 1 and exponent below n. If it reaches q>n, write the remaining order as r. When r=1, take q′=q; Morrey gives exponent 1−n/q=ℓ−n/p≥α. When r≥2, the first derivatives of w lie in W1,q; [F8] bounds them and w on the fixed compact support, so w∈W1,q′(Rn) for every finite q′, and choose q′>n with 1−n/q′>α. If the iteration reaches q=n, then the invariant gives r−n/q=r−1≥α>0, hence r≥2. Thus w and its first derivatives are compactly supported in W1,n; on their common bounded support, Holder puts them in W1,s for any 1<s<n sufficiently close to n, and [F7] then puts them in Ls∗ for s∗=ns/(n−s), which can be chosen arbitrarily large. Hence again w∈W1,q′ for some q′>n with 1−n/q′>α. In every case w∈W1,q′ for an exponent q′>n with 1−n/q′≥α, and its norm is bounded by C∥u∥Wk,p.

2.1F2F4F6F7step 1.1algebra

Assertion (1). Assume kp<n and take the compactly supported extension v from [F6]. Iterating step 1.1 for j=1,…,k−1 gives v∈W1,pk−1(Rn) with 1/pj=1/p−j/n; all exponents are finite and pj<n because (j+1)p<n for j≤k−1. One more application of [F7] gives v∈Lpk∗(Rn), where 1/pk∗=1/p−k/n by [F2]. For every 1≤q≤pk∗, Holder [F4] on the fixed support ball B gives ∥v∥Lq(Rn)≤C(B,p,q)∥v∥Lpk∗(Rn); the whole-space endpoint estimate and [F6] bound this by C(n,k,p,q,Ω)∥u∥Wk,p(Ω). Since v=u on Ω, restriction proves (1).

2.2F4F6F7step 1.1algebra

Assertion (2). Assume kp=n, and take v from [F6]. Iterating step 1.1 through k−1 reductions gives v∈W1,n(Rn) with support in B. If 1≤q≤n, Holder [F4] on B bounds ∥v∥Lq by C(B,q)∥v∥Ln. If q>n, set s=nq/(n+q), so 1<s<n and s∗=q; compact support and Holder give v∈W1,s(Rn) with ∥v∥W1,s≤C(B,s)∥v∥W1,n, and [F7] gives ∥v∥Lq≤C(n,s)∥v∥W1,s. In both cases the norm is bounded by C(n,k,q,Ω)∥u∥Wk,p(Ω) using [F6]; restriction to Ω proves (2), with no L∞ endpoint asserted.

3.1F3F8F9step 1.2algebra∎

Apply [F3] and [F8] with this exponent q′ to w on a ball containing Ω‾. This gives a representative gβ∈C0,α(Ω‾) with ∥gβ∥C0,α(Ω‾)≤C∥u∥Wk,p(Ω), uniformly over the finitely many ∣β∣≤m. By [F9], whenever ∣β∣<m, the classical derivatives of gβ are the continuous representatives gβ+ei, since these represent the weak derivatives of Dβv and weak derivatives are unique. Therefore g0∈Cm,α(Ω‾), represents u, and its Cm,α norm is bounded by the sum of the finitely many bounds just obtained. This proves (3) for the strict range and also the stated fractional-endpoint case: there ℓ−t=α for ∣β∣=m, and the final Morrey exponent is exactly α, which is allowed by [F8].

Source notes

The higher-order embedding is the iteration of the first-order Sobolev inequalities motivated by Kinnunen (Theorem 3.23 and the local higher-order iteration of Remark 3.41) and Teschl (Theorem 9.22), followed by Morrey's estimate. The compactly supported whole-space extension reduces the boundary claim to one fixed ball containing the domain closure; it is essential here because the local Morrey statement alone only controls balls compactly contained in the open set. The finite iteration stops at a supercritical exponent, or at the critical exponent with at least two derivatives remaining, and supplies the global closure-wide Holder norm claimed above.

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

Weak product rule for bounded Sobolev functions

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let Ω⊆Rn be open, 1≤p<∞, and let u,v∈W1,p(Ω;K)∩L∞(Ω). Then uv∈W1,p(Ω) and Dj(uv)=(Dju)v+u(Djv) a.e. for every j.

Facts & Assumptions

Given: The Axiom of Choice; an open Ω⊆Rn with n≥1; an exponent 1≤p<∞; and classes u,v∈W1,p(Ω;K)∩L∞(Ω).

[F1]

W1,p(Ω;K) consists of the Lp classes whose weak first derivatives exist as Lp classes (Integer-order Sobolev spaces and their norms), and Lp is the quotient by almost-everywhere null functions (The space Lp(μ) as the quotient by null functions).

[F2]

Chain rule for a globally Lipschitz scalar function F: for real w∈W1,p(Ω;R), F∘w∈W1,p whenever F(0)=0, and Di(F∘w) agrees almost everywhere with F′(w)Diw where F is differentiable at w, with the product defined as 0 on the preimage of the nondifferentiability set, which need not itself be null (Chain rule for globally Lipschitz scalar maps of Sobolev functions).

[F3]

Weak differentiation is linear and local: weak derivatives of linear combinations are the corresponding linear combinations, and they restrict to open subsets (Linearity, locality, and commutation of weak derivatives).

[F5]

The Axiom of Choice, used through the chain-rule interface of [F2] (The Axiom of Choice).

Proof

technique · direct
1.1F1givenalgebra

Integrability of the products. Since v∈L∞(Ω) and u∈Lp(Ω), the pointwise bound ∣uv∣p≤∥v∥∞p∣u∣p, followed by integration, gives ∥uv∥Lp≤∥u∥Lp∥v∥L∞<∞, and the same argument applies to u(Djv) and (Dju)v because Dju,Djv∈Lp and u,v∈L∞. Thus the three classes uv, (Dju)v and u(Djv) all lie in Lp(Ω;K), and so does their sum (Dju)v+u(Djv) (taken componentwise for K=C).

1.2F2F5givenalgebra

The real case for a truncated square. Let w∈W1,p(Ω;R)∩L∞(Ω) and M:=∥w∥L∞. Define GM(t):=t2 for ∣t∣≤M and GM(t):=2M∣t∣−M2 for ∣t∣>M. Then GM is in C1(R), with GM′(t)=2t for ∣t∣≤M and GM′(t)=2Msgn⁡(t) for ∣t∣>M, it is globally Lipschitz with constant 2M, GM(0)=0, and GM(t)=t2 for ∣t∣≤M. Since ∣w∣≤M almost everywhere, GM∘w=w2 almost everywhere and GM′(w)=2w almost everywhere on Ω; by [F2] the class GM∘w lies in W1,p(Ω) with Dj(GM∘w)=GM′(w)Djw=2wDjw almost everywhere. In particular w2=GM∘w∈W1,p(Ω) and Dj(w2)=2wDjw.

2.1F3step 1.1step 1.2algebra

Polarization in the real case. Suppose first that K=R, and put w±:=u±v∈W1,p(Ω;R)∩L∞(Ω); these classes lie in W1,p by the linearity part of [F3]. Applying GM± of step 1.2 with M±:=∥w±∥L∞ gives uv=14(w+2−w−2) as Lp classes and, by linearity of weak derivatives [F3], Dj(uv)=14(Dj(w+2)−Dj(w−2))=12(w+Djw+−w−Djw−)=(Dju)v+u(Djv) almost everywhere.

3.1F1F3step 2.1algebra∎

Complex case and conclusion. For general K∈{R,C}, write u=u1+iu2 and v=v1+iv2 with real components; these components lie in W1,p(Ω;R)∩L∞(Ω) and Dju=Dju1+iDju2, Djv=Djv1+iDjv2 by the componentwise definition of the weak derivative [F1]. Applying step 2.1 to the four real products and using linearity [F3], Dj(uv)=Dj((u1v1−u2v2)+i(u1v2+u2v1))=(Dju)v+u(Djv) almost everywhere, and uv∈W1,p(Ω;K) by step 1.1.

Source notes

The classical route approximates u and v by smooth functions and passes to the limit in a closed graph; the proof above instead polarises the product and applies the published chain rule for globally Lipschitz scalar functions to a truncated square, which is available for all 1≤p<∞ and avoids any global smooth-approximation theorem. The boundedness of u and v is used through the truncation radius M and in the integrability step.

CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6.1-sol)Open item page →

The Sobolev space Wk,p is an algebra above the critical index

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let n≥2, let Ω be a bounded Wk,p-extension domain, k≥1 and 1≤p<∞ with kp>n. Then there is C(n,p,k,Ω) with ∥uv∥Wk,p(Ω)≤C∥u∥Wk,p(Ω)∥v∥Wk,p(Ω)(u,v∈Wk,p(Ω)), so Wk,p(Ω) is a Banach algebra; the constants and the conclusion may depend on the choice of equivalent Sobolev norm only through C.

Facts & Assumptions

Given: The Axiom of Choice; n≥2; a bounded extension domain Ω; k≥1; 1≤p<∞ with kp>n; and classes u,v∈Wk,p(Ω;K).

[F1]

For w∈Wk,p(Ω) fix its bounded whole-space extension Ew and a ball B⊃Ω‾. By Weak partial derivatives lower the Sobolev order, Dγ(Ew)∣B∈Ws,p(B) with s=k−∣γ∣ and norm at most C∥w∥Wk,p(Ω). A ball is a Ws,p-extension domain for every integer s≥1 by Bounded C^k domains admit integer-order Sobolev extension. Apply Higher-order Sobolev embedding on B and restrict to Ω: Dγw is bounded if sp>n, lies in every finite Lq if sp=n, and lies in Lq for 1/q≥1/p−s/n if 0<sp<n. If s=0, use its original Lp bound. All norms are controlled by C∥w∥Wk,p; this needs only the fixed Wk,p extension of w, not extension operators for lower-order classes on Ω (Sobolev extension domains and extension operators, Integer-order Sobolev spaces and their norms).

[F2]

Meyers-Serrin density: for 1≤p<∞ the smooth functions in C∞(Ω)∩Wk,p(Ω) are dense in Wk,p(Ω) (Meyers–Serrin density on an arbitrary open set, whose Countable-Choice hypothesis is supplied by the Axiom of Choice assumed here; The space Lp(μ) as the quotient by null functions).

[F3]

Holder's inequality in its multi-factor form: for nonnegative measurable f,g with 1q1+1q2≤1p one has ∥fg∥Lp(Ω)≤C(Ω)∥f∥Lq1∥g∥Lq2 on the finite measure domain: apply Holder to ∣f∣p, ∣g∣p and 1 with reciprocal exponents p/q1, p/q2 and 1−p/q1−p/q2 (iterate the two-factor inequality; an exponent 0 means an L∞ factor). Taking p-th roots gives the displayed bound (Holder's inequality for integrals, including the endpoint cases).

[F4]

The weak derivative is characterized by the test-function identity: an Lp class gα is the weak α-derivative of w exactly when ∫Ωw ∂αφ=(−1)∣α∣∫Ωgαφ for every φ∈Cc∞(Ω) (Weak derivative of a locally integrable function, Integer-order Sobolev spaces and their norms). For smooth functions the classical derivatives are the weak derivatives (Classical derivatives agree with weak derivatives).

[F5]

Wk,p(Ω;K) is complete (Integer-order Sobolev spaces are Banach).

Proof

technique · direct
1.1F1F3givenalgebra

The product estimate for derivatives. Let w1,w2∈Wk,p(Ω;K) and let γ1,γ2 be multi-indices with ∣γ1∣+∣γ2∣≤k; put si:=k−∣γi∣≥0, so that s1+s2=2k−∣γ1∣−∣γ2∣≥k. By [F1] choose exponents qi∈[1,∞] with Dγiwi∈Lqi(Ω) and ∥Dγiwi∥Lqi≤C∥wi∥Wk,p(Ω) as follows: 1qi=0 when sip>n; 1qi=1p−sin when sip<n; and 1qi=12n when sip=n, which is available because the critical embedding supplies every finite exponent. In every case 1q1+1q2≤1p: for two subcritical exponents this is 2p−s1+s2n≤2p−kn<1p because kp>n; for one critical and one subcritical exponent it is 12n+1p−sn≤1p because s≥1; for two critical exponents it is 1n≤1p because p≤n (recall sip=n with si≥1 forces p≤n); and a supercritical exponent contributes 0. Hence by generalized Holder [F3], Dγ1w1 Dγ2w2∈Lp(Ω) with ∥Dγ1w1 Dγ2w2∥Lp≤C(n,p,k,Ω)∥w1∥Wk,p∥w2∥Wk,p.

2.1F2F4F5step 1.1givenalgebra∎

The Leibniz identity and the algebra bound. By [F2] choose uj,vj∈C∞(Ω)∩Wk,p(Ω) with uj→u and vj→v in Wk,p(Ω). Fix ∣α∣≤k; for the smooth factors, repeated classical differentiation gives the finite Leibniz formula, and [F4] identifies its classical derivatives with weak derivatives: Dα(ujvj)=∑β≤α(αβ)Dβuj Dα−βvj. Applying step 1.1 to the pairs (uj−u,vj) and (u,vj−v) with (γ1,γ2)=(β,α−β) shows that each summand converges in Lp(Ω) to Dβu Dα−βv, and the case α=0 gives ujvj→uv in Lp(Ω); therefore, for every test function φ∈Cc∞(Ω), ∫Ωuv ∂αφ=lim⁡j∫Ωujvj ∂αφ=(−1)∣α∣lim⁡j∫ΩDα(ujvj) φ=(−1)∣α∣∫Ωgαφ with gα:=∑β≤α(αβ)Dβu Dα−βv∈Lp(Ω). By the characterization [F4], gα is the weak α-derivative of uv for every ∣α∣≤k, so uv∈Wk,p(Ω), and ∥uv∥Wk,p(Ω)≤∑∣α∣≤k∥gα∥Lp≤C(n,p,k,Ω)∥u∥Wk,p∥v∥Wk,p by step 1.1, which is the asserted algebra inequality. Completeness [F5] makes it a Banach algebra with continuous multiplication (after an equivalent norm rescaling if a submultiplicative norm is required).

Source notes

The algebra property of Wk,p above the critical index is the standard consequence of the higher-order embedding and the Leibniz rule; Kinnunen's Morrey theorem and higher-order iteration, together with Hunter's first-order embedding, supply the context; the product estimate and weak Leibniz passage are reconstructed here. The proof above isolates the two ingredients: the product estimate 1.1, where the embedding either makes a factor bounded (when its remaining order exceeds n/p), supplies every finite exponent (at the critical order) or supplies the Sobolev exponent (below it), and Holder combines the two; and the Leibniz identity 2.1, which passes the classical formula for smooth approximations to the limit in Lp and identifies the limit through the test-function definition of the weak derivative.

RemarkRemark: Literature-sourcedProof: Not applicableOpen item page →

The p=n endpoint: no L∞ or Holder embedding

Remark

Let n≥2. On nonempty bounded C1 domains in Rn (or domains satisfying the all-exponents extension hypothesis of the critical embedding theorem), W1,n embeds into Lq for every finite q but not into L∞, and some W1,n classes have no representative in C0,α(Ω‾) for any α>0. The exponential improvement of Trudinger-Moser and the BMO/John-Nirenberg route to the same integrability are outside this pair's scope and are recorded in the planning scope-denial ledger; the companion page carries the witnesses.

The dimension restriction is essential: on a bounded interval I, every W1,1(I) class has an absolutely continuous representative and satisfies ∥u∥L∞(I)≤∣I∣−1∥u∥L1(I)+∥u′∥L1(I).

Source notes

The endpoint limitation is Kinnunen's Remark 3.16 and the surrounding discussion of the critical exponent, with Hunter's Example 3.30 as the explicit logarithmic witness with Laugesen's Theorem 3.23 supplying the supercritical comparison. This remark records the limitation only: the positive embedding W1,n↪Lq for finite q and the failure of the L∞ and Holder bounds are proved elsewhere on this page and on its companion, and the Trudinger-Moser and BMO routes are deliberately not built in this pair.

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Domain classes covered by the mean-zero Poincare inequality

Remark

This page proves the mean-zero Poincare-Wirtinger inequality directly for bounded John domains The mean-zero Poincare inequality on bounded John domains and for bounded convex domains Poincare-Wirtinger on bounded convex domains by the direct pairwise argument, both on the same page. Bounded C1 and bounded Lipschitz domains satisfy the uniform interior cone condition, and every nonempty bounded connected open set satisfying that uniform condition is a John domain (Kinnunen, Remark 5.32(1)); hence the inequality applies to those classes as well. The John-class hypothesis 1≤p<∞ is the one used by the direct proof; no Sobolev exponent and no compactness input enter it. The bounded connected extension-domain Sobolev-Poincare form 1<p<n is a separate statement on this page, proved from the local mean-zero estimate and the extension-domain embedding, and it does not supersede the John-domain result.

Source notes

The class inclusions and the "twisted cones" picture are Kinnunen's Remark 5.32, printed p. 141, with Laugesen's Theorem 3.29 supplying the bounded connected smooth-domain Poincare comparison. This remark records scope only: it asserts no inequality of its own, and the two direct John and convex results together with the separate extension-domain statement are proved elsewhere on this page.

5 · Examples, counterexamples and false statements

None yet.

Sources