Register to reply 
It is defined that for any matrix A, [itex] A^{0} [/itex] is defined 
Share this thread: 
#1
Nov1912, 06:36 PM

P: 783

It is defined that for any matrix A, [itex] A^{0} [/itex] is defined as being equal to the identity matrix, I
My question: Does this definition also hold if A is the zero matrix? In the real numbers, [itex]0^{0}=1 [/itex] by definition, but I was wondering if this definition extends to matrices Thanks. BiP 


#2
Nov1912, 08:24 PM

Mentor
P: 18,019

Where did you find this definition? 


#3
Nov2012, 08:04 AM

Math
Emeritus
Sci Advisor
Thanks
PF Gold
P: 39,293

[itex]Thanks. BiP[/QUOTE] 


#4
Nov2012, 08:25 AM

P: 3,014

It is defined that for any matrix A, [itex] A^{0} [/itex] is defined



#5
Nov2012, 11:35 PM

P: 783

It seems there is contoversy over this. I believe the statement that [itex] 0^{0}=1 [/itex] is verified by Google, then again Google is not a mathematician. I had this question a while ago, but it was clarified by http://www.askamathematician.com/201...hersdisagree/ whose arguments I found quite convincing. I see no reason why [itex]0^{0}=1[/itex] interferes with [itex]\lim_{x\to 0} 0^x[/itex] since the latter need not be defined at x=0 for the limit to exist. I see no reason why mathematicians would want that function to be continuous at x=0 either... According to the link above, the definition [itex] 0^{0} = 1 [/itex] allows for a more elegant enunciation of the binomial theorem, among a few other things. I am confused about the question on matrices. Micro, you seem to say that the 0 exponent of any matrix (including the 0 matrix) is the identity matrix, but Ivy says it is only true for nonzero matrices as bases. And Dickfore claims it is only true for invertible matrices, I don't know where he's getting this information. Who is right? Is there any international authority on this subject? For example, in chemistry these conventions would be verified by the IUPAC, I was curious if there is a mathematical authority that can officially define these contentious terms. Thanks to everyone! BiP 


#6
Nov2112, 02:06 AM

P: 3,014

[tex] a b a b a, \ a a b b a, a b a a b, \ldots [/tex] together. But, matrix multiplication is noncommutative, so I don't see the benefit of defining [itex]A^{0} = I[/itex] to simplify the matrix binomial theorem, when the binomial theorem is not simple for noncommutative matrices in the first place. [tex] A = U \, \Lambda \, U^{1} [/tex] where [itex]\Lambda[/itex] is a diagonal matrix containing the eigenvalues of A on the main diagonal. Then, one defines: [tex] f(A) = U \, f(\Lambda) \, U^{1} [/tex] where [itex]f(\Lambda)[/itex] is simply a diagonal matrix again whose diagonal elements are the values [itex]f(\lambda_\alpha)[/itex] for each corresponding eigenvalue of A, and U is the same matrix as above. Then, the problem of defining [itex]A^0[/itex] for a matrix goes down to the problem for defining it for a (complex) number [itex]\lambda^0[/itex]. Taking powers of complex numbers is given by: [tex] u^{v} = \exp \left(v \, \mathrm{Log}(u) \right) [/tex] If you take [itex]v = 0[/itex], it seems the argument of the exponential is always zero, and [itex]\exp(0) = 1[/itex]. But, that is true provided that [itex]\mathrm{Log}(u)[/itex] exists! Otherwise the r.h.s. is not defined. And, Log is not defined for [itex]u = 0[/itex]. If a matrix has a zero eigenvalue, then and only then its determinant, being the product of its eigenvalues is zero as well, and the matrix is singular. This is why I required the determinant to be nonzero, so that you have only nonzero eigenvalues, and their exponentiation (even by 0) is defined. 


#7
Nov2112, 07:01 AM

Mentor
P: 15,055

The reason for denoting [itex]A^0=I[/itex] for any square matrix (singular or not) is the same reason one denotes [itex]x^0=1[/itex]. It's an extremely convenient abuse of notation. Strictly speaking, expressing some function [itex]f(x)[/itex] as a power series [itex]f(x) = \sum_{n=0}^{\infty} a_n x^n[/itex] is incorrect because of the [itex]0^0[/itex] problem. To be pedantically correct, that power series should be written as [itex]f(x) = a_0 + \sum_{n=1}^{\infty} a_n x^n[/itex]. Denoting [itex]0^0=1[/itex] as a convenient abuse of notation is what let's us get away with the more compact representation. The same applies to matrices. The exponential of a square matrix [itex]A[/itex] is typically written as [itex]\exp(A) = \sum_{n=0}^{\infty} \frac 1 {n!} A^n[/itex]. The pedantically correct version is [itex]\exp(A) = I + \sum_{n=1}^{\infty} \frac 1 {n!} A^n[/itex]. The compact representation arises by denoting [itex]A^0=I[/itex] for all square matrices [itex]A[/itex], including singular ones. It's an abuse of notation, but a very convenient one. 


#8
Nov2112, 09:24 AM

P: 333

