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.
The Markov property can fail for a larger filtration
Statement
Assume Choice. An IID fair-bit sequence has the constant fair transition kernel relative to its natural filtration, but it need not have that kernel relative to a larger filtration. In particular, revealing at time zero makes the time-zero Markov identity fail.
Facts & Assumptions
Given: The IID fair-bit sequence and the two filtrations specified below.
An IID sequence with law is a Markov chain with constant kernel relative to its natural filtration. (IID sequences as Markov chains with state-independent kernel)
The Markov definition is relative to the specified filtration and requires adaptedness. (Time-homogeneous Markov chain with transition kernel)
Counterexample
Let be IID fair bits and [F1] . By [F1], is a Markov chain for this filtration with .
Define a larger filtration by [F2] Then and for , so is increasing; it contains at every time, and is adapted. Thus it meets the structural requirements in [F2].
Since is -measurable, [F2, step 1.1, step 1.2] almost surely. This differs from on both positive-probability events and . Hence the time-zero identity in [F2] fails for the larger filtration, although it holds naturally. Empty/full target events still give zero/one and do not witness failure. Choice is used only by the conditional-probability classes.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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)