Alphabeta Math
LemmaStatement: 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.

Distribution pairing with smooth parameter families

Statement

Let r,n≥1 be integers, let X⊆Rr and Y⊆Rn be open, let u∈D′(Y), and let F∈C∞(X×Y;C). Suppose that for each compact H⊆X there is compact K⊆Y with supp⁡yF(x,⋅)⊆K for every x∈H. Then a(x)=u(F(x,⋅)) is smooth and ∂xαa(x)=u(∂xαF(x,⋅)).

Assume Countable Choice for the following integral clause. For every compact measurable E⊆X, the function G(y)=∫EF(x,y) dx is a test in D(Y), its y derivatives pass under the integral, and u(G)=∫Eu(F(x,⋅)) dx. Integrals here are Lebesgue integrals. The smoothness and differentiation claims hold in ZF; Countable Choice supplies Lebesgue measure for the integral clause. Neither clause uses tensor products or distributional mollification.

Facts & Assumptions

[F1]

On each DK, u has a finite-order estimate (Local finite order characterization of distributions).

[F2]

Smooth test operations preserve compact support and commute as ordinary partial derivatives (Test function operations are continuous).

[F3]

Each DK is complete in its derivative-seminorm metric (Fixed support test function spaces are complete).

[F4]

A compact parameter set has a smooth compact cutoff equal to one near it (Test function cutoffs and euclidean localization).

[F5]

The mean-value inequality bounds the increment of a differentiable vector-valued curve by its length times a bound on its derivative; use C=R2 (The mean value inequality: if f:[a,b]→Rm is continuous and differentiable on (a,b) with ∥f′∥2≤M, then ∥f(b)−f(a)∥2≤M(b−a)).

[F6]

Absolute integrals bound moduli of integrals (The modulus of an integral is bounded by the integral of the modulus), and integration is complex-linear on L1 (The Lebesgue integral is linear on L1(μ)).

Proof

Given: integers r,n≥1, X,Y,u,F, and the compact-support hypothesis.

1.1givenF1F2

Around a fixed x0∈X take a closed ball with a slightly larger closed ball still inside X. The hypothesis on the larger ball supplies a single compact K for all its slices. Every parameter derivative of F has support in K for parameters in the smaller ball: for y∉K the function is identically zero for all parameters in a neighborhood, so all parameter derivatives vanish there. On the smaller ball times K, every mixed derivative is uniformly continuous by compactness. Thus pm(F(x,⋅)−F(x0,⋅))→0 for each m, and F1 gives continuity of a.

2.1step 1.1F1F2F5

Fix a coordinate i. For each ∣β∣≤m, apply F5 on the segment from 0 to h (reverse its orientation if h<0) to the curve t↦∂yβF(x+tei,y)−t∂i∂yβF(x,y). The derivative increment is bounded uniformly in y∈K by a modulus of continuity tending to zero with ∣h∣. Dividing the resulting inequality by ∣h∣ proves [step 1.1, F1, F2, F5] pm(F(x+hei,⋅)−F(x,⋅)h−∂iF(x,⋅))⟶0. The F1 estimate passes this limit through u. Apply step 1.1 to the parameter derivative slices for continuity of the resulting derivative, and repeat for every multi-index. This proves smoothness and the derivative formula.

3.1step 2.1givenF2F4F6F7

For this clause assume Countable Choice and use F7 for Lebesgue measure. Fix compact E⊆X. By F4 choose a smooth cutoff θ=1 near E with compact parameter support in X. Extend F~=θF by zero to all parameter space. It is smooth, and the support hypothesis on supp⁡θ gives a common compact K for all its slices and their y derivatives. Choose a closed box Q whose interior contains that parameter support. At level j divide each side into 2j equal pieces, disjointify the cells by assigning shared faces in coordinate order, and let tC be each cell's lower corner. Put [step 2.1, given, F2, F4, F6, F7] Sj(y)=∑Cλr(E∩C)F~(tC,y). These are tests supported in K. For every m, uniform continuity of the finitely many y derivatives through order m on Q×K supplies a modulus ωm(δ)→0. For each derivative and fixed y, F6 bounds the error between the grid sum and its scalar integral over E by λr(E)ωm(mesh⁡j). The finite sum is exactly the integral of the corresponding step function, and its weights are finite because E lies in a bounded box.

4.1step 3.1step 2.1F1F3F6

Comparing two grid sums via their scalar integrals gives pm(Sj−Sk)≤λr(E)(ωm(mesh⁡j)+ωm(mesh⁡k)). Thus F3 gives a limit S∈DK. The degree-zero scalar error in step 3.1 identifies S(y)=∫EF(x,y) dx=G(y), and its higher-degree errors identify every derivative of S with the corresponding integral. By F1, u(Sj)→u(G). By finite linearity u(Sj)=∑Cλr(E∩C)u(F~(tC,⋅)), which converges to ∫Ea(x) dx by the same uniform-continuity integral estimate, since step 2.1 makes that scalar function smooth. This proves interchange. Empty or measure-zero E gives zero sums and integrals; empty Y gives zero slices. All tags and grids are specified, not chosen from an infinite family. □

Depends on

Dependency tree · 2 levels

Sources