Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Minimal Polynomials: Uniqueness and Division

In course

MATH-115(b): Advanced linear algebra II

L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire et de démontrer rigoureusement les résultats principaux du sujet. ...

Description

This lecture covers the concept of minimal polynomials, focusing on their uniqueness and the process of division. The instructor explains how to determine the minimal polynomial of a linear operator, emphasizing the importance of the dominant coefficient. The lecture also delves into the division algorithm for polynomials, showcasing the application of these concepts through examples.

Instructor

Marc Troyanov

Doctorat en mathématiques à l'Université de Genève (1987) - Postdoc à Paris et Salt-Lake City, puis professeur assistant à l'UQAM (Montréal). Venu en 1993 à l'EPFL comme professeur assistant, nommé MER en 1999 puis professeur titulaire en 2005. Domaine de recherche : géométrie différentielle, analyse sur les variétés et sur les espaces métriques.

Official source

Ontological neighbourhood

Mathematics

Algebra: Polynomials

Related concepts (32)

Polynomial long division

In algebra, polynomial long division is an algorithm for dividing a polynomial by another polynomial of the same or lower degree, a generalized version of the familiar arithmetic technique called long division. It can be done easily by hand, because it separates an otherwise complex division problem into smaller ones. Sometimes using a shorthand version called synthetic division is faster, with less writing and fewer calculations. Another abbreviated method is polynomial short division (Blomqvist's method).

Polynomial ring

In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring (which is also a commutative algebra) formed from the set of polynomials in one or more indeterminates (traditionally also called variables) with coefficients in another ring, often a field. Often, the term "polynomial ring" refers implicitly to the special case of a polynomial ring in one indeterminate over a field. The importance of such polynomial rings relies on the high number of properties that they have in common with the ring of the integers.

Polynomial greatest common divisor

In algebra, the greatest common divisor (frequently abbreviated as GCD) of two polynomials is a polynomial, of the highest possible degree, that is a factor of both the two original polynomials. This concept is analogous to the greatest common divisor of two integers. In the important case of univariate polynomials over a field the polynomial GCD may be computed, like for the integer GCD, by the Euclidean algorithm using long division. The polynomial GCD is defined only up to the multiplication by an invertible constant.

Polynomial

In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example of a polynomial of a single indeterminate x is x2 − 4x + 7. An example with three indeterminates is x3 + 2xyz2 − yz + 1. Polynomials appear in many areas of mathematics and science.

Square-free polynomial

In mathematics, a square-free polynomial is a polynomial defined over a field (or more generally, an integral domain) that does not have as a divisor any square of a non-constant polynomial. A univariate polynomial is square free if and only if it has no multiple root in an algebraically closed field containing its coefficients. This motivates that, in applications in physics and engineering, a square-free polynomial is commonly called a polynomial with no repeated roots.

Related lectures (58)

Decomposition of Linear Operators

Covers the decomposition of linear operators and properties of eigenspaces.

Division Polynomials: Theorems and Applications

Explores division polynomials, theorems, spectral values, and minimal polynomials in endomorphisms and vector spaces.

Stein Algorithm: Polynomial Identity Testing

Explores the Stein algorithm for polynomial identity testing and the minimization of a cut problem.

Eigenvalues and Minimal Polynomial

Explores eigenvalues and minimal polynomial, emphasizing their importance in linear algebra.

Eigenvalues and Eigenvectors