VIEW THIS AS

Auto mode follows the Route Engine until you choose a viewpoint.

YOU ARE HERE

ROUTE CHECK

CONNECTED TO

WHAT NEXT

Use the canonical route for this room, or HELP if you are unsure.

Why Mathematics? | Particle Smoothing for Reliability Degradation Histories: Forward Filtering, Backward Simulation, Fixed Lag and Ancestor Degeneracy

Why mathematics is important becomes practical when the question is about a past degradation path rather than today's filtered condition. Particle filtering estimates the current state from observations available so far. Particle smoothing also uses later observations to revise earlier state probabilities. Forward-filtering backward-simulation and related algorithms draw or weight complete trajectories while accounting for transition probabilities and particle weights.

For a teaching backward step, suppose two candidate states at time t have filtering weights 0.60 and 0.40. A selected next state has transition likelihoods 0.20 from candidate A and 0.80 from candidate B. Backward unnormalised weights are 0.60×0.20=0.12 and 0.40×0.80=0.32. Their sum is 0.44, so the backward probabilities are about 0.2727 and 0.7273. Later-state compatibility makes candidate B more plausible even though candidate A had the larger filtering weight.

Full chapter index

Chapters 1–4 · Understand the question
  1. Filtering versus smoothing
  2. Why histories matter
  3. Forward particle archive
  4. Backward conditional idea
Chapters 5–8 · Reproduce the example
  1. Worked unnormalised weights
  2. Worked normalisation
  3. Forward-filtering backward-simulation
  4. Backward smoothing weights
Chapters 9–12 · Check assumptions
  1. Ancestor tracing
  2. Path degeneracy
  3. Fixed-lag smoothing
  4. Two-filter smoothing
Chapters 13–16 · Connect to condition monitoring
  1. Particle rejuvenation
  2. Parameter-state smoothing
  3. Missing observations
  4. Interventions
Chapters 17–20 · Study and verify
  1. Retrospective diagnostics
  2. Online versus offline use
  3. Maintenance interpretation
  4. Practice, misconceptions and next reading

CHAPTER 1 OF 20 · Understand the question

1. Filtering versus smoothing

Back to contents

Separate evidence available at time t from evidence that arrives later. Filtering conditions on observations up to time t, while smoothing for time t can condition on later observations too. A later failure clarifies earlier wear. The calculation matters only when its probability statement, units and observation boundary remain attached to it. Future evidence was unavailable to the original online decision. Label information sets.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use filtering versus smoothing as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Did You Know? Backward simulation can prefer a lower-weight filtered particle when that particle connects much more plausibly to the selected next state. The method becomes easier to trust when this hidden structure is made visible.

Contents · Next chapter

CHAPTER 2 OF 20 · Understand the question

2. Why histories matter

Back to contents

Backward conditioning revises a historical probability without rewriting the observation record. Maintenance investigations ask when degradation accelerated, not only the final state. Find the likely onset of lubrication loss. The calculation matters only when its probability statement, units and observation boundary remain attached to it. A reconstructed path is model-conditioned uncertainty, not a video of the past. Report intervals and alternatives.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use why histories matter as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 3 OF 20 · Understand the question

3. Forward particle archive

Back to contents

A coherent path requires transition compatibility as well as filtered weight. Smoothing needs stored particles, weights and ancestry or a way to regenerate them. Each time step retains its weighted state cloud. The calculation matters only when its probability statement, units and observation boundary remain attached to it. Saving only filtered means destroys path information. Plan storage before deployment.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use forward particle archive as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 4 OF 20 · Understand the question

4. Backward conditional idea

Back to contents

Historical certainty depends on model support and particle ancestry. Given a selected next state, previous candidates are weighted by filtering probability times transition density to that next state. Compatibility with the next state reshapes past probabilities. The calculation matters only when its probability statement, units and observation boundary remain attached to it. Transition density must use the correct direction. Write the conditioning formula.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use backward conditional idea as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Primary authoritative source: https://doi.org/10.1198/016214504000000151. Check its state definition, approximation and numerical conditions before transferring the method to reliability work.

Contents · Previous chapter · Next chapter

CHAPTER 5 OF 20 · Reproduce the example

5. Worked unnormalised weights

Back to contents

Separate evidence available at time t from evidence that arrives later. Multiply 0.60 by 0.20 and 0.40 by 0.80. Products are 0.12 and 0.32. The calculation matters only when its probability statement, units and observation boundary remain attached to it. Filtering weights alone are insufficient. Include the transition term.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use worked unnormalised weights as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Did You Know? Backward simulation can prefer a lower-weight filtered particle when that particle connects much more plausibly to the selected next state. The method becomes easier to trust when this hidden structure is made visible.

QuantityCandidate ACandidate B
Filter weight0.600.40
Transition likelihood0.200.80
Unnormalised weight0.120.32
Backward probability0.27270.7273
Two-candidate backward smoothing update.

Contents · Previous chapter · Next chapter

CHAPTER 6 OF 20 · Reproduce the example

6. Worked normalisation

Back to contents

Backward conditioning revises a historical probability without rewriting the observation record. Divide by total 0.44. Backward probabilities are 0.2727 and 0.7273. The calculation matters only when its probability statement, units and observation boundary remain attached to it. Rounding should preserve a sum near one. Keep full precision internally.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use worked normalisation as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 7 OF 20 · Reproduce the example

7. Forward-filtering backward-simulation

Back to contents

A coherent path requires transition compatibility as well as filtered weight. Sample a final particle, then recursively sample earlier particles from backward probabilities. One draw produces a coherent degradation trajectory. The calculation matters only when its probability statement, units and observation boundary remain attached to it. One trajectory hides smoothing uncertainty. Draw many and summarise.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use forward-filtering backward-simulation as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 8 OF 20 · Reproduce the example

8. Backward smoothing weights

Back to contents

Historical certainty depends on model support and particle ancestry. Instead of sampling one predecessor, some algorithms recursively compute marginal smoothing weights. Every earlier particle receives later evidence. The calculation matters only when its probability statement, units and observation boundary remain attached to it. Quadratic particle interactions can be expensive. Report approximations or accelerations.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use backward smoothing weights as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 9 OF 20 · Check assumptions

9. Ancestor tracing

Back to contents

Separate evidence available at time t from evidence that arrives later. The simplest smoother follows stored resampling ancestors backward. A final particle points to its historical lineage. The calculation matters only when its probability statement, units and observation boundary remain attached to it. Resampling often leaves few distinct early ancestors. Do not confuse ancestry with full smoothing distribution.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use ancestor tracing as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Did You Know? Backward simulation can prefer a lower-weight filtered particle when that particle connects much more plausibly to the selected next state. The method becomes easier to trust when this hidden structure is made visible.

Contents · Previous chapter · Next chapter

CHAPTER 10 OF 20 · Check assumptions

10. Path degeneracy

Back to contents

Backward conditioning revises a historical probability without rewriting the observation record. Repeated resampling collapses ancient particle lineages even when current-state approximation remains useful. Many final particles share one early ancestor. The calculation matters only when its probability statement, units and observation boundary remain attached to it. Increasing current ESS does not guarantee diverse histories. Monitor unique ancestors by lag.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use path degeneracy as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 11 OF 20 · Check assumptions

11. Fixed-lag smoothing

Back to contents

A coherent path requires transition compatibility as well as filtered weight. Assume observations beyond a chosen lag add little information about a past state, then revise only within that window. A ten-step lag limits memory and delay. The calculation matters only when its probability statement, units and observation boundary remain attached to it. A short lag biases slowly informative systems. Validate lag sensitivity.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use fixed-lag smoothing as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 12 OF 20 · Check assumptions

12. Two-filter smoothing

Back to contents

Historical certainty depends on model support and particle ancestry. Combine a forward filter with a backward information filter or likelihood message. Past and future messages meet at time t. The calculation matters only when its probability statement, units and observation boundary remain attached to it. Backward models can be numerically difficult. Check support overlap.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use two-filter smoothing as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Second authoritative source: https://ora.ox.ac.uk/objects/uuid%3Aa8793c16-500e-47f3-8b63-139ab6af6001. Compare its notation and scope with the teaching example, especially where computation and information boundaries matter.

