Unique Representation Theorem

Ever wondered how we can precisely describe any vector using a set of basis vectors? That's where the Unique Representation Theorem comes in!

When you have a basis B = {b₁, b₂, ..., bₙ} for a vector space V, any vector x in that space can be written as a linear combination of those basis vectors in exactly one way. This means there's a unique set of scalars {c₁, c₂, ..., cₙ} such that x = c₁b₁ + c₂b₂ + ... + cₙbₙ.

The uniqueness is what makes this powerful. If you find coefficients that work, you can be confident they're the only ones that will work. This theorem guarantees that no matter which approach you take, you'll arrive at the same answer.

Key Insight: The Unique Representation Theorem is what makes coordinate vectors possible - it ensures that every vector has exactly one representation in terms of a given basis.

Coordinate Vectors

Coordinate vectors give us a way to translate abstract vectors into concrete numerical form. Given a basis B = {b₁, b₂, ..., bₙ} for a vector space V, the coordinate vector of x relative to B is:

ρᵦ(x) = [c₁, c₂, ..., cₙ]ᵀ

Where the cᵢ values are the unique coefficients that satisfy x = c₁b₁ + c₂b₂ + ... + cₙbₙ. This creates a mapping from your vector space V to Cⁿ $the space of n-dimensional complex vectors$.

Think of coordinate vectors like GPS coordinates - they tell you exactly where a vector is located relative to your chosen basis. Every vector in your space gets mapped to exactly one coordinate vector.

This mapping ρᵦ: V → Cⁿ will prove extremely useful, as we'll soon see it preserves all the important structural relationships between vectors.

Coordinates in C^n

Let's see coordinate vectors in action with some concrete examples in C². Suppose we have a basis B = {[3,2]ᵀ, [-4,1]ᵀ} and we want to find the coordinate vector for x = [5,7]ᵀ.

To find the coordinates, we need to solve: c₁[3,2]ᵀ + c₂[-4,1]ᵀ = [5,7]ᵀ This gives us a system of equations:

• 3c₁ - 4c₂ = 5
• 2c₁ + c₂ = 7

We can solve this by row-reducing the augmented matrix and find that c₁ = 3 and c₂ = 1. Therefore, ρᵦ(x) = [3,1]ᵀ.

When working with the standard basis E $like {[1,0,0]ᵀ, [0,1,0]ᵀ, [0,0,1]ᵀ} for C³$, finding coordinate vectors becomes much simpler. For any vector x = [2,-1,6]ᵀ, its coordinate vector relative to the standard basis is simply ρₑ(x) = x itself! This is because the standard basis vectors each "pick out" exactly one component of your vector.

Remember: The standard basis makes coordinate vectors super easy to find, but other bases require solving systems of equations.

Coordinates in Polynomial Spaces

The concept of coordinate vectors extends beautifully to polynomial spaces too. For instance, in the polynomial space P₂ (polynomials of degree ≤ 2), we can work with the standard basis B = {x², x, 1}.

When we have a polynomial like p = 3x² - 6x - 2, finding its coordinate vector relative to the standard basis is straightforward. We just identify the coefficients:

• Coefficient of x² is 3
• Coefficient of x is -6
• Coefficient of 1 is -2

So ρᵦ(p) = [3, -6, -2]ᵀ.

The standard basis for polynomials makes finding coordinate vectors almost effortless - we simply read off the coefficients from the polynomial. This convenience is similar to what we saw with the standard basis in C^n.

Working with coordinate vectors in polynomial spaces allows us to translate polynomial operations into matrix and vector operations, which can often be more computationally efficient.

Non-Standard Bases in Polynomial Spaces

What happens when we work with a non-standard basis in P₂? Let's see with basis D = {2x² - x, x + 1, 5} and the same polynomial p = 3x² - 6x - 2.

To find ρᵈ(p), we need to solve for coefficients c₁, c₂, and c₃ such that: p = c₁$2x² - x$ + c₂$x + 1$ + c₃(5)

Expanding this equation: 3x² - 6x - 2 = 2c₁x² - c₁x + c₂x + c₂ + 5c₃ 3x² - 6x - 2 = 2c₁x² + $-c₁ + c₂$x + $c₂ + 5c₃$

Matching coefficients gives us three equations:

• 3 = 2c₁
• -6 = -c₁ + c₂
• -2 = c₂ + 5c₃

Solving this system yields c₁ = 1.5, c₂ = -4.5, and c₃ = 0.5.

Therefore, ρᵈ(p) = [1.5, -4.5, 0.5]ᵀ.

Pro Tip: When working with a non-standard basis, organize your equations by matching coefficients of like terms. This creates a cleaner system to solve.

Notice how our coordinate vector completely changed even though we're representing the same polynomial! The coordinate vector always depends on which basis you're using.

Coordinate Vector Transformation

We can formalize the mapping between a vector space and its coordinate representation as a transformation. The coordinate vector transformation ρᵦ: V → C^n takes any vector x in V and outputs its coordinate vector relative to basis B.

