Is There a Quicker Way to Find All Possible Values of h for fh(a+bx+cx2+dx3)?

  • Thread starter Thread starter says
  • Start date Start date
Click For Summary
SUMMARY

The discussion centers on finding all possible values of h in the linear transformation defined by fh(a+bx+cx²+dx³) = [a+b+c+hd, b+c; -b-c-hd, hb]. Participants explore the implications of row-reducing the associated matrix and the conditions under which h can take on various values. It is established that h can be any real number, as it is a parameter in the transformation, and the kernel and image of the transformation depend on the specific value of h chosen.

PREREQUISITES
  • Understanding of linear transformations and their properties
  • Familiarity with matrix row reduction techniques
  • Knowledge of polynomial functions and vector spaces
  • Basic concepts of kernel and image in linear algebra
NEXT STEPS
  • Investigate the kernel and image of the transformation fh for specific values of h
  • Learn about the implications of different values of h on the linear transformation's properties
  • Study the concepts of basis and dimension in relation to linear transformations
  • Explore the relationship between polynomial degree and matrix representation in linear algebra
USEFUL FOR

Students and educators in linear algebra, mathematicians interested in linear transformations, and anyone seeking to deepen their understanding of polynomial mappings to matrix representations.

  • #61
says said:
if h = 0 then b could be any real number
Right.

What's the kernel for f0 ?
 
Physics news on Phys.org
  • #62
What is f0?
 
  • #63
says said:
What is f0?
It's fh when h = 0 .
 
  • #64
ker fh = span {(1,0,0,0), (0,1,1,0)}
 
  • #65
says said:
ker fh = span {(1,0,0,0), (0,1,1,0)}
Let's doublecheck:
##f_h(a,b,c,d)=(a+b+c+hd,b+c,-b-c-hd,hb)##
##f_0(a,b,c,d)=(a+b+c,b+c,-b-c,0)##

##f_0(1,0,0,0)=(1,0,0,0)\neq (0,0,0,0)##
##f_0(0,1,1,0)=(2,2,-2,0)\neq (0,0,0,0)##
 
  • Like
Likes   Reactions: SammyS
  • #66
ker fh = span {(0,1,-1,0)}

when h=0
 
  • #67
says said:
ker fh = span {(0,1,-1,0)}

when h=0
There is another vector (independent of this) in the kernel of f0 .
 
  • #68
but there is only one independent variable though. I thought that would mean only one vector? Unless the other vector is just (0,-1,1,0)
 
  • #69
says said:
but there is only one independent variable though. I thought that would mean only one vector? Unless the other vector is just (0,-1,1,0)
How about you go back to the matrix equation you had in post #41, substitute h=0, and solve?
 
  • #70
ker(fh) = span {(0,-1,1,0) , (0,1,-1,0) , (1,1,1,0)}
 
  • #71
says said:
ker(fh) = span {(0,-1,1,0) , (0,1,-1,0) , (1,1,1,0)}
One of those is redundant, another is wrong. Please post your working.
 
  • #72
1+1+1+h=0
0-1-1-h=0
0+1+1+0=0
0+h+0+0=0

making h=0

1+1+1+0=0
0-1-1-0=0
0+1+1+0=0
0+0+0+0=0

if b=1 c=-1 then the first equation a =0

ker(fh)= span {(0,1,-1,0) , (0,-1,1,0)}
 
  • #73
says said:
1+1+1+h=0
0-1-1-h=0
0+1+1+0=0
0+h+0+0=0

making h=0

1+1+1+0=0
0-1-1-0=0
0+1+1+0=0
0+0+0+0=0

if b=1 c=-1 then the first equation a =0

ker(fh)= span {(0,1,-1,0) , (0,-1,1,0)}
(0,1,-1,0) and (0,-1,1,0) are redundant.

What does your matrix tell you about d ?
 
  • #74
d=0

I don't understand how they are redundant if they are two different vectors?
 
  • #75
says said:
I don't understand how they are redundant if they are two different vectors?
They are redundant because they are not linearly independent:
##(0,1,-1,0)=-1*(0,-1,1,0)##
 
  • #76
says said:
d=0

I don't understand how they are redundant if they are two different vectors?
One is simply -1 times the other. I.e. their sum is zero.

Also, why does d need to be 0? isn't 0d = 0 no matter what the value of d ?
 
  • #77
Ok, I understand that, but how can the first equation (1,1,1,0) be in ker(fh) 1+1+1+0=0 as well?
 
  • #78
Actually
says said:
Ok, I understand that, but how can the first equation (1,1,1,0) be in ker(fh) 1+1+1+0=0 as well?
It's not, and Samy_A demonstrated that.
 
  • #79
SammyS said:
There is another vector (independent of this) in the kernel of f0 .

What's the other vector in ker(fh) if that's not it though? There's only 3 equations there and your saying one is redundant, one is in the kernel, and the other isn't in there...
 
  • #80
Actually, once you decide to look at h=0, then the original statement of the problem can be used to find Ker f0 by inspection.

##\displaystyle \ f_h(a + bx + cx^2 + dx^3) = \pmatrix{a+b+c+hd&b+c\\-b-c-hd & hb} \ ##

so that

##\displaystyle \ f_0(a + bx + cx^2 + dx^3) = \pmatrix{a+b+c+0&b+c\\-b-c-0 & 0} \ ##
 
  • #81
The only other vector I can think of is the zero vector. (0,0,0,0)
 
  • #82
says said:
The only other vector I can think of is the zero vector. (0,0,0,0)
Again I ask, What value must d have if 0⋅d = 0 ?
 
  • #83
d can be any value 0*d=0

0*1=0
0*-1=0
0*0=0
 
  • #84
says said:
d can be any value 0*d=0

0*1=0
0*-1=0
0*0=0
Yes.

Therefore, the other vector is ____ ?
 
  • #85
(1,0,0,-1)
 
  • #86
says said:
(1,0,0,-1)
That's not correct.

Why involve ##a## ?
 
  • #87
Because the first equation was (1,1,1,h) = 1+1+1+hd. If d=-1 then can't b and c = 0, making a = 1?
 
  • #88
says said:
Because the first equation was (1,1,1,h) = 1+1+1+hd. If d=-1 then can't b and c = 0, making a = 1?
For h = 0, (1,1,1,h) → (1,1,1,0) so that if a=b=c=0, then d does not need to be zero.
 
  • #89
the transformation always has d as a product with h though. so even if d=1 or -1 in the polynom it will still be 0 in the matrix
 
  • #90
says said:
the transformation always has d as a product with h though. so even if d=1 or -1 in the polynom it will still be 0 in the matrix
That's right.

SammyS said:
Actually, once you decide to look at h=0, then the original statement of the problem can be used to find Ker f0 by inspection.

##\displaystyle \ f_0(a + bx + cx^2 + dx^3) = \pmatrix{a+b+c+0&b+c\\-b-c-0 & 0} \ ##
There is no value of d which keeps this from being the 2×2 zero matrix.So, how to you write that as a vector?
 

Similar threads

Replies
3
Views
923
Replies
56
Views
6K
Replies
1
Views
2K
Replies
3
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 32 ·
2
Replies
32
Views
3K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 6 ·
Replies
6
Views
4K
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K