# Duality (mathematics)

(Redirected from Self-dual)
For the property of optimization problems, see Duality (optimization).

In mathematics, a duality, generally speaking, translates concepts, theorems or mathematical structures into other concepts, theorems or structures, in a one-to-one fashion, often (but not always) by means of an involution operation: if the dual of A is B, then the dual of B is A. Such involutions sometimes have fixed points, so that the dual of A is A itself. For example, Desargues' theorem is self-dual in this sense under the standard duality in projective geometry.

In mathematical contexts, duality has numerous meanings[1] although it is "a very pervasive and important concept in (modern) mathematics"[2] and "an important general theme that has manifestations in almost every area of mathematics".[3]

Many mathematical dualities between objects of two types correspond to pairings, bilinear functions from an object of one type and another object of the second type to some family of scalars. For instance, linear algebra duality corresponds in this way to bilinear maps from pairs of vector spaces to scalars, the duality between distributions and the associated test functions corresponds to the pairing in which one integrates a distribution against a test function, and Poincaré duality corresponds similarly to intersection number, viewed as a pairing between submanifolds of a given manifold.[4]

From a category theory viewpoint, duality can also be seen as a functor, at least in the realm of vector spaces. This functor assigns to each space its dual space, and the pullback construction assigns to each arrow f: VW its dual f: WV.

## Introductory examples

In the words of Michael Atiyah,

Duality in mathematics is not a theorem, but a “principle”.[5]

The following list of examples shows the common features of many dualities, but also indicates that the precise meaning of duality may vary from case to case.

### Complement of a subset

A simple, maybe the most simple, duality arises from considering subsets of a fixed set S. To any subset ${\displaystyle A\subseteq S}$, the complement ${\displaystyle A^{c}}$[6] consists of all those elements in S which are not contained in A. It is again a subset of S. Taking the complement has the following properties:

• Applying it twice gives back the original set, i.e., ${\displaystyle (A^{c})^{c}=A}$. This is referred to by saying that the operation of taking the complement is an involution.
• An inclusion of sets ${\displaystyle A\subseteq B}$ is turned into an inclusion in the opposite direction ${\displaystyle B^{c}\subseteq A^{c}}$.
• Given two subsets A and B of S, A is contained in ${\displaystyle B^{c}}$ if and only if B is contained in ${\displaystyle A^{c}}$.

This duality appears in topology as a duality between open and closed subsets of some fixed topological space X: a subset U of X is closed if and only if its complement in X is open. Because of this, many theorems about closed sets are dual to theorems about open sets. For example, any union of open sets is open, so dually, any intersection of closed sets is closed. The interior of a set is the largest open set contained in it, and the closure of the set is the smallest closed set that contains it. Because of the duality, the complement of the interior of any set U is equal to the closure of the complement of U.

### Dual cone

A set C (blue) and its dual cone C* (red).

Another duality is provided by the dual cone construction. Given a set C of points in the plane ${\displaystyle \mathbb {R} ^{2}}$ (or more generally points in ${\displaystyle \mathbb {R} ^{n}}$), the dual cone is defined as the set ${\displaystyle C^{*}\subseteq \mathbb {R} ^{2}}$ consisting of those points ${\displaystyle (x_{1},x_{2})}$ satisfying

${\displaystyle x_{1}c_{1}+x_{2}c_{2}\geq 0}$

for all points ${\displaystyle (c_{1},c_{2})}$ in C, as illustrated at the right. Unlike for the complement of sets mentioned above, it is not in general true that applying the dual cone construction twice gives back the original set C. Instead, ${\displaystyle C^{**}}$ is the smallest[7] cone containing C which may be bigger than C. Therefore this duality is weaker than the one above, in that

• Applying the operation twice gives back a possibly bigger set: for all C, C is contained in ${\displaystyle C^{**}}$. (For some C, namely the cones, the two are actually equal.)

The other two properties carry over without change:

• It is still true that an inclusion ${\displaystyle C\subseteq D}$ is turned into an inclusion in the opposite direction (${\displaystyle D^{*}\subseteq C^{*}}$).
• Given two subsets C and D of the plane, C is contained in ${\displaystyle D^{*}}$ if and only if D is contained in ${\displaystyle C^{*}}$.

### Dual vector space

