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.

A null uncountable random closed set

Example

Almost surely, for every T>0 the Brownian zero set Z intersected with [0,T] is a closed, uncountable set of Lebesgue measure zero. Thus the zero set of a Brownian path is a natural random set that is large in the cardinality sense and simultaneously null for Lebesgue measure; the two notions of size are independent.

Facts & Assumptions

Given: AC and a standard Brownian motion B with zero set Z.

[F1]

For each fixed T<, almost surely λ(Z[0,T])=0. The Brownian zero set has Lebesgue measure zero

[F2]

Almost surely Z[0,T] is uncountable for every T>0. The Brownian zero set is uncountable

[F3]

Z is a closed subset of [0,) containing 0, so Z[0,T] is compact for every T>0. The Brownian zero set

[F4]

AC is the ambient assumption of the Brownian interfaces. The Axiom of Choice

Verification

technique · direct
1.1

Intersecting the probability-one events supplied by [F1] for the positive integer horizons with the single probability-one event of [F2] gives a probability-one event on which nullity holds at every positive integer horizon and uncountability holds at every positive horizon. For arbitrary T>0, choose an integer NT; then λ(Z[0,T])λ(Z[0,N])=0, while uncountability of Z[0,T] follows directly from [F2].

F1F2
2.1

On that event the set Z[0,T] is closed by [F3] and compact, uncountable by [step 1.1], and null by [step 1.1]; the two properties are not in tension because uncountability imposes no lower bound on Lebesgue measure, as the Cantor set shows in the deterministic setting.

step 1.1F3
3.1

The cases are covered: the horizon is positive and finite; simultaneous nullity for all horizons is obtained from the countable integer exhaustion, whereas simultaneous uncountability for all positive horizons is exactly [F2]; the point 0 belongs to Z and to every truncated set but is a singleton of measure zero; and AC enters only through [F4].

step 2.1F4given

Source notes

Sousi, Theorem 6.39, proves that the zero set is closed with no isolated points, hence uncountable, and Durrett's Section 7.4.1 computes its Lebesgue measure as zero. The example collects both facts and contrasts them.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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