Lecture

Division Polynomials: Theorems and Applications

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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 division polynomials, including theorems related to Cayley-Hamilton and spectral values. It explains the concept of minimal polynomials and their significance in endomorphisms and vector spaces. The lecture also includes exercises to verify the theorems.

Instructor

Marc Troyanov

Expertise Differential Geometry Geometric Analysis Teaching & PhD Past EPFL PhD Students Olivier Mermoud, Khaled Gafaiti, Serguei Timochine, Stephen Ducret, Ratiba Djelid, Zahra Sinaei, Luc Genton, Adrien Giuliano Marcone, Guillaume Buro, Bruno Luiz Santos Correia Courses Advanced linear algebra II MATH-115(b) The purpose of this course is to introduce some basic notions of linear algebra and to rigorously prove the main results in the field.

Official source

Ontological neighbourhood

Mathematics

Algebra: Polynomials

Related concepts (32)

Monic polynomial

In algebra, a monic polynomial is a non-zero univariate polynomial (that is, a polynomial in a single variable) in which the leading coefficient (the nonzero coefficient of highest degree) is equal to 1. That is to say, a monic polynomial is one that can be written as with Monic polynomials are widely used in algebra and number theory, since they produce many simplifications and they avoid divisions and denominators. Here are some examples. Every polynomial is associated to a unique monic polynomial.

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.

Factorization of polynomials

In mathematics and computer algebra, factorization of polynomials or polynomial factorization expresses a polynomial with coefficients in a given field or in the integers as the product of irreducible factors with coefficients in the same domain. Polynomial factorization is one of the fundamental components of computer algebra systems. The first polynomial factorization algorithm was published by Theodor von Schubert in 1793. Leopold Kronecker rediscovered Schubert's algorithm in 1882 and extended it to multivariate polynomials and coefficients in an algebraic extension.

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.

Vector space

In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called vectors, may be added together and multiplied ("scaled") by numbers called scalars. Scalars are often real numbers, but can be complex numbers or, more generally, elements of any field. The operations of vector addition and scalar multiplication must satisfy certain requirements, called vector axioms. The terms real vector space and complex vector space are often used to specify the nature of the scalars: real coordinate space or complex coordinate space.

Related lectures (64)

Minimal Polynomials: Uniqueness and Division

Explores the uniqueness of minimal polynomials and the division algorithm for polynomials.

Linear Algebra: Abstract Concepts

Introduces abstract concepts in linear algebra, focusing on operations with vectors and matrices.

Polynomial Methods: GCD Calculation Summary

Covers the calculation of the greatest common divisor using polynomial methods and the Euclidean algorithm.

Vector Spaces: Properties and Operations

Covers the properties and operations of vector spaces, including addition and scalar multiplication.

Linear Algebra: Matrix Representation of Linear Applications