Study guide

8.2 Basis, Dimension, and Coordinate Representations

GRE Subject Test: Mathematics Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Single-Variable Differential Calculus

1.1 Limits, Continuity, and Epsilon-Delta Definitions 1.2 Differentiation Rules, Implicit & Inverse Differentiation 1.3 Mean Value Theorem, Rolle's Theorem, and Function Extrema 1.4 L'Hôpital's Rule, Curve Sketching, and Optimization 1.5 Functions, Graphs, Transformations, and Inverses 1.6 Trigonometric Functions, Identities, and Equations 1.7 Coordinate Geometry, Lines, Circles, and Conics 1.8 Parametric and Polar Curves

2 Chapter 2: Single-Variable Integral Calculus

2.1 Riemann Sums and the Fundamental Theorem of Calculus 2.2 Advanced Integration Techniques 2.3 Geometric Applications: Areas, Volumes, and Arc Length 2.4 Improper Integrals and Convergence Criteria

3 Chapter 3: Sequences, Infinite Series & Power Series

3.1 Sequences, Monotonicity, and Limits 3.2 Infinite Series and Convergence Tests 3.3 Power Series, Radius and Interval of Convergence 3.4 Taylor and Maclaurin Series with Error Bounds

4 Chapter 4: Multivariable Differential Calculus

4.1 Multivariable Functions, Limits, and Partial Derivatives 4.2 Directional Derivatives, Gradients, and Tangent Planes 4.3 Multivariable Chain Rule and Implicit Differentiation 4.4 Multivariable Extrema, Hessian Matrix, and Lagrange Multipliers

5 Chapter 5: Multivariable Integration & Vector Calculus

5.1 Multiple Integrals in Cylindrical and Spherical Coordinates 5.2 Change of Variables and the Jacobian Determinant 5.3 Vector Fields, Line Integrals, and Green's Theorem 5.4 Surface Integrals, Stokes' Theorem, and the Divergence Theorem

6 Chapter 6: Ordinary Differential Equations

6.1 First-Order ODEs: Separable, Linear, and Exact Equations 6.2 Special First-Order ODEs: Homogeneous, Bernoulli, and Orthogonal Trajectories 6.3 Second-Order Linear Homogeneous ODEs with Constant Coefficients 6.4 Nonhomogeneous Linear ODEs: Undetermined Coefficients and Variation of Parameters

7 Chapter 7: Elementary Algebra & Number Theory

7.1 Elementary Algebra, Polynomials, Roots, and Factorization 7.2 Divisibility, Primes, and the Euclidean Algorithm 7.3 Modular Arithmetic, Chinese Remainder Theorem, and Euler's Totient

8 Chapter 8: Linear Algebra: Vector Spaces & Transformations

8.1 Vector Spaces, Subspaces, Span, and Linear Independence 8.2 Basis, Dimension, and Coordinate Representations 8.3 Linear Transformations, Kernel, Range, and the Rank-Nullity Theorem 8.4 Matrix Representations of Transformations and Change of Basis

9 Chapter 9: Linear Algebra: Matrices, Determinants & Spectral Theory

9.1 Systems of Linear Equations, Matrix Rank, and Row Reduction 9.2 Determinants, Matrix Inverses, and Cramer's Rule 9.3 Eigenvalues, Eigenvectors, and Diagonalization 9.4 Inner Product Spaces, Gram-Schmidt, and the Spectral Theorem

10 Chapter 10: Abstract Algebra: Groups, Rings & Fields

10.1 Groups, Subgroups, and Permutations 10.2 Cosets, Lagrange's Theorem, Normal Subgroups, and Homomorphisms 10.3 Rings, Ideals, Modules, Polynomial Rings, and Fields

11 Chapter 11: Introductory Real Analysis

11.1 The Real Field and Metric Space Topology 11.2 Compactness, Completeness, and Connectedness in R^n 11.3 Continuity, Uniform Continuity, and Value Theorems 11.4 Sequences and Series of Functions: Pointwise and Uniform Convergence

12 Chapter 12: Complex Analysis

12.1 Complex Numbers and Analytic Functions 12.2 Contour Integration and Cauchy's Theorems 12.3 Laurent Series, Singularities, and the Residue Theorem

