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.

Integration by parts for dual-exponent Sobolev functions

Statement

Assume Countable Choice. Let Ω⊆Rn be open, n≥1, let 1≤p≤∞, and let p′ be the conjugate exponent, with 1′=∞ and ∞′=1. Take complex-valued (or real-valued) u∈W1,p(Ω) and v∈W1,p′(Ω). Say that an a.e. class f is compactly supported in Ω if some compact K⊆Ω satisfies f=0 almost everywhere on Ω∖K. If at least one of u,v is compactly supported in this sense, then for every i∈{1,…,n}, ∫Ωu Div dx=−∫Ωv Diu dx. The integrals are bilinear, without conjugation, and are absolutely convergent by Hölder's inequality, including at p=1 and p=∞. The proof assumes only Countable Choice, exactly the strength needed by its supplier interfaces. Full AC is a stronger sufficient alternative: step 6.1 shows that it implies Countable Choice. If Ω=∅, both sides are zero.

Facts & Assumptions

Given: Countable Choice, an open Ω⊆Rn, n≥1, conjugate exponents p,p′∈[1,∞], the indicated Sobolev classes, and the compact-support condition in the Statement.

[F1]

The classes W1,r consist of Lr a.e. classes with weak first derivatives in Lr, and the test pairing is bilinear (Integer-order Sobolev spaces and their norms).

[F2]

A weak derivative Dig satisfies the signed test identity ∫g ∂iϕ=−∫(Dig)ϕ for every test function (Weak derivative of a locally integrable function).

[F3]

Complex Hölder gives ∣∫fg∣≤∥f∥r∥g∥r′ for every conjugate pair, including (1,∞) and (∞,1) (Complex Holder, Minkowski, and the quotient norm).

[F4]

Weak derivatives restrict to open subsets (Linearity, locality, and commutation of weak derivatives).

[F5]

A locally integrable weak derivative is unique as an a.e. class under Countable Choice (Uniqueness of a weak derivative as an almost-everywhere class).

[F6]

For compact K⊆Ω there is a smooth compactly supported cutoff in Ω equal to one on a neighborhood of K; this construction is in ZF (Test function cutoffs and euclidean localization).

[F7]

There is an explicit real η∈Cc∞(Rn) with 0≤η≤1, equal to one on the unit ball and zero outside the radius-two ball (Explicit compactly supported smooth cutoffs).

[F8]

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

[F9]

Under Countable Choice, boxes have their product volume, so every nondegenerate box has positive measure (A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included).

[F10]

Under Countable Choice, rescaled integrable unit-mass kernels converge to the identity in every finite Lr, 1≤r<∞ (Complex translation, convolution, approximate identities, and mollification).

[F11]

For a real unit-mass smooth compactly supported kernel, convolution is smooth, and compactly supported input gives compactly supported output (Complex translation, convolution, approximate identities, and mollification).

[F12]

A mollifier generated by a unit-mass smooth bump is the rescaling ηε(x)=ε−nη(x/ε) (The mollifier family generated by a unit-mass smooth bump).

[F14]

Countable Choice says that every natural-number-indexed family of nonempty sets has a choice function (The Axiom of Countable Choice (ACω)).

[F15]

The full Axiom of Choice gives a choice function for every family of nonempty sets, so it implies Countable Choice but is stronger than this proof requires (The Axiom of Choice).

Proof

1.1F1F3given

The four factors in the asserted products lie in conjugate Lp spaces: u,Div∈Lp×Lp′ and v,Diu∈Lp′×Lp. By [F3] each product is integrable, with the endpoint pairs covered by the same inequality. The Sobolev test pairing in [F1] is bilinear, so no conjugation enters the desired identity.

1.2F1F2F5given

If u=0 as an a.e. class, then Diu=0 by uniqueness of the weak derivative; both sides are zero. The same argument applies if v=0.

1.3F1F2F4F5given

Let g∈W1,r(Ω), 1≤r≤∞, vanish almost everywhere outside a compact K⊆Ω. On the open set V=Ω∖K, g=0 as a class. By restriction in [F4], Dig∣V is a weak derivative of zero there; zero is also such a derivative, so uniqueness in [F5] gives Dig=0 almost everywhere on V. If K=∅, this proves that g=Dig=0 as classes, and any asserted pairing involving this compact factor vanishes.

2.1F1F2F5F6givenstep 1.3

First take 1≤r<∞. Choose χ∈Cc∞(Ω) equal to one on a neighborhood of K by [F6]. Extend representatives of g and Dig by zero to G and H on Rn. For every ϕ∈Cc∞(Rn), the functions g ∂iϕ and g ∂i(χϕ) agree almost everywhere: they agree on a neighborhood of K, and g=0 off K. Likewise Dig ϕ and Dig χϕ agree almost everywhere by step 1.3. The weak identity [F2] for g applied to χϕ therefore gives ∫RnG ∂iϕ=∫Ωg ∂i(χϕ)=−∫ΩDig χϕ=−∫RnHϕ. Thus H is the weak derivative of G on Rn, and G,H∈Lr.

3.1F3F7F8F9F11F12givenstep 1.3step 2.1

