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? | Hidden Markov Models for Reliability Degradation States: Transition Matrices, Emissions, Forward Probabilities and Maintenance

Choose your reading route

eduKateSG · Why Mathematics? · Hidden Markov Models for Reliability Degradation States: Transition Matrices, Emissions, Forward Probabilities and Maintenance

Start with the question, audit the worked example, or jump to the assumptions and practice. Every chapter stays open for uninterrupted reading.

Full chapter index · Practice and checking · Mathematics Learning Hub

Why mathematics is important becomes practical when equipment moves among unobserved health states while sensors provide noisy clues. A Hidden Markov Model, or HMM, describes transition probabilities among latent states and an emission distribution for observations conditional on each state. The forward algorithm updates the state probabilities sequentially without enumerating every possible history.

Start with state probabilities [0.70 healthy, 0.30 degraded] and transition matrix [[0.90,0.10],[0.20,0.80]]. The one-step prediction is [0.69,0.31]. If a warning observation has likelihoods [0.20,0.80], the unnormalised update is [0.138,0.248], summing to 0.386. Normalisation gives about [0.3575,0.6425]. The warning makes degradation more probable, but the result remains conditional on the transition and emission models.

Full chapter index

Chapters 1–5 · Understand the question
  1. Why hidden states
  2. Markov property
  3. Transition matrix
  4. Irreversible degradation
  5. Emission distribution
Chapters 6–10 · Reproduce the example
  1. Initial distribution
  2. Prediction step
  3. Predicted degraded probability
  4. Observation likelihood
  5. Unnormalised update
Chapters 11–15 · Check assumptions
  1. Normalisation constant
  2. Worked posterior states
  3. Forward algorithm
  4. Filtering versus smoothing
  5. Viterbi path
Chapters 16–20 · Explore applications
  1. State dwell time
  2. Multiple sensors
  3. Missing observations
  4. Censoring and failure
  5. Parameter learning
Chapters 21–25 · Study and verify
  1. Model selection
  2. Decision implications
  3. Reproducible reporting
  4. Parent and student learning route
  5. Common misconceptions and next reading

CHAPTER 1 OF 25 · Understand the question

1. Why hidden states

Back to contents

Begin with hidden degradation states. Health stages are useful but not directly measured. A machine may be healthy or degraded while sensors overlap. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. States are abstractions, not guaranteed mechanisms. Define them operationally.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Save state meanings, matrix orientation, emissions, initial distribution and time step. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use why hidden states as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Did You Know? The forward algorithm sums over every possible hidden-state history without enumerating each history separately. That is why a careful report includes the construction, not only the final scalar.

Contents · Next chapter

CHAPTER 2 OF 25 · Understand the question

2. Markov property

Back to contents

Now predict through the transition matrix. The next state depends on the current state under the model. Past history enters through today’s state probability. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Real degradation may depend on duration or covariates. Test richer models.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Recalculate forward probabilities with scaling or log space. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use markov property as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 3 OF 25 · Understand the question

3. Transition matrix

Back to contents

An emission likelihood updates state probabilities. Each row gives probabilities of next states conditional on the current state. Healthy stays healthy with probability 0.90. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Rows must sum to one. Check every row.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Keep state labels distinct from physical failure mechanisms. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use transition matrix as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 4 OF 25 · Understand the question

4. Irreversible degradation

Back to contents

Begin with hidden degradation states. A left-to-right HMM can forbid recovery. Damage moves from healthy to degraded to failed. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Maintenance may reset condition, so irreversibility can be wrong. Model interventions.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Compare filtering, smoothing and Viterbi outputs. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use irreversible degradation as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Primary research: https://doi.org/10.1109/5.18626. Read the authors’ definition and conditions before carrying the method into a censored reliability model.

Contents · Previous chapter · Next chapter

CHAPTER 5 OF 25 · Understand the question

5. Emission distribution

Back to contents

Now predict through the transition matrix. Observations have state-specific distributions. A warning is more likely when degraded. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Sensors can be correlated. Use a joint emission model.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Validate state count and maintenance decisions on later sequences. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use emission distribution as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 6 OF 25 · Reproduce the example

