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.
Successive Brownian exit segments are independent copies
Example
Assume AC and let B be standard Brownian motion. Use the following path convention throughout this example: choose the measurable full event of continuous paths starting at zero supplied by Brownian motion, and replace B by the zero path on its complement. Denote this version by X. It agrees with the original B at every time on one measurable full event; no assertion about the original raw filtration on exceptional paths is made.
Put and, whenever , If a time is infinite, all subsequent times are set to infinity. Then all are finite and on a measurable probability-one event. The segments are independent and identically distributed. This encodes each finite-length segment by its duration and its path held constant after exit; its law is that of a standard Brownian path stopped on first reaching {-1,1}. The proof gives a measurable convention when one of the times is infinite. Consequently are independent fair signs, and is a simple symmetric random walk on the integers. In particular the original numbering has the same claims and its displacements are independent of .
Facts & Assumptions
Given: AC and the Brownian process and continuous-path convention in the Example.
Brownian paths are continuous on a measurable full event and start at zero almost surely; increments are independent centered normals. A N(0,m) variable for m>0 is the image of the standard normal density under multiplication by sqrt(m). The density is even and bounded above by . Brownian motion Standard normal and normal laws
A closed-set hitting time for an everywhere-continuous Brownian motion is a stopping time for its raw natural filtration, and hence its usual augmentation. Stopped sigma-algebras use the tests A intersect {tau<=t}. Brownian closed-set hitting times are stopping times Continuous-time stopping times and stopped sigma-algebras Natural and usual augmented Brownian filtrations
At an almost surely finite stopping time for the usual Brownian filtration, the restarted process is independent of the stopped sigma-algebra and has Wiener finite-dimensional distributions. Values on the infinite-time event are assigned zero by the theorem's convention. Strong Markov property of Brownian motion
For with the uniform-on-compacts topology, its Borel sigma-algebra is generated by rational evaluations. A pi-system generates its sigma-algebra by the pi-lambda theorem. Borel sigma-algebra of continuous path space is generated by coordinates Dynkin's pi-lambda theorem
Probabilities are continuous from above and below; countable unions of null events are null. AC supplies the Brownian and strong-Markov interfaces. Basic identities for a probability measure The Axiom of Choice
Closed bounded real intervals are compact; continuous real functions attain their extrema on a nonempty compact set and take all intermediate values. Reflection x maps to -x preserves Lebesgue integration by the change-of-variables formula (absolute Jacobian one); AC supplies its Countable Choice hypothesis. Heine-Borel by bisection: every closed bounded interval is compact Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions
Verification
The normalized process X has measurable coordinates, all its paths are continuous, and X_0=0 everywhere. It retains every finite-dimensional Brownian law, since its coordinates were changed on one measurable null event. By [F4] it is a C-valued random element, supported on the closed subspace C_0 of paths starting at zero. Work with the usual augmentation of this process, as defined in [F2], when applying strong Markov. This does not transfer a stopping-time claim to the original B filtration.
For w in C_0 define . This is measurable: for t>=0, continuity gives , and the supremum is over the countable set of rationals in [0,t] together with t. Continuity, the intermediate value property and attainment of the maximum on a compact interval prove this equality. It also shows sigma is strictly positive on C_0. For a continuous Brownian W, [F2] makes sigma(W) a stopping time. If sigma(W)>m, then |W_m|<1; hence [F1] gives . Continuity from above in [F5] proves sigma finite almost surely. At a finite sigma, continuity gives .
Define the segment map into , and the remainder if sigma is finite, and the zero path otherwise. Both are Borel maps. Indeed evaluation (w,s) maps to w(s) continuously for finite s: if w_j converges uniformly on compact sets and s_j tends to s, bound by the uniform error on one common compact interval plus continuity of w there. Compose with measurable sigma for each fixed coordinate, using t wedge infinity=t and the zero convention for r; then [F4] proves path-valued measurability. The duration sigma is measurable by step 2.1.
For a continuous Brownian W and its sigma, e(W) is measurable for the stopped sigma-algebra. Sigma itself is measurable there by its defining tests. For a fixed t and u, on {sigma<=u} the value W_{t wedge sigma} equals W_{t wedge sigma wedge u}, which is measurable at time u: approximate t wedge sigma wedge u from below by a finite grid in [0,u], use adaptation and continuity. Thus the Borel inverse images of W_{t wedge sigma}, intersected with {sigma<=u}, lie in F_u. Rational coordinates and [F4] finish this claim. By [F3], r(W) is independent of F_sigma and has Brownian finite-dimensional laws. It is C_0-valued by construction; [F4] and the pi-lambda theorem identify its C_0 law with that of X and promote coordinate independence to independence of every Borel path event. Therefore e(W) and r(W) are independent, and r(W) again has the law of X.
Set , , , , and . These are measurable by step 3.1. Inductively each W^n has the law of X by step 4.1, so each sigma_n is finite and strictly positive almost surely by step 2.1. Their countable intersection is a measurable full event by [F5]. On it, finite induction gives simultaneously for all t, and hence the formulas for S_n and E_n in the statement. Outside this event the just-defined measurable E_n provide the promised convention; S_n are extended sums, so subsequent times after infinity stay infinite.
Prove by induction that W^n is independent of H_n=sigma(E_0,...,E_{n-1}) and that the preceding E_j are iid with law nu=law(e(X)). For n=0 this is vacuous. If it holds at n, the pair (e(W^n),r(W^n)) is independent of H_n, since it is a measurable function of W^n. Its components are independent by step 4.1. Thus for A in H_n and Borel segment and path sets D,L, For fixed L, the pi-lambda theorem extends this identity from intersections A intersect {E_n in D} to all of H_{n+1}. It follows that W^{n+1} is independent of H_{n+1}; taking L to be the whole path space also proves E_n independent of H_n with law nu. Induction proves mutual independence of every finite family of segments, hence the asserted iid sequence. It does not assert independence of the nested entire future processes W^n.
Negation preserves the law of X on C_0: centered independent normal increments are unchanged jointly under sign reversal by the even normal density and reflection substitution in [F6], so finite-dimensional laws agree, and [F4] and pi-lambda give equality of path laws. The map d(w)=w(sigma(w)) on finite sigma, zero otherwise, is Borel by the evaluation argument in step 3.1. Also sigma(-w)=sigma(w) and d(-w)=-d(w). Step 2.1 makes its value a sign almost surely, so its two probabilities are equal and sum to one. Each displacement d(W^n) is a function of E_n: for finite duration it is the stopped path evaluated at that duration. Step 6.1 therefore makes these displacements independent fair signs, including the first d(W^0)=X_{S_1}. Telescoping gives X_{S_n}=sum_{j<n}d(W^j) on the full event in step 5.1, proving the embedded-walk claim.
At time zero X starts at zero and each duration is strictly positive; at exit the value is exactly one of the two endpoints. Infinite durations lie in a measurable null event and have explicit segment/remainder conventions. The empty history in the induction is the trivial sigma-algebra. The claims concern exit segments and signs; no inference about moments of a two-sided exit time is made from a one-sided hitting-time density. Full AC is inherited through [F5]; normalization uses one supplied full event, not a choice of paths.
Source notes
The cited strong Markov theorem supplies independence of each restarted future from its own stopped history. The proof above explicitly factors this with independence of the earlier segments. Symmetry gives fairness directly, so no shifted-law hitting event or two-sided exit-probability supplier is required.
Depends on
- Strong Markov property of Brownian motion
- Brownian closed-set hitting times are stopping times
- Brownian motion
- Continuous-time stopping times and stopped sigma-algebras
- Natural and usual augmented Brownian filtrations
- Borel sigma-algebra of continuous path space is generated by coordinates
- Dynkin's pi-lambda theorem
- Standard normal and normal laws
- Basic identities for a probability measure
- The Axiom of Choice
- Extreme value theorem: a continuous real function on a nonempty compact subset of $\mathbb{R}$ attains a greatest and a least value
- Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on $[a,b]$ takes every value between $f(a)$ and $f(b)$
- Heine-Borel by bisection: every closed bounded interval $[a,b]$ is compact
- A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
115 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
- Perla Sousi, Advanced Probability, Sections 6.5-6.7 (standard reference, not scraped)
- Rick Durrett, Probability: Theory and Examples, fifth edition, Section 7.3 (standard reference, not scraped)