Find a spanning set a minimal spanning set for ##P_4##.

Click For Summary

Homework Help Overview

The discussion revolves around finding a spanning set and a minimal spanning set for the polynomial space ##P_4##. The original poster seeks verification of their answers regarding the spanning set and its minimality, referencing Theorem 2.7 related to linear independence and spanning sets.

Discussion Character

  • Conceptual clarification, Assumption checking, Mixed

Approaches and Questions Raised

  • Participants discuss the definition of ##P_4## and whether it includes fourth-degree polynomials. There are inquiries about demonstrating linear independence of the proposed spanning set and whether explicit proof is necessary. Some suggest that stating linear independence may suffice, while others propose using methods like Gauss-Jordan elimination for formal proof.

Discussion Status

The discussion is ongoing, with participants exploring different interpretations of the polynomial space definition and the requirements for proving linear independence. Some guidance has been offered regarding methods to show linear independence, but no consensus has been reached on the definitions or the necessity of explicit proofs.

Contextual Notes

There is a noted inconsistency in the definitions of ##P_n## across different textbooks, with some defining it as polynomials of degree less than n and others as those of degree less than or equal to n. This discrepancy may affect the understanding of the problem.

Terrell
Messages
316
Reaction score
26

Homework Statement


Find a spanning set for ##P_4##. Find a minimal spanning set. Use Theorem 2.7 to show no other spanning set has fewer elements.
Would simply like someone to check my answers as the book I'm using did not provide a solutions manual. Thank you.

Homework Equations


Theorem 2.7: If a finite set ##A##={##\alpha_1,\alpha_2,...,\alpha_n##} spans ##V##, then every linearly independent set contains at most ##n## elements.

The Attempt at a Solution


spanning set: {##1,x,x^2,x^3,5##}
minimal spanning set: {##1,x,x^2,x^3##}
By theorem 2.7., since {##1,x,x^2,x^3##} is linearly indepdent and spans ##P_4##, then any linearly independent set has at most ##m## elements such that ##m\leq 4##. However, {##1,x,x^2,x^3##} has 4 elements and is a minimal spanning set ##\Rightarrow## ##4\leq m##. Therefore, ##m=4##.
 
Last edited:
Physics news on Phys.org
Shouldn't P4 have 4-th degree polynomials in it?

To use theorem 2.7 you have to show (or at least say) that your spanning set is linear independent.
 
If I wanted to show that the set is linearly independent, do i need to show explicitly that each element can't be a linear combination of the other elements in the set or is there a shorter method? My book defined ##P_n## to be of degree ##\leq n-1##.
 
Terrell said:
If I wanted to show that the set is linearly independent, do i need to show explicitly that each element can't be a linear combination of the other elements in the set or is there a shorter method?
You can probably get away with just saying it is linear independent. To prove it formally, you can show that the only way to get the null vector is zero for all coefficients.
My book defined ##P_n## to be of degree ##\leq n-1##.
Okay, fine.
 
  • Like
Likes   Reactions: Terrell
mfb said:
o prove it formally, you can show that the only way to get the null vector is zero for all coefficients.
can solving it using gauss-jordan elimination in matrix form be considered formal? thanks!
 
That will work. It is trivial for the spanning set you chose, of course.
 
  • Like
Likes   Reactions: Terrell
mfb said:
Shouldn't P4 have 4-th degree polynomials in it?
Authors of linear algebra textbooks aren't consistent in this notation. Two of my books define ##P_n## as the space of polynomials of degree less than n. Another defines this as polynomials of degree less than or equal to n.
 

Similar threads

Replies
15
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K