Dual System¶

Pair two vector spaces by a nondegenerate bilinear form so each separates points of the other and determines weak, polar, and compatible locally convex structures.

Version: v4 · 2026-09-19 · History
Domain-specific #: 1723
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Functional Analysis → Mathematics
Aliases: Dual pair, Paired vector spaces, Separating duality

Core Idea¶

A dual system or dual pair is a triple \((X,Y,\langle\cdot,\cdot\rangle)\) consisting of vector spaces over the same scalar field and a bilinear pairing that separates points on both sides: every nonzero \(x\in X\) is detected by some \(y\in Y\), and every nonzero \(y\in Y\) is detected by some \(x\in X\). Thus (Y) embeds into the algebraic dual of (X), and (X) embeds into the algebraic dual of (Y), without requiring either to be the other's entire algebraic dual.

How would you explain it like I'm…

No Arrow Can Hide

Imagine two teams, and a game where you pair anyone from one team with anyone from the other to get a score. The rule is that nobody can hide: any player who isn't a 'nothing' player gets a non-zero score with someone on the other team, and that works in both directions. Two teams linked by a game like that make a dual system.

Two Spaces That Detect Each Other

A dual system is two collections of math objects, called vector spaces, plus a way of pairing any object from the first with any object from the second to get a number. The pairing has to behave nicely with adding and scaling. The key rule is that the pairing notices everything: every object that isn't zero in the first collection gets a non-zero number with at least one object in the second, and the same the other way around. This lets each side act as a set of 'detectors' for the other side, even if it isn't every possible detector.

Separating Bilinear Pairing

A dual system, or dual pair, is a triple (X, Y, ⟨·,·⟩) made of two vector spaces over the same field and a bilinear pairing between them. The pairing must separate points on both sides: for every nonzero x in X there is some y in Y with ⟨x, y⟩ ≠ 0, and for every nonzero y there is some x with ⟨x, y⟩ ≠ 0. This means each space can be seen as a collection of linear functionals on the other. Importantly, Y doesn't have to be all of X's possible linear functionals; it can be a smaller, chosen set. The pairing is what drives everything else: from it you define things like annihilators, polars and weak topologies.

A dual system or dual pair is a triple (X, Y, <.,.>) of vector spaces over a common scalar field together with a bilinear pairing that separates points on both sides: for every nonzero x in X there is y in Y with <x, y> nonzero, and for every nonzero y in Y there is x in X with <x, y> nonzero. Separation makes the induced maps from Y into the algebraic dual of X, and from X into the algebraic dual of Y, injective, so each space embeds as a family of linear functionals on the other. Crucially, neither space need be the other's full algebraic dual; the pairing selects which functionals are in play. The pairing is the governing structure: it defines annihilators and polars, the weak topologies sigma(X, Y) and sigma(Y, X), and more generally the family of locally convex topologies on X whose continuous dual is exactly Y. This is the setting for much of the duality theory of topological vector spaces.

Scope of Application¶

Dual systems organize locally convex spaces, weak and weak-star convergence, convex polarity, distribution-test-function pairings, and optimization duality. Trèves uses paired spaces to control weak topologies and compatible dual structures in distribution theory. Narici and Beckenstein develop polar topologies and the Mackey–Arens theorem from the same pairing data.

Clarity¶

State the scalar field, whether the pairing is bilinear or sesquilinear, which argument is linear, and whether both separation conditions hold. Distinguish the algebraic dual, continuous dual under a stated topology, and the designated partner (Y). Name the topology when using boundedness, continuity, closure, or compactness.

Manages Complexity¶

The abstraction lets one choose exactly the observables needed to distinguish states. Rather than commit immediately to a norm or maximal dual, it starts with evaluation data and derives the weakest topology making those observations continuous. Stronger compatible topologies can then be compared without changing the continuous dual.

Abstract Reasoning¶

Select spaces (X) and (Y) and define their pairing.
Verify that each side separates the other.
Embed each space in the opposite algebraic dual.
Form annihilators or absolute polars of relevant subsets.
Generate the weak topology from point evaluations by the partner space.
Determine equicontinuous, bounded, and weakly compact sets.
Compare compatible locally convex topologies between the weak and Mackey bounds.
Use bipolar and separation results only under their stated convexity and topology conditions.

Knowledge Transfer¶

The portable pattern is choose a family of reciprocal probes that separates points, then let those probes determine admissible topology and closure. It transfers to state-observable pairings. The proposed immediate parent is Duality.

Relationships to Other Abstractions¶

Current abstraction Dual System Domain-specific

Parents (1) — outgoing typed relations

Dual System is a kind of Duality Prime

Duality is the broader abstraction this entry instantiates.

Hierarchy path (1) — routes to 1 parentless root

Dual System → is a kind of Duality

Neighborhood in Abstraction Space¶

Dual System sits in a sparse region of the domain-specific corpus (84^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25