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

Small-set minorization and geometric drift

Definition

For a probability kernel P on (X,X) (Measure kernel and probability kernel), a measurable set C is (m,ϵ,ν)-small if m≥1 is an integer, 0<ϵ≤1, ν is a probability measure (Probability measures and probability spaces), and Pm(x,A)≥ϵν(A)(x∈C, A∈X). The inequality is pointwise in x and holds for every measurable A.

A geometric drift inequality outside C consists of a finite-valued measurable V:X→[1,∞), constants 0<λ<1 and 0≤b<∞, and PV(x):=∫V(y)P(x,dy)≤λV(x)+b 1C(x)(x∈X). The terms small set and drift are separate hypotheses; neither definition asserts the existence of the other.

When an invariant probability π is specified (Invariant and stationary distribution for a Markov kernel), an extended geometric drift certificate finite π-almost everywhere allows measurable V:X→[1,+∞] with π(V<∞)=1 and the same pointwise inequality, interpreted in the nonnegative extended reals. This is a separate convention from the finite-valued drift function above. The geometric theorem treats this certificate on E={V<∞}; the original finite-valued convention gives the corresponding bound on the whole state space.

Depends on

Used by

Dependency tree · two levels

12 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