Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Closed form for a Gaussian exponential mixture

Statement

Assume AC. For ρ>0, v≥0, and s∈R, let πρ=N(0,1/ρ) under the normal-law convention of Standard normal and normal laws. Then ∫Rexp⁡ ⁣(λs−vλ22) πρ(dλ)=ρv+ρexp⁡ ⁣(s22(v+ρ)).

Facts & Assumptions

Given: Assume AC, ρ>0, v≥0, and s∈R.

[F1]

Standard normal and normal laws: N(m,σ2) is the law of the affine image z↦m+σz of the standard normal law, whose density is e−z2/2/2π.

[F2]

Change of variables for expectation: Integrating a nonnegative measurable function against a random element's law equals its expectation on the underlying space.

[F3]

The standard normal density has total mass one: The standard normal density e−z2/2/2π integrates to one.

[F4]

A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: If T:U→V is a C1 diffeomorphism between open subsets of Rn and f:V→[0,∞] is Lebesgue measurable, then, assuming countable choice, ∫Vf(y) dλn(y)=∫Uf(T(x))∣det⁡DT(x)∣ dλn(x).

[F5]

Continuous functions on Euclidean spaces are Borel measurable and Assuming countable choice, every Borel subset of Rn is Lebesgue measurable: Under countable choice, every continuous function on R is Borel measurable, and every Borel set is Lebesgue measurable.

[A1]

The Axiom of Choice: AC asserts that every family of nonempty sets has a choice function; it is assumed here.

[A2]

The Axiom of Countable Choice (ACω): AC implies countable choice, so the countable-choice premise of [F4] follows from the assumed AC.

Proof

1.1givenF1F2F5F6A1A2

Let Z have the standard normal law. By [F1] and [F6], Z/ρ has law πρ; [F2] and the density in [F1] give I=∫Rexp⁡ ⁣(sz/ρ−vz2/(2ρ))e−z2/22π dz, with a continuous nonnegative integrand, which [F5] makes Lebesgue measurable.

2.1F3F4F5F6A2step 1.1algebra∎

Set a=(v+ρ)/ρ>0 and c=sρ/(v+ρ). Completing the square in [step 1.1] gives I=es2/[2(v+ρ)]∫Re−a(z−c)2/22π dz. The map T(y)=c+y/a has the C1 inverse T−1(z)=a(z−c), so it is a diffeomorphism from R to R, and ∣T′(y)∣=1/a. The function g(z)=e−a(z−c)2/2/2π is continuous and nonnegative, hence Lebesgue measurable by [F5]. By [A2], AC supplies the countable-choice hypothesis of [F4]; applying [F4] to g and T gives ∫Rg(z) dz=1a∫Re−y2/22π dy=1a by [F3]. Therefore I=ρ/(v+ρ)es2/[2(v+ρ)].

Depends on

Used by

Dependency tree · two levels

57 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