Alphabeta Math
Pipeline-generated
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 Path Properties — Examples

1 · Prerequisites

2 · Summary

These examples accompany brownian-path-properties. The mean and variance of the dyadic quadratic sums are computed directly Expected dyadic quadratic variation Variance of dyadic quadratic variation, and the two faces of the zero set are contrasted in A null uncountable random closed set.

The p-variation threshold The Brownian p-variation threshold fixes the convention for supremal p-variation and shows that the threshold exponent is two, distinguishing the supremal two-variation from the dyadic quadratic sums; the law of the iterated logarithm is then used to rule out a global square-root-time bound near the origin LIL rules out a square-root-time bound.

The counterexamples locate the boundaries of the main page: continuity alone does not give finite quadratic variation along a prescribed refining sequence Continuity does not imply finite quadratic variation, finite dyadic quadratic variation does not give finite total variation Finite quadratic variation does not imply finite total variation, and fixed-time nondifferentiability statements cannot be upgraded to a pathwise nowhere-differentiability statement Fixed-time assertions do not yield a pathwise nowhere statement.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Expected dyadic quadratic variation

Example

Let B be a standard Brownian motion, fix T>0 and for n1 let πn be the dyadic partition of [0,T] with points kT/2n. Then the expected quadratic sum over the 2n equal subintervals is exactly the elapsed time, Ek=12n(BkT/2nB(k1)T/2n)2=T, for every n1; no independence is needed for this mean computation.

Facts & Assumptions

Given: AC, a standard Brownian motion B, T>0 and n1 with h=T/2n and Δk=BkhB(k1)h.

[F1]

The terminal dyadic quadratic sum in this example is the finite sum k=12nΔk2.

[F2]

Each increment over an interval of length h has law N(0,h) and E(ΔB)2=h. Brownian motion Gaussian even moments for Brownian increments

[F3]

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

Verification

technique · direct
1.1

For each k the increment Δk has the law N(0,h) by [F2], so EΔk2=h.

givenF2
2.1

By [F1] the terminal dyadic sum is k=12nΔk2, and linearity of expectation with [step 1.1] gives EkΔk2=kh=2nT/2n=T.

step 1.1F1
3.1

The cases are covered: T>0 and n1 give h>0 and 2n summands, including the degenerate case n=1; the mean computation uses only the marginal law of each increment, not independence or any joint distribution; and AC enters only through [F3].

step 2.1F3given

Source notes

Lawler, Section 2.8, computes the mean of the squared-increment sums as the total elapsed time. The example isolates the mean computation, which uses only the variance of the increments.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Variance of dyadic quadratic variation

Example

With the notation of Expected dyadic quadratic variation, the dyadic quadratic sum Qn=k=12n(BkhB(k1)h)2 over [0,T] has Var(Qn)=2T22n, so QnT in L2 as n.

Facts & Assumptions

Given: AC, a standard Brownian motion B, T>0, n1 with h=T/2n and Δk=BkhB(k1)h.

[F1]

The increments over disjoint intervals are independent with laws N(0,h), and E(ΔB)2=h, E(ΔB)4=3h2 for an increment of length h. Brownian motion Gaussian even moments for Brownian increments

[F2]

The mean of the dyadic sum is EQn=T. Expected dyadic quadratic variation

[F3]

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

Verification

technique · direct
1.1

For each k, [F1] gives Var(Δk2)=EΔk4(EΔk2)2=3h2h2=2h2.

givenF1
2.1

The variables Δk2 are functions of increments over disjoint intervals, hence independent by [F1], so the variance of the sum is the sum of the variances: Var(Qn)=k=12n2h2=2n2(T/2n)2=2T2/2n.

step 1.1F1
3.1

Since EQn=T by [F2], E(QnT)2=Var(Qn)=2T2/2n0, which is the L2 convergence QnT.

step 2.1F2
4.1

The cases are covered: the independence of the squared increments is the only place where the joint law is used; the value n=1 is included and gives Var(Q1)=T2; the limit is taken as n with T fixed and positive; and AC enters only through [F3].

step 2.1F3given

Source notes

Lawler, Theorem 2.8.1, obtains the variance of the quadratic sums from the fourth Gaussian moment and the independence of the increments, giving the mean-square convergence used in the dyadic quadratic-variation theorem.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-22Open item page →

