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

Weak product rule for bounded Sobolev functions

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let Ω⊆Rn be open, 1≤p<∞, and let u,v∈W1,p(Ω;K)∩L∞(Ω). Then uv∈W1,p(Ω) and Dj(uv)=(Dju)v+u(Djv) a.e. for every j.

Facts & Assumptions

Given: The Axiom of Choice; an open Ω⊆Rn with n≥1; an exponent 1≤p<∞; and classes u,v∈W1,p(Ω;K)∩L∞(Ω).

[F1]

W1,p(Ω;K) consists of the Lp classes whose weak first derivatives exist as Lp classes (Integer-order Sobolev spaces and their norms), and Lp is the quotient by almost-everywhere null functions (The space Lp(μ) as the quotient by null functions).

[F2]

Chain rule for a globally Lipschitz scalar function F: for real w∈W1,p(Ω;R), F∘w∈W1,p whenever F(0)=0, and Di(F∘w) agrees almost everywhere with F′(w)Diw where F is differentiable at w, with the product defined as 0 on the preimage of the nondifferentiability set, which need not itself be null (Chain rule for globally Lipschitz scalar maps of Sobolev functions).

[F3]

Weak differentiation is linear and local: weak derivatives of linear combinations are the corresponding linear combinations, and they restrict to open subsets (Linearity, locality, and commutation of weak derivatives).

[F5]

The Axiom of Choice, used through the chain-rule interface of [F2] (The Axiom of Choice).

Proof

technique · direct
1.1F1givenalgebra

Integrability of the products. Since v∈L∞(Ω) and u∈Lp(Ω), the pointwise bound ∣uv∣p≤∥v∥∞p∣u∣p, followed by integration, gives ∥uv∥Lp≤∥u∥Lp∥v∥L∞<∞, and the same argument applies to u(Djv) and (Dju)v because Dju,Djv∈Lp and u,v∈L∞. Thus the three classes uv, (Dju)v and u(Djv) all lie in Lp(Ω;K), and so does their sum (Dju)v+u(Djv) (taken componentwise for K=C).

1.2F2F5givenalgebra

The real case for a truncated square. Let w∈W1,p(Ω;R)∩L∞(Ω) and M:=∥w∥L∞. Define GM(t):=t2 for ∣t∣≤M and GM(t):=2M∣t∣−M2 for ∣t∣>M. Then GM is in C1(R), with GM′(t)=2t for ∣t∣≤M and GM′(t)=2Msgn⁡(t) for ∣t∣>M, it is globally Lipschitz with constant 2M, GM(0)=0, and GM(t)=t2 for ∣t∣≤M. Since ∣w∣≤M almost everywhere, GM∘w=w2 almost everywhere and GM′(w)=2w almost everywhere on Ω; by [F2] the class GM∘w lies in W1,p(Ω) with Dj(GM∘w)=GM′(w)Djw=2wDjw almost everywhere. In particular w2=GM∘w∈W1,p(Ω) and Dj(w2)=2wDjw.

2.1F3step 1.1step 1.2algebra

Polarization in the real case. Suppose first that K=R, and put w±:=u±v∈W1,p(Ω;R)∩L∞(Ω); these classes lie in W1,p by the linearity part of [F3]. Applying GM± of step 1.2 with M±:=∥w±∥L∞ gives uv=14(w+2−w−2) as Lp classes and, by linearity of weak derivatives [F3], Dj(uv)=14(Dj(w+2)−Dj(w−2))=12(w+Djw+−w−Djw−)=(Dju)v+u(Djv) almost everywhere.

3.1F1F3step 2.1algebra∎

Complex case and conclusion. For general K∈{R,C}, write u=u1+iu2 and v=v1+iv2 with real components; these components lie in W1,p(Ω;R)∩L∞(Ω) and Dju=Dju1+iDju2, Djv=Djv1+iDjv2 by the componentwise definition of the weak derivative [F1]. Applying step 2.1 to the four real products and using linearity [F3], Dj(uv)=Dj((u1v1−u2v2)+i(u1v2+u2v1))=(Dju)v+u(Djv) almost everywhere, and uv∈W1,p(Ω;K) by step 1.1.

Source notes

The classical route approximates u and v by smooth functions and passes to the limit in a closed graph; the proof above instead polarises the product and applies the published chain rule for globally Lipschitz scalar functions to a truncated square, which is available for all 1≤p<∞ and avoids any global smooth-approximation theorem. The boundedness of u and v is used through the truncation radius M and in the integrability step.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

57 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