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.

A deterministic integral construction of a Gaussian process

Example

Assume the Axiom of Choice. Let B be a standard Brownian motion and fix the measurable probability-one event A from its continuity clause. Define the zero-repaired pathwise integral

Xt(ω)={0tBr(ω)dr,ωA,0,ωA,t0,

where the integral on A is the deterministic Riemann integral. Then X is a centered Gaussian process and

Cov(Xs,Xt)=0s0tmin(u,v)dvdu.

For 0st, this covariance equals

s2(3ts)6.

Facts & Assumptions

Given: AC, a standard Brownian motion B, and its specified measurable probability-one continuity event A.

[F1]

Brownian motion is a centered Gaussian process with covariance min(s,t), and every path indexed by A is continuous. Brownian motion, Gaussian process.

[F4]

A continuous function on a nondegenerate compact rectangle is Riemann integrable, all tagged product-grid sums converge with mesh, and its multiple integral equals either ordinary iterated integral. Every continuous function on a closed nondegenerate rectangle in Rm is Riemann integrable, The multidimensional Darboux and tagged-mesh definitions of the Riemann integral agree, Riemann--Fubini on product rectangles, with lower and upper section integrals and content-zero exceptional sections.

[F5]

Covariance is bilinear in finite linear combinations. Covariance is symmetric and bilinear in finite linear combinations.

[F6]

Characteristic functions are expectations of complex exponentials; N(m,σ2) has characteristic function eimzσ2z2/2 and the specified mean and variance. Characteristic function of a real random variable, Characteristic function of a normal law.

[F7]

Dominated convergence applies to integrable complex random variables, and eiy=1 for real y. Dominated convergence, exp(x+iy)=ex(cosy+isiny), exp(x+iy)=ex, and eiπ+1=0.

[F8]

Under AC, a real probability law is determined by its characteristic function, and N(0,q) exists for every q0, including q=0. Uniqueness of a law from its characteristic function, Standard normal and normal laws.

[F10]

AC is used through the Brownian, deterministic-integration, normal-law, and characteristic-function uniqueness suppliers. The Axiom of Choice.

Verification

technique · direct
1.1

For m1 and t0, put Rm(t)=tmk=0m1Bkt/m. This is a measurable random variable by [F2]. On A, [F3] makes Rm(t)(ω) converge to the displayed Riemann integral as m; for t=0, every sum and the integral are zero. Define Xt by this limit on A and by zero on Ac. It is measurable: the convergence set and limsup of the measurable sequence are measurable by [F2], and pasting that finite limit on the measurable set A with zero on its complement preserves every Borel inverse image. Thus the statement defines a real stochastic process rather than an integral that might be undefined on exceptional paths.

F1F2F3construct
1.2

For s,t>0, covariance bilinearity and [F1] give Cm(s,t):=Cov(Rm(s),Rm(t))=stm2k,=0m1min(ks/m,t/m). This is the lower-corner product-grid Riemann sum for the continuous function (u,v)min(u,v) on [0,s]×[0,t]. Its mesh tends to zero, so [F4] gives Cm(s,t)C(s,t):=0s0tmin(u,v)dvdu. If s=0 or t=0, both Cm(s,t) and the declared degenerate-rectangle integral are zero, so the same conclusion holds.

F1F4F5algebra
2.1

Fix n1, times t1,,tn0, coefficients a1,,an, and set Ym=iaiRm(ti) and Y=iaiXti. By [F1], Ym is centered normal. Step 1.2 and covariance bilinearity show that its variance Vm=i,j=1naiajCm(ti,tj) converges to V=i,j=1naiajC(ti,tj). On A, step 1.1 gives YmY, hence the convergence is almost sure. In particular, V=limmVm0.

step 1.1step 1.2F1F5algebra
2.2

Now let 0<st. Every section of min(u,v) is continuous, so [F4] writes C(s,t)=0s(0uvdv+utudv)du=0s(utu22)du. The polynomial antiderivatives justified by [F9] give C(s,t)=ts22s36=s2(3ts)6. For s=0 both the double integral and polynomial are zero by their endpoint conventions.

step 1.2F4F9algebra
3.1

For each real z, [F6] gives E[eizYm]=ez2Vm/2. The left side converges to E[eizY] by [F7], because eizYmeizY almost surely and every modulus is one; the right side converges to ez2V/2. By [F8], YN(0,V). Since the finite list and coefficients were arbitrary, X is a centered Gaussian process. This argument proves Gaussian closure from the actual almost-sure Riemann-sum limit; it does not assume that arbitrary pointwise limits of Gaussian variables remain Gaussian.

step 2.1F6F7F8
4.1

Apply step 3.1 to the singleton coefficients and to (Xs+Xt). It gives Var(Xr)=C(r,r) and Var(Xs+Xt)=C(s,s)+2C(s,t)+C(t,t). Covariance bilinearity also gives Var(Xs+Xt)=Var(Xs)+2Cov(Xs,Xt)+Var(Xt). Comparing and cancelling proves Cov(Xs,Xt)=C(s,t), including s=0 or t=0.

step 3.1F5F6algebra
5.1

Steps 1.1--4.1 prove every claim. Repeated times, zero coefficients, and singular linear combinations are retained in steps 2.1 and 3.1; t=0 is handled without a nondegenerate rectangle, and the empty finite list has the unique empty-tuple law. Changing the chosen probability-one continuity event changes Xt only on a null set for each t, so the asserted finite laws and covariance are unaffected. AC is used exactly through [F1], [F3], [F6], and [F8], including the countable-choice input inherited by the continuous-integrability interface in [F3]; the fixed uniform left-endpoint sums, pasting, and finite algebra require no further choices.

step 1.1step 1.2step 2.1step 3.1step 4.1step 2.2F1F3F6F8F10

Source notes

Yoshida, Section 6.1, Lemma 6.1.3 and equation (6.5), printed pp. 174--175, supplies the Gaussian finite-combination and Brownian covariance inputs; Section 6.3 supplies Brownian path regularity context. The zero repair, Riemann-sum characteristic-function passage, double-integral covariance, and polynomial evaluation are derived in full above.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

131 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