This transformation is more than just a convenient way to represent vectors - it has special properties that make it particularly valuable in linear algebra. It creates a bridge between abstract vector spaces and the concrete world of matrices and vectors in C^n.

The most important property is that ρᵦ is an isomorphism. This means it's a one-to-one and onto linear transformation that preserves all the structural relationships between vectors.

Think of an isomorphism like a perfect translation between languages - nothing gets lost in translation, and the meaning and relationships between words are perfectly preserved. Similarly, coordinate vector transformations preserve all the important vector relationships.

This connection allows us to translate problems in abstract vector spaces into equivalent problems in C^n, which are often easier to solve using computational techniques.

Isomorphism Properties

The coordinate transformation ρᵦ is an isomorphism between V and C^n, which has three crucial properties:

1. Linearity: For any vectors x, y in V and scalars α, β: ρᵦ$αx + βy$ = αρᵦ(x) + βρᵦ(y)

   This means the transformation preserves all linear combinations.

2. One-to-one: Different vectors in V always map to different coordinate vectors in C^n. If ρᵦ(x) = ρᵦ(w), then x must equal w.

3. Onto: Every vector in C^n corresponds to some vector in V. This means the transformation covers the entire target space.

These properties ensure that when we translate a problem from V to C^n using coordinate vectors, we don't lose any information or create ambiguities. Every vector relationship in V has an exact counterpart in C^n.

Helpful Insight: The isomorphism between V and C^n is why we can often solve problems about abstract vector spaces by working with matrices instead - they're just different perspectives on the same mathematical structure!

This powerful connection means we can use the computational tools of matrices to solve problems in any n-dimensional vector space.

Isomorphism to C^n

A remarkable result of the coordinate vector transformation is that every n-dimensional vector space is isomorphic to C^n. This means that, structurally speaking, all n-dimensional vector spaces are essentially the same!

Whether you're working with polynomials, matrices, functions, or other vector spaces, as long as they have dimension n, they're structurally equivalent to C^n. This is incredibly powerful because it means techniques that work in C^n can be applied to any n-dimensional vector space.

The proof is straightforward: since ρᵦ: V → C^n is an isomorphism for any basis B, every n-dimensional vector space V is isomorphic to C^n.

This theorem gives us a unified approach to all vector spaces of the same dimension. It's like discovering that despite different appearances, all these mathematical spaces follow the same underlying rules.

Think of it as learning that despite different alphabets and vocabularies, all human languages share fundamental grammatical structures. Once you understand these structures, you can more easily work across different languages.

Preservation of Vector Relationships

One of the most powerful aspects of the isomorphism between V and C^n is that it preserves key vector relationships. Three important theorems highlight this:

1. Linear Independence: A set of vectors {v₁, v₂, ..., vₙ} in V is linearly independent if and only if their coordinate vectors {ρᵦ(v₁), ρᵦ(v₂), ..., ρᵦ(vₙ)} are linearly independent in C^n.

2. Span: A set of vectors spans V if and only if their coordinate vectors span C^n. This means {v₁, v₂, ..., vₙ} generates all of V precisely when {ρᵦ(v₁), ρᵦ(v₂), ..., ρᵦ(vₙ)} generates all of C^n.

3. Basis: A set S = {v₁, v₂, ..., vₙ} is a basis for V if and only if their coordinate vectors form a basis for C^n.

These theorems are extremely practical. They mean we can translate questions about linear independence, span, and bases in abstract vector spaces into equivalent questions about coordinate vectors, which are often easier to answer using computational methods like row reduction.

Application Tip: To check if vectors form a basis in any vector space, convert them to coordinate vectors and use matrix techniques like determinants or row reduction!

Preservation of Linear Combinations

The coordinate vector transformation preserves all linear combinations. In simple terms, if you have a linear combination of vectors in V, the coordinate vector of that combination equals the same linear combination of the coordinate vectors.

For example, if u = 3x - 7y + 4z in vector space V, then: ρᵦ(u) = 3ρᵦ(x) - 7ρᵦ(y) + 4ρᵦ(z)

This property makes coordinate vectors incredibly useful for calculations. You can work with the concrete numbers in C^n rather than with abstract vectors, and the results will correspond perfectly.

The standard basis for C^n has a special property: for any vector x in C^n, ρₑ(x) = x. This means a vector is its own coordinate vector relative to the standard basis - no calculation needed!

Similarly, for polynomials in Pₙ, the standard basis D = {1, x, x², ..., x^n} lets us easily identify coordinate vectors. For a polynomial p(x) = a₀ + a₁x + ... + aₙx^n, its coordinate vector is simply ρᵈ(p) = [a₀, a₁, ..., aₙ]ᵀ. This "easy reading" property is what makes standard bases so convenient to work with.

Remember: Standard bases are chosen specifically because they make finding coordinate vectors as simple as possible!