6. Initial distribution

Back to contents

An emission likelihood updates state probabilities. Starting probabilities encode knowledge before the first reading. The unit begins 70% healthy and 30% degraded. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. They can affect short sequences strongly. Report them.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Save state meanings, matrix orientation, emissions, initial distribution and time step. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use initial distribution as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Did You Know? The forward algorithm sums over every possible hidden-state history without enumerating each history separately. That is why a careful report includes the construction, not only the final scalar.

Contents · Previous chapter · Next chapter

CHAPTER 7 OF 25 · Reproduce the example

7. Prediction step

Back to contents

Begin with hidden degradation states. Multiply the state row vector by the transition matrix. Healthy prediction is 0.70×0.90+0.30×0.20=0.69. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Matrix orientation errors swap meanings. Write dimensions.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Recalculate forward probabilities with scaling or log space. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use prediction step as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

QuantityHealthyDegraded
Initial probability0.700.30
Predicted probability0.690.31
Warning likelihood0.200.80
Unnormalised update0.1380.248
Posterior probability0.35750.6425
Two-state HMM forward update.

Contents · Previous chapter · Next chapter

CHAPTER 8 OF 25 · Reproduce the example

8. Predicted degraded probability

Back to contents

Now predict through the transition matrix. Compute 0.70×0.10+0.30×0.80. The result is 0.31. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Predicted probabilities must sum to one. Back-check.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Keep state labels distinct from physical failure mechanisms. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use predicted degraded probability as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 9 OF 25 · Reproduce the example

9. Observation likelihood

Back to contents

An emission likelihood updates state probabilities. Evaluate the new observation under each state emission. Warning likelihoods are 0.20 and 0.80. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Likelihoods are not posterior state probabilities. Multiply then normalise.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Compare filtering, smoothing and Viterbi outputs. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use observation likelihood as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 10 OF 25 · Reproduce the example

10. Unnormalised update

Back to contents

Begin with hidden degradation states. Multiply predicted probabilities by corresponding likelihoods. Products are 0.138 and 0.248. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Their sum is evidence for the observation. Preserve it.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Validate state count and maintenance decisions on later sequences. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use unnormalised update as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 11 OF 25 · Check assumptions

11. Normalisation constant

Back to contents

Now predict through the transition matrix. Add 0.138 and 0.248. The total is 0.386. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Dividing by zero signals an impossible observation under the model. Handle support carefully.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Save state meanings, matrix orientation, emissions, initial distribution and time step. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use normalisation constant as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Did You Know? The forward algorithm sums over every possible hidden-state history without enumerating each history separately. That is why a careful report includes the construction, not only the final scalar.

Contents · Previous chapter · Next chapter

CHAPTER 12 OF 25 · Check assumptions

12. Worked posterior states

Back to contents

An emission likelihood updates state probabilities. Divide each product by 0.386. Posterior probabilities are 0.3575 and 0.6425. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Rounding should still sum near one. Keep full precision internally.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Recalculate forward probabilities with scaling or log space. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use worked posterior states as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Second authoritative source: https://ieeexplore.ieee.org/document/18626/. Compare its reference distribution, diagnostics and finite-simulation cautions with this worked example.

Contents · Previous chapter · Next chapter

CHAPTER 13 OF 25 · Check assumptions

13. Forward algorithm

Back to contents

Begin with hidden degradation states. Repeat prediction and update for the whole sequence. State evidence accumulates efficiently. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Underflow occurs for long sequences. Use scaling or log space.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Keep state labels distinct from physical failure mechanisms. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use forward algorithm as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 14 OF 25 · Check assumptions

14. Filtering versus smoothing

Back to contents

Now predict through the transition matrix. Filtering uses data up to now; smoothing also uses later observations. Retrospective diagnosis changes earlier state probabilities. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Future information was unavailable to the real-time decision. Label the analysis.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Compare filtering, smoothing and Viterbi outputs. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use filtering versus smoothing as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 15 OF 25 · Check assumptions

