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.

Finite-chain hitting time and survival law

Definition

Let X be the finite state set, P its row-transition matrix, M⊆X the marked set, U=X∖M, and PUU the principal submatrix indexed by U. For an initial probability row vector μ, the hitting-time survival law is

Pr⁡μ(τM>t):=μUPUU t1U,t∈N0,

where μU is the restriction of μ to U and 1U is the all-ones column vector on U. This is the finite sum of probabilities of all length-t paths that remain in U; it does not require a path-space construction. For U=∅ the right side is 0; for M=∅ it is 1.

The hitting time τM:=inf⁡{t≥0:Xt∈M} is the N0∪{∞}-valued variable determined by this survival law. Its extended expectation is EμτM=∑t≥0Pr⁡μ(τM>t), and a constant-success hitting bound is a specified integer t for which Pr⁡μ(τM≤t) is bounded below by a positive constant. These resource conventions are kept separate.

Depends on

Used by

Dependency tree · two levels

8 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