Formalized Mathematics · 2007 · 15 citations · 22 references
Ranking AlgorithmRank+nullity Theorem StatesLinear TransformationLearning To RankRank+nullity TheoremLow-rank Approximation
The Rank+Nullity Theorem The rank+nullity theorem states that, if T is a linear transformation from a finite-dimensional vector space V to a finite-dimensional vector space W , then dim( V ) = rank( T ) + nullity( T ), where rank( T ) = dim(im( T )) and nullity( T ) = dim(ker( T )). The proof treated here is standard; see, for example, [14]: take a basis A of ker( T ) and extend it to a basis B of V , and then show that dim(im( T )) is equal to | B - A |, and that T is one-to-one on B - A.
22
Tarski Grothendieck Set Theory
Andrzej Trybulec · 1990 · 482 citations
Segments of Natural Numbers and Finite Sequences
Grzegorz Bancerek, Krzysztof Hryniewiecki · 1990 · 421 citations
Functions and their basic properties
Czesław Byliński · 1989 · 366 citations
Grzegorz Bancerek · 1990 · 364 citations
Czesław Byliński · 2004 · 338 citations