Math-1688 · mathematics · Probability

Math-1688

Topology of planar Brownian trace

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Let $X$ be standard planar Brownian motion on $[0,1]$, and let $T=X[0,1]=\{X_t:0\le t\le1\}$ be its compact trace. A Jordan arc is the image of a continuous injective map from $[0,1]$ into $\mathbb R^2$; equivalently, it is a set homeomorphic to that interval.

Two questions concern the almost-sure topology of this random set. First, does almost every trace have the property that for every pair of distinct points $x,y\in\mathbb R^2\setminus T$, there is a Jordan arc $\Gamma$ containing both points for which $\Gamma\cap T$ is finite? The arc and the finite number of intersections may depend on both the trace and the chosen points; no common bound is requested.

Second, enumerate the connected components of the open complement as $A_1,A_2,\ldots$, including its unbounded component, and set \[ K=T\setminus\bigcup_{j\ge1}\partial A_j. \] Is $K$ almost surely totally disconnected, meaning that every connected subset of $K$ contains at most one point?

Boundaries are taken in the ordinary Euclidean topology. The complement has at most countably many components, so the displayed union is unambiguous. Both assertions are pathwise statements: the first quantifies over all exterior point pairs on one probability-one event, rather than allowing a different exceptional null event for each deterministic pair. The second concerns trace points which lie on none of the complementary component boundaries.

Short English statement

Can every two points outside a planar Brownian trace be joined through it only finitely often, and is the trace’s remaining interior topological set totally disconnected?

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.