Alternating n-linear function and matrices
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 D be an n-linear function. Ase that D has the property that whenever A has two equal adjacent rows then DA. Then abcliste abc D is alternating. abc forall matrix B if B' is obtained from B by erchanging two of its rows then DB'-DB. abcliste
Solution:
Proof. We with the proof of b. Ase first that B' is obtained from B by erchanging two adjacent rows: B pmatrix hdots & beta_ & hdots hdots & vdots & hdots hdots & beta_k & hdots hdots & beta_k+ & hdots hdots & vdots & hdots hdots & beta_n & hdots pmatrix B' pmatrix hdots & beta_ & hdots hdots & vdots & hdots hdots & beta_k+ & hdots hdots & beta_k & hdots hdots & vdots & hdots hdots & beta_n & hdots pmatrix. Consider Dbeta_...beta_k+beta_k+beta_k+beta_k+...beta_n. On the other hand by n-linearity we have: Dbeta_...beta_kbeta_k+beta_k+...beta_n+Dbeta_...beta_k+beta_k+beta_k+...beta_n Dbeta_...beta_kbeta_k...beta_n+Dbeta_...beta_kbeta_k+...beta_n+Dbeta_...beta_k+beta_k...beta_n+Dbeta_...beta_k+beta_k+...beta_n &Longrightarrow Dbeta_...beta_kbeta_k+...beta_n+Dbeta_...beta_k+beta_k...beta_n Now suppose that B' is obtained from B by erchanging rows kl where k l not necessarily lk+. We can obtain B' from B by doing a sequence of erchanges of pairs of adjacent rows. For example we can with rows k and k+ and continue in this manner till we get beta_...beta_k-beta_k+...beta_lbeta_k beta_l+...beta_n. This requires rl-k erchanges of adjacent rows. Next we move beta_l to position k by doing r- erchanging of adjacent rows and we arrive to B'. The total number of erchanes of adjacent rows is r+r-r- Longrightarrow DB'-^r-DB-DB. This completes the proof of b. We prove a. Let A be a matrix in which row i equals to row j where i j. Denote the rows of A by B pmatrix hdots & alpha_ & hdots hdots & vdots & hdots hdots & alpha_i & hdots hdots & alpha_i+ & hdots hdots & vdots & hdots hdots & alpha_j & hdots hdots & vdots & hdots hdots & alpha_n & hdots pmatrix. If ji+ then by asption DA. If j i+ we erchange alpha_i+ with alpha_j and we obtain a matrix A' with two equal adjacent rows. By asption DA'. But by b DA'-DA Longrightarrow DA.
Let D be an n-linear function. Ase that D has the property that whenever A has two equal adjacent rows then DA. Then abcliste abc D is alternating. abc forall matrix B if B' is obtained from B by erchanging two of its rows then DB'-DB. abcliste
Solution:
Proof. We with the proof of b. Ase first that B' is obtained from B by erchanging two adjacent rows: B pmatrix hdots & beta_ & hdots hdots & vdots & hdots hdots & beta_k & hdots hdots & beta_k+ & hdots hdots & vdots & hdots hdots & beta_n & hdots pmatrix B' pmatrix hdots & beta_ & hdots hdots & vdots & hdots hdots & beta_k+ & hdots hdots & beta_k & hdots hdots & vdots & hdots hdots & beta_n & hdots pmatrix. Consider Dbeta_...beta_k+beta_k+beta_k+beta_k+...beta_n. On the other hand by n-linearity we have: Dbeta_...beta_kbeta_k+beta_k+...beta_n+Dbeta_...beta_k+beta_k+beta_k+...beta_n Dbeta_...beta_kbeta_k...beta_n+Dbeta_...beta_kbeta_k+...beta_n+Dbeta_...beta_k+beta_k...beta_n+Dbeta_...beta_k+beta_k+...beta_n &Longrightarrow Dbeta_...beta_kbeta_k+...beta_n+Dbeta_...beta_k+beta_k...beta_n Now suppose that B' is obtained from B by erchanging rows kl where k l not necessarily lk+. We can obtain B' from B by doing a sequence of erchanges of pairs of adjacent rows. For example we can with rows k and k+ and continue in this manner till we get beta_...beta_k-beta_k+...beta_lbeta_k beta_l+...beta_n. This requires rl-k erchanges of adjacent rows. Next we move beta_l to position k by doing r- erchanging of adjacent rows and we arrive to B'. The total number of erchanes of adjacent rows is r+r-r- Longrightarrow DB'-^r-DB-DB. This completes the proof of b. We prove a. Let A be a matrix in which row i equals to row j where i j. Denote the rows of A by B pmatrix hdots & alpha_ & hdots hdots & vdots & hdots hdots & alpha_i & hdots hdots & alpha_i+ & hdots hdots & vdots & hdots hdots & alpha_j & hdots hdots & vdots & hdots hdots & alpha_n & hdots pmatrix. If ji+ then by asption DA. If j i+ we erchange alpha_i+ with alpha_j and we obtain a matrix A' with two equal adjacent rows. By asption DA'. But by b DA'-DA Longrightarrow DA.
Meta Information
Exercise:
Let D be an n-linear function. Ase that D has the property that whenever A has two equal adjacent rows then DA. Then abcliste abc D is alternating. abc forall matrix B if B' is obtained from B by erchanging two of its rows then DB'-DB. abcliste
Solution:
Proof. We with the proof of b. Ase first that B' is obtained from B by erchanging two adjacent rows: B pmatrix hdots & beta_ & hdots hdots & vdots & hdots hdots & beta_k & hdots hdots & beta_k+ & hdots hdots & vdots & hdots hdots & beta_n & hdots pmatrix B' pmatrix hdots & beta_ & hdots hdots & vdots & hdots hdots & beta_k+ & hdots hdots & beta_k & hdots hdots & vdots & hdots hdots & beta_n & hdots pmatrix. Consider Dbeta_...beta_k+beta_k+beta_k+beta_k+...beta_n. On the other hand by n-linearity we have: Dbeta_...beta_kbeta_k+beta_k+...beta_n+Dbeta_...beta_k+beta_k+beta_k+...beta_n Dbeta_...beta_kbeta_k...beta_n+Dbeta_...beta_kbeta_k+...beta_n+Dbeta_...beta_k+beta_k...beta_n+Dbeta_...beta_k+beta_k+...beta_n &Longrightarrow Dbeta_...beta_kbeta_k+...beta_n+Dbeta_...beta_k+beta_k...beta_n Now suppose that B' is obtained from B by erchanging rows kl where k l not necessarily lk+. We can obtain B' from B by doing a sequence of erchanges of pairs of adjacent rows. For example we can with rows k and k+ and continue in this manner till we get beta_...beta_k-beta_k+...beta_lbeta_k beta_l+...beta_n. This requires rl-k erchanges of adjacent rows. Next we move beta_l to position k by doing r- erchanging of adjacent rows and we arrive to B'. The total number of erchanes of adjacent rows is r+r-r- Longrightarrow DB'-^r-DB-DB. This completes the proof of b. We prove a. Let A be a matrix in which row i equals to row j where i j. Denote the rows of A by B pmatrix hdots & alpha_ & hdots hdots & vdots & hdots hdots & alpha_i & hdots hdots & alpha_i+ & hdots hdots & vdots & hdots hdots & alpha_j & hdots hdots & vdots & hdots hdots & alpha_n & hdots pmatrix. If ji+ then by asption DA. If j i+ we erchange alpha_i+ with alpha_j and we obtain a matrix A' with two equal adjacent rows. By asption DA'. But by b DA'-DA Longrightarrow DA.
Let D be an n-linear function. Ase that D has the property that whenever A has two equal adjacent rows then DA. Then abcliste abc D is alternating. abc forall matrix B if B' is obtained from B by erchanging two of its rows then DB'-DB. abcliste
Solution:
Proof. We with the proof of b. Ase first that B' is obtained from B by erchanging two adjacent rows: B pmatrix hdots & beta_ & hdots hdots & vdots & hdots hdots & beta_k & hdots hdots & beta_k+ & hdots hdots & vdots & hdots hdots & beta_n & hdots pmatrix B' pmatrix hdots & beta_ & hdots hdots & vdots & hdots hdots & beta_k+ & hdots hdots & beta_k & hdots hdots & vdots & hdots hdots & beta_n & hdots pmatrix. Consider Dbeta_...beta_k+beta_k+beta_k+beta_k+...beta_n. On the other hand by n-linearity we have: Dbeta_...beta_kbeta_k+beta_k+...beta_n+Dbeta_...beta_k+beta_k+beta_k+...beta_n Dbeta_...beta_kbeta_k...beta_n+Dbeta_...beta_kbeta_k+...beta_n+Dbeta_...beta_k+beta_k...beta_n+Dbeta_...beta_k+beta_k+...beta_n &Longrightarrow Dbeta_...beta_kbeta_k+...beta_n+Dbeta_...beta_k+beta_k...beta_n Now suppose that B' is obtained from B by erchanging rows kl where k l not necessarily lk+. We can obtain B' from B by doing a sequence of erchanges of pairs of adjacent rows. For example we can with rows k and k+ and continue in this manner till we get beta_...beta_k-beta_k+...beta_lbeta_k beta_l+...beta_n. This requires rl-k erchanges of adjacent rows. Next we move beta_l to position k by doing r- erchanging of adjacent rows and we arrive to B'. The total number of erchanes of adjacent rows is r+r-r- Longrightarrow DB'-^r-DB-DB. This completes the proof of b. We prove a. Let A be a matrix in which row i equals to row j where i j. Denote the rows of A by B pmatrix hdots & alpha_ & hdots hdots & vdots & hdots hdots & alpha_i & hdots hdots & alpha_i+ & hdots hdots & vdots & hdots hdots & alpha_j & hdots hdots & vdots & hdots hdots & alpha_n & hdots pmatrix. If ji+ then by asption DA. If j i+ we erchange alpha_i+ with alpha_j and we obtain a matrix A' with two equal adjacent rows. By asption DA'. But by b DA'-DA Longrightarrow DA.
Contained in these collections:

