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

Lecture

Solving Polynomial Equations: Basics and Applications

In course

MATH-110(a): Advanced linear algebra I - vector spaces

L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire (pour les futurs mathématiciens) et de démontrer rigoureusement les résultats principaux de ce sujet. ...

Description

This lecture covers the basics of solving polynomial equations, focusing on equations of degree 2. It introduces the methods of solving equations historically developed by mathematicians like Del Ferro, Tartaglia, Cardano, Bombelli, and Ferrari. The lecture also discusses the properties of matrices over a field, including invertibility and determinants. Additionally, it explores the concept of imaginary numbers and their historical origins. The lecture concludes with the study of subrings and fields within matrix algebras, emphasizing the properties of commutativity and invertibility.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructors (2)

Philippe Michel

Ph. Michel's main research interest lie in the field of analytic number theory and range over a variety of techniques and methods which include: arithmetic geometry, exponential sums, sieve methods, automorphic forms and allied representations, L-functions and more recently ergodic theory. Ph. Michel is a former student of ENS Cachan and obtained his PhD in Universté Paris XI in 1995 under the guidance of E. Fouvry. From 1995 to 1998 he was maître de conférence at Universté Paris XI and full professor at Université Montpellier II until 2008 then when he joined EPFL. Ph. Michel was awarded the Peccot-Vimont prize, has been member of the Institut Universitaire de France and wa invited speaker at the 2006 International Congress of Mathematician.

Daniel Kressner

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra, Abstract algebra

Related concepts (32)

Invertible matrix

In linear algebra, an n-by-n square matrix A is called invertible (also nonsingular, nondegenerate or (rarely used) regular), if there exists an n-by-n square matrix B such that where In denotes the n-by-n identity matrix and the multiplication used is ordinary matrix multiplication. If this is the case, then the matrix B is uniquely determined by A, and is called the (multiplicative) inverse of A, denoted by A−1. Matrix inversion is the process of finding the matrix B that satisfies the prior equation for a given invertible matrix A.

Matrix multiplication

In mathematics, particularly in linear algebra, matrix multiplication is a binary operation that produces a matrix from two matrices. For matrix multiplication, the number of columns in the first matrix must be equal to the number of rows in the second matrix. The resulting matrix, known as the matrix product, has the number of rows of the first and the number of columns of the second matrix. The product of matrices A and B is denoted as AB.

Matrix ring

In abstract algebra, a matrix ring is a set of matrices with entries in a ring R that form a ring under matrix addition and matrix multiplication . The set of all n × n matrices with entries in R is a matrix ring denoted Mn(R) (alternative notations: Matn(R) and Rn×n). Some sets of infinite matrices form infinite matrix rings. Any subring of a matrix ring is a matrix ring. Over a rng, one can form matrix rngs. When R is a commutative ring, the matrix ring Mn(R) is an associative algebra over R, and may be called a matrix algebra.

Matrix (mathematics)

In mathematics, a matrix (plural matrices) is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns, which is used to represent a mathematical object or a property of such an object. For example, is a matrix with two rows and three columns. This is often referred to as a "two by three matrix", a " matrix", or a matrix of dimension . Without further specifications, matrices represent linear maps, and allow explicit computations in linear algebra.

Subring

In mathematics, a subring of R is a subset of a ring that is itself a ring when binary operations of addition and multiplication on R are restricted to the subset, and which shares the same multiplicative identity as R. For those who define rings without requiring the existence of a multiplicative identity, a subring of R is just a subset of R that is a ring for the operations of R (this does imply it contains the additive identity of R).

Related lectures (45)

Linear Algebra: Matrices Properties

Explores properties of 3x3 matrices with real coefficients and determinant calculation methods.

Stein Algorithm: Polynomial Identity Testing

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

Linear Algebra: Matrices and Operations

Introduces key concepts in linear algebra, including matrices, operations, and numerical invariants.

Matrix Operations: Definitions and Properties

Covers the definitions and properties of matrices, including matrix operations and determinants.

Matrix of Cofactors and Inverse Matrix Formula MOOC: Linear Algebra (Part 2)