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 , , , and . Use the Fourier multipliers , negative-space norm and divergence convention of Periodic solenoidal Fourier spaces. Identify an coefficient sequence with the periodic distribution using the bilinear pairing and normalized measure. On define by ; this is the extension of the projection under this distribution identification. Then and belong to , and the projected distribution satisfies Here and . The estimate uses no three-dimensional singular-integral bound.
Statement references
Facts & Assumptions
Given: Countable Choice, , , , and .
Periodic solenoidal Fourier spaces: under Countable Choice, is an orthogonal contraction; derivatives multiply Fourier coefficients by , and the norm uses the weight .
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 .
Holder's inequality for integrals, including the endpoint cases: Cauchy–Schwarz bounds each Fourier coefficient of the product by .
Proof
Put . For any sequence with , Cauchy–Schwarz gives . Repeated integration by parts bounds the last factor by a constant times for an integer , because smooth Fourier coefficients decay as . Thus the displayed pairing is absolutely convergent and continuous, so defines a periodic distribution; testing on one character recovers each , proving injectivity. It agrees with the regular distribution of an field by Fourier truncation and Parseval. Since , coefficient multiplication by is a contraction on , preserves real conjugate symmetry, and agrees on with the supplied projection. For , its row divergence is the continuous functional , bounded by . Now and Cauchy–Schwarz gives , hence the Euclidean tensor norm of this coefficient is at most . The unprojected divergence coefficient is and has size at most .
The square of the unprojected negative norm is bounded by . For lattice shell , the number of points is at most , while each summand is at most for ; the shell series is dominated by , which converges because . The zero mode contributes zero. Therefore defines an element of . Its distribution agrees with the original divergence: rectangular Fourier sums of a smooth test converge with their first derivatives uniformly, so integration against the tensor passes to that limit and gives precisely the coefficient pairing of step 1.1. The extension defined there applies to this distribution and is a contraction; taking square roots proves the stated projected bound.