Proving Matrix Addition/Scalar Multiplication Properties

AI Thread Summary
Matrix addition and scalar multiplication properties are defined rather than proven, as they stem from the definitions of matrices and operations on them. To demonstrate properties like commutativity, one can use the definitions and the commutativity of real number addition. For example, the sum of two matrices A and B is defined entry-wise, allowing for proofs based on these definitions. The discussion highlights the challenge of generalizing proofs for matrices of varying sizes and the potential use of geometric or algebraic methods for more complex properties. Ultimately, understanding the definitions is crucial for proving theorems in matrix theory.
asdf1
Messages
734
Reaction score
0
just curious,
how do you prove the basic matrix addition and scalar multiplication properties if you don't want to prove it just by giving examples?
 
Physics news on Phys.org
Giving examples doesn't prove anything. Suppose you gave 10 billion exemples of where a theorem was true. Then there's nothing in that which guarentees that the billion and one-th exemple won't fail!

As for your question, matrix multiplication and addition are not provable! They are defined. First we define matrix as a table of numbers, then we define addition on them and mult. by a scalar. Then we go on finding what are the properties given such definitions. These are the theorems of matrix theory.
 
Last edited:
asdf1 said:
just curious,
how do you prove the basic matrix addition and scalar multiplication properties if you don't want to prove it just by giving examples?

what exactly are you trying to prove? you can prove, say, commutativity of addition by using the definition. that is, you do it by taking (any! that's the key) mxn matrices A & B, and adding the individual entries together like the definition says. so at the end you get A+B=B+A. is that the sort of stuff you want to prove?
 
yes, just like your example A+B=B+A, how are you supposed to prove that? because the only way i can think of is by giving examples, because A and B can be of any size, which makes it hard to be generalized ( i think~)...
 
If you know how matrix addition is defined (adding the equivalent elements), then it follows naturally from the commutativity of the ordinary addition, which says that a+b = b+a (scalairs).
 
hmm... I've heard that you can prove it with special sigma thingys that physicts use? or that physicts can use some special type of notation or something for those kinds of proofs?
@@a
 
If you mean permutation (sigma), it is used to define determinants for example.
 
The way you prove things is by using the definitions! The precise statement of the definitions!

For example, If A= [aij] is a matrix and B= [bij] is another matrix

The definition of A+ B is [(aij+ ij]- each entry in A+B is the sum of the corresponding entries of A and B separately.

Now, using that same definition, what is B+A?

Remember that the entries of A and B are real numbers and addition of real numbers is commutative.
 
Oops, I misunderstood your question asdf1, sowwy 'bout that. Had I read it right, I would have said what HallsofIvy said, and added to your confusion...

asdf1 said:
[...]because the only way i can think of is by giving examples, because A and B can be of any size, which makes it hard to be generalized ( i think~)...

...that matrix addition is only defined for matrices A and B of the same size, so don't even try to add matrices of different size, the laws of addition of those matrices is not defined.
 
Last edited:
  • #10
i've recently had to prove many of the properties of matrix operations. associative, etc...
the way i attempted to do it was either algebraicaly or geometrically.

for the most part it's involved pages of obnoxious vectors a,b,c broken into cartesian coordinates. I'm not so good at the geometric business, drawing three dimensional stuff doesn't seem to be my forte.
 
  • #11
can you prove that kind of stuff by using permutation?
 

Similar threads

Back
Top