Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedPipeline-generated
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.

Smoothing a two-point data law

Example

For z∈Rd, δz denotes the probability concentrated at z. Let d≥1, T>0, a,b∈Rd, α∈[0,1], and μ=αδa+(1−α)δb. Let g:[0,T]→(0,∞) be continuously differentiable with 0<gmin⁡≤g(t)≤gmax⁡<∞, set v(t)=∫0tg(r)2 dr, and define ϕc(z)=(2πc)−d/2exp⁡(−∣z∣2/(2c)) for c>0. For every 0<t≤T, the smoothed law has density

pt(x)=αϕv(t)(x−a)+(1−α)ϕv(t)(x−b).

At time zero its law remains μ. If a=b, or if α is 0 or 1, the displayed density reduces to the single Gaussian centered at the atom carrying all mass.

Facts & Assumptions

Given: d,T,a,b,α, the finite probability measure μ, and the scalar-noise smoothing convention.

[A1]

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

[F1]

For a compactly supported initial law, positive-time smoothing has density pt(x)=∫ϕv(t)(x−z) μ(dz) and initial law μ. Gaussian-smoothed data law and transition density

Proof

Given: The example's parameters and the Gaussian smoothing density in [F1].

1.1A1F1givenalgebra

The measure μ is a Borel probability supported in the closed ball of radius max⁡(∣a∣,∣b∣), so [F1] applies. For 0<t≤T, substitute μ=αδa+(1−α)δb in the defining integral. By the defining property of point masses, integration of any nonnegative Borel function h gives ∫h(z) μ(dz)=αh(a)+(1−α)h(b). Taking h(z)=ϕv(t)(x−z) yields the displayed formula, using ϕc(z)=ϕc(−z). The initial law is μ by [F1].

2.1F1step 1.1algebra∎

If a=b, the two weights sum to one and both Gaussian terms have the same center. If α=1, only the first term remains; if α=0, only the second remains. In each case the stated single Gaussian is normalized and positive by [F1].

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