Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Brownian paths are nowhere locally one-half Hölder

Statement

Assume the Axiom of Choice. Let B be a standard Brownian motion Brownian motion. Almost surely there is no nondegenerate interval I⊆[0,∞) and no finite constant C such that ∣Bt−Bs∣≤C∣t−s∣1/2for every s,t∈I. The assertion concerns intervals only: no claim is made here about the exceptional times at which a deterministic pointwise one-half Hölder bound might hold, and no uniform modulus theorem is asserted.

Facts & Assumptions

Given: AC and a standard Brownian motion B on nonnegative times.

[F1]

For every finite list 0=t0<t1<⋯<tn the increments Btj−Btj−1 are mutually independent with laws N(0,tj−tj−1). Brownian motion

[F2]

N(0,h) is by definition the law of h Z for Z∼N(0,1), and Z has the strictly positive density φ(x)=e−x2/2/2π of total mass one; hence pC:=P(∣Z∣≤C)<1 for every finite real C. Standard normal and normal laws The standard normal density has total mass one

[F3]

The rationals are dense in R: every nondegenerate interval contains a nondegenerate interval with rational endpoints. The rationals embed densely in the reals

[F4]

AC is the ambient assumption of the Brownian and normal-law interfaces. The Axiom of Choice

[F5]

Countable unions of measurable null events are null by countable subadditivity. Basic identities for a probability measure

Proof

technique · direct
1.1givenF1

Fix rationals 0≤a<b and an integer C≥1, and put Ea,b,C:=⋂r,q∈Q∩[a,b]{∣Br−Bq∣≤C∣r−q∣1/2}. This is measurable because it is a countable intersection of coordinate events. For every integer n≥1, with h=(b−a)/n and grid points tk=a+kh (all rational), the event Ea,b,C is contained in An:={ω: ∣Btk(ω)−Btk−1(ω)∣≤Ch for k=1,…,n}, because consecutive grid points are rational pairs in [a,b] at distance h.

2.1F1F2step 1.1

Insert the endpoint 0 before a when a>0; [F1] then applies to the increasing grid starting at zero, and its subfamily of increments on [a,b] is independent. By [F1] and [F2] the increments Btk−Btk−1, k=1,…,n, are independent with the law of h Z, so each satisfies P(∣Btk−Btk−1∣≤Ch)=P(∣Z∣≤C)=pC<1, and independence gives P(An)=pC n; hence P(Ea,b,C)≤pC n for every n≥1 and therefore P(Ea,b,C)=0. For completeness, the standard normal probability of [C+1,C+2] is at least e−(C+2)2/2/2π>0, proving p_C<1 for the positive integers C used here.

3.1step 2.1F4F5

The family of ordered pairs of rationals and of integers is countable, so [step 2.1], countable subadditivity [F5] and [F4] give P(⋃0≤a<b, a,b∈Q⋃C≥1Ea,b,C)=0.

4.1step 3.1F3

On the complement of that null event there is no nondegenerate interval I with a finite one-half Hölder constant: if I were such an interval with any finite real constant C, then by [F3] we could choose rationals 0≤a<b with [a,b]⊆I, and with C′:=⌈max⁡(C,1)⌉∈N the bound would in particular hold for all rational s,t∈[a,b], that is, Ea,b,C′ would occur.

5.1step 2.1step 3.1step 4.1F4given∎

The intended cases are covered: the interval is required to be nondegenerate, so the empty and singleton interval cases are excluded; the value n=1 in [step 2.1] is the degenerate single-increment case of the estimate and already gives P(A1)=pC<1; the union over integers C≥1 covers every finite real constant up to rounding up; the estimates in [step 2.1] hold for every positive integer n and imply nullness without requiring the mesh events to be nested; and AC is used only through [F4] via [F1] and [F2].

Source notes

Durrett's remark after Theorem 7.1.6 records that one-half is the critical exponent for uniform interval bounds and that the exceptional set of times at which a pointwise one-half Hölder bound holds is not ruled out by this theorem. Yoshida proves the subcritical uniform statement in Section 6.3 and the nowhere alpha-Hölder statement for alpha > 1/2 in Section 6.4 of the same notes (Proposition 6.4.1 there); the argument above is instead the direct mesh computation: on a fixed rational interval a one-half Hölder bound forces all n increments of the uniform n-mesh to be of size at most Ch, an event of probability pC n whose intersection over n is null.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

39 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