I too think we should accept ##0^0=1## (also for zero matrices). It is true that ##0^x## becomes discontionuous at ##0## then, but this is only a minor inconvenience, IMHO.
My main reason for this is that it is logical for natural numbers, since, for positive integers ##m## and ##n##, ##m^n## is the number of functions from a set with ##n## elements to a set with ##m## elements. If we want this to hold also for ##m=0## and/or ##n=0##, we must put ##m^0=1## for all natural numbers ##m##, including ##m=0##, and ##0^n=0## for all natural numbers ##n## except ##n=0##. So, ##0^0=1##. What do I mean? Recall that a function ##f## from set ##A## to a set ##B## (more precisely, the graph of such a function), is a subset of the cartesian product ##A\times B## such that to each ##a\in A##, there is exactly one ##b\in B## such that ##(a,b)\in f##. We then write ##f(a)=b## instead of ##(a,b)\in f##. It is easy to see that there are ##m^n## functions from ##A## to ##B##, if ##A## has ##n## elements and ##B## has ##m## elements, and ##m## and ##n## are positive integers. Now, if ##n=0##, that is, if ##A## is the empty set, ##\varnothing##, then ##A\times B=\varnothing\times B=\varnothing##. This set has only one subset: ##\varnothing## itself. But the condition "For each ##a\in A=\varnothing## there is exactly one ##b\in B## such that ##(a,b)\in f=\varnothing##" is vacuously satisfied for ##f=\varnothing##, since there are no ##a\in A=\varnothing##. This means that ##f=\varnothing## is (the graph of) a function from ##A=\varnothing## to ##B##, and it is the only (graph of a) function of this kind, since ##A\times B=\varnothing## has no more subsets. Thus, there is exactly one function from a set ##A## with ##0## elements to a set ##B## with ##m## elements. It is thus logical to set ##m^0=1## for all natural numbers ##m##. Notice that the argument above is valid also for ##m=0##, that is, for ##B=\varnothing##. Consequently, we set ##0^0=1##. Assume instead that ##m=0## and ##n>0##. Then ##A\neq\varnothing## and ##B=\varnothing##. Again, we have ##A\times B=A\times\varnothing=\varnothing##, and this has only one subset, ##f=\varnothing## itself. But in this case, the condition "For each ##a\in A=\varnothing## there is exactly one ##b\in B## such that ##(a,b)\in f=\varnothing##" is not satisfied, since there are elements ##a\in A## but no elements ##(a,b)\in f=\varnothing##. ##f=\varnothing## is therefore not a (graph of a) function from ##A## to ##B=\varnothing##. Since ##A\times B=\varnothing## has no more subsets, there are no other functions of this kind either. Thus, there are no functions from ##A## to ##B=\varnothing##. It is therefore logical to set ##0^n=0## for all natural numbers ##n>0##. 


#9
Nov2112, 04:20 PM

Mentor
P: 18,019

Bipolarity, as you can see, there is no agreement about [itex]0^0[/itex] among mathematicians. All in all, it is just a definition, we could define [itex]0^0=10[/itex] if we want, it wouldn't change much (but it's not like anybody defines it like that).
So, the definition of [itex]0^0[/itex] (as matrices or as numbers), depends crucially on the author. Anton seems to use the definition [itex]0^0=1[/itex]. There is nothing wrong with that. Other authors might leave it undefined. You have to check with each author and see what he says about it. So there is no right and wrong answer here. It is merely a definition. So pick the definition that you like best. 


#10
Nov2112, 04:38 PM

P: 783

I've decided to define [itex] 0^{0} = π + e + 1 [/itex] so to make the binomial theorem complicated for future generations! Just kidding. BiP 


#11
Nov2112, 04:39 PM

Sci Advisor
HW Helper
PF Gold
P: 12,016

"It is true that 0x becomes discontionuous at 0 then, but this is only a minor inconvenience, IMHO."
Well, what do you think the limit of x^(k(x)/ln(x)) is, as x goes to 0, the limit of k(x) as x goes to zero being finite? 


#12
Nov2112, 04:58 PM

P: 333




#13
Nov2112, 05:02 PM

Sci Advisor
HW Helper
PF Gold
P: 12,016




#14
Nov2112, 05:11 PM

Mentor
P: 18,019

It makes a lot of sense to define [itex]0^0=1[/itex]. A lot of mathematicians make that definition. Saying it is silly and nonsensical is really not justified. 


#15
Nov2112, 05:14 PM

P: 333




#16
Nov2112, 05:20 PM

Sci Advisor
HW Helper
PF Gold
P: 12,016

You might even find some uses for that as well. 


#17
Nov2112, 05:22 PM

Mentor
P: 18,019




#18
Nov2112, 05:26 PM

Sci Advisor
HW Helper
PF Gold
P: 12,016




Register to reply 
Related Discussions  
What does [itex]\zeta(s)/s[/itex] converge to as [itex]\Im(s)\rightarrow\infty[/itex]  Calculus  10  
Show [itex]\phi[/itex][itex]\circ[/itex]f is Riemann integrable  Calculus & Beyond Homework  5  
Prove [itex]C[a,b][/itex] a closed linear subspace of [itex]L^{\infty}[a,b][/itex]  Calculus & Beyond Homework  1  
Proofs, [itex]\exists[/itex] x [itex]\in[/itex] (1, [itex]\infty[/itex]) such that...  Calculus & Beyond Homework  6 