An elementary proof that the first hitting time of an open set by a jump process is a stopping time
Alexander Sokol

TL;DR
This paper provides a simple and elementary proof demonstrating that the first hitting time of an open set by a jump process of a cadlag adapted process is a stopping time.
Contribution
It introduces a straightforward proof confirming the stopping time property for the first hitting time of open sets by jump processes.
Findings
First hitting time is a stopping time for jump processes.
Elementary proof simplifies existing arguments.
Applicable to cadlag adapted processes.
Abstract
We give a short and elementary proof that the first hitting time of an open set by the jump process of a c\`adl\`ag adapted process is a stopping time.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Control Systems Optimization · Process Optimization and Integration · Computability, Logic, AI Algorithms
