passagemath-modules 10.5.32__cp310-cp310-macosx_14_0_arm64.whl → 10.6.20__cp310-cp310-macosx_14_0_arm64.whl

sage/modules/free_module.py

@@ -985,7 +985,7 @@ class Module_free_ambient(Module):
         """
         return self.__degree
 
-    def is_sparse(self):
+    def is_sparse(self) -> bool:
         """
         Return ``True`` if the underlying representation of this module uses
         sparse vectors, and ``False`` otherwise.
@@ -999,7 +999,7 @@ class Module_free_ambient(Module):
         """
         return self.__is_sparse
 
-    def is_exact(self):
+    def is_exact(self) -> bool:
         """
         Test whether elements of this module are represented exactly.
 
@@ -1518,7 +1518,7 @@ class Module_free_ambient(Module):
         # in the same ambient space
         return self.is_submodule(other) and other.is_submodule(self)
 
-    def is_submodule(self, other):
+    def is_submodule(self, other) -> bool:
         r"""
         Return ``True`` if ``self`` is a submodule of ``other``.
 
@@ -2092,6 +2092,7 @@ class FreeModule_generic(Module_free_ambient):
 
         Next we create a subspace::
 
+            sage: # needs sage.libs.pari
             sage: M = FreeModule(QQ, 3, sparse=True)
             sage: V = M.span([ [1,2,3] ] ); V
             Sparse vector space of degree 3 and dimension 1 over Rational Field
@@ -2149,6 +2150,7 @@ class FreeModule_generic(Module_free_ambient):
 
         Next we convert a subspace::
 
+            sage: # needs sage.libs.pari
             sage: M = FreeModule(QQ,3)
             sage: V = M.span([ [1,2,3] ] ); V
             Vector space of degree 3 and dimension 1 over Rational Field
@@ -2305,7 +2307,7 @@ class FreeModule_generic(Module_free_ambient):
             return self.echelonized_basis_matrix() == other.echelonized_basis_matrix()
         return self.is_submodule(other) and other.is_submodule(self)
 
-    def is_submodule(self, other):
+    def is_submodule(self, other) -> bool:
         r"""
         Return ``True`` if ``self`` is a submodule of ``other``.
 
@@ -3115,6 +3117,135 @@ class FreeModule_generic(Module_free_ambient):
             codomain = R**n
         return super().hom(im_gens, codomain, **kwds)
 
