Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Kolmogorov continuity criterion in one parameter

Statement

Let (S,d) be a complete separable metric space and let X=(Xt)t0 be an S-valued process. Suppose α,β>0 and a family of finite constants (CT)T>0 are given such that E[d(Xt,Xs)α]CTts1+β(0s,tT). Then X has a continuous modification Y. Moreover, one version can be chosen such that, on one event of probability one, its paths are Hölder on every compact interval for every exponent 0<γ<β/α.

Facts & Assumptions

Given: The metric-space, process, exponent, constant-family, and moment-bound hypotheses in the Statement.

[F1]

Completeness means every Cauchy sequence converges in S; separability provides a countable dense subset. Complete metric space: every Cauchy sequence converges in the space Separability: the existence of an at most countable dense subset

[F2]

For a nonnegative random variable Z and a>0, P(Za)E[Z]/a on an arbitrary probability space. Markov's inequality for random variables

[F3]

A finite or countable union has measure at most the sum of the member measures. Finite and countable subadditivity of measures

[F5]

If the sum of event probabilities is finite, only finitely many events occur almost surely. First Borel-Cantelli lemma for events

[F6]

Bounded almost-everywhere convergence of measurable indicators implies convergence of their expectations. Dominated convergence

[F7]

A modification agrees with the original process almost surely at every fixed time; this is weaker than indistinguishability. Process law, modification, and indistinguishability

[F8]

The rationals are countable, and strictly between two real numbers lies a rational. Q is countably infinite The rationals embed densely in the reals

Proof

technique · direct
1.1

Let D={k2n:k,nN0} be the nonnegative dyadic times. Fix an integer N1 and a rational η with 0<η<β/α. For n0, let EN,η,n be the event that some adjacent level-n dyadic pair k2n,(k+1)2n in [0,N] has d(X(k+1)2n,Xk2n)>2nη. These are measurable finite unions.

given
2.1

Each of the at most N2n edges in step 1.1 has, by [F2] and the moment hypothesis, probability at most CN2n(1+βαη). Hence [F3] gives P(EN,η,n)NCN2n(βαη). The exponent is positive, so [F4] makes the sum over n finite and [F5] shows that, almost surely, only finitely many EN,η,n occur.

step 1.1F2F3F4F5
3.1

Intersect the probability-one conclusions of step 2.1 over the countable set of integer N1 and rational η(0,β/α), and call the resulting measurable event H. Countability follows from [F8], and its complement is a countable union of null sets and is null by [F3]. Fix ωH,N,η. The eventual edge bound can be enlarged over its finitely many exceptional levels to a finite K=K(ω,N,η) satisfying d(X(k+1)2n(ω),Xk2n(ω))K2nη for every level-n edge in [0,N].

step 2.1F3F8
4.1

If p,qD[0,N] and 2(m+1)<pq2m, compare each point with its level-m dyadic floor. Successive binary floors differ by at most one edge of level j+1, so step 3.1 and [F4] bound each tail by Kjm2(j+1)η=K2(m+1)η/(12η); the two level-m floors differ by at most one level-m edge. Therefore d(Xp(ω),Xq(ω))K ⁣(1+21η12η)2mηKpqη. Equality p=q is trivial. Thus the sample values on the dense dyadic set are locally Hölder.

step 3.1F4algebra
5.1

For t0, let qj(t) be the largest level-j dyadic not exceeding t; then 0tqj(t)<2j0 by [F9]. On H, step 4.1 makes (Xqj(t)(ω))j Cauchy on any integer compact containing t, so [F1] gives a unique limit. Define Yt(ω) to be this limit on H and X0(ω) on Hc. Equivalently, the measurable maps Zjt=Xqj(t) on H and Zjt=X0 on Hc converge pointwise to Yt.

step 4.1F1F9
6.1

Each Yt is a Borel random element. Indeed, for a nonempty closed FS, continuity of xd(x,F) and step 5.1 give {YtF}=r1J1jJ{d(Zjt,F)<1/r}; the formula is also correct in the limiting direction because F is closed, while the empty closed set has empty inverse image. Thus inverse images of closed, hence Borel, sets are measurable. No point of S was selected: the already given X0(ω) supplies the value on Hc.

step 5.1
6.2

Letting dyadic p,q tend to arbitrary s,t[0,N] in step 4.1 shows on H that d(Ys,Yt)Kstη. Hence every path of Y on H is continuous and is locally η-Hölder for every rational η<β/α. For arbitrary 0<γ<β/α, [F8] supplies one rational η strictly between them; on [0,N], the η-bound implies the γ-bound after multiplying its constant by max(1,Nηγ). This gives all exponents simultaneously on the single event H.

step 4.1step 5.1F8algebra
7.1

Fix t and an integer N>t. The moment hypothesis and [F2] give P(d(Xqj(t),Xt)>ε)CNεαqj(t)t1+β0. Since Zjt=Xqj(t) off only the null event Hc, the same convergence holds with Zjt. On the other hand, ZjtYt pointwise, so [F6] applied to 1{d(Zjt,Yt)>ε} makes the corresponding probabilities tend to zero. The triangle inequality now gives P(d(Xt,Yt)>2ε)P(d(Xt,Zjt)>ε)+P(d(Zjt,Yt)>ε)0. The left side is independent of j, hence is zero; intersecting over ε=1/r gives Xt=Yt almost surely. Thus [F7] makes Y a modification of X, and step 6.2 supplies all promised path regularity. The constants (CT) were supplied as data, and every other construction was canonical or countably intersected, so no choice axiom is used.

step 5.1step 6.2F2F6F7

Source notes

Durrett's Theorem 7.1.3, printed pp. 356–358, and Sousi's Theorem 3.19 give the complete dyadic Markov--Borel--Cantelli and chaining argument. The local proof also supplies the complete-target extension, Borel measurability of its pointwise metric limit, and the fixed-time modification argument. Yoshida Section 6.3 gives the same Hölder exponent threshold.

Depends on

Used by

Dependency tree · two levels

84 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