Eigenvalues and direct sum
About points...
We associate a certain number of points with each exercise.
When you click an exercise into a collection, this number will be taken as points for the exercise, kind of "by default".
But once the exercise is on the collection, you can edit the number of points for the exercise in the collection independently, without any effect on "points by default" as represented by the number here.
That being said... How many "default points" should you associate with an exercise upon creation?
As with difficulty, there is no straight forward and generally accepted way.
But as a guideline, we tend to give as many points by default as there are mathematical steps to do in the exercise.
Again, very vague... But the number should kind of represent the "work" required.
When you click an exercise into a collection, this number will be taken as points for the exercise, kind of "by default".
But once the exercise is on the collection, you can edit the number of points for the exercise in the collection independently, without any effect on "points by default" as represented by the number here.
That being said... How many "default points" should you associate with an exercise upon creation?
As with difficulty, there is no straight forward and generally accepted way.
But as a guideline, we tend to give as many points by default as there are mathematical steps to do in the exercise.
Again, very vague... But the number should kind of represent the "work" required.
About difficulty...
We associate a certain difficulty with each exercise.
When you click an exercise into a collection, this number will be taken as difficulty for the exercise, kind of "by default".
But once the exercise is on the collection, you can edit its difficulty in the collection independently, without any effect on the "difficulty by default" here.
Why we use chess pieces? Well... we like chess, we like playing around with \(\LaTeX\)-fonts, we wanted symbols that need less space than six stars in a table-column... But in your layouts, you are of course free to indicate the difficulty of the exercise the way you want.
That being said... How "difficult" is an exercise? It depends on many factors, like what was being taught etc.
In physics exercises, we try to follow this pattern:
Level 1 - One formula (one you would find in a reference book) is enough to solve the exercise. Example exercise
Level 2 - Two formulas are needed, it's possible to compute an "in-between" solution, i.e. no algebraic equation needed. Example exercise
Level 3 - "Chain-computations" like on level 2, but 3+ calculations. Still, no equations, i.e. you are not forced to solve it in an algebraic manner. Example exercise
Level 4 - Exercise needs to be solved by algebraic equations, not possible to calculate numerical "in-between" results. Example exercise
Level 5 -
Level 6 -
When you click an exercise into a collection, this number will be taken as difficulty for the exercise, kind of "by default".
But once the exercise is on the collection, you can edit its difficulty in the collection independently, without any effect on the "difficulty by default" here.
Why we use chess pieces? Well... we like chess, we like playing around with \(\LaTeX\)-fonts, we wanted symbols that need less space than six stars in a table-column... But in your layouts, you are of course free to indicate the difficulty of the exercise the way you want.
That being said... How "difficult" is an exercise? It depends on many factors, like what was being taught etc.
In physics exercises, we try to follow this pattern:
Level 1 - One formula (one you would find in a reference book) is enough to solve the exercise. Example exercise
Level 2 - Two formulas are needed, it's possible to compute an "in-between" solution, i.e. no algebraic equation needed. Example exercise
Level 3 - "Chain-computations" like on level 2, but 3+ calculations. Still, no equations, i.e. you are not forced to solve it in an algebraic manner. Example exercise
Level 4 - Exercise needs to be solved by algebraic equations, not possible to calculate numerical "in-between" results. Example exercise
Level 5 -
Level 6 -
Question
Solution
Short
Video
\(\LaTeX\)
No explanation / solution video to this exercise has yet been created.
Visit our YouTube-Channel to see solutions to other exercises.
Don't forget to subscribe to our channel, like the videos and leave comments!
Visit our YouTube-Channel to see solutions to other exercises.
Don't forget to subscribe to our channel, like the videos and leave comments!
Exercise:
Let V be a vector space over K and Tin textEndV. Let lambda_...lambda_rin K be pairwise distinct eigenvalues of T. Then textEig_Tlambda_+...+textEig_Tlambda_r is a direct .
Solution:
Proof. Ase u_+...+u_ru_'+...+u_r' where u_i u_i'in textEig_Tlambda_iquad forall leq ileq r. We need to show that u_iu_i'quad forall i iff u_i-u_i'quad forall i. We have: u_-u_'+...+u_r-u_r'quad *. Ase by contradiction that exists i s.t. u_i-u_i'neq . Remove from the list u_-u_'...u_i_l-u_i_l' of non-zero vectors and by * we still have u_i_-u_i_'+...+u_i_l-u_i_l'quad **. Now forall k u_i_k-u_i_k' is either an eigenvector of lambda_i or but by our asptions u_i_k-u_i_k'neq . Recall that eigenvectors corresponding to pairwise distinct eigenvalues are linearly indepent vectors and by ** their is contradiction.
Let V be a vector space over K and Tin textEndV. Let lambda_...lambda_rin K be pairwise distinct eigenvalues of T. Then textEig_Tlambda_+...+textEig_Tlambda_r is a direct .
Solution:
Proof. Ase u_+...+u_ru_'+...+u_r' where u_i u_i'in textEig_Tlambda_iquad forall leq ileq r. We need to show that u_iu_i'quad forall i iff u_i-u_i'quad forall i. We have: u_-u_'+...+u_r-u_r'quad *. Ase by contradiction that exists i s.t. u_i-u_i'neq . Remove from the list u_-u_'...u_i_l-u_i_l' of non-zero vectors and by * we still have u_i_-u_i_'+...+u_i_l-u_i_l'quad **. Now forall k u_i_k-u_i_k' is either an eigenvector of lambda_i or but by our asptions u_i_k-u_i_k'neq . Recall that eigenvectors corresponding to pairwise distinct eigenvalues are linearly indepent vectors and by ** their is contradiction.
Meta Information
Exercise:
Let V be a vector space over K and Tin textEndV. Let lambda_...lambda_rin K be pairwise distinct eigenvalues of T. Then textEig_Tlambda_+...+textEig_Tlambda_r is a direct .
Solution:
Proof. Ase u_+...+u_ru_'+...+u_r' where u_i u_i'in textEig_Tlambda_iquad forall leq ileq r. We need to show that u_iu_i'quad forall i iff u_i-u_i'quad forall i. We have: u_-u_'+...+u_r-u_r'quad *. Ase by contradiction that exists i s.t. u_i-u_i'neq . Remove from the list u_-u_'...u_i_l-u_i_l' of non-zero vectors and by * we still have u_i_-u_i_'+...+u_i_l-u_i_l'quad **. Now forall k u_i_k-u_i_k' is either an eigenvector of lambda_i or but by our asptions u_i_k-u_i_k'neq . Recall that eigenvectors corresponding to pairwise distinct eigenvalues are linearly indepent vectors and by ** their is contradiction.
Let V be a vector space over K and Tin textEndV. Let lambda_...lambda_rin K be pairwise distinct eigenvalues of T. Then textEig_Tlambda_+...+textEig_Tlambda_r is a direct .
Solution:
Proof. Ase u_+...+u_ru_'+...+u_r' where u_i u_i'in textEig_Tlambda_iquad forall leq ileq r. We need to show that u_iu_i'quad forall i iff u_i-u_i'quad forall i. We have: u_-u_'+...+u_r-u_r'quad *. Ase by contradiction that exists i s.t. u_i-u_i'neq . Remove from the list u_-u_'...u_i_l-u_i_l' of non-zero vectors and by * we still have u_i_-u_i_'+...+u_i_l-u_i_l'quad **. Now forall k u_i_k-u_i_k' is either an eigenvector of lambda_i or but by our asptions u_i_k-u_i_k'neq . Recall that eigenvectors corresponding to pairwise distinct eigenvalues are linearly indepent vectors and by ** their is contradiction.
Contained in these collections: