Quick Navigation

  • Current tree nodes
  • Public trees
  • Equivalence theorem for injective linear transformations: The kernel of T is 0.
  • Equivalence theorem for injective linear transformations: The nullity of T is 0.
  • Equivalence theorem for injective linear transformations: The null space of T is 0.
  • Equivalence theorem for injective linear transformations: The rank of T is equals the number of columns in any matrix representation..
  • Equivalence theorem for injective linear transformations: The rank of T is n.
  • Equivalence theorem for injective linear transformations: T(x)=0 only for x=0.
  • Equivalence theorem for nonsingular matrices: the columns of A are a basis for R^n (or C^n).
  • Equivalence theorem for nonsingular matrices: the columns of A are linearly independent.
  • Equivalence theorem for nonsingular matrices: the columns of A span R^n (or C^n).
  • Equivalence theorem for nonsingular matrices: the determinant of A is nonzero.
  • Equivalence theorem for nonsingular matrices: the dimension of the column space of A is n.
  • Equivalence theorem for nonsingular matrices: the equation Ax=0 has only the trivial solution.
  • Equivalence theorem for nonsingular matrices: the equation Ax=b has a solution for all b.
  • Equivalence theorem for nonsingular matrices: the equation Ax=b has a unique solution for all b.
  • Equivalence theorem for nonsingular matrices: the linear transformation given by T(x)=Ax has an inverse.
  • Equivalence theorem for nonsingular matrices: the linear transformation given by T(x)=Ax is an isomorphism.
  • Equivalence theorem for nonsingular matrices: the linear transformation given by T(x)=Ax is one-to-one/injective.
  • Equivalence theorem for nonsingular matrices: the linear transformation given by T(x)=Ax is onto/surjective.
  • Equivalence theorem for nonsingular matrices: the matrix A does not have 0 as an eigenvalue.
  • Equivalence theorem for nonsingular matrices: the matrix A has a left inverse.
  • Equivalence theorem for nonsingular matrices: the matrix A has an inverse.
  • Equivalence theorem for nonsingular matrices: the matrix A has a right inverse.
  • Equivalence theorem for nonsingular matrices: the matrix A has rank n.
  • Equivalence theorem for nonsingular matrices: the matrix A is a change-of-basis matrix.
  • Equivalence theorem for nonsingular matrices: the matrix A represents the identity map with respect to some pair of bases.
« First ← Previous ... 11 12 13 14 15 16 17 18 19 ... Next → Last »
  • All about DApps and Dapp.com
  • Chainbreakers at Dapp.com
  • CryptoWars in Dapp.com
  • CTSI Resources
  • Dapp and Cubego partnership and It’s Giveaway Time!
  • Dapp.com AMA Recap
  • Dapp.com and the Cubegoes
  • Dapp.com and the Yummies
  • Dapp.com Ranking
  • Dapp.com where the blockchain comes alive
  • Finance
  • Giveaways at Dapp.com
  • Group Theory Through Problems
  • Holiday Gifts from Dapp.com
  • How Long Do The Baked Potatoes Take on the Grill
  • Imperial Thrones Dapp.com
  • Imperial Thrones & Yummie
  • Imperial Thrones & Yummie
  • Knowen blog
  • Lecture Notes
  • Lecture notes test
  • Math
  • Media Coverage
  • Misc
  • my test article
1 2 Next → Last »