The Sylvester Rank Inequality
We prove the Sylvester Rank Inequality. This asserts that if A is an mxk matrix and B is a kxn matrix, then rank(A) + rank(B) is no more than k + rank(AB). This Inequality is proven using the Rank-Nullity Theorem along with an inequality for nullity(AB) in terms nullity(A) and nullity(B). This result gives us good information about the range of factorizations for non-square matrices.
#mikethemathematician, #mikedabkowski, #profdabkowski
Watch video The Sylvester Rank Inequality online without registration, duration hours minute second in high quality. This video was added by user Mike, the Mathematician 05 August 2024, don't forget to share it with your friends and acquaintances, it has been viewed on our site 509 once and liked it 21 people.