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.
Absorbing gambler's-ruin chain
Statement
Assume Choice. Fix and , put , and take . The gambler's-ruin transition matrix is with all other entries zero. It is an absorbed kernel on , and first entrance into is a hitting time. After a finite hit, the chain restarts at—and remains at—the boundary point hit.
Facts & Assumptions
Given: as displayed and a chain with this transition matrix.
Absorption on replaces every row at by and leaves the rows on unchanged. (Killed and absorbed transition kernels)
The absorbed construction is a probability kernel. (Killed and absorbed kernels are probability kernels)
At a measurable hitting time, the conditional future path law is the canonical chain law started from the hit state. (The post-hitting chain restarts from the hit state)
Verification
For , the only row masses are and , which are nonnegative and [F1, F2] sum to one. At and the rows are the corresponding Dirac masses. Thus these rows are exactly [F1] applied to any base kernel having the displayed interior transitions, and [F2] verifies the kernel. When there are no interior rows; when or the interior motion is deterministic.
Define [given] Then , so it is a hitting time. If , then ; otherwise it may be infinite in the general eventwise formulation.
By [F3], on the conditional future is the chain started [F3, step 1.1, step 1.2] from . Step 1.1 gives , so every subsequent coordinate equals the same boundary state. Constants zero and one give respectively zero and the finite-hit event in the eventwise formula. Choice is used only through [F3].
Depends on
Used by
Nothing in the library uses this result yet.
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
- Levin, Peres, Wilmer, Markov Chains and Mixing Times, Section 2.1 (standard reference, not scraped)