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

Trees

  • Public trees

Orphans

  • Browse orphan nodes
Related nodes

Parents1

  • Coordinate vector spaces

Siblings11
  • Sort by title
  • Sort by date

  • Algebraic properties of R^n (or C^n)
  • Geometric properties of R^n (or C^n)
  • Axioms of a vector space
  • Linear combinations
  • Spans
  • Subspaces
  • Linear (in)dependence
  • Bases
  • Dimension
  • Linear transformations
  • Orthogonality and projection

Children7
  • Sort by title
  • Sort by date

  • Definition of dimension of a vector space (or subspace)
  • If a vector space has dimension n
  • Every basis for a vector space contains the same number of elements
  • Definition of dimension of a vector space (or subspace) being finite or infinite
  • The dimension of a subspace is less than or equal to the dimension of the whole space
  • If two finite dimensional subspaces have the same dimension and one is contained in the other
  • A set of vectors containing more elements than the dimension of the space must be linearly dependent
Knowenβ
  • Help
    • Welcome to Knowen!
    • Edit test node (no login required)
    • Create new test node (no login required)
  • Not logged in
    • Sign in
    • Sign up

History & Comments

Back

Fill content

Description:Added dimension content
# Dimension

Put content here.**Definition:** The *dimension* of a vector space \(V\), denoted \(\dim(V)\), is the number of vectors in any basis of \(V\).
⏎
If \(V\) has a finite basis, it is called *finite-dimensional*. Otherwise, it is *infinite-dimensional*.
⏎
**Examples:**
- \(\dim(\mathbb{R}^n) = n\) (standard basis has \(n\) vectors)
- \(\dim(\mathbb{C}^n) = n\) over \(\mathbb{C}\)
- \(\dim(P_n) = n+1\) where \(P_n\) is the space of polynomials of degree at most \(n\) (basis: \(1, x, x^2, \ldots, x^n\))
- \(\dim(M_{m \times n}) = mn\) for \(m \times n\) matrices
- \(\dim(\{\mathbf{0}\}) = 0\)
⏎
**Key theorems:**
- If \(\dim(V) = n\), any set of \(n\) linearly independent vectors is a basis
- If \(\dim(V) = n\), any spanning set of \(n\) vectors is a basis
- If \(W\) is a subspace of \(V\), then \(\dim(W) \leq \dim(V)\)
- **Rank-nullity theorem:** For a linear transformation \(T: V \to W\), \(\dim(V) = \dim(\ker T) + \dim(\text{im } T)\)

# Parents

* Coordinate vector spaces
Sign in to add a new comment

Contact us or leave feedback

© KTree Inc. 2026