+    def pseudoHom(self, twist, codomain=None):
+        r"""
+        Return the pseudo-Hom space corresponding to given data.
+
+        INPUT:
+
+        - ``twist`` -- the twisting morphism or the twisting derivation
+
+        - ``codomain`` -- (default: ``None``) the codomain of the pseudo
+          morphisms; if ``None``, the codomain is the same as the domain
+
+        EXAMPLES::
+
+            sage: # needs sage.rings.finite_rings
+            sage: F = GF(25)
+            sage: Frob = F.frobenius_endomorphism()
+            sage: M = F^2
+            sage: M.pseudoHom(Frob)
+            Set of Pseudoendomorphisms (twisted by z2 |--> z2^5) of Vector space of dimension 2 over Finite Field in z2 of size 5^2
+
+        .. SEEALSO::
+
+            :meth:`pseudohom`
+        """
+        from sage.modules.free_module_pseudohomspace import FreeModulePseudoHomspace
+        if codomain is None:
+            codomain = self
+        return FreeModulePseudoHomspace(self, codomain, twist)
+
+    def pseudohom(self, f, twist, codomain=None, side="left"):
+        r"""
+        Return the pseudohomomorphism corresponding to the given data.
+
+        We recall that, given two `R`-modules `M` and `M'` together with
+        a ring homomorphism `\theta: R \to R` and a `\theta`-derivation,
+        `\delta: R \to R` (that is, a map such that
+        `\delta(xy) = \theta(x)\delta(y) + \delta(x)y`), a
+        pseudomorphism `f : M \to M'` is an additive map such that
+
+        .. MATH::
+
+            f(\lambda x) = \theta(\lambda) f(x) + \delta(\lambda) x
+
+        When `\delta` is nonzero, this requires that `M` coerces into `M'`.
+
+        .. NOTE::
+
+            Internally, pseudomorphisms are represented by matrices with
+            coefficient in the base ring `R`. See class
+            :class:`sage.modules.free_module_pseudomorphism.FreeModulePseudoMorphism`
+            for details.
+
+        INPUT:
+
+        - ``f`` -- a matrix (or any other data) defining the
+          pseudomorphism
+
+        - ``twist`` -- the twisting morphism or the twisting derivation
+          (if a derivation is given, the corresponding morphism `\theta`
+          is automatically infered;
+          see also :class:`sage.rings.polynomial.ore_polynomial_ring.OrePolynomialRing`)
+
+        - ``codomain`` -- (default: ``None``) the codomain of the pseudo
+          morphisms; if ``None``, the codomain is the same than the domain
+
+        - ``side`` -- (default: ``left``) side of the vectors acted on by
+          the matrix
+
+        EXAMPLES::
+
+            sage: # needs sage.rings.finite_rings
+            sage: K.<z> = GF(5^5)
+            sage: Frob = K.frobenius_endomorphism()
+            sage: V = K^2; W = K^3
+            sage: f = V.pseudohom([[1, z, z^2], [1, z^2, z^4]], Frob, codomain=W)
+            sage: f
+            Free module pseudomorphism (twisted by z |--> z^5) defined by the matrix
+            [  1   z z^2]
+            [  1 z^2 z^4]
+            Domain: Vector space of dimension 2 over Finite Field in z of size 5^5
+            Codomain: Vector space of dimension 3 over Finite Field in z of size 5^5
+
+        We check that `f` is indeed semi-linear::
+
+            sage: # needs sage.rings.finite_rings
+            sage: v = V([z+1, z+2])
+            sage: f(z*v)
+            (2*z^2 + z + 4, z^4 + 2*z^3 + 3*z^2 + z, 4*z^4 + 2*z^2 + 3*z + 2)
+            sage: z^5 * f(v)
+            (2*z^2 + z + 4, z^4 + 2*z^3 + 3*z^2 + z, 4*z^4 + 2*z^2 + 3*z + 2)
+
+        An example with a derivation::
+
+            sage: # needs sage.rings.finite_rings
+            sage: R.<t> = ZZ[]
+            sage: d = R.derivation()
+            sage: M = R^2
+            sage: Nabla = M.pseudohom([[1, t], [t^2, t^3]], d, side='right')
+            sage: Nabla
+            Free module pseudomorphism (twisted by d/dt) defined as left-multiplication by the matrix
+            [  1   t]
+            [t^2 t^3]
+            Domain: Ambient free module of rank 2 over the integral domain Univariate Polynomial Ring in t over Integer Ring
+            Codomain: Ambient free module of rank 2 over the integral domain Univariate Polynomial Ring in t over Integer Ring
+            sage: v = M([1,1])
+            sage: Nabla(v)
+            (t + 1, t^3 + t^2)
+            sage: Nabla(t*v)
+            (t^2 + t + 1, t^4 + t^3 + 1)
+            sage: Nabla(t*v) == t * Nabla(v) + v
+            True
+
+        If the twisting derivation is not zero, the domain must
+        coerce into the codomain::
+
+            sage: # needs sage.rings.finite_rings
+            sage: N = R^3
+            sage: M.pseudohom([[1, t, t^2], [1, t^2, t^4]], d, codomain=N)
+            Traceback (most recent call last):
+            ...
+            ValueError: the domain does not coerce into the codomain
+
+        .. SEEALSO::
+
+            :meth:`pseudoHom`
+        """
+        H = self.pseudoHom(twist, codomain)
+        return H(f, side)
+
     def inner_product_matrix(self):
         """
         Return the default identity inner product matrix associated to this
@@ -3162,7 +3293,7 @@ class FreeModule_generic(Module_free_ambient):
         """
         return True
 
-    def is_ambient(self):
+    def is_ambient(self) -> bool:
         """
         Return ``False`` since this is not an ambient free module.
 
@@ -3187,7 +3318,7 @@ class FreeModule_generic(Module_free_ambient):
         """
         return False
 
-    def is_dense(self):
+    def is_dense(self) -> bool:
         """
         Return ``True`` if the underlying representation of
         this module uses dense vectors, and ``False`` otherwise.
@@ -3201,7 +3332,7 @@ class FreeModule_generic(Module_free_ambient):
         """
         return not self.is_sparse()
 
-    def is_full(self):
+    def is_full(self) -> bool:
         """
         Return ``True`` if the rank of this module equals its
         degree.
@@ -3216,7 +3347,7 @@ class FreeModule_generic(Module_free_ambient):
         """
         return self.rank() == self.degree()
 