A null uncountable random closed set

Example

Almost surely, for every T>0 the Brownian zero set Z intersected with [0,T] is a closed, uncountable set of Lebesgue measure zero. Thus the zero set of a Brownian path is a natural random set that is large in the cardinality sense and simultaneously null for Lebesgue measure; the two notions of size are independent.

Facts & Assumptions

Given: AC and a standard Brownian motion B with zero set Z.

[F1]

For each fixed T<, almost surely λ(Z[0,T])=0. The Brownian zero set has Lebesgue measure zero

[F2]

Almost surely Z[0,T] is uncountable for every T>0. The Brownian zero set is uncountable

[F3]

Z is a closed subset of [0,) containing 0, so Z[0,T] is compact for every T>0. The Brownian zero set

[F4]

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

Verification

technique · direct
1.1

Intersecting the probability-one events supplied by [F1] for the positive integer horizons with the single probability-one event of [F2] gives a probability-one event on which nullity holds at every positive integer horizon and uncountability holds at every positive horizon. For arbitrary T>0, choose an integer NT; then λ(Z[0,T])λ(Z[0,N])=0, while uncountability of Z[0,T] follows directly from [F2].

F1F2
2.1

On that event the set Z[0,T] is closed by [F3] and compact, uncountable by [step 1.1], and null by [step 1.1]; the two properties are not in tension because uncountability imposes no lower bound on Lebesgue measure, as the Cantor set shows in the deterministic setting.

step 1.1F3
3.1

The cases are covered: the horizon is positive and finite; simultaneous nullity for all horizons is obtained from the countable integer exhaustion, whereas simultaneous uncountability for all positive horizons is exactly [F2]; the point 0 belongs to Z and to every truncated set but is a singleton of measure zero; and AC enters only through [F4].

step 2.1F4given

Source notes

Sousi, Theorem 6.39, proves that the zero set is closed with no isolated points, hence uncountable, and Durrett's Section 7.4.1 computes its Lebesgue measure as zero. The example collects both facts and contrasts them.

ExampleConstruction: AI-adaptedVerification: AI-adaptedaudited 2026-09-22Open item page →

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.

ExampleConstruction: AI-adaptedVerification: AI-adaptedaudited 2026-09-22Open item page →

LIL rules out a square-root-time bound

Example

Let B be a standard Brownian motion. Almost surely there is no finite random constant C and no random δ>0 such that BtCtfor all 0<t<δ. Thus the square-root bound that holds in expectation for a single time is false as a pathwise statement near the origin.

Facts & Assumptions

Given: AC and a standard Brownian motion B.

[F1]

Almost surely lim supt0Bt/2tloglog(1/t)=1 and the corresponding limit inferior is 1. Brownian law of the iterated logarithm at zero

[F2]

AC is assumed explicitly in this example. The Axiom of Choice

Verification

technique · direct
1.1

On the probability-one event of [F1], combining the two limit statements gives lim supt0Bt/2tloglog(1/t)=1, so there are tn0 with 2loglog(1/tn)Btn/2tnloglog(1/tn).

givenF1
2.1

For such a sequence Btn/tn=2loglog(1/tn)Btn2tnloglog(1/tn); hence for every finite constant c there exist t(0,δ) with Bt>ct, whatever δ>0 is prescribed, which is exactly the failure of the displayed bound for a finite random C and random δ>0.

step 1.1
3.1

The cases are covered: only t>0 is quantified, so the normalizer loglog(1/t) is defined and positive for small t; the constant C is allowed to be random and finite, and the argument produces, on the given outcome, arbitrarily small times violating any fixed finite value; and AC enters only through [F2].

step 2.1F2given

Source notes

The law of the iterated logarithm at zero does more than fail to provide a one-half modulus: it exhibits a sequence of times along which Bt/t diverges. Durrett's Theorem 8.5.1, transported to zero, is the source of that sequence.

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Continuity does not imply finite quadratic variation

Statement refuted

The assertion "every continuous function x:[0,1]R has finite quadratic variation along every refining sequence of partitions with mesh tending to zero" is false. There is a continuous function x on [0,1] and a refining sequence of partitions (πn) of [0,1] with mesh(πn)0 for which the quadratic sums i(xti+1xti)2 diverge to +.

Counterexample