13 Chapter 13: Topology, Geometry & Numerical Analysis

13.1 Topological Spaces, Open/Closed Sets, and Bases 13.2 Euclidean Geometry, Similarity, Circles, and Transformations 13.3 Numerical Analysis: Error, Root Finding, Interpolation, and Quadrature

14 Chapter 14: Probability, Statistics & Discrete Mathematics

14.1 Logic, Set Theory, Algorithms, and Combinatorics 14.2 Graph Theory: Trees, Cycles, Paths, and Planarity 14.3 Probability Spaces, Conditional Probability, and Bayes' Theorem 14.4 Random Variables, Expected Value, Variance, and Common Distributions

8.2 Basis, Dimension, and Coordinate Representations

Key Takeaways Explain This Topic AI

A basis B for a vector space V is a linearly independent spanning set, equivalently characterized as a minimal spanning set or a maximal linearly independent set.

The Steinitz exchange lemma guarantees that dimension is an intrinsic invariant; in an n-dimensional vector space, any set of n vectors is linearly independent if and only if it spans V (the 'Two-Out-of-Three' rule).

The coordinate map sending each vector v to its coordinate vector [v]_B in F^n is a vector space isomorphism, preserving all linear algebraic structures between abstract spaces and coordinate spaces.

The columns of the change-of-basis transition matrix P_{C <- B} are precisely the coordinate vectors of the basis vectors of B with respect to the target basis C.

Transition matrices satisfy the inversion law P_{B <- C} = (P_{C <- B})^-1 and convert coordinates according to the transformation law [v] C = P {C <- B} [v]_B.

Last updated: September 2026

8.2 Basis, Dimension, and Coordinate Representations

The concepts of basis and dimension formalize the degree of freedom in a vector space. By choosing an ordered basis, any abstract finite-dimensional vector space over F \mathbb{F} F becomes isomorphic to the concrete coordinate space F n \mathbb{F}^n F n . The GRE Mathematics Subject Test evaluates both the theoretical properties of bases (extension, reduction, and dimension invariance) and computational proficiency with coordinate vectors and change-of-basis transition matrices.

Bases: Minimal Spanning and Maximal Independent Sets

Let V V V be a vector space over F \mathbb{F} F . An ordered subset B = ( v 1 , v 2 , … , v n ) \mathcal{B} = (v_1, v_2, \dots, v_n) B = ( v 1 ​ , v 2 ​ , … , v n ​ ) of V V V is a basis for V V V if:

B \mathcal{B} B is linearly independent : ∑ i = 1 n c i v i = 0 V ⟹ c 1 = ⋯ = c n = 0 \sum_{i=1}^n c_i v_i = 0_V \implies c_1 = \dots = c_n = 0 ∑ i = 1 n ​ c i ​ v i ​ = 0 V ​ ⟹ c 1 ​ = ⋯ = c n ​ = 0 .

B \mathcal{B} B spans V V V : span ⁡ ( B ) = V \operatorname{span}(\mathcal{B}) = V span ( B ) = V .

Equivalent Characterizations of a Basis

For a subset B ⊂ V \mathcal{B} \subset V B ⊂ V , the following statements are equivalent:

B \mathcal{B} B is a basis of V V V .

B \mathcal{B} B is a minimal spanning set : removing any vector from B \mathcal{B} B yields a set that does not span V V V .

B \mathcal{B} B is a maximal linearly independent set : adding any vector from V V V to B \mathcal{B} B yields a linearly dependent set.

Unique Representation Property : Every vector v ∈ V v \in V v ∈ V can be expressed uniquely as a linear combination of vectors in B \mathcal{B} B : v = ∑ i = 1 n c i v i , c i ∈ F . v = \sum_{i=1}^n c_i v_i, \quad c_i \in \mathbb{F}. v = i = 1 ∑ n ​ c i ​ v i ​ , c i ​ ∈ F .

  • Dimension and Fundamental Basis Theorems
  • Steinitz Exchange Lemma & Dimension Invariance

Steinitz Exchange Lemma : If S = { u 1 , … , u k } S = \{u_1, \dots, u_k\} S = { u 1 ​ , … , u k ​ } is linearly independent in V V V and G = { w 1 , … , w m } G = \{w_1, \dots, w_m\} G = { w 1 ​ , … , w m ​ } spans V V V , then k ≤ m k \le m k ≤ m . Furthermore, there exists a subset of m − k m - k m − k vectors from G G G which, together with S S S , spans V V V .

Invariance of Dimension : If V V V has a finite basis of n n n elements, every basis of V V V contains exactly n n n elements. This invariant integer is the dimension of V V V , written dim ⁡ ( V ) = n \dim(V) = n dim ( V ) = n . By convention, dim ⁡ ( { 0 V } ) = 0 \dim(\{0_V\}) = 0 dim ({ 0 V ​ }) = 0 .

Basis Reduction and Extension Theorems

Basis Reduction Theorem : Every finite spanning set S S S for V V V contains a subset that is a basis of V V V .

Basis Extension Theorem : Every linearly independent subset S S S in a finite-dimensional space V V V can be extended to a basis of V V V .

The Two-Out-of-Three Rule : If dim ⁡ V = n \dim V = n dim V = n and S ⊂ V S \subset V S ⊂ V contains exactly n n n vectors: S is linearly independent ⟺ S spans V ⟺ S is a basis of V . S \text{ is linearly independent} \iff S \text{ spans } V \iff S \text{ is a basis of } V. S is linearly independent ⟺ S spans V ⟺ S is a basis of V . On the GRE, this eliminates half the work: to verify that n n n vectors form a basis in an n n n -dimensional space, check either independence or span, not both.

Standard Vector Spaces and Dimensions

Vector Space Standard Basis Dimension over F \mathbb{F} F

Coordinate Space F n \mathbb{F}^n F n Canonical unit vectors e 1 , … , e n e_1, \dots, e_n e 1 ​ , … , e n ​ n n n

Polynomials P n ( F ) P_n(\mathbb{F}) P n ​ ( F ) Monomials { 1 , x , x 2 , … , x n } \{1, x, x^2, \dots, x^n\} { 1 , x , x 2 , … , x n } n + 1 n + 1 n + 1

All Polynomials P ( F ) P(\mathbb{F}) P ( F ) Monomials { 1 , x , x 2 , … } \{1, x, x^2, \dots\} { 1 , x , x 2 , … } ∞ \infty ∞ (countably infinite)

Matrix Space M m × n ( F ) M_{m \times n}(\mathbb{F}) M m × n ​ ( F ) Elementary matrices E i j E_{ij} E ij ​ ( 1 1 1 at ( i , j ) (i,j) ( i , j ) , 0 0 0 elsewhere) m n mn mn

Symmetric Matrices Sym ⁡ n ( F ) \operatorname{Sym}_n(\mathbb{F}) Sym n ​ ( F ) E i i E_{ii} E ii ​ and E i j + E j i E_{ij} + E_{ji} E ij ​ + E ji ​ ( i < j i < j i < j ) n ( n + 1 ) 2 \frac{n(n+1)}{2} 2 n ( n + 1 ) ​

Skew-Symmetric Skew ⁡ n ( F ) \operatorname{Skew}_n(\mathbb{F}) Skew n ​ ( F ) E i j − E j i E_{ij} - E_{ji} E ij ​ − E ji ​ ( i < j i < j i < j ) n ( n − 1 ) 2 \frac{n(n-1)}{2} 2 n ( n − 1 ) ​

  • Complex field over reals C \mathbb{C} C { 1 , i } \{1, i\} { 1 , i } 2 2 2 (over R \mathbb{R} R )
  • Coordinate Vectors and the Coordinate Isomorphism

Let B = ( v 1 , … , v n ) \mathcal{B} = (v_1, \dots, v_n) B = ( v 1 ​ , … , v n ​ ) be an ordered basis of V V V . By the unique representation property, for each v ∈ V v \in V v ∈ V there exist unique scalars c 1 , … , c n ∈ F c_1, \dots, c_n \in \mathbb{F} c 1 ​ , … , c n ​ ∈ F such that v = ∑ i = 1 n c i v i v = \sum_{i=1}^n c_i v_i v = ∑ i = 1 n ​ c i ​ v i ​ .

The coordinate vector of v v v relative to B \mathcal{B} B is the column vector: [ v ] B = ( c 1 c 2 ⋮ c n ) ∈ F n . [v]_\mathcal{B} = \begin{pmatrix} c_1 \\ c_2 \\ \vdots \\ c_n \end{pmatrix} \in \mathbb{F}^n. [ v ] B ​ = ​ c 1 ​ c 2 ​ ⋮ c n ​ ​ ​ ∈ F n .

The Coordinate Isomorphism Theorem

The mapping Φ B : V → F n \Phi_\mathcal{B}: V \to \mathbb{F}^n Φ B ​ : V → F n defined by Φ B ( v ) = [ v ] B \Phi_\mathcal{B}(v) = [v]_\mathcal{B} Φ B ​ ( v ) = [ v ] B ​ is a linear isomorphism :

Φ B \Phi_\mathcal{B} Φ B ​ is linear: [ c u + v ] B = c [ u ] B + [ v ] B [c u + v]_\mathcal{B} = c [u]_\mathcal{B} + [v]_\mathcal{B} [ c u + v ] B ​ = c [ u ] B ​ + [ v ] B ​ .

Φ B \Phi_\mathcal{B} Φ B ​ is bijective (one-to-one and onto).

Preservation of Structure : Vectors { u 1 , … , u k } \{u_1, \dots, u_k\} { u 1 ​ , … , u k ​ } are linearly independent in V V V if and only if their coordinate vectors { [ u 1 ] B , … , [ u k ] B } \{[u_1]_\mathcal{B}, \dots, [u_k]_\mathcal{B}\} {[ u 1 ​ ] B ​ , … , [ u k ​ ] B ​ } are linearly independent in F n \mathbb{F}^n F n .

Change-of-Basis and Transition Matrices

Let B = ( u 1 , … , u n ) \mathcal{B} = (u_1, \dots, u_n) B = ( u 1 ​ , … , u n ​ ) and C = ( v 1 , … , v n ) \mathcal{C} = (v_1, \dots, v_n) C = ( v 1 ​ , … , v n ​ ) be two ordered bases of V V V . The change-of-basis matrix from B \mathcal{B} B to C \mathcal{C} C , denoted P C ← B P_{\mathcal{C} \leftarrow \mathcal{B}} P C ← B ​ , converts B \mathcal{B} B -coordinates into C \mathcal{C} C -coordinates: [ v ] C = P C ← B [ v ] B . [v]_\mathcal{C} = P_{\mathcal{C} \leftarrow \mathcal{B}} [v]_\mathcal{B}. [ v ] C ​ = P C ← B ​ [ v ] B ​ .

Constructing the Transition Matrix

The columns of P C ← B P_{\mathcal{C} \leftarrow \mathcal{B}} P C ← B ​ are the coordinate vectors of the original basis vectors B \mathcal{B} B relative to the target basis C \mathcal{C} C : P C ← B = [ [ u 1 ] C [ u 2 ] C … [ u n ] C ] . P_{\mathcal{C} \leftarrow \mathcal{B}} = \begin{bmatrix} [u_1]_\mathcal{C} & [u_2]_\mathcal{C} & \dots & [u_n]_\mathcal{C} \end{bmatrix}. P C ← B ​ = [ [ u 1 ​ ] C ​ ​ [ u 2 ​ ] C ​ ​ … ​ [ u n ​ ] C ​ ​ ] .

Key Algebraic Properties

Invertibility : P C ← B P_{\mathcal{C} \leftarrow \mathcal{B}} P C ← B ​ is always invertible, with ( P C ← B ) − 1 = P B ← C (P_{\mathcal{C} \leftarrow \mathcal{B}})^{-1} = P_{\mathcal{B} \leftarrow \mathcal{C}} ( P C ← B ​ ) − 1 = P B ← C ​ .

