Alphabeta Math

Recurrence Transience and Hitting Times for Markov Chains — Examples

About this page
Pipeline-generated
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.

✓ 10 results · all verified · 6 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.
1 · Prerequisites
Abstract Algebra
Combinatorics
Linear Algebra
Measure Theory
Number Theory
Probability
Real Analysis
Set Theory
Topology
2 · Logical flowchart

3 · Items

Example

Communicating classes in a four-state chain

Example

Gambler’s ruin from harmonicity

Example

Birth–death recurrence through scale products

Example

Green kernel of a biased integer walk

Example

Period two on a bipartite graph

Example

Laziness makes an irreducible chain aperiodic

Counterexample

Different classes can have different recurrence types

Counterexample

A bounded harmonic boundary problem without uniqueness

Counterexample

A transient chain can return with positive probability

Example

Negative drift gives a finite mean small-set hit

Sources