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.

Quadratic transport in negative Sobolev space

Statement

Assume Countable Choice. Let d≥2, L>0, r>d/2+1, and a∈L2(TLd;Rd). Use the Fourier multipliers Pk, negative-space norm and divergence convention of Periodic solenoidal Fourier spaces. Identify an H−r coefficient sequence c=(ck) with the periodic distribution ⟨Tc,φ⟩=∑k∈Zdck⋅φ^(−k)(φ∈C∞(TLd;Cd)), using the bilinear pairing and normalized measure. On H−r define P by (Pc)k=Pkck; this is the extension of the L2 projection under this distribution identification. Then div⁡(a⊗a) and Pdiv⁡(a⊗a) belong to H−r, and the projected distribution satisfies ∥Pdiv⁡(a⊗a)∥H−r≤C(d,L,r)∥a∥22. Here (a⊗a)ij=aiaj and (div⁡A)i=∑j∂jAij. The estimate uses no three-dimensional singular-integral bound.

Facts & Assumptions

Given: Countable Choice, d≥2, L>0, r>d/2+1, and a∈L2(TLd;Rd).

[F1]

Periodic solenoidal Fourier spaces: under Countable Choice, Pk is an orthogonal contraction; derivatives multiply Fourier coefficients by iκk, and the H−r norm uses the weight (1+L2∣κk∣2)−r.

[F2]

The Fourier basis and Parseval's identity on the finite torus: under Countable Choice, Fourier coefficients and Parseval apply to the normalized torus after rescaling by L.

[F3]

Holder's inequality for integrals, including the endpoint cases: Cauchy–Schwarz bounds each Fourier coefficient of the L1 product aiaj by ∥ai∥2∥aj∥2.

Proof

1.1givenF1F2F3algebra

Put wk=(1+L2∣κk∣2)r. For any sequence c with ∑kwk−1∣ck∣2<∞, Cauchy–Schwarz gives ∣∑kck⋅φ^(−k)∣≤∥c∥H−r(∑kwk∣φ^(−k)∣2)1/2. Repeated integration by parts bounds the last factor by a constant times pM(φ) for an integer M>r+d/2, because smooth Fourier coefficients decay as (1+∣k∣)−M. Thus the displayed pairing is absolutely convergent and continuous, so defines a periodic distribution; testing on one character recovers each ck, proving injectivity. It agrees with the regular distribution of an L2 field by Fourier truncation and Parseval. Since ∥Pk∥≤1, coefficient multiplication by Pk is a contraction on H−r, preserves real conjugate symmetry, and agrees on L2 with the supplied projection. For A=a⊗a∈L1, its row divergence is the continuous functional ⟨div⁡A,φ⟩=−∑i,j∫Aij∂jφi dμ, bounded by ∑i,j∥Aij∥1p1(φ). Now aiaj∈L1 and Cauchy–Schwarz gives ∣aiaj^(k)∣≤∥ai∥2∥aj∥2, hence the Euclidean tensor norm of this coefficient is at most Cd∥a∥22. The unprojected divergence coefficient is bk=i∑jκk,ja⋅aj^(k) and has size at most Cd∣κk∣∥a∥22.

2.1givenF1F2step 1.1∎

The square of the unprojected negative norm is bounded by Cd∥a∥24∑k∈Zd(1+L2∣κk∣2)−r∣κk∣2. For lattice shell m≤∣k∣<m+1, the number of points is at most Cdmd−1, while each summand is at most CL,rm2−2r for m≥1; the shell series is dominated by ∑mmd+1−2r, which converges because r>d/2+1. The zero mode contributes zero. Therefore b defines an element of H−r. Its distribution agrees with the original divergence: rectangular Fourier sums of a smooth test converge with their first derivatives uniformly, so integration against the L1 tensor passes to that limit and gives precisely the coefficient pairing of step 1.1. The extension P defined there applies to this distribution and is a contraction; taking square roots proves the stated projected bound.

Depends on

Dependency tree · 2 levels

Sources