Use finite cutoff windows to avoid subtracting two infinite masses. Write for the unit disc, on loops surrounding , and . For , let . These increase to all loops in surrounding as .
On the finite-mass windows, the domain-containment events form a pi-system. Indeed, if are simply connected and contain , a simple loop surrounding that lies in both has its filled interior in both. It therefore lies in the component of containing , which is simply connected. Thus, on the support of ,Inclusion-exclusion for the finite deficits givesTaking and subtracting from gives the useful recovery formulaThe assumed generation of the loop sigma-field by domain-containment events and the uniqueness theorem for measures now determine the finite restriction to . Increasing these windows recovers ; conformal transport recovers its restriction to any simply connected domain containing the marked point. If a simply connected domain omits , no loop in it can surround .
The argument uses finite annular deficits. This is the usual local-finiteness convention for these loop measures and is explicitly ensured by the finite logarithmic formula assumed in the continuation. Bare sigma-finiteness must not be used as permission for formal subtraction. This is the recovery of a loop measure from conformal deficits.
Let be the normalized maps, and put . A simple loop in has its interior there, so applying preserves the property of surrounding . There is a disjoint decompositionThe conformal restriction property identifies the measure of the second set with . ThereforeThe composition fixes and has positive derivative there, so it is exactly the normalized map onto . No interchange of infinite differences is needed: the argument is additivity on disjoint sets. The later logarithmic expression is consistent with this identity because .
Let be the outer boundary of a planar compact set applied to the Brownian loop. For the pinned Brownian measure here, its outer boundary is almost surely simple and surrounds its root. If is simply connected, thenThe forward implication uses the fact that filling a compact subset of a simply connected domain cannot leave that domain. For the converse, the Brownian trace is contained in the closed filled interior of its outer boundary, and that interior also lies in . This is precisely why simply connected domains are used.
Let , a pushforward measure on simple loops surrounding . Its deficits areThey agree with those of and . The recovery argument from part (i), now with explicitly finite deficits, givesIf , the measure is zero on every cutoff window and hence zero. The rooted Brownian loop itself is not a simple loop; taking its outer boundary is essential.
Articles by others on the same topic
There are currently no matching articles.