Set of non-invertible matrices is unbounded

  • Thread starter Thread starter Tigers64
  • Start date Start date
  • Tags Tags
    Matrices Set
AI Thread Summary
The discussion centers on proving that the set of non-invertible matrices is unbounded. It begins with the assertion that the determinant of a non-invertible matrix is zero, which is represented graphically as the line y=0. However, participants clarify that using the determinant as a norm is incorrect, and that there are various norms for matrices that need to be considered. The conversation emphasizes that if the determinant were a norm, the set of non-invertible matrices would actually be bounded, contradicting the initial claim. Ultimately, the need for a proper definition of matrix norms is highlighted to resolve the question.
Tigers64
Messages
2
Reaction score
0
Question:
How do I prove the set of non-invertible matrices is unbounded?

Attempt:
Let A be an element of set of non-invertible matrices.
det(A)=0
det(A)=0 is just the line y=0 if you have det(A) as the y-axis and the set of non-invertible matrices on the x-axis. y=0 is unbounded, so the set of non invertible matrices is unbounded?
 
Physics news on Phys.org
Tigers64 said:
the set of non-invertible matrices on the x-axis
For this to make any sense at all, "the set of non-invertible matrices on the x-axis" would have to be a subset of "the set of real numbers"...


How do I prove the set of non-invertible matrices is unbounded?
Let's start with an easier question: can you find a non-invertible matrix whose norm is bigger than 10?

(p.s. what norm are you using?)
 
I guess the problem is that I don't know which norm to use, so I used det as the norm. How do you define a norm for matrices other than the det function?
 
How do you define a norm for matrices other than the det function?
There are infinitely many different norms you can define for matrices, several of which are in common use. This is a question I cannot answer for you -- you will have to check your homework problem / textbook / class notes to find out what norm you're supposed to be using.

(Incidentally, det isn't a norm. And even if it was, then the set of all non-invertible matrices would be bounded with respect to it)
 
Hurkyl said:
There are infinitely many different norms you can define for matrices, several of which are in common use. This is a question I cannot answer for you -- you will have to check your homework problem / textbook / class notes to find out what norm you're supposed to be using.

(Incidentally, det isn't a norm. And even if it was, then the set of all non-invertible matrices would be bounded with respect to it)
Since every non-invertible matrix has determinant 0, it would be very bounded!
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top