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? | Probability Integral Transform for Density Forecasts: CDF Values, Uniformity, Independence and Discrete Outcomes

WHY MATHEMATICS?

Why Mathematics? | Probability Integral Transform for Density Forecasts: CDF Values, Uniformity, Independence and Discrete Outcomes

How realised outcomes become values on zero to one, with a standard-normal example, histogram diagnostics, limits and responsible checks.

Why mathematics is important becomes easier to see when a real decision depends on it. This guide follows the mechanism from definitions and dimensions to a worked calculation, validation, practical learning and responsible use. It keeps factual evidence separate from interpretation and treats every illustrative scenario as an example rather than a promise of results.

Choose a reading route

  • Evaluate each forecast CDF at its realised outcome
  • Understand the uniform target for correct continuous forecasts
  • Diagnose dispersion, bias and dependence cautiously
  • Randomise CDF jumps for discrete outcomes transparently

Chapter map

  1. 1. Forecast CDF
  2. 2. Observation
  3. 3. Transform
  4. 4. Range
  5. 5. Repeat
  6. 6. Uniform target
  7. 7. Independence
  8. 8. U shape
  9. 9. Mound
  10. 10. Tilt
  11. 11. Discrete jump
  12. 12. Randomisation
  13. 13. Histogram bins
  14. 14. Proper score
  15. 15. Uncertainty
  16. 16. Claim

Visit the How Mathematics Works hub for the wider series and its connections to education, reasoning, science, computing, design and careers.


1. Forecast CDF

A small example makes the mechanism visible. Use standard normal F.

A concrete situation

State location, scale and units.

What the mathematics does not license

A CDF is conditional on information. Evidence becomes stronger when the limitation is tested instead of hidden.

Try it, check it, transfer it

Name forecast. Then explain the result to someone who has not seen the formula. If the explanation needs a hidden assumption, add that assumption to the model record.


2. Observation

This is where modelling choices begin to affect evidence. Set y=.67449.

A concrete situation

Use the same units.

What the mathematics does not license

One case cannot test uniformity. Keeping this boundary clear makes the result easier to audit and transfer.

Try it, check it, transfer it

Label case. Then explain the result to someone who has not seen the formula. If the explanation needs a hidden assumption, add that assumption to the model record.


3. Transform

The central mathematical idea is concrete. Compute u=F(y).

A concrete situation

Result is about .75.

What the mathematics does not license

This is cumulative probability, not density. A trustworthy workflow records the choice before seeing the final test result.

Try it, check it, transfer it

Name object. Then explain the result to someone who has not seen the formula. If the explanation needs a hidden assumption, add that assumption to the model record.


4. Range

Here the geometry becomes operational. Check 0<=u<=1.

A concrete situation

Record full precision.

What the mathematics does not license

Numerical truncation can pile at boundaries. Evidence becomes stronger when the limitation is tested instead of hidden.

Try it, check it, transfer it

Audit code. Then explain the result to someone who has not seen the formula. If the explanation needs a hidden assumption, add that assumption to the model record.

Did You Know? In this chapter, the most important number is useful only together with its construction rule. Changing scaling, sample membership or validation design can change the numerical answer without changing the arithmetic.


5. Repeat

This step deserves a careful pause. Compute one PIT per forecast case.

A concrete situation

Preserve chronological order.

What the mathematics does not license

Pooling regimes can hide failure. Keeping this boundary clear makes the result easier to audit and transfer.

Try it, check it, transfer it

Keep metadata. Then explain the result to someone who has not seen the formula. If the explanation needs a hidden assumption, add that assumption to the model record.


6. Uniform target

The useful question is not only how to calculate, but what the calculation assumes. Compare histogram with uniform counts.

A concrete situation

Use declared bins.

What the mathematics does not license

Visual flatness has sampling variation. A trustworthy workflow records the choice before seeing the final test result.

Try it, check it, transfer it

Add bands. Then explain the result to someone who has not seen the formula. If the explanation needs a hidden assumption, add that assumption to the model record.


