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. 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.

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
576–600 of 713 nodes
  • The coordinate vector relative to a given basis is a linear mapping to R^n (or C^n).#23992
  • The coordinate vector relative to a given basis is an injective linear mapping to R^n (or C^n).#23993
  • The coordinate vector relative to a given basis is a surjective linear mapping to R^n (or C^n).#23994
  • The crazy vector space is a vector space.#24107
  • The determinant function exists.#23734
  • The determinant function is unique.#23735
  • The determinant of a block diagonal matrix is the product of the determinants of the blocks.#23731
  • The determinant of a matrix can be computed as a cofactor expansion across any row.#23719
  • The determinant of a matrix can be computed as a cofactor expansion down any column.#23720
  • The determinant of a matrix can be expressed as a product of the diagonal entries in a non-scaled echelon form.#23725
  • The determinant of a matrix measures the area/volume of the parallelogram/parallelipiped determined by its columns.#23746
  • The determinant of a triangular matrix is the product of the entries on the diagonal.#23744
  • The determinant of the inverse of A is the reciprocal of the determinant of A.#23730
  • The determinant of the matrix of a linear transformation is the factor by which the area/volume changes.#23747
  • The dimension of a direct sum of subspaces is the sum of the dimensions of the subspaces.#23971
  • The dimension of a eigenspace is less than or equal to the (algebraic) multiplicity of the eigenvalue.#23708
  • The dimension of a subspace is less than or equal to the dimension of the whole space#24010
  • The dimension of the domain of an injective linear transformation is at most the dimension of the codomain.#24033
  • The dimension of the domain of a surjective linear transformation is at least the dimension of the codomain.#24034
  • The direct sum of a subspace and its orthogonal complement is the whole space.#23922
  • The echelon form can be used to determine if a linear system is consistent.#23771
  • The eigenspace of a linear transformation is a nontrivial subspace.#24051
  • The eigenvalues of a matrix are the roots/solutions of its characteristic polynomial/equation.#23705
  • The eigenvalues of a polynomial of a matrix are the polynomial of the eigenvalues.#23691
  • The eigenvalues of a power of a matrix are the power the eigenvalues.#23690
« First ← Previous ... 20 21 22 23 24 25 26 27 28 29 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