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 . 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 variable for is the image of the standard normal density under multiplication by . 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 -algebras use the tests . 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 -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 -algebra is generated by rational evaluations. A pi-system generates its -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 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 diffeomorphism satisfies the change-of-variables formula for functions
Verification
The normalized process X has measurable coordinates, all its paths are continuous, and everywhere. It retains every finite-dimensional Brownian law, since its coordinates were changed on one measurable null event. By [F4] it is a -valued random element, supported on the closed subspace 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 define . This is measurable: for , continuity gives , and the supremum is over the countable set of rationals in together with t. Continuity, the intermediate value property and attainment of the maximum on a compact interval prove this equality. It also shows is strictly positive on . For a continuous Brownian W, [F2] makes a stopping time. If , then ; hence [F1] gives . Continuity from above in [F5] proves finite almost surely. At a finite , continuity gives .
Define the segment map into , and the remainder if is finite, and the zero path otherwise. Both are Borel maps. Indeed evaluation continuously for finite s: if converges uniformly on compact sets and tends to s, bound by the uniform error on one common compact interval plus continuity of w there. Compose with measurable for each fixed coordinate, using and the zero convention for r; then [F4] proves path-valued measurability. The duration is measurable by step 2.1.
For a continuous Brownian W and its , is measurable for the stopped -algebra. Sigma itself is measurable there by its defining tests. For a fixed t and u, on the value equals , which is measurable at time u: approximate from below by a finite grid in , use adaptation and continuity. Thus the Borel inverse images of , intersected with , lie in . Rational coordinates and [F4] finish this claim. By [F3], is independent of and has Brownian finite-dimensional laws. It is -valued by construction; [F4] and the pi-lambda theorem identify its law with that of X and promote coordinate independence to independence of every Borel path event. Therefore and are independent, and again has the law of X.
Set , , , , and . These are measurable by step 3.1. Inductively each has the law of X by step 4.1, so each 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 and in the statement. Outside this event the just-defined measurable provide the promised convention; are extended sums, so subsequent times after infinity stay infinite.
Prove by induction that is independent of and that the preceding are iid with law . For n=0 this is vacuous. If it holds at n, the pair is independent of , since it is a measurable function of . Its components are independent by step 4.1. Thus for and Borel segment and path sets D,L, For fixed L, the pi-lambda theorem extends this identity from intersections to all of . It follows that is independent of ; taking L to be the whole path space also proves independent of 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 .
Negation preserves the law of X on : 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 on finite , zero otherwise, is Borel by the evaluation argument in step 3.1. Also and . Step 2.1 makes its value a sign almost surely, so its two probabilities are equal and sum to one. Each displacement is a function of : 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 . Telescoping gives 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 -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.
Remarks
The schematic shows how a segment is encoded after shifting its anchor to zero. Write and , so . The upper-exit case is illustrated; reflection gives the lower-exit case. The polygonal line is only a schematic of the stopping rule, not a claim about Brownian path regularity or a deterministic trajectory. The horizontal dashed part is the stopped path held at its exit value.
The arrows below index successive exits, not equal intervals of physical time. By steps 5.1–7.1, the pairs are iid and the increments are independent fair signs. Step 4.1 applies strong Markov in the usual augmented filtration of each Brownian restart: its remainder is independent of its stopped history. This does not assert independence of the nested entire future processes . The rigorous verification above is independent of this illustration.
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)