A very important example of a duality arises in linear algebra by associating to any vector space V its dual vector space ${\displaystyle V^{*}}$. Its elements are the k-linear maps ${\displaystyle \varphi :V\to k}$, where k is the field over which V is defined. The three properties of the dual cone carry over to this type of duality by replacing subsets of ${\displaystyle \mathbb {R} ^{2}}$ by vector space and inclusions of such subsets by linear maps. That is:

• Applying the operation of taking the dual vector space twice gives another vector space ${\displaystyle V^{**}}$. There is always a map ${\displaystyle V\to V^{**}}$. For some V, namely precisely the finite-dimensional vector spaces, this map is an isomorphism.
• A linear map ${\displaystyle V\to W}$ gives rise to a map in the opposite direction (${\displaystyle W^{*}\to V^{*}}$).
• Given two vector spaces V and W, the maps from V to ${\displaystyle W^{*}}$ correspond to the maps from W to ${\displaystyle V^{*}}$.

A particular feature of this duality is that V and ${\displaystyle V^{*}}$ are isomorphic for certain objects, namely finite-dimensional vector spaces. However, this is in a sense a lucky coincidence, for giving such an isomorphism requires a certain choice, for example the choice of a basis of V.

### Galois theory

In all the dualities discussed before, the dual of an object was of the same kind as the object itself. For example, the dual of a vector space is again a vector space. Many duality statements are not of this kind. Instead, such dualities reveal a close relation between objects of a priori fundamentally different nature. One example of such a more general duality is from Galois theory. For a fixed Galois extension K / F, one may associate the Galois group Gal(K/E) to any intermediate field E (i.e., ${\displaystyle F\subseteq E\subseteq K}$). This group is a subgroup of the Galois group G = Gal(K/F). Conversely, to any such subgroup ${\displaystyle H\subseteq G}$ there is the fixed field ${\displaystyle K^{H}}$ consisting of elements fixed by the elements in H.

Compared to the above, this duality has the following features:

• An extension ${\displaystyle F\subseteq F'}$ of intermediate fields gives rise to an inclusion of Galois groups in the opposite direction: ${\displaystyle Gal(K/F')\subseteq Gal(K/F).}$
• Associating ${\displaystyle Gal(K/E)}$ to E and ${\displaystyle K^{H}}$ to H are inverse to each other. This is the content of the fundamental theorem of Galois theory.

## Order-reversing dualities

Hasse diagram of the power set of {1,2,3,4}, partially ordered by ⊂. The dual poset, i.e. ordering by ⊃, is obtained by turning the diagram upside-down. The green nodes form an upper set and a lower set in the original and the dual order, respectively.

Given a poset P = (X, ≤) (short for partially ordered set; i.e., a set whose elements can be compared to each other), the dual poset Pd = (X, ≥) comprises the same ground set but the converse relation. Familiar examples of dual partial orders include

• the subset and superset relations ⊂ and ⊃ on any collection of sets, such as the subsets of a fixed set S. This gives rise to the first example of a duality mentioned above.
• the divides and multiple-of relations on the integers.
• the descendant-of and ancestor-of relations on the set of humans.

A duality transform is an involutive antiautomorphism f of a partially ordered set S, that is, an order-reversing involution ${\displaystyle f:S\to S.}$[8][9] In several important cases these simple properties determine the transform uniquely up to some simple symmetries. For example, if ${\displaystyle f_{1},f_{2}}$ are two duality transforms then their composition is an order automorphism of S; thus, any two duality transforms differ only by an order automorphism. For example, all order automorphisms of a power set S = 2R are induced by permutations of R.

A concept defined for a partial order P will correspond to a dual concept on the dual poset Pd. For instance, a minimal element of P will be a maximal element of Pd: minimality and maximality are dual concepts in order theory. Other pairs of dual concepts are upper and lower bounds, lower sets and upper sets, and ideals and filters.

In topology, open sets and closed sets are dual concepts: the complement of an open set is closed, and vice versa. In matroid theory, the family of sets complementary to the independent sets of a given matroid themselves form another matroid, called the dual matroid.

## Dimension-reversing dualities

The features of the cube and its dual octahedron correspond one-for-one with dimensions reversed.

