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

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

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

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

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

Depends on

Used by

Dependency tree · two levels

65 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