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 , let be integers, let , and define by . For each coordinate , where .
Statement references
Facts & Assumptions
Given: The hypotheses and conventions stated in the formulation.
Periodic fluid Fourier Sobolev spaces: Fourier coefficients use , and norm is the coefficient norm.
Periodic Fourier embeddings and products: for , embeds in with the stated norm bound.
Proof
Given: Countable Choice, , integers , and smooth real .
For a trigonometric polynomial approximation, the th coefficient of the commutator is . The mean-value theorem applied to gives , because .
The first resulting convolution is bounded in by ; the second is bounded by . Cauchy–Schwarz and for bound these sums by and , respectively. The required strict inequality holds since and . Discrete Young then gives the claimed bound for polynomials.
Smooth Fourier truncations converge in each displayed Sobolev norm, so the polynomial estimate passes to smooth by continuity of multiplication and Fourier multipliers. The strict condition also agrees with the embedding in [F2]; no endpoint commutator estimate is used.