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.
Hitting, return, and visit times
Definition
Let be an adapted Stochastic processes and their finite-dimensional distributions with values in a countable set equipped with . For , define
The infimum of the empty set is . The visit count is the extended nonnegative integer
For a process started at , put and define recursively
Thus a later return time is assigned if the preceding one is infinite; the expression is never used. For every and ,
where the second union is empty when . Adaptedness makes these events belong to , so these are stopping times under Discrete stopping time.
Depends on
Used by
- Expected exit time solves the Poisson equation Corollary
- One-dimensional simple symmetric walk is recurrent Corollary
- Two-dimensional simple symmetric walk is recurrent Corollary
- A bounded harmonic boundary problem without uniqueness Counterexample
- A transient chain can return with positive probability Counterexample
- Different classes can have different recurrence types Counterexample
- Green kernel of a transient chain Definition
- Recurrent and transient states Definition
- Birth–death recurrence through scale products Example
- Communicating classes in a four-state chain Example
- Gambler’s ruin from harmonicity Example
- Green kernel of a biased integer walk Example
- Negative drift gives a finite mean small-set hit Example
- Geometric tail for hitting in a finite irreducible chain Lemma
- Bounded Dirichlet problem for hitting probabilities Theorem
- Equivalent criteria for recurrence and transience Theorem
- First-step equations for nonnegative exit costs Theorem
- Hitting probability as minimal harmonic extension Theorem
- Lyapunov drift bound for hitting times Theorem
- Recurrence and transience are class properties Theorem
- Renewal decomposition at successive returns Theorem
- Superharmonic majorants bound exit costs Theorem
Dependency tree · two levels
5 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
- Durrett, Probability: Theory and Examples, fifth edition (standard reference, not scraped)
- Levin, Peres and Wilmer, Markov Chains and Mixing Times, second edition (standard reference, not scraped)