Provedattentioninnovationexternal-review-3
Affine innovation: scalar append moment quotient
For all , if and , then
What the notation means · or point at any symbol
- RReal numbers
- The real numbers: every point on the number line. (
ℝ) - x ∈ TVariables
- Z, Pv, Pk, Pvk, w, k, v, s, d, u range over real numbers: the statement must hold for every choice. (
(Z Pv Pk Pvk w k v s d u : ℝ)) - +Addition
- Z plus w. (
Z + w) - ≠Not equal
- Z + w and 0 are different. (
Z + w ≠ 0) - =Equality
- ((Pv + w · v)/(Z + w) + s · (d · ((Pvk + w · v · k)/(Z + w… and (Pv + w · v + s · (d · (Pvk + w · v · k) − u · (Pv + w · v… are the same. (
((Pv + w * v) / (Z + w) + s * (d * ((Pv…) - a/bDivision
- Pv + w · v divided by Z + w. In Lean, dividing by 0 gives 0. (
(Pv + w * v) / (Z + w)) - -Subtraction
- d · (Pk + w · k) minus u · (Z + w). On ℕ, Lean's subtraction stops at 0: 2 − 5 = 0. (
d * (Pk + w * k) - u * (Z + w)) - ·Multiplication
- w times k. (
w * k)
theorem innov-affine-moment-append (Z Pv Pk Pvk w k v s d u : ℝ) (hZ : Z + w ≠ 0) (hB : Z + w + s * (d * (Pk + w * k) - u * (Z + w)) ≠ 0) :
((Pv + w * v) / (Z + w) + s * (d * ((Pvk + w * v * k) / (Z + w)) - u * ((Pv + w * v) / (Z + w)))) / (1 + s * (d * ((Pk + w * k) / (Z + w)) - u)) = ((Pv + w * v) + s * (d * (Pvk + w * v * k) - u * (Pv + w * v))) / ((Z + w) + s * (d * (Pk + w * k) - u * (Z + w)))Exact scalar algebra for affine-control moments after an append, assuming both denominators nonzero. Does not verify a floating-point accumulator or vector storage implementation.
How it was proved
- Proved
- 6 October 2026
- By
- Ajax, with the agent “Baguette math & proofs (Claude Code, 2026-10-03)”
- Checked by
- Lean's kernel (Lean 4.33.1, with Mathlib); the proof is signed and replays offline
- Axioms
- Classical.choice, Quot.sound, propext
- Proof
- 16 lines of Lean
Sign in to see the proofThe proof, its signed report and its history.