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 be an affine bijection from a bounded open set to , where is invertible, and let . For every integer and scalar , the pullback belongs to . For its first weak derivatives satisfy and higher derivatives are obtained by applying this constant-matrix rule repeatedly. In particular, for each , where for . The reverse estimate holds with and in place of and .
Facts & Assumptions
Given: Countable Choice; the affine bijection ; an exponent ; and .
A weak derivative is characterized by for all compactly supported smooth tests. (Weak derivative of a locally integrable function, Integer-order Sobolev spaces and their norms)
For a C1 diffeomorphism, nonnegative Lebesgue-measurable integrands obey the change-of-variables formula with ; Countable Choice is an explicit hypothesis. (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)
is constant, so the classical chain rule for a test function is . (The chain rule for differentials of smooth maps)
For finite , by [F2]; for 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)
The cited change-of-variables theorem assumes Countable Choice. (The Axiom of Countable Choice ())
Proof
If , then 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 , the only derivative is order zero and [F4] gives , with the stated convention at . Thus the membership and pullback estimate hold in this case. For , fix and . Set . By [F1], and its weak first derivatives have locally integrable representatives, so and are integrable: the test factors are bounded and compactly supported. For an integrable real product on , apply [F2] separately to its nonnegative parts and ; both integrals are finite, and the constant makes the corresponding pullback integrals finite. Subtracting their two formulas gives . 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 Thus the displayed first-derivative formula holds weakly; its right side is in by [F4].
For , since is constant, differentiating the first formula weakly again applies the same rule to each ; induction on gives every derivative of order as a sum of at most terms, each with a product of entries of multiplying a pullback of an order- derivative of . Taking component norms and using [F4] yields the stated seminorm bound, with a finite combinatorial constant depending on . Applying the proved estimate to gives the reverse bound. Together with step 1.1 this includes and proves both directions.
Depends on
- Matching affine simplicial meshes and shape regularity
- Integer-order Sobolev spaces and their norms
- Weak derivative of a locally integrable function
- A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions
- The chain rule for differentials of smooth maps
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Primal H¹ approximation on shape-regular affine finite-element meshes Corollary
- Boundary-preserving face-average P1 interpolation Lemma
- Cell averaging preserves constant box bounds and has an H1 error bound Lemma
- Fractional face traces and cellwise Green identity on a simplex Lemma
- Fractional weak Green identity and interior flux cancellation Lemma
- Gauss–Green formula on an affine simplex Lemma
- Local and global dimensions of the mini element Lemma
- No sampling resonance for period-aligned periodic micro cells Lemma
- Scalar H1 and H2 extension across a bounded Lipschitz boundary Lemma
- Scaled fractional traces on shape-regular simplices Lemma
- Separable H1-zero space and compact L2 inclusion on a cube Lemma
- Shape regularity controls affine simplex geometry Lemma
- Smooth functions are dense in finite-order Sobolev spaces on a reference simplex Lemma
- Sobolev traces and Gauss–Green formula on physical simplices Lemma
- The nodal P1 interpolant preserves homogeneous boundary values Lemma
- The relative curl kernel on a contractible Lipschitz polyhedron Lemma
- Whole-space support and the zero-boundary Sobolev closure Lemma
- Zero facet traces of functions in H1₀ on an affine mesh Lemma
- A reference simplex is an integer-order Sobolev extension domain Theorem
- Affine Piola maps commute with differential operators and preserve moments Theorem
- Boundary-cutoff corrector estimate for regular periodic data Theorem
- Local interpolation estimates on shape-regular affine meshes Theorem
- Polynomial inverse and discrete trace inequalities Theorem
- Uniform Fortin stability of the mini element Theorem
- Zero-boundary fractional interpolation in the Nitsche comparison norm Theorem
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
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 11 (standard reference, not scraped)
- Luca Heltai, Numerical Methods for Partial Differential Equations, Lecture 2 (standard reference, not scraped)