Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
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.

A first-moment bound for the bath correlation convolution

Statement

Use h,G,H,Γ,τ from the normalization lemma. Suppose the stationary correlation is represented almost everywhere by C(u)=∫h(u−v)h(v) dv. For a matrix A put ∥A∥ent=∑ij∣Aij∣. Then M=4γ∫0∞u∥C(u)∥entdu is finite and M≤Γτ. The convolution identity is an explicit premise, not a consequence of stationarity alone.

Facts & Assumptions

[F1]

The normalized kernel obeys h(−u)=h(u)†, with G=∫R∥h(v)∥2,1dv<∞, H=∫R∣v∣∥h(v)∥2,1dv<∞ and Γτ=4γGH. Its frequency entries are integrable and its time entries are their Fourier integrals. ULE kernel adjoint symmetry and rate identities

[F2]

The kernel contract fixes a positive integer n, C:R→Cn×n with integrable entries, entrywise Lebesgue integration, and ∥A∥2,1=∑b(∑a∣Aab∣2)1/2. Stationary correlation spectra and ULE kernel regularity

[F3]

For vectors in a complex inner product space, ∣⟨x,y⟩∣≤∥x∥∥y∥. We apply this to finite rows and columns with the Euclidean norm. Cauchy–Schwarz: |⟨ u,v⟩|≤‖ u‖‖ v‖, with equality exactly for linearly dependent vectors

[F4]

Tonelli applies to nonnegative product-measurable functions on sigma-finite measure spaces before finiteness is known. We use the real line with Borel Lebesgue measure in each factor, exhausted by the finite-measure intervals (−m,m) for positive integers m. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[F5]

The Fourier transform of an L1(R) function is bounded and uniformly continuous. In the supplier's convention, the time kernel is hab(t)=hab^(t/(2π)), with the transform taken in the frequency variable. The L1 transform is bounded and uniformly continuous

[F6]

Translations preserve Lebesgue measurability and measure. Two measures agreeing on a generating pi-system are equal if that pi-system has an increasing common finite-measure exhaustion. Integral invariance under a measure-preserving self-map holds for nonnegative measurable functions, allowing infinity, and for integrable complex functions. These inputs also establish reflection invariance on the Borel line in step 1.2. Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system Integral invariance under measure-preserving maps

[F7]

For an integrable complex function f, ∣∫f∣≤∫∣f∣, and the integral is complex-linear on L1. We apply these facts entrywise, commuting only finite sums with integrals. The modulus of an integral is bounded by the integral of the modulus The Lebesgue integral is linear on L¹(μ)

Proof

Given: The convolution identity and kernel conditions. Goal: Bound M.

1.1F1F2F4F5

Apply the Fourier continuity theorem to each frequency entry supplied by the kernel contract. Thus every time entry of h is continuous, and k(v)=∥h(v)∥2,1 is a nonnegative continuous function with moments G,H. In particular (u,v)↦k(v−u)k(v) is continuous and is measurable for the product of the Borel sigma-algebras. All uses of Tonelli below therefore have product-measurable integrands and sigma-finite factors; no completed-product theorem is needed.

1.2F6

Translations preserve the Borel restriction λ of Lebesgue measure. Reflection R(v)=−v is a Borel bijection, so ν(E)=λ(R−1E) is another Borel measure. For every bounded open interval (a,b), its reflection (−b,−a) is its translate by −(a+b); hence ν((a,b))=λ((a,b)). The bounded open intervals together with the empty set form a generating pi-system, with common finite-measure exhaustion (−m,m). Measure uniqueness gives ν=λ. Thus reflection, translations and their compositions preserve the Borel measure, and integral invariance justifies substitution by any of these maps, including for nonnegative integrals that may be infinite.

2.1givenF1F3F4F7step 1.1step 1.2

For finite compatible matrices, ∣(AB)ij∣≤(∑a∣Aia∣2)1/2(∑a∣Baj∣2)1/2 by Cauchy–Schwarz. Summing over i,j gives ∥AB∥ent≤∥A†∥2,1∥B∥2,1. Put q(u)=∫Rk(v−u)k(v)dv. By h(u−v)†=h(v−u), the matrix product in the convolution has entry norm at most k(v−u)k(v). The convolution premise and the entrywise integral triangle inequality therefore give ∥C(u)∥ent≤q(u) almost everywhere. Tonelli and the substitution w=v−u, with v fixed, give ∫Rq(u)du=∫Rk(v)∫Rk(w)dw dv=G2<∞. Thus q is measurable and finite almost everywhere; in particular the majorant also proves absolute convergence of the matrix convolution almost everywhere.

3.1F4step 1.2step 2.1

Substitution z=v+u gives q(−u)=∫Rk(z)k(z−u)dz=q(u). Hence reflection invariance identifies ∫0∞uq(u)du with half of ∫R∣u∣q(u)du, including when these integrals are infinite. By the almost-everywhere majorant, ∫0∞u∥C(u)∥entdu≤12∫R∣u∣q(u)du.

4.1F1F4step 1.1step 1.2step 3.1∎

Apply Tonelli and, at each fixed v, substitute w=v−u using step 1.2. Since ∣v−w∣≤∣v∣+∣w∣, this gives ∫R∣u∣q(u)du=∫R∫R∣v−w∣k(w)k(v)dw dv≤HG+GH=2GH. All integrands interchanged here are nonnegative and product-measurable; Tonelli factors the last two terms using the finite moments G,H. Together with step 3.1 this yields ∫0∞u∥C(u)∥entdu≤GH. Multiplication by 4γ proves finiteness of M and M≤4γGH=Γτ.

Depends on

Used by · 2

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.