Alphabeta Math
CorollaryStatement: 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.

The critical Hölder boundary at zero

Statement

Assume the Axiom of Choice. Let B be a standard Brownian motion Brownian motion. Almost surely both of the following hold.

  1. For every exponent 0<α<1/2 and every T>0 the path is α-Hölder on [0,T], that is, locally below the critical exponent.
  2. The path is not one-half Hölder at zero: there is no finite constant C and no δ>0 with BtCt for all 0<t<δ. In fact Bt/t is unbounded as t0.

The second assertion concerns the critical exponent at the single point 0; the first concerns uniform subcritical Hölder bounds on each compact interval.

Facts & Assumptions

Given: AC and a standard Brownian motion B.

[F1]

There is a probability-one event on which, for every T>0 and every 0<γ<1/2, a finite K=K(ω,T,γ) satisfies BtBsKtsγ for all 0s,tT. Brownian paths are locally Holder below one half

[F2]

Almost surely lim supt0Bt2tloglog(1/t)=1 and lim inft0Bt2tloglog(1/t)=1. Brownian law of the iterated logarithm at zero

[F3]

The rationals are dense in R. The rationals embed densely in the reals

[F4]

AC is the ambient assumption of the Brownian interfaces. The Axiom of Choice

Proof

technique · direct
1.1

On the probability-one event of [F1], for every T>0 and every 0<γ<1/2 there is a finite constant K with BtBsKtsγ on [0,T]; since [0,T] contains 0 and the exponents are ordered, this is precisely assertion 1.

F1given
1.2

On the probability-one event of [F2], put r(t)=Bt/2tloglog(1/t) for 0<t<e1. For every ε>0 the limsup and liminf bounds imply 1ε<r(t)<1+ε for all sufficiently small t, and r(t)>1ε occurs at arbitrarily small positive times. Hence lim supt0r(t)=1; in particular r(t)>1/2 at arbitrarily small positive times.

F2
2.1

Fix any finite C0 and δ>0. Since 2loglog(1/t), choose η>0 smaller than δ and e1 such that this factor exceeds 2C whenever 0<t<η. Step 1.2 supplies such a t with r(t)>1/2. Then Bt/t=2loglog(1/t)r(t)>C. As this works for every C and δ, the ratio is unbounded in every right neighborhood of zero and assertion 2 follows. A negative C cannot bound the nonnegative ratio either.

step 1.2
3.1

Intersect the events in steps 1.1 and 1.2 with {B0=0}, also of probability one by the Brownian definition. Both assertions then hold simultaneously; since B0=0, the critical bound written with Bt is precisely the pointwise Hölder bound at zero. The correct exponent comparison is downward: for any 0<α<1/2, choose a rational q with α<q<1/2 using [F3] and an integer Nmax(1,T). A bound with exponent q on [0,N] implies BtBsKNqαtsα on [0,T], since tsqαNqα; the diagonal is immediate. Thus rational exponents above each desired exponent suffice, not exponents below it. In this proof [F1] already supplies the single event for every exponent and horizon, so no further uncountable intersection is made. The normalizer in step 1.2 is used only at positive t<e1. AC is inherited through [F4] and the two Brownian suppliers; the arbitrarily-small-time argument requires no selected sequence of times.

step 1.1step 1.2step 2.1F3F4given

Source notes

The local Hölder supplier gives one full-measure event for all subcritical positive exponents and compact horizons. The zero-time LIL supplier gives arbitrarily small times at which its normalized absolute value exceeds one half. The proof combines these interfaces and gives the explicit downward power comparison.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

23 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