Set of polynomials is infinite dimensional

Click For Summary

Discussion Overview

The discussion revolves around the dimensionality of the set of polynomials over a field, specifically whether this set is infinite-dimensional. Participants explore methods of proof, particularly focusing on linear independence and the implications of assuming a finite basis.

Discussion Character

  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • One participant proposes a proof by contradiction, assuming a finite-dimensional space and demonstrating that a certain set of polynomials is linearly independent.
  • Another participant agrees with the initial proof but raises a concern about the lack of a direct proof for the linear independence of the proposed basis set.
  • A suggestion is made to use calculus, specifically the Wronskian, to prove linear independence, although an alternative algebraic approach is also mentioned.
  • One participant describes a method to show linear independence by substituting specific values into a polynomial equation, providing a system of equations that leads to a unique solution.
  • A later reply discusses the complexity of proving linear independence for higher degrees and hints at the use of induction or Vandermonde determinants as potential tools.
  • Another participant notes that a linear combination of polynomials equating to zero implies it is the zero polynomial, emphasizing the finite nature of polynomial zeros.

Areas of Agreement / Disagreement

Participants generally agree on the infinite-dimensional nature of the polynomial set but express differing views on the methods of proving linear independence and the definitions of polynomials. The discussion remains unresolved regarding the best approach to demonstrate linear independence for higher degrees.

Contextual Notes

Limitations include the dependence on definitions of polynomials and the potential complexity of proving linear independence for polynomials of degree greater than two. The discussion also reflects varying levels of familiarity with mathematical concepts such as the Wronskian and Vandermonde determinants.

Who May Find This Useful

This discussion may be useful for students and educators in mathematics, particularly those interested in linear algebra, polynomial theory, and methods of proof in higher mathematics.

Bipolarity
Messages
773
Reaction score
2
How does one show that the set of polynomials is infinite-dimensional? Does one begin by assuming that a finite basis for it exists, and then reaching a contradiction?

Could someone check the following proof for me, which I just wrote up ?

We prove that V, the set of all polynomials over a field F is infinite-dimensional. To do so, assume on the contrary that it is finite-dimensional, having dimension n. Then there exists a basis for V having n elements.
Since the following set is linearly independent and has n elements, it is also a basis for V:
β = \{ 1, x, x^{2}...x^{n-1} \}

Thus every polynomial is expressible as a linear combination of the vectors in this set.
But then x^{n} \in span(β) which implies that β \cup \{x^{n}\} is linearly independent. This is clearly false, hence a contradiction. Thus the vector space of polynomials is infinite dimensional.

Is it completely correct?

BiP
 
Physics news on Phys.org
That seems correct!
 
Thanks for the feedback micro. But apparently one small thing seems to be bothering me now.
I never actually proved that β = \{ 1, x, x^{2}...x^{n-1} \} is linearly independent. How would I do that? Only way I can think of is using Wronskian, but is there perhaps a way to do it without calculus?

BiP
 
It depends on how you define polynomials. In a lot of situations, you define the polynomials such that the set you mention is linear independent. This is the algebraic approach.
The more familiar approach is to define polynomials as actual functions ##f:\mathbb{R}\rightarrow \mathbb{R}##. If you do that, then using calculus really is the best and easiest approach. I suppose you can also show it directly: For example, for n=1: assume that

$$\alpha +\beta x + \gamma x^2 = 0$$

Substitute in some values for x, for example, by substituting 0, 1 and 2, we get

$$\left\{\begin{array}{l} \alpha = 0\\ \alpha +\beta +\gamma = 0\\ \alpha +2\beta + 4\gamma = 0 \end{array}\right.$$

This system of equations has unique solution ##\alpha = \beta = \gamma = 0## and thus we get linear independence. The situation for ##n>2## is a similar but a bit more hairy. A relevant result that will help you here ar Vandermonde determinants: http://www.proofwiki.org/wiki/Vandermonde_Determinant
 
I am rather curious about your direct approach. How would I go about it for n>2? I have not much knowledge of Vandermonde matrices.

Would it involve some sort of induction?

BiP
 
There are many ways to do this. For simplicity let's assume any basis will only contain polynomial of different degrees. Prove a linear combination of polynomials has degree at most the highest degree of the combined polynomials.
 
Notice that if a linear combination of the elements is 0 , it is the zero polynomial, and not the number zero. But a (nonzero) polynomial can have only finitely-many zeros.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 18 ·
Replies
18
Views
4K
  • · Replies 26 ·
Replies
26
Views
7K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 27 ·
Replies
27
Views
3K
  • · Replies 25 ·
Replies
25
Views
4K
  • · Replies 40 ·
2
Replies
40
Views
4K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 1 ·
Replies
1
Views
3K