Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)verified 2026-11-04 (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.

Cauchy–Schwarz Estimates for String Mode Coefficients

Statement

Let D≥1 be finite, let η=diag⁡(−1,+1,…,+1), and extend its bilinear contraction to CD. For u∈CD, define ∣u∣E2:=∑μ=0D−1∣uμ∣2. For a sequence a=(am)m∈Z in CD, define ∥a∥ℓ2,E2:=∑m∈Z∣am∣E2. If a,b have finite such norms, then for every n∈Z the convolution is absolutely convergent and

∑m∈Z∣am⋅bn−m∣≤∥a∥ℓ2,E ∥b∥ℓ2,E.

For a continuous periodic function Q:R→CD, define ∥Q∥2,E2:=(2π)−1∫−ππ∣Q(s)∣E2 ds; for a continuous scalar periodic function r, define ∥r∥1:=(2π)−1∫−ππ∣r(s)∣ ds. Then for continuous periodic A,B:R→CD,

∥A⋅B∥1≤∥A∥2,E ∥B∥2,E.

Here ⋅ is always the Minkowski contraction, while the norms used in estimates are positive Euclidean norms.

Facts & Assumptions

Given: A finite target dimension D, the mostly-plus diagonal matrix η, square-summable vector sequences, and continuous 2π-periodic vector functions.

[A1]

The sequence norms are nonnegative extended sums that are finite where the statement assumes square summability; integrals in the function norms are normalized Riemann integrals of continuous functions on the compact interval.

Proof

technique · prove the finite Cauchy–Schwarz bound by a nonnegative quadratic, then pass to monotone limits and integrate
1.1givenalgebra

For nonnegative finite lists (xj) and (yj), if ∑jyj2=0, then every yj=0 and ∑jxjyj=0. Otherwise put t=(∑jxjyj)/(∑jyj2). Expanding 0≤∑j(xj−tyj)2 gives (∑jxjyj)2≤(∑jxj2)(∑jyj2). Applying this to xμ=∣uμ∣ and yμ=∣vμ∣, and using ∣ημμ∣=1, gives ∣u⋅v∣≤∑μ∣uμ∣∣vμ∣≤∣u∣E∣v∣E.

2.1givenstep 1.1algebra

For any finite index set J⊂Z, step 1.1 applied to xm=∣am∣E, ym=∣bn−m∣E gives ∑m∈J∣am⋅bn−m∣≤(∑m∈J∣am∣E2)1/2(∑m∈J∣bn−m∣E2)1/2≤∥a∥ℓ2,E∥b∥ℓ2,E. Taking J={−N,…,N} makes the left sides increase to the full nonnegative series; their common finite bound proves absolute convergence and the asserted inequality.

3.1A1step 1.1algebra∎

Put a(s)=∣A(s)∣E and b(s)=∣B(s)∣E. If ∫b2=0, continuity and nonnegativity imply b=0 everywhere: a positive value would make b bounded below by a positive constant on a nonempty interval and force a positive integral. Otherwise set t=((2π)−1∫ab)/((2π)−1∫b2). Expanding 0≤(2π)−1∫−ππ(a−tb)2 ds gives ((2π)−1∫ab)2≤∥A∥2,E2∥B∥2,E2. By step 1.1 pointwise, ∣A(s)⋅B(s)∣≤a(s)b(s); integrate and take nonnegative square roots to obtain ∥A⋅B∥1≤∥A∥2,E∥B∥2,E.

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources