Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Affine pullback of weak derivatives and Sobolev seminorms

Statement

Assume Countable Choice. Let F(x^)=Ax^+b be an affine bijection from a bounded open set K^⊂Rd to K, where A is invertible, and let 1≤p≤∞. For every integer r≥0 and scalar v∈Wr,p(K), the pullback v^:=v∘F belongs to Wr,p(K^). For r≥1 its first weak derivatives satisfy Dx^jv^=∑i=1dAij(Dxiv)∘F, and higher derivatives are obtained by applying this constant-matrix rule repeatedly. In particular, for each 0≤m≤r, ∣v^∣Wm,p(K^)≤C(d,m)∥A∥m∣det⁡A∣−1/p∣v∣Wm,p(K), where ∣det⁡A∣−1/p:=1 for p=∞. The reverse estimate holds with A−1 and ∣det⁡A∣1/p in place of A and ∣det⁡A∣−1/p.

Facts & Assumptions

Given: Countable Choice; the affine bijection F; an exponent 1≤p≤∞; and v∈Wr,p(K).

[F1]

A weak derivative is characterized by ∫KvDαϕ=(−1)∣α∣∫K(Dαv)ϕ for all compactly supported smooth tests. (Weak derivative of a locally integrable function, Integer-order Sobolev spaces and their norms)

[F2]

For a C1 diffeomorphism, nonnegative Lebesgue-measurable integrands obey the change-of-variables formula with ∣det⁡DF∣; Countable Choice is an explicit hypothesis. (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)

[F3]

A is constant, so the classical chain rule for a test function is Dx^j(ϕ∘F)=∑iAij(Dxiϕ)∘F. (The chain rule for differentials of smooth maps)

[F4]

For finite p, ∥g∘F∥Lp(K^)=∣det⁡A∣−1/p∥g∥Lp(K) by [F2]; for p=∞ the essential-supremum norm is preserved by a C1 bijection and its inverse, which map null sets to null sets. (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)

[F5]

The cited change-of-variables theorem assumes Countable Choice. (The Axiom of Countable Choice (ACω))

Proof

1.1F1F2F3F4F5given

If K^=∅, then K=∅ and each Sobolev space on these measure-zero domains has only the zero class; every displayed derivative identity and estimate is therefore zero equals zero. Otherwise, if r=0, the only derivative is order zero and [F4] gives ∥v∘F∥Lp(K^)=∣det⁡A∣−1/p∥v∥Lp(K), with the stated convention at p=∞. Thus the membership and pullback estimate hold in this case. For r≥1, fix j and ψ∈Cc∞(K^). Set ϕ:=ψ∘F−1∈Cc∞(K). By [F1], v and its weak first derivatives have locally integrable representatives, so vDxiϕ and (Dxiv)ϕ are integrable: the test factors are bounded and compactly supported. For an integrable real product g on K, apply [F2] separately to its nonnegative parts g+ and g−; both integrals are finite, and the constant ∣det⁡A∣>0 makes the corresponding pullback integrals finite. Subtracting their two formulas gives ∫K^g∘F=∣det⁡A∣−1∫Kg. For a complex product, apply this argument to its real and imaginary parts and combine their integrals componentwise; the weak test pairing remains bilinear, without conjugation. Changing variables by [F2] and using [F3] gives ∫K^(v∘F)Dx^jψ dx^=∣det⁡A∣−1∑iAij∫KvDxiϕ dx=−∣det⁡A∣−1∑iAij∫K(Dxiv)ϕ dx=−∑iAij∫K^((Dxiv)∘F)ψ dx^. Thus the displayed first-derivative formula holds weakly; its right side is in Lp by [F4].

2.1F3F4F5step 1.1algebra∎

For r≥1, since A is constant, differentiating the first formula weakly again applies the same rule to each Dxiv; induction on m gives every derivative of order m≤r as a sum of at most dm terms, each with a product of m entries of A multiplying a pullback of an order-m derivative of v. Taking component Lp norms and using [F4] yields the stated seminorm bound, with a finite combinatorial constant depending on d,m. Applying the proved estimate to F−1(x)=A−1(x−b) gives the reverse bound. Together with step 1.1 this includes r=0 and proves both directions.

Depends on

Used by

Dependency tree · two levels

29 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