7. Independence

A small example makes the mechanism visible. Inspect autocorrelation or valid dependence tests.

A concrete situation

Match lead time.

What the mathematics does not license

Uniformity alone is insufficient for conditional density claims. Evidence becomes stronger when the limitation is tested instead of hidden.

Try it, check it, transfer it

Separate checks. Then explain the result to someone who has not seen the formula. If the explanation needs a hidden assumption, add that assumption to the model record.


8. U shape

This is where modelling choices begin to affect evidence. Note excess near zero and one.

A concrete situation

Consider underdispersion.

What the mathematics does not license

Other mechanisms can mimic shape. Keeping this boundary clear makes the result easier to audit and transfer.

Try it, check it, transfer it

Use cautious language. Then explain the result to someone who has not seen the formula. If the explanation needs a hidden assumption, add that assumption to the model record.

Did You Know? In this chapter, the most important number is useful only together with its construction rule. Changing scaling, sample membership or validation design can change the numerical answer without changing the arithmetic.


9. Mound

The central mathematical idea is concrete. Note excess near .5.

A concrete situation

Consider overdispersion.

What the mathematics does not license

Mixtures can complicate interpretation. A trustworthy workflow records the choice before seeing the final test result.

Try it, check it, transfer it

Check strata. Then explain the result to someone who has not seen the formula. If the explanation needs a hidden assumption, add that assumption to the model record.


10. Tilt

Here the geometry becomes operational. Check one side exceeds the other.

A concrete situation

Consider location bias.

What the mathematics does not license

Bias may vary by regime. Evidence becomes stronger when the limitation is tested instead of hidden.

Try it, check it, transfer it

Stratify predeclared. Then explain the result to someone who has not seen the formula. If the explanation needs a hidden assumption, add that assumption to the model record.


11. Discrete jump

This step deserves a careful pause. Compute F(y-) and F(y).

A concrete situation

Recognise ordinary PIT is not uniform.

What the mathematics does not license

Do not apply continuous theory blindly. Keeping this boundary clear makes the result easier to audit and transfer.

Try it, check it, transfer it

State support. Then explain the result to someone who has not seen the formula. If the explanation needs a hidden assumption, add that assumption to the model record.


12. Randomisation

The useful question is not only how to calculate, but what the calculation assumes. Sample within the CDF jump.

A concrete situation

Record seed or deterministic equivalent.

What the mathematics does not license

Hidden randomisation hurts reproducibility. A trustworthy workflow records the choice before seeing the final test result.

Try it, check it, transfer it

Declare method. Then explain the result to someone who has not seen the formula. If the explanation needs a hidden assumption, add that assumption to the model record.

Did You Know? In this chapter, the most important number is useful only together with its construction rule. Changing scaling, sample membership or validation design can change the numerical answer without changing the arithmetic.


13. Histogram bins

A small example makes the mechanism visible. Freeze boundaries before inspection.

A concrete situation

Report counts.

What the mathematics does not license

Many bins create noise. Evidence becomes stronger when the limitation is tested instead of hidden.

Try it, check it, transfer it

Use sensitivity analysis. Then explain the result to someone who has not seen the formula. If the explanation needs a hidden assumption, add that assumption to the model record.


14. Proper score

This is where modelling choices begin to affect evidence. Add log score or CRPS.

A concrete situation

Measure sharpness-aware accuracy.

What the mathematics does not license

PIT calibration alone does not rank all forecasts. Keeping this boundary clear makes the result easier to audit and transfer.

Try it, check it, transfer it

Triangulate. Then explain the result to someone who has not seen the formula. If the explanation needs a hidden assumption, add that assumption to the model record.


15. Uncertainty

The central mathematical idea is concrete. Use methods respecting serial dependence.

A concrete situation

Report effective sample limits.

What the mathematics does not license

Forecast cases often overlap. A trustworthy workflow records the choice before seeing the final test result.

Try it, check it, transfer it

Avoid iid fiction. Then explain the result to someone who has not seen the formula. If the explanation needs a hidden assumption, add that assumption to the model record.


16. Claim

Here the geometry becomes operational. Name CDF, support and lead time.

A concrete situation

Teaching PIT is .75.

What the mathematics does not license

Do not call one value calibrated. Evidence becomes stronger when the limitation is tested instead of hidden.

Try it, check it, transfer it

Bound conclusion. Then explain the result to someone who has not seen the formula. If the explanation needs a hidden assumption, add that assumption to the model record.

Did You Know? In this chapter, the most important number is useful only together with its construction rule. Changing scaling, sample membership or validation design can change the numerical answer without changing the arithmetic.


A seven-day practice lab

  1. Day 1: define the decision, observation unit, X variables and Y or reference condition.
  2. Day 2: reproduce the smallest worked example and check every dimension, unit and sign.
  3. Day 3: build a transparent baseline and write what it assumes.
  4. Day 4: fit the main method inside a training-only pipeline; record every parameter.
  5. Day 5: challenge one assumption with a deliberately difficult dataset or operating regime.
  6. Day 6: compare validation metrics with the practical workload created by errors.
  7. Day 7: present one supported conclusion, one unresolved uncertainty and one safe next experiment.

Questions for a student, parent or mentor

  • Which part of the model is a mathematical definition, and which part is a choice?
  • What small calculation would catch a sign, scale or dimension error?
  • What evidence comes from training, validation and the untouched test?
  • What benign condition could look like a fault or prediction failure?
  • How would the answer change for another response, asset, school project or time period?
  • What should a human review before acting on the score?

A method-specific audit before deployment

The probability integral transform evaluates a continuous predictive distribution at the realised outcome. If F is the forecast cumulative distribution function and y occurs, the PIT value is u=F(y). Across correctly specified one-step conditional density forecasts under the relevant assumptions, PIT values should behave like independent draws from a uniform distribution on zero to one.

For a standard normal forecast and observation y≈.67449, the cumulative probability is .75, so the PIT value is .75. That one number does not say whether the forecast is good. Repeating the calculation across many matched forecasts and outcomes creates a sequence whose histogram, uniformity and dependence can be examined.

A U-shaped PIT histogram often accompanies underdispersed forecasts because too many outcomes fall in forecast tails. A mound near one half often accompanies overdispersion. A tilt can signal bias. These patterns are diagnostic clues rather than unique causes: mixtures, changing regimes, dependence and estimation error can create similar shapes, and a flat histogram alone does not prove all forecast qualities.

For a discrete predictive distribution, F(Y) is not continuously uniform. A randomized PIT samples within the jump from F(y minus) to F(y), with the randomisation method declared. A serious analysis preserves forecast issue time, outcome unit, support, conditioning information and lead time, then reports histogram bins, independence checks and complementary proper scores.


Frequently asked questions

What is a PIT value?

The predictive cumulative distribution evaluated at the realised outcome.

What is the target distribution?

Uniform on zero to one for correctly specified continuous conditional forecasts under the relevant assumptions.

Why check independence?

A uniform marginal histogram can still hide serial dependence.

What does a U shape mean?

Often underdispersion, though the shape is not uniquely diagnostic.

What changes for discrete outcomes?

A randomized PIT samples within the CDF jump.

What must be reported?

Forecast CDF, conditioning, units, lead time, support, randomisation, bins, dependence and companion scores.


Primary source and fact-check note

Francis X. Diebold, Todd A. Gunther and Anthony S. Tay, “Evaluating Density Forecasts,” NBER Technical Working Paper 215 (1997), DOI 10.3386/t0215; published in International Economic Review 39(4), 863–883 (1998). Definitions and core claims in this article were checked against this primary publication. Calculations shown here were independently recomputed. Examples are educational illustrations; they are not reported industrial performance results.

Useful next reading