Given: no special hypotheses; the construction is explicit and uses no choice principle.

1.1

For m1 put Im:=[2(m+1),2m], nm:=2m4, δm:=2(m+2)/m4=2(m+1)/nm, and let sm,j:=2(m+1)+jδm for 0jnm; define x(sm,j):=1/m for odd j and x(sm,j):=0 for even j, interpolate x linearly between consecutive vertices of each block, and set x:=0 on {0}[1/2,1].

given
2.1

The function x is well defined and continuous: on each block it is piecewise linear hence continuous, the last vertex of Im has even index and value 0, matching the value 0 at the shared endpoints of consecutive blocks and on [1/2,1], and for t(0,2m] one has x(t)1/m, so x(t)0=x(0) as t0.

step 1.1
2.2

For n1 let πn be the partition of [0,1] whose point set is the dyadic grid {k2n:0k2n} together with every vertex sm,j with 1mn; each πn is a finite partition 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, the sequence is refining, and mesh(πn)2n.

step 1.1
3.1

No dyadic point of level n lies in the interior of In: such a point would be k2n with 1/2<k<1, and no integer satisfies this; hence the points of πn inside In are exactly the vertices sn,0<<sn,nn, and consecutive points of πn inside that block are consecutive vertices.

step 2.2
4.1

The quadratic sum along πn therefore contains the nn vertex increments of the block In, each of absolute value 1/n, so it is at least nn(1/n)2=2n4/n2=2n2; since 2n2, the quadratic sums along the refining sequence (πn) diverge to + for this continuous function.

step 3.1
5.1

Consequently continuity alone does not force finite quadratic variation along a prescribed refining sequence with vanishing mesh: the witness is the explicit sawtooth function above, whose block In alone contributes 2n2 to the n-th quadratic sum; the example also shows that the mesh condition of Quadratic variation along a partition sequence is not sufficient by itself, and the construction uses no choice principle.

step 2.1step 4.1

Source notes

Lawler, Section 2.8, warns that quadratic sums of a continuous path depend on the partitions chosen unless a specific regular sequence is prescribed. The sawtooth above is the classical witness: it is continuous and of unbounded variation on every neighbourhood of the origin, and the partitions are adapted to its vertices so that each block contributes a fixed amount.

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedaudited 2026-09-22Open item page →

Finite quadratic variation does not imply finite total variation

Statement refuted

The implication "a continuous path with finite quadratic variation along the dyadic meshes of a compact interval has finite total variation on that interval" is false. Brownian motion provides the witness on [0,1]: almost every Brownian path has dyadic quadratic sums converging uniformly to elapsed time there while its total variation on that interval is infinite.

Facts & Assumptions

Given: AC and a standard Brownian motion B.

[F1]

Almost surely, simultaneously: tBt is continuous on [0,1], the dyadic partial quadratic-variation processes of B on [0,1] converge uniformly to t, and the variation sums of B are unbounded above on every nondegenerate compact interval. This follows by intersecting the full-measure continuity event in the Brownian definition with the full-measure event carrying both variation conclusions. Brownian motion Brownian one- and quadratic variation

[F2]

The Brownian one- and quadratic-variation corollary in [F1] is stated under AC and uses it in its supplier and countable-event interfaces; the present counterexample carries that exact hypothesis forward. Brownian one- and quadratic variation The Axiom of Choice

Counterexample

technique · direct
1.1

The probability-one event in [F1] is nonempty; fix an outcome ω in that event, so the same chosen path is continuous and has both stated variation properties.

F1given
2.1

For the path tBt(ω) on [0,1] the dyadic quadratic sums are finite for each mesh and converge uniformly to elapsed time, whereas the supremum of the absolute-increment sums over partitions of [0,1] is +; both assertions refer to the same fixed continuous path.

step 1.1F1
3.1

Hence the refuted implication fails: the witness is continuous on [0,1], has finite quadratic variation there in the stated dyadic sense, and nevertheless is not of bounded variation there. AC is the standing hypothesis required by the Brownian corollary [F1], as recorded in [F2]; after its nonempty probability-one event is supplied, fixing one witness makes no additional choice-family construction.

F1F2step 2.1

Source notes

Lawler, Section 2.8, records the dichotomy between divergence of the absolute-increment sums and convergence of the squared-increment sums for Brownian paths; the counterexample packages the two properties on the fixed horizon [0,1] as the failure of an implication about deterministic continuous paths.

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22Open item page →

Fixed-time assertions do not yield a pathwise nowhere statement

Statement refuted

The inference "if for each fixed time t the path is almost surely not differentiable at t, then almost surely the path is nowhere differentiable" is invalid. There is a continuous random process X on [0,1] such that for every fixed deterministic t(0,1) the path is almost surely not differentiable at t, while almost surely the path is differentiable somewhere: the almost-sure assertions attached to the individual times of an uncountable family do not combine into the pathwise assertion.

Counterexample

Given: no special hypotheses beyond the standard Borel measure space ([0,1],B([0,1]),λ), the Takagi function T of The Takagi series converges uniformly to a continuous nowhere differentiable function, the profile G(s):=s2T(s) on [0,1], and the process Xt(ω):=G(tω) for t,ω[0,1].

Proof technique: direct.

1.1

The profile is continuous and differentiable at the origin: G(s)=s2T(s) is a product of continuous functions, and with M:=sup[0,1]T<, finite because the continuous T is bounded on the compact interval, one has G(s)Ms2 for every s[0,1], so G(s)/s0 and G(0)=0.

given
2.1

The profile is nowhere else differentiable: if G were differentiable at some s(0,1], then T=G/s2 would be differentiable at s as a quotient with nonvanishing denominator, contradicting the nowhere differentiability of the Takagi function on [0,1].

givenstep 1.1
2.2

Every sample path tXt(ω)=G(tω) is continuous, being a composition of the continuous maps ttω and G; for the same reason the map (t,ω)Xt(ω) is jointly measurable.

step 1.1
2.3

At t=ω the path is differentiable with derivative 0: for h0 the difference quotient is (G(h)G(0))/h=±G(h)/h, whose limit as h0 is ±G(0)=0 by [step 1.1].

step 1.1
3.1

At every t(0,1) with tω the path is not differentiable at t: on a neighbourhood of such a t that lies inside (0,1) the path is the composition of the affine map u±(uω) of nonzero slope with the restriction of G, so differentiability of the path at t would make G=XA1 differentiable at tω, which lies in (0,1) because t(0,1) and ω[0,1], and [step 2.1] excludes exactly that.

step 2.1
4.1

For a fixed deterministic t(0,1) the path is differentiable at t exactly when ω=t, by [step 2.3] and [step 3.1]; since the singleton {t} is Lebesgue-null, the path is almost surely not differentiable at t, and this holds for every t of the uncountable family (0,1).

step 2.3step 3.1
5.1

Yet almost surely the path is differentiable somewhere, namely at t=ω(0,1), by [step 2.3]; hence the pathwise event "the path is nowhere differentiable on (0,1)" has probability 0. The fixed-time assertions of [step 4.1] therefore do not upgrade to the pathwise statement: the quantifier over the uncountable family of times cannot be moved inside the almost-sure statement, which is the defect being exhibited.

step 2.3step 4.1
6.1

The boundary and degenerate cases are covered: the fixed-time family is the open interval (0,1), so that at each of its times the two-sided notion of differentiability applies and the endpoint behaviour of the profile is never needed; the case t=ω is the differentiability point of the path and contributes the null singleton to the fixed-time computation of [step 4.1]; the outcomes ω{0,1} form a null edge case and are not needed, since [step 5.1] only requires the event of positive probability on which the path is differentiable at an interior time; the profile is not constant, so the degenerate case in which every time were a differentiability point does not arise; and the construction selects nothing, the measure space and the profile being explicit.

step 2.3step 3.1step 4.1step 5.1given

Source notes

Durrett's discussion around Theorem 7.1.6 contrasts fixed-time statements with the pathwise nowhere-differentiability theorem for Brownian motion, and shows that the per-time almost-sure statement is not by itself a pathwise theorem. The witness above makes that quantifier failure explicit: the profile G(s)=s2T(s) built from the Takagi function of The Takagi series converges uniformly to a continuous nowhere differentiable function has exactly one differentiability point, the origin, and shifting it by the uniform random variable ω produces a process that is almost surely non-differentiable at each fixed deterministic time interior to (0,1), while every one of its sample paths is differentiable at its own shift. The Takagi input is used only through the statement of that item.

Sources