Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

Periodic fluid Fourier Sobolev spaces

Definition

Choice context. The finite coefficient arrays and weighted coefficient completion below are defined without Countable Choice. In this coefficient-only reading, a finite real trigonometric polynomial is specified by a finite coefficient array (ak), extended by zero and satisfying a−k=ak‾, and q^(k):=ak denotes its specified coefficient coordinate. For the normalized Haar-measure conventions, integral Fourier coefficients and L2 realization below, additionally assume Countable Choice, as in the declared measure and Fourier suppliers. In that analytic context the coefficient coordinates agree with the integral coefficients.

Let d∈{1,2,3} and N≥1 be integers. Let Qd=Rd/(2πZ)d carry the probability measure obtained by pushing normalized Haar measure on Td=Rd/Zd forward under y↦x=2πy; in coordinates this is (2π)−ddx. For any componentwise integrable real q:Qd→RN, considered up to equality almost everywhere, and k∈Zd, define its componentwise Fourier coefficient by q^(k)=∫Qdq(x)e−ik⋅x dμ(x); this integral is finite because ∣eik⋅x∣=1 and q∈L1. A finite real trigonometric polynomial is a finite sum q(x)=∑k∈Fakeik⋅x, where F⊂Zd is finite and the coefficients, extended by zero outside F, satisfy a−k=ak‾. Such polynomials are integrable and satisfy q^(−k)=q^(k)‾. Put wk=(1+∣k∣2)1/2. For any s∈R, define Hs(Qd;RN) as the completion of finite real trigonometric polynomials in the norm ∥q∥Hs2=∑k∈Zdwk2s∣q^(k)∣2. Identify this completion with the weighted coefficient space subject to conjugate symmetry, using finite symmetric cutoffs, and write q^(k) for its coefficient coordinate. Under Countable Choice, if s≥0, each element has a unique L2 representative, and its coefficient coordinate agrees with the normalized integral formula; for s<0 no L2 representative is asserted.

Facts & Assumptions

Given: The hypotheses and conventions stated in the formulation.

[F1]

The Axiom of Countable Choice (ACω): every countable family of nonempty sets has a choice function; the finite-torus Fourier-basis supplier assumes this principle.

[F2]

The one-dimensional torus and its normalized Haar integral: normalized Haar measure on the unit torus is probability Lebesgue measure, and the product torus carries its product probability measure.

[F3]

Fourier coefficients and trigonometric polynomials on the torus: Fourier coefficients use the normalized integral against the conjugate character, and finite character sums are trigonometric polynomials.

[F4]

The Fourier basis and Parseval's identity on the finite torus: under Countable Choice, normalized torus characters form a complete orthonormal basis; synthesis and Parseval hold and the coefficient map is an isometry onto ℓ2 in the finite-subset-net sense.

[F5]

The Cauchy criterion from the least-upper-bound property: in a complete ordered field every Cauchy sequence converges: every Cauchy sequence of real numbers converges in the complete ordered field R; this supplier has no choice hypothesis. Applying scalar completeness to the finitely many real and imaginary coordinates gives the coordinate limits used below.

Proof

Given: d∈{1,2,3}, N≥1, and the coefficient conventions in the Definition. For the normalized-measure, integral and L2 realization arguments, additionally assume Countable Choice.

1.1givenF2F3algebra

Under x=2πy, normalized measure on Td pushes forward to (2π)−ddx on Qd, while e2πik⋅y becomes eik⋅x. Thus Fourier coefficients and the componentwise L2 inner product are unchanged by this rescaling.

2.1givenF1F4step 1.1

Apply [F4] to each of the N components after this rescaling. The coefficient map identifies scalar L2(Qd) isometrically with ℓ2(Zd); summing the component identities gives the vector-valued coefficient isometry. The Countable Choice hypothesis is exactly [F1].

3.1givenF3F4F5step 2.1algebra∎

Since wk2s>0, symmetric truncations to ∣k∣∞≤M converge in the weighted ℓ2 norm by convergence of the defining nonnegative series. The conjugate-symmetry condition is preserved by these cutoffs. To verify completeness of the coefficient space without Countable Choice, let (an) be a Cauchy sequence in its weighted norm. For each k, ∣an(k)−am(k)∣≤wk−s∥an−am∥Hs, so scalar completeness [F5] applied to the finitely many real and imaginary coordinates gives a unique limit a(k). Conjugate symmetry passes to these coordinate limits. Given ε>0, choose n0 so that ∥an−am∥Hs≤ε for n,m≥n0. For fixed n≥n0 and every finite box FM={k:∣k∣∞≤M}, passing m→∞ in the finite sum gives ∑k∈FMwk2s∣an(k)−a(k)∣2≤ε2. The inequality ∣a(k)∣2≤2∣an(k)∣2+2∣a(k)−an(k)∣2 bounds the finite-box weighted sums for a by 2∥an∥Hs2+2ε2, so a lies in the weighted coefficient space. Taking the supremum over M in the preceding difference bound gives ∥an−a∥Hs≤ε. Thus the coefficient space is complete, and the explicit cutoff density already proved identifies it with the completion of finite coefficient arrays. The coordinate limits are unique and the cutoffs are specified, so this argument makes no choice of function representatives and uses no Countable Choice. For s≥0 under Countable Choice, wk2s≥1, hence the coefficient sequence is in ℓ2 and [F4] gives its unique initially complex L2 class. For each component f of this class, complex conjugation preserves L2 and the normalized coefficient convention gives f‾^(k)=f^(−k)‾=a−k‾=ak=f^(k), where ak is its coefficient coordinate. Uniqueness of Fourier synthesis in [F4] therefore gives f=f‾ almost everywhere, so Re⁡f is a real representative with the same coefficients. Applying this to the finitely many components gives a real RN-valued representative, unique up to equality almost everywhere by the coefficient isometry in step 2.1. For s<0 the construction gives only the weighted coefficient completion and makes no L2 claim.

Depends on

Dependency tree · 2 levels

Sources