Keep the options open. Mathematics education supports clearer questions, transferable problem-solving skills and informed choices across science, engineering, computing, AI, statistics, design and many other careers. It does not guarantee intelligence, income, admission or employment; those outcomes depend on far more than one subject or model.

Extended laboratory: diagnostic validation and responsible use

Target audit

Freeze the event, forecast issue time, lead time, case set, outcome source and diagnostic target before calculation.

Formula audit

Write every mean, frequency, CDF value, rank, logit, inverse logit, count, bin edge, coefficient and denominator explicitly.

Data audit

Preserve matched forecasts and observations, missing-case rules, units, weights, dependence and regime labels.

Grouping audit

Predeclare probability bins, PIT bins, ensemble strata and calibration smoothers; show sensitivity without cherry-picking.

Did You Know? A sophisticated adjustment can be algebraically correct and still answer the wrong scientific question when samples, labels, batches or validation boundaries are wrong.

Uncertainty audit

Display counts and use intervals or resampling that respects serial, spatial or clustered dependence.

Diagnostic audit

Treat familiar shapes as clues with competing explanations, then add proper scores and case-level inspection.

Validation audit

Separate model fitting, recalibration and final evaluation so in-sample adjustment is not presented as external performance.

Final claim

State the exact calibration or rank evidence supported and stop before causal, universal or guaranteed-performance claims.

Did You Know? A sophisticated adjustment can be algebraically correct and still answer the wrong scientific question when samples, labels, batches or validation boundaries are wrong.

Mechanism workshop: calculate, challenge and transfer

Workshop 1: Forecast CDF

Begin with this mechanism: Use standard normal F. Recreate the concrete case: State location, scale and units. Write outcome units, CDF values, histogram bins, time order, jump limits, randomisation and dependence with signs, identifiers and assumptions. Calculate the smallest non-trivial example by hand and reproduce it independently. Challenge this limitation: A CDF is conditional on information. Complete the transfer step: Name forecast. Change exactly one forecast probability, outcome, bin edge, count, interval method, CDF, scale parameter, lead time, PIT value, ensemble member, observation, tie, rank, intercept, slope, validation split or dependence assumption. Explain which mathematical object changes, which diagnostic moves and which claim must weaken. Keep target definition, arithmetic, sampling uncertainty and interpretation on separate notebook lines. Explain the result once to a student and once to a parent. Add a counterexample involving sparse bins, mixed regimes, a flat but dependent PIT sequence, a flat marginal rank histogram with wrong covariance, hidden tie handling, separation or nonlinear miscalibration. State the extra evidence that would distinguish explanations. Finish with one supported sentence, one unsupported sentence and one useful next measurement.

Workshop 2: Observation

Begin with this mechanism: Set y=.67449. Recreate the concrete case: Use the same units. Write outcome units, CDF values, histogram bins, time order, jump limits, randomisation and dependence with signs, identifiers and assumptions. Calculate the smallest non-trivial example by hand and reproduce it independently. Challenge this limitation: One case cannot test uniformity. Complete the transfer step: Label case. Change exactly one forecast probability, outcome, bin edge, count, interval method, CDF, scale parameter, lead time, PIT value, ensemble member, observation, tie, rank, intercept, slope, validation split or dependence assumption. Explain which mathematical object changes, which diagnostic moves and which claim must weaken. Keep target definition, arithmetic, sampling uncertainty and interpretation on separate notebook lines. Explain the result once to a student and once to a parent. Add a counterexample involving sparse bins, mixed regimes, a flat but dependent PIT sequence, a flat marginal rank histogram with wrong covariance, hidden tie handling, separation or nonlinear miscalibration. State the extra evidence that would distinguish explanations. Finish with one supported sentence, one unsupported sentence and one useful next measurement.

Workshop 3: Transform