Contents · Previous chapter · Next chapter

CHAPTER 13 OF 20 · Connect to condition monitoring

13. Particle rejuvenation

Back to contents

Separate evidence available at time t from evidence that arrives later. MCMC moves or ancestor sampling can increase trajectory diversity while preserving a target distribution when correctly designed. Historical states move after resampling. The calculation matters only when its probability statement, units and observation boundary remain attached to it. Ad hoc jitter changes the target. Use valid kernels.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use particle rejuvenation as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Did You Know? Backward simulation can prefer a lower-weight filtered particle when that particle connects much more plausibly to the selected next state. The method becomes easier to trust when this hidden structure is made visible.

Contents · Previous chapter · Next chapter

CHAPTER 14 OF 20 · Connect to condition monitoring

14. Parameter-state smoothing

Back to contents

Backward conditioning revises a historical probability without rewriting the observation record. Joint histories may include unknown wear rates or regime parameters. Later data refine both path and degradation coefficient. The calculation matters only when its probability statement, units and observation boundary remain attached to it. Static parameter degeneracy is severe. Use specialised particle MCMC or learning methods.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use parameter-state smoothing as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 15 OF 20 · Connect to condition monitoring

15. Missing observations

Back to contents

A coherent path requires transition compatibility as well as filtered weight. Smoothing can bridge gaps using dynamics and later evidence. A later sensor reading informs a silent interval. The calculation matters only when its probability statement, units and observation boundary remain attached to it. The result relies more heavily on the transition model. Widen uncertainty and mark gaps.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use missing observations as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 16 OF 20 · Connect to condition monitoring

16. Interventions

Back to contents

Historical certainty depends on model support and particle ancestry. Maintenance actions change transition dynamics and must be included in the history. A component replacement resets condition. The calculation matters only when its probability statement, units and observation boundary remain attached to it. Ignoring intervention creates false inferred change points. Record actions and times.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use interventions as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 17 OF 20 · Study and verify

17. Retrospective diagnostics

Back to contents

Separate evidence available at time t from evidence that arrives later. Compare smoothed paths with inspections, teardown evidence and known events. Estimated acceleration aligns with a documented overload. The calculation matters only when its probability statement, units and observation boundary remain attached to it. Agreement after model tuning can overfit. Use held-out episodes.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use retrospective diagnostics as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Did You Know? Backward simulation can prefer a lower-weight filtered particle when that particle connects much more plausibly to the selected next state. The method becomes easier to trust when this hidden structure is made visible.

Contents · Previous chapter · Next chapter

CHAPTER 18 OF 20 · Study and verify

18. Online versus offline use

Back to contents

Backward conditioning revises a historical probability without rewriting the observation record. Smoothing supports diagnosis, model learning and reporting; filtering supports immediate decisions. A weekly review revises the month’s path. The calculation matters only when its probability statement, units and observation boundary remain attached to it. Offline certainty must not be attributed to earlier operators. Preserve decision-time records.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use online versus offline use as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 19 OF 20 · Study and verify

19. Maintenance interpretation

Back to contents

A coherent path requires transition compatibility as well as filtered weight. Smoothed histories can locate likely onset windows and evaluate response timing. A degradation window guides root-cause investigation. The calculation matters only when its probability statement, units and observation boundary remain attached to it. Smoothing does not establish causation. Combine with physical evidence.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use maintenance interpretation as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Useful next reading: particle filtering, hidden Markov models, Mathematics Learning Hub, eduKate Mathematics Learning System, approach to learning mathematics, Bukit Timah Mathematics curriculum overview, cross-subject learning approach. Choose the route that answers the next question rather than treating the links as a checklist.

Contents · Previous chapter · Next chapter

CHAPTER 20 OF 20 · Study and verify

20. Practice, misconceptions and next reading

Back to contents

