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 be the finite state set, its row-transition matrix, the marked set, , and the principal submatrix indexed by . For an initial probability row vector , the hitting-time survival law is
where is the restriction of to and is the all-ones column vector on . This is the finite sum of probabilities of all length- paths that remain in ; it does not require a path-space construction. For the right side is ; for it is .
The hitting time is the -valued variable determined by this survival law. Its extended expectation is , and a constant-success hitting bound is a specified integer for which 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
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, Chapter 18, §18.4 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, Chapter 8, §8.1 (standard reference, not scraped)