Begin with this mechanism: Compute u=F(y). Recreate the concrete case: Result is about .75. Write outcome units, CDF values, histogram bins, time order, jump limits, randomisation and dependence with signs, identifiers and assumptions. Calculate the smallest non-trivial example by hand and reproduce it independently. Challenge this limitation: This is cumulative probability, not density. Complete the transfer step: Name object. Change exactly one forecast probability, outcome, bin edge, count, interval method, CDF, scale parameter, lead time, PIT value, ensemble member, observation, tie, rank, intercept, slope, validation split or dependence assumption. Explain which mathematical object changes, which diagnostic moves and which claim must weaken. Keep target definition, arithmetic, sampling uncertainty and interpretation on separate notebook lines. Explain the result once to a student and once to a parent. Add a counterexample involving sparse bins, mixed regimes, a flat but dependent PIT sequence, a flat marginal rank histogram with wrong covariance, hidden tie handling, separation or nonlinear miscalibration. State the extra evidence that would distinguish explanations. Finish with one supported sentence, one unsupported sentence and one useful next measurement.

Workshop 4: Range

Begin with this mechanism: Check 0<=u<=1. Recreate the concrete case: Record full precision. Write outcome units, CDF values, histogram bins, time order, jump limits, randomisation and dependence with signs, identifiers and assumptions. Calculate the smallest non-trivial example by hand and reproduce it independently. Challenge this limitation: Numerical truncation can pile at boundaries. Complete the transfer step: Audit code. Change exactly one forecast probability, outcome, bin edge, count, interval method, CDF, scale parameter, lead time, PIT value, ensemble member, observation, tie, rank, intercept, slope, validation split or dependence assumption. Explain which mathematical object changes, which diagnostic moves and which claim must weaken. Keep target definition, arithmetic, sampling uncertainty and interpretation on separate notebook lines. Explain the result once to a student and once to a parent. Add a counterexample involving sparse bins, mixed regimes, a flat but dependent PIT sequence, a flat marginal rank histogram with wrong covariance, hidden tie handling, separation or nonlinear miscalibration. State the extra evidence that would distinguish explanations. Finish with one supported sentence, one unsupported sentence and one useful next measurement.

Did You Know? A sophisticated adjustment can be algebraically correct and still answer the wrong scientific question when samples, labels, batches or validation boundaries are wrong.

Workshop 5: Repeat

Begin with this mechanism: Compute one PIT per forecast case. Recreate the concrete case: Preserve chronological order. Write outcome units, CDF values, histogram bins, time order, jump limits, randomisation and dependence with signs, identifiers and assumptions. Calculate the smallest non-trivial example by hand and reproduce it independently. Challenge this limitation: Pooling regimes can hide failure. Complete the transfer step: Keep metadata. Change exactly one forecast probability, outcome, bin edge, count, interval method, CDF, scale parameter, lead time, PIT value, ensemble member, observation, tie, rank, intercept, slope, validation split or dependence assumption. Explain which mathematical object changes, which diagnostic moves and which claim must weaken. Keep target definition, arithmetic, sampling uncertainty and interpretation on separate notebook lines. Explain the result once to a student and once to a parent. Add a counterexample involving sparse bins, mixed regimes, a flat but dependent PIT sequence, a flat marginal rank histogram with wrong covariance, hidden tie handling, separation or nonlinear miscalibration. State the extra evidence that would distinguish explanations. Finish with one supported sentence, one unsupported sentence and one useful next measurement.

Workshop 6: Uniform target

Begin with this mechanism: Compare histogram with uniform counts. Recreate the concrete case: Use declared bins. Write outcome units, CDF values, histogram bins, time order, jump limits, randomisation and dependence with signs, identifiers and assumptions. Calculate the smallest non-trivial example by hand and reproduce it independently. Challenge this limitation: Visual flatness has sampling variation. Complete the transfer step: Add bands. Change exactly one forecast probability, outcome, bin edge, count, interval method, CDF, scale parameter, lead time, PIT value, ensemble member, observation, tie, rank, intercept, slope, validation split or dependence assumption. Explain which mathematical object changes, which diagnostic moves and which claim must weaken. Keep target definition, arithmetic, sampling uncertainty and interpretation on separate notebook lines. Explain the result once to a student and once to a parent. Add a counterexample involving sparse bins, mixed regimes, a flat but dependent PIT sequence, a flat marginal rank histogram with wrong covariance, hidden tie handling, separation or nonlinear miscalibration. State the extra evidence that would distinguish explanations. Finish with one supported sentence, one unsupported sentence and one useful next measurement.

