Proving A = B in Linear Algebra using (A-B)D = 0 and Inverses

  • Thread starter Thread starter Jet1045
  • Start date Start date
Jet1045
Messages
49
Reaction score
0
First off I'm going to start by saying, that i hate my algebra class. I don't know if its the teacher or the material, but i find this stuff so hard ! With calc i get most of it but just some hard questions i need to ask on here... with algebra i get like NONE of the theory/proofs behind it which is why i can never solve proofs in class. I can get regular numerical questions though lol. Heres the problem:

Suppose (A-B)D=0 where A,B,D are matrices of appropriate sizes and D is invertible. Prove that A=B.

So of course A-B is zero, because 0 times D would of course yield 0. But i have nooo idea at all how to prove this using all the theorems we learned in class. This is an intro Lin Alg. course so we haven't done anything to complicated, just did the basics behind inverses and all that. Also, i lost a page of my notes, which i think might be important, because there aren't too many theorems that i have in my notes right now to work with :(

Any help would be really appreciated. THANKS :)

I know somehow you'd have to eliminate the D so that you are left with A-B= 0 which of course leads to A=B, but i have no clue how to do that :(
 
Physics news on Phys.org
Hey Jet1045.

Because D is invertible you can post-multiply both sides by D^-1 since it exists. This gives you (A-B)DD^-1 = 0 x D^-1 = 0 => (A-B)I = 0 => A-B = 0 >= A = B.

You can only do this is D is invertible because if it isn't then since D^-1 (inverse of D) doesn't exist, you can't gaurantee that for example you don't get cases like D = 0 or some other condition that you would get in say a system that has linearly dependent basis vectors (which means it's not really a basis).
 
OH GOT IT!
k i didn't realize you could just multiply both sides of the equation by D^-1.
Thanks so much :)
 
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