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 Fourier logarithmic velocity bound

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 Sobolev norms ∥f∥Hr2=∑k∈Z2wk2r∣f^(k)∣2, componentwise for vector fields. For an integer m≥4 and smooth real divergence-free u:Q2→R2, define ω=∂1u2−∂2u1, Y=∥u∥Hm, B=∥ω∥H1, and S=∑k≠0∣k∣ ∣u^(k)∣. Then S<∞ and there is a constant Cm depending only on m such that S≤Cm(1+Blog⁡(e+Y)).

Facts & Assumptions

Given: Countable Choice, the normalized Fourier and Sobolev 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: the normalized coefficients and weights in the Statement define the Fourier Sobolev norms componentwise.

Proof

1.1givenA1F1algebra

In each periodic coefficient integral, one-coordinate integration by parts has boundary term f(x)e−ikjxj∣02π=0 because both factors are periodic, so ∂jf^(k)=ikjf^(k). Thus k⋅u^(k)=0 for k≠0 and ω^(k)=i(k1u^2(k)−k2u^1(k)). Since a vector in C2 orthogonal to the nonzero real vector k is a complex multiple of (−k2,k1), these identities imply ∣ω^(k)∣=∣k∣ ∣u^(k)∣.

2.1givenF1step 1.1algebra

For K≥2, Cauchy–Schwarz and the definition of B give ∑0<∣k∣≤K∣ω^(k)∣≤B(∑0<∣k∣≤Kwk−2)1/2. For each integer j≥1, the unit squares centered at lattice points with j≤∣k∣<j+1 lie in an annulus of radii max⁡(0,j−1) and j+2; comparing areas shows that this shell contains at most Cj lattice points. Hence ∑0<∣k∣≤Kwk−2≤C∑1≤j≤K+1j−1≤Clog⁡(e+K), and the low-frequency sum is at most CBlog⁡(e+K).

3.1givenF1step 2.1algebra

For the high frequencies, Cauchy–Schwarz gives ∑∣k∣>K∣k∣ ∣u^(k)∣≤Y(∑∣k∣>K∣k∣2wk−2m)1/2. The same shell count bounds the series inside the square root by C∑j>K−1j3−2m≤CmK4−2m, since m≥4. Thus the high-frequency sum is at most CmYK2−m. The series is finite for every such u by the same estimate and its finite low-frequency part.

4.1givenstep 2.1step 3.1algebra∎

Choose K=2+(e+Y)1/(m−2). Then YK2−m≤Y/(e+Y)≤1, and log⁡(e+K)≤Cmlog⁡(e+Y) because log⁡(e+Y)≥1 and K≤2+(e+Y). Combining the low- and high-frequency bounds from steps 2.1 and 3.1 proves the asserted estimate.

Depends on

Dependency tree · 2 levels

Sources