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 last exit time need not be a stopping time
Statement
A last-visit time generally is not a stopping time. For two independent fair coin tosses and , let Then is not a stopping time.
Facts & Assumptions
Given: The hypotheses, objects, and conventions in the Statement.
Discrete stopping time requires .
Independent random elements makes the second toss independent of .
Counterexample
The last success occurs no later than time exactly when the second toss fails. Hence This event has probability .
If it belonged to , F2 would make it independent of itself, because it is also an event determined by . That would give , impossible. Thus , violating F1. The counterexample is finite and choice-free.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
6 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
- van der Vaart, Martingales, Diffusions and Financial Mathematics, stopping-time discussion in §2.3 (standard reference, not scraped)