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 be a complete separable metric space and let be an -valued process. Suppose and a family of finite constants are given such that Then has a continuous modification . 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 .
Facts & Assumptions
Given: The metric-space, process, exponent, constant-family, and moment-bound hypotheses in the Statement.
Completeness means every Cauchy sequence converges in ; 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
For a nonnegative random variable and , on an arbitrary probability space. Markov's inequality for random variables
A finite or countable union has measure at most the sum of the member measures. Finite and countable subadditivity of measures
A geometric series of ratio strictly between zero and one converges. For , , and for the series diverges
If the sum of event probabilities is finite, only finitely many events occur almost surely. First Borel-Cantelli lemma for events
Bounded almost-everywhere convergence of measurable indicators implies convergence of their expectations. Dominated convergence
A modification agrees with the original process almost surely at every fixed time; this is weaker than indistinguishability. Process law, modification, and indistinguishability
The rationals are countable, and strictly between two real numbers lies a rational. is countably infinite The rationals embed densely in the reals
The sequence tends to zero. For the sequence is null, and for the sequence diverges to
Proof
Let be the nonnegative dyadic times. Fix an integer and a rational with . For , let be the event that some adjacent level- dyadic pair in has . These are measurable finite unions.
Each of the at most edges in step 1.1 has, by [F2] and the moment hypothesis, probability at most . Hence [F3] gives The exponent is positive, so [F4] makes the sum over finite and [F5] shows that, almost surely, only finitely many occur.
Intersect the probability-one conclusions of step 2.1 over the countable set of integer and rational , and call the resulting measurable event . Countability follows from [F8], and its complement is a countable union of null sets and is null by [F3]. Fix . The eventual edge bound can be enlarged over its finitely many exceptional levels to a finite satisfying for every level- edge in .
If and , compare each point with its level- dyadic floor. Successive binary floors differ by at most one edge of level , so step 3.1 and [F4] bound each tail by ; the two level- floors differ by at most one level- edge. Therefore Equality is trivial. Thus the sample values on the dense dyadic set are locally Hölder.
For , let be the largest level- dyadic not exceeding ; then by [F9]. On , step 4.1 makes Cauchy on any integer compact containing , so [F1] gives a unique limit. Define to be this limit on and on . Equivalently, the measurable maps on and on converge pointwise to .
Each is a Borel random element. Indeed, for a nonempty closed , continuity of and step 5.1 give the formula is also correct in the limiting direction because is closed, while the empty closed set has empty inverse image. Thus inverse images of closed, hence Borel, sets are measurable. No point of was selected: the already given supplies the value on .
Letting dyadic tend to arbitrary in step 4.1 shows on that . Hence every path of on is continuous and is locally -Hölder for every rational . For arbitrary , [F8] supplies one rational strictly between them; on , the -bound implies the -bound after multiplying its constant by . This gives all exponents simultaneously on the single event .
Fix and an integer . The moment hypothesis and [F2] give . Since off only the null event , the same convergence holds with . On the other hand, pointwise, so [F6] applied to makes the corresponding probabilities tend to zero. The triangle inequality now gives The left side is independent of , hence is zero; intersecting over gives almost surely. Thus [F7] makes a modification of , and step 6.2 supplies all promised path regularity. The constants were supplied as data, and every other construction was canonical or countably intersected, so no choice axiom is used.
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
- Complete metric space: every Cauchy sequence converges in the space
- Separability: the existence of an at most countable dense subset
- Markov's inequality for random variables
- Finite and countable subadditivity of measures
- For $|r| < 1$, $\sum_{k \ge 0} r^k = 1/(1-r)$, and for $|r| \ge 1$ the series diverges
- For $|r| < 1$ the sequence $r^k$ is null, and for $|r| > 1$ the sequence $|r|^k$ diverges to $+\infty$
- $\mathbb{Q}$ is countably infinite
- The rationals embed densely in the reals
- First Borel-Cantelli lemma for events
- Process law, modification, and indistinguishability
- Dominated convergence
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
- Rick Durrett, Probability: Theory and Examples, Theorem 7.1.3 (standard reference, not scraped)
- Perla Sousi, Advanced Probability, Theorem 3.19 (standard reference, not scraped)
- Nobuaki Yoshida, Probability Theory, Section 6.3 (standard reference, not scraped)