Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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 Fourier embeddings and products

Statement

Assume Countable Choice. Let d∈{1,2,3} and use Hσ(Qd) with the normalized measure and weights in the Definition. For every integer j≥0 and σ>j+d/2, each scalar q∈Hσ(Qd) has a Cj representative and ∥q∥Cj≤Cd,σ,j∥q∥Hσ. For every σ>d/2, pointwise multiplication extends uniquely from trigonometric polynomials to a continuous bilinear map Hσ×Hσ→Hσ satisfying ∥fg∥Hσ≤Cd,σ∥f∥Hσ∥g∥Hσ. The assertions extend componentwise to finite-dimensional vector and tensor fields.

Facts & Assumptions

Given: The hypotheses and conventions stated in the formulation.

[F1]

Periodic fluid Fourier Sobolev spaces: Hσ is the weighted Fourier coefficient completion with wk=(1+∣k∣2)1/2 on the normalized 2π-periodic torus.

[F2]

The Axiom of Countable Choice (ACω): countable families of nonempty sets admit a choice function. In [F1] this is assumed for the normalized measure, integral Fourier coefficients and L2 realization; the finite coefficient arrays and weighted coefficient completion are choice-free.

Proof

Given: Countable Choice, d∈{1,2,3}, and the coefficient norm [F1].

1.1givenF1F2algebra

The number of lattice points in the shell n≤∣k∣<n+1 is at most Cd(n+1)d−1, by covering each point with a disjoint unit cube and bounding the volume of a shell of fixed enlarged width. Hence ∑kwk−2α<∞ whenever α>d/2. Cauchy–Schwarz gives ∑k∣k∣j∣q^(k)∣≤(∑k∣k∣2jwk−2σ)1/2∥q∥Hσ≤C∥q∥Hσ when σ>j+d/2.

2.1givenstep 1.1algebra

The derivative Fourier series through order j are absolutely and uniformly convergent by step 1.1. Their partial sums are derivatives of finite Fourier sums; the one-dimensional fundamental theorem of calculus in each coordinate identifies the uniform limits successively as the classical derivatives of the limit. This proves the Cj representative and bound.

2.2givenF1step 1.1algebra

For polynomials, fg^(k)=∑ℓf^(k−ℓ)g^(ℓ). The weight inequality wk+ℓσ≤Cσ(wkσ+wℓσ) follows from wk+ℓ≤wk+wℓ and (a+b)σ≤Cσ(aσ+bσ). Discrete Young, obtained by Minkowski's inequality on finite translates, yields ∥fg∥Hσ≤C(∥f∥Hσ∥g^∥ℓ1+∥f^∥ℓ1∥g∥Hσ)≤C∥f∥Hσ∥g∥Hσ, since step 1.1 with j=0 bounds both coefficient ℓ1 norms.

3.1givenF1step 1.1step 2.2algebra∎

Finite Fourier sums are dense by the completion in [F1], so the polynomial product estimate extends uniquely by Cauchy convergence to Hσ. Since step 1.1 also gives convergence in C0, this extended product agrees pointwise with multiplication of the continuous representatives. Applying the scalar estimate to finitely many components proves the vector and tensor versions.

Depends on

Dependency tree · 2 levels

Sources