Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Pullback of a distribution by a diffeomorphism

Definition

Let n≥1 be an integer, let F:U→V be a smooth diffeomorphism between open subsets of Rn, and let u∈D′(V) in the convention of Distribution. Put JF(x)=∣det⁡DF(x)∣. The chain rule applied to F−1∘F makes DF(x) invertible, so JF>0. It is smooth: the determinant is smooth and nonzero, and its sign is locally constant. Define ⟨F∗u,φ⟩=⟨u,(φJF)∘F−1⟩(φ∈D(U)). The transformed test has support in F(supp⁡φ), a compact subset of V. Multiplication by the fixed smooth reciprocal Jacobian and diffeomorphic composition are continuous linear test operations by Test function operations are continuous, so their transpose defines a distribution. This definition is choice-free. For the identity map the Jacobian is one and the pullback is the identity; the zero distribution pulls back to zero. Empty diffeomorphic domains give zero test and distribution spaces. The absolute value of the determinant handles orientation reversal; arbitrary smooth maps are not covered by this definition.

For compatibility with functions, use the regular-functional convention of Regular distribution from a locally integrable function and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). If f∈Lloc1(V) and K⊆U is compact, put hK=1F(K)∣f∣. This is an L1(V) function. The exact formula of A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions gives ∫K∣f(F(x))∣JF(x) dx=∫F(K)∣f(y)∣ dy<∞. The formula also makes the transformed integrand measurable; since JF is positive and its reciprocal is bounded on K, this proves f∘F∈Lloc1(U). If f=g almost everywhere, apply the same formula to 1F(K)∣f−g∣, whose integral is zero, and use A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere to obtain f∘F=g∘F almost everywhere on each compact K. Thus composition respects local almost-everywhere classes. For a fixed test φ, the function f(y)(φ/JF)(F−1(y)) is integrable, since its smooth factor is bounded with compact support. Applying the same change-of-variables formula gives ⟨F∗uf,φ⟩=∫Vf(y)φ(F−1(y))JF(F−1(y)) dy=∫Uf(F(x))φ(x) dx. Thus F∗uf=uf∘F, with both regular functionals distributions by Locally integrable functions embed in distributions. Countable Choice is used through the published Lebesgue change-of-variables and embedding results, not through the definition of F∗u.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

46 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