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 Leibniz rule with a smooth factor

Statement

Assume Countable Choice. Let Ω⊆Rn be open with n≥1, let K∈{R,C}, and let η∈C∞(Ω;K) and u∈Lloc1(Ω;K). For α∈N0n, suppose that for every γ≤α there is vγ∈Lloc1(Ω;K) with Dγu=vγ weakly. Then ηu has a weak α-derivative, and its almost-everywhere class is Dα(ηu)=∑β≤α(αβ)(Dβη)Dα−βuin Lloc1(Ω;K). where Dβη is the classical derivative and products are pointwise products of representatives. The resulting class does not depend on the representatives.

For k∈N0 and 1≤p≤∞, if u∈Wk,p(Ω;K) and Dβη∈L∞(Ω) for every ∣β∣≤k, then ηu∈Wk,p(Ω;K) and the same formula holds in Lp for every ∣α∣≤k. In particular, η∈Cc∞(Ω;K) is a sufficient condition on the multiplier for this global conclusion.

For Ω=∅ all classes are zero and the identity holds. The pairing convention is bilinear, with no complex conjugation.

Facts & Assumptions

Given: Countable Choice, an open Ω⊆Rn, a scalar field K∈{R,C}, a smooth multiplier η, a locally integrable u, and a multi-index α for which the weak derivatives through α have locally integrable values.

[F1]

The regular-distribution pairing is complex bilinear and depends only on the almost-everywhere class (Locally integrable functions as regular distributions).

[F2]

A weak derivative is characterized by the signed test identity, which is the distributional derivative identity for the corresponding regular distributions (Weak derivative of a locally integrable function).

[F3]

Distributional Leibniz holds for a smooth complex multiplier and every multi-index, in the bilinear convention and without a choice assumption (Leibniz rule for distributions).

[F4]

Multiplication of distributions by smooth functions is defined by ⟨aT,φ⟩=⟨T,aφ⟩, with no conjugation, and is associative (Multiplication of a distribution by a smooth function).

[F5]

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

[F6]

The class u∈Wk,p has an Lp class for each weak derivative of order at most k (Integer-order Sobolev spaces and their norms).

[F7]

Real Lp elements are almost-everywhere classes (The space Lp(μ) as the quotient by null functions).

[F8]

Complex Lp elements are almost-everywhere classes and use pointwise complex products (Complex Lp classes and Euclidean test-function conventions).

[F9]

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

Choice accounting: Countable Choice is used only through [F5] to identify locally integrable derivative value classes, including at order zero; [F9] names this assumption. The test-identity transfers, distributional Leibniz identity, and finite algebraic expansion are choice-free. No full Axiom of Choice is assumed.

Proof

technique · transfer the distributional product identity to regular distributions and identify its locally integrable value
1.1F2given

For every γ≤α, the weak identity and [F2] give ∂γTu=Tvγ. In particular, the derivative on the left is represented by a locally integrable function for each such γ.

1.2F1F7F8given

Set wα=∑β≤α(αβ)(Dβη)vα−β. The sum is finite. On each compact subset of Ω, every smooth Dβη is bounded and every vα−β is integrable, so wα∈Lloc1(Ω;K). Changing any selected representative on a null set changes each product only on a null set; hence wα defines a single almost-everywhere class.

2.1F1F2F3F4F5F9step 1.1step 1.2

Apply [F3] to η and Tu, then substitute the identities of step 1.1. By [F4], the left side is the αth distributional derivative of Tηu, while each term on the right is the regular distribution of the corresponding summand in wα. Thus ∂αTηu=Twα. By the weak-derivative identity in [F2], wα is a locally integrable weak α-derivative of ηu. By [F5] it is the unique value class, which proves the asserted local formula.

3.1F6F7F8step 2.1given

Now suppose the global Wk,p hypotheses hold. For each ∣α∣≤k, the local result applies because all weak derivatives Dγu with γ≤α are supplied by [F6]. For every β≤α, the factor Dβη is bounded, so (Dβη)Dα−βu is an Lp class: for finite p its modulus is bounded by ∥Dβη∥∞∣Dα−βu∣ almost everywhere, and for p=∞ the same estimate bounds the essential supremum. The finite sum is therefore in Lp. Taking α=0 also shows ηu∈Lp; the local result for every ∣α∣≤k now gives ηu∈Wk,p by its definition, and its weak derivative classes are exactly the displayed sums.

4.1F2F5F9step 3.1given

If η∈Cc∞(Ω;K), its support is compact in Ω. Each derivative is continuous and vanishes off that compact support, so every derivative through order k is bounded. Thus the preceding global argument applies. For k=0 the formula has only β=0 and says D0(ηu)=ηu. When α=0 the same order-zero identity holds in the local assertion. For the zero input class, zero is a weak derivative at every order by the defining test identity, and [F5] makes each supplied derivative class zero; if η=0, every summand is zero. On the empty domain every term is the zero class.

The argument treats real and complex values uniformly because all pairings and multiplier products are bilinear; no conjugation or additional choice principle enters. □

Depends on

Used by

Dependency tree · two levels

40 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