The function η from [F7] is integrable: it is bounded and supported on a compact set of finite measure by [F8]. Its integral c is positive: the box Q=[−1/(2n),1/(2n)]n lies in the unit ball, since for x∈Q one has ∣x∣2≤n(1/(2n))2=1/4<1. By [F9], λn(Q)=(1/n)n>0; as η=1 on Q and η≥0, its integral is at least λn(Q). Put ρ=η/c and use the family ρε(x)=ε−nρ(x/ε) from [F12]. By step 1.3, if K=∅, then G and H are zero classes and Gε=0 for every \varepsilon, so support and convergence are immediate. Assume K is nonempty below. For Gε=ρε∗G, [F11] gives smoothness and compact support. The integral defining Gε(x) vanishes whenever dist⁡(x,K)>2ε, because G=0 off K and supp⁡ρε⊆B‾2ε(0). For each x∈K, openness gives a ball B(x,rx)⊆Ω. Compactness supplies finitely many half-radius balls covering K. Let δ be one quarter of the least radius in this finite list. For every 0<ε<δ, the closed 2ε-neighborhood of K lies in the union of the corresponding B(x,rx): every point y in the neighborhood has some z∈K with ∣y−z∣≤2ε; a covering half-radius ball B(x,rx/2) contains z, so ∣y−x∣<rx/2+2ε<rx. The neighborhood is compact, being K+B‾2ε(0), and hence lies in Ω. Therefore Gε vanishes off a compact subset of Ω, so Gε∈Cc∞(Ω). Since G,H are supported in K, they are in L1(Rn): for r=1 this is immediate, and for 1<r<∞ it follows from finite measure of K [F8] and Hölder [F3]. Thus the convolutions in this step are defined.

4.1F1F2F10F11F12givenstep 2.1step 3.1

At every x, the weak identity [F2] for G may be tested with the compactly supported smooth function y↦ρε(x−y). Since ∂yiρε(x−y)=−∂xiρε(x−y), it gives ∂iGε(x)=∫G(y) ∂xiρε(x−y) dy=∫H(y) ρε(x−y) dy=(ρε∗H)(x). By the finite-Lr convergence in [F10], applied to G and H, ∥Gε−G∥Lr(Rn)+∥∂iGε−H∥Lr(Rn)⟶0. Consequently, taking εj=δ/(j+1) gives restrictions in Cc∞(Ω) whose classical ith derivatives converge to Dig along with convergence to g in Lr.

5.1F1F2F3step 1.3step 4.1given

Suppose first that u is compactly supported and p<∞. Apply steps 1.3–4.1 to g=u, r=p, obtaining uj∈Cc∞(Ω) with uj→u and ∂iuj→Diu in Lp. The weak identity [F2] for v with weak derivative Div, tested against uj, says ∫ΩujDiv=−∫Ωv∂iuj. By [F3], the differences between the left sides and ∫uDiv are at most ∥uj−u∥p∥Div∥p′, while the differences between the right sides and −∫vDiu are at most ∥v∥p′∥∂iuj−Diu∥p. Both tend to zero, proving the claim in this case. If instead v is compactly supported and p′<∞, apply the same approximation to v in Lp′ and test the weak identity for u with derivative Diu; Hölder gives the two corresponding limits. This covers every case with a compactly supported factor of finite exponent, including p=1 when u is compact and p=∞ when v is compact.

5.2F1F2F3F4F5F6F13step 1.3step 4.1

It remains only the case in which the compact factor has exponent ∞ and its partner has exponent 1. Write the compact factor as g∈W1,∞(Ω), the other as h∈W1,1(Ω), and let K contain the essential support of g. The case K=∅ is already settled by step 1.3. Choose χ as in [F6] with χ=1 on a neighborhood of K, and put w=χh. For any ϕ∈Cc∞(Ω), [F13] and the weak identity [F2] for h, tested with χϕ, give ∫Ωw ∂iϕ=∫Ωh ∂i(χϕ)−∫Ωh(∂iχ)ϕ=−∫Ω(χDih+h∂iχ)ϕ. For each coordinate j, the same test calculation gives the weak derivative Djw=χDjh+h ∂jχ. Each displayed candidate and w are in L1 and compactly supported, so the definition [F1] gives w∈W1,1(Ω). By steps 1.3–4.1, choose wj∈Cc∞(Ω) with wj→w and ∂iwj→Diw in L1. Test the weak identity [F2] for g, whose weak derivative is Dig, with wj: ∫Ωg∂iwj=−∫Ω(Dig)wj. The limits pass by ∣∫g(∂iwj−Diw)∣≤∥g∥∞∥∂iwj−Diw∥1 and the analogous estimate using Dig∈L∞. On a neighborhood of K, w=h as a.e. classes, so restriction [F4] and uniqueness [F5] give Diw=Dih there. Off K, both g and Dig vanish almost everywhere by step 1.3. Thus the limit is ∫ΩgDih=−∫ΩhDig. It gives the required orientation when g=u,h=v; when g=v,h=u, rearrange the same equality. This handles the remaining endpoint cases without any strong approximation in W1,∞.

6.1F1F5F8F9F10F11F14F15givenstep 1.2step 1.3step 5.1step 5.2∎

If p=1, a compactly supported u is handled by step 5.1; if only v∈W1,∞ is compactly supported, step 5.2 applies. If p=∞, a compactly supported v∈W1,1 is handled by step 5.1; if only u∈W1,∞ is compactly supported, step 5.2 applies. For 1<p<∞, both exponents are finite, so step 5.1 applies whichever factor is compact. The zero-factor and empty-domain cases were addressed in the Statement and steps 1.2–1.3. If one starts instead from the stronger full Axiom of Choice [F15], then for each countable family of nonempty sets (Xm)m∈N AC supplies a choice function on its range; composing with m↦Xm gives a choice function for the indexed family. Thus AC implies Countable Choice [F14], which is the only role of full AC and licenses exactly the Wkp, weak-derivative uniqueness, finite-measure, and mollification interfaces used in [F1], [F5], [F8], [F9], [F10], and [F11]. Under the Statement's Countable Choice hypothesis, no stronger choice principle is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

90 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