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.

Killed finite-state projection and cemetery lift

Definition

Let X be a given nonexplosive chain as in Given countable nonexplosive pure-jump chain with finite rates, with initial law p0 on S, and let F⊆S be finite and nonempty. Its first exit time from F is

τF:=inf⁡{s≥0:Xs∉F},

with τF=0 when X0∉F. Adjoin a new state †∉S and define the killed projection Yt=Xt for t<τF and Yt=† for t≥τF. The killed mass vector is uF(t,x):=P(Yt=x) for x∈F, and the cemetery mass is cF(t):=P(Yt=†). Initially, uF(0,x)=p0(x) for x∈F and cF(0)=p0(S∖F).

For x∈F let λ(x)=∑y≠xq(x,y). The killed principal subgenerator on F has entries (QF)yx=q(x,y) for y≠x in F and (QF)xx=−λ(x); its column sum is −∑y∉Fq(x,y). The cemetery lift is the finite matrix Q~F on F∪{†} with these same entries on F, with

Q~†x=λ(x)−∑y∈Fy≠xq(x,y)=∑y∉Fq(x,y)(x∈F),Q~x†=0(x∈F),Q~††=0.

Every column of Q~F sums to zero and its off-diagonal entries are nonnegative, so it is a finite column generator in the sense of Finite column generator. The cemetery state is absorbing; trajectories that return to F after their first exit remain at † in this projection.

Depends on

Used by

Dependency tree · two levels

10 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