15. Viterbi path

Back to contents

An emission likelihood updates state probabilities. Dynamic programming finds the most probable single state sequence. A path marks likely degradation onset. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. The most probable path can hide large path uncertainty. Report marginals too.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Validate state count and maintenance decisions on later sequences. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use viterbi path as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 16 OF 25 · Explore applications

16. State dwell time

Back to contents

Begin with hidden degradation states. A standard HMM implies geometric state duration. Degraded duration has memoryless exit probability. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Physical wear may have non-geometric duration. Consider hidden semi-Markov models.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Save state meanings, matrix orientation, emissions, initial distribution and time step. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use state dwell time as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Did You Know? The forward algorithm sums over every possible hidden-state history without enumerating each history separately. That is why a careful report includes the construction, not only the final scalar.

Contents · Previous chapter · Next chapter

CHAPTER 17 OF 25 · Explore applications

17. Multiple sensors

Back to contents

Now predict through the transition matrix. Emissions can combine vibration, temperature and acoustic signals. Joint patterns distinguish states. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Conditional independence assumptions may be unrealistic. Check residual dependence.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Recalculate forward probabilities with scaling or log space. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use multiple sensors as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 18 OF 25 · Explore applications

18. Missing observations

Back to contents

An emission likelihood updates state probabilities. Transitions can proceed when a sensor reading is absent. The model predicts through a gap. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Missingness may depend on state. Model informative missingness.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Keep state labels distinct from physical failure mechanisms. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use missing observations as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 19 OF 25 · Explore applications

19. Censoring and failure

Back to contents

Begin with hidden degradation states. A terminal failure state or survival component can represent event information. Units still operating end as censored. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Stopping observation at failure changes sequence length. Define the likelihood.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Compare filtering, smoothing and Viterbi outputs. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use censoring and failure as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 20 OF 25 · Explore applications

20. Parameter learning

Back to contents

Now predict through the transition matrix. Expectation-maximisation or Bayesian inference estimates transitions and emissions. Soft state responsibilities update parameters. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Local optima and label switching can occur. Use multiple starts and constraints.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Validate state count and maintenance decisions on later sequences. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use parameter learning as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 21 OF 25 · Study and verify

21. Model selection

Back to contents

An emission likelihood updates state probabilities. Compare state counts using predictive performance and interpretability. Two versus three degradation states are tested. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. More states can split noise. Validate externally.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Save state meanings, matrix orientation, emissions, initial distribution and time step. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use model selection as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Did You Know? The forward algorithm sums over every possible hidden-state history without enumerating each history separately. That is why a careful report includes the construction, not only the final scalar.

Contents · Previous chapter · Next chapter

CHAPTER 22 OF 25 · Study and verify

22. Decision implications

Back to contents

Begin with hidden degradation states. Posterior degraded probability can trigger inspection under a loss rule. Inspect above a cost-derived threshold. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. The highest state probability is not automatically the best action. Include consequences.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Recalculate forward probabilities with scaling or log space. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use decision implications as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 23 OF 25 · Study and verify

23. Reproducible reporting

Back to contents

Now predict through the transition matrix. Save state definitions, matrix orientation, emissions, initial distribution, time step and inference method. A reviewer recreates 0.6425. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. A coloured state chart alone is incomplete. Archive sequences.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Keep state labels distinct from physical failure mechanisms. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use reproducible reporting as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Contents · Previous chapter · Next chapter

CHAPTER 24 OF 25 · Study and verify

24. Parent and student learning route

Back to contents

An emission likelihood updates state probabilities. HMMs connect matrices, conditional probability, normalisation and dynamic programming. Verify 0.69, 0.31 and the update. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Likelihood is not posterior probability. Draw a two-state diagram.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Compare filtering, smoothing and Viterbi outputs. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use parent and student learning route as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Useful next reading: Bukit Timah Mathematics curriculum overview, cross-subject learning approach, previous Why Mathematics article, Mathematics Learning Hub, eduKate Mathematics Learning System, approach to learning mathematics. Choose the destination that matches the next question rather than treating links as a checklist.