There are many distinct but interrelated dualities in which geometric or topological objects correspond to other objects of the same type, but with a reversal of the dimensions of the features of the objects. A classical example of this is the duality of the platonic solids, in which the cube and the octahedron form a dual pair, the dodecahedron and the icosahedron form a dual pair, and the tetrahedron is self-dual. The dual polyhedron of any of these polyhedra may be formed as the convex hull of the center points of each face of the primal polyhedron, so the vertices of the dual correspond one-for-one with the faces of the primal. Similarly, each edge of the dual corresponds to an edge of the primal, and each face of the dual corresponds to a vertex of the primal. These correspondences are incidence-preserving: if two parts of the primal polyhedron touch each other, so do the corresponding two parts of the dual polyhedron. More generally, using the concept of polar reciprocation, any convex polyhedron, or more generally any convex polytope, corresponds to a dual polyhedron or dual polytope, with an i-dimensional feature of an n-dimensional polytope corresponding to an (n − i − 1)-dimensional feature of the dual polytope. The incidence-preserving nature of the duality is reflected in the fact that the face lattices of the primal and dual polyhedra or polytopes are themselves order-theoretic duals. Duality of polytopes and order-theoretic duality are both involutions: the dual polytope of the dual polytope of any polytope is the original polytope, and reversing all order-relations twice returns to the original order. Choosing a different center of polarity leads to geometrically different dual polytopes, but all have the same combinatorial structure.

A planar graph in blue, and its dual graph in red.

From any three-dimensional polyhedron, one can form a planar graph, the graph of its vertices and edges. The dual polyhedron has a dual graph, a graph with one vertex for each face of the polyhedron and with one edge for every two adjacent faces. The same concept of planar graph duality may be generalized to graphs that are drawn in the plane but that do not come from a three-dimensional polyhedron, or more generally to graph embeddings on surfaces of higher genus: one may draw a dual graph by placing one vertex within each region bounded by a cycle of edges in the embedding, and drawing an edge connecting any two regions that share a boundary edge. An important example of this type comes from computational geometry: the duality for any finite set S of points in the plane between the Delaunay triangulation of S and the Voronoi diagram of S. As with dual polyhedra and dual polytopes, the duality of graphs on surfaces is a dimension-reversing involution: each vertex in the primal embedded graph corresponds to a region of the dual embedding, each edge in the primal is crossed by an edge in the dual, and each region of the primal corresponds to a vertex of the dual. The dual graph depends on how the primal graph is embedded: different planar embeddings of a single graph may lead to different dual graphs. Matroid duality is an algebraic extension of planar graph duality, in the sense that the dual matroid of the graphic matroid of a planar graph is isomorphic to the graphic matroid of the dual graph.

A kind of geometric duality also occurs in optimization theory, but not one that reverses dimensions. A linear program may be specified by a system of real variables (the coordinates for a point in Euclidean space Rn), a system of linear constraints (specifying that the point lie in a halfspace; the intersection of these halfspaces is a convex polytope, the feasible region of the program), and a linear function (what to optimize). Every linear program has a dual problem with the same optimal solution, but the variables in the dual problem correspond to constraints in the primal problem and vice versa.

## Duality in logic and set theory

In logic, functions or relations A and B are considered dual if Ax) = ¬B(x), where ¬ is logical negation. The basic duality of this type is the duality of the ∃ and ∀ quantifiers in classical logic. These are dual because ∃xP(x) and ¬∀x.P(x) are equivalent for all predicates P in classical logic: if there exists an x for which P fails to hold, then it is false that P holds for all x (but the converse does not hold constructively). From this fundamental logical duality follow several others:

• A formula is said to be satisfiable in a certain model if there are assignments to its free variables that render it true; it is valid if every assignment to its free variables makes it true. Satisfiability and validity are dual because the invalid formulas are precisely those whose negations are satisfiable, and the unsatisfiable formulas are those whose negations are valid. This can be viewed as a special case of the previous item, with the quantifiers ranging over interpretations.
• In classical logic, the ∧ and ∨ operators are dual in this sense, because (¬x ∧ ¬y) and ¬ (xy) are equivalent. This means that for every theorem of classical logic there is an equivalent dual theorem. De Morgan's laws are examples. More generally, ${\displaystyle \bigwedge (\neg x_{i})=\neg \bigvee x_{i}}$. The left side is true if and only if ∀ixi, and the right side if and only if ¬∃i.xi.
• In modal logic, ${\displaystyle \square }$p means that the proposition p is "necessarily" true, and ${\displaystyle \Diamond p}$ that p is "possibly" true. Most interpretations of modal logic assign dual meanings to these two operators. For example in Kripke semantics, "p is possibly true" means "there exists some world W in which p is true", while "p is necessarily true" means "for all worlds W, p is true". The duality of ${\displaystyle \square }$ and ${\displaystyle \Diamond }$ then follows from the analogous duality of ∀ and ∃. Other dual modal operators behave similarly. For example, temporal logic has operators denoting "will be true at some time in the future" and "will be true at all times in the future" which are similarly dual.

