Alphabeta Math
Pipeline-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.

Statistical inverse experiments and white noise — Examples and Counterexamples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Two direct white-noise functionals

Example

Take the single-parameter experiment with H=R2, its standard inner product, parameter set {x}, mean signal Kx=(m1,m2), and noise level ϵ>0. Let e1=(1,0), e2=(0,1), and g=ae1+be2 for a,b∈R. The direct observations Yx(e1) and Yx(e2) are independent with laws N(m1,ϵ2) and N(m2,ϵ2). In L2(P), Yx(g)=aYx(e1)+bYx(e2), with mean am1+bm2 and variance ϵ2(a2+b2); when a=b=0, Yx(g) is the constant zero.

Facts & Assumptions

[F1]

Isonormal Gaussian white-noise inverse experiment: The process is linear into L2(P), centered, has covariance E[Z(g)Z(h)]=⟨g,h⟩H, and has independent standard-normal coordinates on finite orthonormal tuples.

Given: The two-dimensional experiment, e1,e2, m1,m2, a,b, and ϵ>0 in the Example.

Verification

1.1givenF1

Since e1,e2 are orthonormal, [F1] gives independent standard-normal noises Z(e1),Z(e2). Each observation is an invertible affine function of its noise coordinate because ϵ>0, so it has the same generated sigma-algebra; the affine-image definition of N gives the two asserted laws and preserves independence.

2.1givenF1algebra∎

Linearity of the process gives Yx(g)=aYx(e1)+bYx(e2) as an equality of its almost-sure equivalence classes. The mean is am1+bm2, and the covariance identity in [F1] gives variance ϵ2∥ae1+be2∥2=ϵ2(a2+b2). If a=b=0, then g=0 and linearity gives Yx(0)=0.

ExampleConstruction: AI-generatedVerification: AI-generatedverified 2026-10-22 (gpt-6.1-sol)Open item page →

Gaussian coefficient sequence

Example

Let H=ℓ2(N) with standard basis ej, take a single parameter with signal θ=(θj)∈ℓ2(N), and fix ϵ>0. The coordinate statistic Yj=Y(ej)=θj+ϵZ(ej) has independent coordinates with laws N(θj,ϵ2). Each finite truncation (Y1,…,YN) therefore has the product of its N scalar normal laws. The coordinate statistic takes values in RN; this description does not identify the observation with an ℓ2-valued vector.

Facts & Assumptions

[F1]

White-noise spectral sequence representation: In a fixed complete finite or countable orthonormal basis, the observation coordinates are independent with laws N(⟨Kx,uj⟩H,ϵ2).

Given: The signal θ∈ℓ2(N), the standard basis of H, and ϵ>0 in the Example.

Verification

1.1givenF1

Apply [F1] with Kx=θ and uj=ej to obtain the independent coordinate laws N(θj,ϵ2) for every j.

2.1givenF1algebra∎

Independence of every finite subfamily means that for each N the joint law of (Y1,…,YN) is the product of those N marginal normal laws. The sample-space assertion is the coordinate-statistic map into RN, and no step identifies it with an element of ℓ2.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)Open item page →

Finite truncation with its omitted white-noise tail

Example

Let (uj) be a fixed complete orthonormal basis, h=Kx a mean signal, g∈H a test vector, and N a positive integer. Define PNg=∑j≤N⟨g,uj⟩Huj and rN=g−PNg. Then

Yx(g)=∑j≤N⟨g,uj⟩HYx(uj)+⟨h,rN⟩H+ϵZ(rN)

in L2(P). The omitted tail has mean ⟨h,rN⟩H, variance ϵ2∥rN∥H2, and is independent of the first N coordinate observations. If rN=0, the omitted tail vanishes.

Facts & Assumptions

[F1]

Isonormal Gaussian white-noise inverse experiment: The process is linear into L2(P), centered, has covariance E[Z(g)Z(h)]=⟨g,h⟩H, and has independent standard-normal coordinates on every finite orthonormal tuple.

[F2]

White-noise spectral sequence representation: For every g∈H, the finite coordinate sums converge to Yx(g) in L2(P).

Given: The complete orthonormal basis, the test vector g, the mean signal h=Kx, the cutoff N, and the isonormal experiment in the Example.

Verification

1.1givenF1F2algebra

Since g=PNg+rN and the process is linear by [F1], Yx(g)=Yx(PNg)+Yx(rN). Applying [F2] to PNg, whose later finite projections equal PNg, gives Yx(PNg)=∑j≤N⟨g,uj⟩HYx(uj); the definition gives Yx(rN)=⟨h,rN⟩H+ϵZ(rN). This proves the displayed decomposition.

2.1givenF1algebra∎

The residual rN is orthogonal to u1,…,uN. If rN≠0, adjoining rN/∥rN∥H to these vectors gives a finite orthonormal tuple, so [F1] makes Z(rN/∥rN∥H) independent of the first N coordinate noises; linearity gives Z(rN)=∥rN∥HZ(rN/∥rN∥H) as an equality of its almost-sure equivalence classes. Since ϵ>0, this noise and the tail observation are invertible affine functions of one another, so the tail observation is independent of the first N coordinates. The covariance identity gives its variance ϵ2∥rN∥H2 and its mean is ⟨h,rN⟩H. If rN=0, both are zero.

Sources