Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Communication is an equivalence relation

Statement

For a countable transition matrix on E, communication is an equivalence relation on E, and its equivalence classes partition E.

Facts & Assumptions

Given: A countable state space E and its transition matrix p.

[F1]

Accessibility means x→y exactly when p(n)(x,y)>0 for some n∈N0. Accessibility, communication, and irreducibility

[F2]

Communication is mutual accessibility: x↔y means x→y and y→x. Accessibility, communication, and irreducibility

[F3]

The zero-step row satisfies p(0)(x,y)=1{x=y}, so each state is accessible from itself. Accessibility, communication, and irreducibility

[F4]

For m,n∈N0, p(m+n)(x,z)=∑w∈Ep(m)(x,w)p(n)(w,z). Matrix Chapman–Kolmogorov equations

Proof

technique · direct
1.1F2F3given

By [F3], p(0)(x,x)=1, hence x→x and x↔x for every x∈E. The definition in [F2] is symmetric in x,y, so communication is symmetric.

1.2F1F4given

Suppose x→y and y→z. By [F1], choose m,n∈N0 with p(m)(x,y)>0 and p(n)(y,z)>0. The nonnegative series in [F4] contains the term at w=y, so p(m+n)(x,z)≥p(m)(x,y)p(n)(y,z)>0. Thus x→z. The argument permits either witness length to be zero.

2.1F2step 1.2given

If x↔y and y↔z, then x→y→z gives x→z by step 1.2, and z→y→x gives z→x by the same step. Therefore x↔z, proving transitivity of communication.

3.1step 1.1step 2.1given

Define [x]:={y∈E:x↔y}. Reflexivity makes each [x] contain x, so these classes cover E. If c∈[x]∩[z], symmetry and transitivity give x↔z; then every member of either class belongs to the other, so [x]=[z]. Thus distinct classes are disjoint and the classes partition E.

4.1F1F3step 1.1step 1.2step 3.1given∎

If E=∅, there are no states or classes and the assertion is vacuous. If E has one state, step 1.1 gives its sole class. Absorbing or otherwise degenerate rows cause no exception: the proof uses only zero-step identity and positive accessibility witnesses. No global choice is made; for each fixed triple in step 1.2, the two existential witnesses are used locally.

Depends on

Used by

Dependency tree · two levels

8 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