Other analogous dualities follow from these:

• Set-theoretic union and intersection are dual under the set complement operator ⋅C. That is, ACBC = (AB)C, and more generally, ${\displaystyle \bigcap A_{\alpha }^{C}=\left(\bigcup A_{\alpha }\right)^{C}}$. This follows from the duality of ∀ and ∃: an element x is a member of ${\displaystyle \bigcap A_{\alpha }^{C}}$ if and only if ∀α.¬xAα, and is a member of ${\displaystyle \left(\bigcup A_{\alpha }\right)^{C}}$ if and only if ¬∃α.xAα.

## Dual objects

A group of dualities can be described by endowing, for any mathematical object X, the set of morphisms Hom (X, D) into some fixed object D, with a structure similar to the one of X. This is sometimes called internal Hom. In general, this yields a true duality only for specific choices of D, in which case X=Hom (X, D) is referred to as the dual of X. There is always a map from X to the bidual, that is to say, the dual of the dual,

${\displaystyle X\to X^{**}:=(X^{*})^{*}=Hom(Hom(X,D),D).}$

It assigns to some ${\displaystyle x\in X}$ the map that associates to any map ${\displaystyle f:X\to D}$ (i.e., an element in ${\displaystyle Hom(X,D)}$) the value f(x). Depending on the concrete duality considered and also depending on the object X, this map may or may not be an isomorphism.

### Dual vector spaces revisited

The construction of the dual vector space

V = Hom (V, K)

mentioned in the introduction is an example of such a duality. Indeed, the set of morphisms, i.e., linear maps, forms a vector space in its own right. The map VV∗∗ mentioned above is always injective. It is surjective, and therefore an isomorphism, if and only if the dimension of V is finite. This fact characterizes finite-dimensional vector spaces without referring to a basis.

#### Isomorphisms of V and V∗ and inner product spaces

A vector space V is isomorphic to V precisely if V is finite-dimensional. In this case, such an isomorphism is equivalent to a non-degenerate bilinear form

${\displaystyle \varphi :V\times V\to K}$

In this case V is called an inner product space. For example, if K is the field of real or complex numbers, any positive definite bilinear form gives rise to such an isomorphism. In Riemannian geometry, V is taken to be the tangent space of a manifold and such positive bilinear forms are called Riemannian metrics. Their purpose is to measure angles and distances. Thus, duality is a foundational basis of this branch of geometry. Another application of inner product spaces is the Hodge star which provides a correspondence between the elements of the exterior algebra. For an n-dimensional vector space, the Hodge star operator maps k-forms to (nk)-forms. This can be used to formulate Maxwell's equations. In this guise, the duality inherent in the inner product space exchanges the role of magnetic and electric fields.

#### Duality in projective geometry

The complete quadrangle, a configuration of four points and six lines in the projective plane (left) and its dual configuration, the complete quadrilateral, with four lines and six points (right).

In some projective planes, it is possible to find geometric transformations that map each point of the projective plane to a line, and each line of the projective plane to a point, in an incidence-preserving way.[10] For such planes there arises a general principle of duality in projective planes: given any theorem in such a plane projective geometry, exchanging the terms "point" and "line" everywhere results in a new, equally valid theorem.[11] A simple example is that the statement "two points determine a unique line, the line passing through these points" has the dual statement that "two lines determine a unique point, the intersection point of these two lines". For further examples, see Dual theorems.

A conceptual explanation of this phenomenon in some planes (notably field planes) is offered by the dual vector space. In fact, the points in the projective plane ${\displaystyle \mathbb {RP} ^{2}}$ correspond to one-dimensional subvector spaces ${\displaystyle V\subset \mathbb {R} ^{3}}$[12] while the lines in the projective plane correspond to subvector spaces W of dimension 2. The duality in such projective geometries stems from assigning to a one-dimensional V the subspace of ${\displaystyle (\mathbb {R} ^{3})^{*}}$ consisting of those linear maps ${\displaystyle f:\mathbb {R} ^{3}\to \mathbb {R} }$ which satisfy ${\displaystyle f(V)=0}$. As a consequence of the dimension formula of linear algebra, this space is two-dimensional, i.e., it corresponds to a line in the projective plane associated to ${\displaystyle (\mathbb {R} ^{3})^{*}}$.

The (positive definite) bilinear form

${\displaystyle \langle -,-\rangle :\mathbb {R} ^{3}\times \mathbb {R} ^{3}\to \mathbb {R} ,\langle x,y\rangle =\sum _{i=1}^{3}x_{i}y_{i}}$

yields an identification of this projective plane with the ${\displaystyle \mathbb {RP} ^{2}}$. Concretely, the duality assigns to ${\displaystyle V\subset \mathbb {R} ^{3}}$ its orthogonal ${\displaystyle \{w\in \mathbb {R} ^{3},\langle v,w\rangle =0{\text{ for all }}v\in V\}}$. The explicit formulas in duality in projective geometry arise by means of this identification.

### Topological vector spaces and Hilbert spaces

In the realm of topological vector spaces, a similar construction exists, replacing the dual by the topological dual vector space. A topological vector space that is canonically isomorphic to its bidual is called reflexive space. For example, the dual of an Lp-space is ${\displaystyle L^{q}}$ where ${\displaystyle 1/p+1/q=1}$provided that ${\displaystyle 1\leq p<\infty }$, but the dual of ${\displaystyle L^{\infty }}$ is bigger than ${\displaystyle L^{1}}$. Hence ${\displaystyle L^{1}}$ is not reflexive.

Hilbert spaces H are equipped with an inner product ${\displaystyle \langle -,-,\rangle }$. As in the finite-dimensional case, it allows to define a map

${\displaystyle H\to H^{*},v\mapsto (w\mapsto \langle v,w,\rangle ).}$

The Riesz representation theorem asserts that this map is an isomorphism, i.e., every Hilbert space is isomorphic to its dual.

Distributions are linear functionals on appropriate spaces of functions. They are an important technical means in the theory of partial differential equations (PDE): instead of solving a PDE directly, it may be easier to first solve the PDE in the "weak sense", i.e., find a distribution that satisfies the PDE and, second, to show that the solution must in fact be a function.[13]

### Further dual objects

The dual lattice of a lattice L is given by

Hom (L, Z),

which is used in the construction of toric varieties.[14] The Pontryagin dual of locally compact topological groups G is given by

Hom (G, S1),

continuous group homomorphisms with values in the circle (with multiplication of complex numbers as group operation).

## Dual categories

### Opposite category and adjoint functors

In another group of dualities, the objects of one theory are translated into objects of another theory and the maps between objects in the first theory are translated into morphisms in the second theory, but with direction reversed. Using the parlance of category theory, this amounts to a contravariant functor between two categories C and D:

F: CD

which for any two objects X and Y of C gives a map

HomC(X, Y) → HomD(F(Y), F(X))

That functor may or may not be an equivalence of categories. There are various situations, where such a functor is an equivalence between the opposite category Cop of C, and D. Using a duality of this type, every statement in the first theory can be translated into a "dual" statement in the second theory, where the direction of all arrows has to be reversed.[15] Therefore, any duality between categories C and D is formally the same as an equivalence between C and Dop (Cop and D). However, in many circumstances the opposite categories have no inherent meaning, which makes duality an additional, separate concept.[16]

A category that is equivalent to its dual is called self-dual. An example of self-dual category is the category of Hilbert spaces.[17]

Many category-theoretic notions come in pairs in the sense that they correspond to each other while considering the opposite category. For example, Cartesian products Y1 × Y2 and disjoint unions Y1Y2 of sets are dual to each other in the sense that

Hom (X, Y1 × Y2) = Hom (X, Y1) × Hom (X, Y2)

and

Hom (Y1Y2, X) = Hom (Y1, X) × Hom (Y2, X)

for any set X. This is a particular case of a more general duality phenomenon, under which limits in a category C correspond to colimits in the opposite category Cop; further concrete examples of this are epimorphisms vs. monomorphism, in particular factor modules (or groups etc.) vs. submodules, direct products vs. direct sums (also called coproducts to emphasize the duality aspect). Therefore, in some cases, proofs of certain statements can be halved, using such a duality phenomenon. Further notions displaying related by such a categorical duality are projective and injective modules in homological algebra,[18] fibrations and cofibrations in topology and more generally model categories.[19]

Two functors F: CD and G: DC are adjoint if for all objects c in C and d in D

HomD(F(c), d) ≅ HomC(c, G(d)),

in a natural way. Actually, the correspondence of limits and colimits is an example of adjoints, since there is an adjunction

${\displaystyle \operatorname {colim} :C^{I}\leftrightarrow C:\Delta \,}$

between the colimit functor that assigns to any diagram in C indexed by some category I its colimit and the diagonal functor that maps any object c of C to the constant diagram which has c at all places. Dually,

${\displaystyle \Delta :C^{I}\leftrightarrow C:\lim .\,}$

### Spaces and functions

Gelfand duality is a duality between commutative C*-algebras A and compact Hausdorff spaces X is the same: it assigns to X the space of continuous functions (which vanish at infinity) from X to C, the complex numbers. Conversely, the space X can be reconstructed from A as the spectrum of A. Both Gelfand and Pontryagin duality can be deduced in a largely formal, category-theoretic way.[20]

In a similar vein there is a duality in algebraic geometry between commutative rings and affine schemes: to every commutative ring A there is an affine spectrum, Spec A. Conversely, given an affine scheme S, one gets back a ring by taking global sections of the structure sheaf OS. In addition, ring homomorphisms are in one-to-one correspondence with morphisms of affine schemes, thereby there is an equivalence

(Commutative rings)op ≅ (affine schemes)[21]

Affine schemes are the local building blocks of schemes. The previous result therefore tells that the local theory of schemes is the same as commutative algebra, the study of commutative rings.

Noncommutative geometry draws inspiration from Gelfand duality and studies noncommutative C*-algebras as if they were functions on some imagined space. Tannaka–Krein duality is a non-commutative analogue of Pontryagin duality.[22]

### Galois connections

In a number of situations, the two categories which are dual to each other are actually arising from partially ordered sets, i.e., there is some notion of an object "being smaller" than another one. A duality that respects the orderings in question is known as a Galois connection. An example is the standard duality in Galois theory mentioned in the introduction: a bigger field extension corresponds—under the mapping that assigns to any extension LK (inside some fixed bigger field Ω) the Galois group Gal (Ω / L) —to a smaller group.[23]

The collection of all open subsets of a topological space X forms a complete Heyting algebra. There is a duality, known as Stone duality, connecting sober spaces and spatial locales.

### Pontryagin duality

Pontryagin duality gives a duality on the category of locally compact abelian groups: given any such group G, the character group

χ(G) = Hom (G, S1)

given by continuous group homomorphisms from G to the circle group S1 can be endowed with the compact-open topology. Pontryagin duality states that the character group is again locally compact abelian and that

G ≅ χ(χ(G)).[24]

Moreover, discrete groups correspond to compact abelian groups; finite groups correspond to finite groups. On the one hand, Pontryagin is a special case of Gelfand duality. On the other hand, it is the conceptual reason of Fourier analysis, see below.

## Analytic dualities

In analysis, problems are frequently solved by passing to the dual description of functions and operators.

Fourier transform switches between functions on a vector space and its dual:

${\displaystyle {\hat {f}}(\xi ):=\int _{-\infty }^{\infty }f(x)\ e^{-2\pi ix\xi }\,dx,}$

and conversely

${\displaystyle f(x)=\int _{-\infty }^{\infty }{\hat {f}}(\xi )\ e^{2\pi ix\xi }\,d\xi .}$

If f is an L2-function on R or RN, say, then so is ${\displaystyle {\hat {f}}}$ and ${\displaystyle f(-x)={\hat {\hat {f}}}(x)}$. Moreover, the transform interchanges operations of multiplication and convolution on the corresponding function spaces. A conceptual explanation of the Fourier transform is obtained by the aforementioned Pontryagin duality, applied to the locally compact groups R (or RN etc.): any character of R is given by ξ↦ e−2πixξ. The dualizing character of Fourier transform has many other manifestations, for example, in alternative descriptions of quantum mechanical systems in terms of coordinate and momentum representations.

## Homology and cohomology

