Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

Killed and absorbed transition kernels

Definition

Let K be a probability kernel on (E,E) and D∈E. The kernel absorbed on D is the kernel candidate on E defined by KDabs(x,A)=1D(x)1A(x)+1Dc(x)K(x,A),A∈E. Thus every x∈D has the Dirac transition δx, while transitions from Dc are unchanged. For killing, adjoin a point Δ∉E and equip EΔ=E⊔{Δ} with EΔ={A:A∈E}∪{A∪{Δ}:A∈E}. The kernel killed upon exiting D is KDkill(x,B)={K(x,B∩D)+K(x,Dc)1B(Δ),x∈D,1B(Δ),x∈Dc∪{Δ},B∈EΔ. In particular, a start outside D is killed immediately and the cemetery is absorbing. If D=E, killing never occurs from E; if D=∅, every start is sent to Δ. These formulas are choice-free.

Remarks

The following schematics compare the two modifications. An arrow to a set denotes a transition law on that set, not a transition to a single state. For absorption, the loop at x∈D has total mass one; from y∈Dc the entire original law is retained.

AbsorptiononDx2Dy2DcE1(±x)K(y;¢)

For killing, the upper arrow retains the measure A↦K(x,A∩D) on D; the other arrow redirects all exit mass to Δ. Every outside start goes to Δ with mass one, and Δ then stays fixed.

KillinguponexitingDx2DDy2Dc¢K(x;¢\D)K(x;Dc)11

The diagrams illustrate the formulas in the Definition and do not impose a finite state space or any additional assumptions. In the boundary case D=E, there are no outside starts and K(x,Dc)=0 for x∈E; for D=∅, the killing diagram has only the transitions to the cemetery. The definition is independent of these illustrations.

Depends on

Used by

Dependency tree · two levels

3 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