Return to Answer

$\overbrace{\bf\ Law\ of\ Signs}^{\rm\Large {(-x)(-y)}\ =\ xy} $ proof: $\rm\,\ (-x)(-y) = (-x)(-y) + \color{#c00}x(\overbrace{\color{#c00}{-y} + y}^{\Large =\,0}) = (\overbrace{-x+\color{#c00}x}^{\Large =\,0})(\color{#c00}{-y}) + xy = xy$

Equivalently, $ $ evaluate $\rm\,\ \overline{(-x)(-y)\ +\ } \overline{ \underline {\color{#c00}{x(-y)}}}\underline{\phantom{(}\! +\,\color{#0a0}{xy}}\, $ in $\:\!2\:\!$ ways (note over/underlined terms $ = 0)$

Said more conceptually $\rm (-x)(-y)\ $ and $\rm\:\color{#0a0}{xy}\:$ are both additive inverses of $\rm\ \color{#c00}{x(-y)}\ $ so they are equal by uniqueness of inverses: $ $ i.e. if $\rm\,\color{#c00}a\,$ has two additive inverses $\rm\,{-a}\,$ and $\rm\,\color{#0a0}{-a},\,$ then

$$\rm {-a}\, =\, {-a}+\overbrace{(\color{#c00}a+\color{#0a0}{-a})}^{\large =\,0}\, =\, \overbrace{({-a}+\color{#c00}a)}^{\large =\,0}+\color{#0a0}{-a}\, =\, \color{#0a0}{-a}\qquad $$

Said equivalently, $ $ evaluate $\rm\,\ \overline{-a\, +\!\!} \overline{\phantom{+}\! \underline {\color{#c00}{a}}}\underline{\ + \color{#0a0}{-a}}\ $ in $\,2\,$ ways (note over/underlined terms $ = 0)$

This proof of the Law of Signs uses well-known laws of positive integers (esp. the distributive law), so if we require that these laws persist in the other "number" systems, then the Law of Signs is a logical consequence of these basic laws (abstracted from those of positive integers).

These fundamental laws of "numbers" are axiomatized by the algebraic structure known as a ring, and various specializations thereof. Since the above proof uses only ring laws (most notably the distributive law), the Law of Signs holds true in every ring, e.g. rings of polynomials, power series, matrices, differential operators, etc. In fact every nontrivial ring theorem (i.e. one that does not degenerate to a theorem about the underlying additive group or multiplicative monoid), must employ the distributive law, since that is the only law that connects the additive and multiplicative structures that combine to form the ring structure. Without the distributive law a ring degenerates to a set with two completely unrelated additive and multiplicative structures. So, in a sense, the distributive law is a keystone of the ring structure.

Remark $\ $ More generally the Law of Signs holds for any odd functions under composition, e.g. polynomials with all terms having odd power. Indeed we have

$$\begin{align}\rm f(g)\ =\ (-f)\ (-g)\ =\:\! -(f(-g)) \iff\,&\rm \ f(-g)\ = -(f(g))\\ \rm \overset{ \large g(x)\,=\,x}\iff&\rm \ f(-x)\ = -f(x),\ \ \text{ie. $\rm\:f\:$ is odd} \end{align}\qquad$$

Generally such functions enjoy only a weaker near-ring structure. In the above case of rings, distributivity implies that multiplication is linear hence odd (viewing the ring in Cayley-style as the ring of endormorphisms of its abelian additive group, i.e. representing each ring element $\rm\ r\ $ by the linear map $\rm\ x \to r\ x,\ $ i.e. as a $1$-dim matrix).

$\overbrace{\bf\ Law\ of\ Signs}^{\rm\Large {(-x)(-y)}\ =\ xy} $ proof: $\rm\,\ (-x)(-y) = (-x)(-y) + \color{#c00}x(\overbrace{\color{#c00}{-y} + y}^{\Large =\,0}) = (\overbrace{-x+\color{#c00}x}^{\Large =\,0})(\color{#c00}{-y}) + xy = xy$

Equivalently, $ $ evaluate $\rm\,\ \overline{(-x)(-y)\ +\ } \overline{ \underline {\color{#c00}{x(-y)}}}\underline{\phantom{(}\! +\,\color{#0a0}{xy}}\, $ in $\:\!2\:\!$ ways (note over/underlined terms $ = 0)$

Said more conceptually $\rm (-x)(-y)\ $ and $\rm\:\color{#0a0}{xy}\:$ are both additive inverses of $\rm\ \color{#c00}{x(-y)}\ $ so they are equal by uniqueness of inverses: $ $ i.e. if $\rm\,\color{#c00}a\,$ has two additive inverses $\rm\,{-a}\,$ and $\rm\,\color{#0a0}{-a},\,$ then

$$\rm {-a}\, =\, {-a}+\overbrace{(\color{#c00}a+\color{#0a0}{-a})}^{\large =\,0}\, =\, \overbrace{({-a}+\color{#c00}a)}^{\large =\,0}+\color{#0a0}{-a}\, =\, \color{#0a0}{-a}\qquad $$

Said equivalently, $ $ evaluate $\rm\,\ \overline{-a\, +\!\!} \overline{\phantom{+}\! \underline {\color{#c00}{a}}}\underline{\ + \color{#0a0}{-a}}\ $ in $\,2\,$ ways (note over/underlined terms $ = 0)$

This proof of the Law of Signs uses well-known laws of positive integers (esp. the distributive law), so if we require that these laws persist in the other "number" systems, then the Law of Signs is a logical consequence of these basic laws (abstracted from those of (positive) integers).

These fundamental laws of "numbers" are axiomatized by the algebraic structure known as a ring, and various specializations thereof. Since the above proof uses only ring laws (most notably the distributive law), the Law of Signs holds true in every ring, e.g. rings of polynomials, power series, matrices, differential operators, etc. In fact every nontrivial ring theorem (i.e. one that does not degenerate to a theorem about the underlying additive group or multiplicative monoid), must employ the distributive law, since that is the only law that connects the additive and multiplicative structures that combine to form the ring structure. Without the distributive law a ring degenerates to a set with two completely unrelated additive and multiplicative structures. So, in a sense, the distributive law is a keystone of the ring structure.

Remark $\ $ More generally the Law of Signs holds for any odd functions under composition, e.g. polynomials with all terms having odd power. Indeed we have

$$\begin{align}\rm f(g)\ =\ (-f)\ (-g)\ =\:\! -(f(-g)) \iff\,&\rm \ f(-g)\ = -(f(g))\\ \rm \overset{ \large g(x)\,=\,x}\iff&\rm \ f(-x)\ = -f(x),\ \ \text{ie. $\rm\:f\:$ is odd} \end{align}\qquad$$

Generally such functions enjoy only a weaker near-ring structure. In the above case of rings, distributivity implies that multiplication is linear hence odd (viewing the ring in Cayley-style as the ring of endormorphisms of its abelian additive group, i.e. representing each ring element $\rm\ r\ $ by the linear map $\rm\ x \to r\ x,\ $ i.e. as a $1$-dim matrix).

$\overbrace{\bf\ Law\ of\ Signs}^{\rm\Large {(-x)(-y)}\ =\ xy} $ proof: $\rm\,\ (-x)(-y) = (-x)(-y) + \color{#c00}x(\overbrace{\color{#c00}{-y} + y}^{\Large =\,0}) = (\overbrace{-x+\color{#c00}x}^{\Large =\,0})(\color{#c00}{-y}) + xy = xy$

Equivalently, $ $ evaluate $\rm\,\ \overline{(-x)(-y)\ +\ } \overline{ \underline {\color{#c00}{x(-y)}}}\underline{\phantom{(}\! +\,xy}\, $ in $\:\!2\:\!$ ways (note over/underlined terms $ = 0)$

Said more conceptually $\rm (-x)(-y)\ $ and $\rm\:\color{#0a0}{xy}\:$ are both inverses of $\rm\ \color{#c00}{x(-y)}\ $ so they are equal by uniqueness of inverses: $ $ if $\rm\,\color{#c00}a\,$ has two additive inverses $\rm\,{-a}\,$ and $\rm\,\color{#0a0}{-a},\,$ then

$$\rm {-a}\, =\, {-a}+\overbrace{(\color{#c00}a+\color{#0a0}{-a})}^{\large =\,0}\, =\, \overbrace{({-a}+\color{#c00}a)}^{\large =\,0}+\color{#0a0}{-a}\, =\, \color{#0a0}{-a}\qquad $$

Said equivalently, $ $ evaluate $\rm\,\ \overline{-a\, +\!\!} \overline{\phantom{+}\! \underline {\color{#c00}{a}}}\underline{\ + \color{#0a0}{-a}}\ $ in $\,2\,$ ways (note over/underlined terms $ = 0)$

This proof of the Law of Signs uses well-known laws of positive integers (esp. the distributive law), so if we require that these laws persist in the larger system of positive and negative integers, then the Law of Signs is a logical consequence of these basic laws of positive integers.

These fundamental laws of "numbers" are axiomatized by the algebraic structure known as a ring, and various specializations thereof. Since the above proof uses only ring laws (most notably the distributive law), the Law of Signs holds true in every ring, e.g. rings of polynomials, power series, matrices, differential operators, etc. In fact every nontrivial ring theorem (i.e. one that does not degenerate to a theorem about the underlying additive group or multiplicative monoid), must employ the distributive law, since that is the only law that connects the additive and multiplicative structures that combine to form the ring structure. Without the distributive law a ring degenerates to a set with two completely unrelated additive and multiplicative structures. So, in a sense, the distributive law is a keystone of the ring structure.

Remark $\ $ More generally the Law of Signs holds for any odd functions under composition, e.g. polynomials with all terms having odd power. Indeed we have

$$\begin{align}\rm f(g)\ =\ (-f)\ (-g)\ =\:\! -(f(-g)) \iff\,&\rm \ f(-g)\ = -(f(g))\\ \rm \overset{ \large g(x)\,=\,x}\iff&\rm \ f(-x)\ = -f(x),\ \ \text{ie. $\rm\:f\:$ is odd} \end{align}\qquad$$

Generally such functions enjoy only a weaker near-ring structure. In the above case of rings, distributivity implies that multiplication is linear hence odd (viewing the ring in Cayley-style as the ring of endormorphisms of its abelian additive group, i.e. representing each ring element $\rm\ r\ $ by the linear map $\rm\ x \to r\ x,\ $ i.e. as a $1$-dim matrix).

$\overbrace{\bf\ Law\ of\ Signs}^{\rm\Large {(-x)(-y)}\ =\ xy} $ proof: $\rm\,\ (-x)(-y) = (-x)(-y) + \color{#c00}x(\overbrace{\color{#c00}{-y} + y}^{\Large =\,0}) = (\overbrace{-x+\color{#c00}x}^{\Large =\,0})(\color{#c00}{-y}) + xy = xy$

Equivalently, $ $ evaluate $\rm\,\ \overline{(-x)(-y)\ +\ } \overline{ \underline {\color{#c00}{x(-y)}}}\underline{\phantom{(}\! +\,\color{#0a0}{xy}}\, $ in $\:\!2\:\!$ ways (note over/underlined terms $ = 0)$

Said more conceptually $\rm (-x)(-y)\ $ and $\rm\:\color{#0a0}{xy}\:$ are both additive inverses of $\rm\ \color{#c00}{x(-y)}\ $ so they are equal by uniqueness of inverses: $ $ i.e. if $\rm\,\color{#c00}a\,$ has two additive inverses $\rm\,{-a}\,$ and $\rm\,\color{#0a0}{-a},\,$ then

$$\rm {-a}\, =\, {-a}+\overbrace{(\color{#c00}a+\color{#0a0}{-a})}^{\large =\,0}\, =\, \overbrace{({-a}+\color{#c00}a)}^{\large =\,0}+\color{#0a0}{-a}\, =\, \color{#0a0}{-a}\qquad $$

Said equivalently, $ $ evaluate $\rm\,\ \overline{-a\, +\!\!} \overline{\phantom{+}\! \underline {\color{#c00}{a}}}\underline{\ + \color{#0a0}{-a}}\ $ in $\,2\,$ ways (note over/underlined terms $ = 0)$

This proof of the Law of Signs uses well-known laws of positive integers (esp. the distributive law), so if we require that these laws persist in the other "number" systems, then the Law of Signs is a logical consequence of these basic laws (abstracted from those of positive integers).

These fundamental laws of "numbers" are axiomatized by the algebraic structure known as a ring, and various specializations thereof. Since the above proof uses only ring laws (most notably the distributive law), the Law of Signs holds true in every ring, e.g. rings of polynomials, power series, matrices, differential operators, etc. In fact every nontrivial ring theorem (i.e. one that does not degenerate to a theorem about the underlying additive group or multiplicative monoid), must employ the distributive law, since that is the only law that connects the additive and multiplicative structures that combine to form the ring structure. Without the distributive law a ring degenerates to a set with two completely unrelated additive and multiplicative structures. So, in a sense, the distributive law is a keystone of the ring structure.

Remark $\ $ More generally the Law of Signs holds for any odd functions under composition, e.g. polynomials with all terms having odd power. Indeed we have

$$\begin{align}\rm f(g)\ =\ (-f)\ (-g)\ =\:\! -(f(-g)) \iff\,&\rm \ f(-g)\ = -(f(g))\\ \rm \overset{ \large g(x)\,=\,x}\iff&\rm \ f(-x)\ = -f(x),\ \ \text{ie. $\rm\:f\:$ is odd} \end{align}\qquad$$

Generally such functions enjoy only a weaker near-ring structure. In the above case of rings, distributivity implies that multiplication is linear hence odd (viewing the ring in Cayley-style as the ring of endormorphisms of its abelian additive group, i.e. representing each ring element $\rm\ r\ $ by the linear map $\rm\ x \to r\ x,\ $ i.e. as a $1$-dim matrix).

$\overbrace{\bf\ Law\ of\ Signs}^{\rm\Large {(-x)(-y)}\ =\ xy} $ proof: $\rm\,\ (-x)(-y) = (-x)(-y) + \color{#c00}x(\overbrace{\color{#c00}{-y} + y}^{\Large =\,0}) = (\overbrace{-x+\color{#c00}x}^{\Large =\,0})(\color{#c00}{-y}) + xy = xy$

Equivalently, $ $ evaluate $\rm\,\ \overline{(-x)(-y)\ +\ } \overline{ \underline {\color{#c00}{x(-y)}}}\underline{\phantom{(}\! +\,xy}\, $ in $\:\!2\:\!$ ways (note over/underlined terms $ = 0)$

Said more conceptually $\rm (-x)(-y)\ $ and $\rm\:xy\:$ are both inverses of $\rm\ \color{#c00}{x(-y)}\ $ so they are equal by uniqueness of inverses: $ $ if $\rm\,\color{#c00}a\,$ has two additive inverses $\rm\,{-a}\,$ and $\rm\,\color{#0a0}{-a},\,$ then

$$\rm {-a}\, =\, {-a}+\overbrace{(\color{#c00}a+\color{#0a0}{-a})}^{\large =\,0}\, =\, \overbrace{({-a}+\color{#c00}a)}^{\large =\,0}+\color{#0a0}{-a}\, =\, \color{#0a0}{-a}\qquad $$

Said equivalently, $ $ evaluate $\rm\,\ \overline{-a\, +\!\!} \overline{\phantom{+}\! \underline {\color{#c00}{a}}}\underline{\ + \color{#0a0}{-a}}\ $ in $\,2\,$ (note over/underlined terms $ = 0)$

This proof of the Law of Signs uses well-known laws of positive integers (esp. the distributive law), so if we require that these laws persist in the larger system of positive and negative integers, then the Law of Signs is a logical consequence of these basic laws of positive integers.

These fundamental laws of "numbers" are axiomatized by the algebraic structure known as a ring, and various specializations thereof. Since the above proof uses only ring laws (most notably the distributive law), the Law of Signs holds true in every ring, e.g. rings of polynomials, power series, matrices, differential operators, etc. In fact every nontrivial ring theorem (i.e. one that does not degenerate to a theorem about the underlying additive group or multiplicative monoid), must employ the distributive law, since that is the only law that connects the additive and multiplicative structures that combine to form the ring structure. Without the distributive law a ring degenerates to a set with two completely unrelated additive and multiplicative structures. So, in a sense, the distributive law is a keystone of the ring structure.

Remark $\ $ More generally the Law of Signs holds for any odd functions under composition, e.g. polynomials with all terms having odd power. Indeed we have

$\qquad\rm\ \ f(g)\ =\ (-f)\ (-g)\ = -(f(-g))\ \iff\ f(-g)\ = -(f(g)) $

$\qquad\rm \phantom{\ \ (-f)\ (-g)\ = -(f(-g))\ =\ f(g)\ }\!\!\overset{\ \large g(x)=x}\iff \ f(-x)\ = -f(x),\ $ ie. $\rm\:f\:$ is odd

Generally such functions enjoy only a weaker near-ring structure. In the above case of rings, distributivity implies that multiplication is linear hence odd (viewing the ring in Cayley-style as the ring of endormorphisms of its abelian additive group, i.e. representing each ring element $\rm\ r\ $ by the linear map $\rm\ x \to r\ x,\ $ i.e. as a $1$-dim matrix).

$\overbrace{\bf\ Law\ of\ Signs}^{\rm\Large {(-x)(-y)}\ =\ xy} $ proof: $\rm\,\ (-x)(-y) = (-x)(-y) + \color{#c00}x(\overbrace{\color{#c00}{-y} + y}^{\Large =\,0}) = (\overbrace{-x+\color{#c00}x}^{\Large =\,0})(\color{#c00}{-y}) + xy = xy$

Equivalently, $ $ evaluate $\rm\,\ \overline{(-x)(-y)\ +\ } \overline{ \underline {\color{#c00}{x(-y)}}}\underline{\phantom{(}\! +\,xy}\, $ in $\:\!2\:\!$ ways (note over/underlined terms $ = 0)$

Said more conceptually $\rm (-x)(-y)\ $ and $\rm\:\color{#0a0}{xy}\:$ are both inverses of $\rm\ \color{#c00}{x(-y)}\ $ so they are equal by uniqueness of inverses: $ $ if $\rm\,\color{#c00}a\,$ has two additive inverses $\rm\,{-a}\,$ and $\rm\,\color{#0a0}{-a},\,$ then

$$\rm {-a}\, =\, {-a}+\overbrace{(\color{#c00}a+\color{#0a0}{-a})}^{\large =\,0}\, =\, \overbrace{({-a}+\color{#c00}a)}^{\large =\,0}+\color{#0a0}{-a}\, =\, \color{#0a0}{-a}\qquad $$

Said equivalently, $ $ evaluate $\rm\,\ \overline{-a\, +\!\!} \overline{\phantom{+}\! \underline {\color{#c00}{a}}}\underline{\ + \color{#0a0}{-a}}\ $ in $\,2\,$ ways (note over/underlined terms $ = 0)$

This proof of the Law of Signs uses well-known laws of positive integers (esp. the distributive law), so if we require that these laws persist in the larger system of positive and negative integers, then the Law of Signs is a logical consequence of these basic laws of positive integers.

These fundamental laws of "numbers" are axiomatized by the algebraic structure known as a ring, and various specializations thereof. Since the above proof uses only ring laws (most notably the distributive law), the Law of Signs holds true in every ring, e.g. rings of polynomials, power series, matrices, differential operators, etc. In fact every nontrivial ring theorem (i.e. one that does not degenerate to a theorem about the underlying additive group or multiplicative monoid), must employ the distributive law, since that is the only law that connects the additive and multiplicative structures that combine to form the ring structure. Without the distributive law a ring degenerates to a set with two completely unrelated additive and multiplicative structures. So, in a sense, the distributive law is a keystone of the ring structure.

Remark $\ $ More generally the Law of Signs holds for any odd functions under composition, e.g. polynomials with all terms having odd power. Indeed we have

$$\begin{align}\rm f(g)\ =\ (-f)\ (-g)\ =\:\! -(f(-g)) \iff\,&\rm \ f(-g)\ = -(f(g))\\ \rm \overset{ \large g(x)\,=\,x}\iff&\rm \ f(-x)\ = -f(x),\ \ \text{ie. $\rm\:f\:$ is odd} \end{align}\qquad$$

Generally such functions enjoy only a weaker near-ring structure. In the above case of rings, distributivity implies that multiplication is linear hence odd (viewing the ring in Cayley-style as the ring of endormorphisms of its abelian additive group, i.e. representing each ring element $\rm\ r\ $ by the linear map $\rm\ x \to r\ x,\ $ i.e. as a $1$-dim matrix).