Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Covariance of overlapping Brownian increments

Example

Assume the Axiom of Choice. If B is a standard Brownian motion, 0st, and 0uv, then

Cov(BtBs,BvBu)=max ⁣(0,min(t,v)max(s,u)).

Thus the covariance is the length of the overlap of the time intervals [s,t] and [u,v]; an intersection consisting of one endpoint has length zero.

Facts & Assumptions

Given: AC, a standard Brownian motion B, and 0st, 0uv.

[F1]

Brownian motion is centered with Cov(Ba,Bb)=min(a,b); its values are square-integrable normal random variables. Brownian motion, Brownian covariance is equivalent to independent stationary normal increments.

[F2]

Covariance of square-integrable real random variables is defined by centered products and is symmetric and bilinear in finite linear combinations. Moments, variance, and covariance on a probability space, Covariance is symmetric and bilinear in finite linear combinations.

[F3]

AC is inherited through the Brownian and normal-law interfaces. The Axiom of Choice.

Verification

technique · direct
1.1

Bilinearity and the Brownian covariance kernel give Cov(BtBs,BvBu)=min(t,v)min(t,u)min(s,v)+min(s,u). Every term is finite because the Brownian values are square-integrable.

F1F2
2.1

Both sides of the claimed formula are unchanged when the ordered pairs (s,t) and (u,v) are exchanged, the left side by symmetry of covariance. It therefore suffices to assume su. If tu, the four minima in step 1.1 are respectively t,t,s,s, so the covariance is zero; also min(t,v)u=max(s,u), so the stated overlap length is zero. This includes t=u and all zero-length first intervals.

step 1.1F2algebra
3.1

Still assuming su, suppose u<tv. The four minima in step 1.1 are t,u,s,s, so the covariance is tu. Here min(t,v)=t and max(s,u)=u, giving the same positive overlap length. This case includes s=u and t=v, but excludes t=u, already handled in step 2.1.

step 1.1algebra
4.1

Finally, if suv<t, the four minima in step 1.1 are v,u,s,s, so the covariance is vu. Here min(t,v)=v and max(s,u)=u. The value is zero exactly when u=v, so zero-length second intervals are included. These three cases exhaust su; pair symmetry handles u<s.

step 1.1step 2.1step 3.1F2algebra
5.1

Steps 2.1, 3.1, and 4.1 prove the formula for every allowed endpoint order, including coincident endpoints, s=t, u=v, and s=u=t=v=0. There is no empty family or biconditional. AC is used only through [F1]; expanding four covariances and comparing endpoints uses no further choice.

step 2.1step 3.1step 4.1F1F3

Source notes

Durrett, Section 7.1, printed p. 355, derives E[BsBt]=st for s<t from independent increments. The four-term overlap calculation and its complete endpoint case split are given above.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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