Workshop 7: Independence

Begin with this mechanism: Inspect autocorrelation or valid dependence tests. Recreate the concrete case: Match lead time. Write outcome units, CDF values, histogram bins, time order, jump limits, randomisation and dependence with signs, identifiers and assumptions. Calculate the smallest non-trivial example by hand and reproduce it independently. Challenge this limitation: Uniformity alone is insufficient for conditional density claims. Complete the transfer step: Separate checks. Change exactly one forecast probability, outcome, bin edge, count, interval method, CDF, scale parameter, lead time, PIT value, ensemble member, observation, tie, rank, intercept, slope, validation split or dependence assumption. Explain which mathematical object changes, which diagnostic moves and which claim must weaken. Keep target definition, arithmetic, sampling uncertainty and interpretation on separate notebook lines. Explain the result once to a student and once to a parent. Add a counterexample involving sparse bins, mixed regimes, a flat but dependent PIT sequence, a flat marginal rank histogram with wrong covariance, hidden tie handling, separation or nonlinear miscalibration. State the extra evidence that would distinguish explanations. Finish with one supported sentence, one unsupported sentence and one useful next measurement.

Workshop 8: U shape

Begin with this mechanism: Note excess near zero and one. Recreate the concrete case: Consider underdispersion. Write outcome units, CDF values, histogram bins, time order, jump limits, randomisation and dependence with signs, identifiers and assumptions. Calculate the smallest non-trivial example by hand and reproduce it independently. Challenge this limitation: Other mechanisms can mimic shape. Complete the transfer step: Use cautious language. Change exactly one forecast probability, outcome, bin edge, count, interval method, CDF, scale parameter, lead time, PIT value, ensemble member, observation, tie, rank, intercept, slope, validation split or dependence assumption. Explain which mathematical object changes, which diagnostic moves and which claim must weaken. Keep target definition, arithmetic, sampling uncertainty and interpretation on separate notebook lines. Explain the result once to a student and once to a parent. Add a counterexample involving sparse bins, mixed regimes, a flat but dependent PIT sequence, a flat marginal rank histogram with wrong covariance, hidden tie handling, separation or nonlinear miscalibration. State the extra evidence that would distinguish explanations. Finish with one supported sentence, one unsupported sentence and one useful next measurement.

Did You Know? A sophisticated adjustment can be algebraically correct and still answer the wrong scientific question when samples, labels, batches or validation boundaries are wrong.

Workshop 9: Mound

Begin with this mechanism: Note excess near .5. Recreate the concrete case: Consider overdispersion. Write outcome units, CDF values, histogram bins, time order, jump limits, randomisation and dependence with signs, identifiers and assumptions. Calculate the smallest non-trivial example by hand and reproduce it independently. Challenge this limitation: Mixtures can complicate interpretation. Complete the transfer step: Check strata. Change exactly one forecast probability, outcome, bin edge, count, interval method, CDF, scale parameter, lead time, PIT value, ensemble member, observation, tie, rank, intercept, slope, validation split or dependence assumption. Explain which mathematical object changes, which diagnostic moves and which claim must weaken. Keep target definition, arithmetic, sampling uncertainty and interpretation on separate notebook lines. Explain the result once to a student and once to a parent. Add a counterexample involving sparse bins, mixed regimes, a flat but dependent PIT sequence, a flat marginal rank histogram with wrong covariance, hidden tie handling, separation or nonlinear miscalibration. State the extra evidence that would distinguish explanations. Finish with one supported sentence, one unsupported sentence and one useful next measurement.

Workshop 10: Tilt

