Alphabeta Math
ExampleConstruction: 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.

IID sequences as Markov chains with state-independent kernel

Statement

Assume Choice. If (Xn)n0 is IID with common law ν on (E,E), then relative to its natural filtration it is a Markov chain with the state-independent kernel K(x,A)=ν(A).

Facts & Assumptions

Given: Choice and the IID sequence in the statement.

[F1]

IID means that the entire family is mutually independent and every coordinate has the same law. (Identical distribution and IID families)

[F2]

Sigma-algebras generated by disjoint blocks of an independent family are independent. (Disjoint groups of an independent sigma-algebra family remain independent)

[F3]

The indicator and bounded-function versions of the Markov property are equivalent. (Bounded-function form of the Markov property)

Verification

1.1

For each x, AK(x,A)=ν(A) is a probability measure; for each [given] A, xν(A) is constant and measurable. Thus K is a probability kernel, including ν(A)=0 and 1 and a one-point state space.

given
2.1

Put Fn=σ(X0,,Xn). By [F1]--[F2], [F1, F2, F3, step 1.1] σ(Xn+1) is independent of Fn. Hence, for BFn and AE, E[1B1{Xn+1A}]=P(B)ν(A)=E[1BK(Xn,A)]. Therefore the constant K(Xn,A)=ν(A) is a version of the indicated conditional probability. By [F3], equivalently E[f(Xn+1)Fn]=fdν for every bounded measurable f. This verifies the claim at n=0 and all later times. Choice is used only for those conditional-expectation classes.

F1F2F3step 1.1

Depends on

Used by

Dependency tree · two levels

28 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