knowen.mdknowen.md

Dashboard

Featured nodes

Roots

  • Public root

Templates

  • Guanyu's Latex template
  • Router template

Trees

  • Showcase
Related nodes

Parents1

  • Nonsingular matrices and equivalences

Siblings31
  • Sort by title
  • Sort by date

  • Definition of nonsingular matrix: matrix is invertible
  • Definition of nonsingular matrix: the associated homogeneous linear system has only the trivial solution
  • Definition of singular matrix (not nonsingular)
  • Equivalence theorem for nonsingular matrices: the equation Ax=b has a solution for all b.
  • Equivalence theorem for nonsingular matrices: the equation Ax=0 has only the trivial solution.
  • Equivalence theorem for nonsingular matrices: the rows of A span R^n (or C^n).
  • Equivalence theorem for nonsingular matrices: the columns of A span R^n (or C^n).
  • Equivalence theorem for nonsingular matrices: the rows of A are linearly independent.
  • Equivalence theorem for nonsingular matrices: the rows of A are a basis for R^n (or C^n).
  • Equivalence theorem for nonsingular matrices: the matrix A has an inverse.
  • Equivalence theorem for nonsingular matrices: the transpose of the matrix A has an inverse.
  • Equivalence theorem for nonsingular matrices: the linear transformation given by T(x)=Ax is onto/surjective.
  • 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 matrix A has rank n.
  • Equivalence theorem for nonsingular matrices: the nullity of the matrix A is 0.
  • Equivalence theorem for nonsingular matrices: the matrix A does not have 0 as an eigenvalue.
  • 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.
  • Equivalence theorem for nonsingular matrices: the determinant of A is nonzero.
  • Equivalence theorem for nonsingular matrices: the null space of the matrix A is {0}.
  • Proof of several equivalences for nonsingular matrix
  • Equivalence theorem for nonsingular matrices: the equation Ax=b has a unique solution for all b.
  • Equivalence theorem for nonsingular matrices: the matrix A row-reduces to the identity matrix.
  • Equivalence theorem for nonsingular matrices: the columns of A are linearly independent.
  • Equivalence theorem for nonsingular matrices: there is a pivot position in every row of A.
  • Equivalence theorem for nonsingular matrices: the dimension of the column space of A is n.
  • Equivalence theorem for nonsingular matrices: the matrix A has a right inverse.
  • Equivalence theorem for nonsingular matrices: the linear transformation given by T(x)=Ax is one-to-one/injective.
  • Equivalence theorem for nonsingular matrices: the columns of A are a basis for R^n (or C^n).
  • Equivalence theorem for nonsingular matrices: the matrix A has a left inverse.
knowen.mdknowen.mdBeta
#
  • Explore
  • Sign in
  • Request an invite
  1. Equivalence theorem for nonsingular matrices: the matrix A represents the identity map with respect to some pair of bases.

Navigate

Jump to a node in this tree, or explore your trees and public knowledge.

Quick Navigation

Jump to a node or explore another tree.

  • Current tree nodes
  • Public trees
626–650 of 718 nodes
  • The inverse of a matrix can be used to solve a linear system.#23532
  • The inverse of a matrix (if it exists) can be found by row reducing the matrix augmented by the identity matrix.#23527
  • The inverse of an invertible upper/lower triangular matrix is upper/lower triangular.#23565
  • The inverse of an isomorphism is an isomorphism.#24002
  • The inverse of a scalar multiple is the reciprocal times the inverse.#23525
  • The inverse of the inverse of a linear transformation is the original linear transformation#24029
  • The kernel/null space of a linear transformation is a subspace#24059
  • The kernels of powers of a linear transformation form an ascending chain#24062
  • The least squares solution to a linear system is unique if and only if the columns of the coefficient matrix are linearly independent.#23950
  • The left null space of a matrix is a subspace of R^m (or C^m).#24111
  • The matrix equation Ax=b has a solution if and only if b is a linear combination of the columns of A.#23768
  • The matrix of an inverse is the inverse of the matrix representation#24074
  • The matrix representation of a composition of linear transformations is the product of the matrices.#24073
  • The matrix representation of a scalar multiple of linear transformations is the scalar multiple of the matrix.#24071
  • The matrix representation of a sum of linear transformations is the sum of the matrices.#24072
  • The minimal polynomial of a linear transformation exists and is unique.#24047
  • The minimal polynomial of a square matrix exists and is unique.#23704
  • The nonzero rows of an echelon form of a matrix are linearly independent.#23871
  • The null space of a matrix is a subspace of R^n (or C^n).#24110
  • The number of pivots in the reduced row echelon form of a consistent system determines the number of free variables in the solution set.#23774
  • The number of pivots in the reduced row echelon form of a consistent system determines whether there is one or infinitely many solutions.#23773
  • The number of solutions to a linear system#23438
  • Theorem: a set of vectors is linearly dependent if and only if one of the vectors can be written as a linear combination of the other vectors#23820
  • Theorem: a set of vectors is linearly independent if and only if whenever a linear combination is 0#23822
  • Theorem characterizing when a space is the direct sum of two subspaces#23976
« First ← Previous ... 22 23 24 25 26 27 28 29 Next → Last »
1–4 of 4 public trees
  • Aspen Summer 2016 - Entanglement Matters#1213
  • Container for Linear Algebra#24123
  • Math#23168
  • Test Flight Problem Set#23151

knowen.md© 2026 KTree Inc.

ExploreWhat is knowen.md?PricingIntegrationsContact usLeave feedback