Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Compactness of W1,p(Ω)↪Lp(Ω) on bounded extension domains

Statement

Assume the Axiom of Choice. Let n≥1, let Ω⊆Rn be a bounded W1,p-extension domain (Sobolev extension domains and extension operators) and let 1≤p<∞. Then W1,p(Ω) is compactly embedded in Lp(Ω): every sequence bounded in W1,p(Ω) has a subsequence converging in Lp(Ω). Every bounded C1 domain is an example.

Facts & Assumptions

Given: the Axiom of Choice, a bounded W1,p-extension domain Ω⊆Rn, 1≤p<∞, and a sequence (uj) with M:=sup⁡j∥uj∥W1,p(Ω)<∞.

[F1]

Extension operator. There is a bounded linear E:W1,p(Ω)→W1,p(Rn) with (Eu)∣Ω=u and ∥Eu∥W1,p(Rn)≤∥E∥ ∥u∥W1,p(Ω). (Sobolev extension domains and extension operators)

[F2]

Cutoff. Since Ω‾ is compact and contained in the open set V:=B(0,R), with R>0 large enough to contain Ω‾, there is η∈Cc∞(Rn) with η=1 on Ω‾ and supp⁡η⊆V, a fixed bounded set. This construction also works for the empty domain, choosing any ball V. (A Euclidean bump for a compact set inside an open set, Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space)

[F3]

Products with a smooth cutoff. If v∈W1,p(Rn) and η∈Cc∞(Rn), then ηv∈W1,p(Rn) with ∥ηv∥W1,p(Rn)≤Cη∥v∥W1,p(Rn) for a constant depending only on η and p. (Weak Leibniz rule with a smooth factor)

[F4]

Translation estimate and automatic tails. Under the Axiom of Choice, ∥τhv−v∥Lp(Rn)≤∣h∣ ∥∣Dv∣∥Lp(Rn); a family supported in one fixed bounded set has vanishing tails. (The translation estimate for W1,p functions on Rn, Uniformly supported families have vanishing tails)

[F5]

The Fr'echet--Kolmogorov criterion. A bounded family in Lp(Rn) with vanishing tails and uniform translation control has an Lp(Rn)-convergent subsequence. (The Fr'echet--Kolmogorov compactness criterion in Lp(Rn), 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)

[F6]

Restriction and norms. ∥g∣Ω∥Lp(Ω)≤∥g∥Lp(Rn); and (Euj)∣Ω=uj almost everywhere. (Integer-order Sobolev spaces and their norms, The space Lp(μ) as the quotient by null functions)

[F7]

Bounded C1 domains are extension domains. (Bounded C^k domains admit integer-order Sobolev extension)

Proof

technique · Extend, multiply by a fixed cutoff, apply the Fr\'echet--Kolmogorov criterion to the products, and restrict to $\Omega$
1.1F1F2F3F6given

Fix E as in [F1] and η as in [F2], and put vj:=η Euj. By [F3] each vj lies in W1,p(Rn) and is supported in the fixed bounded set supp⁡η; moreover ∥vj∥W1,p(Rn)≤Cη∥Euj∥W1,p(Rn)≤Cη∥E∥M, and vj=(Euj)∣Ω=uj almost everywhere on Ω because η=1 there.

2.1F4F5step 1.1algebra

The family {vj} satisfies the three hypotheses of [F5]: it is bounded in Lp(Rn) by step 1.1; its tails vanish by [F4] because all members are supported in the fixed bounded set supp⁡η; and [F4] gives ∥τhvj−vj∥Lp(Rn)≤∣h∣ ∥∣Dvj∣∥Lp(Rn)≤C′M′∣h∣ with C′ and M′ independent of j, so the translation control is uniform and tends to 0 with ∣h∣.

3.1F1F5F6F7step 1.1step 2.1∎

By [F5] some subsequence (vjk) converges in Lp(Rn), say to v; restricting and using vjk=ujk almost everywhere on Ω together with [F6] gives ∥ujk−v∣Ω∥Lp(Ω)=∥(vjk−v)∣Ω∥Lp(Ω)≤∥vjk−v∥Lp(Rn)→0, so (ujk) converges in Lp(Ω). This proves compactness of the inclusion; its boundedness follows from ∥u∥Lp(Ω)≤∥Eu∥Lp(Rn)≤∥E∥ ∥u∥W1,p(Ω) by [F1] and [F6]. Finally, [F7] says every bounded C1 domain carries such an extension operator, giving the stated examples. The Axiom of Choice is inherited through [F1], [F4] and [F7], while the extraction uses the Countable and Dependent Choice of [F5].

Depends on

Used by

Dependency tree · two levels

76 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