Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

A finite-history conditional mean can be nonlinear

Example

Take Ω={0,1,2} with equal probability and define v(0)=−1, v(1)=0, and v(2)=1. For every integer t, let Xt(ω)=v(ω+t−1) mod 3. This process is strictly stationary. For n=h=1, the conditional expectation of X2 given X1 is not affine in X1, whereas the best affine forecast is −X1/2.

Facts & Assumptions

Given: The three-point uniform probability space and the process Xt(ω)=v(ω+t−1) mod 3 with v=(−1,0,1).

[F2]

Variance and covariance are expectations of centered products. Variance, standard deviation, and covariance on a finite probability space

[F3]

Strict stationarity means invariance of every finite-dimensional law under common integer shifts; weak stationarity has the stated finite-moment and covariance conditions. Strict and weak stationarity for integer-indexed time series

[F4]

For a one-variable history with positive variance, the affine forecast coefficient is covariance divided by history variance, with the intercept adjusted to the means. Finite-history forecast equations and error variance

[F5]

A conditional-expectation version is measurable with respect to the conditioning sigma-algebra and has the defining event integrals. Conditional expectation given a sigma algebra

[F6]

A random variable measurable with respect to the conditioning sigma-algebra is its own conditional expectation. Conditioning a known variable and an independent variable

Verification

1.1givenF1F3

A common shift s changes phase ω to (ω+s) mod 3, a permutation of the equally weighted outcomes, so every shifted finite coordinate vector has the original law. One-coordinate laws give a common mean, pair laws at each lag give covariance independent of t, and boundedness gives finite moments; hence the process is weakly stationary by [F3].

2.1givenF1F2F4step 1.1algebra

The values of (X1,X2) at ω=0,1,2 are (−1,0),(0,1),(1,−1); hence both means are zero, Var⁡(X1)=2/3, and Cov⁡(X2,X1)=−1/3. By [F4], the unique best affine forecast from this one-variable history is (−1/3)/(2/3)X1=−X1/2.

3.1F5F6step 2.1algebra∎

Since X1:Ω→{−1,0,1} is bijective, σ(X1) is the full event sigma-algebra and X2 is measurable with respect to it. The conditional-expectation definition and known-variable property give E[X2∣σ(X1)]=X2, with values (0,1,−1) at ω=0,1,2. Every outcome has positive probability; if X2=a+bX1 almost surely, the outcomes with X1=0 and X1=−1 force a=b=1, which would give X2=2 when X1=1, contrary to its value −1. Thus the conditional mean is not affine in X1, while step 2.1 gives the best affine forecast −X1/2.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

36 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