Theorems showing that certain objects of interest are the dual spaces (in the sense of linear algebra) of other objects of interest are often called dualities. Many of these dualities are given by a bilinear pairing of two K-vector spaces

ABK.

For perfect pairings, there is, therefore, an isomorphism of A to the dual of B.

### Poincaré duality

Poincaré duality of a smooth compact complex manifold X is given by a pairing of singular cohomology with C-coefficients (equivalently, sheaf cohomology of the constant sheaf C)

Hi(X) ⊗ H2ni(X) → C,

where n is the (complex) dimension of X.[25] Poincaré duality can also be expressed as a relation of singular homology and de Rham cohomology, by asserting that the map

${\displaystyle (\gamma ,\omega )\mapsto \int _{\gamma }\omega }$

(integrating a differential k-form over an 2nk-(real) -dimensional cycle) is a perfect pairing.

Poincaré duality also reverses dimensions; it corresponds to the fact that, if a topological manifold is represented as a cell complex, then the dual of the complex (a higher-dimensional generalization of the planar graph dual) represents the same manifold. In Poincaré duality, this homeomorphism is reflected in an isomorphism of the kth homology group and the (n − k)th cohomology group.

### Duality in algebraic and arithmetic geometry

The same duality pattern holds for a smooth projective variety over a separably closed field, using l-adic cohomology with Q-coefficients instead.[26] This is further generalized to possibly singular varieties, using intersection cohomology instead, a duality called Verdier duality.[27] Serre duality or coherent duality are similar to the statements above, but applies to cohomology of coherent sheaves instead.[28]

With increasing level of generality, it turns out, an increasing amount of technical background is helpful or necessary to understand these theorems: the modern formulation of these dualities can be done using derived categories and certain direct and inverse image functors of sheaves (with respect to the classical analytical topology on manifolds for Poincaré duality, l-adic sheaves and the étale topology in the second case, and with respect to coherent sheaves for coherent duality).

Yet another group of similar duality statements is encountered in arithmetics: étale cohomology of finite, local and global fields (also known as Galois cohomology, since étale cohomology over a field is equivalent to group cohomology of the (absolute) Galois group of the field) admit similar pairings. The absolute Galois group G(Fq) of a finite field, for example, is isomorphic to ${\displaystyle {\hat {\mathbf {Z} }}}$, the profinite completion of Z, the integers. Therefore, the perfect pairing (for any G-module M)

Hn(G, M) × H1−n (G, Hom (M, Q/Z)) → Q/Z[29]

is a direct consequence of Pontryagin duality of finite groups. For local and global fields, similar statements exist (local duality and global or Poitou–Tate duality).[30]

## Notes

1. ^ Atiyah 2007, p. 1
2. ^
3. ^ Gowers 2008, p. 187, col. 1
4. ^ Gowers 2008, p. 189, col. 2
5. ^ Atiyah 2007, p. 1
6. ^ The complement is also denoted as ${\displaystyle S\backslash A}$.
7. ^ More precisely, ${\displaystyle C^{*}*}$ is the smallest closed convex cone containing C.
8. ^ Artstein-Avidan & Milman 2007
9. ^ Artstein-Avidan & Milman 2008
10. ^
11. ^ (Veblen & Young 1965, Ch. I, Theorem 11)
12. ^ More generally, one can consider the projective planes over any field, such as the complex numbers or finite fields or even division rings.
13. ^
14. ^ Fulton 1993
15. ^ Mac Lane 1998, Ch. II.1.
16. ^ (Lam 1999, §19C)
17. ^ Jiří Adámek; J. Rosicky (1994). Locally Presentable and Accessible Categories. Cambridge University Press. p. 62. ISBN 978-0-521-42261-1.
18. ^ Weibel (1994)
19. ^ Dwyer and Spaliński (1995)
20. ^
21. ^ Hartshorne 1966, Ch. II.2, esp. Prop. II.2.3
22. ^ Joyal and Street (1991)
23. ^ See (Lang 2002, Theorem VI.1.1) for finite Galois extensions.
24. ^ (Loomis 1953, p. 151, section 37D)
25. ^ Griffiths & Harris 1994, p. 56
26. ^ Milne 1980, Ch. VI.11
27. ^ Iversen 1986, Ch. VII.3, VII.5
28. ^ Hartshorne 1966, Ch. III.7
29. ^ Milne (2006, Example I.1.10)
30. ^ Mazur (1973); Milne (2006)