-    def is_finite(self):
+    def is_finite(self) -> bool:
         """
         Return ``True`` if the underlying set of this free module is finite.
 
@@ -4632,7 +4763,7 @@ class FreeModule_generic_field(FreeModule_generic_pid):
         B = [A1.linear_combination_of_rows(v.list()[:n]) for v in K.basis()]
         return self.ambient_vector_space().submodule(B, check=False)
 
-    def is_subspace(self, other):
+    def is_subspace(self, other) -> bool:
         """
         ``True`` if this vector space is a subspace of ``other``.
 
@@ -5679,7 +5810,7 @@ class FreeModule_ambient(FreeModule_generic):
             t = "(%s)" % t
         return "%s^{%s}" % (t, self.rank())
 
-    def is_ambient(self):
+    def is_ambient(self) -> bool:
         """
         Return ``True`` since this module is an ambient
         module.
@@ -6807,9 +6938,10 @@ class FreeModule_submodule_with_basis_pid(FreeModule_generic_pid):
 
         ::
 
-            sage: M = FreeModule(ZZ,8,sparse=True)
-            sage: N = M.submodule_with_basis([ M.gen(i) - M.gen(0) for i in range(1,8) ])
-            sage: N # indirect doctest
+            sage: # needs sage.libs.pari
+            sage: M = FreeModule(ZZ, 8, sparse=True)
+            sage: N = M.submodule_with_basis([M.gen(i) - M.gen(0) for i in range(1,8)])
+            sage: N  # indirect doctest
             Sparse free module of degree 8 and rank 7 over Integer Ring
             User basis matrix:
             [-1  1  0  0  0  0  0  0]
@@ -7037,7 +7169,8 @@ class FreeModule_submodule_with_basis_pid(FreeModule_generic_pid):
 
         We do an example with a sparse vector space::
 
-            sage: V = VectorSpace(QQ,5, sparse=True)
+            sage: # needs sage.libs.pari
+            sage: V = VectorSpace(QQ, 5, sparse=True)
             sage: W = V.subspace_with_basis([[0,1,2,0,0], [0,-1,0,0,-1/2]])
             sage: W.echelonized_basis()
             [(0, 1, 0, 0, 1/2), (0, 0, 1, 0, -1/4)]
@@ -7509,7 +7642,7 @@ class FreeModule_submodule_with_basis_pid(FreeModule_generic_pid):
         """
         return FreeModule(self.base_ring().fraction_field(), self.rank())(self.echelon_coordinates(v, check=check))
 
-    def has_user_basis(self):
+    def has_user_basis(self) -> bool:
         """
         Return ``True`` if the basis of this free module is
         specified by the user, as opposed to being the default echelon
@@ -7659,7 +7792,7 @@ class FreeModule_submodule_pid(FreeModule_submodule_with_basis_pid):
         """
         return self.echelon_coordinate_vector(v, check=check)
 
-    def has_user_basis(self):
+    def has_user_basis(self) -> bool:
         r"""
         Return ``True`` if the basis of this free module is
         specified by the user, as opposed to being the default echelon
@@ -7800,9 +7933,10 @@ class FreeModule_submodule_with_basis_field(FreeModule_generic_field, FreeModule
 
         ::
 
-            sage: VV = VectorSpace(QQ,5,sparse=True)
-            sage: UU = VV.submodule([ VV.gen(i) - VV.gen(0) for i in range(1,5) ])
-            sage: UU # indirect doctest
+            sage: # needs sage.libs.pari
+            sage: VV = VectorSpace(QQ, 5, sparse=True)
+            sage: UU = VV.submodule([VV.gen(i) - VV.gen(0) for i in range(1,5)])
+            sage: UU  # indirect doctest
             Sparse vector space of degree 5 and dimension 4 over Rational Field
             Basis matrix:
             [ 1  0  0  0 -1]
@@ -7890,9 +8024,9 @@ class FreeModule_submodule_with_basis_field(FreeModule_generic_field, FreeModule
         # Return the first rank rows (i.e., the nonzero rows).
         return E.rows()[:E.rank()]
 
-    def is_ambient(self):
+    def is_ambient(self) -> bool:
         """
-        Return False since this is not an ambient module.
+        Return ``False`` since this is not an ambient module.
 
         EXAMPLES::
 
