Re:The Elements of Differentiable Programming
by clooper on Friday March 22, 2024 @08:38PM
(#39796292)
In my argument a and b are positive and this is true for all ordered rings but not for the dual numbers as you've defined them. Specify the ordering and you will realize h can not be larger nor smaller than 0 because both cases lead to a contradiction.
In any case, I'm dropping out of this thread.
Re:The Elements of Differentiable Programming
by MikeBattaglia on Friday March 22, 2024 @09:14PM
(#39796537)
It isn't true for all ordered rings, and the dual numbers are in fact a counterexample to the claim that it is true.
Beyond that I'm not sure what to tell you, other than it's fairly easy to see that the dual numbers do satisfy the axioms of an ordered ring that I gave. Here's a large survey of various infinitesimal systems by Philip Ehrlich where he also notes the dual numbers are an ordered ring: https://arxiv.org/pdf/1808.03345.pdf.
The correct property is that if a ≤ b, a + c ≤ b + c, and if a ≥ 0 and b ≥ 0, then ab ≥ 0. It is fairly easy to see that these properties hold for dual numbers.