Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

White noise is a Borel Gaussian law on the negative Sobolev space

Statement

Assume countable choice. Let (ψlk) be the wavelet or trigonometric basis from Logarithmic negative Sobolev spaces for white noise. Let Zlk be mutually independent real random variables with density g(x)=(2π)−1/2e−x2/2. Define the formal white-noise coefficient sequence W=(Zlk). For every δ>1/2, this sequence is almost surely an element of H(δ) and is a Borel Gaussian random element there. Its law N is a Borel probability on H(δ). For an infinite-dimensional basis, white noise is not an L2([0,1])-valued random element. Here Gaussian means that each continuous real linear functional has a centered law N(0,v) in the density convention of Density normal laws and square-summable Gaussian series under countable choice; in particular, for L(c)=∑jdjcj its variance is ∑jdj2 whenever this pairing is continuous on H(δ).

Facts & Assumptions

[F1]

Logarithmic negative Sobolev spaces for white noise: H(δ) has squared norm ∑l,kal−1(log⁡al)−2δ∣clk∣2, and its finite-level coordinate projections converge in that norm.

[F2]

Identical distribution and IID families: Independent identically distributed coordinates are mutually independent; here their common density is given explicitly in the statement.

[F3]

Monotone convergence for the integral: The expectation of an increasing sequence of nonnegative random variables increases to the expectation of its pointwise limit.

[F4]

Continuity from above when one set has finite measure: For decreasing events in a probability space, the probability of their intersection is the limit of their probabilities.

[F5]

Density normal laws and square-summable Gaussian series under countable choice: Under countable choice the density normal laws have mean and variance equal to their parameters, and a probability limit of finite independent centered normal sums has the normal law with limiting variance. Its proof uses density convolution and a CDF sandwich, without characteristic-function uniqueness or full choice.

Given: Countable choice, the countable basis and independent coordinates Zlk with the displayed standard normal density.

Proof

1.1F1algebra

Write wl=al−1(log⁡al)−2δ. In the wavelet case, the trace sum is a finite coarsest term plus ∑l≥12lwl=(log⁡2)−2δ∑l≥1l−2δ. On each block 2m≤l<2m+1, the sum of l−r is between 2m2−r(m+1) and 2m2−rm; hence these blocks form a convergent geometric series when r>1, while for r≤1 their contributions are bounded below by a fixed positive constant and the series diverges. For trigonometric coefficients with bounded multiplicities, the block 2m≤∣l∣<2m+1 contributes between constant multiples of m−2δ to ∑l≥2[l(log⁡l)2δ]−1. The same comparison therefore gives finiteness exactly when δ>1/2. Thus the trace Tδ:=∑l,kwl is finite in either case.

2.1F2F3F5step 1.1algebra

Let Sm be the sum of wlZlk2 over the first m coordinates in the fixed countable enumeration. These nonnegative partial sums increase to S=∑l,kwlZlk2, and [F3] gives ES=lim⁡mESm=∑l,kwl=Tδ. The mean and second moment of each coordinate are 0 and 1 by [F5]. If S=∞ on a set of probability p>0, then ES≥Rp for every R>0, impossible; hence S<∞ almost surely.

3.1F1step 2.1

On that probability-one event, the finite-coordinate sums of W are Cauchy in H(δ) because the squared norm of every tail is the corresponding tail of the convergent series S. Completeness gives a limit in H(δ). The Cauchy event is measurable, and the partial sums are measurable; their pointwise limit on that event is measurable as an H(δ)-valued map because the space is separable. Setting it to zero on the measurable complement gives a Borel random element.

4.1F1F2F5step 3.1algebra

Let ej be the unit vector of the weighted sequence Hilbert space supported on coordinate j and let bj=L(ej) for a continuous real linear functional L. For each finite set F, boundedness applied to ∑j∈Fbjej gives ∑j∈Fbj2≤∥L∥2, so ∑jbj2<∞. Since the weights wj are bounded, v:=∑jwjbj2<∞. The finite-coordinate projections of W converge almost surely in H(δ) by step 3.1, so continuity gives L(W)=lim⁡m∑j≤mwjbjZj almost surely. By [F5] this limit has exactly the density normal law N(0,v). Thus W is centered Gaussian. For a continuous coefficient pairing L(c)=∑jdjcj, one has bj=dj/wj, giving v=∑jdj2.

5.1F1F2F4givenalgebra∎

Enumerate the infinite basis as (ψj)j≥1, write its white-noise coordinates as Zj, and let Aj={∣Zj∣≥1}. The displayed normal density is positive on [1,2], so p:=P(Aj)>0; independence gives P(⋂j=mm+qAjc)=(1−p)q+1. By [F4], P(⋂j≥mAjc)=0 for each m, so the event that only finitely many Aj occur, a countable union of these intersections, has probability zero: disjointify that union by replacing its mth event Em with Em∖⋃i<mEi, and use countable additivity and monotonicity to sum zero probabilities. Therefore ∑j≤nZj2 is unbounded almost surely. If the same H(δ) element were represented by an L2 function, the coefficient embedding in [F1] would identify its L2 coefficients with Zj. The finite Pythagorean identity, applied to the projection onto ψ1,…,ψn, would then give ∑j≤nZj2≤∥W∥22 for every n, a contradiction.

Depends on

Used by

Dependency tree · two levels

43 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources