Basis of F^n
Dependencies:
Let $F$ be a field. $F^n = \{(a_1, a_2, \ldots, a_n): a_i \in F\}$, where addition and scalar multiplication is defined to be element-wise.
Then $F^n$ is a vector space with a basis of size n: $E = \{e_1 = (1, 0, \ldots, 0), e_2 = (0, 1, \ldots, 0), \ldots, e_n = (0, 0, \ldots, 1) \}$.
$E$ is called the standard basis of $F^n$.
Proof
$F^n$ is the set of $n$ by $1$ matrices, so it is a vector space.
\[ \sum_{i=1}^n a_ie_i = 0 \implies (a_1, a_2, \ldots, a_n) = 0 \implies a_i = 0 \forall i \]
Therefore, $E$ is linearly independent.
Since $(a_1, a_2, \ldots, a_n) = \sum_{i=1}^n a_ie_i$, $E$ spans $F^n$. Therefore, $E$ is a basis of $F^n$.
Dependency for:
- Pointing a polyhedron
- Canonical decomposition of a linear transformation
- Matrix of orthonormal basis change
- Matrix of linear transformation
Info:
- Depth: 6
- Number of transitive dependencies: 37
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
- Basis of a vector space
- 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