Begin with this mechanism: Check one side exceeds the other. Recreate the concrete case: Consider location bias. Write outcome units, CDF values, histogram bins, time order, jump limits, randomisation and dependence with signs, identifiers and assumptions. Calculate the smallest non-trivial example by hand and reproduce it independently. Challenge this limitation: Bias may vary by regime. Complete the transfer step: Stratify predeclared. Change exactly one forecast probability, outcome, bin edge, count, interval method, CDF, scale parameter, lead time, PIT value, ensemble member, observation, tie, rank, intercept, slope, validation split or dependence assumption. Explain which mathematical object changes, which diagnostic moves and which claim must weaken. Keep target definition, arithmetic, sampling uncertainty and interpretation on separate notebook lines. Explain the result once to a student and once to a parent. Add a counterexample involving sparse bins, mixed regimes, a flat but dependent PIT sequence, a flat marginal rank histogram with wrong covariance, hidden tie handling, separation or nonlinear miscalibration. State the extra evidence that would distinguish explanations. Finish with one supported sentence, one unsupported sentence and one useful next measurement.

Workshop 11: Discrete jump

Begin with this mechanism: Compute F(y-) and F(y). Recreate the concrete case: Recognise ordinary PIT is not uniform. Write outcome units, CDF values, histogram bins, time order, jump limits, randomisation and dependence with signs, identifiers and assumptions. Calculate the smallest non-trivial example by hand and reproduce it independently. Challenge this limitation: Do not apply continuous theory blindly. Complete the transfer step: State support. Change exactly one forecast probability, outcome, bin edge, count, interval method, CDF, scale parameter, lead time, PIT value, ensemble member, observation, tie, rank, intercept, slope, validation split or dependence assumption. Explain which mathematical object changes, which diagnostic moves and which claim must weaken. Keep target definition, arithmetic, sampling uncertainty and interpretation on separate notebook lines. Explain the result once to a student and once to a parent. Add a counterexample involving sparse bins, mixed regimes, a flat but dependent PIT sequence, a flat marginal rank histogram with wrong covariance, hidden tie handling, separation or nonlinear miscalibration. State the extra evidence that would distinguish explanations. Finish with one supported sentence, one unsupported sentence and one useful next measurement.

Workshop 12: Randomisation

Begin with this mechanism: Sample within the CDF jump. Recreate the concrete case: Record seed or deterministic equivalent. Write outcome units, CDF values, histogram bins, time order, jump limits, randomisation and dependence with signs, identifiers and assumptions. Calculate the smallest non-trivial example by hand and reproduce it independently. Challenge this limitation: Hidden randomisation hurts reproducibility. Complete the transfer step: Declare method. Change exactly one forecast probability, outcome, bin edge, count, interval method, CDF, scale parameter, lead time, PIT value, ensemble member, observation, tie, rank, intercept, slope, validation split or dependence assumption. Explain which mathematical object changes, which diagnostic moves and which claim must weaken. Keep target definition, arithmetic, sampling uncertainty and interpretation on separate notebook lines. Explain the result once to a student and once to a parent. Add a counterexample involving sparse bins, mixed regimes, a flat but dependent PIT sequence, a flat marginal rank histogram with wrong covariance, hidden tie handling, separation or nonlinear miscalibration. State the extra evidence that would distinguish explanations. Finish with one supported sentence, one unsupported sentence and one useful next measurement.

Did You Know? A sophisticated adjustment can be algebraically correct and still answer the wrong scientific question when samples, labels, batches or validation boundaries are wrong.

Workshop 13: Histogram bins