@@ -8001,9 +8135,10 @@ class FreeModule_submodule_field(FreeModule_submodule_with_basis_field):
 
         ::
 
-            sage: VV = VectorSpace(QQ,5,sparse=True)
-            sage: UU = VV.submodule([ VV.gen(i) - VV.gen(0) for i in range(1,5) ])
-            sage: UU # indirect doctest
+            sage: # needs sage.libs.pari
+            sage: VV = VectorSpace(QQ, 5, sparse=True)
+            sage: UU = VV.submodule([VV.gen(i) - VV.gen(0) for i in range(1,5)])
+            sage: UU  # indirect doctest
             Sparse vector space of degree 5 and dimension 4 over Rational Field
             Basis matrix:
             [ 1  0  0  0 -1]
@@ -8136,14 +8271,15 @@ class FreeModule_submodule_field(FreeModule_submodule_with_basis_field):
 
         ::
 
-            sage: V = VectorSpace(QQ,5, sparse=True)
+            sage: # needs sage.libs.pari
+            sage: V = VectorSpace(QQ, 5, sparse=True)
             sage: W = V.subspace([[0,1,2,0,0], [0,-1,0,0,-1/2]])
             sage: W.coordinate_vector([0,0,2,0,-1/2])
             (0, 2)
         """
         return self.echelon_coordinate_vector(v, check=check)
 
-    def has_user_basis(self):
+    def has_user_basis(self) -> bool:
         """
         Return ``True`` if the basis of this free module is
         specified by the user, as opposed to being the default echelon

sage/modules/free_module_element.pyx

@@ -3620,9 +3620,9 @@ cdef class FreeModuleElement(Vector):   # abstract base class
             ...
             ArithmeticError: degrees (1 and 2) must be the same
         """
-        return (self.conjugate()).dot_product(right)
+        return self.conjugate().dot_product(right)
 
-    def is_dense(self):
+    def is_dense(self) -> bool:
         """
         Return ``True`` if this is a dense vector, which is just a
         statement about the data structure, not the number of nonzero
@@ -3640,7 +3640,7 @@ cdef class FreeModuleElement(Vector):   # abstract base class
     cdef bint is_dense_c(self) noexcept:
         return self.parent().is_dense()
 
-    def is_sparse(self):
+    def is_sparse(self) -> bool:
         """
         Return ``True`` if this is a sparse vector, which is just a
         statement about the data structure, not the number of nonzero
@@ -3658,7 +3658,7 @@ cdef class FreeModuleElement(Vector):   # abstract base class
     cdef bint is_sparse_c(self) noexcept:
         return self.parent().is_sparse()
 
-    def is_vector(self):
+    def is_vector(self) -> bool:
         """
         Return ``True``, since this is a vector.
 

sage/modules/free_module_integer.py

@@ -319,7 +319,7 @@ class FreeModule_submodule_with_basis_integer(FreeModule_submodule_with_basis_pi
             True
 
             sage: LLL = L.LLL()
-            sage: LLL == L.reduced_basis or bool(LLL[0].norm() >= M[0].norm())
+            sage: LLL == L.reduced_basis or bool(LLL[0].norm() >= M[0].norm())          # needs sage.symbolic
             True
         """
         return self._reduced_basis
@@ -511,7 +511,7 @@ class FreeModule_submodule_with_basis_integer(FreeModule_submodule_with_basis_pi
         return abs(self.gram_matrix().determinant())
 
     @cached_method
-    def is_unimodular(self):
+    def is_unimodular(self) -> bool:
         """
         Return ``True`` if this lattice is unimodular.
 

sage/modules/free_module_morphism.py

@@ -659,7 +659,7 @@ class BaseIsomorphism1D(Morphism):
                 Multivariate Polynomial Ring in x, y over Rational Field
           To:   Multivariate Polynomial Ring in x, y over Rational Field
     """
-    def _repr_type(self):
+    def _repr_type(self) -> str:
         r"""
         EXAMPLES::
 
@@ -670,7 +670,7 @@ class BaseIsomorphism1D(Morphism):
         """
         return "Isomorphism"
 
-    def is_injective(self):
+    def is_injective(self) -> bool:
         r"""
         EXAMPLES::
 
@@ -681,7 +681,7 @@ class BaseIsomorphism1D(Morphism):
         """
         return True
 
-    def is_surjective(self):
+    def is_surjective(self) -> bool:
         r"""
         EXAMPLES::