Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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 time-inhomogeneous chain may require enlarged state

Statement

Assume Choice. The deterministic process X0=0,X1=0,Xn=1(n2) cannot be a time-homogeneous Markov chain on {0,1}. After adjoining time to the state, the same evolution is a homogeneous deterministic Markov chain.

Facts & Assumptions

Given: The deterministic process and its natural filtration.

[F1]

A homogeneous K-chain must use the same conditional transition K(Xn,A) at every time. (Time-homogeneous Markov chain with transition kernel)

Counterexample

1.1

If the displayed process were a homogeneous K-chain, its transition from [F1] X0=0 to X1=0 would force K(0,{1})=P(X1=1F0)=0. But its next transition from the same state X1=0 to X2=1 would force K(0,{1})=P(X2=1F1)=1, a contradiction. The witness uses the same state twice, so changing only the row at state 1 cannot repair it.

F1
1.2

Put S~=N0×{0,1} with its power set and let [F1] b0=b1=0, bn=1 for n2. Define T(n,x)=(n+1,bn+1),K~((n,x),A)=1A(T(n,x)). Every section is a Dirac probability and every evaluation is measurable. For Yn=(n,Xn) one has Yn+1=T(Yn), so its conditional transition is the same kernel K~ at every time. Hence [F1] now holds on the enlarged state space.

F1
2.1

The failed conclusion is therefore specifically the existence of one [step 1.1, step 1.2] homogeneous kernel on the unaugmented state space, not the Markov nature of the time-augmented evolution. The probabilities zero and one, times zero/one/two, and both state endpoints are explicit. Choice is used only to phrase the conditional-probability identities in [F1].

step 1.1step 1.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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