Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Integer-order Sobolev spaces are Banach

Statement

Assume the Axiom of Choice, used to invoke the published real and complex Lp completeness results through their Countable-Choice interface. Let Ω⊆Rn be open, n≥1, let k∈N0, 1≤p≤∞, and K∈{R,C}. Then Wk,p(Ω;K), equipped with the displayed norm of Integer-order Sobolev spaces and their norms, is a complete normed space over K.

Both endpoints p=1 and p=∞ are included, as is k=0, where the assertion reduces to the completeness of Lp. If Ω=∅, then Wk,p(Ω;K) is the zero space and the assertion is trivial. The Axiom of Choice is used only to derive Countable Choice for the two published completeness interfaces; no other selection is made. Representative selection inside the finitely many coordinate classes is finite and choice-free.

Facts & Assumptions

Given: AC, an open Ω⊆Rn, k∈N0, 1≤p≤∞, a scalar field K∈{R,C}, and a sequence (uj)j∈N that is Cauchy in Wk,p(Ω;K) for the displayed norm.

[F1]

Wk,p(Ω;K) consists of the classes u∈Lp(Ω;K) for which every α in the finite set Ak={α:∣α∣≤k} has an Lp weak-derivative class Dαu, and the displayed formula is its norm (Integer-order Sobolev spaces and their norms).

[F2]

That displayed formula is finite, independent of representatives, absolutely homogeneous, subadditive, and vanishes exactly on the zero class (The Sobolev norm descends to equivalence classes).

[F3]

Under Countable Choice, real Lp(μ) is complete for every 1≤p≤∞ and every measure space (Riesz-Fischer completeness of Lp for 1≤p≤∞).

[F4]

Under countable choice, complex Lp(μ;C) is complete for every 1≤p≤∞ (Complex Lp completeness and almost-everywhere subsequences).

[F5]

Real Hölder gives ∫∣fg∣≤∥f∥p∥g∥p′ for conjugate exponents, including the endpoint pairs (1,∞) and (∞,1) (Holder's inequality for integrals, including the endpoint cases).

[F6]

The same Hölder estimate holds for complex-valued representatives and includes both endpoints (Complex Holder, Minkowski, and the quotient norm).

[F7]

Under Countable Choice every compact subset of Rn has finite Lebesgue measure (Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure).

[F8]

In ZF, the Axiom of Choice implies the Axiom of Countable Choice (AC supplies the countable and dependent choices used in Banach integration).

[F9]

The Axiom of Choice is the assertion that every family of nonempty sets has a choice function (The Axiom of Choice).

Proof

technique · coordinatewise $L^p$ completeness plus passage of each weak test identity to the limit
1.1F1F2F3F4F7F8F9given

By [F8], AC gives Countable Choice, so the completeness interfaces [F3] and [F4] and the finite-measure property [F7] are available. The index set Ak of [F1] is finite. For every α∈Ak the classes Dαuj exist, and comparing the displayed norm formula with the corresponding real or complex Lp norm of one coordinate gives ∥Dαuj−Dαul∥Lp(Ω)≤∥uj−ul∥Wk,p(Ω) for the finite-p sum and for the p=∞ maximum alike. Hence (Dαuj)j is Cauchy in Lp(Ω;K) for every α, and (uj)j is Cauchy in Lp(Ω;K) because D0uj=uj.

2.1F1F3F4step 1.1given

By the completeness results [F3] for K=R and [F4] for K=C, each coordinate Cauchy sequence converges in Lp(Ω;K): there are classes vα∈Lp(Ω;K) with Dαuj⟶vαin Lp(Ω;K),α∈Ak. Put u:=v0, so uj→u in Lp(Ω;K). Each class vα has some measurable representative, and Ak is finite, so choosing one representative per coordinate is a finite selection, provable without any choice principle.

3.1F1F5F6F7step 2.1

Fix φ∈Cc∞(Ω) and put K=supp⁡φ. By [F7], K has finite measure, and both φ and Dαφ are bounded and supported in K for every α. For each j and α, [F1] gives the weak identity ∫Ωuj Dαφ dx=(−1)∣α∣∫Ω(Dαuj)φ dx. Since Dαuj→vα and uj→u in Lp(Ω), restriction to K gives norm convergence in Lp(K), and Hölder [F5] for real and [F6] for complex representatives, including the endpoint pairs, yields ∣∫Ω(uj−u)Dαφ dx∣≤∥uj−u∥Lp(K)∥Dαφ∥Lp′(K)⟶0 and ∣∫Ω(Dαuj−vα)φ dx∣≤∥Dαuj−vα∥Lp(K)∥φ∥Lp′(K)⟶0. Passing to the limit in the identity gives ∫Ωu Dαφ dx=(−1)∣α∣∫Ωvαφ dx.

4.1F1F2step 3.1

The test function in step 3.1 was arbitrary and each vα is an Lp class, so the displayed identity exhibits vα as a weak α-derivative of u in the sense of [F1]; hence u∈Wk,p(Ω;K) and Dαu=vα for every α∈Ak.

5.1F1F2step 2.1step 4.1

Finally, ∥uj−u∥Wk,p(Ω)→0: for finite p the displayed norm of the difference is the p-th root of the finite sum of the numbers ∥Dαuj−vα∥Lpp, each of which tends to 0, and for p=∞ it is the maximum of the finitely many numbers ∥Dαuj−vα∥L∞, which likewise tends to 0. Therefore every Cauchy sequence in Wk,p(Ω;K) converges in its norm, and by [F2] that norm makes Wk,p(Ω;K) a normed space.

6.1F1F3F4F5F6F8step 5.1

The boundary cases are included. For k=0 we have A0={0}, so the argument reduces to the single convergence uj→u and is exactly the completeness used in step 2.1. If Ω=∅, then every Lp class is zero by [F1], the sum over Ak is a finite sum of zeros, and the unique class is its own limit. The endpoints p=1 and p=∞ were handled in steps 1.1 and 3.1 through the endpoint clauses of [F5] and [F6]. The only choice used is Countable Choice, obtained from AC by [F8]; no subsequence or pointwise convergence of the full sequence is used. □

Sources

Depends on

Used by

Dependency tree · two levels

61 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