Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Root-L2 Hellinger distance for dominated laws

Definition

Let (X,A) be a measurable space and let P,Q be probability measures (Probability measures and probability spaces) on it, both dominated by a specified common sigma-finite positive measure μ as in Dominated statistical experiments. For supplied finite-valued nonnegative measurable density representatives p=dP/dμ and q=dQ/dμ in the convention of Likelihood densities, the root-L2 Hellinger distance is

h(P,Q):=(∫(p−q)2 dμ)1/2.

The square roots are measurable: for every real r, {p>r} is the whole space if r<0 and equals {p>r2} if r≥0, and the same holds for q (Threshold characterisations of real-valued and extended-real-valued measurability). The arithmetic and lattice rules make the nonnegative integrand measurable (Arithmetic and lattice operations preserve measurability whenever they are defined). It is integrable because (p−q)2≤p+q and the integral is additive on nonnegative functions (Additivity of the nonnegative Lebesgue integral), so its integral is at most P(X)+Q(X)=2.

The generic density-selection convention Likelihood densities assumes the Axiom of Choice The Axiom of Choice. When p and q are explicitly given, this displayed integral requires no further choice.

Depends on

Used by

Dependency tree · two levels

36 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