Chain Rule : For three bases B , C , D \mathcal{B}, \mathcal{C}, \mathcal{D} B , C , D : P D ← B = P D ← C P C ← B . P_{\mathcal{D} \leftarrow \mathcal{B}} = P_{\mathcal{D} \leftarrow \mathcal{C}} P_{\mathcal{C} \leftarrow \mathcal{B}}. P D ← B ​ = P D ← C ​ P C ← B ​ .

Transition in Coordinate Space R n \mathbb{R}^n R n : If E \mathcal{E} E is the standard basis, let M B = [ u 1 … u n ] M_\mathcal{B} = [u_1 \dots u_n] M B ​ = [ u 1 ​ … u n ​ ] and M C = [ v 1 … v n ] M_\mathcal{C} = [v_1 \dots v_n] M C ​ = [ v 1 ​ … v n ​ ] be the matrices containing basis vectors as columns. Then P E ← B = M B P_{\mathcal{E} \leftarrow \mathcal{B}} = M_\mathcal{B} P E ← B ​ = M B ​ , yielding: P C ← B = M C − 1 M B . P_{\mathcal{C} \leftarrow \mathcal{B}} = M_\mathcal{C}^{-1} M_\mathcal{B}. P C ← B ​ = M C − 1 ​ M B ​ .

  • Step-by-Step Worked Problems
  • Problem 1: Coordinate Representation in Polynomial Spaces

Let B = ( 1 , 1 + x , 1 + x + x 2 ) \mathcal{B} = (1, 1 + x, 1 + x + x^2) B = ( 1 , 1 + x , 1 + x + x 2 ) be an ordered basis of P 2 ( R ) P_2(\mathbb{R}) P 2 ​ ( R ) . Find the coordinate vector [ p ( x ) ] B [p(x)]_\mathcal{B} [ p ( x ) ] B ​ for p ( x ) = 2 − 3 x + 5 x 2 p(x) = 2 - 3x + 5x^2 p ( x ) = 2 − 3 x + 5 x 2 .

Solution :

Express p ( x ) p(x) p ( x ) as a linear combination: 2 − 3 x + 5 x 2 = c 1 ( 1 ) + c 2 ( 1 + x ) + c 3 ( 1 + x + x 2 ) . 2 - 3x + 5x^2 = c_1(1) + c_2(1 + x) + c_3(1 + x + x^2). 2 − 3 x + 5 x 2 = c 1 ​ ( 1 ) + c 2 ​ ( 1 + x ) + c 3 ​ ( 1 + x + x 2 ) .

Collect powers of x x x : ( c 1 + c 2 + c 3 ) + ( c 2 + c 3 ) x + c 3 x 2 = 2 − 3 x + 5 x 2 . (c_1 + c_2 + c_3) + (c_2 + c_3)x + c_3 x^2 = 2 - 3x + 5x^2. ( c 1 ​ + c 2 ​ + c 3 ​ ) + ( c 2 ​ + c 3 ​ ) x + c 3 ​ x 2 = 2 − 3 x + 5 x 2 .

Solve by back-substitution:

x 2 x^2 x 2 coefficient: c 3 = 5 c_3 = 5 c 3 ​ = 5 .

x x x coefficient: c 2 + 5 = − 3 ⟹ c 2 = − 8 c_2 + 5 = -3 \implies c_2 = -8 c 2 ​ + 5 = − 3 ⟹ c 2 ​ = − 8 .

Constant term: c 1 + ( − 8 ) + 5 = 2 ⟹ c 1 − 3 = 2 ⟹ c 1 = 5 c_1 + (-8) + 5 = 2 \implies c_1 - 3 = 2 \implies c_1 = 5 c 1 ​ + ( − 8 ) + 5 = 2 ⟹ c 1 ​ − 3 = 2 ⟹ c 1 ​ = 5 .

Thus [ p ( x ) ] B = ( 5 − 8 5 ) [p(x)]_\mathcal{B} = \begin{pmatrix} 5 \\ -8 \\ 5 \end{pmatrix} [ p ( x ) ] B ​ = ​ 5 − 8 5 ​ ​ .

Problem 2: Transition Matrix in R 2 \mathbb{R}^2 R 2

