Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Dilations and their normalisations preserve Schwartz space, with scaling identities

Statement

Let n≥1, φ∈S(Rn) and t>0, and write (Dtφ)(x)=φ(x/t),φt(x)=t−nφ(x/t). Then Dtφ,φt∈S(Rn), with the seminorm identities pαβ(Dtφ)=t∣α∣−∣β∣pαβ(φ),pαβ(φt)=t∣α∣−∣β∣−npαβ(φ) for all multi-indices α,β (Schwartz space and its seminorms, Ck maps and multi-index derivative notation in Euclidean space). Consequently each Dt maps S continuously into itself for the Schwartz topology (Schwartz topology and convergence).

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Then ∫Rnφt(x) dx=∫Rnφ(x) dx,∫Rn∣x∣m∣φt(x)∣ dx=tm∫Rn∣x∣m∣φ(x)∣ dx for every integer m≥0, both sides finite (Schwartz derivatives are integrable).

The identities are stated for t>0; the normalisation is chosen so that the L1 mass and the first moments scale by the powers tm, which is what the later approximate-identity argument consumes. The unnormalised dilation satisfies Dtφ=tnφt, and the factor t−n does not affect membership in S, which is closed under nonzero scalar multiples.

Facts & Assumptions

Given: n≥1, φ∈S(Rn), t>0, and the seminorms, topology and partial derivatives of Schwartz space and its seminorms, Schwartz topology and convergence and Ck maps and multi-index derivative notation in Euclidean space. Under countable choice, A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions gives the substitution formula for the C1 diffeomorphism T(y)=ty of Rn with ∣det⁡DT(y)∣=tn, and Schwartz derivatives are integrable gives xα∂βφ∈L1 for all multi-indices.

[L1]

The j-th partial derivative of a function f at x is ∂jf(x)=lim⁡h→0(f(x+hej)−f(x))/h, and partial derivatives of a Schwartz function exist and are continuous (Ck maps and multi-index derivative notation in Euclidean space, Schwartz space and its seminorms).

[F1]

∣x∣m≤(1+∣x∣2)m/2≤∑∣α∣≤mcα∣xα∣ with finite constants cα, and a nonnegative measurable function dominated by a finite sum of L1 functions lies in L1 (Schwartz derivatives are integrable).

Proof technique: direct computation with the chain rule along coordinate axes, then the change-of-variables formula.

Proof

technique · direct
1.1L1givenalgebra

Differentiation of a dilation. Let f=φ∘A with A(x)=x/t, and fix j≤n and x∈Rn. Writing z=x/t and s=h/t, the one-variable difference quotient of the map h↦f(x+hej) equals t−1(φ(z+sej)−φ(z))/s, and s→0 exactly when h→0, so the limit exists and equals t−1∂jφ(z) by [L1]; there is no division by a vanishing quantity because t>0. Induction on ∣β∣, applying the same computation to the C1 function ∂γφ at the point x with γ the predecessor of β, gives ∂β(Dtφ)(x)=t−∣β∣(∂βφ)(x/t).

1.2F1given

The scaling identities. By [F1] and [L1] the functions φ, ∣φ∣, xα∂βφ and ∣x∣m∣φ∣ are integrable, so the change-of-variables formula applies to them. Applying it to φ with T(y)=ty and ∣det⁡DT∣=tn gives ∫φt(x) dx=t−n∫φ(x/t) dx=∫φ(y) dy, and applying it to the nonnegative integrable function ∣x∣m∣φ(x)∣ gives ∫∣x∣m∣φ(x/t)∣ dx=tn+m∫∣y∣m∣φ(y)∣ dy, whence the moment identity after multiplying by t−n. The factor t−ntn+m=tm is finite for every m≥0 and t>0.

2.1L1step 1.1givenalgebra

Membership and the seminorm identities. Substituting y=x/t in ∣xα∂β(Dtφ)(x)∣=t−∣β∣∣xα(∂βφ)(x/t)∣ gives t∣α∣−∣β∣∣yα∂βφ(y)∣, valid for every x∈Rn; taking suprema over x is taking suprema over y and proves pαβ(Dtφ)=t∣α∣−∣β∣pαβ(φ)<∞. Multiplying by the scalar t−n proves the second identity and makes Dtφ,φt elements of S, since these are finite for all α,β by [L1] and the given. For fixed t the constants t∣α∣−∣β∣−n are finite, so for every basic neighbourhood the finitely many relevant input seminorms of φ control the output seminorms; this is continuity of Dt at zero, hence everywhere by linearity.

3.1step 2.1step 1.2∎

Conclusion. Step 2.1 gives membership, the two seminorm identities, and continuity of Dt on S; step 1.2 gives the integral and moment identities under countable choice, which is inherited from the substitution theorem. This proves the lemma.

Depends on

Used by

Dependency tree · two levels

35 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