Basis of a vector space
Dependencies:
Let $B$ be a subset of a vector space $V$. $B$ is a basis of $V$ iff $B$ is linearly independent and $V = \operatorname{span}(B)$.
All bases of a vector space have the same size (either they are all of infinite size or they are all of the same finite size).
If $V$ has a finite basis of size $n$, we say that $\operatorname{dim}(V) = n$. $\operatorname{dim}(V)$ is well-defined since all bases of $V$ have the same size.
Proof that all bases have the same size
Let $B_1$ and $B_2$ be 2 bases of a vector space $V$ and one of them is finite. Without loss of generality, assume $B_1$ is finite.
Assume $B_2$ is larger than $B_1$ ($|B_2| > |B_1|$). Let $S$ be a finite subset of $B_2$ which is larger than $B_1$. Since $B_1$ spans $V$ and $S$ is larger than $B_1$, $S$ is linearly dependent. This means $B_2$ is linearly dependent, which contradicts the fact that $B_2$ is a basis of $V$. Therefore, no subset of $B_2$ is larger than $B_1$. Therefore, $|B_2| \le |B_1|$.
This means $B_2$ is finite. Using a similar argument as above and interchanging the roles of $B_1$ and $B_2$, we can prove that $|B_1| \le |B_2|$. Therefore, $|B_1| = |B_2|$.
Dependency for:
- Standard normal random vector on vector space
- Pointing a polyhedron
- Symmetric operator iff hermitian
- Symmetric operator on V has a basis of orthonormal eigenvectors
- Orthonormal basis change matrix
- Dimension of a set of vectors
- Coordinatization over a basis
- Linearly independent set can be expanded into a basis
- Maximally linearly independent iff basis
- Basis changer
- Basis of F^n
- Preserving a basis by replacing a vector
- Minimally spanning iff basis
- Spanning set of size dim(V) is a basis
- A set of dim(V) linearly independent vectors is a basis
- A matrix is full-rank iff its rows are linearly independent
- Rank of a matrix
- Rank of a homogenous system of linear equations
Info:
- Depth: 5
- Number of transitive dependencies: 36
Transitive dependencies:
- /linear-algebra/vector-spaces/condition-for-subspace
- /linear-algebra/matrices/gauss-jordan-algo
- /sets-and-relations/equivalence-relation
- Group
- Ring
- Polynomial
- Integral Domain
- Comparing coefficients of a polynomial with disjoint variables
- Field
- Vector Space
- Linear independence
- Span
- Semiring
- Matrix
- Stacking
- System of linear equations
- Product of stacked matrices
- Matrix multiplication is associative
- Reduced Row Echelon Form (RREF)
- Matrices over a field form a vector space
- Row space
- Elementary row operation
- Every elementary row operation has a unique inverse
- Row equivalence of matrices
- Row equivalent matrices have the same row space
- RREF is unique
- Identity matrix
- Inverse of a matrix
- Inverse of product
- Elementary row operation is matrix pre-multiplication
- Row equivalence matrix
- Equations with row equivalent matrices have the same solution set
- Linearly independent set is not bigger than a span
- Homogeneous linear equations with more variables than equations
- Rank of a homogenous system of linear equations
- Rank of a matrix