Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-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.

A finite periodic chain need not converge in total variation

Statement

The deterministic two-state chain that alternates 0↔1 is ϕ-irreducible for counting measure ϕ and has invariant law π=(δ0+δ1)/2, but from either fixed starting state its laws do not converge in total variation to π.

Facts & Assumptions

Given: The state space {0,1} and transition matrix in the Statement.

[F1]

Transition matrices and n-step probabilities: the rows specify the one-step probabilities and matrix powers specify Pn.

[F2]

Phi-irreducibility for a general-state Markov kernel: every positive-ϕ set must be reached at some finite positive time from every state.

[F3]

Aperiodicity for a general-state Markov kernel: a period-two cyclic partition violates aperiodicity.

[F4]

Total variation distance for probability laws: total variation is the supremum of event-probability differences.

Verification

Given: The alternating transition matrix and facts [F1]–[F4].

1.1F1F2given

Let ϕ be counting measure. Every nonempty set is reachable from either state at a positive time of at most two steps, so [F2] holds. The uniform law is invariant because each column sum and row sum of the transition matrix equals one.

2.1F3step 1.1

The partition X0={0}, X1={1} has positive invariant mass in both classes and transitions alternate deterministically, so it is a cyclic decomposition of period two under [F3].

3.1F1F4step 1.1algebra∎

From 0, Pn(0,⋅)=δ0 for even n and δ1 for odd n. Taking event {0} in [F4], the distance to π equals 1/2 for every n. From 1 the even and odd laws are interchanged, giving the same distance. Hence convergence from either fixed state fails despite irreducibility and invariance; an initial law equal to π remains invariant.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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