Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)
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.

Measure kernel and probability kernel

Definition

A measure kernel from (S,Σ) to (T,T) is a map K:S×T[0,] such that, for every sS, AK(s,A) is a measure on (T,T), and for every AT, sK(s,A) is Σ-measurable. Measures and measurability have the meanings in Measures on sigma-algebras and A measurable function between measurable spaces; the evaluation functions use the Borel sigma-algebra on [0,].

A probability kernel satisfies K(s,T)=1 for every s. A finite kernel satisfies K(s,T)< for every s; there need not be a common bound on these masses. A uniformly sigma-finite kernel, in the convention of this page, comes with a specified sequence TnT increasing to T such that K(s,Tn)< for every s and n. This is a common measurable exhaustion, not a bound uniform in s. A finite kernel has the constant exhaustion Tn=T. An arbitrary measure kernel is not assumed to have such an exhaustion.

All these requirements are pointwise in s, not merely almost everywhere for an unspecified measure on S. If T is empty, its only measure is zero, so a probability kernel into T can exist only when S is empty. If S is empty, the kernel requirements are vacuous. The zero kernel is finite. This definition selects no versions and uses no choice axiom.

Depends on

Used by

Dependency tree · two levels

6 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