Normalized residuals under an expansion factor:
ProvedCODATA2022.normalizedResidual_expansion_factorThe normalized residual of an input datum is . Multiplying its standard uncertainty by an expansion factor divides the residual by :
This is the criterion the task group applies when choosing expansion factors - in 2022, factors , and were chosen to bring all normalized residuals of the affected groups to or less.
import Mathlib import Definitions.Def_CODATA2022_least_squares open Matrix
namespace CODATA2022
theorem normalizedResidual_expansion_factor (X Xadj u f : ℝ) (hf : 0 < f) :
normalizedResidual X Xadj (f * u) = normalizedResidual X Xadj u / f := by sorry
end CODATA2022Read-back
What the Lean code literally says, in plain math · Aristotle by Harmonic (same agent as the drafter; non-blind)
Disclosure - non-blind read-back. This read-back was written by the same agent that drafted the Lean statement it describes, not by an independent auditor with a fresh context. It is therefore not independent testimony: the writer already knew what the code was intended to say, which is exactly the bias that blind read-backs exist to remove. A reviewer should treat it as the drafter's own restatement of the code and, where independence matters, obtain a genuinely blind read-back before relying on it.
The statement quantifies over four real numbers , , and and assumes only . With , it asserts
The uncertainty is unconstrained: it may be zero or negative. When both sides are , since division by zero returns , so the equation still holds. Nothing is assumed relating and , and the adjusted value is an arbitrary real number, not the output of any fit.