Justify each step using commutativity and associativity

  • Thread starter Thread starter happyprimate
  • Start date Start date
AI Thread Summary
The discussion focuses on justifying each step in proving the identity (a-b)+(c-d) = (a+c)+(-b-d) using commutativity and associativity. The proof is structured to demonstrate the transformation of the left side to the right side through various associative and commutative properties. Feedback suggests improving the presentation by formatting the steps as equations for clarity. Participants agree on the importance of separating new identity problems into different threads for better organization, while also discussing the nuances of associativity in the proof steps. Overall, the conversation emphasizes clarity in mathematical proofs and the proper organization of related queries.
happyprimate
Messages
7
Reaction score
2
Summary:: Justify each step using commutativity and associativity in proving the following identities.
(a-b)+(c-d) = (a+c)+(-b-d)

Exercise 3 Chapter 1 Basic Mathematics Serge Lang

Verifying my answer.

My answer:

(a-b)+(c-d) = (a+c)+(-b-d)

Let p = (a-b)+(c-d) We need to show that p = (a+c)+(-b-d)

(a-b)+(c-d)

a+(-b+(c-d)) Associativity

a+((-b+c)-d) Associativity

a+((c-b)-d) Commutativity

((a+c)-b)-d) Associativity

(a+c)+(-b-d) Associativity

Need feedback on the proof. I am currently working through basic mathematics book by Serge Lang. Thank you.
 
  • Like
Likes Delta2
Physics news on Phys.org
happyprimate said:
Summary:: Justify each step using commutativity and associativity in proving the following identities.
(a-b)+(c-d) = (a+c)+(-b-d)

Exercise 3 Chapter 1 Basic Mathematics Serge Lang

Verifying my answer.

My answer:

(a-b)+(c-d) = (a+c)+(-b-d)

Let p = (a-b)+(c-d) We need to show that p = (a+c)+(-b-d)

(a-b)+(c-d)

a+(-b+(c-d)) Associativity

a+((-b+c)-d) Associativity

a+((c-b)-d) Commutativity

((a+c)-b)-d) Associativity

(a+c)+(-b-d) Associativity

Need feedback on the proof. I am currently working through basic mathematics book by Serge Lang. Thank you.
Looks good.
 
  • Like
Likes happyprimate and jedishrfu
Thank you.
 
  • Like
Likes jedishrfu
happyprimate said:
Thank you.
Only a remark to the presentation. It would be better to write it as equations:
\begin{align*}
(a-b)+(c-d) &\stackrel{Ass.}{=}a+(-b+(c-d)) \\
&\stackrel{Ass.}{=} a+((-b+c)-d) \\
&\stackrel{Com.}{=}a+((c-b)-d) \\
&\stackrel{Ass.}{=} ((a+c)-b)-d) \\
&\stackrel{Ass.}{=} (a+c)+(-b-d)
\end{align*}

I liked that you wrote ##a-b=a+(-b)## because that is what it is: an addition. There is no subtraction on this level. Subtraction is only an abbreviation, not an operation.
 
  • Like
Likes jedishrfu and happyprimate
Thanks a lot fresh_42.
Question! I was trying to work through a few more identities where the solution wasn't provided. Should I post it in the same thread due to the same theme ie proving identities.
 
happyprimate said:
Thanks a lot fresh_42.
Question! I was trying to work through a few more identities where the solution wasn't provided. Should I post it in the same thread due to the same theme?
It's usually better to start a new one. I admit that this rule is not always followed, and we let it slip if the questions are closely related, but a new one is better in case a debate evolves. If the only answer is "this is correct" then it appears that it could well be treated in one thread. Start a new.

If you want a related problem then solve the following:
Show that the group axioms are equivalent to: "For all ##a,b \in G## there is a unique solution to ##a\cdot x=b ## and ##x\cdot a=b##." (non commutative case)
 
  • Like
Likes happyprimate
My only objection is the 4th step is two sets of parentheses adjustments, so maybe should be written as two associativity steps. If you think doing it in one shot is fine, then you can condense the first and second step into one line also
 
  • Like
Likes FactChecker and happyprimate
fresh_42 said:
It would be better to write it as equations:
Strongly agree...
 
  • Like
Likes happyprimate
Back
Top