Stopping time
A stopping time for a process is a random time such that at each observation time , the event that stopping has already happened is determined by the history up to . The slide expresses this by requiring to be -measurable.
stepbil · YouTube · 5:57
This 150-second clip introduces stopping times for a random process , defines them via the measurability of {} with respect to the history up to time t, and then presents the hitting time / first passage time = inf{ : }. Using a graph with a horizontal barrier a, the lecturer argues informally that is a stopping time because the first hit can be detected from the observed past without looking ahead. Near the end, a second handwritten definition involving T^* = sup{ : } begins to appear but is not explained within the clip. This 150-second whiteboard lecture segment explains the probabilistic notion of a stopping time and tests two concrete examples built from a process and a fixed level a. The lecturer first states the formal criterion that {} must depend only on the history up to time t. He then shows that the first hitting time = inf{ : } is a stopping time, because by time t one can already tell whether level a has been reached. In contrast, the last-hit time = sup{ : } is not a stopping time, since deciding whether the current hit is final requires future information. A third displayed object, τ_max = max_{} , is introduced with the question of whether it is a stopping time, but the clip ends before resolving it. This segment defines as the time at which a stochastic process reaches its maximum over a fixed interval . Using a hand-drawn graph of a Brownian motion path, the instructor explains why is not a stopping time. The key argument is that determining whether the current peak is the global maximum requires knowledge of the future evolution of the process up to time , violating the condition that a stopping time must depend only on the history of the process up to the current time.
Use the learning inspector for key ideas and moments, or open the reading tabs for the complete notes.
Generated from the video's visuals and explanation; not verbatim speech.
The clip opens with the title “Stopping time” and a stopwatch image, signaling that the topic concerns deciding when to stop observing a stochastic process.
The typed definition states that for a random process , a stopping time is a random time such that at each time we already know whether stopping has occurred.
The key formal condition shown is that the event is -measurable, meaning it depends only on the history of the process up to and including time .
The lecturer emphasizes the operational meaning: one does not need future information to decide whether to stop.
The view moves to a graph of a fluctuating path labeled and a horizontal red barrier labeled .
Below the graph, the handwritten definition introduces the hitting time, also called first passage time: .
On the graph, the first intersection of the black path with the red level marks the earliest time at which the process reaches .
The lecturer then asks whether this is a stopping time and answers yes, because at the hitting moment the decision can be made from the observed path alone.
The reasoning is intuitive rather than fully formal: once the process value is seen at the barrier, the observer knows to stop without looking ahead.
At the very end, another handwritten line begins to appear, , but the clip ends before it is discussed.
The segment opens on a whiteboard-style probability lesson centered on the definition of a stopping time. The printed statement says that for a random process , a random time is a stopping time if at each time we already know whether to stop; equivalently, the event is -measurable and depends only on the history up to and including . The accompanying graph shows a jagged path crossing a horizontal level , visually framing the later examples.
The lecturer then turns to the first concrete example, the hitting time or first passage time . The key point is that by time one can inspect the observed path up to and determine whether level has already been reached. Hence the event is decided from past and present information alone, so satisfies the stopping-time criterion.
Next comes the contrasting example , described verbally as the last time the process hits level . The lecturer asks us to imagine standing at a current hitting point on the graph. From that point alone, we cannot know whether the path will return to later. Since identifying the final visit requires future information, fails the definition of a stopping time.
Near the end, the board also displays another candidate, , together with the question of whether it is a stopping time. Within this excerpt, however, the lecturer does not analyze it before the clip ends. As written, the formula denotes a maximum value of the process rather than a time, so the notation remains unresolved in the source segment.
Let's consider the random time , defined as the moment the process hits its highest value within the fixed time window .
To determine if this is a stopping time, we check if the decision to stop at time relies solely on the past history .
Imagine observing the path up to some intermediate time . Even if the process is currently at a local peak, we cannot know if it will climb higher before time .
Since verifying the global maximum requires peeking into the future of the process, the event is not measurable with respect to .
Consequently, unlike the hitting time , the time of the maximum fails the definition of a stopping time.
A stopping time for a process is a random time such that at each observation time , the event that stopping has already happened is determined by the history up to . The slide expresses this by requiring to be -measurable.
The lecturer stresses that a stopping rule cannot rely on future values of the process. The decision at time must already be knowable from the path observed up to and including .
The hitting time of level is the earliest nonnegative time at which the process reaches that level. In the example, is drawn as a horizontal barrier and the first intersection with the path gives .
In the worked graphical example, is treated as a stopping time because once the path has hit the level , that fact is visible from the observed history alone; no future trajectory is needed to decide to stop.
A random time for a process is a stopping time if, at every observation time , the decision whether stopping has already occurred depends only on the history up to and including . Formally, must be -measurable.
The hitting time of level is the earliest time at which the process reaches . Because reaching can be verified from the observed path up to the current time, this example is a stopping time.
The lecturer defines as the last time the process hits level , written with a supremum over all hitting times. This is not a stopping time, since deciding whether the current hit is final requires knowledge of the future path.
The contrast between and shows why the quantifier matters. An infimum over hitting times asks whether something has happened by now, which is detectable from the past. A supremum asks whether something is the final occurrence, which is not detectable without future information.
The board briefly shows and asks whether it is a stopping time, but the clip ends before answering. As written, the right-hand side is a maximum value of the process rather than a time, so the notation is ambiguous within the excerpt.
Defined as the specific time in the interval where the stochastic process achieves its supremum. Formula: .
is not a stopping time because determining if the current value is the global maximum requires knowledge of the process's behavior in the future interval . This violates the requirement that stopping decisions depend only on the history up to time .
Explore conditions, steps and evidence. Supplementary explanations are labeled separately from content shown in the video.
The slide text uses in the definition of a stopping time for a random process.
The graph labels the fluctuating black path as .
The random process under discussion; in the worked example it is the plotted fluctuating path.
The definition line contains the symbol as the random time being defined.
The speaker says a stopping time is a random time tau.
A candidate stopping time for the process .
Nonnegative random time.
The definition uses 'at time t' and the event {}.
The speaker repeatedly refers to knowing at time t whether to stop.
t
An observation time used to test whether the stopping decision is already determined by the past up to that time.
Fixed time parameter in the definition.
The slide states that {} is measurable.
The speaker reads ' measurable'.
The underlying filtration is not explicitly defined on screen or in speech within this clip.
The information available up to time t; the event {} must belong to this sigma-algebra for to be a stopping time.
Sigma-algebra associated with the process history up to time t.
The handwritten hitting-time definition uses level a in .
A red horizontal line is labeled a on the graph.
The speaker calls it 'some level a' and 'barrier a'.
a
A fixed level or barrier for the process; in the graph it is the horizontal threshold hit by .
Real level shown around 6 on the vertical axis.
The handwritten definition is = inf{ : }.
The speaker introduces this as the hitting time or first passage time.
The first time at which the process reaches level a.
Nonnegative extended random time.
The definition uses inf{ : }.
The speaker paraphrases this as 'the first time ... that our random process hits level a'.
Infimum operator selecting the earliest time in the set of times when equals a.
Applied to a subset of [0,).
Near the end of the clip, a second handwritten line appears: T^* = sup{ : }.
Only the beginning of this line is visible before the clip ends; no explanation is given yet.
T^*
A later-defined time based on the supremum of times at which equals a.
Nonnegative extended random time.
Written as = inf { : }.
The lecturer discusses the hitting time / first passage time in this notation.
First hitting time (first passage time) of level a by the process W.
Nonnegative random time.
Appears in = inf { : }.
Infimum operator selecting the earliest time in the set.
Appears in inside the definitions of , , and τ_max.
The plotted trajectory is labeled .
The random process observed at time t.
Appears as the target level in .
A horizontal red line marks level a on the graph.
a
A fixed level of the process used to define hitting and last-hit times.
Slide text: 'A stopping time for a random process is a random time, , such that we know at time t whether to stop, i.e. the event {} is measurable ({} depends only on the history of the process up to and including time t).'
The speaker reads and paraphrases the same definition, emphasizing that one does not need to look into the future.
The filtration () is named but not formally constructed in this clip.
A stopping time for a process is a random time such that, at each observation time t, the decision whether stopping has already occurred is determined by the process history up to and including t. Formally, the event {} must be -measurable.
Defined for a random process .
The relevant information at time t is the history up to and including t.
The clip does not specify additional assumptions on the filtration.
Handwritten line: 'Hitting time / first passage time' followed by = inf{ : }.
The speaker says the hitting time or first passage time is the first time for t greater or equal to zero that the random process hits level a.
The graph shows a horizontal barrier a and a fluctuating path that reaches it.
The hitting time, also called first passage time, of level a is the earliest nonnegative time at which the process equals a. It is written as an infimum over all such times.
Level a is fixed.
The set is taken over times .
The clip does not discuss the case where the set is empty.
Printed definition: 'A stopping time for a random process is a random time τ, such that we know at time t whether to stop, i.e. the event {} is measurable ({} depends only on the history of the process up to and including time t).'
The lecturer explains that one can decide whether to stop solely on the basis of information available up to and including time t.
A random time τ is a stopping time for a process if, at each time t, the decision whether τ has already occurred depends only on the history of the process up to and including t. Formally, the event {} must be measurable with respect to the information available at time t.
τ is a random time for the process .
Measurability is required for each observation time t.
Only information up to and including time t may be used.
Handwritten heading 'Hitting time / first passage time' followed by = inf { : }.
The lecturer treats this as an example of a time and asks whether it is a stopping time.
The hitting time of level a is the earliest nonnegative time at which the process W equals a. It is written as an infimum over the set of times satisfying .
The process is observed for .
a is a fixed level.
Under 'Other times:', the board shows = sup { : }.
The lecturer says 'let's define tau b as the last time that the process hits level a'.
The notation uses but the defining equation still refers to level a; the video does not clarify this.
The lecturer introduces as the last time the process hits level a, represented by taking the supremum over all times such that .
The process is observed for .
a is the same fixed level used in the hitting-time example.
The board writes τ_max = max_{} and then asks 'Is this a stopping time?'
As written, the right-hand side is a maximum value of the process, not a time; the video does not resolve this notational issue.
The board presents another candidate object under 'Other times:' as τ_max = max_{} and asks whether it is a stopping time. The displayed formula itself denotes the maximum process value over the interval [0,T].
The maximum is taken over .
The video leaves the interpretation of this object unresolved within the clip.
The formula is written on the board.
Speaker says: 'Max is just uh we stop when we reach the maximum of maximum of our process in the interval from zero to T.'
is defined as the time point within the interval at which the stochastic process attains its maximum value.
Process is defined on
Text on screen: 'whether to stop, i.e. the event {} is measurable ({} depends only on the history of the process up to and including time t).'
Speaker argues that one cannot decide whether to stop using information available at time because future values are unknown.
A random time is a stopping time if the event is -measurable, meaning the decision to stop by time depends only on the history of the process up to time .
is a filtered probability space
After asking whether is a stopping time, the speaker answers affirmatively and explains that one can decide to stop because the value of the process is observed.
The handwritten question 'Is this a stopping time?' is attached to = inf{ : }.
The graph marks the first contact point between and the horizontal level a.
The argument is presented informally on the example graph rather than as a full measure-theoretic proof.
For the process shown, the first hitting time \{ : \} is a stopping time because at any time t one can determine from the observed history whether the process has already hit level a.
There is a process and a fixed level a.
The decision is based on the history up to and including the current time.
For the observation times considered in the example, the event that has occurred by time t is determined by the path up to t.
The lecturer states that at time t we know whether to stop because we can observe the process and decide based only on information up to and including t.
The board asks 'Is this a stopping time?' next to = inf { : }.
For the hitting time = inf{ : }, the decision whether to stop by time t can be made using only the history of the process up to and including time t, so satisfies the stopping-time criterion.
is the observed random process.
is defined as the first time with .
The information available at time t is the history up to and including t.
For each observation time t.
The lecturer concludes 'tau b is not a stopping time because we don't have enough information available at time t here regarding whether this is the last time we actually hit level a.'
The board shows = sup { : } and asks whether it is a stopping time.
The time = sup{ : }, interpreted as the last time the process hits level a, is not a stopping time because deciding whether the current hit is the final one requires knowledge of the future evolution of the process.
is defined as the supremum of times at which .
The decision must be based only on information up to and including the current time t.
At a generic current time t when the process is at level a.
Speaker states: 'So is this a stopping time? Well clearly not... I can't decide where to stop using information available to me at time little t'.
The graph illustrates that knowing the path up to time does not reveal if the current peak is the global maximum over .
The random time is not a stopping time with respect to the natural filtration of .
is a non-trivial stochastic process (e.g., Brownian motion)
is a fixed terminal time
For all
The speaker asks whether is a stopping time, then reasons that if the process is at the hitting point, one can observe the value and therefore stop.
The graph shows the path reaching the red barrier a for the first time.
This is an intuitive verification on the displayed sample path, not a formal proof for all processes and filtrations.
Start from the definition of stopping time: at time t, one must already know whether the stopping event has happened.
Uses the definition ki-stopping-time-def.
Rewrite the candidate time as the first time the process equals the level a.
Uses the definition ki-hitting-time-def.
At a given time, inspect the observed path up to that time and check whether it has already touched level a.
The graph makes the path history visible up to the current point.
If the path has reached a, the decision to stop is known immediately; no future values are needed.
This matches the informal explanation in the audio.
Therefore is treated as a stopping time in the example because the hitting event is detectable from the past up to the current time.
The lecturer explains that at time t we can observe the process and therefore decide whether to stop based only on information up to and including t.
The graph shows the path and the level a, supporting the idea of checking whether the path has reached a by time t.
Start from the definition = inf{ : }.
This is the displayed hitting-time definition.
At any observation time t, one can inspect the realized path up to time t and determine whether the process has already hit level a.
The lecturer says we can observe the process and use information available up to and including time t.
The event 'we have stopped by time t' is exactly the event that the process has hit a at some time no later than t.
This follows from the meaning of the infimum in the definition of .
Since that event is determined by the history up to time t, satisfies the stopping-time criterion.
The printed definition requires {} to depend only on the history up to and including t.
is a stopping time.
The lecturer says that staying at a point on the path, we cannot decide whether this is the last time we hit level a without knowing the future trajectory.
The graph shows multiple crossings of the level a and a stick figure placed at one crossing, illustrating uncertainty about later behavior.
Consider a current time t at which the process is at level a.
This matches the lecturer's setup of standing 'somewhere here' on the path.
To know whether the current time is , one must know whether there will be any later time at which W again equals a.
This is the meaning of the supremum over all hitting times of level a.
That question cannot be answered from the history up to time t alone, because the future evolution of the process is unknown.
The lecturer explicitly says we do not have the benefit of hindsight and do not know what will happen in the future.
Therefore the event of having stopped by time t is not determined solely by information up to time t.
This contradicts the stopping-time requirement stated in the definition.
is not a stopping time.
Step-by-step verbal reasoning provided by the speaker while pointing at the graph.
Visual aid showing a stick figure at an intermediate peak and arrows indicating future uncertainty.
Assume we are at some time and observe the path of up to .
Setup for checking measurability condition.
We want to know if the current observed maximum is the true maximum over .
This corresponds to determining if .
However, the process may rise higher than the current maximum in the remaining time .
Property of stochastic processes like Brownian motion having independent increments/future uncertainty.
Therefore, the event cannot be determined solely by the history .
Conclusion based on the inability to predict future maxima.
Thus, is not a stopping time.
Negation of the stopping time criterion.
fails the adaptedness/measurability requirement for stopping times because deciding if the maximum has been reached requires knowledge of the future path up to .
A graph shows a fluctuating black path labeled , a horizontal red line labeled a, and the first intersection point highlighted.
The speaker describes the process fluctuating up and down and hitting the barrier a for the first time.
The exact numerical coordinates of the first hit are not stated verbally; only the visual level a near 6 is clear.
Given a plotted random process and a horizontal level a, identify the first time the process reaches a and decide whether this defines a stopping time.
A fluctuating path is drawn on axes.
A horizontal barrier a is drawn across the graph.
The definition \{ : \} is written below.
Find the first hitting time of level a and test whether it is a stopping time.
Read the graph as a sample path of the process over time.
The axes and label identify the curve as the process.
Identify the fixed horizontal level a as the target barrier.
The red line is labeled a in the diagram.
Define the first time at which the path equals the barrier.
This is the handwritten formula shown on screen.
Locate the first intersection of the black path with the red line; that point represents on the graph.
The visual highlight marks the first contact with level a.
Conclude that the decision to stop at that point is based only on the observed path up to that time.
The speaker explicitly says one can observe the value and therefore stop.
The first hitting time is the time of the first intersection between and the level a, and in this example it is presented as a stopping time.
Verified by comparing the graph's first contact point with the definition \{ : \} and the stopping-time criterion that the event be determined by the history up to the current time.
The board writes = inf { : } under 'Hitting time / first passage time'.
The lecturer uses this as the first example and argues it is a stopping time.
Given a random process and a fixed level a, define = inf{ : } and ask whether is a stopping time.
A random process .
A fixed level a.
The definition = inf{ : }.
Determine whether satisfies the stopping-time criterion.
Define the first time at which the process reaches level a.
This is the displayed definition.
At time t, observe the path up to t and check whether level a has already been reached.
The lecturer says the decision uses only information available up to and including time t.
This event is determined by the history up to time t.
It records that some satisfied .
Yes, is a stopping time.
The conclusion matches the printed stopping-time definition requiring {} to depend only on the history up to time t.
The board writes = sup { : } under 'Other times:'.
The lecturer defines it verbally as the last time the process hits level a and concludes it is not a stopping time.
The notation conflicts with the condition ; the clip does not explain the subscript choice.
Define = sup{ : }, interpreted as the last time the process hits level a, and ask whether is a stopping time.
A random process .
A fixed level a.
The definition = sup{ : }.
Determine whether is a stopping time.
Define the candidate time as the supremum of all times at which the process equals a.
This is the displayed formula.
At a current hitting time, decide whether this is the final hit of level a.
This is the decision problem emphasized by the lecturer.
That decision requires knowledge of whether the process will hit a again in the future.
The lecturer states that without knowing the future trajectory we cannot decide.
Since the answer depends on future information, the stopping-time criterion fails.
The definition allows only information up to and including the current time t.
No, is not a stopping time.
The reasoning directly applies the printed definition of stopping time and the lecturer's explicit conclusion.
Top of the slide shows a hand holding a stopwatch above the title 'Stopping time' and the typed definition.
Stopwatch image
Title 'Stopping time'
Typed definition text
The cursor highlights parts of the definition while the speaker reads it.
The definition text remains on screen throughout this interval.
The stopwatch visually reinforces that a stopping time is about deciding when to stop based on elapsed observed time.
The lower part of the slide shows a graph with a fluctuating black line labeled and a horizontal red line labeled a.
Around 122-128 seconds, a stick figure and arrow are drawn above the graph pointing toward the first intersection with the red line.
The precise x-coordinate of the first intersection is not labeled numerically.
Black path
Red horizontal line a
Axes
Stick figure annotation
Arrow annotation
The view scrolls down to reveal the graph and the handwritten hitting-time formula.
A mark is placed at the first intersection of with level a.
An arrow and stick figure are added to emphasize the hitting moment.
The level a stays fixed as a horizontal barrier.
The path is the evolving object whose first contact with a is being studied.
The animation identifies the first passage time as the earliest time at which the observed path reaches the fixed barrier.
A graph shows axes labeled [] vertically and [t] horizontally, a jagged black path labeled , a horizontal red line labeled a, and stick figures above the path with arrows pointing down to points on the trajectory.
Across the clip the view scrolls between the definition/graph area and the handwritten examples, and additional stick-figure annotations are visible near later times.
Exact numerical coordinates of the marked points are not stated in the audio and are only approximate from the drawing.
Vertical axis labeled [].
Horizontal axis labeled [t].
Black jagged trajectory labeled .
Horizontal red line labeled a.
Stick figures with downward arrows marking positions on the path.
The page scrolls between the typed definition and the handwritten examples.
The visual focus shifts from the general stopping-time definition to the specific formulas for , , and τ_max.
Additional stick-figure annotations emphasize different points on the trajectory during the discussion of last hitting time.
The red line remains fixed at level a.
The trajectory is the same plotted path throughout the graph views.
The diagram supports the verbal distinction between first hitting and last hitting: reaching level a can be detected from the past up to the current time, but identifying the final visit to level a would require seeing the entire future of the path.
A hand-drawn graph of a jagged line () oscillating around a horizontal axis, intersecting a red horizontal line (). Stick figures represent observers at different times.
Jagged black line representing
Horizontal red line representing level
Stick figures on the curve
Arrows indicating time progression and future possibilities
Focus shifts from the general definition to specific points on the curve to illustrate the concept of 'history' vs 'future'.
The underlying mathematical object being discussed is the sample path of the stochastic process.
The visual demonstrates that at any intermediate point (stick figure), one cannot know if the current height is the global maximum without seeing the rest of the path (arrows pointing right).
The speaker says: 'We don't need to look into the future to decide whether to stop or not.'
One might think a stopping rule can depend on what happens after the current time.
The video stresses that a stopping time must be decided using only the history up to and including the current time.
The lecturer repeatedly contrasts decisions based on information up to time t with decisions that would require looking into the future.
The stopping-time definition explicitly says {} depends only on the history up to and including time t.
One may think any naturally defined random time is automatically a stopping time.
A stopping time must be decidable using only the history up to the current time. The last-hit time fails because recognizing the final hit requires future information.
The board writes τ_max = max_{} and asks whether this is a stopping time.
This item is an analyst note about the displayed notation, not an explicit correction spoken in the clip.
The symbol τ_max suggests a random time, but the displayed right-hand side max_{} is a maximum value of the process rather than a time.
If the intended object were the time at which the maximum is attained, a more standard definition would be something like argmax_{} or the first time attaining the running maximum. The clip itself does not resolve this ambiguity.
Contrast between (hitting time) and (time of maximum).
Speaker explicitly asks 'Is this a stopping time?' implying it's a common question/point of confusion compared to the previous examples.
Students might assume that since hitting a level () is a stopping time, finding the maximum () is also a stopping time.
Hitting a fixed level allows you to stop immediately upon contact (past info suffices). Finding the maximum requires comparing the current value against all future values up to (future info needed).
The hitting-time definition is introduced directly beneath the stopping-time definition.
The speaker asks whether the hitting time is a stopping time and then answers yes.
The hitting time is introduced as a concrete example to which the abstract stopping-time definition is applied.
The speaker concludes that the first hitting time / first passage time is indeed a stopping time.
\{ : \} is checked against the stopping-time criterion.
This relation is derived from the video's example rather than stated as a general theorem in full formal language.
Within the clip, is presented as a specific instance of a stopping time: the first time the process reaches a fixed level.
The examples and are each followed by the question 'Is this a stopping time?' after the stopping-time definition is shown.
The hitting-time example is evaluated using the definition of stopping time.
The board asks whether is a stopping time immediately after presenting the stopping-time definition.
The last-hit-time example is also classified by testing the stopping-time criterion.
The lecturer contrasts the first hitting time, which can be decided from the past, with the last hitting time, which cannot.
The board juxtaposes = inf { : } and = sup { : }.
Both concern visits to the same level a, but the infimum version yields a stopping time while the supremum version does not.
Direct application of the stopping time definition to the specific example of .
The definition of is tested against the criterion for stopping times, resulting in a negative conclusion.
The slide gives the formal definition of stopping time.
The speaker says one does not need to look into the future to decide whether to stop.
The handwritten formula = inf{t >= 0 : } is shown.
The speaker asks whether is a stopping time and then answers affirmatively.
The graph shows crossing the horizontal level a.
The printed definition of stopping time is visible on the board.
The lecturer explains why the hitting time can be decided from information up to time t.
The lecturer says we cannot know whether the current hit is the last one without future information.
The board shows with inf and with sup over the same hitting condition .
The board writes τ_max = max_{} and asks whether it is a stopping time.
The clip does not provide the answer or clarify the notation.
The core question answered in the clip.
Covered · Formal definition of stopping time and the no-future-lookahead intuition.
Covered · Introduction of hitting time / first passage time with graph and formula.
Covered · Verification that the hitting time is a stopping time, plus the start of another time definition at the very end.
Covered · The clip continuously presents the stopping-time definition, the hitting-time example, the last-hit-time example, and a briefly shown τ_max formula whose status is left unresolved within the excerpt.
Covered · Definition of tau_max presented.
Covered · Argument and graphical proof that tau_max is not a stopping time.
Reviewed subject paths