Reflection principle (Wiener process)

Reflect a Wiener path after its first hitting time of a level to obtain another process with the same law, converting barrier-crossing events into endpoint-distribution identities.

Version

v2 · 2026-08-30 · History

Domain-specific #

2644

Origin domain

probability theory

Subdomain

brownian motion and hitting times

Core Idea

The reflection principle states that reflecting a standard Wiener path about level \(a\) after its first hitting time \(\tau_a=\inf\{t:W_t=a\}\) produces another Wiener process with the same distribution. On the event that the path hits the barrier, the strong Markov property makes the post-hitting increments an independent Brownian motion; sign symmetry permits those increments to be negated without changing their law, so the reflected continuation is distributionally indistinguishable from the original.

Its autonomous residual is the stopping-time-conditioned reflection symmetry of Brownian paths and its barrier-event bijection, rather than reflection geometry generally or the Markov property alone.

Scope of Application

Reflection principle (Wiener process) applies when the analyst can specify a standard Wiener process \((W_t)_{t\geq0}\), a positive level \(a\), its first hitting time \(\tau_a\), and a fixed time horizon and establish that the path transformation fixes the trajectory through its first barrier hit and reflects only the subsequent increments, while the transformed process retains the Wiener law. The entry treats the classical standard-Wiener theorem; applications to finance, queues, diffusions, or PDEs require their own model assumptions and are not operational guidance.

Clarity

A clear claim names the carrier, governing rule, assumptions, and recognition test. This matters because reflection principle can also name combinatorial path-counting arguments or PDE image constructions, so the Wiener carrier and first-hitting transformation must be explicit. The disciplined statement is that the object counts as Reflection principle (Wiener process) exactly when the path transformation fixes the trajectory through its first barrier hit and reflects only the subsequent increments, while the transformed process retains the Wiener law

Manages Complexity

The abstraction compresses one- and two-sided barriers, Brownian starting points, running maxima, first-passage distributions, drift-adjusted formulas, and related random-walk reflection arguments into a stable carrier, rule, invariant, and failure boundary. It makes comparison tractable while retaining the variables that control validity.

Compression can hide assumptions. A responsible use therefore declares barrier level, time horizon, starting point, drift, variance normalization, stopping-time definition, endpoint event, maximum event, continuity, and equality-in-law convention and returns to the full diagnostic whenever a convention or boundary case changes.

Abstract Reasoning

1. Type the carrier. Establish a standard Wiener process \((W_t)_{t\geq0}\), a positive level \(a\), its first hitting time \(\tau_a\), and a fixed time horizon and reject examples from a different problem. 2. Lock the rule. Express that the path transformation fixes the trajectory through its first barrier hit and reflects only the subsequent increments, while the transformed process retains the Wiener law independently of one notation or implementation.

Knowledge Transfer

Transfer within probability theory is strong when new cases preserve the same carrier, mechanism, and diagnostic. The move from For \(a>0\), the principle gives \(\Pr(\sup_{0\leq s\leq t}W_s\geq a)=2\Pr(W_t\geq a)\). to The distribution of the first hitting time of a positive level can be obtained from the complementary distribution of the running maximum. demonstrates that continuity.

Relationships to Other Abstractions

Current abstraction Reflection principle (Wiener process) Domain-specific

Parents (1) — more general patterns this builds on

• Reflection principle (Wiener process) is a kind of Symmetry Prime

  The proposed strict upward parent is prime:symmetry.

Hierarchy path (1) — routes to 1 parentless root

• Reflection principle (Wiener process) → Symmetry

Neighborhood in Abstraction Space

Reflection principle (Wiener process) sits in a sparse region of the domain-specific corpus (61^st percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Stochastic Processes & Markov Dynamics (38 abstractions)

Nearest neighbors

• Reflected Brownian motion — 0.90
• Brownian meander — 0.89
• Borel right process — 0.86
• Geometric Brownian motion — 0.86
• Transition-rate matrix — 0.85

Computed from structural-signature embeddings · 2026-09-08