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.
Global compatible no-slip shear evolution
Statement
Assume Countable Choice. Let and let with periodic coordinates and no-slip walls . Use product Lebesgue measure , with the quotient coordinates carrying their period-length measures. Suppose is smooth and has a smooth odd -periodic extension to the real line. For , define and Then is a global smooth real solution, unique among all smooth velocity solutions with the same initial data, of the incompressible periodic-channel system , , , , with mean-zero pressure . The same sine series defines a smooth -periodic function of on the full real line. For every , . This theorem concerns the shear solution and smooth uniqueness for the same full-flow data; it gives no global regularity theorem for perturbed three-dimensional flows.
Statement references
Facts & Assumptions
Given: Countable Choice and the channel, viscosity, profile, and exact model system in the Statement.
The periodic flat channel has product Euclidean metric, periodic side coordinates, boundary faces , and no-slip trace there (Flat periodic and infinite channel domains).
Under Countable Choice, Fourier synthesis and Parseval hold on the normalized torus; rescaling identifies the normalized circle of period , and odd functions synthesize through the sine basis (The Fourier basis and Parseval's identity on the finite torus).
Countable Choice is inherited from the Fourier-basis statement used to identify the odd Fourier series with the initial profile; no additional choice principle is spent (The Axiom of Countable Choice ()).
The incompressible channel equation and no-slip wall law displayed in the Statement are the mathematical system being solved; no empirical fluid behavior is assumed.
Proof
Let be the stated smooth odd -periodic extension. Repeated integration by parts on the circle, with no boundary term because the integrands and derivatives are periodic, shows its Fourier coefficients decay faster than every inverse power of . By [F2] and oddness, the sine coefficients are exactly and the sine series equals in ; since both are continuous, the equality holds pointwise. Countable Choice [A1] is the Fourier-basis theorem's stated inherited assumption.
For nonnegative integers , the time/space derivative of the th term in is bounded uniformly for and by . The rapid coefficient decay from step 1.1 makes these bounds summable by choosing a decay power larger than . Thus every differentiated series converges uniformly on , so termwise differentiation is valid to all orders. Each term satisfies and vanishes at , while step 1.1 gives .
The field is divergence-free because its first component is independent of and its other components vanish. Its convective derivative is and . Therefore step 2.1 gives the full system [A2] with constant pressure and the stated wall and initial traces. The pressure is mean-zero.
Let be this solution and any other smooth solution with the same data and mean-zero pressure; put . Subtraction gives . Dot with and integrate on . Periodic side integrals cancel; the transport term is because and on the walls; pressure contributes ; integration by parts gives since on the walls. The remaining term is bounded by , so . Since , multiplying by proves .
Parseval on the odd extension yields . Multiplying by the finite periodic side area and taking square roots proves the asserted decay. The preceding steps establish global smooth existence, full-flow smooth uniqueness for the data, and the bound.