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

Tame transport commutator

Statement

Assume Countable Choice. Let d∈{1,2,3}, let m≥s≥4 be integers, let f,g∈C∞(Qd;R), and define Λm by Λmq^(k)=wkmq^(k). For each coordinate j, ∥[Λm,f]∂jg∥L2≤Cd,m,s(∥f∥Hm∥g∥Hs+∥f∥Hs∥g∥Hm), where [Λm,f]h=Λm(fh)−fΛmh.

Facts & Assumptions

Given: The hypotheses and conventions stated in the formulation.

[F1]

Periodic fluid Fourier Sobolev spaces: Fourier coefficients use wk=(1+∣k∣2)1/2, and L2 norm is the coefficient ℓ2 norm.

[F2]

Periodic Fourier embeddings and products: for σ>j+d/2, Hσ embeds in Cj with the stated norm bound.

Proof

Given: Countable Choice, d∈{1,2,3}, integers m≥s≥4, and smooth real f,g.

1.1givenF1algebra

For a trigonometric polynomial approximation, the kth coefficient of the commutator is ∑v+ℓ=k(wkm−wℓm)f^(v)iℓjg^(ℓ). The mean-value theorem applied to x↦(1+∣x∣2)m/2 gives ∣wℓ+vm−wℓm∣≤Cm∣v∣(wvm−1+wℓm−1), because wℓ+θvm−1≤Cm(wℓm−1+wvm−1).

2.1givenF1step 1.1algebra

The first resulting convolution is bounded in ℓ2 by C∥wmf^∥2∑ℓ∣ℓ∣ ∣g^(ℓ)∣; the second is bounded by C(∑v∣v∣ ∣f^(v)∣)∥wmg^∥2. Cauchy–Schwarz and ∑k∣k∣2wk−2s<∞ for s>1+d/2 bound these sums by C∥g∥Hs and C∥f∥Hs, respectively. The required strict inequality holds since s≥4 and d≤3. Discrete Young then gives the claimed bound for polynomials.

3.1givenF1F2step 2.1algebra∎

Smooth Fourier truncations converge in each displayed Sobolev norm, so the polynomial estimate passes to smooth f,g by continuity of multiplication and Fourier multipliers. The strict s≥4>d/2+1 condition also agrees with the C1 embedding in [F2]; no endpoint commutator estimate is used.

Depends on

Dependency tree · 2 levels

Sources