Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Polynomial activation convolutions have a common degree bound

Statement

Assume Countable Choice. Let σ∈M and, for every real smooth test function φ supported in [−1,1], define

gφ(x)=∫Rσ(x−t)φ(t) dt.

If every gφ is a real polynomial, then there is one integer N∈N0 such that every gφ has degree at most N.

Facts & Assumptions

Given: Countable Choice and σ∈M such that every displayed convolution is a polynomial.

[F1]

Each σ∈M is measurable and essentially bounded on compact intervals, hence locally integrable; its regular distribution is defined by integration and embeds into distributions under Countable Choice (Locally essentially bounded activations with null discontinuity closure, Regular distribution from a locally integrable function, Locally integrable functions embed in distributions).

[F2]

The complex fixed-support test-function space is complete; its real-valued subspace X is closed because uniform limits of real-valued functions are real, and is therefore complete with the induced metric (Fixed support test function frechet space, Fixed support test function spaces are complete).

[F3]

This fixed-support test-function space is separable (A fixed-support smooth test-function space is separable).

[F4]

A separable complete metric space is Baire in ZF (Separable complete metric spaces are Baire in ZF).

[F5]

Convolution of a distribution with a test function is smooth, differentiates by moving derivatives to the test function, and agrees with the displayed integral for the regular distribution of σ (Convolution with a test function is smooth, Convolution of a distribution with a test function, Regular distribution from a locally integrable function).

[A1]

Countable Choice means every sequence of nonempty sets has a function choosing one element from each (The Axiom of Countable Choice (ACω)); it is assumed for the Lebesgue-integral realization of σ.

Proof

1.1givenF1F5A1algebra

Let X=D[−1,1] with its fixed-support Fréchet topology. For each n∈N0, set En={φ∈X:gφ(n+1)(x)=0 for every x∈R}. Linearity of convolution makes En a linear subspace. For fixed x, its defining functional is continuous: on the compact interval x−[−1,1], local essential boundedness of σ gives a finite bound Mx, and ∣gφ(n+1)(x)−gψ(n+1)(x)∣≤2Mxpn+1(φ−ψ). Thus En, an intersection of kernels of continuous functionals, is closed.

1.2givenF6inductionalgebra

If a smooth function g has (n+1)st derivative zero, [F6] first makes g(n) constant; subtracting its corresponding multiple of xn/n! leaves an nth derivative equal to zero. Repeating this argument down to order zero shows g is a polynomial of degree at most n. Conversely every such polynomial has (n+1)st derivative zero. Thus the hypothesis gives X=⋃n=0∞En.

2.1step 1.1step 1.2F2F3F4algebra

By [F2]–[F4], the Baire theorem applies to X. Therefore some closed subspace EN has nonempty interior; otherwise the closed sets En would all be nowhere dense and their countable union could not equal X. A linear subspace with nonempty interior contains a neighborhood of zero, and scaling any vector into that neighborhood shows it is the whole space. Hence EN=X.

3.1step 2.1F6∎

Membership EN=X says gφ(N+1)=0 for every test function supported in [−1,1]. Repeated application of [F6] then makes every gφ a polynomial of degree at most N, as claimed.

Depends on

Used by

Dependency tree · two levels

60 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