Dual basis
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:
The elements v_^*...v_n^* in V^* form a basis for V^*. This basis is called the dual basis to mathcalB. We denote this basis by mathcalB^*v_^*...v_n^*. Moreover forall lin V^* l_i^n lv_i v_i^*.
Solution:
Proof. Let lin V^*. We claim that abcliste abc l_i^n lv_i v_i^* or in other words we claim: abc forall vin V lv_i^n lv_i v_i^*v. abcliste Indeed both sides of a are linear maps Vlongrightarrow K so it's enough to check that b holds for vv_ vv_...vv_n because v_...v_n form a basis for V. And indeed for vv_k we have: _i^n lv_i v_i^*v_k_i^n lv_i delta_iklv_k The claim just proven shows that v_^*...v_n^* span V^*. Since textdimV^*textdimVn it follows that v_^*...v_n^* form a basis for V^*.
The elements v_^*...v_n^* in V^* form a basis for V^*. This basis is called the dual basis to mathcalB. We denote this basis by mathcalB^*v_^*...v_n^*. Moreover forall lin V^* l_i^n lv_i v_i^*.
Solution:
Proof. Let lin V^*. We claim that abcliste abc l_i^n lv_i v_i^* or in other words we claim: abc forall vin V lv_i^n lv_i v_i^*v. abcliste Indeed both sides of a are linear maps Vlongrightarrow K so it's enough to check that b holds for vv_ vv_...vv_n because v_...v_n form a basis for V. And indeed for vv_k we have: _i^n lv_i v_i^*v_k_i^n lv_i delta_iklv_k The claim just proven shows that v_^*...v_n^* span V^*. Since textdimV^*textdimVn it follows that v_^*...v_n^* form a basis for V^*.
Meta Information
Exercise:
The elements v_^*...v_n^* in V^* form a basis for V^*. This basis is called the dual basis to mathcalB. We denote this basis by mathcalB^*v_^*...v_n^*. Moreover forall lin V^* l_i^n lv_i v_i^*.
Solution:
Proof. Let lin V^*. We claim that abcliste abc l_i^n lv_i v_i^* or in other words we claim: abc forall vin V lv_i^n lv_i v_i^*v. abcliste Indeed both sides of a are linear maps Vlongrightarrow K so it's enough to check that b holds for vv_ vv_...vv_n because v_...v_n form a basis for V. And indeed for vv_k we have: _i^n lv_i v_i^*v_k_i^n lv_i delta_iklv_k The claim just proven shows that v_^*...v_n^* span V^*. Since textdimV^*textdimVn it follows that v_^*...v_n^* form a basis for V^*.
The elements v_^*...v_n^* in V^* form a basis for V^*. This basis is called the dual basis to mathcalB. We denote this basis by mathcalB^*v_^*...v_n^*. Moreover forall lin V^* l_i^n lv_i v_i^*.
Solution:
Proof. Let lin V^*. We claim that abcliste abc l_i^n lv_i v_i^* or in other words we claim: abc forall vin V lv_i^n lv_i v_i^*v. abcliste Indeed both sides of a are linear maps Vlongrightarrow K so it's enough to check that b holds for vv_ vv_...vv_n because v_...v_n form a basis for V. And indeed for vv_k we have: _i^n lv_i v_i^*v_k_i^n lv_i delta_iklv_k The claim just proven shows that v_^*...v_n^* span V^*. Since textdimV^*textdimVn it follows that v_^*...v_n^* form a basis for V^*.
Contained in these collections: