Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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 Brownian p-variation threshold

Example

Assume the Axiom of Choice (hence Countable Choice). The convention for supremal p-variation is fixed here. For a continuous x:[a,b]R and a real p1 put Vp(x;[a,b]):=sup{i<nxti+1xtip}, the supremum running over all partitions of [a,b] in the sense of Partition of [a,b] as a finite strictly increasing list a=t0<t1<<tn=b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions, and declared + when the set of sums is unbounded above. For a standard Brownian motion B Brownian motion, almost surely on every nondegenerate compact interval [a,b][0,): Vp(B;[a,b])<for every p>2,Vp(B;[a,b])=+for every 1p2. The threshold exponent is therefore 2, and the example keeps the supremal two-variation V2 distinct from the dyadic quadratic sums of Brownian quadratic variation on dyadic partitions, which, for each fixed deterministic interval, converge almost surely to ba. This last assertion has its own fixed-interval null set; no simultaneous uncountable family of dyadic convergence claims is asserted. For the proof use the version obtained by keeping B on its one measurable continuity-and-zero-start event and replacing the whole path by zero outside it Brownian motion has a jointly measurable continuous version. The simultaneous variation conclusion transfers to the original process on that same event.

Facts & Assumptions

Given: AC, ACω, a standard Brownian motion B with its all-path continuous jointly measurable version, rationals 1p, 0a<b and the notation Vp above.

[F1]

Almost surely there is one event on which every path is continuous and, for every T>0 and 0<γ<1/2, a finite K=K(ω,T,γ) bounds BtBsKtsγ on [0,T]. Brownian paths are locally Holder below one half Brownian motion has a jointly measurable continuous version

[F2]

For each fixed T>0, the dyadic squared-increment sums on [0,T] converge almost surely to T. Application to a shifted Brownian motion will be justified in step 1.4. Almost surely total variation is infinite on every nondegenerate compact interval. Brownian quadratic variation on dyadic partitions Brownian paths have infinite total variation

[F3]

Almost surely lim suph0Bh/2hloglog(1/h)=1, and the shifted increment process hBt+hBt is again a standard Brownian motion, so the same statement holds for every fixed deterministic t0. Brownian law of the iterated logarithm at zero Brownian motion

[F4]

Every finite-valued nondecreasing function on a compact interval is differentiable with finite derivative at Lebesgue-almost every interior point. The monotone-differentiability interface assumes ACω; no integral representation or continuity of accumulated variation is needed. A monotone function is differentiable almost everywhere by the rising-sun route The Axiom of Countable Choice (ACω)

[F5]

Fubini applies to the indicator of a product-measurable set on [a,b]×Ω, so its ω-section lengths integrate to its product measure. Fubini's theorem for L^1 functions on a sigma-finite product Brownian motion has a jointly measurable continuous version

[F6]

The rationals are dense in R; AC is the ambient assumption of the Brownian interfaces. The rationals embed densely in the reals The Axiom of Choice

Verification

technique · direct
1.1

If x is constant all its variation sums are zero, and if p=q the comparison is equality. Otherwise fix a nonconstant continuous x on [a,b] with finite oscillation M:=max[a,b]xmin[a,b]x, and let 1p<q; for every partition, ixti+1xtiqMqpixti+1xtip, so taking suprema gives Vq(x;[a,b])MqpVp(x;[a,b]); consequently Vp< implies Vq< and Vq= implies Vp=.

F7given
1.2

Suppose that for some continuous x on [a,b] and some 1p<2 one had Vp(x;[a,b])<; then for the dyadic partition with mesh h=(ba)/2n one has k(Δkx)2=kΔkx2pΔkxp(maxkΔkx)2pVp(x;[a,b]), and the maximum increment tends to 0 by uniform continuity of the continuous x on the compact [a,b], so those quadratic sums would tend to 0.

F7given
1.3

Suppose now that a continuous x on [a,b] satisfies V2(x;[a,b])<, and put v(a)=0 and v(t):=V2(x;[a,t]) for a<tb; then v is nondecreasing and finite-valued, and for t<b, h>0 with t+hb one has xt+hxt2v(t+h)v(t) by adding the single point t+h to partitions of [a,t] and taking suprema.

F7given
1.4

For each fixed deterministic t0 the process Yh=Bt+hBt, h0, starts at zero and has continuous paths. Its increments on disjoint h-intervals are increments of B on disjoint time-translated intervals, so they have the independent centered normal laws with the required lengths. Thus Y is standard Brownian motion. Applying [F2] to Y with t=a and T=ba identifies its dyadic sums term by term with those on [a,b] and proves their almost-sure limit ba for each fixed interval. Applying [F3] to Y at each fixed t gives lim suph0Bt+hBt2/h= almost surely: along a sequence where the LIL ratio is at least 1/2, that quotient is at least 12loglog(1/h).

F2F3given
2.1

Let p>2 be rational and choose a rational γ with 1/p<γ<1/2; by [F1] there is, on a probability-one event, a finite K with BtBsKtsγ on [0,b]; then for every partition of [a,b], iBti+1BtipKpi(ti+1ti)γpKp(ba)γp because γp>1 and ihiγp(ihi)γp; hence Vp(B;[a,b])Kp(ba)γp< almost surely.

step 1.1F1
2.2

But by step 1.4 the dyadic quadratic sums of the Brownian path converge to ba>0 almost surely, so the hypothesis of [step 1.2] fails for B on every rational interval [a,b] and rational p[1,2) almost surely; intersecting countably many events and using [step 1.1] to pass to every real p[1,2) gives Vp(B;[a,b])= almost surely for every p[1,2) and every nondegenerate compact interval.

step 1.1step 1.2step 1.4F2
2.3

By [F4] the function v is differentiable at Lebesgue-almost every t(a,b) with finite derivative, so at those t one has lim suph0xt+hxt2/hv(t)<.

step 1.3F4
2.4

Let N:={t[a,b]:lim suph0,hQBt+hBt2/h<}; the set is product measurable: for each rational h>0 the map (t,ω)(t+h,ω) is product measurable, so joint measurability of B makes each difference quotient measurable, and the limsup is the infimum over positive integers n of the countable suprema over rational 0<h<1/n. Its indicator is integrable since the product space has total measure ba. For every fixed deterministic t[a,b) the shifted process hBt+hBt is again a standard Brownian motion by [F3], so the divergence recorded in [step 1.4] holds for that t: along a sequence hk0 the squared difference quotient is unbounded. Since the path hBt+h is continuous, the function hBt+hBt2/h is finite-valued and continuous on (0,), so for every δ>0 its supremum over the dense subset Q(0,δ) equals its supremum over all of (0,δ), the limsup along rational h0 coincides with the limsup along real h0, and the latter is + almost surely; hence P(tN)=0 for every t[a,b) and not merely for the rational ones. Therefore [F5] gives Eλ(N)=abP(tN)dt=0 and hence λ(N)=0 almost surely.

F3step 1.4F5
3.1

Intersecting the events of [step 2.1] over the countably many rational p>2 and rational pairs a<b, and using [step 1.1] to pass from a rational p to every real q>2 with pq, we obtain: almost surely Vq(B;[a,b])< for every q>2 and every compact interval with rational endpoints, hence by containment for every nondegenerate compact interval.

step 1.1step 2.1F6
3.2

First intersect the events from step 2.4 over all rational 0a<b. On the resulting probability-one event the set of t at which [step 2.3] would hold has measure zero, so a continuous path with V2(x;[a,b])< cannot be a Brownian path: almost surely V2(B;[a,b])= for every rational interval and hence every nondegenerate compact interval in [0,): it contains a nondegenerate rational subinterval, and any partition of the latter extends to a partition of the former by adjoining the two outer endpoints; all extra terms are nonnegative.

step 2.3step 2.4F6F7
4.1

Combining [step 3.1], [step 2.2] and [step 3.2] on the intersection of the countably many probability-one events, almost surely Vp(B;[a,b])< for all p>2 and Vp(B;[a,b])= for all 1p2, simultaneously on every nondegenerate compact interval; the exponent p=1 case is the infinite total variation of the path, and the value p=2 is handled by the accumulated-variation argument rather than by the dyadic sums, which are finite.

step 3.1step 2.2step 3.2F2
5.1

The boundary cases are covered: p1 is required by the statement, so no fractional exponents below one occur; the interval is nondegenerate and compact, and rational endpoints suffice by [F6]; the two-variation V2 is a supremum over all partitions and is deliberately distinguished from the dyadic quadratic sums, which converge almost surely to ba for each fixed interval by step 1.4; the monotonicity of [step 1.1] transfers between exponents using the finite oscillation of a continuous function on a compact interval; ACω is declared exactly at the monotone-differentiability interface [F4], and AC is the ambient assumption of [F6].

step 1.1step 4.1F2F4F6given

Source notes

Lawler, Section 2.8, computes the finite dyadic quadratic variation and infinite total variation of Brownian paths; the p-variation threshold for p2 follows by interpolating between the total variation (p=1), the supremal two-variation (p=2) and the subcritical Hölder regularity (p>2). Durrett's law of the iterated logarithm at zero, transported along the shifted increments, is what rules out finite supremal two-variation, by Fubini at every fixed real time, contradicting the finite derivative of accumulated variation at almost every time. Rational times alone would not yield that contradiction.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

88 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