Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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 singular line law has a smooth positive-time density

Example

Let λ1 be one-dimensional Lebesgue measure and define μ(A)=λ1({u∈[0,1]:(u,0)∈A}) for every Borel A⊆R2. The box measure formula gives λ1([0,1])=1, so μ is a Borel probability supported on L=[0,1]×{0}. Let g:[0,T]→(0,∞) be continuously differentiable with 0<gmin⁡≤g(t)≤gmax⁡<∞ and set v(t)=∫0tg(r)2 dr. For every t>0, the Gaussian convolution of μ has the density

pt(x1,x2)=12πv(t)∫01exp⁡ ⁣(−(x1−u)2+x222v(t))du.

The initial law μ is singular with respect to two-dimensional Lebesgue measure, meaning it assigns mass one to a Borel set of planar Lebesgue measure zero, while pt is strictly positive and infinitely differentiable in (x1,x2) for each t>0.

Facts & Assumptions

Given: A uniform random variable on [0,1], the embedded line-supported law, and the compactly supported scalar-noise Gaussian smoothing setup.

[A1]

The full Axiom of Choice is inherited from the Gaussian smoothing and probability interfaces. The Axiom of Choice

[A2]

Countable Choice is assumed by the box-measure theorem used below; the item's SDE and smoothing interfaces also carry the stronger Full AC assumption. The Axiom of Countable Choice (ACω)

[F1]

For any compactly supported probability law in R2, the positive-time law has the explicit Gaussian-convolution density and is strictly positive. Gaussian-smoothed data law and transition density

[F2]

The convolution density is infinitely differentiable in space for each positive time. Gaussian smoothing density and forward equation

[F4]

The law of a measurable map is its pushforward probability measure. Law or distribution of a random element

Proof

Given: The example's random vector and the Gaussian smoothing setup.

1.1A2F3F4givenalgebra

The map u↦(u,0) is continuous and hence Borel measurable; [F4] makes the formula in the statement its pushforward measure, and [A2, F3] give its total mass λ1([0,1])=1. It assigns mass one to the Borel segment L. For each integer n≥1, the segment lies in the rectangle [0,1]×[−1/n,1/n], whose Lebesgue area is 2/n by [F3]. Therefore its outer measure is at most 2/n for every n, hence its Lebesgue measure is zero. Since μ(L)=1 and Lebesgue measure of L is zero, μ is singular with respect to two-dimensional Lebesgue measure.

2.1A1F1F2step 1.1given∎

Applying the convolution formula [F1] to μ gives pt(x)=∫01ϕv(t)(x−(u,0)) du. In dimension two, ϕv(t)(x−(u,0))=(2πv(t))−1exp⁡(−((x1−u)2+x22)/(2v(t))), which is the displayed expression. The integrand is strictly positive for every u, so its integral over a unit interval is strictly positive; [F2] gives infinite spatial differentiability for every t>0. Thus the initial singularity does not prevent positive-time smoothing.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

41 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