Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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 differentiable

Statement

Assume the Axiom of Choice. Let B be a standard Brownian motion Brownian motion. Almost surely, the path tBt(ω) has no finite two-sided derivative at any t>0, and no finite right derivative B+(0) at t=0. The assertion is uniform over the possible times: it is not the statement that the path fails to be differentiable at any single prescribed time.

Facts & Assumptions

Given: AC, a standard Brownian motion B, and an integer C1 together with rationals 0a<b.

[F1]

The increments of B over disjoint time intervals are independent with laws N(0,h) for interval length h, and one probability-one event carries all continuous paths. Brownian motion

[F2]

If a real function f has a finite two-sided derivative f(s) at an interior point s, or a finite right derivative f+(s) at a left endpoint, or a finite left derivative f(s) at a right endpoint, then with ε=1 in The derivative f(c)=limxcf(x)f(c)xc of f:AR at a point cA that is a limit point of A, and differentiability on a set and The left and right derivatives of a real function as one-sided limits of its difference quotient there is δ>0 such that f(t)f(s)L(ts)ts for the relevant t with 0<ts<δ, where L is the corresponding derivative; in particular f(t)f(s)(L+1)ts there.

[F3]

ZN(0,1) has the strictly positive density φ(x)=ex2/2/2π; consequently P(Zy)y for every 0<y1. Standard normal and normal laws The standard normal density has total mass one

[F4]

If events Gn satisfy nP(Gn)<, then almost surely only finitely many Gn occur, that is, P(lim supnGn)=0. First Borel-Cantelli lemma for events

[F5]

The rationals are dense in R: every point of [0,) lies in a nondegenerate interval with rational endpoints. The rationals embed densely in the reals

[F6]

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

[F7]

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

Proof

technique · direct
1.1

Suppose the continuous path f:=B(ω) has a finite two-sided derivative at some s(a,b), or a finite right derivative at s=a, or a finite left derivative at s=b, with absolute value at most C; use both sides for an interior point, the right side at a and the left side at b, applying [F2] to obtain δ>0 such that f(t)f(s)(C+1)ts for every t[a,b] on the permitted side or sides of s with 0<ts<δ.

givenF2
2.1

Fix n6 with (ba)/n<δ/6, write h:=(ba)/n and tk:=a+kh, and put k0:=max{k{0,,n1}:tks}. Then tk0stk0+1, including k0=n1 when s=b. If k0+5n take the block of five increments beginning at tk0, and otherwise take the block of five increments ending at tn. In either case all endpoints lie in [a,b], on the side of s allowed in step 1.1 for the endpoint cases, and within distance 6h<δ of s, so each increment has absolute value at most 2(C+1)6h=12(C+1)h=:D/n with D:=12(C+1)(ba).

step 1.1given
3.1

For n=0,1,2,3,4,5 set G_n to be the empty event, without defining h or a mesh for those indices. For integers n>=6 define Gn to be the event that some block of five consecutive increments Btk+iBtk+i1 (k=0,,n5, i=1,,5) has all five absolute values at most D/n, where h=(ba)/n. Every G_n is a finite union of finite intersections of measurable coordinate events. Insert 0 before a if a>0 and use the subfamily of grid increments in [a,b]; the increments of one block are independent with laws N(0,h) by [F1], so by [F3] and independence the probability for a fixed block is at most yn5, where yn:=D/(ba)n=12(C+1)(ba)/n1 for large n. Hence P(Gn)nyn5=125(C+1)5(ba)5/2n3/2, and nP(Gn)<: the finitely many remaining initial terms are at most one each, and n=2j2j+11n3/22j/2 bounds the tail by a geometric series.

givenF1F3step 2.1
4.1

By [F4] and step 3.1, almost surely Gn fails for all sufficiently large n; by step 2.1 this means that almost surely the path has no finite derivative with absolute value at most C at any point of [a,b] (two-sided on (a,b), right at a, left at b).

step 2.1step 3.1F4
5.1

Intersect the common continuity event from [F1] with the complements of all the measurable limsup events of [F4]. Taking the union of those null events over the countably many rational pairs 0a<b and over integers C1, and using [F5] to place every s>0 in the interior of such an interval (while s=0 is the left endpoint of one), we obtain: almost surely no time s0 has a finite two-sided derivative (for s>0) or finite right derivative (for s=0).

step 4.1F1F4F5F7
6.1

The boundary cases are covered by the block choices of step 2.1: s=0 uses the right-handed block beginning at a, s=b the left-handed block ending at b, and interior times either the forward or the backward block, all of which stay inside [a,b]; the cases n<6 are defined to be empty events in step 3.1, so the sequence is indexed by all natural numbers and no division by zero is performed; rounding the derivative bound up to an integer C loses nothing, and the finite-difference ratio of [F2] is the definition-level form of The derivative f(c)=limxcf(x)f(c)xc of f:AR at a point cA that is a limit point of A, and differentiability on a set; AC is inherited through [F6] from the Brownian and normal-law interfaces.

step 2.1step 4.1F2F6given

Source notes

This is the Dvoretsky-Erdős-Kakutani mesh argument as in Durrett, Theorem 7.1.6 and its proof: differentiability at a single time forces five consecutive increments of every sufficiently fine uniform mesh to be small. The calculation above bounds the union over the O(n) possible blocks by the summable quantity 125(C+1)5(ba)5/2n3/2. A fixed-time argument would only produce an uncountable intersection of null events; the mesh argument converts this into one countable Borel-Cantelli statement.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

52 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