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 be a standard Brownian motion Brownian motion. Almost surely, the path has no finite two-sided derivative at any , and no finite right derivative at . 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 , and an integer together with rationals .
The increments of over disjoint time intervals are independent with laws for interval length , and one probability-one event carries all continuous paths. Brownian motion
If a real function has a finite two-sided derivative at an interior point , or a finite right derivative at a left endpoint, or a finite left derivative at a right endpoint, then with in The derivative of at a point that is a limit point of , 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 such that for the relevant with , where is the corresponding derivative; in particular there.
has the strictly positive density ; consequently for every . Standard normal and normal laws The standard normal density has total mass one
If events satisfy , then almost surely only finitely many occur, that is, . First Borel-Cantelli lemma for events
The rationals are dense in : every point of lies in a nondegenerate interval with rational endpoints. The rationals embed densely in the reals
AC is the ambient assumption of the Brownian and normal-law interfaces. The Axiom of Choice
Countable unions of measurable null events are null. Basic identities for a probability measure
Proof
Suppose the continuous path has a finite two-sided derivative at some , or a finite right derivative at , or a finite left derivative at , with absolute value at most ; use both sides for an interior point, the right side at a and the left side at b, applying [F2] to obtain such that for every on the permitted side or sides of with .
Fix with , write and , and put . Then , including when . If take the block of five increments beginning at , and otherwise take the block of five increments ending at . In either case all endpoints lie in , on the side of allowed in step 1.1 for the endpoint cases, and within distance of , so each increment has absolute value at most with .
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 to be the event that some block of five consecutive increments (, ) has all five absolute values at most , where . 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 by [F1], so by [F3] and independence the probability for a fixed block is at most , where for large . Hence , and : the finitely many remaining initial terms are at most one each, and bounds the tail by a geometric series.
By [F4] and step 3.1, almost surely fails for all sufficiently large ; by step 2.1 this means that almost surely the path has no finite derivative with absolute value at most at any point of (two-sided on , right at , left at ).
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 and over integers , and using [F5] to place every in the interior of such an interval (while is the left endpoint of one), we obtain: almost surely no time has a finite two-sided derivative (for ) or finite right derivative (for ).
The boundary cases are covered by the block choices of step 2.1: uses the right-handed block beginning at , the left-handed block ending at , and interior times either the forward or the backward block, all of which stay inside ; 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 loses nothing, and the finite-difference ratio of [F2] is the definition-level form of The derivative of at a point that is a limit point of , and differentiability on a set; AC is inherited through [F6] from the Brownian and normal-law interfaces.
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 possible blocks by the summable quantity . 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
- Brownian motion
- The derivative $f'(c) = \lim_{x \to c} \frac{f(x) - f(c)}{x - c}$ of $f : A \to \mathbb{R}$ at a point $c \in A$ that is a limit point of $A$, and differentiability on a set
- The left and right derivatives of a real function as one-sided limits of its difference quotient
- Standard normal and normal laws
- The standard normal density has total mass one
- First Borel-Cantelli lemma for events
- The rationals embed densely in the reals
- The Axiom of Choice
- Basic identities for a probability measure
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
- Rick Durrett, Probability: Theory and Examples, fifth edition, Theorem 7.1.6 (standard reference, not scraped)
- Perla Sousi, Advanced Probability, Theorem 6.41 (standard reference, not scraped)