Jump to content

Linear algebra (Osnabrück 2024-2025)/Part I/Exercise sheet 26

From Wikiversity



Exercise for the break

Determine the greatest common divisor of and , and a representation of it.




Exercises

Determine the greatest common divisor of and , and a representation of it.


Determine the greatest common divisor of and , and a representation of it.


Determine in , using the Euclidean algorithm, the greatest common divisor of the polynomials and .


Determine in , using the Euclidean algorithm, the greatest common divisor of the polynomials and .


Determine in , using the Euclidean algorithm, the greatest common divisor of the polynomials and .


Determine in , using the Euclidean algorithm, the greatest common divisor of the polynomials and .


Let .

  1. Perform in the division with remainder divided by for the polynomials and .
  2. Find a representation of as a linear combination of these polynomials.


Let be a field, and let be the polynomial ring over . Let be polynomials. Let be a field extension. Show that is a divisor of in if and only if is a divisor of in .


The following exercises refer to the Euclidean algorithm for the integers, which works completely analogous to the Euclidean algorithm for polynomials. We first show why the Lemma of Bezout also holds for integers.

Prove the Lemma of Bezout for integers .


The delivery company "bucket without bugs“ is specialized in the transport of water. It has three buckets, one with liter, one with liter, and one with liter. The buckets do not have any marking. The company gets the request to transport, altogether, exactly one liter of water from the North Sea to the Baltic Sea. How can the company achieve this request?


Determine in , using the Euclidean algorithm, the greatest common divisor of and .


Determine in , using the Euclidean algorithm, the greatest common divisor of and .


Determine in , using the Euclidean algorithm, the greatest common divisor of and . Find also a representation of the greatest common divisor as a linear combination with these numbers.


Rabbits are born in the middle of the month, the times of gestation is one month, and they reach sexual maturity at the age of two months. Every litter consists of two rabbits, and they live forever.

We start in month with just one couple, whose age is one month. Let denote the number of couples of rabbits in the -th month, hence , . Prove, by induction, the recursive formula

This sequence is called the sequence of the Fibonacci numbers. How many of the couples are in the -th month able to reproduce?


The Fibonacci-numbers start with .

Apply to two consecutive Fibonacci numbers the Euclidean algorithm. What can you observe?


Determine the kernels of the powers of the matrix


Determine the kernels of the powers of the matrix


Let

Determine the kernels of the powers


Determine the generalized eigenspaces of the matrix


Let be a cycle of length , and let denote the corresponding permutation matrix, that is,

  1. Determine the characteristic polynomial of .
  2. Show that divides , and compute the factorization
  3. Determine and .
  4. Determine and .


Show that for a diagonalizable mapping

and every , the equality

holds.


Let

be a trigonalizable mapping. Show that is diagonalizable if and only if for every , the equality

holds.


Let

be a trigonalizable endomorphism, and let

denote the direct sum decomposition into generalized eigenspaces in the sense of Lemma 26.14 . Show that there exists a -invariant flag such that, in this flag, the linear subspaces

for occur.




Hand-in-exercises

Exercise (3 marks)

Determine in , using the Euclidean algorithm, the greatest common divisor of the polynomials and .


Exercise (4 marks)

Determine the greatest common divisor of and , and a representation of it as a linear combination of the given numbers.


Exercise (5 marks)

We consider a digital clock, which exhibits hours, minutes and seconds. However, during carnival, it does not run in steps of seconds, but it adds, starting from the zero position, in every step hours, minutes and seconds. Does, with this way of counting, every possible digital display appear? After how many steps does the zero position reoccur for the first time?


Exercise (3 marks)

Let be a field, let be a -vector space, and let

a linear mapping. Let be a polynomial. Show that

is an -invariant linear subspace.


Exercise (4 marks)

Determine the generalized eigenspaces of the matrix



<< | Linear algebra (Osnabrück 2024-2025)/Part I | >>
PDF-version of this exercise sheet
Lecture for this exercise sheet (PDF)