Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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 positive-variance normal law has its location-scale density

Statement

Assume AC. For m∈R and σ>0, the normal law N(m,σ2) of Standard normal and normal laws has Lebesgue density gm,σ(y)=1σe−((y−m)/σ)2/22π=12πσ2e−(y−m)2/(2σ2).

Facts & Assumptions

Given: AC, the standard-normal probability law and its specified density, and m∈R, σ>0.

[F1]

N(m,σ2) is the pushforward of N(0,1) by x↦m+σx, and N(0,1) has density ϕ(x)=e−x2/2/2π. Standard normal and normal laws, The standard normal density has total mass one

[F3]

Under Countable Choice, a C1 diffeomorphism transforms nonnegative Lebesgue integrals by its absolute Jacobian. A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions

[A1]

AC holds; it is used in [F1] and implies the Countable Choice hypothesis of [F3]. The Axiom of Choice

Proof

technique · apply the one-dimensional change-of-variables formula to the affine normal-law map

Given: The hypotheses in the Statement.

1.1A1F2F3given

By [A1] and [F2], Countable Choice holds, so the change-of-variables theorem [F3] applies. For σ>0, the map T(x)=m+σx is a C1 diffeomorphism of R with derivative σ.

2.1F1F3step 1.1∎

For any Borel set B⊆R, apply [F3] to the nonnegative Borel function y↦1B(y)ϕ((y−m)/σ)/σ. The change of variables gives ∫B1σϕ((y−m)/σ) dy=∫R1B(m+σx)ϕ(x) dx=N(m,σ2)(B), where the last equality is the pushforward identity in [F1]. Therefore the displayed function is a density on every Borel set, proving the statement.

Depends on

Used by

Dependency tree · two levels

37 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