Begin with this mechanism: Freeze boundaries before inspection. Recreate the concrete case: Report counts. Write outcome units, CDF values, histogram bins, time order, jump limits, randomisation and dependence with signs, identifiers and assumptions. Calculate the smallest non-trivial example by hand and reproduce it independently. Challenge this limitation: Many bins create noise. Complete the transfer step: Use sensitivity analysis. Change exactly one forecast probability, outcome, bin edge, count, interval method, CDF, scale parameter, lead time, PIT value, ensemble member, observation, tie, rank, intercept, slope, validation split or dependence assumption. Explain which mathematical object changes, which diagnostic moves and which claim must weaken. Keep target definition, arithmetic, sampling uncertainty and interpretation on separate notebook lines. Explain the result once to a student and once to a parent. Add a counterexample involving sparse bins, mixed regimes, a flat but dependent PIT sequence, a flat marginal rank histogram with wrong covariance, hidden tie handling, separation or nonlinear miscalibration. State the extra evidence that would distinguish explanations. Finish with one supported sentence, one unsupported sentence and one useful next measurement.

Workshop 14: Proper score

Begin with this mechanism: Add log score or CRPS. Recreate the concrete case: Measure sharpness-aware accuracy. Write outcome units, CDF values, histogram bins, time order, jump limits, randomisation and dependence with signs, identifiers and assumptions. Calculate the smallest non-trivial example by hand and reproduce it independently. Challenge this limitation: PIT calibration alone does not rank all forecasts. Complete the transfer step: Triangulate. Change exactly one forecast probability, outcome, bin edge, count, interval method, CDF, scale parameter, lead time, PIT value, ensemble member, observation, tie, rank, intercept, slope, validation split or dependence assumption. Explain which mathematical object changes, which diagnostic moves and which claim must weaken. Keep target definition, arithmetic, sampling uncertainty and interpretation on separate notebook lines. Explain the result once to a student and once to a parent. Add a counterexample involving sparse bins, mixed regimes, a flat but dependent PIT sequence, a flat marginal rank histogram with wrong covariance, hidden tie handling, separation or nonlinear miscalibration. State the extra evidence that would distinguish explanations. Finish with one supported sentence, one unsupported sentence and one useful next measurement.

Workshop 15: Uncertainty

Begin with this mechanism: Use methods respecting serial dependence. Recreate the concrete case: Report effective sample limits. Write outcome units, CDF values, histogram bins, time order, jump limits, randomisation and dependence with signs, identifiers and assumptions. Calculate the smallest non-trivial example by hand and reproduce it independently. Challenge this limitation: Forecast cases often overlap. Complete the transfer step: Avoid iid fiction. Change exactly one forecast probability, outcome, bin edge, count, interval method, CDF, scale parameter, lead time, PIT value, ensemble member, observation, tie, rank, intercept, slope, validation split or dependence assumption. Explain which mathematical object changes, which diagnostic moves and which claim must weaken. Keep target definition, arithmetic, sampling uncertainty and interpretation on separate notebook lines. Explain the result once to a student and once to a parent. Add a counterexample involving sparse bins, mixed regimes, a flat but dependent PIT sequence, a flat marginal rank histogram with wrong covariance, hidden tie handling, separation or nonlinear miscalibration. State the extra evidence that would distinguish explanations. Finish with one supported sentence, one unsupported sentence and one useful next measurement.

Workshop 16: Claim

Begin with this mechanism: Name CDF, support and lead time. Recreate the concrete case: Teaching PIT is .75. Write outcome units, CDF values, histogram bins, time order, jump limits, randomisation and dependence with signs, identifiers and assumptions. Calculate the smallest non-trivial example by hand and reproduce it independently. Challenge this limitation: Do not call one value calibrated. Complete the transfer step: Bound conclusion. Change exactly one forecast probability, outcome, bin edge, count, interval method, CDF, scale parameter, lead time, PIT value, ensemble member, observation, tie, rank, intercept, slope, validation split or dependence assumption. Explain which mathematical object changes, which diagnostic moves and which claim must weaken. Keep target definition, arithmetic, sampling uncertainty and interpretation on separate notebook lines. Explain the result once to a student and once to a parent. Add a counterexample involving sparse bins, mixed regimes, a flat but dependent PIT sequence, a flat marginal rank histogram with wrong covariance, hidden tie handling, separation or nonlinear miscalibration. State the extra evidence that would distinguish explanations. Finish with one supported sentence, one unsupported sentence and one useful next measurement.