Concept

Dual space

In mathematics, any vector space has a corresponding dual vector space (or just dual space for short) consisting of all linear forms on together with the vector space structure of pointwise addition and scalar multiplication by constants. The dual space as defined above is defined for all vector spaces, and to avoid ambiguity may also be called the . When defined for a topological vector space, there is a subspace of the dual space, corresponding to continuous linear functionals, called the continuous dual space. Dual vector spaces find application in many branches of mathematics that use vector spaces, such as in tensor analysis with finite-dimensional vector spaces. When applied to vector spaces of functions (which are typically infinite-dimensional), dual spaces are used to describe measures, distributions, and Hilbert spaces. Consequently, the dual space is an important concept in functional analysis. Early terms for dual include polarer Raum [Hahn 1927], espace conjugué, adjoint space [Alaoglu 1940], and transponierter Raum [Schauder 1930] and [Banach 1932]. The term dual is due to Bourbaki 1938. Given any vector space over a field , the (algebraic) dual space (alternatively denoted by or ) is defined as the set of all linear maps (linear functionals). Since linear maps are vector space homomorphisms, the dual space may be denoted . The dual space itself becomes a vector space over when equipped with an addition and scalar multiplication satisfying: for all , , and . Elements of the algebraic dual space are sometimes called covectors, one-forms, or linear forms. The pairing of a functional in the dual space and an element of is sometimes denoted by a bracket: or . This pairing defines a nondegenerate bilinear mapping called the natural pairing. Dual basis If is finite-dimensional, then has the same dimension as . Given a basis in , it is possible to construct a specific basis in , called the dual basis. This dual basis is a set of linear functionals on , defined by the relation for any choice of coefficients .

Official source

https://en.wikipedia.org/wiki/Dual_space

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related courses (32)

MGT-418: Convex optimization

This course introduces the theory and application of modern convex optimization from an engineering perspective. ...

EE-556: Mathematics of data: from theory to computation

This course provides an overview of key advances in continuous optimization and statistical analysis for machine learning. We review recent learning formulations and models as well as their guarantees

MATH-512: Optimization on manifolds

