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

Two-dimensional transport commutator bound by the Fourier l1 gradient sum

Statement

Assume Countable Choice. Let Q2=R2/(2πZ)2 have normalized measure dμ=(2π)−2dx, Fourier coefficients f^(k)=∫Q2f(x)e−ik⋅x dμ(x), weights wk=(1+∣k∣2)1/2, and componentwise norms ∥f∥Hm2=∑k∈Z2wk2m∣f^(k)∣2. Let m≥4 be an integer and u∈C∞(Q2;R2) be divergence-free. Define Λm by Λmf^(k)=wkmf^(k), S(u)=∑k≠0∣k∣ ∣u^(k)∣, and [Λm,u⋅∇]u=Λm((u⋅∇)u)−u⋅∇(Λmu). Then ∥[Λm,u⋅∇]u∥L2(Q2)≤CmS(u)∥u∥Hm, where S(u)<∞ and Cm depends only on m.

Facts & Assumptions

Given: Countable Choice, the normalized Fourier conventions in the Statement, and the smooth divergence-free field u.

[A1]

Countable Choice: every countable family of nonempty sets has a choice function (The Axiom of Countable Choice (ACω)).

[F1]

Periodic fluid Fourier Sobolev spaces: Fourier coefficients use weights wk=(1+∣k∣2)1/2, and the componentwise Hm norm is the coefficient sum in the Statement.

[F2]

The Fourier basis and Parseval's identity on the finite torus: on the normalized 2π-periodic torus, Parseval identifies the L2 norm with the coefficient ℓ2 norm.

[F3]

Two-dimensional Fourier logarithmic velocity bound: every smooth divergence-free field in the Statement has S(u)<∞.

Proof

1.1givenA1F1algebra

For each nonzero k∈Z2, choose j with ∣kj∣≥∣k∣/2. Integrating the coefficient formula by parts N times in xj (each boundary term vanishes by periodicity) gives ∣u^(k)∣≤CN(1+∣k∣)−N for every integer N≥1, with CN controlled by the suprema of the Nth derivatives of u. The unit squares centered on lattice points in n≤∣k∣<n+1 have disjoint interiors and lie in the annulus of radii max⁡(0,n−1) and n+2. For n≥2 its area is π((n+2)2−(n−1)2)=π(6n+3)≤9πn, and the n=1 disk of radius 3 also has area 9π; hence the shell has at most 9πn lattice points. Choose N=m+5. The shell sums of (1+∣k∣)m+1∣u^(k)∣ are then bounded by Cmn−3, so the Fourier series of u, its first derivatives, Λmu, and the first derivatives of Λmu converge absolutely. Thus the two products in the commutator have absolutely convergent coefficient convolutions, and the product formula and multiplier definition give [Λm,u⋅∇]u^(k)=i∑v+ℓ=k(wkm−wℓm)(u^(v)⋅ℓ)u^(ℓ).

2.1givenF1step 1.1algebra

For x∈R2, wx=(1+∣x∣2)1/2 satisfies ∣∇wxm∣=m∣x∣wxm−2≤mwxm−1. The mean-value theorem along the segment from ℓ to ℓ+v, together with wℓ+θv≤wℓ+wv and (a+b)m−1≤Cm(am−1+bm−1), therefore gives ∣wℓ+vm−wℓm∣≤Cm∣v∣(wvm−1+wℓm−1).

3.1givenF1step 1.1step 2.1algebra

Apply the bound in step 2.1 to each summand in step 1.1 and use ∣u^(v)⋅ℓ∣≤∣u^(v)∣∣ℓ∣. The term containing wvm−1 is bounded pointwise by Cm(wvm∣u^(v)∣)(∣ℓ∣∣u^(ℓ)∣) because ∣v∣≤wv. The term containing wℓm−1 is bounded by Cm(∣v∣∣u^(v)∣)(wℓm∣u^(ℓ)∣) because ∣ℓ∣≤wℓ. Summing over the two output components changes only the dimension-dependent constant.

4.1givenA1F1F2F3step 3.1algebra∎

For the first convolution, set av=wvm∣u^(v)∣ and bℓ=∣ℓ∣∣u^(ℓ)∣. Then [F1] gives ∥a∥ℓ2=∥u∥Hm and [F3] gives ∥b∥ℓ1=S(u), so ∥a∗b∥ℓ2≤∥a∥ℓ2∥b∥ℓ1=∥u∥HmS(u). For the second convolution take cv=∣v∣∣u^(v)∣ and dℓ=wℓm∣u^(ℓ)∣; then ∥c∥ℓ1=S(u) and ∥d∥ℓ2=∥u∥Hm, giving the same bound by ∥c∗d∥ℓ2≤∥c∥ℓ1∥d∥ℓ2. Summing the finitely many vector components and applying Parseval [F2] proves the asserted L2 estimate.

Depends on

Dependency tree · 2 levels

Sources