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.
Fourier compactness with coefficient time control
Statement
Assume Countable Choice. Let , , and . Let be continuous finite-Fourier-sum curves such that, for constants , and for each there is with for all . Then some subsequence converges uniformly in each Fourier coefficient to , with and ; it also converges strongly to in and, after a further subsequence, strongly in for almost every .
Statement references
Facts & Assumptions
Given: Countable Choice, the sequence and bounds in the Statement, the Fourier convention of Periodic solenoidal Fourier spaces, and the Bochner spaces of Weak time continuity and energy spaces.
Periodic solenoidal Fourier spaces: under Countable Choice, Parseval identifies norms and gradient norms with the corresponding Fourier square sums; frequencies satisfy .
Weak time continuity and energy spaces: weak continuity is continuity of every fixed pairing, and uses strong measurability and the integrated norm.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: for nonnegative measurable functions on the product of the finite time interval and the countable index space, the sum and time integral may be interchanged.
The Axiom of Countable Choice (): a countable sequence of nonempty sets admits a choice function; this is the inherited hypothesis of the Fourier-space supplier. The subsequence selections below use explicit least-index rules.
Proof
For each fixed , the coefficients are bounded by and have common Lipschitz constant . The following deterministic rule extracts a convergent subsequence from any sequence in the closed cube underlying . Order the finitely many closed half-sized subcubes lexicographically, retain the first containing infinitely many terms of the current index set, and repeat inside that cube. Select from the th retained infinite index set the least index greater than the previously selected index. The selected terms converge because the cubes are nested, closed, and have diameters tending to zero. Enumerate the countable pairs with and . Apply this fixed rule recursively to the preceding subsequence for each successive pair, and take diagonal indices, each the least available index greater than the preceding one. For any fixed pair the diagonal is eventually a subsequence of its convergent extraction. Thus it converges at every such pair without any dependent sequence of arbitrary choices. For each fixed , the common Lipschitz bound and a finite rational mesh make the coefficients uniformly Cauchy on , including its endpoints. Thus one subsequence converges uniformly in every Fourier coefficient.
At each time, every finite Fourier sum of squared limiting coefficients is at most ; Parseval therefore defines with norm at most . Pairings with finite Fourier sums are continuous in time. For arbitrary , approximate by its finite Fourier truncations; the pairing error is at most , uniformly in time, so is continuous. Finite gradient sums integrated in time pass to the limit and are bounded by ; monotone convergence gives a finite gradient square sum for almost every . On that full-measure set, the finite Fourier truncations converge to in . Each is continuous with values in a finite-dimensional subspace of , hence is a uniform limit of measurable simple maps by uniform continuity on . Keep the actual map defined by its limiting coefficients at every time. Define a separate -valued representative where the gradient square sum is finite and on the exceptional null set. The continuous finite-dimensional maps converge to in almost everywhere, so is strongly measurable. Its norm is integrable in square because the integrated norm is at most and the integrated gradient square sum is at most . Thus defines a class in whose -valued class is represented by the unchanged weakly continuous map . The asserted pointwise bound and every limiting Fourier coefficient continue to refer to that unchanged map; only the Bochner representative has been assigned zero on the exceptional set.
If , then , so Parseval and the gradient bound give ; the same estimate holds for . On the finitely many modes , uniform coefficient convergence gives strong convergence. Letting proves strong convergence in .
The product estimate proves strong convergence of the quadratic tensors. Recursively choose the least index larger than its predecessor for which the squared error is at most at stage ; strong convergence ensures such an index exists. The resulting squared errors have finite sum. By [F3], their pointwise sum is finite for almost every time, so the subsequence converges strongly in at each such time.