Scribd
Upload
21 views11 pages

Lec 12

The document discusses the properties and operations of polynomials with real coefficients, specifically focusing on the vector space Pn(R) of polynomials of degree at most n. It outlines the similarities between vector spaces and polynomial spaces, including operations such as addition and scalar multiplication, and defines concepts like subspaces and bases. Additionally, it provides examples and theorems related to the dimension of vector spaces and the linear independence of sets of polynomials.

Uploaded by

sreejathallam3011
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views11 pages

Lec 12

The document discusses the properties and operations of polynomials with real coefficients, specifically focusing on the vector space Pn(R) of polynomials of degree at most n. It outlines the similarities between vector spaces and polynomial spaces, including operations such as addition and scalar multiplication, and defines concepts like subspaces and bases. Additionally, it provides examples and theorems related to the dimension of vector spaces and the linear independence of sets of polynomials.

Uploaded by

sreejathallam3011
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Polynomials

Pn (R) – set of all polynomials (in one variable) with real


coefficients of degree atmost n
Operations on Pn (R) – addition, scalar multiplication:
For p(x) = a0 + a1 x + . . . + an xn , q(x) = b0 + b1 x + . . . + bn xn ,
and α ∈ R, define

(p + q)(x) = (a0 + b0 ) + (a1 + b1 )x + . . . + (an + bn )xn ,


(αp)(x) = αa0 + αa1 x + . . . + αan xn
Similarities

V-1 ⃗x + ⃗y ∈ Rn P-1 p + q ∈ Pn (R)


V-2 ⃗x + ⃗y = ⃗y + ⃗x P-2 p+q =q+p
V-3 (⃗x + ⃗y ) + w
⃗ = ⃗x + (⃗y + w)
⃗ P-3 (p + q) + r = p + (q + r)
V-4 ⃗ n
∃ 0 ∈ R such that P-4 ∃ 0 ∈ Pn (R) such that
⃗z + ⃗0 = ⃗z p+0=p
V-5 ∃ ⃗u ∈ Rn such that P-5 ∃ p′ ∈ Pn (R) such that
⃗x + ⃗u = ⃗0. p + p′ = 0.
V-6 t⃗x ∈ Rn P-6 αp ∈ Pn (R)
V-7 s(t⃗x) = (st)⃗x P-7 α(βp) = (αβ)p
V-8 (s + t)⃗x = s⃗x + t⃗x P-8 (α + β)p = αp + βp
V-9 t(⃗x + ⃗y ) = t⃗x + t⃗y P-9 α(p + q) = αp + αq
V-10 1⃗x = ⃗x P-10 1p = p
Further similarities

Real Numbers Rn Polynomials Pn (R)


Linear Combinations
Linear Independence
Span
Analogous definitions
Basis
Standard Basis
Subspaces
Example

1 + 2x + 3x2 + 4x3 ∈ Span{1 + x, 1 + x3 , x + x2 , x + x3 }


⇔ ∃ t1 , t2 , t3 , t4 ∈ R such that
2 3 3 2 3
1 + 2x + 3x + 4x = t1 (1 + x) + t2 (1 + x ) + t3 (x + x ) + t4 (x + x )
2 3 2 3
⇔ (t1 + t2 ) + (t1 + t3 + t4 )x + t3 x + (t2 + t4 )x = 1 + 2x + 3x + 4x

⇔ the following system is consistent:


t1 + t2 = 1 t1 + t3 + t4 = 2 t3 = 3 t2 + t4 = 4
Solving this, we get
3 2 3 2 3
(-2) (1 + x) + 3 (1 + x ) + 3 (x + x ) + 1 (x + x ) = 1 + 2x + 3x + 4x .

        
1 2 1 1 0 1 0 1 0 1
∈ Span , , ,
3 4 0 0 0 1 1 0 1 0
         
1 2 1 1 1 0 0 1 0 1
⇔ ∃ t1 , t2 , t3 , t4 ∈ R such that = t1 + t2 + t3 + t4
3 4 0 0 0 1 1 0 0 1
Upon solving, we get

         
1 1 1 0 0 1 0 1 1 2
(-2) + 3 + 3 + 1 =
0 0 0 1 1 0 0 1 3 4

Notice any similarities???


Abstraction

