Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Planar coordinate hitting does not imply point hitting

Example

Assume the Axiom of Choice, let W be a standard two-dimensional Brownian motion d-dimensional Brownian motion, let xy in R2 and let Px be the shifted planar law Brownian motion started at x. Then:

  1. under Px, each coordinate increment process tWt(i)xi is a standard one-dimensional Brownian motion, and each coordinate process almost surely visits every neighbourhood of yi at arbitrarily large times;
  2. nevertheless Px(t0:Wt=y)=0, so the two coordinate hitting events do not synchronize: almost surely {t:Wt(1)=y1}{t:Wt(2)=y2}=;
  3. every nonempty open disc is visited almost surely.

Facts & Assumptions

Given: AC, a standard planar Brownian motion W, xy and the shifted law Px.

[F1]

Planar annular exit probability: for 0<ε<zy<R and the law Pz, Pz(Sε<TR)=logRlogzylogRlogε, where Sε,TR are the first hits of the circles of radii ε and R about y. Planar Brownian annular exit probability

[F2]

Under Px, the shifted planar process Wx is standard planar Brownian motion, so each coordinate increment W(i)xi is standard one-dimensional Brownian motion; one-dimensional Brownian motion visits every neighbourhood of every level at arbitrarily large times almost surely. Brownian motion started at x d-dimensional Brownian motion One-dimensional Brownian motion is recurrent One-dimensional Brownian motion hits every point almost surely

[F3]

Countable subadditivity of a probability measure and countable intersections of probability-one events. Basic identities for a probability measure

[F4]

Every nonempty open disc contains a disc with rational centre and rational radius. The rationals embed densely in the reals

[F5]

AC is the ambient assumption of the Brownian construction. The Axiom of Choice Brownian motion started at x

Verification

technique · direct
1.1

Fix R>xy. For every n with 1/n<xy, the event {Ty<TR} is contained in {S1/n<TR}: a path that reaches y before leaving the disc of radius R passes through the circle of radius 1/n about y first, by continuity. Hence by [F1], Px(Ty<TR)limnlogRlogxylogRlog(1/n)=0, the denominator tending to +.

F1given
1.2

For a given δ>0 choose 0<ε<min{δ,xy}; then Px(Sε<TR)=logRlogxylogRlogε1 as R, so the ε-circle about y is hit almost surely, hence the disc of radius δ about y is hit almost surely. Applying this to the countably many discs with rational centre and rational radius and intersecting the resulting probability-one events via [F3], while every nonempty open disc contains such a rational disc by [F4], gives the almost-sure statement of assertion 3.

F1F3F4given
1.3

By [F2] each coordinate increment W(i)xi is a standard one-dimensional Brownian motion, so it visits every neighbourhood of the level yixi at arbitrarily large times; equivalently, W(i) visits every neighbourhood of yi at arbitrarily large times almost surely. This is assertion 1, and it does not synchronize the two coordinates.

F2given
2.1

The event {Ty<} is the union over the countably many integers R>xy of the increasing events {Ty<TR}: if Ty< then the path on [0,Ty] is a compact subset of R2, hence stays in some disc of integer radius about y, and conversely Ty<TR< implies Ty<. By [F3] and step 1.1, Px(Ty<)RPx(Ty<TR)=0.

F3step 1.1
3.1

By step 2.1 there is a probability-one event on which the planar path never equals y; on that event no time can satisfy both coordinate equations simultaneously, so {t:Wt(1)=y1}{t:Wt(2)=y2}=, even though each of the two sets is almost surely unbounded by step 1.3. This is assertion 2.

step 2.1step 1.3
4.1

The cases are consistent: the point x=y is excluded, so Ty=0 is not possible; the dimension is two, and the polarity statement is not asserted in dimension one, where the same computation fails because the logarithm is replaced by a bounded harmonic function; the radius parameter δ>0 and the inner radius ε are chosen strictly positive. AC is used only through [F5].

F1F5givenstep 3.1

Source notes

Sousi, Section 6.7 on printed pp. 63-64, computes the annular exit probability and concludes that planar points are polar while discs are hit; Durrett, Section 7.4, contains the corresponding discussion. The example separates the two coordinate recurrences from the planar polarity, which is exactly the boundary the surrounding page records.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

69 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