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.
Superharmonic majorants bound exit costs
Statement
Assume AC (The Axiom of Choice). Let be a Markov chain on an at most countable state space , with transition matrix , let , and put . Let and be bounded. Define on and on , and put as in First-step equations for nonnegative exit costs. Suppose is finite-valued, for every , on , and on , where are the kernel action and finite drift from Nonnegative kernel action and finite drift. Then
Facts & Assumptions
Given: AC, a countable-state Markov chain, , and a finite-valued nonnegative satisfying the displayed boundary and drift inequalities and at each state.
AC supplies the canonical chain laws and the conditional-expectation versions used by the Markov and conditional-monotone-convergence results. (The Axiom of Choice)
; in particular for an initial state in , and is measurable from the first states. (Hitting, return, and visit times)
For the transition kernel , . (Transition matrices and n-step probabilities)
Under the deterministic-start law, almost surely and its expectation is denoted by . (Initial distribution of a Markov chain)
The exit reward is , with boundary payoff zero when ; its expectation is . (First-step equations for nonnegative exit costs)
is the sum over positive transition weights, and if is finite-valued with finite , then . (Nonnegative kernel action and finite drift)
Bounded measurable satisfies almost surely. (Bounded-function form of the Markov property)
Increasing nonnegative conditional expectations converge to the conditional expectation of their pointwise limit, whose defining event integrals hold for every event in the conditioning sigma-algebra. (Conditional monotone convergence)
A nonnegative integral passes through an increasing pointwise limit. (Monotone convergence for the integral)
A finite-range nonnegative function has its simple integral given by its finite sum of values times the measures of their level sets; that is its nonnegative integral. (Nonnegative simple measurable functions, The integral of a nonnegative simple function, The nonnegative integral agrees with the simple integral on simple functions)
The nonnegative integral is the supremum of the simple integrals of nonnegative simple minorants. (The nonnegative Lebesgue integral)
The integral of a pointwise lower limit of nonnegative measurable functions is at most the lower limit of their integrals. (Fatou's lemma)
Nonnegative integrals are additive, including extended values. (Additivity of the nonnegative Lebesgue integral)
An at most countable set is finite or admits a listing by . (Finite, countably infinite, countable, uncountable)
A nonnegative extended series is the supremum of its finite partial sums. (Series in the nonnegative extended real line)
Proof
Fix and a finite-valued nonnegative . Exhaust finite by its finite initial subsets, or, for countably infinite , fix an enumeration and put . Each is a finite-range simple function, and the simple-integral formula plus gives , with zero weights omitted from the row action. These functions increase to , so monotone convergence and the definition of the nonnegative row series give , also for finite .
For each finite , define . By [F1], this is a finite sum of measurable nonnegative terms, equivalently using , so is measurable and finite pathwise. On , ; on , one has , , and .
For , let . It is bounded and measurable, so [F6] and step 1.1 give almost surely. As , both and increase to their untruncated values: for the row action, its supremum over and over finite row partial sums commute, and each finite partial sum converges termwise. Conditional monotone convergence [F7] therefore yields almost surely, with the right side finite at every state by hypothesis.
Fix under . Since , suppose inductively that , which makes integrable. Integrating the conditional identity from step 2.1 over by the defining event-integral property [F7] gives . On , by the drift hypothesis, and ; thus . Off the stopped quantities agree, while on their earlier cost sums agree; nonnegative additivity [F12] now yields . Induction proves finite stopped expectations without assuming global integrability of .
Put , so by [F4]. On , for every , . On , and , whose partial costs increase to . Hence pointwise without evaluating ; Fatou [F11] and step 3.1 give . Since was arbitrary, the claim holds at every state.
If , there is no state to check. If , then and the conclusion is ; if , step 4.1 applies with . When , . For a one-state chain, a boundary start has , and if its state is in then forces and . Deterministic transitions are covered by the one-step identity. A hit at incurs and then the boundary value at . AC [A1] supports the canonical laws, bounded conditional Markov identities, and conditional monotone convergence; the pathwise comparison itself uses no choice. This is a one-way bound, with no iff claim.
Source notes
Roch, Note 24 §2 equation (4), printed/PDF p. 3, defines the same exit payoff and pre-exit running cost. In §3, Lemma 24.6 and its proof state the stopped supermartingale construction, and Theorem 24.7 and its proof state the majorant conclusion. In the proof of Theorem 24.7, the displayed identity for the stopped limit at is not justified and need not hold: the limit can retain a nonzero contribution. This proof does not use that identity or the source's supermartingale convergence step. It derives finite stopped-expectation bounds with conditional truncations and obtains the result from pointwise domination and Fatou. The source's generator was initially defined for bounded functions; this item states at every state and proves the unbounded one-step conditional identity locally.
Depends on
- The Axiom of Choice
- Finite, countably infinite, countable, uncountable
- Hitting, return, and visit times
- Initial distribution of a Markov chain
- Transition matrices and n-step probabilities
- First-step equations for nonnegative exit costs
- Nonnegative kernel action and finite drift
- 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
- Bounded-function form of the Markov property
- Conditional monotone convergence
- Fatou's lemma
- Additivity of the nonnegative Lebesgue integral
Used by
Dependency tree · two levels
52 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
- Roch, Lecture Notes on Measure-Theoretic Probability Theory, Note 24 (standard reference, not scraped)