Rn Mm×n (R) Tm,n Pn (R) Abs.vec.sp.

+ is closed V −1 M −1 T −1 P −1 A−1

+ is commutative V −2 M −2 T −2 P −2 A−2

+ is associative V −3 M −3 T −3 P −3 A−3

Additive identity V −4 M −4 T −4 P −4 A−4

Additive inverse V −5 M −5 T −5 P −5 A−5

closure w.r.t. scalar multiplica- V −6 M −6 T −6 P −6 A−6


tion

associativity of scalar multiplica- V −7 M −7 T −7 P −7 A−7


tion

right distributivity V −8 M −8 T −8 P −8 A−8

left distributivity V −9 M −9 T −9 P −9 A−9

multiplication by 1 V − 10 M − 10 T − 10 P − 10 A − 10

A nonempty set V, together with two operations + : V × V → V


and · : R × V → V, is called a vector space over reals, if it
satisfies the properties A − 1 through A − 10, listed above.
Examples/Non-Examples
Examples:

• Rn , Mm×n (R), Tm,n , Pn (R) – with usual addition and


scalar multiplication defined on these sets
• Subspaces of these spaces (Proof?)
• Solution space of a homogeneous system of equations
• For X = {1, 2, 3}, FX = {f : X → R}. Operations?
Non examples:
• Pn∗ =set of all polynomials of degree equal to n. – Check if
‘+’ is closed!
• Pn† =set of all polynomials of degree at least n.
• Solution space of a inhomogeneous system of equations
Subspace

We say a non-empty subset S ⊂ V is a subspace if for x, y ∈ S,


and α, β ∈ R, if αx + βy ∈ S.
Equivalently, S ⊂ V is a subspace if and only if
• For x, y ∈ S, x + y ∈ S.
• For α ∈ R and x ∈ S, αx ∈ S

Example
• {0} ⊂ V for any vector space V
• V ⊂ V for any vector space V
• Pm (R) ⊂ Pn (R) for m ≤ n
• Set of all lower triangular matrices is a subspace of
Mn×n (R).
• Span of a subset of V is a subspace of V
Real Numbers Rn Vector space V
Linear Combinations
Linear Independence
Span
Analogous definitions
Basis
Subspaces

Is there a concept of “standard basis” in V?


Proposition
If V is a vector space, then
• 0x = 0 for all x ∈ V
• α0 = 0 for all α ∈ R

Theorem
Let V be a vector space. Every vector v ∈ V is uniquely
written as a linear combination of elements of B if and only if
B is a basis for V.
Example      
1 0 1 2 1 3
To check if the set C = , , is a basis for
1 0 1 1 0 1
M2 (R).
This is equivalent to check if the set C is linearly independent
and spans M2 (R). Write:
         
x1 x2 1 0 1 2 1 3 t1 + t2 + t3 2t2 + 3t3
= t1 +t2 t =
x3 x4 1 0 1 1 3 0 1 t1 + t2 t2 + t3

This is equivalent to solving the following system:

t1 +t2 +t3 = x1 2t2 +3t3 = x2 t1 +t2 = x3 t2 +t3 = x4 .

• Span = M2 (R) ⇔ for every x1 , x2 , x3 , x4 ∈ R, there are


t1 , t2 , t3 ∈ R as above.
• Linear indepndent ⇔ if x1 = x2 = x3 = x4 = 0 then
t1 = t2 = t3 = 0.
Theorem
Let V be a vector space.
• If Span(C) = V, then there exists a subset B ⊂ C such that
B is a basis for V.
• If D is linearly independent, then there exists a set B ⊃ D,
such that B is a basis for V.

Proposition
If B is a basis for V, and D ⊂ V then,

Label Condition Conclusion


Proposition-1 D is lin. indepn. |D| ≤ |B|
Proposition-2 Span(D) = V |D| ≥ |B|
CProposition-1 |D| > |B| D is lin. dependent
CProposition-2 |D| < |B| Span(D) ⊊ V

Theorem
For a vector space V, any two bases have the same number of
elements.
Define dimension of V = Number of elements in a basis.
Notation: dim V.
Example

• dim({0}) = 0 • dim(Mm×n (R)) = mn


• dim(Rn ) = n • dim(Pn (R)) = n + 1

You might also like