How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Brownian paths are nowhere 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.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
38 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Nobuo Yoshida, Probability Theory, Section 6.3 (subcritical Hölder) and Section 6.4, Proposition 6.4.1 (the proved alpha > 1/2 statement) (standard reference, not scraped)
- Rick Durrett, Probability: Theory and Examples, fifth edition, Section 7.1, Theorem 7.1.6 and the remark following it (standard reference, not scraped)