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.

Hitting probability as minimal harmonic extension

Statement

Assume AC (The Axiom of Choice). Let X be a Markov chain with transition kernel K on an at most countable state space E, transition matrix p(x,y)=K(x,{y}), and let A⊆E. Define h(x):=Px(TA<∞). Then h(x)=1(x∈A),h(x)=Ph(x)(x∈Ac), where Pϕ(x)=∑y∈E:p(x,y)>0p(x,y)ϕ(y) is the support-restricted nonnegative kernel action. Moreover, for every finite-valued g:E→[0,∞) satisfying g=1 on A and g=Pg on Ac, one has h(x)≤g(x) for every x∈E.

Facts & Assumptions

Given: AC, a countable-state Markov chain, A⊆E, and for the minimality claim a finite-valued nonnegative g with g=1 on A and g=Pg on Ac.

[A1]

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)

[F1]

TA=inf⁡{n≥0:Xn∈A}, so TA=0 at a start in A. (Hitting, return, and visit times)

[F17]

The infimum of the empty set is +∞. (Hitting, return, and visit times)

[F2]

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

[F3]

For nonnegative ϕ, Pϕ(x)=∑y:p(x,y)>0p(x,y)ϕ(y), omitting zero transition weights. (Nonnegative kernel action and finite drift)

[F4]

A measure on a countable discrete space is the sum of its singleton weights; for K(x,⋅) those weights are p(x,y). (Every measure on a countable discrete space is its weighted sum of Dirac measures)

[F5]

For bounded product-measurable H, hH(x)=ExH(X0,X1,…) is measurable and E[H(Xn,Xn+1,…)∣Fn]=hH(Xn) almost surely. (Markov property for bounded future path functionals)

[F6]

For bounded measurable q, E[q(Xn+1)∣Fn]=Kq(Xn) almost surely. (Bounded-function form of the Markov property)

[F7]

Under Px=Pδx, one has X0=x almost surely. (Initial distribution of a Markov chain)

[F8]

For nonnegative measurable Z, E[Z∣G] is characterized by its event integrals, and increasing nonnegative limits pass through conditional expectation almost surely. (Conditional monotone convergence)

[F9]

For bounded real Y, E[E(Y∣G)]=E[Y]. (Basic algebra and order properties of conditional expectation)

[F10]

Fatou's lemma gives ∫lim inf⁡Yn dP≤lim inf⁡n∫Yn dP for nonnegative measurable Yn. (Fatou's lemma)

[F11]

Increasing sequences of nonnegative measurable functions pass to the limit under the nonnegative integral. (Monotone convergence for the integral)

[F12]

A nonnegative simple measurable function has finite range. (Nonnegative simple measurable functions)

[F13]

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

[F14]

For s=∑jcjχEj on disjoint measurable sets, its simple integral is ∑jcjμ(Ej). (The integral of a nonnegative simple function)

[F15]

For every nonnegative simple measurable s, its nonnegative Lebesgue integral equals its simple integral. (The nonnegative integral agrees with the simple integral on simple functions)

[F16]

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

Proof

technique · identify the countable kernel integral by finite-support truncations, extend the one-step Markov identity by conditional monotone convergence, and apply Fatou to the stopped candidate
1.1F2F3F4F11F12F13F14F15F16given

If E is finite or countably infinite, fix an increasing finite exhaustion Ej↑E (using a fixed enumeration when E is infinite), and for ϕ:E→[0,+∞] put ϕj(y)=1Ej(y)(ϕ(y)∧j). Each ϕj 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 Kϕj(x)=∫Eϕj(y)K(x,dy)=∑y∈Ejp(x,y)(ϕ(y)∧j). As j↑∞, [F11] passes the integrals to Kϕ(x), while the finite sums increase to the support-restricted extended row sum by [F16] and [F3]; thus Kϕ(x)=Pϕ(x), with zero weights omitted and no 0⋅(+∞) formed.

1.2F1F7F17given

If E=∅, there is no state or initial law to check; if A=∅, then TA=∞ by [F1, F17], so h=0 and h≤g follows from g≥0; if A=E, every start has TA=0 and h=1, while every admissible g is also 1; in general, [F1, F7] give h(x)=1 whenever x∈A.

2.1F5F6F7F9step 1.1given

Define H(ω)=1{∃n≥0:ωn∈A}, a bounded product-measurable path functional. By [F5], h is measurable and Ex[H(X1,X2,…)∣F1]=h(X1); for x∈Ac, hitting A is equivalent to the shifted path hitting it, so [F9] gives h(x)=Exh(X1). The bounded one-step identity [F6], X0=x [F7], and expectation preservation [F9] identify this as Kh(x); step 1.1 then gives Kh(x)=Ph(x).

2.2F3F6F8step 1.1given

For any finite-valued nonnegative g and each n, use the finite-support truncations gj from step 1.1. The bounded one-step identity [F6] and step 1.1 give E[gj(Xn+1)∣Fn]=Kgj(Xn)=Pgj(Xn); since gj↑g, conditional monotone convergence [F8] and the row-sum limit in step 1.1 yield E[g(Xn+1)∣Fn]=Pg(Xn) almost surely, with its event-integral characterization available even when the conditional value is infinite.

3.1F1F7F8step 2.2given

Fix x∈Ac, put T=TA, Yn=g(Xn∧T), and Sn={T>n}∈Fn by [F1]. If ExYn=g(x)<∞, then on Sn one has Xn∈Ac and Pg(Xn)=g(Xn); [F8] and step 2.2 give Ex[1Sng(Xn+1)]=Ex[1SnPg(Xn)]=Ex[1Sng(Xn)]. On Snc, Yn+1=Yn=1, and on Sn, Yn=g(Xn) and Yn+1=g(Xn+1). Since X0=x by [F7], induction from Y0=g(x) proves ExYn=g(x) and integrability for every finite n.

4.1A1F1F5F6F7F8F10step 1.1step 1.2step 3.1given∎

On {T<∞}, Yn=1 for every n≥T, while on {T=∞} all Yn≥0; hence 1{T<∞}≤lim inf⁡nYn. Fatou [F10] and step 3.1 give h(x)≤Exlim inf⁡nYn≤lim inf⁡nExYn=g(x) for x∈Ac, and step 1.2 covers x∈A, A=∅, and A=E. 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

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