I proving if a + a = 0 then a = 0

  • Thread starter Thread starter jmazurek
  • Start date Start date
jmazurek
Messages
3
Reaction score
0
I need help proving if a + a = 0 then a = 0. Thanks!
 
Last edited:
Physics news on Phys.org
Are you working with ordinary arithmetic, with ordinary (real or complex) numbers? If so then a+a=2a. Thus you have 2a=0. Divide both sides by 2 to get your answer.
 


Sure, I'd be happy to help you with this proof. First, let's start by assuming that a + a = 0. This means that the sum of a and a is equal to 0. Now, we can use the properties of addition to rewrite this as a + a = a + (-a). This is because the additive inverse of a is -a, meaning that when added together, they cancel each other out and result in 0.

Next, we can use the associative property of addition to rearrange the terms and get (a + a) + (-a) = 0. Now, we know that a + a = 0, so we can substitute this in to get 0 + (-a) = 0. Again, using the additive inverse property, we can rewrite this as (-a) = 0.

Finally, we can use the additive identity property to conclude that a = 0. This is because the additive identity of any number is 0, meaning that when added to any number, it remains unchanged.

Therefore, we have proven that if a + a = 0, then a = 0. I hope this helps with your understanding of this proof. Let me know if you have any further questions.
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
Back
Top