I have the following proposition to prove:
For all m∈ Z, m⋅0=0=0⋅m
I can use the following axioms:
- commutativity
- associativity
- distributivity
- identity for addition (0)
- identity for multiplication (1)
- additive inverse
- cancellation: Let m,n,p be integers. If m⋅n=m⋅p and m≠0, then n=p.
Here is my proof:
m⋅0=m⋅(m+(−m))m⋅0=(m⋅m)+(m⋅(−m))m⋅0=(m⋅m)+(m⋅−1⋅m)m⋅0=(m⋅m)+−1⋅(m⋅m)m⋅0=(m⋅m)−(m⋅m)m⋅0=0
However, I am not sure, given a simple set of axioms, that this solution is correct. More specifically, is factoring −m as −1⋅m acceptable? Or is another proposition that I should prove beforehand?
Answer
Assume that m is an integer. By the commutative property we know that m.0 = 0.m.
Now, we only need to prove only that m.0 = 0. We use m = m, then
m.1 = m.1 because 1 is the identity under multiplication.
m.(1+0) = m.1 because 0 is the identity under addition.
Using the distributive property,
(m.1)+(m.0) = (m.1)
m +(m.0) = m
-m + m +(m.0) = -m + m (-m is the inverse of m under addition.)
(-m + m) +(m.0) = (-m + m), associative property.
0 +(m.0) = 0 because the definition of the identity under addition.
m.0 = 0 Q.E.D.
No comments:
Post a Comment