Let B = ( ( 1 2 ) , ( 3 5 ) ) \mathcal{B} = (\begin{pmatrix} 1 \\ 2 \end{pmatrix}, \begin{pmatrix} 3 \\ 5 \end{pmatrix}) B = ( ( 1 2 ​ ) , ( 3 5 ​ ) ) and C = ( ( 1 0 ) , ( 0 1 ) ) \mathcal{C} = (\begin{pmatrix} 1 \\ 0 \end{pmatrix}, \begin{pmatrix} 0 \\ 1 \end{pmatrix}) C = ( ( 1 0 ​ ) , ( 0 1 ​ ) ) be bases of R 2 \mathbb{R}^2 R 2 . Find P B ← C P_{\mathcal{B} \leftarrow \mathcal{C}} P B ← C ​ .

Solution :

Note that C \mathcal{C} C is the standard basis E \mathcal{E} E . The matrix whose columns are vectors of B \mathcal{B} B is P E ← B = M B = ( 1 3 2 5 ) P_{\mathcal{E} \leftarrow \mathcal{B}} = M_\mathcal{B} = \begin{pmatrix} 1 & 3 \\ 2 & 5 \end{pmatrix} P E ← B ​ = M B ​ = ( 1 2 ​ 3 5 ​ ) .

The desired matrix is P B ← C = ( P E ← B ) − 1 = M B − 1 P_{\mathcal{B} \leftarrow \mathcal{C}} = (P_{\mathcal{E} \leftarrow \mathcal{B}})^{-1} = M_\mathcal{B}^{-1} P B ← C ​ = ( P E ← B ​ ) − 1 = M B − 1 ​ .

Determinant: det ⁡ ( M B ) = ( 1 ) ( 5 ) − ( 3 ) ( 2 ) = 5 − 6 = − 1 \det(M_\mathcal{B}) = (1)(5) - (3)(2) = 5 - 6 = -1 det ( M B ​ ) = ( 1 ) ( 5 ) − ( 3 ) ( 2 ) = 5 − 6 = − 1 .

Matrix inverse: M B − 1 = 1 − 1 ( 5 − 3 − 2 1 ) = ( − 5 3 2 − 1 ) . M_\mathcal{B}^{-1} = \frac{1}{-1} \begin{pmatrix} 5 & -3 \\ -2 & 1 \end{pmatrix} = \begin{pmatrix} -5 & 3 \\ 2 & -1 \end{pmatrix}. M B − 1 ​ = − 1 1 ​ ( 5 − 2 ​ − 3 1 ​ ) = ( − 5 2 ​ 3 − 1 ​ ) .

Thus P B ← C = ( − 5 3 2 − 1 ) P_{\mathcal{B} \leftarrow \mathcal{C}} = \begin{pmatrix} -5 & 3 \\ 2 & -1 \end{pmatrix} P B ← C ​ = ( − 5 2 ​ 3 − 1 ​ ) .

GRE Exam Traps & Pitfalls

Trap 1: The Off-By-One Polynomial Dimension Always remember that dim ⁡ ( P n ) = n + 1 \dim(P_n) = n + 1 dim ( P n ​ ) = n + 1 , not n n n , because of the non-zero degree zero constant term x 0 = 1 x^0 = 1 x 0 = 1 . For example, P 3 P_3 P 3 ​ has basis { 1 , x , x 2 , x 3 } \{1, x, x^2, x^3\} { 1 , x , x 2 , x 3 } , giving dimension 4.

Trap 2: Transposed Transition Matrix The columns of P C ← B P_{\mathcal{C} \leftarrow \mathcal{B}} P C ← B ​ are the coordinates [ u j ] C [u_j]_\mathcal{C} [ u j ​ ] C ​ . Never write the coordinates as rows; writing coordinates as rows transposes the matrix and invalidates subsequent coordinate multiplications.

Trap 3: Direction of Transition Remember that [ v ] C = P C ← B [ v ] B [v]_\mathcal{C} = P_{\mathcal{C} \leftarrow \mathcal{B}} [v]_\mathcal{B} [ v ] C ​ = P C ← B ​ [ v ] B ​ . The arrow points from the right subscript to the left subscript: target basis on the left, source basis on the right.

Loading diagram... Coordinate Isomorphism and Change-of-Basis System