We develop, analyze and implement numerical algorithms to solve optimization problems of the form min f(x) where x is a point on a smooth manifold. To this end, we first study differential and Riemannian geometry (with a focus dictated by computational con ...

Related lectures (32)

Dual Space and Weak Convergence

Explores the dual space of a Hilbert space and weak convergence, focusing on orthonormal bases and separable Hilbert spaces.

Distributions & Interpolation Spaces

Covers distributions, interpolation spaces, convergence, and the concept of dual spaces.

Dual Bases: Canonical and Dual Spaces

Explores the concept of dual bases in linear algebra and their practical applications.

Related publications (16)

A Slightly Improved Upper Bound for Quantum Statistical Zero-Knowledge

The complexity class Quantum Statistical Zero-Knowledge (QSZK), introduced by Watrous (FOCS 2002) and later refined in Watrous (SICOMP, 2009), has the best known upper bound QIP(2) ∩ co-QIP(2), which was simplified following the inclusion QIP(2) ⊆ PSPACE established in Jain, Upadhyay, and Watrous (FOCS 2009). Here, QIP(2) denotes the class of promise problems that admit two-message quantum interactive proof systems in which the honest prover is typically computationally unbounded, and co-QIP(2) denotes the

Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing2026

From Co-Design to Classroom Integration: Adoption of an Interactive Module for Heart Dissection Preparation in Two Lower Secondary Schools

Denis Gillet

This study examines how teacher co-design and student perceptions influence the adoption of an interactive heartdissection preparation module in two Geneva lower secondary schools. Grounded in the UTAUT framework and a Pedagogical Co-Design (PCoD) model, the study used mixed methods (teacher reflective journals and interviews; UTAUT questionnaires, activity logs and pre/post knowledge tests for N=44 students). Key findings indicate that co-design fostered teacher ownership and pedagogical alignment, and tha

2026

Bootstrapping Euclidean two-point correlators

We develop a bootstrap approach to Euclidean two-point correlators, in the thermal or ground state of quantum mechanical systems. We formulate the problem of bounding the two-point correlator as a semidefinite programming problem, subject to the constraints of reflection positivity, the Heisenberg equations of motion, and the Kubo-Martin-Schwinger condition or ground-state positivity. In the dual formulation, the Heisenberg equations of motion become “inequalities of motion” on the Lagrange multipliers that

Springer Science and Business Media LLC2026

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.

Official source

https://en.wikipedia.org/wiki/Dual_space

About this result

Ontological neighbourhood

Mathematics

Analysis: Functional analysis

Related courses (32)

MGT-418: Convex optimization

This course introduces the theory and application of modern convex optimization from an engineering perspective. ...

EE-556: Mathematics of data: from theory to computation

MATH-512: Optimization on manifolds

Related lectures (32)

Dual Space and Weak Convergence

Explores the dual space of a Hilbert space and weak convergence, focusing on orthonormal bases and separable Hilbert spaces.

Distributions & Interpolation Spaces

Covers distributions, interpolation spaces, convergence, and the concept of dual spaces.

Dual Bases: Canonical and Dual Spaces

Explores the concept of dual bases in linear algebra and their practical applications.

Related publications (16)

A Slightly Improved Upper Bound for Quantum Statistical Zero-Knowledge

Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing2026

From Co-Design to Classroom Integration: Adoption of an Interactive Module for Heart Dissection Preparation in Two Lower Secondary Schools

Denis Gillet

2026

Bootstrapping Euclidean two-point correlators

Springer Science and Business Media LLC2026

Related people (15)

Dimitri Stelio Wyss

I did my PhD under the supervision of Tamas Hausel at EPFL and the Institue of Science and Technology Austria . From 2017-2019 I was a postdoctoral researcher at the Sorbonne University Paris 6 with François Loeser. Since September 2019 I hold the chair of arithmetic geometry at EPFL as a tenure track assistant professor. For more information see my CV.I work in algebraic and arithmetic geometry. My research uses ideas from p-adic and motivic integration to study the interplay between geometric and arithmet

Simone Deparis

Expertise Simone Deparis is a professor at EPFL specializing in applied mathematics, numerical analysis, and the didactics of university-level mathematics. His research spans computational modeling for biomedical applications and innovations in mathematics education, with a focus on equity, self-efficacy, and assessment reform in large STEM cohorts. Mission Our group conducts research at the intersection of applied mathematics and learning sciences. In applied mathematics, we focus on modeling and simulatio

Pierre Vandergheynst

Pierre Vandergheynst received the M.S. degree in physics and the Ph.D. degree in mathematical physics from the Université catholique de Louvain, Louvain-la-Neuve, Belgium, in 1995 and 1998, respectively. From 1998 to 2001, he was a Postdoctoral Researcher with the Signal Processing Laboratory, Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland. He was Assistant Professor at EPFL (2002-2007), where he is now a Full Professor of Electrical Engineering and, by courtesy, of Computer and Communication Sciences. As of 2015, Prof. Vandergheynst serves as EPFL’s Vice-Provost for Education. His research focuses on harmonic analysis, sparse approximations and mathematical data processing in general with applications covering signal, image and high dimensional data processing, computer vision, machine learning, data science and graph-based data processing. He was co-Editor-in-Chief of Signal Processing (2002-2006), Associate Editor of the IEEE Transactions on Signal Processing (2007-2011), the flagship journal of the signal processing community and currently serves as Associate Editor of Computer Vision and Image Understanding and SIAM Imaging Sciences. He has been on the Technical Committee of various conferences, serves on the steering committee of the SPARS workshop and was co-General Chairman of the EUSIPCO 2008 conference. Pierre Vandergheynst is the author or co-author of more than 70 journal papers, one monograph and several book chapters. He has received two IEEE best paper awards. Professor Vandergheynst is a laureate of the Apple 2007 ARTS award and of the 2009-2010 De Boelpaepe prize of the Royal Academy of Sciences of Belgium.

Michaël Unser

Expertise Image Processing, Medical Imaging, Biological Imaging, Wavelets, Splines, Multiresolution Michael Unser is Full Professor with EPFL’s school of Engineering and the academic director of EPFL's Center for Imaging, Lausanne, Switzerland. His primary areas of investigation are signal processing, biomedical imaging and applied functional analysis. He is internationally recognized for his research contributions to sampling theory, wavelets, the use of splines for image processing, stochastic processes,

Martin Alois Rohrmeier

Teaching & PhD PhD Students Joris Monnet, Marina Borsodi-Benson, Xinyi Guan, Xiaoxuan Wang, Zeng Ren Past EPFL PhD Students Fabian Claude Moss, Daniel Harasim, Christoph Finkensiep, Johannes Hentschel, Gabriele Cecchetti, Shuxin Meng Courses Digital musicology DH-401 This course will introduce students to the central topics in digital musicology and core theoretical approaches and methods. In the practical part, students will carry out a practical project. Musical theory and creativity

Frédéric Mila

Expertise Condensed matter theory, strongly correlated systems, frustrated and quantum magnetism, tensor networks Mission Perform research in condensed matter theory, whenever possible in collaboration with experimentalists at EPFL and throughout the world Current Work

Magnetism on the Shastry-Sutherland lattice- Tensor network approach to 2D strongly correlated systems- Thermal properties of 2D frustrated quantum magnets- Exotic phases of quantum one-dimensional models Since 2003 Full Professor at EPFL (

Aleksandar Antanasijevic

Teaching & PhD PhD Students Camilla Di Giulio, Kiruthika Kumar, Yash Garodia Courses Biological chemistry I BIO-212 Biochemistry is a key discipline for the Life Sciences. Biological Chemistry I and II are two tightly interconnected courses that aim to describe and understand in molecular terms the processes that make life possible. General chemistry for SV CH-100 This course covers essential notions in general chemistry, relative to matter and its structure, equilibriums

Samy Bengio

Expertise Large Language ModelsReasoningStatistical machine learningSpeech processingPerson authenticationMultimodal processingSequence processingArtificial neural networks, support vector machinesHidden markov models, gaussian mixture modelsetc Expertise Large Language ModelsReasoningStatistical machine learningSpeech processingPerson authenticationMultimodal processingSequence processingArtificial neural networks, support vector machinesHidden markov models, gaussian mixture modelsetc Mission Samy Bengio

Andrei Negut

Teaching & PhD PhD Students Archi Kaushik, Niccolò Giacomini, Paul Vögele Courses Algebra II - groups MATH-211 This course deals with group theory, with particular emphasis on group actions and notions of category theory. Linear algebra (english) MATH-111(en) The purpose of the course is to introduce the basic notions of linear algebra and its applications. Representation Theory II - Lie groups and algebras MATH-429 This is a standard course on Lie groups, L

Arash Amini

Related units (3)

CIBM - Signal Processing

IMAGING - Administration

Biomedical Imaging Laboratory

Related concepts (24)

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.

Hilbert space

In mathematics, Hilbert spaces (named after David Hilbert) allow the methods of linear algebra and calculus to be generalized from (finite-dimensional) Euclidean vector spaces to spaces that may be infinite-dimensional. Hilbert spaces arise naturally and frequently in mathematics and physics, typically as function spaces. Formally, a Hilbert space is a vector space equipped with an inner product that induces a distance function for which the space is a complete metric space.

Bilinear map

In mathematics, a bilinear map is a function combining elements of two vector spaces to yield an element of a third vector space, and is linear in each of its arguments. Matrix multiplication is an example. Let and be three vector spaces over the same base field . A bilinear map is a function such that for all , the map is a linear map from to and for all , the map is a linear map from to In other words, when we hold the first entry of the bilinear map fixed while letting the second entry vary, the result is a linear operator, and similarly for when we hold the second entry fixed.

Related MOOCs (1)

Introduction to optimization on smooth manifolds: first order methods

Optimization on manifolds is the result of smooth geometry and optimization merging into one elegant modern framework. We start the course at "What is a manifold?", and give the students a firm understanding of submanifolds embedded in real space. This covers numerous applications in engineering and the sciences. All definitions and theorems are motivated to build time-tested optimization algorithms. The math is precise, to promote understanding and enable computation. We build our way up to Riemannian g

Related exercises (1)

The hare and the turtle

A hare and a turtle race over a distance L. The turtle starts running at constant speed

v_{\rm t}

and the hare at constant speed

v_{\rm h}

. The hare is not taking this seriously, and so

v_{\rm h} < v_{\rm t}

. When the turtle reaches a bridge that stands at a distance L′u2004

Related notebooks (1)

Introduction to Reciprocal Lattices with Periodic Boundary Conditions.

Real vs. Reciprocal Space in 2D[1]¶ Introduction[2]¶ In this short notebook, we will introduce the lattice with periodic(Born- von Karman) boundary condition. Following the boundary condition, there is a transformation from real lattice to the reciprocal lattice. In the code below, we define a1 and a2 through cartesian vectors. Hence, the reciprocal vectors will be the original rotated by 90 degrees multiplied by 2pi and divided by the area of the unit cell (|a1xa2|) In [1]: i