Initial program 0.1
\[\left(\frac{m \cdot \left(1 - m\right)}{v} - 1\right) \cdot \left(1 - m\right)
\]
Taylor expanded in v around 0 0.1
\[\leadsto \color{blue}{\frac{m \cdot {\left(1 - m\right)}^{2}}{v} + -1 \cdot \left(1 - m\right)}
\]
Simplified0.1
\[\leadsto \color{blue}{\mathsf{fma}\left({\left(1 - m\right)}^{2}, \frac{m}{v}, -1 + m\right)}
\]
Proof
(fma.f64 (pow.f64 (-.f64 1 m) 2) (/.f64 m v) (+.f64 -1 m)): 0 points increase in error, 0 points decrease in error
(fma.f64 (pow.f64 (-.f64 1 m) 2) (/.f64 m v) (+.f64 (Rewrite<= metadata-eval (-.f64 0 1)) m)): 0 points increase in error, 0 points decrease in error
(fma.f64 (pow.f64 (-.f64 1 m) 2) (/.f64 m v) (Rewrite<= associate--r-_binary64 (-.f64 0 (-.f64 1 m)))): 0 points increase in error, 0 points decrease in error
(fma.f64 (pow.f64 (-.f64 1 m) 2) (/.f64 m v) (Rewrite<= neg-sub0_binary64 (neg.f64 (-.f64 1 m)))): 0 points increase in error, 0 points decrease in error
(fma.f64 (pow.f64 (-.f64 1 m) 2) (/.f64 m v) (Rewrite<= mul-1-neg_binary64 (*.f64 -1 (-.f64 1 m)))): 0 points increase in error, 0 points decrease in error
(Rewrite<= fma-def_binary64 (+.f64 (*.f64 (pow.f64 (-.f64 1 m) 2) (/.f64 m v)) (*.f64 -1 (-.f64 1 m)))): 0 points increase in error, 0 points decrease in error
(+.f64 (Rewrite<= *-commutative_binary64 (*.f64 (/.f64 m v) (pow.f64 (-.f64 1 m) 2))) (*.f64 -1 (-.f64 1 m))): 0 points increase in error, 0 points decrease in error
(+.f64 (Rewrite=> associate-*l/_binary64 (/.f64 (*.f64 m (pow.f64 (-.f64 1 m) 2)) v)) (*.f64 -1 (-.f64 1 m))): 13 points increase in error, 5 points decrease in error
Final simplification0.1
\[\leadsto \mathsf{fma}\left({\left(1 - m\right)}^{2}, \frac{m}{v}, m + -1\right)
\]