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 W01,p(Ω)↪Lp(Ω) on bounded open sets

Statement

Assume the Axiom of Choice. Let n≥1, let Ω⊆Rn be a bounded open set and let 1≤p<∞. Then W01,p(Ω) is compactly embedded in Lp(Ω): the inclusion is bounded, and every sequence bounded in W01,p(Ω) has a subsequence converging in Lp(Ω). No regularity of ∂Ω is needed.

Facts & Assumptions

Given: the Axiom of Choice, n≥1, a bounded open Ω⊆Rn, 1≤p<∞, and a sequence (uj) with M:=sup⁡j∥uj∥W01,p(Ω)<∞.

[F1]

Zero extension. For each j the zero extension u~j of uj lies in W1,p(Rn) with Diu~j the zero extension of Diuj and ∥u~j∥W1,p(Rn)=∥uj∥W1,p(Ω); the extension vanishes outside Ω‾. (Zero extension of W_0^{1,p} has no boundary derivative, Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms)

[F2]

Translation estimate. ∥τhu~j−u~j∥Lp(Rn)≤∣h∣ ∥Du~j∥Lp(Rn), under the Axiom of Choice. (The translation estimate for W1,p functions on Rn)

[F3]

Automatic tails. A family in Lp(Rn) whose members all vanish almost everywhere outside the fixed bounded set Ω‾ satisfies the tightness condition of the Fr'echet--Kolmogorov criterion. (Uniformly supported families have vanishing tails, Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space)

[F4]

The Fr'echet--Kolmogorov criterion. A bounded family in Lp(Rn) with vanishing tails and uniform translation control is totally bounded, its closure is compact, and every sequence in it 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)

[F5]

Restriction is contractive. ∥u∥Lp(Ω)≤∥u∥W01,p(Ω), and the Lp(Ω) norm of the restriction never exceeds the Lp(Rn) norm of an extension. (Integer-order Sobolev spaces and their norms, The space Lp(μ) as the quotient by null functions)

Proof

technique · Extend by zero, verify the three Fr\'echet--Kolmogorov conditions for the extended family, extract an $L^p(\mathbb R^n)$-convergent subsequence, and restrict
1.1F1givenalgebra

By [F1] the extensions satisfy sup⁡j∥u~j∥Lp(Rn)≤M<∞, and the finite-dimensional equivalence of norms gives sup⁡j∥∣Du~j∣∥Lp(Rn)≤CnM<∞ since each component Diu~j is bounded in Lp by M; moreover each u~j vanishes outside the fixed bounded set Ω‾.

2.1F2F3F4step 1.1

The family {u~j} meets the hypotheses of [F4]: it is bounded by step 1.1; its tails vanish by [F3]; and by [F2] ∥τhu~j−u~j∥Lp(Rn)≤∣h∣ ∥∣Du~j∣∥Lp(Rn)≤CnM∣h∣, a bound uniform in j that tends to 0 with ∣h∣.

3.1F1F4F5step 2.1∎

By [F4] there is a subsequence (u~jk) converging in Lp(Rn), say to v; restricting to Ω gives ∥ujk−v∣Ω∥Lp(Ω)≤∥u~jk−v∥Lp(Rn)→0 by [F5], so (ujk) converges in Lp(Ω). Boundedness of the inclusion is the inequality ∥u∥Lp(Ω)≤∥u∥W01,p(Ω) of [F5]; the extraction uses the Countable and Dependent Choice of [F4], and the Axiom of Choice is inherited through the translation estimate [F2].

Depends on

Used by

Dependency tree · two levels

60 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