Contents · Previous chapter · Next chapter

CHAPTER 25 OF 25 · Study and verify

25. Common misconceptions and next reading

Back to contents

Begin with hidden degradation states. Hidden states are not automatically discovered physical stages, and the Markov property is an assumption. HMMs provide a structured probabilistic sequence model. This step matters because sequential state inference, degradation regimes and uncertainty-aware maintenance require the mathematical object, prediction target and reliability question to stay aligned. Validation remains essential. Read Rabiner and reliability applications.

A reproducible audit should record variables, units, observation boundaries, censoring codes, model version and software settings. Validate state count and maintenance decisions on later sequences. Rebuild the displayed number from saved inputs before interpreting it. A result that cannot be reproduced is not ready to guide reliability work.

Try a small learning experiment: multiply state probabilities by the transition matrix, apply warning likelihoods, and normalise the two products. Use common misconceptions and next reading as the focus. Predict the direction of change before using software, alter one defensible input, and finish with two sentences: what the calculation supports, and what remains uncertain. This habit turns mathematics education into transferable problem-solving rather than formula recall.

Quick answers

What must be fixed before checking a model or algorithm? Define the dataset unit, censoring mechanism, time scale, parameterisation, simulation design and diagnostic rule.

Does a satisfactory diagnostic prove the model is true? No. It supports a particular check under stated assumptions and simulation conditions.

Which mathematics matters? Probability defines the reference distribution, simulation makes it observable, proportions summarise tail events, variance describes uncertainty and graphs expose structured mismatch.

How should a student practise? Preserve intermediate quantities, predict directions before calculating, change one input at a time and explain the result in ordinary language.

What follows an internal check? Sensitivity analysis, independent computation, held-out or later-data prediction and a separate decision analysis when cost or safety matters.

Contents · Previous chapter · Mathematics Learning Hub

Extended practice laboratory

Practice case 1: Why hidden states

Setup: Use this chapter’s illustrative case: A machine may be healthy or degraded while sensors overlap.

Task: Define them operationally.

Checking target: States are abstractions, not guaranteed mechanisms.

Practice case 2: Markov property

Setup: Use this chapter’s illustrative case: Past history enters through today’s state probability.

Task: Test richer models.

Checking target: Real degradation may depend on duration or covariates.

Practice case 3: Transition matrix

Setup: Use this chapter’s illustrative case: Healthy stays healthy with probability 0.90.

Task: Check every row.

Checking target: Rows must sum to one.

Practice case 4: Irreversible degradation

Setup: Use this chapter’s illustrative case: Damage moves from healthy to degraded to failed.

Task: Model interventions.

Checking target: Maintenance may reset condition, so irreversibility can be wrong.

Practice case 5: Emission distribution

Setup: Use this chapter’s illustrative case: A warning is more likely when degraded.

Task: Use a joint emission model.

Checking target: Sensors can be correlated.

Practice case 6: Initial distribution

Setup: Use this chapter’s illustrative case: The unit begins 70% healthy and 30% degraded.

Task: Report them.

Checking target: They can affect short sequences strongly.

Practice case 7: Prediction step

Setup: Use this chapter’s illustrative case: Healthy prediction is 0.70×0.90+0.30×0.20=0.69.

Task: Write dimensions.

Checking target: Matrix orientation errors swap meanings.

Practice case 8: Predicted degraded probability

Setup: Use this chapter’s illustrative case: The result is 0.31.

Task: Back-check.

Checking target: Predicted probabilities must sum to one.

Practice case 9: Observation likelihood

Setup: Use this chapter’s illustrative case: Warning likelihoods are 0.20 and 0.80.

Task: Multiply then normalise.

Checking target: Likelihoods are not posterior state probabilities.

Practice case 10: Unnormalised update

Setup: Use this chapter’s illustrative case: Products are 0.138 and 0.248.

Task: Preserve it.

Checking target: Their sum is evidence for the observation.