Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck pass
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 S0=0 and, whenever Sn<∞, Sn+1=Sn+inf⁡{t≥0:∣XSn+t−XSn∣=1}. If a time is infinite, all subsequent times are set to infinity. Then all Sn are finite and S0<S1<S2<⋯ on a measurable probability-one event. The segments En=(Sn+1−Sn, (X(Sn+t)∧Sn+1−XSn)t≥0),n≥0, 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 (XS1,XS2−XS1,…) are independent fair signs, and (0,XS1,XS2,…) is a simple symmetric random walk on the integers. In particular the original numbering E1,E2,… has the same claims and its displacements are independent of XS1.

Facts & Assumptions

Given: AC and the Brownian process and continuous-path convention in the Example.

[F1]

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 m. The density is even and bounded above by (2π)−1/2. Brownian motion Standard normal and normal laws

[F2]

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 A∩{τ≤t}. Brownian closed-set hitting times are stopping times Continuous-time stopping times and stopped sigma-algebras Natural and usual augmented Brownian filtrations

[F3]

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

[F4]

For C=C([0,∞),R) 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

[F5]

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

[F6]

Closed bounded real intervals are compact; continuous real functions attain their extrema on a nonempty compact set and take all intermediate values. Reflection x↦−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 [a,b] is compact Extreme value theorem: a continuous real function on a nonempty compact subset of 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) A C1 diffeomorphism satisfies the change-of-variables formula for L1 functions

Verification

technique · direct
1.1F1F2F4given

The normalized process X has measurable coordinates, all its paths are continuous, and X0=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 C0 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.

2.1F1F2F5F6step 1.1

For w∈C0 define σ(w)=inf⁡{t≥0:∣w(t)∣=1}. This is measurable: for t≥0, continuity gives {σ≤t}={sup⁡0≤s≤t∣w(s)∣≥1}, 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 σ is strictly positive on C0. For a continuous Brownian W, [F2] makes σ(W) a stopping time. If σ(W)>m, then ∣Wm∣<1; hence [F1] gives P(σ>m)≤P(∣Wm∣<1)≤2/2πm. Continuity from above in [F5] proves σ finite almost surely. At a finite σ, continuity gives Wσ∈{−1,1}.

3.1F4step 2.1

Define the segment map e(w)=(σ(w),(w(t∧σ(w)))t≥0) into [0,∞]×C, and the remainder r(w)(t)=w(σ(w)+t)−w(σ(w)) if σ is finite, and the zero path otherwise. Both are Borel maps. Indeed evaluation (w,s)↦w(s) continuously for finite s: if wj converges uniformly on compact sets and sj 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 t∧∞=t and the zero convention for r; then [F4] proves path-valued measurability. The duration σ is measurable by step 2.1.

4.1F2F3F4step 1.1step 2.1step 3.1

For a continuous Brownian W and its σ, e(W) is measurable for the stopped σ-algebra. Sigma itself is measurable there by its defining tests. For a fixed t and u, on {σ≤u} the value Wt∧σ equals Wt∧σ∧u, which is measurable at time u: approximate t∧σ∧u from below by a finite grid in [0,u], use adaptation and continuity. Thus the Borel inverse images of Wt∧σ, intersected with {σ≤u}, lie in Fu. Rational coordinates and [F4] finish this claim. By [F3], r(W) is independent of Fσ and has Brownian finite-dimensional laws. It is C0-valued by construction; [F4] and the pi-lambda theorem identify its C0 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.

5.1F5step 2.1step 3.1step 4.1

Set W0=X, Wn+1=r(Wn), σn=σ(Wn), En=e(Wn), and Sn=∑j<nσj. These are measurable by step 3.1. Inductively each Wn has the law of X by step 4.1, so each σ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 Wtn=XSn+t−XSn simultaneously for all t, and hence the formulas for Sn and En in the statement. Outside this event the just-defined measurable En provide the promised convention; Sn are extended sums, so subsequent times after infinity stay infinite.

6.1F4step 3.1step 4.1step 5.1

Prove by induction that Wn is independent of Hn=σ(E0,…,En−1) and that the preceding Ej are iid with law ν=law⁡(e(X)). For n=0 this is vacuous. If it holds at n, the pair (e(Wn),r(Wn)) is independent of Hn, since it is a measurable function of Wn. Its components are independent by step 4.1. Thus for A∈Hn and Borel segment and path sets D,L, P(A∩{En∈D}∩{Wn+1∈L})=P(A)ν(D)P(X∈L). For fixed L, the pi-lambda theorem extends this identity from intersections A∩{En∈D} to all of Hn+1. It follows that Wn+1 is independent of Hn+1; taking L to be the whole path space also proves En independent of Hn 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 Wn.

7.1F1F4F6step 2.1step 3.1step 5.1step 6.1

Negation preserves the law of X on C0: 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(σ(w)) on finite σ, zero otherwise, is Borel by the evaluation argument in step 3.1. Also σ(−w)=σ(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(Wn) is a function of En: 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(W0)=XS1. Telescoping gives XSn=∑j<nd(Wj) on the full event in step 5.1, proving the embedded-walk claim.

8.1F5step 2.1step 3.1step 5.1step 6.1step 7.1∎

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 Zn(t)=X(Sn+t)∧Sn+1−XSn and σn=Sn+1−Sn, so En=(σn,Zn). 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.

Zn(t)t1¡10¾nheldjZn(t)j<1(0∙t<¾n)Yn=XSnY0=0Y1Y2d0d1dn=Yn+1¡Yn2f¡1;1g

The arrows below index successive exits, not equal intervals of physical time. By steps 5.1–7.1, the pairs En are iid and the increments dn 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 Wn. The rigorous verification above is independent of this illustration.

Depends on

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