Open saliola opened 12 years ago
Simon raised the following question in the thread:
Start with an object O in some category C1, take its dual D in C1, and apply the forgetful functor to map it to a sub-category C2; one would not always get the same result as if one first applies the forgetful functor to O and then dualise the result in C2, right?
And hence VectorSpaces(QQ)(H.dual()) might (perhaps not here, but in other situations) be different from (VectorSpaces(QQ)(H)).dual(). Would that be a problem?
Description changed:
---
+++
@@ -68,20 +68,22 @@
"""
return NotImplemented
+```
+}}}
def duality_pairing(self, x, y):
r"""
The duality pairing between elements of NSym and elements of QSym.
INPUT:
- - ``x`` -- an element of ``self``
- - ``y`` -- an element in the dual basis of ``self``
+- ``x`` -- an element of ``self``
+- ``y`` -- an element in the dual basis of ``self``
OUTPUT:
- - The result of pairing the element ``x`` of ``self`` with the
- element ``y`` of the dual of ``self``.
+- The result of pairing the element ``x`` of ``self`` with the
+ element ``y`` of the dual of ``self``.
EXAMPLES:
@@ -110,8 +112,7 @@
"""
return NotImplemented
-```
-A rudimentary implementation for `duality_matrix` can be found at #8899, but see also the scalar product code for symmetric functions.
+}}}
+A rudimentary implementation for `duality_pairing` can be found at #8899, but see also the scalar product code for symmetric functions.
-I think a bunch of the code for duality for symmetric functions can be refactored. See [sage.combinat.sf.dual](http://www.sagemath.org/doc/reference/sage/combinat/sf/dual.html)
-
+I think a bunch of the code for duality for symmetric functions can be refactored. See [sage.combinat.sf.dual](http://www.sagemath.org/doc/reference/sage/combinat/sf/dual.html).
Description changed:
---
+++
@@ -70,20 +70,20 @@
return NotImplemented
-}}} +``` def duality_pairing(self, x, y): r""" The duality pairing between elements of NSym and elements of QSym.
INPUT:
-- x
-- an element of self
-- y
-- an element in the dual basis of self
x
-- an element of self
y
-- an element in the dual basis of self
OUTPUT:
-- The result of pairing the element x
of self
with the
y
of the dual of self
.x
of self
with theelement y
of the dual of self
.
EXAMPLES:
@@ -112,7 +112,7 @@
"""
return NotImplemented
-}}}
+`` A rudimentary implementation for
duality_pairing` can be found at #8899, but see also the scalar product code for symmetric functions.
I think a bunch of the code for duality for symmetric functions can be refactored. See sage.combinat.sf.dual.
Setting new milestone based on a cursory review of ticket status, priority, and last modification date.
Description changed:
---
+++
@@ -116,3 +116,8 @@
A rudimentary implementation for `duality_pairing` can be found at #8899, but see also the scalar product code for symmetric functions.
I think a bunch of the code for duality for symmetric functions can be refactored. See [sage.combinat.sf.dual](http://www.sagemath.org/doc/reference/sage/combinat/sf/dual.html).
+
+Tickets:
+- #34621 Method `dual_pairing` for modules in `sage.tensor`
+
+
In this discussion, we came up with a rough draft of an interface for the method returning the dual of an object. Here is a summary by way of docstrings for the methods:
A rudimentary implementation for
duality_pairing
can be found at #8899, but see also the scalar product code for symmetric functions.I think a bunch of the code for duality for symmetric functions can be refactored. See sage.combinat.sf.dual.
Tickets:
34621 Method
dual_pairing
for modules insage.tensor
CC: @sagetrac-sage-combinat @tscrim
Component: algebra
Keywords: duality, algebras
Issue created by migration from https://trac.sagemath.org/ticket/13372