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
- Absolute and Conditional Convergence; Rearrangement; Products
- Absolute Continuity and the Sharp Fundamental Theorem of Calculus
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Approximation and Compactness in C(K)
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Brownian Motion Construction and Continuity
- Brownian Motion, Markov Properties and Hitting Times
- Brownian Path Properties
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Differentiation of Monotone Functions and the Vitali Covering Theorem
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
- Weak Laws and Series of Independent Random Variables
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 -variation threshold The Brownian p-variation threshold fixes the convention for supremal -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
Expected dyadic quadratic variation
Example
Let be a standard Brownian motion, fix and for let be the dyadic partition of with points . Then the expected quadratic sum over the equal subintervals is exactly the elapsed time, for every ; no independence is needed for this mean computation.
Facts & Assumptions
Given: AC, a standard Brownian motion , and with and .
The terminal dyadic quadratic sum in this example is the finite sum .
Each increment over an interval of length has law and . Brownian motion Gaussian even moments for Brownian increments
AC is the ambient assumption of the Brownian interfaces. The Axiom of Choice
Verification
For each the increment has the law by [F2], so .
By [F1] the terminal dyadic sum is , and linearity of expectation with [step 1.1] gives .
The cases are covered: and give and summands, including the degenerate case ; the mean computation uses only the marginal law of each increment, not independence or any joint distribution; and AC enters only through [F3].
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.
Variance of dyadic quadratic variation
Example
With the notation of Expected dyadic quadratic variation, the dyadic quadratic sum over has so in as .
Facts & Assumptions
Given: AC, a standard Brownian motion , , with and .
The increments over disjoint intervals are independent with laws , and , for an increment of length . Brownian motion Gaussian even moments for Brownian increments
The mean of the dyadic sum is . Expected dyadic quadratic variation
AC is the ambient assumption of the Brownian interfaces. The Axiom of Choice
Verification
For each , [F1] gives .
The variables are functions of increments over disjoint intervals, hence independent by [F1], so the variance of the sum is the sum of the variances: .
Since by [F2], , which is the convergence .
The cases are covered: the independence of the squared increments is the only place where the joint law is used; the value is included and gives ; the limit is taken as with fixed and positive; and AC enters only through [F3].
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.
A null uncountable random closed set
Example
Almost surely, for every the Brownian zero set intersected with 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 with zero set .
For each fixed , almost surely . The Brownian zero set has Lebesgue measure zero
Almost surely is uncountable for every . The Brownian zero set is uncountable
is a closed subset of containing , so is compact for every . The Brownian zero set
AC is the ambient assumption of the Brownian interfaces. The Axiom of Choice
Verification
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 , choose an integer ; then , while uncountability of follows directly from [F2].
On that event the set 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.
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 belongs to and to every truncated set but is a singleton of measure zero; and AC enters only through [F4].
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.
The Brownian p-variation threshold
Example
Assume the Axiom of Choice (hence Countable Choice). The convention for supremal -variation is fixed here. For a continuous and a real put the supremum running over all partitions of in the sense of Partition of as a finite strictly increasing list , 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 Brownian motion, almost surely on every nondegenerate compact interval : The threshold exponent is therefore , and the example keeps the supremal two-variation distinct from the dyadic quadratic sums of Brownian quadratic variation on dyadic partitions, which, for each fixed deterministic interval, converge almost surely to . 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 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 with its all-path continuous jointly measurable version, rationals , and the notation above.
Almost surely there is one event on which every path is continuous and, for every and , a finite bounds on . Brownian paths are locally Holder below one half Brownian motion has a jointly measurable continuous version
For each fixed , the dyadic squared-increment sums on converge almost surely to . 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
Almost surely , and the shifted increment process is again a standard Brownian motion, so the same statement holds for every fixed deterministic . Brownian law of the iterated logarithm at zero Brownian motion
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 ()
Fubini applies to the indicator of a product-measurable set on , 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
A continuous real function on a compact interval is uniformly continuous. Partitions are finite increasing endpoint lists. Heine-Cantor in : a continuous real function on a compact subset of is uniformly continuous, proved -natively from sequential compactness Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions
The rationals are dense in ; AC is the ambient assumption of the Brownian interfaces. The rationals embed densely in the reals The Axiom of Choice
Verification
If is constant all its variation sums are zero, and if the comparison is equality. Otherwise fix a nonconstant continuous on with finite oscillation , and let ; for every partition, , so taking suprema gives ; consequently implies and implies .
Suppose that for some continuous on and some one had ; then for the dyadic partition with mesh one has , and the maximum increment tends to by uniform continuity of the continuous on the compact , so those quadratic sums would tend to .
Suppose now that a continuous on satisfies , and put and for ; then is nondecreasing and finite-valued, and for , with one has by adding the single point to partitions of and taking suprema.
For each fixed deterministic the process , , starts at zero and has continuous paths. Its increments on disjoint -intervals are increments of on disjoint time-translated intervals, so they have the independent centered normal laws with the required lengths. Thus is standard Brownian motion. Applying [F2] to with and identifies its dyadic sums term by term with those on and proves their almost-sure limit for each fixed interval. Applying [F3] to at each fixed gives almost surely: along a sequence where the LIL ratio is at least , that quotient is at least .
Let be rational and choose a rational with ; by [F1] there is, on a probability-one event, a finite with on ; then for every partition of , because and ; hence almost surely.
But by step 1.4 the dyadic quadratic sums of the Brownian path converge to almost surely, so the hypothesis of [step 1.2] fails for on every rational interval and rational almost surely; intersecting countably many events and using [step 1.1] to pass to every real gives almost surely for every and every nondegenerate compact interval.
By [F4] the function is differentiable at Lebesgue-almost every with finite derivative, so at those one has .
Let ; the set is product measurable: for each rational the map is product measurable, so joint measurability of makes each difference quotient measurable, and the limsup is the infimum over positive integers of the countable suprema over rational . Its indicator is integrable since the product space has total measure . For every fixed deterministic the shifted process is again a standard Brownian motion by [F3], so the divergence recorded in [step 1.4] holds for that : along a sequence the squared difference quotient is unbounded. Since the path is continuous, the function is finite-valued and continuous on , so for every its supremum over the dense subset equals its supremum over all of , the limsup along rational coincides with the limsup along real , and the latter is almost surely; hence for every and not merely for the rational ones. Therefore [F5] gives and hence almost surely.
Intersecting the events of [step 2.1] over the countably many rational and rational pairs , and using [step 1.1] to pass from a rational to every real with , we obtain: almost surely for every and every compact interval with rational endpoints, hence by containment for every nondegenerate compact interval.
First intersect the events from step 2.4 over all rational . On the resulting probability-one event the set of at which [step 2.3] would hold has measure zero, so a continuous path with cannot be a Brownian path: almost surely for every rational interval and hence every nondegenerate compact interval in : 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.
Combining [step 3.1], [step 2.2] and [step 3.2] on the intersection of the countably many probability-one events, almost surely for all and for all , simultaneously on every nondegenerate compact interval; the exponent case is the infinite total variation of the path, and the value is handled by the accumulated-variation argument rather than by the dyadic sums, which are finite.
The boundary cases are covered: 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 is a supremum over all partitions and is deliberately distinguished from the dyadic quadratic sums, which converge almost surely to 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].
Source notes
Lawler, Section 2.8, computes the finite dyadic quadratic variation and infinite total variation of Brownian paths; the -variation threshold for follows by interpolating between the total variation (), the supremal two-variation () and the subcritical Hölder regularity (). 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.
LIL rules out a square-root-time bound
Example
Let be a standard Brownian motion. Almost surely there is no finite random constant and no random such that 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 .
Almost surely and the corresponding limit inferior is . Brownian law of the iterated logarithm at zero
AC is assumed explicitly in this example. The Axiom of Choice
Verification
On the probability-one event of [F1], combining the two limit statements gives , so there are with .
For such a sequence ; hence for every finite constant there exist with , whatever is prescribed, which is exactly the failure of the displayed bound for a finite random and random .
The cases are covered: only is quantified, so the normalizer is defined and positive for small ; the constant 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].
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 diverges. Durrett's Theorem 8.5.1, transported to zero, is the source of that sequence.
Continuity does not imply finite quadratic variation
Statement refuted
The assertion "every continuous function has finite quadratic variation along every refining sequence of partitions with mesh tending to zero" is false. There is a continuous function on and a refining sequence of partitions of with for which the quadratic sums diverge to .
Counterexample
Given: no special hypotheses; the construction is explicit and uses no choice principle.
For put , , , and let for ; define for odd and for even , interpolate linearly between consecutive vertices of each block, and set on .
The function is well defined and continuous: on each block it is piecewise linear hence continuous, the last vertex of has even index and value , matching the value at the shared endpoints of consecutive blocks and on , and for one has , so as .
For let be the partition of whose point set is the dyadic grid together with every vertex with ; each is a finite partition in the sense of Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions, the sequence is refining, and .
No dyadic point of level lies in the interior of : such a point would be with , and no integer satisfies this; hence the points of inside are exactly the vertices , and consecutive points of inside that block are consecutive vertices.
The quadratic sum along therefore contains the vertex increments of the block , each of absolute value , so it is at least ; since , the quadratic sums along the refining sequence diverge to for this continuous function.
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 alone contributes to the -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.
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.
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 : 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 .
Almost surely, simultaneously: is continuous on , the dyadic partial quadratic-variation processes of on converge uniformly to , and the variation sums of 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
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
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.
For the path on 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 is ; both assertions refer to the same fixed continuous path.
Hence the refuted implication fails: the witness is continuous on , 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.
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 as the failure of an implication about deterministic continuous paths.
Fixed-time assertions do not yield a pathwise nowhere statement
Statement refuted
The inference "if for each fixed time the path is almost surely not differentiable at , then almost surely the path is nowhere differentiable" is invalid. There is a continuous random process on such that for every fixed deterministic the path is almost surely not differentiable at , 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 , the Takagi function of The Takagi series converges uniformly to a continuous nowhere differentiable function, the profile on , and the process for .
Proof technique: direct.
The profile is continuous and differentiable at the origin: is a product of continuous functions, and with , finite because the continuous is bounded on the compact interval, one has for every , so and .
The profile is nowhere else differentiable: if were differentiable at some , then would be differentiable at as a quotient with nonvanishing denominator, contradicting the nowhere differentiability of the Takagi function on .
Every sample path is continuous, being a composition of the continuous maps and ; for the same reason the map is jointly measurable.
At the path is differentiable with derivative : for the difference quotient is , whose limit as is by [step 1.1].
At every with the path is not differentiable at : on a neighbourhood of such a that lies inside the path is the composition of the affine map of nonzero slope with the restriction of , so differentiability of the path at would make differentiable at , which lies in because and , and [step 2.1] excludes exactly that.
For a fixed deterministic the path is differentiable at exactly when , by [step 2.3] and [step 3.1]; since the singleton is Lebesgue-null, the path is almost surely not differentiable at , and this holds for every of the uncountable family .
Yet almost surely the path is differentiable somewhere, namely at , by [step 2.3]; hence the pathwise event "the path is nowhere differentiable on " has probability . 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.
The boundary and degenerate cases are covered: the fixed-time family is the open interval , 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 is the differentiability point of the path and contributes the null singleton to the fixed-time computation of [step 4.1]; the outcomes 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.
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 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 , 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
- Gregory F. Lawler, Stochastic Calculus: An Introduction with Applications, Section 2.8
- Gregory F. Lawler, Stochastic Calculus: An Introduction with Applications, Theorem 2.8.1
- Perla Sousi, Advanced Probability, Theorem 6.39, printed p. 71
- Rick Durrett, Probability: Theory and Examples, fifth edition, Theorem 8.5.1
- Gregory F. Lawler, Stochastic Calculus: An Introduction with Applications, Section 2.8 (the partition-dependence warning for quadratic sums)
- Rick Durrett, Probability: Theory and Examples, fifth edition, Theorem 7.1.6 and the surrounding discussion of fixed-time versus pathwise statements
- The Takagi function: a survey (the nowhere-differentiable input to the profile)