Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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

Depends on

Used by

Dependency tree · two levels

45 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources