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 cannot be a time-homogeneous Markov chain on . 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.
A homogeneous -chain must use the same conditional transition at every time. (Time-homogeneous Markov chain with transition kernel)
Counterexample
If the displayed process were a homogeneous -chain, its transition from [F1] to would force But its next transition from the same state to would force a contradiction. The witness uses the same state twice, so changing only the row at state cannot repair it.
Put with its power set and let [F1] , for . Define Every section is a Dirac probability and every evaluation is measurable. For one has , so its conditional transition is the same kernel at every time. Hence [F1] now holds on the enlarged state space.
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].
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
- Durrett, Probability: Theory and Examples, Section 5.1 (standard reference, not scraped)