Dual Lagrangian Products in Symplectic Geometry
- Dual Lagrangian products are defined as symplectic domains of the form K×ₗK° where a convex body and its polar dual are paired, establishing a framework for geometric duality.
- They exhibit sharp symplectic capacities and Lagrangian barriers as seen in key models like the bidisk and cube–cross-polytope product.
- These products extend to optimization, categorical, and functional duality contexts, linking dual variables through product representations and generalized convexity.
to=arxiv_search 夫妻性生活影片 төлөв 天天中彩票appion code 一本道高清无码 {"query":"Dual Lagrangian Products symplectic capacities Lagrangian products duality arXiv","max_results":10,"sort_by":"submittedDate"} Dual Lagrangian products are most explicitly realized in symplectic geometry as Lagrangian products of the form , where is a convex body containing the origin and is its polar dual. More generally, the same literature studies for arbitrary convex bodies , as well as functionally dual variants such as built from Young functions and their Legendre transforms. In broader mathematical and optimization usage, closely related constructions treat “duality” as a bilinear pairing, a coupling function, a doubled relation, or a factored dual variable, all of which generate Lagrangian or dual objects by product-like operations (Vicente, 27 Jul 2025, Vicente, 12 May 2025).
1. Symplectic definition and canonical models
The ambient symplectic space is the standard vector space
identified with the cotangent bundle . For subsets and , the Lagrangian product is
0
The notation emphasizes that the two factors lie in dual Lagrangian directions, namely configuration space and momentum space. A dual Lagrangian product is then a domain
1
with 2 convex and 3 its polar dual (Vicente, 27 Jul 2025).
Two model examples recur throughout the literature. For the Euclidean ball
4
the polar dual of 5 is again 6, so the Lagrangian bidisk 7 is a dual Lagrangian product. For the unit cube 8, the polar dual is the cross-polytope 9, yielding the cube–cross-polytope product 0 (Vicente, 27 Jul 2025).
A related basic object is the disk cotangent bundle 1. This suggests that dual Lagrangian products belong to a larger class of phase-space domains whose geometry is controlled by a convex body in the base and another convex body in the fiber. In the special dual case 2, the interaction between the two factors is fixed by convex polarity rather than chosen independently.
2. Capacities, billiards, and Lagrangian barriers
The modern symplectic theory of dual Lagrangian products is organized around symplectic capacities. For any normalized symplectic capacity 3, the Lagrangian bidisk satisfies
4
and the cube–cross-polytope product satisfies
5
the latter because it is symplectomorphic to 6 (Vicente, 27 Jul 2025).
Puncturing the base factor produces a sharp capacity drop in the model cases. For the annular bidisk,
7
and for the punctured cube–cross-polytope product,
8
Thus the full products have capacity 9, while removing the Lagrangian plane over the origin halves the capacity in the punctured case. This underlies the notion of a Lagrangian barrier: the subsets 0 and 1 obstruct symplectic embeddings that would otherwise fit into the unpunctured domain (Vicente, 27 Jul 2025).
For a convex centrally symmetric body 2, the general holed inequality is
3
For arbitrary convex 4 containing the origin, with
5
normalized capacities satisfy
6
and
7
In dimension two, if 8 is symmetrically convex and 9-pinched with
0
then
1
so 2 is a Lagrangian barrier in 3 (Vicente, 27 Jul 2025).
A second major structural result identifies symplectic capacity with billiard dynamics. For arbitrary convex bodies 4, the Ekeland–Hofer–Zehnder capacity of the convex Lagrangian product 5 satisfies
6
Here 7 is the 8-length induced by the gauge of 9, 0 is the set of closed polygonal curves with at most 1 vertices that cannot be translated into 2, and 3 is the set of closed strong 4-Minkowski billiard trajectories with at most 5 bouncing points. This result removes the smoothness and strict convexity assumptions that had previously been required, and it applies in particular to the dual case 6 (Rudolf, 2022).
3. Functional duality and polar duality in Young-function products
A distinct but closely related theory compares two notions of duality for Lagrangian products generated by an 7-tuple of Young functions 8. The associated Luxemburg unit ball is
9
There are then two dual constructions. The functional-dual product is
0
where 1 is the Legendre dual 2-tuple. The polar-dual product is
3
where 4 is the polar body of 5 (Vicente, 12 May 2025).
For the functional-dual product, all normalized symplectic capacities agree exactly. Writing
6
one has
7
Since 8, this yields
9
This is an exact strong-Viterbo-type statement for the full class of functional-dual products (Vicente, 12 May 2025).
For the polar-dual product, the general result is weaker but still explicit: 0 Because 1, this implies
2
Under the additional condition that there is an index 3 such that 4 and 5, the bounds match and
6
for every normalized symplectic capacity (Vicente, 12 May 2025).
Two examples illustrate the dichotomy. If 7 and 8 with 9, then
0
and after the natural homothety this recovers
1
If 2, then
3
while the polar-dual product still satisfies
4
because 5 (Vicente, 12 May 2025).
4. Duality as coupling: Lagrangians, perturbations, and generalized convexity
Outside symplectic convexity, a more abstract interpretation treats the “dual product” as the pairing or coupling that links primal and dual variables inside a Lagrangian. In Rockafellarian duality, the basic objects are an optimization problem
6
a perturbation or Rockafellian
7
a perturbation function
8
and a coupling 9, which reduces to the bilinear pairing 0 in the classical Fenchel setting (Lara, 2022).
Given a Rockafellian 1, the associated Lagrangian is
2
and the dual function is
3
Conversely, given 4, one reconstructs a Rockafellian by
5
For each fixed 6, the partial functions satisfy
7
and the perturbation and dual functions obey
8
when one starts from 9, while in the reverse direction only
00
is guaranteed (Lara, 2022).
The paper formalizes this symmetry through Lagrangian–Rockafellian couples 01, defined by the minimality of 02 in
03
Its main theorem gives equivalent characterizations by mutual inf–sup formulas, by conjugacy,
04
and by generalized convexity through biconjugacy. In this language, a “dual Lagrangian product” is best understood not as a Cartesian product of bodies, but as the coupling 05 or 06 that generates dual Lagrangians, perturbation functions, and conjugate value functions (Lara, 2022).
5. Computational and optimization reinterpretations
In computational optimization, product-type dual Lagrangian structures appear as explicit parametrizations of dual variables. In semidefinite programming, one such representation replaces the dual positive-semidefinite variable 07 by a factorization
08
which eliminates the explicit cone constraint and turns the dual augmented-Lagrangian subproblem into an unconstrained but nonconvex maximization in 09. The resulting augmented Lagrangian is
10
and the stationarity condition with respect to 11 is
12
This is the core “dual product” representation in that setting: the dual matrix is encoded as the product 13 inside the augmented Lagrangian (Santis et al., 2017).
For multistage stochastic mixed-integer programming, Lagrangian Dual Decision Rules restrict the multiplier policies rather than the primal policies. In the stagewise dual, the multiplier–constraint product is
14
while in the nonanticipative dual it is
15
Restricting 16 and 17 to basis-function families yields finite-dimensional restricted duals, and the restricted nonanticipative dual can be at least as strong as the restricted stagewise dual when its basis is chosen appropriately (Daryalal et al., 2020).
Constraint programming uses essentially the same decomposition principle. Variables are duplicated per constraint, and linking equalities 18 are relaxed with multipliers 19, giving a dual bound
20
with
21
and
22
A self-supervised graph neural network is then trained to predict multipliers 23 directly, while preserving validity of the dual bound because any multiplier vector defines a legitimate Lagrangian relaxation (Bessa et al., 2024).
Sparse linear programming yields yet another explicit dual formula. For
24
the Lagrangian dual is
25
an unconstrained piecewise-linear convex program. Its nonsmooth term is governed by the projection onto the sparse nonnegative set and therefore by a vector Ky-Fan norm structure. The paper proves strong duality and uses a semi-proximal ADMM on a split form of the dual to recover primal optimal solutions (Zhao et al., 2018).
6. Categorical, geometric, and representation-theoretic extensions
A categorical version of dual Lagrangian products appears in the theory of Lagrangian relations. Over a field 26, the prop 27 has objects 28 with the standard symplectic form and morphisms given by Lagrangian subspaces of the corresponding input–output phase space. Its symmetric monoidal product is direct sum, and a linear relation 29 generates a pure Lagrangian relation by doubling: 30 The category is described as a doubled, CPM-style category of linear relations, with orthogonal complement playing the role of conjugation; for prime fields, 31 is exactly a CPM construction on linear relations (Comfort et al., 2021).
Derived symplectic geometry supplies a higher product construction. If 32 are Lagrangians in an 33-shifted symplectic derived stack, then the 34-fold fiber product
35
is itself Lagrangian in the cyclic product
36
Here the target is a product of pairwise intersections, each carrying an 37-shifted symplectic structure, so the multi-intersection becomes a Lagrangian object in a product of dual pairings (Ben-Bassat, 2013).
Lie-theoretic mechanics produces another product interpretation. For a Lie group 38, the iterated tangent group satisfies
39
and for a matched pair 40 one has
41
This yields second-order Euler–Lagrange and matched Euler–Poincaré systems on double cross product groups, where two Lagrangian subsystems mutually act on one another rather than appearing in a one-sided semidirect product (Esen et al., 2019).
Product ambient manifolds also support rigid Lagrangian geometries. In the para-Kähler products of Lorentzian surfaces 42, any Lagrangian surface with parallel mean curvature vector is, under the paper’s curvature assumptions, locally a product 43 of constant-curvature curves, while in 44 any 45-Lagrangian with non-null parallel mean curvature is again locally such a product (Georgiou, 2014). In the Kähler product 46, the key scalar invariant 47 satisfies 48; the case 49 characterizes products of curves, and 50 characterizes the diagonal immersion. Under constant curvature, parallel second fundamental form, or completeness plus a strict bound 51, the only Lagrangian surfaces are products of geodesics or the diagonal (Gao et al., 2021).
Finally, derived-category theory on Lagrangian Grassmannians exhibits a representation-theoretic duality of blocks rather than a symplectic product of domains. On 52, the Kuznetsov–Polishchuk exceptional blocks 53 admit graded left dual exceptional collections indexed by transposed Young diagrams, and the block decomposition of 54 becomes self-dual under dualization and twist. This suggests that “dual Lagrangian product” language can extend even to settings where the relevant product is combinatorial or categorical rather than geometric (Fonarev, 2023).