Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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 X be a Markov chain on an at most countable state space E, with transition matrix p, let D⊆E, and put T=TDc. Let f:Dc→[0,∞) and c:D→[0,∞) be bounded. Define B=f(XT) on {T<∞} and B=0 on {T=∞}, and put u(x):=Ex ⁣[B+∑0≤m<Tc(Xm)](x∈E), as in First-step equations for nonnegative exit costs. Suppose ψ:E→[0,∞) is finite-valued, Pψ(x)<∞ for every x, ψ(x)≥f(x) on Dc, and Lψ(x)≤−c(x) on D, where Pψ(x)=∑y∈E:p(x,y)>0p(x,y)ψ(y),Lψ(x)=Pψ(x)−ψ(x) are the kernel action and finite drift from Nonnegative kernel action and finite drift. Then u(x)≤ψ(x)for every x∈E.

Facts & Assumptions

Given: AC, a countable-state Markov chain, D,f,c,T,B,u, and a finite-valued nonnegative ψ satisfying the displayed boundary and drift inequalities and Pψ(x)<∞ at each state.

[A1]

AC supplies the canonical chain laws and the conditional-expectation versions used by the Markov and conditional-monotone-convergence results. (The Axiom of Choice)

[F1]

TA=inf⁡{n≥0:Xn∈A}; in particular T=0 for an initial state in Dc, and {T≤n} is measurable from the first n+1 states. (Hitting, return, and visit times)

[F2]

For the transition kernel K, p(x,y)=K(x,{y}). (Transition matrices and n-step probabilities)

[F3]

Under the deterministic-start law, X0=x almost surely and its expectation is denoted by Ex. (Initial distribution of a Markov chain)

[F4]

The exit reward is B+∑0≤m<Tc(Xm), with boundary payoff zero when T=∞; its expectation is u(x). (First-step equations for nonnegative exit costs)

[F5]

Pϕ(x) is the sum over positive transition weights, and if ϕ is finite-valued with finite Pϕ(x), then Lϕ(x)=Pϕ(x)−ϕ(x). (Nonnegative kernel action and finite drift)

[F6]

Bounded measurable g satisfies E[g(Xn+1)∣Fn]=Kg(Xn) almost surely. (Bounded-function form of the Markov property)

[F7]

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)

[F8]

A nonnegative integral passes through an increasing pointwise limit. (Monotone convergence for the integral)

[F9]

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)

[F10]

The nonnegative integral is the supremum of the simple integrals of nonnegative simple minorants. (The nonnegative Lebesgue integral)

[F11]

The integral of a pointwise lower limit of nonnegative measurable functions is at most the lower limit of their integrals. (Fatou's lemma)

[F12]

Nonnegative integrals are additive, including extended values. (Additivity of the nonnegative Lebesgue integral)

[F13]

An at most countable set is finite or admits a listing by N. (Finite, countably infinite, countable, uncountable)

[F14]

A nonnegative extended series is the supremum of its finite partial sums. (Series in the nonnegative extended real line)

Proof

technique · define the path reward before any random-time evaluation, then use bounded truncations and monotone convergence
1.1F2F5F8F9F10F13F14given

Fix x∈E and a finite-valued nonnegative g. Exhaust finite E by its finite initial subsets, or, for countably infinite E, fix an enumeration e0,e1,… and put Fj={e0,…,ej−1}. Each g1Fj is a finite-range simple function, and the simple-integral formula plus p(x,y)=K(x,{y}) gives ∫Eg(y)1Fj(y)K(x,dy)=∑y∈Fjp(x,y)g(y), with zero weights omitted from the row action. These functions increase to g, so monotone convergence and the definition of the nonnegative row series give Kg(x):=∫Eg(y)K(x,dy)=Pg(x), also for finite E.

1.2F1given

For each finite n, define Mn:=ψ(Xn∧T)+∑m<n∧Tc(Xm). By [F1], this is a finite sum of measurable nonnegative terms, equivalently using ∑m<n1{T>m}c(Xm), so Mn is measurable and finite pathwise. On {T≤n}, Mn+1=Mn; on Sn:={T>n}∈Fn, one has Xn∈D, Mn=ψ(Xn)+∑m<nc(Xm), and Mn+1=ψ(Xn+1)+∑m≤nc(Xm).

2.1F5F6F7F14step 1.1given

For N≥1, let ψN=min⁡(ψ,N). It is bounded and measurable, so [F6] and step 1.1 give E[ψN(Xn+1)∣Fn]=PψN(Xn) almost surely. As N↑∞, both ψN(Xn+1) and PψN(Xn) increase to their untruncated values: for the row action, its supremum over N and over finite row partial sums commute, and each finite partial sum converges termwise. Conditional monotone convergence [F7] therefore yields E[ψ(Xn+1)∣Fn]=Pψ(Xn) almost surely, with the right side finite at every state by hypothesis.

3.1F3F5F7F12step 2.1step 1.2given

Fix x∈E under Px. Since M0=ψ(x), suppose inductively that ExMn≤ψ(x), which makes Mn integrable. Integrating the conditional identity from step 2.1 over Sn by the defining event-integral property [F7] gives Ex[1Snψ(Xn+1)]=Ex[1SnPψ(Xn)]. On Sn, Pψ(Xn)+c(Xn)≤ψ(Xn) by the drift hypothesis, and Ex[1Snψ(Xn)]≤ExMn<∞; thus Ex[1Sn(ψ(Xn+1)+c(Xn))]≤Ex[1Snψ(Xn)]. Off Sn the stopped quantities agree, while on Sn their earlier cost sums agree; nonnegative additivity [F12] now yields ExMn+1≤ExMn≤ψ(x). Induction proves finite stopped expectations without assuming global integrability of ψ(Xn).

4.1F4F11step 3.1given

Put Z:=B+∑0≤m<Tc(Xm), so ExZ=u(x) by [F4]. On {T<∞}, for every n≥T, Mn=ψ(XT)+∑m<Tc(Xm)≥f(XT)+∑m<Tc(Xm)=Z. On {T=∞}, B=0 and Mn≥∑m<nc(Xm), whose partial costs increase to Z. Hence Z≤lim inf⁡n→∞Mn pointwise without evaluating X∞; Fatou [F11] and step 3.1 give u(x)=ExZ≤Ex[lim inf⁡nMn]≤lim inf⁡nExMn≤ψ(x). Since x was arbitrary, the claim holds at every state.

5.1A1F1F3F4F6F7step 1.2step 2.1step 4.1given∎

If E=∅, there is no state to check. If D=∅, then T=0 and the conclusion is f≤ψ; if D=E, step 4.1 applies with B=0. When f=c=0, u=0≤ψ. For a one-state chain, a boundary start has T=0, and if its state is in D then Pψ=ψ forces c=0 and u=0. Deterministic transitions are covered by the one-step identity. A hit at T=n+1 incurs c(Xn) and then the boundary value at Xn+1. 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 T=∞ is not justified and need not hold: the limit can retain a nonzero ψ(Xn) 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 Pψ(x)<∞ at every state and proves the unbounded one-step conditional identity locally.

Depends on

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