Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Brownian time inversion

Statement

Assume the Axiom of Choice. If B=(Bt)t≥0 is standard Brownian motion, then Y0=0,Yt=tB1/t(t>0) defines another standard Brownian motion. In particular, its continuity at t=0 is part of the conclusion, not an inference from its finite-dimensional laws alone.

Facts & Assumptions

Given: AC and a standard Brownian motion B with one probability-one continuity event A.

[F1]

Brownian motion is centered Gaussian with covariance min⁡(s,t) and a common continuity event; conversely a centered Gaussian process with this covariance and such continuity is Brownian. Brownian motion Gaussian process Brownian covariance is equivalent to independent stationary normal increments

[F2]

Two Gaussian processes with the same mean and covariance functions have equal finite-dimensional laws, including singular vectors and repeated indices. Mean and covariance determine Gaussian finite-dimensional laws

[F3]

On an arbitrary product measurable space, finite-coordinate cylinders generate the cylinder sigma-algebra and form a pi-system. A measurable random element has a probability law. Coordinate maps, finite-coordinate cylinders, and the cylinder σ-algebra Finite-coordinate cylinders form a π-system Random elements and real random variables The law of a random element is a probability measure

[F4]

A lambda-system is closed under nested relative differences and increasing unions; measures are continuous from below; a lambda-system containing a pi-system contains its generated sigma-algebra. Lambda-systems, or Dynkin systems Continuity from below for measures Dynkin's pi-lambda theorem

[F5]

The positive rationals are countable and dense, and for every ε>0 there is m≥1 with 1/m<ε. Q is countably infinite The rationals embed densely in the reals For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε

[F6]

The intersection of two probability-one events has probability one. Basic identities for a probability measure

[F7]

AC is inherited through the Gaussian and Brownian interfaces. The Axiom of Choice

Proof

technique · direct
1.1F1algebra

For any finite positive times t1,…,tn and coefficients uj, the linear combination ∑j=1nujYtj=∑j=1nujtjB1/tj is normal by [F1]. Appending any occurrences of t=0 only appends deterministic zero coordinates. Hence Y is a centered Gaussian process, including repeated-time and singular finite vectors.

2.1F1F2step 1.1algebra

For 0<s≤t, Cov⁡(Ys,Yt)=stCov⁡(B1/s,B1/t)=stmin⁡(1/s,1/t)=s. If s=0, both sides of the required identity are zero. Thus Cov⁡(Ys,Yt)=min⁡(s,t) for all s,t≥0. By [F2], Y and B have the same finite-dimensional laws.

3.1F3F4step 2.1

Let I=Q∩(0,∞) and define ΦB,ΦY:Ω→RI by their coordinates. Each map is measurable for the cylinder sigma-algebra: the sets whose inverse images are measurable form a sigma-algebra containing every coordinate inverse image, hence all finite-coordinate cylinders and their generated sigma-algebra. Their pushforward laws λB,λY are therefore probabilities by [F3]. Step 2.1 makes them equal on every finite-coordinate cylinder. The class of cylinder-measurable sets on which they agree is a lambda-system by normalization, nested finite differences, and continuity from below; [F3]--[F4] therefore give λB=λY.

4.1F1F3F5F6step 3.1

In RI put H=⋂m≥1⋃N≥1⋂q∈I, 0<q<1/N{x:∣x(q)∣<1/m}. This is cylinder-measurable because all three index sets are countable by [F5]. The event A0=A∩{B0=0} has probability one by [F1] and [F6]. On A0, continuity of B at zero gives ΦB∈H, so λB(H)=1. Equality from step 3.1 gives P(ΦY∈H)=λY(H)=1.

5.1F5F6step 4.1

On A, t↦Yt=tB1/t is continuous for every t>0. Fix ω∈A with ΦY(ω)∈H and ε>0. Choose m with 1/m<ε by [F5], and then N from the definition of H. For every t∈(0,1/N), fix an enumeration of the rationals and, for each integer k≥1, let qk be its least-indexed member of I∩(0,1/N) within 1/k of t; density in [F5] makes this canonical sequence converge to t. Continuity gives Yqk(ω)→Yt(ω). Since ∣Yqk(ω)∣<1/m for all k≥1, we get ∣Yt(ω)∣≤1/m<ε. Therefore Yt(ω)→0=Y0(ω) as t↓0. By [F6], the set of such ω has probability one, so Y has one common continuity event on [0,∞).

6.1F1F2F7step 1.1step 2.1step 5.1∎

Steps 1.1--2.1 give the centered Gaussian covariance characterization, and step 5.1 gives path continuity; [F1] therefore makes Y standard Brownian motion. The formula at t=0 is separately defined because 1/t is unavailable there. Empty finite lists are vacuous, singleton and repeated-time laws were included in step 1.1, and AC is used only through [F1]--[F2], not in the fixed countable rational argument.

Source notes

Sousi Theorem 6.7 and Yoshida Proposition 6.1.5 use equality of the rational finite-dimensional laws and positive-time continuity to obtain continuity at zero. Steps 3.1--5.1 spell out the intervening cylinder-law and measurable-event arguments.

Depends on

Used by

Dependency tree · two levels

75 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