Historical certainty depends on model support and particle ancestry. Particle smoothing connects conditional probability, weighted sampling, recursion and time. Students can reproduce the two-candidate backward update. The calculation matters only when its probability statement, units and observation boundary remain attached to it. A smoother uses future data and therefore cannot be a real-time filter for that earlier moment. Explain the information boundary.

A dependable audit follows four moves. Write the conditioning information in words, preserve the intermediate quantities, check dimensions and probability totals, then compare the direction of the result with the physical story. Save filtered particles and weights, transition densities, ancestor indices, backward probabilities, lag, random seeds and intervention records. Reproduction is useful because it reveals whether a surprising conclusion came from data, approximation, code or interpretation.

For practice, use practice, misconceptions and next reading as the focus and multiply filtering weights 0.60 and 0.40 by transition likelihoods 0.20 and 0.80, then normalise 0.12 and 0.32 to obtain 0.2727 and 0.7273. Before calculating, predict which term should rise or fall. Change one defensible input and explain the response without jargon. End with one supported statement and one limit. This turns mathematics education into transferable reasoning rather than formula recall.

Quick answers

Why is mathematics important here? It exposes how uncertainty moves through a model, which evidence changes the estimate, and where numerical or sampling approximation enters.

Does a successful update prove the physical model? No. It shows what follows from the declared model and data; external validation remains necessary.

Which mathematics transfers from school? Functions, weighted averages, probability, variance, graphs and matrices all reappear, joined by careful explanation.

How should a student practise? Reproduce the small example, keep intermediate values, predict directions and explain one limitation.

What should a practitioner report? State equations, data boundaries, initialization, uncertainty settings, numerical method, diagnostics, sensitivity checks and decision rules.

How can a parent help? Ask the learner what each symbol represents and what assumption would change the conclusion. Clear explanation is part of mathematical mastery.

Contents · Previous chapter · Mathematics Learning Hub

Extended practice laboratory

Practice case 1: Filtering versus smoothing

Setup: Use this chapter’s illustrative case: A later failure clarifies earlier wear.

Task: Label information sets.

Checking target: Future evidence was unavailable to the original online decision.

Practice case 2: Why histories matter

Setup: Use this chapter’s illustrative case: Find the likely onset of lubrication loss.

Task: Report intervals and alternatives.

Checking target: A reconstructed path is model-conditioned uncertainty, not a video of the past.

Practice case 3: Forward particle archive

Setup: Use this chapter’s illustrative case: Each time step retains its weighted state cloud.

Task: Plan storage before deployment.

Checking target: Saving only filtered means destroys path information.

Practice case 4: Backward conditional idea

Setup: Use this chapter’s illustrative case: Compatibility with the next state reshapes past probabilities.

Task: Write the conditioning formula.

Checking target: Transition density must use the correct direction.

Practice case 5: Worked unnormalised weights

Setup: Use this chapter’s illustrative case: Products are 0.12 and 0.32.

Task: Include the transition term.

Checking target: Filtering weights alone are insufficient.

Practice case 6: Worked normalisation

Setup: Use this chapter’s illustrative case: Backward probabilities are 0.2727 and 0.7273.

Task: Keep full precision internally.

Checking target: Rounding should preserve a sum near one.

Practice case 7: Forward-filtering backward-simulation

Setup: Use this chapter’s illustrative case: One draw produces a coherent degradation trajectory.

Task: Draw many and summarise.

Checking target: One trajectory hides smoothing uncertainty.

Practice case 8: Backward smoothing weights

Setup: Use this chapter’s illustrative case: Every earlier particle receives later evidence.

Task: Report approximations or accelerations.

Checking target: Quadratic particle interactions can be expensive.

Practice case 9: Ancestor tracing

Setup: Use this chapter’s illustrative case: A final particle points to its historical lineage.

Task: Do not confuse ancestry with full smoothing distribution.

Checking target: Resampling often leaves few distinct early ancestors.

Practice case 10: Path degeneracy

Setup: Use this chapter’s illustrative case: Many final particles share one early ancestor.

Task: Monitor unique ancestors by lag.

Checking target: Increasing current ESS does not guarantee diverse histories.