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 probability as minimal harmonic extension
Statement
Assume AC (The Axiom of Choice). Let be a Markov chain with transition kernel on an at most countable state space , transition matrix , and let . Define . Then where is the support-restricted nonnegative kernel action. Moreover, for every finite-valued satisfying on and on , one has for every .
Facts & Assumptions
Given: AC, a countable-state Markov chain, , and for the minimality claim a finite-valued nonnegative with on and on .
The Axiom of Choice states that every family of nonempty sets has a choice function; it is assumed by the canonical-law and conditional-expectation/Markov suppliers used below. (The Axiom of Choice)
, so at a start in . (Hitting, return, and visit times)
The infimum of the empty set is . (Hitting, return, and visit times)
For nonnegative , , omitting zero transition weights. (Nonnegative kernel action and finite drift)
A measure on a countable discrete space is the sum of its singleton weights; for those weights are . (Every measure on a countable discrete space is its weighted sum of Dirac measures)
For bounded product-measurable , is measurable and almost surely. (Markov property for bounded future path functionals)
For bounded measurable , almost surely. (Bounded-function form of the Markov property)
Under , one has almost surely. (Initial distribution of a Markov chain)
For nonnegative measurable , is characterized by its event integrals, and increasing nonnegative limits pass through conditional expectation almost surely. (Conditional monotone convergence)
For bounded real , . (Basic algebra and order properties of conditional expectation)
Fatou's lemma gives for nonnegative measurable . (Fatou's lemma)
Increasing sequences of nonnegative measurable functions pass to the limit under the nonnegative integral. (Monotone convergence for the integral)
A nonnegative simple measurable function has finite range. (Nonnegative simple measurable functions)
The nonnegative Lebesgue integral is defined as the supremum of the simple integrals of nonnegative simple minorants. (The nonnegative Lebesgue integral)
For on disjoint measurable sets, its simple integral is . (The integral of a nonnegative simple function)
For every nonnegative simple measurable , its nonnegative Lebesgue integral equals its simple integral. (The nonnegative integral agrees with the simple integral on simple functions)
A nonnegative extended series is the supremum of its increasing finite partial sums. (Series in the nonnegative extended real line)
Proof
If is finite or countably infinite, fix an increasing finite exhaustion (using a fixed enumeration when is infinite), and for put . Each is bounded and simple by [F12]; the nonnegative integral [F13], its simple-function agreement [F15], the simple integral formula [F14], the atomic weights [F4] and [F2] give . As , [F11] passes the integrals to , while the finite sums increase to the support-restricted extended row sum by [F16] and [F3]; thus , with zero weights omitted and no formed.
If , there is no state or initial law to check; if , then by [F1, F17], so and follows from ; if , every start has and , while every admissible is also ; in general, [F1, F7] give whenever .
Define , a bounded product-measurable path functional. By [F5], is measurable and ; for , hitting is equivalent to the shifted path hitting it, so [F9] gives . The bounded one-step identity [F6], [F7], and expectation preservation [F9] identify this as ; step 1.1 then gives .
For any finite-valued nonnegative and each , use the finite-support truncations from step 1.1. The bounded one-step identity [F6] and step 1.1 give ; since , conditional monotone convergence [F8] and the row-sum limit in step 1.1 yield almost surely, with its event-integral characterization available even when the conditional value is infinite.
Fix , put , , and by [F1]. If , then on one has and ; [F8] and step 2.2 give . On , , and on , and . Since by [F7], induction from proves and integrability for every finite .
On , for every , while on all ; hence . Fatou [F10] and step 3.1 give for , and step 1.2 covers , , and . A one-state absorbing chain is included by those same two set cases, and the finite-row argument in step 1.1 covers deterministic transitions. AC [A1] is used for the canonical laws and the conditional-expectation/Markov suppliers; the row exhaustion uses the supplied countability witness, with no extra choice. The result asserts minimality and no biconditional.
Depends on
- The Axiom of Choice
- Hitting, return, and visit times
- Transition matrices and n-step probabilities
- Nonnegative kernel action and finite drift
- Every measure on a countable discrete space is its weighted sum of Dirac measures
- Bounded-function form of the Markov property
- Markov property for bounded future path functionals
- Conditional monotone convergence
- Series in the nonnegative extended real line
- Nonnegative simple measurable functions
- The nonnegative Lebesgue integral
- The integral of a nonnegative simple function
- The nonnegative integral agrees with the simple integral on simple functions
- Monotone convergence for the integral
- Basic algebra and order properties of conditional expectation
- Fatou's lemma
- Initial distribution of a Markov chain
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
54 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)
- Roch, Lecture Notes on Measure-Theoretic Probability Theory, Note 24 (standard reference, not scraped)