Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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