Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-10-23 (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.

Normalization, periodization, and derivative commutation for the positive fluid filter

Statement

Assume the Axiom of Countable Choice required by the normalized periodic torus convention. Let d∈{1,2,3}, L>0, TLd=(R/LZ)d, and dμL=L−ddx. Let K:Rd→[0,∞) be smooth, supported in a compact subset of B1(0), with ∫K(s) ds=1, and let 0<ℓ<L/2. Define Gℓ(r)=∑n∈Zdℓ−dK((r+Ln)/ℓ) and q‾ℓ(x)=∫TLdGℓ(r)q(x−r) dx. The locally finite sum defining Gℓ is smooth, nonnegative, and L-periodic, and ∫TLdGℓ(r) dx=1. For every smooth periodic finite-dimensional field q, the filter also has the Euclidean representation

q‾ℓ(x,t)=∫RdK(s)q(x−ℓs,t) ds,

where q on the right is its periodic lift. If I⊆R is open and each component of q:I×TLd→Rm and of its time derivative has continuous spatial derivatives of every order, then the filtered field has the same regularity and, for every spatial multi-index β,

∂xβq‾ℓ=∂xβq‾ℓ,∂t∂xβq‾ℓ=∂t∂xβq‾ℓ.

For every γ>0, the kernel moments

Mγ:=∫RdK(s)∣s∣γ ds,Nγ:=max⁡1≤j≤d∫Rd∣∂jK(s)∣ ∣s∣γ ds

are finite.

Statement references

Facts & Assumptions

Given: Countable Choice and the parameters and fields in the statement, with d∈{1,2,3}, L>0, 0<ℓ<L/2, and K smooth, nonnegative, compactly supported in B1(0), and of mass one.

[A1]

Adopt Countable Choice: every countable family of nonempty sets has a choice function (The Axiom of Countable Choice (ACω)); the Fourier-Sobolev torus convention is stated and proved under this axiom.

[F1]

Positive periodic convolution filter and subfilter stress: Gℓ(r)=∑n∈Zdℓ−dK((r+Ln)/ℓ) and q‾ℓ(x)=∫TLdGℓ(r)q(x−r) dx.

[F2]

A compactly supported Riemann integrand admits the global change-of-variables formula from a diffeomorphism near the relevant compact preimage: let n≥1, let V⊆Rn be open, and let g:V→Rn be injective and C1 with invertible derivative throughout V. If f:Rn→R is compactly supported Riemann integrable and supp⁡f⊆g(V), then the function equal to f(g(s))∣det⁡Dg(s)∣ on V and zero outside V is compactly supported Riemann integrable, and its integral over Rn equals ∫Rnf.

[F3]

Leibniz's rule on a compact rectangle: an interior parameter derivative with a continuous extension may be passed through a Riemann integral: if the integrand and its parameter derivative extend continuously to a compact rectangle, then the derivative of its one-dimensional Riemann integral is the integral of that derivative.

[F4]

Riemann--Fubini on product rectangles, with lower and upper section integrals and content-zero exceptional sections: an integrable function on a product rectangle with integrable sections has equal multiple and iterated Riemann integrals.

[F5]

Linearity, monotonicity, the absolute-value estimate and coordinate-slice additivity for the Riemann integral in Rm: the multidimensional Riemann integral is linear and order preserving, and ∣∫f∣≤∫∣f∣ for integrable f.

[F6]

Riemann's criterion on a nondegenerate rectangle in Rm: integrability is equivalent to arbitrarily small Darboux gaps: a bounded function on a nondegenerate rectangle is Riemann integrable when its Darboux gaps can be made arbitrarily small.

[F8]

Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous: a continuous function on a compact metric space is uniformly continuous.

[F9]

Lower and upper Darboux sums over a grid partition in Rm: the Darboux gap is the finite sum of each cell's oscillation multiplied by its volume; Grid partitions of a rectangle in Rm, their cells, refinements and mesh: the cells cover the box and their volumes sum to its volume; Laws of finite sums and finite products: finite sums preserve inequalities.

[F10]

For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε: for each η>0 there is N≥1 with 1/N<η, so a compact box admits uniform grids of arbitrarily small mesh.

Proof

1.1A1F1givenalgebra

For r in a bounded period cell, a nonzero summand requires ∣r+Ln∣<ℓ<L/2. Only finitely many integer vectors n meet this bound, uniformly on the cell, so the sum is locally finite there; all its derivatives are locally finite sums as well. Replacing r by r+Lm and reindexing n by n−m proves periodicity, and each summand is nonnegative.

1.2F6F7F8F9F10given

Every continuous integrand used below is supported in a fixed nondegenerate compact box Q (enlarge the support box if necessary). By [F7] and [F8], it is bounded and uniformly continuous on Q. Write V=vol⁡(Q)>0 and let δ>0 be a uniform-continuity radius for tolerance ε/(2V). Choose N≥1 with 1/N<δ/(2Rd) by [F10], where 2R is the side length of a box containing Q, and divide each side into N equal parts. Each cell's Euclidean diameter is at most 2Rd/N<δ, so each cell oscillation is below that tolerance. By [F9], the Darboux gap is at most (ε/(2V))∑ivol⁡(Qi)=ε/2<ε; the criterion [F6] makes the integrand Riemann integrable. This applies componentwise to the compactly supported kernel factors and their products with the periodic field and its derivatives.

2.1F2F5step 1.1step 1.2

Choose the centered closed period cell Q=[−L/2,L/2]d. For r∈Q and n∈Zd∖{0}, one coordinate of r+Ln has absolute value at least L/2>ℓ, so its kernel summand is zero. Thus on Q the periodized kernel is f(r)=ℓ−dK(r/ℓ), whose support ℓsupp⁡K is compactly contained in Bℓ(0)⊂int⁡Q. Its period-cell integral is therefore its integral over Rd. Step 1.2 gives compact-support Riemann integrability. Apply [F2] on the open domain V=Rd with g(s)=ℓs. This map is a global C1 diffeomorphism with image Rd, ∣det⁡Dg∣=ℓd, and hence supp⁡f⊆g(V); zero extension outside V is vacuous. The transformed integrand is K(s), giving ∫TLdGℓ=∫RdK=1.

2.2F5step 1.2

For γ>0, the functions K(s)∣s∣γ and ∣∂jK(s)∣ ∣s∣γ are continuous, bounded, and compactly supported. Step 1.2 makes them Riemann integrable, and their integrals are finite by boundedness on a compact box; the finite maximum over j is finite as well.

3.1F1F2F5step 1.1step 1.2step 2.1

With the additional smooth periodic factor q(x−r,t), the centered-cell argument in step 2.1 identifies the convolution with ∫Rdfx,t(y) dy, where fx,t(y)=ℓ−dK(y/ℓ)q(x−y,t), componentwise. Each such integrand has support contained in the same compact set ℓsupp⁡K and is Riemann integrable by step 1.2. Apply [F2] with the same global dilation g(s)=ℓs on V=Rd; its image contains this support, its derivative is invertible, and zero extension outside V is vacuous. The transformed integrand is K(s)q(x−ℓs,t), proving the stated Euclidean representation.

4.1F3F4step 1.2step 3.1

On a compact time interval inside I and a compact parameter interval for any coordinate xj, the Euclidean representation has a continuous integrand and continuous parameter derivative on the fixed compact support box of K. By [F4] the multiple integral is an iterated integral; applying [F3] to each one-dimensional factor and then [F4] again passes ∂t and ∂xj through the integral. Repeating this argument for each spatial derivative gives the stated multi-index identities and continuous derivatives.

5.1step 1.1step 2.1step 3.1step 4.1step 2.2∎

Steps 1.1–4.1 establish the kernel, convolution, derivative, and moment claims.

Remarks

The scale change x=Ly sends normalized Haar measure on TLd to normalized Haar measure on the unit torus. In particular, L=2π gives the current x=2πy Fourier convention. The lemma is a smooth periodic statement; it does not assert a commutator estimate for spatially varying filters or boundary-truncated kernels.

Depends on

Dependency tree · 2 levels

Sources