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

Lecture

Embedding in Function Spaces

In course

MATH-502: Distribution and interpolation spaces

The goal of this course is to give an introduction to the theory of distributions and cover the fundamental results of Sobolev spaces including fractional spaces that appear in the interpolation theory. Those notions are central to the study of partial dif ...

Description

This lecture covers the concept of embedding in function spaces, starting with the equivalence of respective proofs and the elliptic equation. It then delves into the continuous embedding of LP(R) in Wp(R) and the Hölder inequality. The lecture also discusses the decreasing rearrangement of functions, the Lorentz space, and interpolation couples. Hardy-Young inequality is explored, along with the details of the embedding in function spaces and the proof of the inequality.

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

Official source

Ontological neighbourhood

Mathematics

Analysis: Functional analysis

Related concepts (30)

Function space

In mathematics, a function space is a set of functions between two fixed sets. Often, the domain and/or codomain will have additional structure which is inherited by the function space. For example, the set of functions from any set into a vector space has a natural vector space structure given by pointwise addition and scalar multiplication. In other scenarios, the function space might inherit a topological or metric structure, hence the name function space. Vector space#Function spaces Let be a vector space over a field and let be any set.

Interpolation

In the mathematical field of numerical analysis, interpolation is a type of estimation, a method of constructing (finding) new data points based on the range of a discrete set of known data points. In engineering and science, one often has a number of data points, obtained by sampling or experimentation, which represent the values of a function for a limited number of values of the independent variable. It is often required to interpolate; that is, estimate the value of that function for an intermediate value of the independent variable.

Lp space

DISPLAYTITLE:Lp space In mathematics, the Lp spaces are function spaces defined using a natural generalization of the p-norm for finite-dimensional vector spaces. They are sometimes called Lebesgue spaces, named after Henri Lebesgue , although according to the Bourbaki group they were first introduced by Frigyes Riesz . Lp spaces form an important class of Banach spaces in functional analysis, and of topological vector spaces.

Multivariate interpolation

In numerical analysis, multivariate interpolation is interpolation on functions of more than one variable (multivariate functions); when the variates are spatial coordinates, it is also known as spatial interpolation. The function to be interpolated is known at given points and the interpolation problem consists of yielding values at arbitrary points . Multivariate interpolation is particularly important in geostatistics, where it is used to create a digital elevation model from a set of points on the Earth's surface (for example, spot heights in a topographic survey or depths in a hydrographic survey).

Polynomial interpolation

In numerical analysis, polynomial interpolation is the interpolation of a given bivariate data set by the polynomial of lowest possible degree that passes through the points of the dataset. Given a set of n + 1 data points , with no two the same, a polynomial function is said to interpolate the data if for each . There is always a unique such polynomial, commonly given by two explicit formulas, the Lagrange polynomials and Newton polynomials.

Related lectures (50)

Interpolation by Intervals: Lagrange Interpolation

Covers Lagrange interpolation using intervals to find accurate polynomial approximations.

Deep Learning Modus Operandi

Explores the benefits of deeper networks in deep learning and the importance of over-parameterization and generalization.

Interpolation de fonction

Explores interpolation of regular functions, error analysis, convergence, and Chebyshev polynomials.

Approximation of Data

Covers the least squares method for approximating data and handling errors.

Measure Spaces: O-Finite and Probability Measures