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.
Identical one-time marginals do not determine a Markov chain
Statement
Assume Choice. On , a stationary IID fair-bit chain and a constant fair-bit chain have the same one-time marginal at every time, but have different transition kernels and different two-time laws.
Facts & Assumptions
Given: The two fair-bit constructions specified below.
An IID sequence with common law has the constant-row kernel . (IID sequences as Markov chains with state-independent kernel)
The identity map gives the deterministic kernel . (A deterministic dynamical system as a Markov kernel)
Counterexample
Let be IID with [F1] . By [F1], it is Markov with for both . Independence gives
Let be one fair bit and put for every . Then each is [F2] again fair, while [F2] makes Markov with identity kernel . Here Moreover , so the kernels differ.
Thus for every , including , [step 1.1, step 1.2] but their displayed two-time event probabilities are and . This is a concrete failed conclusion: one-time marginals do not determine even a two-time law, much less the kernel or path law. The state space is nonempty and finite; probabilities zero and one appear explicitly. Choice is inherited only from the Markov-chain interfaces used in [F1]--[F2].
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
14 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
- Durrett, Probability: Theory and Examples, Section 5.1 (standard reference, not scraped)