Knowen

Dashboard

Featured nodes

Roots

  • Public root

Templates

  • Test template
  • iCorps template
  • Guanyu's Latex template
  • Ivar's latex template
  • Family Tree template
  • Latex template
  • Router template

Graphs

  • Public graph
Related nodes

Parents1

  • Linear (in)dependence

Siblings17
  • Sort by title
  • Sort by date

  • Definition of linear dependence relation on a set of vectors
  • Definition of trivial linear dependence relation on a set of vectors
  • Determine if a particular set of vectors in R^3 in linearly independent
  • Definition of linearly independent set of vectors: if a linear combination is 0
  • 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
  • Definition of linearly dependent set of vectors: one of the vectors can be written as a linear combination of the other vectors
  • Theorem: a set of vectors is linearly independent if and only if whenever a linear combination is 0
  • A set of vectors is linearly independent if and only if the homogeneous linear system corresponding to the matrix of column vectors has only the trivial solution.
  • A set of vectors is linearly independent if and only if the matrix of column vectors in reduced row-echelon form has every column as a pivot column.
  • If a set of vectors contains the 0 vector
  • A set of two vectors is linearly dependent if and only if neither is a scalar multiple of the other.
  • If a set of vectors in R^n (or C^n) contains more than n elements
  • A subset of a linearly independent set is linearly independent.
  • A set is linearly independent if and only if the set of coordinate vectors with respect to any basis is linearly independent.
  • Removing a linearly dependent vector from a set does not change the span of the set.
  • Adjoining an element not in the span of a linearly independent set gives another linearly independent set.
  • Any linearly independent set can be expanded to a basis for the (sub)space
KnowenBeta
How Knowen works
#
  • Explore
  • Sign in
  1. Definition of linearly dependent set of vectors: one of the vectors can be written as a linear combination of the other vectors

Navigate

Jump to a node in this graph, or explore your graphs and public knowledge.

Quick Navigation

Jump to a node or explore another graph.

  • Current graph nodes
  • Public graph
26–50 of 713 nodes
  • A linear transformation is surjective if and only if the rank equals the dimension of the codomain.#24035
  • A linear transformation maps 0 to 0.#23864
  • A linear transformation of a linear combination is the linear combination of the linear transformation#23865
  • A linear transformation on a finite dimentional nontrivial vector space has at least one eigenvalue.#24049
  • All echelon forms of a linear system have the same free variables#23423
  • A matrix and its transpose have the same determinant.#23728
  • A matrix and its transpose have the same eigenvalues/characteristic polynomial.#23693
  • A matrix A with real entries has orthonormal columns if and only if A inverse equals A transpose.#23930
  • A matrix equation is equivalent to a linear system#23767
  • A matrix is called ill-conditioned if it is nearly singular#23749
  • A matrix is nilpotent if and only if its only eigenvalue is 0.#23583
  • A matrix is orthogonally diagonalizable if and only if it is normal (The principal axis theorem).#23601
  • A matrix is orthogonally diagonalizable if and only if it is symmetric.#23578
  • A matrix of rank k is equivalent to a matrix with 1 in the first k diagonal entries and 0 elsewhere.#23606
  • A matrix turns into its adjoint when moved to the other side of the standard inner product on C^n.#23906
  • A matrix with a 0 row/column has determinant 0#23741
  • A matrix with real entries and orthonormal columns preserves dot products.#23932
  • A matrix with real entries and orthonormal columns preserves norms.#23931
  • A matrix with real entries has eigenvalues occurring in conjugate pairs.#23710
  • A matrix with two equal rows/columns has determinant 0#23740
  • An eigenspace of a matrix is a nontrivial subspace.#23685
  • An eigenspace of a matrix is the null space of a related matrix.#23686
  • An n-by-n matrix is diagonalizable if and only if it has n linearly independent eigenvectors.#23612
  • An n-by-n matrix is diagonalizable if and only if the characteristic polynomial factors completely#23614
  • An n-by-n matrix is diagonalizable if and only if the sum of the dimensions of the eigenspaces equals n.#23613
« First ← Previous 1 2 3 4 5 6 ... Next → Last »
1–25 of 40 public graphs
  • All about DApps and Dapp.com#24834
  • Chainbreakers at Dapp.com#24837
  • CryptoWars in Dapp.com#24833
  • CTSI Resources#23365
  • Dapp and Cubego partnership and It’s Giveaway Time!#24754
  • Dapp.com AMA Recap#24765
  • Dapp.com and the Cubegoes#24795
  • Dapp.com and the Yummies#24785
  • Dapp.com Ranking#24758
  • Dapp.com where the blockchain comes alive#24775
  • Finance#616
  • Giveaways at Dapp.com#24841
  • Group Theory Through Problems#1078
  • Holiday Gifts from Dapp.com#24843
  • How Knowen works#29500
  • How Long Do The Baked Potatoes Take on the Grill#23374
  • Imperial Thrones Dapp.com#24810
  • Imperial Thrones & Yummie#24826
  • Imperial Thrones & Yummie#24813
  • Knowen blog#943
  • Lecture Notes#272
  • Lecture notes test#23095
  • Math#23168
  • Media Coverage#953
  • Misc#929
1 2 Next → Last »

Knowen© 2026 KTree Inc.

ExplorePricingIntegrationsContact usHow Knowen worksLeave feedback