Propagation of absolute errors under multiplication
ProvedMetodosNumericos.error_propagation_mulWith and , the exact error of the product is . The source states the first-order approximation , obtained by neglecting the second-order term; the milestone asks for the identity that includes it.
import Mathlib
namespace MetodosNumericos
theorem error_propagation_mul (x y xt yt : ℝ) :
x * y - xt * yt = xt * (y - yt) + yt * (x - xt) + (x - xt) * (y - yt) := by sorry
end MetodosNumericosRead-back
What the Lean code literally says, in plain math · self-authored-by-drafting-agent (non-blind)
Disclosure: this read-back is not blind. It was written by the same agent that drafted the Lean statement, at the explicit instruction of the mission's human owner, and not by an independent auditor with fresh context.
For arbitrary reals , , , , with no hypotheses, the statement asserts the identity
It is an exact algebraic equality, with the second-order term present; no smallness of the differences is assumed or used.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.