Alphabeta Math
LemmaStatement: 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.

Weak derivatives persist under local Lp limits

Statement

Assume Countable Choice. Let Ω⊆Rn be open with n≥1, let K∈{R,C}, choose 1≤p,q≤∞ and α∈N0n, and let uj,u∈Llocp(Ω;K) and vj,v∈Llocq(Ω;K) for j∈N. Assume each vj is a weak α-derivative of uj, and uj⟶u in Llocp,vj⟶v in Llocq. Here f∈Llocr means f∣K∈Lr(K) for every compact K⊆Ω, and convergence means convergence in Lr(K) on every such K, with Lebesgue measure restricted to K. Then v is a weak α-derivative of u: Dαu=vweakly on Ω. It is the unique locally integrable value class under Countable Choice. In particular, if uj∈Wlock,p(Ω;K) and ∣α∣≤k, the limit of the derivative sequence Dαuj in Llocq is the weak derivative class Dαu whenever the stated convergences hold.

If Ω=∅, all classes and tests are zero and the assertion is vacuous. No almost-everywhere convergence of the sequence is assumed.

Facts & Assumptions

Given: Countable Choice, an open Ω⊆Rn, a scalar field K∈{R,C}, conjugate exponents p,p′∈[1,∞] and q,q′∈[1,∞], a multi-index α, and the two local Lp convergence hypotheses.

[F1]

A weak derivative is characterized by the signed test identity (Weak derivative of a locally integrable function).

[F2]

Locally integrable weak-derivative value classes are unique under Countable Choice (Uniqueness of a weak derivative as an almost-everywhere class).

[F3]

Real Hölder gives the product-integral estimate for conjugate exponents, including (1,∞) and (∞,1) (Holder's inequality for integrals, including the endpoint cases).

[F4]

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

[F5]

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

[F6]

The notation Wlock,p means membership on every relatively compact open restriction, and each Sobolev derivative has an Lp value class (Integer-order Sobolev spaces and their norms).

[F7]

Real Lp classes identify representatives equal almost everywhere (The space Lp(μ) as the quotient by null functions).

[F8]

Complex Lp classes use the same almost-everywhere quotient convention (Complex Lp classes and Euclidean test-function conventions).

[F9]

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

[F10]

Under Countable Choice, locally integrable representatives of Lp classes give the same weak-derivative relation, and the representatives are locally integrable on compact test supports (Weak differentiation ignores null-set changes).

Choice accounting: Countable Choice is used for the finite-measure property [F5], representative and local-integrability interface [F10], and uniqueness conclusion [F2]. The test-identity limit uses no subsequence, pointwise convergence, or full Axiom of Choice.

Proof

technique · pass each weak test identity to the limit using Hölder against the compactly supported test and its derivative
1.1F3F4F5F7F8F9F10given

Fix φ∈Cc∞(Ω) and let K=supp⁡φ. By [F5], K has finite measure. Both φ and Dαφ are bounded and supported in K, so they belong to every finite-exponent Lr(K) and to L∞(K). For 1<r<∞, Hölder with the constant function 1 shows that every Lr(K) class is integrable; at r=1 this is the definition, and at r=∞ its integral is bounded by the essential supremum times ∣K∣. By [F10], the assumed local Lp classes and weak derivative data have locally integrable representatives, independent of their choice in the test identity. Thus all data in the weak identities are locally integrable, including when p or q is an endpoint.

2.1F1F3F4F5F9F10step 1.1given

For each j, [F1] gives ∫ΩujDαφ dx=(−1)∣α∣∫Ωvjφ dx. By [F10], these test identities and pairings are independent of the chosen locally integrable representatives. Hölder on K, using [F3] for real values and [F4] for complex values, gives ∣∫Ω(uj−u)Dαφ dx∣≤∥uj−u∥Lp(K)∥Dαφ∥Lp′(K)⟶0, and ∣∫Ω(vj−v)φ dx∣≤∥vj−v∥Lq(K)∥φ∥Lq′(K)⟶0. These estimates also hold at p=1,∞ and q=1,∞ with the conjugate endpoint exponents. Passing to the limit in the identity therefore gives ∫ΩuDαφ dx=(−1)∣α∣∫Ωvφ dx.

3.1F1F2F6F9step 2.1given

Since φ was arbitrary, the last identity is exactly the weak α-derivative definition, so v=Dαu weakly. By [F2] this locally integrable value is unique as an almost-everywhere class. The statement about local Sobolev sequences is the same conclusion applied to their derivative classes from [F6]; no convergence of derivatives other than the indicated Dαuj is asserted.

4.1F1F2F3F4F5F9step 3.1given

If α=0, the test identity and uniqueness identify v with the class u, so the argument covers order zero. In dimension n=1 the same test and compact-support estimates apply with the single coordinate. If K=∅, then φ=0 and both sides vanish. On the empty domain, or when all sequence and limit classes are zero, the identity is zero on both sides. The arguments for p=1,∞ and q=1,∞ were included in step 2.1.

The proof transfers the test identities directly. It does not infer almost-everywhere convergence from norm convergence or exchange the limit with an integral without the displayed Hölder estimates. □

Depends on

Used by

Dependency tree · two levels

68 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