Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Test function operations are continuous

Statement

In ZF the following linear maps are continuous for the LF test-function topologies: ∂α:D(Ω)→D(Ω); multiplication by a fixed a∈C∞(Ω); translation Thφ(x)=φ(x−h) from D(Ω) to D(Ω+h); and composition CFφ=φ∘F from D(V) to D(U) for a smooth diffeomorphism F:U→V. Here smooth complex functions mean componentwise smooth real and imaginary parts. The translation and composition maps are topological isomorphisms. No joint continuity in varying a or h is asserted here.

Facts & Assumptions

[F1]

A linear map out of D is continuous exactly when its restrictions to all DK are continuous; fixed-support inclusions are continuous (Test function lf topology universal property).

[F2]

Ordered partial derivatives and smoothness have the conventions of Ck maps and multi-index derivative notation in Euclidean space.

[F3]

The total chain rule holds for differentiable Euclidean maps (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a)).

[F4]

Proof

Given: the maps and domains of the statement, and a fixed compact source support K.

1.1givenF2F4algebra

Differentiation does not enlarge support, and F4 gives pm(∂αφ)≤pm+∣α∣(φ). Thus it is continuous on each fixed-support space. For products the one-coordinate product rule follows by subtracting a(x)φ(x) from a(x+tei)φ(x+tei), inserting a(x+tei)φ(x) and dividing by t; continuity and the derivative limits give the two terms. Induction using F4 and Pascal's identity then gives [given, F2, F4, algebra] ∂β(aφ)=∑γ≤β(βγ)(∂γa)(∂β−γφ). All derivatives of a through order m are bounded on compact K, so pm(aφ)≤2mAm,Kpm(φ), where Am,K=max⁡∣γ∣≤msup⁡K∣∂γa∣. Support again stays in K.

2.1step 1.1F2F3F4

Translation takes support into K+h and preserves each derivative supremum. Its inverse is T−h. Composition takes support into L=F−1(K), compact because it is the image of K under the continuous inverse. The first derivative formula is ∂i(φ∘F)=∑j(∂jφ)∘F ∂iFj, by F3. Inductively, each derivative of order ℓ≤m is a finite sum of (∂βφ)∘F, ∣β∣≤ℓ, times products of derivatives of F of orders at most ℓ: differentiating a term either differentiates its coefficient by the product rule of step 1.1 or raises β by a coordinate using the first derivative formula. All coefficients are bounded on L, so pm,L(φ∘F)≤Cm,K,Fpm,K(φ) for a finite constant.

3.1step 1.1step 2.1F1

The bounds in steps 1.1 and 2.1 prove continuity from each source stage into the indicated target stage. Composing with its continuous inclusion and applying F1 proves all asserted LF continuities. Apply the composition argument to F−1 and the translation argument to −h for continuous inverses. Empty support gives the zero test and all bounds hold with zero left side; the zero multi-index gives the identity map. Only finitely many derivative bounds are used for each estimate, so no choice axiom is needed. □

Depends on

Dependency tree · 2 levels

Sources