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
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
- 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
- Convexity
- 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
- Equivalent Forms of Completeness
- 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
- Further Trigonometric Identities and Inverse Functions
- 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
- Stone–Weierstrass in General
- 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
This page studies the sample paths of the Brownian motion of brownian-motion-construction-and-continuity and brownian-motion-markov-properties-and-hitting-times, as paths rather than as a Markov process or a martingale.
The roughness of the paths is quantified first: no nondegenerate interval admits a finite one-half Hölder constant Brownian paths are nowhere locally one-half Hölder, the paths are nowhere differentiable Brownian paths are nowhere differentiable, and their total variation is infinite on every nondegenerate interval Brownian paths have infinite total variation. Against this, the quadratic sums along a named partition sequence behave regularly: the definition Quadratic variation along a partition sequence fixes the two conventions and the partition dependence, the dyadic sums converge to elapsed time Brownian quadratic variation on dyadic partitions and even uniformly in time Uniform dyadic Brownian quadratic variation process, yielding the one- versus two-variation dichotomy Brownian one- and quadratic variation. The quantifier boundary of that construction is recorded separately Quadratic variation needs a partition convention.
The all-path continuous jointly measurable version Brownian motion has a jointly measurable continuous version makes the zero set a well-behaved random closed set The Brownian zero set, which is Lebesgue-null The Brownian zero set has Lebesgue measure zero yet has no isolated points The Brownian zero set has no isolated points and is therefore uncountable The Brownian zero set is uncountable.
Growth at infinity and at zero is governed by the two-sided Mills bounds Two-sided Mills bounds for the standard normal tail, the law of the iterated logarithm at infinity Brownian law of the iterated logarithm at infinity, its time-inverted form at zero Brownian law of the iterated logarithm at zero, and the resulting critical Hölder boundary at the origin The critical Hölder boundary at zero.
Finally the page proves the first arcsine law for the last zero before a fixed time The last Brownian zero has the arcsine law and the second arcsine law for the occupation time of the positive half-line Brownian positive occupation time has the arcsine law, the latter through the step-potential resolvent Brownian step-potential resolvent at zero.
Choice is declared wherever the Brownian, conditional-expectation, Borel-Cantelli or integration-by-parts interfaces require it, and the countable-choice use in the monotone-differentiability step is declared at the -variation computation. The companion page brownian-path-properties-examples carries the dyadic moment computations, the -variation threshold, the LIL consequence for square-root bounds, and the three counterexamples.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Brownian paths are nowhere locally one-half Hölder
Statement
Assume the Axiom of Choice. Let be a standard Brownian motion Brownian motion. Almost surely there is no nondegenerate interval and no finite constant such that The assertion concerns intervals only: no claim is made here about the exceptional times at which a deterministic pointwise one-half Hölder bound might hold, and no uniform modulus theorem is asserted.
Facts & Assumptions
Given: AC and a standard Brownian motion B on nonnegative times.
For every finite list the increments are mutually independent with laws . Brownian motion
is by definition the law of for , and has the strictly positive density of total mass one; hence for every finite real . Standard normal and normal laws The standard normal density has total mass one
The rationals are dense in : every nondegenerate interval contains 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 by countable subadditivity. Basic identities for a probability measure
Proof
Fix rationals and an integer , and put This is measurable because it is a countable intersection of coordinate events. For every integer , with and grid points (all rational), the event is contained in for , because consecutive grid points are rational pairs in at distance .
Insert the endpoint 0 before a when a>0; [F1] then applies to the increasing grid starting at zero, and its subfamily of increments on [a,b] is independent. By [F1] and [F2] the increments , , are independent with the law of , so each satisfies , and independence gives ; hence for every and therefore . For completeness, the standard normal probability of [C+1,C+2] is at least , proving p_C<1 for the positive integers C used here.
The family of ordered pairs of rationals and of integers is countable, so [step 2.1], countable subadditivity [F5] and [F4] give .
On the complement of that null event there is no nondegenerate interval with a finite one-half Hölder constant: if were such an interval with any finite real constant , then by [F3] we could choose rationals with , and with the bound would in particular hold for all rational , that is, would occur.
The intended cases are covered: the interval is required to be nondegenerate, so the empty and singleton interval cases are excluded; the value in [step 2.1] is the degenerate single-increment case of the estimate and already gives ; the union over integers covers every finite real constant up to rounding up; the estimates in [step 2.1] hold for every positive integer n and imply nullness without requiring the mesh events to be nested; and AC is used only through [F4] via [F1] and [F2].
Source notes
Durrett's remark after Theorem 7.1.6 records that one-half is the critical exponent for uniform interval bounds and that the exceptional set of times at which a pointwise one-half Hölder bound holds is not ruled out by this theorem. Yoshida proves the subcritical uniform statement in Section 6.3 and the nowhere alpha-Hölder statement for alpha > 1/2 in Section 6.4 of the same notes (Proposition 6.4.1 there); the argument above is instead the direct mesh computation: on a fixed rational interval a one-half Hölder bound forces all increments of the uniform -mesh to be of size at most , an event of probability whose intersection over is null.
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.
Brownian paths have infinite total variation
Statement
Assume the Axiom of Choice. Let be a standard Brownian motion Brownian motion. Almost surely, on every nondegenerate compact interval the variation sums of the path are unbounded above: over all partitions of in the sense of Bounded variation and total variation on an interval. Equivalently, almost surely the path is not of bounded variation on any nondegenerate compact interval.
Facts & Assumptions
Given: AC, a standard Brownian motion , and nonnegative rationals .
For disjoint time intervals the increments of are independent with laws for interval length . Brownian motion
is the law of for , and has the strictly positive density with . Standard normal and normal laws The standard normal density has total mass one
Improper integrals of nonnegative measurable functions are the limits of their integrals over , and substitution by computes . Monotone convergence for the integral Substitution: if is differentiable on with integrable and is continuous on an interval containing , then . Under Countable Choice, continuous compact-interval integrands have equal Riemann and Lebesgue integrals; expectation is integration against the law, and a density can be moved into the integrand. A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral Change of variables for expectation Integrating against a density agrees with integrating the product
For a real function on with , the variation of a partition is , and the sums over all partitions are nonempty; a partition of a subinterval refines to a partition of the larger interval, so the variation sums are monotone under passing to subintervals. Bounded variation and total variation on an interval
Chebyshev: for a square-integrable real and . Chebyshev's inequality for random variables
First Borel-Cantelli: if then almost surely only finitely many occur. First Borel-Cantelli lemma for events
The rationals are dense and countable; enumerating ordered pairs by diagonals gives a countable list of rational intervals. The rationals embed densely in the reals is countably infinite
AC is the ambient assumption of the Brownian and normal-law interfaces. The Axiom of Choice
For the even-moment formula gives for ; in particular (Gaussian even moments for Brownian increments).
Products of integrable Borel functions of independent real random variables have factored expectations. For square-integrable real random variables, covariance is bilinear and , with (Expectations factor over finite products of independent random variables, Variance and covariance identities for random variables).
Proof
For one has and : by [F2] and [F3], , while by [F9] with , so [F10] gives variance . The compact substitution integrals in [F3] are transferred to Lebesgue integrals before the nonnegative monotone limit; expectation and density identities in [F3] justify the displayed Gaussian integral.
Fix , put and ; by [F1] and [F2] the increments are independent with the law of , so and is constant in . Indeed every absolute increment is square-integrable by step 1.1; [F10] applied to the absolute-value Borel functions on any two distinct increments gives zero covariance, and finite bilinearity gives the variance sum. If , the independent increment list in [F1] is obtained by including in the time grid and discarding its first increment; for no extra interval is needed.
By [F5] applied to with , , which is summable in .
By [F6] and [step 2.1], almost surely for all sufficiently large , and hence ; since each is the variation of the path over the dyadic partition of , the variation sums over partitions of are almost surely unbounded above.
The argument of steps 1.1-4.1 depends on only through the single number , so it applies verbatim to every ordered pair of nonnegative rationals ; by [F7] the pairs form a countable family. For each pair use the measurable event of probability one from step 4.1; intersecting these explicit events gives a measurable probability-one event on which the variation sums of are unbounded above on every compact interval in with rational endpoints.
On that event every nondegenerate compact interval has unbounded variation sums as well: choose, by [F7], nonnegative rationals with , note that the dyadic partitions of extend to partitions of by adding the points and , and that adding points can only increase a variation sum by the triangle inequality, so the sums over partitions of dominate the unbounded family for .
The boundary cases are covered: the interval is required to be nondegenerate, so and the singleton convention are excluded; increments are used, so the -sums are genuine variation sums over partitions in the sense of [F4]; the variance bound is uniform in the mesh index for each fixed interval, while the full-measure intersection in step 5.1 is legitimate by countability, not by an interval-independent variance constant. AC includes the Countable Choice required for the compact Riemann/Lebesgue bridge and is inherited through the Brownian and normal-law interfaces in [F8].
Source notes
The proof uses the published Gaussian even-moment calculation at order two, a compact substitution calculation for the absolute first moment, the general independent-product and covariance interfaces, Chebyshev and first Borel–Cantelli. It requires neither bounded-variation differentiability nor a quadratic-variation theorem.
Quadratic variation along a partition sequence
Definition
Fix and a continuous function (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point). A partition sequence of is a sequence of 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, written whose mesh tends to zero as . The partitions need not refine one another and no regularity of the points beyond mesh convergence is assumed. A family originally indexed by positive integers is read as the zero-indexed family ; this changes none of its limiting assertions.
For two partial sums are attached to . If is a partition point, both are defined by the same formula; the cases and are included, and an empty sum is .
- Step convention. With the largest index in with ,
- Partial-increment convention. On the interval containing one also adds the terminal increment, and .
The quadratic variation of along is the limit of either family of functions, in a mode that is part of every later statement: the pointwise claim is that converges as for each fixed , and the uniform claim is that it converges uniformly on . No other mode and no other partition family is included.
Three conventions are built into the definition and are used later in this form.
- The two conventions differ by at most the squared maximal oscillation. For every and , and the right-hand side tends to as because is uniformly continuous on the compact interval and the mesh tends to . For completeness this uniform-continuity assertion is choice-free: for each and , continuity supplies a least integer such that whenever and . The intervals of radius centered at cover . Its compactness Heine-Borel by bisection: every closed bounded interval is compact gives finitely many such intervals covering it. Put equal to the minimum of their positive radii. If and belongs to the interval centered at , then both are within of , so . This proves uniform continuity without selecting arbitrary radii. In particular the two conventions have the same limit whenever either limit exists.
- No partition-independent object is defined. The symbol names the th sum along the named sequence , and any quadratic-variation limit is attached to that sequence; it is not a claim that the sums converge along every refining sequence, nor that a path-dependent choice of partitions leaves the limit unchanged. When a statement below says "quadratic variation", the partition sequence is part of the data.
- Dependence on . Each is a genuine real number, being a finite sum of nonnegative terms; the family is nondecreasing in for the step convention, and for the partial-increment convention it agrees with the step value at partition points.
No choice principle is used: the partitions are given as a sequence of finite lists, the sums are finite sums of real numbers, and the limits are the usual uniqueness-of-limit limits.
Source notes
Lawler, Section 2.8, defines the quadratic sums along a partition sequence, proves the convergence results for meshes tending to zero (Theorems 2.8.1-2.8.2) and warns explicitly that the mesh condition is load-bearing: without a prescribed partition family the sums may depend on the partitions chosen. The definition above separates the two partial-sum conventions used in that section and records only a difference bound, so that later items can state their limits for either convention without redefining the symbol.
Brownian quadratic variation on dyadic partitions
Statement
Let be a standard Brownian motion Brownian motion and fix . For let be the dyadic partition of with points , , and let in the notation of Quadratic variation along a partition sequence. Then in and almost surely as .
Facts & Assumptions
Given: AC, a standard Brownian motion , , and the dyadic partitions above with .
The increments of over disjoint intervals are independent with laws for interval length . Brownian motion
If has law then with ; in particular and for an increment of length . Gaussian even moments for Brownian increments
Chebyshev: for a square-integrable real and . Chebyshev's inequality for random variables
First Borel-Cantelli: if then almost surely only finitely many occur. First Borel-Cantelli lemma for events
denotes the terminal quadratic sum along the named partition sequence , whose mesh tends to zero. Quadratic variation along a partition sequence
AC is the ambient assumption of the Brownian and normal-law interfaces. The Axiom of Choice
Proof
Writing for , [F1] and [F2] give and , so the centered variables satisfy and .
has mean , and [F1] makes the independent, so ; hence and in .
For every , [F3] gives , which is summable in ; applying [F4] to for each and intersecting the resulting probability-one events over shows that almost surely .
The degeneracies are covered: is required, so and the sums are nonempty with terms; the partition sequence is the one named in [F5], with mesh and with consecutive refinements , so no ambiguity of convention arises at , where the step and partial-increment conventions coincide by Quadratic variation along a partition sequence; and AC enters only through [F6].
Source notes
Lawler, Theorems 2.8.1 and 2.8.2, proves the mean-square convergence of the dyadic quadratic sums and their almost-sure convergence along meshes whose sizes are summable (here ). The computation above is the direct one: the second and fourth Gaussian moments of the increments give , Chebyshev gives summable error probabilities, and Borel-Cantelli upgrades to almost-sure convergence.
Uniform dyadic Brownian quadratic variation process
Statement
Let be a standard Brownian motion Brownian motion and fix . For let be the dyadic partition of with points , . Then almost surely the partial quadratic-variation processes converge to uniformly on , for the step convention and for the partial-increment convention of Quadratic variation along a partition sequence alike:
Facts & Assumptions
Given: AC, a standard Brownian motion , , the dyadic partitions with mesh , and grid points .
The increments of over disjoint intervals are independent with laws for interval length , and one probability-one event carries all continuous paths. Brownian motion
For an increment of length , and . Gaussian even moments for Brownian increments
Kolmogorov's maximal inequality: for independent centered square-integrable with partial sums , . Kolmogorov maximal inequality
First Borel-Cantelli: if then almost surely only finitely many occur. First Borel-Cantelli lemma for events
The two conventions of agree at partition points and differ by the squared terminal increment ; the mesh of is . Quadratic variation along a partition sequence
A subset of is compact if and only if it is closed and bounded; hence is compact. A subset of is compact if and only if it is closed and bounded
AC is the ambient assumption of the Brownian and normal-law interfaces. The Axiom of Choice
Proof
Put , and for ; at partition points the step convention reads , and the two conventions agree there by [F5].
By [F1] and [F2], and ; the are independent because they are functions of disjoint increments, so , and [F3] gives for every .
The bound of [step 2.1] is summable in for each fixed ; applying [F4] to the events for and intersecting the resulting probability-one events over yields: almost surely, for every rational one has for all sufficiently large , hence .
For the step convention satisfies , and the same bound with holds at ; since , [step 3.1] gives almost-sure uniform convergence to for the step convention on .
For the partial-increment convention, [F5] gives , where ; by [F6] and the finite-subcover argument applied to the continuous path on the compact interval , as , so the two conventions have the same uniform limit .
The boundary cases are covered: so and the sums have at least two terms; is a partition point with for both conventions; is a partition point where the conventions coincide by [F5]; the mesh tends to zero and the partitions refine, so the named sequence is a partition sequence in the sense of [F5]; and AC enters only through [F7].
Source notes
Lawler, Section 2.8, obtains the uniform statement by controlling the maximal partial sum at the grid points and observing that the path increments are small between them. The proof above uses Kolmogorov's maximal inequality directly on the centered squared increments , whose variance is by the fourth Gaussian moment, and then handles the two partial-sum conventions with the difference bound recorded in the definition.
Brownian one- and quadratic variation
Statement
Assume the Axiom of Choice. Let be a standard Brownian motion Brownian motion. Then:
- Almost surely, the path has unbounded total-variation sums on every nondegenerate compact interval : it is not of bounded variation there.
- For every fixed , almost surely the dyadic partial quadratic-variation processes on converge uniformly to . These assertions hold simultaneously for every horizon in any prescribed countable subset of , in particular for all positive integer horizons.
The two conclusions are not in conflict: the first is an assertion about sums of first powers over partitions, the second about sums of squares along the named dyadic sequence.
Facts & Assumptions
Given: AC and a standard Brownian motion .
Almost surely the variation sums of the path are unbounded above on every nondegenerate compact interval in , so the path is not of bounded variation there. Brownian paths have infinite total variation
For each fixed , almost surely the dyadic partial quadratic-variation processes of converge to uniformly on , for both conventions of Quadratic variation along a partition sequence. Uniform dyadic Brownian quadratic variation process
AC is the ambient assumption of the Brownian interfaces. The Axiom of Choice
Proof
By [F1] there is one probability-one event on which the variation sums are unbounded on every nondegenerate compact interval in ; this is already a single almost-sure statement and needs no further intersection.
For each fixed , [F2] gives a probability-one event on which the dyadic partial quadratic-variation processes formed from the dyadic partitions of converge uniformly to on . For a prescribed countable , select such a measurable full-measure event for each using the stated AC, and intersect with the single full-measure continuity event supplied by Brownian motion. The event (also intersected with that continuity event) has probability one, giving simultaneous convergence for . This includes finite and empty and all positive integer horizons. The partition used for each has points ; convergence is not transferred between differently scaled grids. [F3]
For a fixed horizon, or the prescribed countable set in step 1.2, intersecting the probability-one event of [step 1.1] with the corresponding event of [step 1.2] gives both assertions simultaneously; the dyadic partition sequence is named, so the second conclusion is a statement about that sequence and not about arbitrary partitions.
The degenerate cases are covered: the interval in the first assertion and the horizon in the second are required to be nondegenerate and positive respectively; the value is a partition point at which both quadratic sums vanish; only prescribed countable families of horizons are intersected, because the dyadic partitions supplied by [F2] depend on the horizon; and AC enters through the suppliers and the countable selection of their full-measure events in [F3].
Source notes
Lawler, Section 2.8, records both faces of the dichotomy: the absolute-increment sums diverge while the squared-increment sums converge to elapsed time. The corollary collects the two independently proved statements on the page and makes explicit that the quadratic variation is asserted along the named dyadic sequence.
Brownian motion has a jointly measurable continuous version
Statement
Let be a standard Brownian motion Brownian motion on a probability space . Then there is a process with the following properties.
- is indistinguishable from , and on all of .
- Every path is continuous on , so is a map into the path space of Uniform-on-compacts metric on continuous path space.
- That map is Borel measurable for the uniform-on-compacts Borel -algebra, and is measurable for .
The version is obtained by keeping the original process on one probability-one event and replacing the whole path by the zero path outside it; no distribution of is altered and no path is selected by any choice principle.
Facts & Assumptions
Given: AC and a standard Brownian motion on .
There is a measurable event with on which every path is continuous, and almost surely. Brownian motion
On the uniform-on-compacts metric induces the topology of uniform convergence on compact subsets of . Uniform-on-compacts metric on continuous path space
The Borel -algebra of is generated by the coordinate maps , . Borel sigma-algebra of continuous path space is generated by coordinates
The evaluation map on is defined for every pair, and it is continuous when the path space carries the uniform-on-compacts topology. The evaluation map ,
AC is the ambient assumption of the Brownian interfaces. The Axiom of Choice
Proof
Put , a measurable event with by [F1], and define for and for ; then is indistinguishable from because it differs from only on the null set , and for every .
The evaluation map of [F4] is continuous: if in the metric of [F2] and in , choose with for all and for , which is possible because the continuous is continuous at ; convergence in the metric of [F2] gives for all large , and then for all large .
Every path of is continuous: for it is the Brownian path, continuous by [F1], and for it is the zero path.
Each time coordinate of is measurable: is the product of a measurable indicator with the measurable function .
The map is a random element of with its Borel -algebra: by [F3] that -algebra is , and for every and every Borel one has , measurable by [step 2.2]; the family of Borel sets with measurable preimage is a -algebra containing the generating sets , hence all of .
The pair map is measurable from into the product of the Borel -algebras, because its first component is measurable by [step 3.1] and its second is a coordinate projection; composing with the continuous, hence Borel measurable, evaluation map of [step 1.2] shows that is -measurable.
The boundary cases are covered: the normalization changes the process only on the null set , so indistinguishability and every almost-sure statement are preserved; the initial value is on all outcomes as required; the case enters the measurability statements through the coordinate , which is identically zero; and AC enters only through [F5] as the ambient assumption of the Brownian definition.
Source notes
Durrett, Section 7.1, fixes a continuous version of Brownian motion as part of the definition of the process; Sousi's Chapter 6 treats Brownian motion as a random continuous path. The lemma records the two measurability consequences used later on the page: the path map is a random element of the continuous path space, and the evaluation map makes the process jointly measurable, which is what the Tonelli and Fubini arguments for the zero set and the occupation time need.
The Brownian zero set
Definition
Assume the Axiom of Choice and let be a standard Brownian motion. Replace , as permitted by Brownian motion has a jointly measurable continuous version, by the indistinguishable version whose every path is continuous and whose evaluation is jointly measurable. The Brownian zero set is and for a horizon one writes .
The following are part of the definition and are used later in this form.
- Pathwise closedness. For every outcome the set is closed in and nonempty: it is the preimage of the closed set under the continuous path, and for every outcome. Hence is compact for every .
- Version independence. Replacing by the original changes only on a -null set: and are indistinguishable. Every almost-sure assertion about proved below is therefore an almost-sure assertion about the zero set of , and no statement below quantifies over versions.
- Measurability of the section integrals. Joint measurability makes measurable for , so for each the section integral is a measurable function of , and the Tonelli identity for the product measure applies to it.
- Endpoint conventions. The point belongs to for every outcome, the singleton has Lebesgue measure zero, and a horizon may be replaced by any larger horizon since for .
No further structure is assigned: in particular is not asserted to be perfect, uncountable or of measure zero by this definition; those are statements proved separately on this page.
The Brownian zero set has Lebesgue measure zero
Statement
Assume the Axiom of Choice. Let be a standard Brownian motion and let be its zero set as in The Brownian zero set, understood through the all-path continuous jointly measurable version. Then for every the Lebesgue measure of is zero almost surely: Here set , extending the positive-horizon notation. There is one measurable full event on which and all finite horizons have zero measure. On its intersection with the supplied event of all-time agreement, the same pathwise assertion holds for the original B.
Facts & Assumptions
Given: AC, a standard Brownian motion , its normalized version and zero set , and a horizon .
The zero set is the closed, nonempty set of the all-path continuous version , and . The Brownian zero set
The map is -measurable, so is product measurable. Brownian motion has a jointly measurable continuous version
For t>0 the Brownian definition gives law N(0,t), and B_0=0 almost surely, hence B_t has that law. By the definition of the normal law, it is the law of sqrt(t) times a standard normal variable. Brownian motion Standard normal and normal laws
Tonelli: for a product-measurable on a product of sigma-finite spaces, the section integrals are measurable and the two iterated integrals agree. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
AC is the ambient assumption of the Brownian interfaces. The Axiom of Choice
A nonnegative measurable function has integral zero exactly when it vanishes almost everywhere. Countable unions of probability-zero events are null. A nonnegative measurable function has integral exactly when it vanishes almost everywhere Basic identities for a probability measure
Proof
For t>0, [F3] gives , because sqrt(t)>0 and the standard normal density integrates to zero over the Lebesgue-null singleton {0}. The latter singleton convention is in [F1]. The normalized version agrees with B on one measurable full event by [F2], so as well. At t=0 the probability is one, but that time singleton has Lebesgue measure zero. The zero indicator is product measurable by [F2].
Applying [F4] to that indicator over the sigma-finite product with the product measure gives , and it also shows that is measurable.
Since , its measurability and zero expectation in step 2.1 permit [F6], giving almost surely.
Intersect the measurable probability-one events from step 3.1 over the explicitly listed horizons N>=1. By [F6] their intersection A is measurable with probability one. On A, every finite nonnegative T has for some integer N>=T, so its measure is zero by monotonicity. Also , so countable subadditivity of Lebesgue measure gives on A. Conversely a zero-measure whole zero set has zero-measure intersections, which explains the global formulation.
At T=0 the zero set is the singleton {0}, so its measure is zero pathwise; the time endpoint t=0 does not affect step 2.1. Let A_* be the measurable full event on which the supplied normalized process agrees with B at all times. On A intersect A_* from step 4.1 the original B path has exactly the same zero set, proving its pathwise nullness there. No claim is needed that arbitrary exceptional paths of B have measurable zero sets or that the entire all-time equality event is measurable. The countable horizon list is fixed; full AC is inherited from [F5], with no further selection of paths or exceptional events.
Source notes
Durrett, Section 7.4.1, computes and concludes that the zero set has measure zero; the argument above makes the Tonelli step explicit through the all-path continuous jointly measurable version, so the section integrals are measurable without any auxiliary regularity assumption.
The Brownian zero set has no isolated points
Statement
Assume the Axiom of Choice. Let B be standard Brownian motion and let Z be the zero set of the everywhere-continuous, zero-start representative X fixed in The Brownian zero set. On one measurable event of probability one, every t in Z is a limit point of . Thus Z is closed and has no isolated points in [0,infinity). On the supplied common full event, this assertion also holds for the original B path.
Facts & Assumptions
Given: AC, B, its normalized representative X, and its zero set Z.
X has measurable coordinates, every path is continuous and starts at zero, and X agrees with B on a measurable full event. Thus its finite-dimensional distributions, including the independent Gaussian increments, agree with those of B and X itself is a standard Brownian motion. Z is closed and contains zero. The Brownian zero set Brownian motion
Form the raw natural filtration and usual augmentation of X itself. This augmentation contains the raw filtration of X. The proof applies the strong Markov theorem directly to X and requires no identification with the filtration of the original B. Natural and usual augmented Brownian filtrations
Stopping times use the non-strict sublevel test. For a bounded stopping time S of the usual augmentation of a Brownian motion X and a bounded product-measurable functional G, the conditional future identity is , where and mu is Wiener measure. Since X is everywhere continuous and S finite, the theorem's measurable random-time version equals the literal evaluation everywhere. Continuous-time stopping times and stopped sigma-algebras Strong Markov property of Brownian motion Wiener measure on continuous path space
The maximum of a continuous zero-start Brownian motion on [0,h], h>0, has distribution for x>=0; in particular P(M_h=0)=0. The process -X is also Brownian by negating its independent centered Gaussian increments. Law of the Brownian maximum Brownian motion
Rational density and countable subadditivity for null events. The rationals embed densely in the reals Basic identities for a probability measure
Conditional-expectation equalities are almost-sure equalities of versions characterized by event integrals. Full AC is inherited from the Brownian, completion and conditional-expectation interfaces. Conditional expectation as an ae class The Axiom of Choice
Proof
Apply [F4] to X and -X on each interval [0,1/m], m>=1. Off a countable union of null events [F5], X has both a positive and a negative value on each such interval. Neither value is at zero. The intermediate value theorem between those two times gives a zero at a positive time <=1/m. Therefore positive zeros accumulate at zero. The same argument applies to the coordinate process under Wiener measure, which is Brownian by [F3].
Fix a nonnegative rational q and define , with infimum of the empty set infinity. For t<q its sublevel event is empty. For t>=q, compactness and closedness give , which equals the event that the infimum over is zero. At t=q this is the singleton test X_q=0. Every coordinate used has time <=t, so the event belongs to the raw filtration of X and thus to its usual augmentation [F2]. This proves that tau_q is a stopping time. If tau_q is finite, closedness gives X_{tau_q}=0. No recurrence or finiteness assertion is needed.
Define . This is product measurable, since only countably many coordinates and set operations occur. For continuous w the compact infimum is a minimum and equals the rational infimum, so G(w)=1 precisely when positive zeros accumulate at zero. Step 1.1 shows . For any nonzero x, continuity of w at zero and w(0)=0 exclude zeros of x+w sufficiently near zero; hence . These assertions hold mu-almost surely even if a realization of Wiener measure contains nonzero-start null paths.
For integers N>=1 put S=tau_q wedge N. It is a bounded stopping time: its sublevel event is {tau_q<=t} for t<N and the whole space for t>=N. By [F3] and step 2.1, . The event {X_S=0} is in the stopped sigma-algebra by [F3]. Integrating the nonnegative variable over the whole space gives zero by the conditional event-integral identity [F6]; since this variable is an indicator, the event it indicates is null. Thus, almost surely on {X_S=0}, positive zeros of the post-S path accumulate at zero. On {tau_q<=N} step 1.2 gives S=tau_q and X_S=0. We conclude that, outside a measurable null event, whenever tau_q<=N the zero tau_q is approached by other zeros from the right.
Take the intersection of the full event in step 1.1 with the full events in step 3.1 over the countable set of nonnegative rationals q and positive integers N. It is a measurable full event by [F5]. On it, every finite tau_q is approached by other zeros from the right, since some N is larger than tau_q.
On that event zero is not isolated by step 1.1. If t>0 were an isolated zero, some delta with 0<delta<t would satisfy . By rational density choose q in (t-delta,t). There are no zeros in [q,t), and t is a zero, so tau_q=t. Step 4.1 supplies other zeros in (t,t+delta), a contradiction. Hence every zero is a limit point of the other zeros. Z is already closed by [F1].
The empty hitting set and tau_q=infinity cause no problem because only bounded S are used, and the conclusion about tau_q is conditional on its finiteness. The time-zero endpoint has its own full event. The only intersections of full events are countable; no rational time is claimed itself to be a positive Brownian zero. On the common agreement event in [F1] the original B and X have identical zero sets, so the original path assertion follows there. AC is inherited as in [F6]. In particular, the proof never places an arbitrary normalization null event in the original Brownian filtration.
Source notes
The standard rational-next-zero and strong-Markov architecture is described in Durrett, Section 7.4.1, and Sousi, Theorem 6.39. Here immediate zero accumulation follows from the maximum law applied to both signs. Using tau_q wedge N removes the need for a recurrence argument. The auxiliary filtration is the usual augmentation of the normalized Brownian motion itself.
The Brownian zero set is uncountable
Statement
Let be a standard Brownian motion and let be its zero set The Brownian zero set. Almost surely, for every the set is uncountable. In particular the zero set is almost surely uncountable in every nondegenerate interval , although by The Brownian zero set has Lebesgue measure zero it has Lebesgue measure zero there.
Facts & Assumptions
Given: AC, a standard Brownian motion , its zero set , and .
is a closed subset of containing , and is compact. The Brownian zero set
Almost surely every point of is a limit point of , so has no isolated points. The Brownian zero set has no isolated points
Almost surely for every integer horizon . The Brownian zero set has Lebesgue measure zero
A set is perfect when it is closed and has no isolated points; every nonempty perfect subset of is uncountable. Perfect subset of : closed with no isolated points Every nonempty perfect subset of is uncountable
The rationals are dense in . The rationals embed densely in the reals
AC is the ambient assumption of the Brownian interfaces. The Axiom of Choice
Proof
Fix a rational with ; then is nonempty because , it is closed in as the intersection of the closed set with the closed interval , and it has no isolated points: for one has , and by [F2] there are zeros of different from in every neighbourhood of , which for a neighbourhood of radius lie in .
Almost surely, for every there is a rational with : by [F3] and monotonicity of Lebesgue measure, , so ; picking , openness of the complement of the closed set supplies a neighbourhood of disjoint from , and [F5] supplies a rational in that neighbourhood with .
On the probability-one event of [step 1.2] and [F2], and for a rational as there, [step 1.1] exhibits as a nonempty perfect subset of ; by [F4] it is uncountable, and since , the set is uncountable.
The cases are covered: is required, so the interval is nondegenerate; the rational is chosen strictly inside so that the potential isolated point of is excluded by ; the statement is asserted simultaneously for all on one probability-one event, obtained by intersecting the countably many events of [step 1.2] over rational and using monotonicity in ; and AC enters only through [F6].
Source notes
Sousi, Theorem 6.39, states the zero set is almost surely closed with no isolated points, and Durrett, Section 7.4.1, derives uncountability from closedness and the absence of isolated points by the perfect-set theorem. The corollary adds the explicit choice of a rational point outside inside every horizon, which is what makes the subset used in the perfect-set theorem nonempty and genuinely free of the terminal-point exception.
Two-sided Mills bounds for the standard normal tail
Statement
Let and for . Then for every and consequently, for every , Both bounds are sharp as in the sense that the ratio of each side to tends to .
Facts & Assumptions
Given: AC, AC, DC, and a real .
is the strictly positive, Borel measurable standard normal density, with , and is the probability measure . Standard normal and normal laws The standard normal density has total mass one
On a compact interval every function is Lipschitz, hence absolutely continuous and of bounded variation; in particular and are absolutely continuous on for . implies Lipschitz, Lipschitz implies absolutely continuous, and absolutely continuous implies continuous and bounded variation
Integration by parts for absolutely continuous functions: , under AC and DC. Integration by parts for absolutely continuous functions The Axiom of Countable Choice () The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
Substitution computes , and monotone convergence justifies passing to the limit in the integrals of the nonnegative functions and over . Substitution: if is differentiable on with integrable and is continuous on an interval containing , then Monotone convergence for the integral
AC is the ambient assumption; AC and DC are the hypotheses of the integration-by-parts interface used in [F3]. The Axiom of Choice The Axiom of Countable Choice () The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
Proof
For one has ; integrating over and letting with [F4] gives , and [F4] computes , so .
For , [F2] and [F3] applied to and on , together with , give .
Letting in [step 1.2] with [F4] gives , and since on one gets , that is, and hence .
The algebraic comparison for is equivalent to , which holds; combining it with [step 2.1] gives the displayed form for , and the ratio claim follows because and while the upper bound already is .
The endpoint and degenerate cases are covered: is required so that and the integration interval are meaningful and is on it; is excluded by the statement because the upper bound would divide by zero, while is finite; the limit is handled by monotone convergence over the increasing family ; the constants AC and DC are those declared for [F3] and are used nowhere else; and AC enters only through [F5].
Source notes
Durrett, Lemma 1.2.6 and the estimates (8.5.2) in the proof of Theorem 8.5.1, states the two-sided bound for (up to the normalization constant), together with the asymptotic ratio used in the law of the iterated logarithm. The proof above derives the stronger lower bound from the identity obtained by integrating by parts, which is the form consumed by the LIL item.
Brownian law of the iterated logarithm at infinity
Statement
Let be a standard Brownian motion Brownian motion. Then on one measurable event of probability one the normalizing function being taken for so that .
Facts & Assumptions
Given: AC, a standard Brownian motion , rationals , and the geometric sequence .
The increments of over disjoint intervals are independent with laws for interval length ; the path is continuous on a probability-one event. Brownian motion
Use the everywhere-continuous zero-start representative fixed in the maximum-law theorem (zero the path outside a measurable full event of continuity and zero start). It equals the original Brownian motion at all times on that event, so the final path conclusion transfers back. Law of the maximum: with one has for , where . Law of the Brownian maximum
Mills bounds: for , ; for , ; and is decreasing in . Two-sided Mills bounds for the standard normal tail Standard normal and normal laws The standard normal density has total mass one
First Borel-Cantelli: summable probabilities give almost surely finitely many occurrences; second Borel-Cantelli: independent events with divergent probability sum occur infinitely often almost surely. First Borel-Cantelli lemma for events Second Borel-Cantelli lemma under pairwise independence
If is a standard Brownian motion then so is : the covariance characterisation exhibits the increments of as independent stationary Gaussian increments, and continuity is preserved. Brownian covariance is equivalent to independent stationary normal increments
The rationals are dense in . The rationals embed densely in the reals
AC is inherited from the Brownian, normal-law and maximum-law interfaces. Both cited Borel–Cantelli statements are choice-free; no choice assumption is added to them. The Axiom of Choice
Proof
For with put and ; by [F2] and [F3], for a constant , because ; since the probabilities are summable. For example, grouping in bounds the upper series by a constant times , which is geometric. Set the finitely many early events with to the empty event.
For the lower bound fix , put and , so that by [F1] the are independent with law ; let with , and note .
By [F4] and [step 1.1] there is a probability-one event on which fails for all sufficiently large ; on that event, for every with large, choosing with gives and hence ; therefore almost surely.
For large the probability of satisfies , with , by the lower Mills bound of [F3]; since , for sufficiently large this is at least with . In each block , the sum of these lower bounds is at least a positive constant times ; hence the series diverges (grouping that latter series into square blocks already gives a fixed positive contribution per block). Define the finitely many early events with to be empty.
Intersecting the events of [step 2.1] over the countably many pairs of rationals and using [F6] to choose, for every , rationals with , we obtain almost surely.
By [F5] the process is again a standard Brownian motion, so [step 3.1] applies to it and gives almost surely.
By [F4] and [step 2.2] the events occur infinitely often almost surely; on the event of [step 4.1] intersected with this one, for infinitely many one has .
Since and as , for every there are rational and with ; hence [step 5.1] gives almost surely for every rational , and intersecting over the countably many yields almost surely.
Combining [step 3.1] and [step 6.1] gives almost surely; applying this conclusion to the standard Brownian motion of [F5], whose limit superior is the negative of the limit inferior of , gives almost surely.
The boundary and degeneracy cases are covered: the normalizer is positive precisely for , and the statement is asymptotic as ; the geometric sequences are indexed from , with only finitely many terms below ; the parameters over which probability-one events are intersected may be restricted to rational and rational , a countable family. The auxiliary value need not be rational and creates no additional event: once is fixed it is a deterministic threshold in the same block events . The upper and lower bounds are established using the first Borel-Cantelli lemma for the upper bound and the second for the lower bound; AC enters only through [F7].
Source notes
This follows the geometric-block architecture of Durrett, Theorem 8.5.1 (printed pp.416–418), with an explicit critical-threshold variant. Durrett's lower bound uses threshold coefficient and a subcritical exponent ; here gives exponent one, whose remaining factor still makes the probability series divergent, as proved in step 2.2. The upper bound, interpolation, independent-block lower bound and sign symmetry follow the same route. The threshold need not be rational: it is determined by the rational parameter .
Brownian law of the iterated logarithm at zero
Statement
Let be a standard Brownian motion Brownian motion. Then almost surely the normalizer being taken for so that .
Facts & Assumptions
Given: AC and a standard Brownian motion .
Almost surely and the corresponding limit inferior is for every standard Brownian motion . Brownian law of the iterated logarithm at infinity
Time inversion: the process , for , is again a standard Brownian motion, with continuity at part of the conclusion. Brownian time inversion
AC is the ambient assumption of the Brownian interfaces. The Axiom of Choice
Proof
Let be the time-inverted process of [F2]; by [F1] applied to there is a probability-one event on which and .
On that event, substituting with and using gives , so and almost surely.
The cases are covered: the substitution is a bijection of onto itself, so corresponds to ; the normalizer is positive exactly for ; the endpoint is not evaluated, continuity at zero being part of [F2]; and AC enters only through [F3].
Source notes
Time inversion converts the law of the iterated logarithm at infinity, Theorem 8.5.1 of Durrett, into the corresponding statement at zero, with the normalizing factor transforming exactly as displayed.
The critical Hölder boundary at zero
Statement
Assume the Axiom of Choice. Let be a standard Brownian motion Brownian motion. Almost surely both of the following hold.
- For every exponent and every the path is -Hölder on , that is, locally below the critical exponent.
- The path is not one-half Hölder at zero: there is no finite constant and no with for all . In fact is unbounded as .
The second assertion concerns the critical exponent at the single point ; the first concerns uniform subcritical Hölder bounds on each compact interval.
Facts & Assumptions
Given: AC and a standard Brownian motion .
There is a probability-one event on which, for every and every , a finite satisfies for all . Brownian paths are locally Holder below one half
Almost surely and . Brownian law of the iterated logarithm at zero
The rationals are dense in . The rationals embed densely in the reals
AC is the ambient assumption of the Brownian interfaces. The Axiom of Choice
Proof
On the probability-one event of [F1], for every and every there is a finite constant with on ; since contains and the exponents are ordered, this is precisely assertion 1.
On the probability-one event of [F2], put for . For every the limsup and liminf bounds imply for all sufficiently small , and occurs at arbitrarily small positive times. Hence ; in particular at arbitrarily small positive times.
Fix any finite and . Since , choose smaller than and such that this factor exceeds whenever . Step 1.2 supplies such a with . Then . As this works for every and , the ratio is unbounded in every right neighborhood of zero and assertion 2 follows. A negative cannot bound the nonnegative ratio either.
Intersect the events in steps 1.1 and 1.2 with , also of probability one by the Brownian definition. Both assertions then hold simultaneously; since , the critical bound written with is precisely the pointwise Hölder bound at zero. The correct exponent comparison is downward: for any , choose a rational with using [F3] and an integer . A bound with exponent on implies on , since ; the diagonal is immediate. Thus rational exponents above each desired exponent suffice, not exponents below it. In this proof [F1] already supplies the single event for every exponent and horizon, so no further uncountable intersection is made. The normalizer in step 1.2 is used only at positive . AC is inherited through [F4] and the two Brownian suppliers; the arbitrarily-small-time argument requires no selected sequence of times.
Source notes
The local Hölder supplier gives one full-measure event for all subcritical positive exponents and compact horizons. The zero-time LIL supplier gives arbitrarily small times at which its normalized absolute value exceeds one half. The proof combines these interfaces and gives the explicit downward power comparison.
Quadratic variation needs a partition convention
Remark
The identity established on this page is an almost-sure assertion along the fixed dyadic partition sequence of Quadratic variation along a partition sequence; the uniform form of that assertion is Uniform dyadic Brownian quadratic variation process. It is not a simultaneous assertion over all refining sequences, and the path-dependent or arbitrary refinements of a realized path are not covered.
What the quantifiers allow. The theorem cited above supplies almost-sure uniform convergence for the fixed dyadic sequence. For a general prescribed deterministic sequence whose mesh tends to zero, the standard conclusion without an additional summability or regularity hypothesis is convergence in probability, not almost-sure convergence along the whole sequence. In particular there is no single event on which every refining sequence simultaneously has the same limit, and the definition deliberately builds in no partition-independent object.
What fails without regularity. The convergence proofs use the independence of increments over a preselected mesh together with a summable mesh estimate. A refinement adapted to the oscillations of one realization destroys that independence and can change the sums; the deterministic partition dependence of quadratic sums is illustrated on the companion examples page, and the boundary is recorded here so that later semimartingale statements do not silently inherit a claim about arbitrary partitions.
No proof is attached to this remark: it records the quantifier boundary of the preceding definition and theorem rather than a new mathematical assertion.
The last Brownian zero has the arcsine law
Statement
Assume the Axiom of Choice. Let B be a standard Brownian motion and use the everywhere-continuous, zero-start representative fixed by The Brownian zero set. For t>0 put This is a random variable and, for , Consequently has density on (0,1), with no mass at either endpoint. On the supplied measurable full event of all-time agreement, this maximum is also the last zero of the original B. The distribution is independent of the normalized representative.
Facts & Assumptions
Given: AC, B and its normalized representative, and t>0.
The normalized zero set is closed, contains zero, and agrees with the original zero set on a measurable full event; its normalized coordinates are measurable. The Brownian zero set
For a bounded product-measurable future functional G and deterministic u, its conditional expectation given the raw Brownian past is the Borel function evaluated at B_u, where mu is Wiener measure on continuous paths. Future-path Markov property
For normalized Brownian motion W and s>0, its maximum has continuous distribution for x>=0. Law of the Brownian maximum
B_u has law N(0,u) for u>0: its increment from zero has that law and B_0=0 almost surely. This law is the pushforward of under z mapped to sqrt(u)z, where . Negation preserves all independent centered Gaussian increments and continuity, so -W is Brownian as well. Brownian motion Standard normal and normal laws
Tonelli for nonnegative product-measurable functions on sigma-finite spaces. One-dimensional C1 diffeomorphisms transport integrable functions with their absolute derivative. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions
Absolutely continuous functions obey the Lebesgue fundamental theorem; monotone convergence exhausts nonnegative integrals. Every C1 function on a compact interval is Lipschitz by its bounded derivative and the mean value theorem, hence absolutely continuous directly from the definition. Fundamental theorem of calculus for absolutely continuous functions Monotone convergence for the integral
Probability is continuous along increasing or decreasing sequences of events, and a Borel probability law is uniquely determined by its distribution function. Basic identities for a probability measure Probability laws correspond to distribution functions
Full AC is inherited from the Brownian and conditional-expectation interfaces and directly supplies all dependent or countable witness choices used by the integration and distribution interfaces. The Axiom of Choice
Proof
By [F1], the zero set in [0,t] is nonempty compact, so its maximum exists and lies in [0,t]. For 0<v<=t, the event L_t<v is exactly that the path has no zero in [v,t]. For v<t this is the event that the infimum of over is positive, since this dense infimum equals the attained compact minimum. For v=t it is simply . Both are measurable; the cases v<=0 and v>t are empty and whole. Thus L_t is measurable.
Fix 0<u<t and s=t-u. Define the bounded product-measurable functional . On continuous paths it is the indicator of no zero in [0,s]. On the common full event in [F1], and outside {B_u=0}, the indicator of L_t<=u equals G applied to the original future . The excluded event has probability zero by [F4], since the normal density gives zero mass to a singleton. Taking expectations in [F2] therefore gives , where . No all-time event on the full cylinder space or shifted hitting law is used.
For x>0 a continuous zero-start W makes x+W zero-free on [0,s] precisely when it stays positive there, or equivalently when the maximum of -W is strictly less than x. By [F3] and [F4], ; strict versus weak inequality makes no difference because the maximum law has no atom at x. For x<0 apply the same argument to -x-W. At x=0, G(x+W)=0 since W_0=0, also agreeing with by symmetry of the normal density. Hence for every x.
Using the pushforward law in [F4], not an unproved density transformation, step 3.1 gives , where and . Symmetry of the even density gives . For fixed z>0, apply [F5] to the diffeomorphism v mapped to zv from (0,a) onto (0,az); the normal density is integrable on this bounded interval. Thus the inner integral equals . Endpoints have Lebesgue measure zero.
Tonelli [F5] now gives . The explicit primitive on [0,R], followed by monotone convergence R increasing to infinity, makes the inner integral . The primitive arctan(v) on [0,a] therefore gives by [F6]. Since a>0, the angle arctan(a) is in (0,pi/2) and has sine ; hence it equals arcsin(sqrt(u/t)). This proves the asserted formula for 0<u<t without a polar substitution.
Since 0<=L_t<=t, its distribution function equals one at t. Decreasing u to zero and increasing u to t through explicit sequences in (0,t), [F7] and step 5.1 give and . Thus there is no atom at t either, and both endpoint values of the formula follow.
Put for 0<v<1. Its derivative is . On every compact subinterval of (0,1), H is C1, so [F6] gives . Let b decrease to zero and c increase to one. Monotone convergence gives total integral one and . Extend f by zero off (0,1). The probability measure with this density has the same distribution function as L_t/t by steps 5.1 and 6.1, and uniqueness in [F7] identifies the laws.
On the supplied measurable full event, the original B and normalized process have identical zero sets and hence identical last zeros. Two permitted normalized representatives agree on the intersection of their supplied full events, so give the same distribution. No measurability of the original last-zero functional on exceptional paths is asserted. The assumption t>0 is essential to the ratio; u=0,t and x=0 were handled separately. AC is used exactly through [F8]; the exhaustion sequences are fixed.
Source notes
Durrett, Example 7.4.3, printed p.374, equation (7.4.7), proves the last-zero law by conditioning and a nonnegative iterated integral. Here the equivalent Gaussian integral is evaluated by one-dimensional substitution and Tonelli. The normalized zero-set convention and endpoint/density justifications are explicit.
Brownian step-potential resolvent at zero
Statement
Assume the Axiom of Choice. Let , let for , let be a standard Brownian motion Brownian motion and let be its all-path continuous jointly measurable version. Define, for , Then , the function is Borel, on and off , and while
Facts & Assumptions
Given: AC, AC, DC, reals , the potential , a standard Brownian motion and its jointly measurable continuous version .
Every path of is continuous and is product measurable; hence is product measurable and the version agrees with B at all times on one measurable full event. We use only this full-event conclusion, not measurability of the entire equality set. Brownian motion has a jointly measurable continuous version
Markov property: almost surely for bounded Borel , with ; and for bounded Borel, with the Brownian transition density. Future-path Markov property The Brownian transition semigroup The Brownian kernels form a semigroup The future-path theorem also supplies its continuous-path Borel formulation; below it is applied to the Brownian process with its own natural filtration.
FTC package: the indefinite integral of an function is absolutely continuous and has the integrand as its derivative almost everywhere; for absolutely continuous one has for all . This interface carries AC and DC. The indefinite integral of an function is absolutely continuous The indefinite integral of an function is differentiable almost everywhere Fundamental theorem of calculus for absolutely continuous functions The Axiom of Countable Choice () The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain
Tonelli applies to nonnegative product-measurable integrands, giving measurability of the section integrals and equality of the iterated integrals; has total mass one and . Tonelli's theorem for nonnegative measurable functions on a sigma-finite product Standard normal and normal laws The standard normal density has total mass one The Gaussian integral
The Lebesgue change-of-variables formula holds for a C1 diffeomorphism and an integrable function, using the absolute Jacobian, under Countable Choice. Monotone convergence passes nonnegative exhaustion limits, and dominated convergence applies under an integrable majorant. A differentiable function with zero derivative on an interval is constant. A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions Monotone convergence for the integral Dominated convergence A function continuous on an interval whose derivative vanishes at every interior point of is constant on ; consequently two such functions with the same derivative differ by a constant
Taking out what is known: an -measurable bounded factor may be moved inside a conditional expectation. Taking out what is known
AC is the ambient assumption of the Brownian, Markov and conditional expectation interfaces. The Axiom of Choice
Proof
Write X for the supplied all-path continuous version. For parameters (x,t,omega,r), the nonnegative function is product measurable by [F1]. Its section integral in r is measurable by [F4]; for a measurability-only application one may equip the remaining parameter space with the zero measure, which is finite, so no parameter measurability is lost. Thus the exponential and its successive integrals in omega and t are measurable, and u is Borel. Since , one has . The last integral follows from [F3] on finite intervals and then [F5] by monotone convergence. X is itself Brownian, since all its finite-dimensional laws agree with B.
Put for a>0,b>=0. For b=0, scaling the Gaussian integral gives . For b>0 put and . This is integrable, bounded by . Reciprocal substitution s=c/v gives . The increasing diffeomorphism maps (0,infinity) onto the real line, with derivative . As , [F4] and [F5] yield . All substitutions can first be applied on compact subintervals to integrable continuous functions, then exhausted by monotone convergence; the absolute Jacobian handles the reciprocal map. Now set t=s^2 in the Gaussian time integral, likewise by positive exhaustion. For this gives including z=0 by the separate b=0 case.
For bounded Borel f define . For nonnegative f, Tonelli and step 1.2 give The kernel has integral , as computed by integrating its exponential on each half-line using [F3] and exhaustion. For signed bounded f apply Tonelli separately to its positive and negative parts; both integrals are bounded by , so subtraction is legitimate and gives the same formula.
Fix x and t>0. On each outcome, is absolutely continuous with derivative almost everywhere by [F3]. Set . The inner exponent is absolutely continuous and bounded on [0,t]. Composition with the exponential is absolutely continuous because the exponential is Lipschitz on its bounded range; the ordinary chain rule applies at every point where the inner derivative exists. Hence almost everywhere. The AC fundamental theorem gives No derivative at every point of an open-set boundary is asserted.
Let f be bounded Borel and . For fixed x and |h|<=1, the difference quotient is at most , by the one-sided derivatives of K and integration along the segment. It converges for every y unequal to x to . Dominated convergence, with majorant , therefore differentiates the kernel formula. Put and . Then and . These L,R are continuous: on a compact range of x write them as exponential factors times indefinite integrals of locally bounded functions, with fixed finite tails. At any continuity point of f, the difference quotient of its weighted indefinite integral tends to the integrand value, since the average error is bounded by the supremum error near that point. Thus and there. It follows that at each such point. The first derivative is continuous everywhere.
For tau>=0, the function is Borel on continuous-path space: evaluation is jointly measurable as in [F1], and the section-integral argument of step 1.1 applies. Apply the continuous-path formulation in [F2] to X and this bounded functional. At time zero, X_0=0 makes its expectation the Wiener integral. At general s this gives The indicator is measurable for this filtration. Multiplying by it using [F6] and taking expectations yields an equality for each s,tau; the expectation property here is the defining conditional-expectation event identity with the whole event. Tonelli integrates these nonnegative quantities in s and tau, so no simultaneous choice of conditional-expectation versions over uncountably many times is required. Integrate step 2.2 in t and expectation, then translate t=s+tau using [F5]. Since , the result is
Set , bounded Borel by step 1.1. The semigroup formula and in step 2.1 turn step 3.2 into Therefore step 3.1 already proves u is continuously differentiable on the whole real line. In particular f is continuous on each open half-line.
At every x unequal to zero, apply step 3.1 to 1 and to f from step 4.1. The coefficient beta must multiply both terms of its second derivative: This is continuous separately on the half-lines, so u is C2 there and satisfies the stated two equations. At zero only the already established C1 regularity is used.
To solve the ODE without an unproved general-solution assertion, on an interval where , k>0, set . Then , so [F5] makes F a constant times . Differentiating and then subtracting the explicit primitive of that exponential gives, again by [F5], . Apply this with , k=lambda, on the negative half-line and with , , on the positive half-line. Boundedness in step 1.1 excludes the exponentially growing term at the respective infinite endpoint. Hence
Continuity of and of at , from [step 5.1], gives and ; substituting the second into the first yields with , whose solution is .
The boundary and degeneracy cases are covered: keep bounded between and , so and all the integrals converge absolutely; the potential has its single discontinuity at , so the second-order equation is asserted only off , where is continuous; the case is handled by the continuity of and rather than by the differential equation; the time integral starts at where the exponent vanishes; and the choice principles used are exactly those declared: AC and DC enter through the FTC package of [F3], and AC is the ambient assumption of [F7].
Source notes
Yoshida, Lemmas 6.8.1-6.8.3, computes the step-potential resolvent at the origin by an ODE matching argument after identifying the resolvent kernel of the Gaussian semigroup. The proof above separates the two analytical inputs: the Gaussian resolvent kernel from the time integral of the heat kernel, and the Duhamel identity for the potential , which is proved pathwise from the fundamental theorem for absolutely continuous functions. The conditional expectation step uses the future-path Markov property of the page and takes the bounded -measurable factor out.
Brownian positive occupation time has the arcsine law
Statement
Let be a standard Brownian motion Brownian motion, choose its all-path continuous jointly measurable version , and for let be the occupation time of the positive half-line up to time . Then for every , and has the arcsine density Thus the occupation-time proportion of Brownian motion has the same distribution as the last-zero proportion of the theorem The last Brownian zero has the arcsine law, although the two random variables are of a different nature.
Facts & Assumptions
Given: AC, a standard Brownian motion with its all-path continuous jointly measurable version , , and reals .
With the function satisfies , and its defining integral is an -integral against the occupied time. Brownian step-potential resolvent at zero
Every path of is continuous and the evaluation is jointly measurable, so is measurable and is a random variable with . Any two such jointly measurable indistinguishable versions give the same occupation time almost surely by Tonelli. Brownian motion has a jointly measurable continuous version Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Scaling: for the process is again standard Brownian motion, so the occupation times satisfy . Brownian scaling
Tonelli for nonnegative product-measurable integrands. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Substitution and the principal inverse tangent: and is the inverse bijection of . Substitution: if is differentiable on with integrable and is continuous on an interval containing , then Principal arctangent: derivative, integral, power series, and the Gregory–Leibniz series The principal inverse tangent
Stone-Weierstrass: the unital point-separating algebra of polynomials is uniformly dense in . Real Stone–Weierstrass theorem for compact Hausdorff spaces
Dominated convergence justifies interchanging limits with expectations and integrals under an integrable dominating function. Dominated convergence
AC is the ambient assumption of the Brownian and resolvent interfaces. The Axiom of Choice
Proof
By [F2], is a random variable with values in ; by [F3] applied with one has , because the time change maps the set of positive times for to the corresponding set for the scaled motion, and hence has the law of .
The probability measure on with density satisfies for all : substituting turns the integral into , then turns it into , and finally and [F5] give .
For , : [step 1.1] gives , so the left side is , and [F4] equals it to , the integrand being nonnegative and .
For and one has up to the single point , which is Lebesgue-null; hence the function of [F1] satisfies , and [F1] with [step 2.1] yields for all .
The law of and have the same moments: fixing and expanding for and , uniformly on the square, [F7] shows that and for every such ; since [step 3.1] and [step 1.2] make the two sides equal for all , subtracting the two power series gives on an interval, so every coefficient vanishes and all moments agree.
Consequently for every continuous : given , [F6] supplies a polynomial with , and by [step 4.1]; taking continuous and applying [F7] to both sides gives for .
By [step 1.1], for every and , which is the displayed distribution function.
Differentiating the distribution function on gives ; this density is integrable on (substitute ), so it is the density of and both endpoints carry zero mass.
The boundary cases are covered: gives and gives ; the value of the substitution is the endpoint of the principal branch of [F5]; the parameters satisfy in [step 3.1] and in [step 4.1]; the occupation time is taken over the half-line so the single instant is excluded by a null set; and AC enters only through [F8].
Source notes
Yoshida, Proposition 6.8.4, obtains the occupation-time arcsine law from the Laplace transform produced by the step-potential resolvent of Lemmas 6.8.1-6.8.3. The proof above proves the same transform identity directly from the resolvent lemma of this page, identifies the arcsine law as the unique probability measure on with that transform by moment matching and Stone-Weierstrass, and transfers the result from to by scaling.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Nobuo Yoshida, Probability Theory, Section 6.3 (subcritical Hölder) and Section 6.4, Proposition 6.4.1 (the proved alpha > 1/2 statement)
- Rick Durrett, Probability: Theory and Examples, fifth edition, Section 7.1, Theorem 7.1.6 and the remark following it
- Rick Durrett, Probability: Theory and Examples, fifth edition, Theorem 7.1.6
- Perla Sousi, Advanced Probability, Theorem 6.41
- Gregory F. Lawler, Stochastic Calculus: An Introduction with Applications, Section 2.8
- Rick Durrett, Probability: Theory and Examples, fifth edition, Section 7.1 (the path is not of bounded variation)
- Gregory F. Lawler, Stochastic Calculus: An Introduction with Applications, Theorems 2.8.1-2.8.2
- Rick Durrett, Probability: Theory and Examples, fifth edition, Section 7.1 (Brownian path normalization)
- Perla Sousi, Advanced Probability, Chapter 6 (Brownian motion as a random continuous path)
- Perla Sousi, Advanced Probability, Theorem 6.39
- Rick Durrett, Probability: Theory and Examples, fifth edition, Section 7.4.1
- Rick Durrett, Probability: Theory and Examples, fifth edition, Section 7.4.1 (the zero set has measure zero)
- Perla Sousi, Advanced Probability, Theorem 6.39, printed p. 71
- Rick Durrett, Probability: Theory and Examples, fifth edition, Lemma 1.2.6 and the Gaussian tail estimates (8.5.2) in the proof of Theorem 8.5.1
- Rick Durrett, Probability: Theory and Examples, fifth edition, Theorem 8.5.1
- Rick Durrett, Probability: Theory and Examples, fifth edition, Theorem 8.5.1 with Brownian time inversion
- Nobuo Yoshida, Probability Theory, Section 6.3 (subcritical Hölder regularity and the critical-boundary remark)
- Gregory F. Lawler, Stochastic Calculus: An Introduction with Applications, Section 2.8 (partition-dependence warning)
- Rick Durrett, Probability: Theory and Examples, fifth edition, Example 7.4.3 and equation (7.4.7)
- Nobuo Yoshida, Probability Theory, Lemmas 6.8.1-6.8.3, printed pp. 214-216
- Nobuo Yoshida, Probability Theory, Proposition 6.8.4, printed pp. 216-217