passagemath-modules 10.6.31rc3__cp314-cp314-musllinux_1_2_x86_64.whl

sage/matrix/symplectic_basis.py

@@ -0,0 +1,541 @@
+# sage_setup: distribution = sagemath-modules
+r"""
+Calculate symplectic bases for matrices over fields and the integers.
+
+This module finds a symplectic basis for an anti-symmetric,
+alternating matrix M defined over a field or the integers.
+
+Anti-symmetric means that `M = -M^t`, where `M^t` denotes the
+transpose of `M`.  Alternating means that the diagonal of `M` is
+identically zero.
+
+A symplectic basis is a basis of the form `e_1,
+\ldots, e_j, f_1, \ldots, f_j, z_1, \ldots, z_k` such that
+
+* `z_i M v^t` = 0 for all vectors `v`;
+* `e_i M {e_j}^t = 0` for all `i, j`;
+* `f_i M {f_j}^t = 0` for all `i, j`;
+* `e_i M {f_j}^t = 0` for all `i` not equal `j`;
+
+and such that the nonzero terms
+
+* `e_i M {f_i}^t` are "as nice as possible": 1 over fields, or
+  integers satisfying divisibility properties otherwise.
+
+REFERENCES:
+
+Bourbaki gives a nice proof that can be made constructive but is
+not efficient (see Section 5, Number 1, Theorem 1, page 79):
+
+Bourbaki, N.  Elements of Mathematics, Algebra III, Springer
+Verlag 2007.
+
+Kuperberg gives a more efficient and constructive exposition (see
+Theorem 18).
+
+Kuperberg, Greg.  Kasteleyn Cokernels.  Electr. J. Comb. 9(1), 2002.
+
+.. TODO::
+
+    The routine over the integers applies over general principal ideal
+    domains.
+
+.. WARNING::
+
+    This code is not a good candidate for conversion to Cython.  The
+    majority of the execution time is spent adding multiples of
+    columns and rows, which is already fast.  It would be better to
+    devise a better algorithm, perhaps modular or based on a fast
+    ``smith_form`` implementation.
+
+AUTHOR:
+
+- Nick Alexander: initial implementation
+- David Loeffler (2008-12-08): changed conventions for consistency with smith_form
+"""
+
+######################################################################
+#       Copyright (C) 2008 William Stein
+#
+#  Distributed under the terms of the GNU General Public License (GPL)
+#
+#  The full text of the GPL is available at:
+#                  https://www.gnu.org/licenses/
+######################################################################
+
+from sage.rings.integer_ring import ZZ
+from sage.rings.infinity import Infinity
+
+
+def _inplace_move_to_positive_pivot(G, row, col, B, pivot):
+    r"""
+    Modify G so that v = G[row, col] appears at G[pivot, pivot+1].
+    Modify B so that B * G * B.transpose() has the value v appearing
+    at G[pivot, pivot+1].
+
+    WARNING: not intended for external use!
+
+    EXAMPLES::
+
+        sage: from sage.matrix.symplectic_basis import _inplace_move_to_positive_pivot
+        sage: E = matrix(ZZ, 4, 4, [0, 16, 0, 2, -16, 0, 0, -4, 0, 0, 0, 0, -2, 4, 0, 0]); E
+        [  0  16   0   2]
+        [-16   0   0  -4]
+        [  0   0   0   0]
+        [ -2   4   0   0]
+        sage: B = copy(E.parent().one()); G = copy(E)
+        sage: _inplace_move_to_positive_pivot(G, 0, 3, B, 0)
+        sage: E[0, 3] == G[0, 1]
+        True
+        sage: G
+        [  0   2   0  16]
+        [ -2   0   0   4]
+        [  0   0   0   0]
+        [-16  -4   0   0]
+        sage: B * E * B.transpose()
+        [  0   2   0  16]
+        [ -2   0   0   4]
+        [  0   0   0   0]
+        [-16  -4   0   0]
+    """
+    v = G[row, col]
+
+    if (row, col) == (pivot, pivot+1):
+        pass
+    elif (row, col) == (pivot+1, pivot):
+        B.swap_rows(pivot, pivot+1)
+        G.swap_rows(pivot, pivot+1)
+        G.swap_columns(pivot, pivot+1)
+    elif row != pivot and row != pivot+1 and col != pivot and col != pivot+1:
+        B.swap_rows(pivot, row)
+        B.swap_rows(pivot+1, col)
+
+        G.swap_rows(pivot, row)
+        G.swap_rows(pivot+1, col)
+        G.swap_columns(pivot, row)
+        G.swap_columns(pivot+1, col)
+    elif row == pivot:
+        B.swap_rows(pivot+1, col)
+        G.swap_rows(pivot+1, col)
+        G.swap_columns(pivot+1, col)
+    elif row == pivot+1:
+        B.swap_rows(pivot, col)
+        G.swap_rows(pivot, col)
+        G.swap_columns(pivot, col)
+    elif col == pivot:
+        B.swap_rows(pivot+1, row)
+        G.swap_rows(pivot+1, row)
+        G.swap_columns(pivot+1, row)
+    elif col == pivot+1:
+        B.swap_rows(pivot, row)
+        G.swap_rows(pivot, row)
+        G.swap_columns(pivot, row)
+
+    # all that swapping can switch the sign of a row
+    if G[pivot, pivot+1] != v:
+        B.swap_rows(pivot, pivot+1)
+        G.swap_rows(pivot, pivot+1)
+        G.swap_columns(pivot, pivot+1)
+
+
+def symplectic_basis_over_field(M):
+    r"""
+    Find a symplectic basis for an anti-symmetric, alternating matrix
+    M defined over a field.
+
+    Returns a pair (F, C) such that the rows of C form a symplectic
+    basis for M and ``F = C * M * C.transpose()``.
+
+    Anti-symmetric means that `M = -M^t`.  Alternating means that the
+    diagonal of `M` is identically zero.
+
+    A symplectic basis is a basis of the form `e_1,
+    \ldots, e_j, f_1, \ldots f_j, z_1, \ldots, z_k` such that
+
+    * `z_i M v^t` = 0 for all vectors `v`;
+    * `e_i M {e_j}^t = 0` for all `i, j`;
+    * `f_i M {f_j}^t = 0` for all `i, j`;
+    * `e_i M {f_i}^t = 1` for all `i`;
+    * `e_i M {f_j}^t = 0` for all `i` not equal `j`.
+
+    See the examples for a pictorial description of such a basis.
+
+    EXAMPLES::
+
+        sage: from sage.matrix.symplectic_basis import symplectic_basis_over_field
+
+    A full rank exact example::
+
+        sage: E = matrix(QQ, 8, 8, [0, -1/2, -2, 1/2, 2, 0, -2, 1, 1/2, 0, -1, -3, 0, 2, 5/2, -3, 2, 1, 0, 3/2, -1, 0, -1, -2, -1/2, 3, -3/2, 0, 1, 3/2, -1/2, -1/2, -2, 0, 1, -1, 0, 0, 1, -1, 0, -2, 0, -3/2, 0, 0, 1/2, -2, 2, -5/2, 1, 1/2, -1, -1/2, 0, -1, -1, 3, 2, 1/2, 1, 2, 1, 0]); E
+        [   0 -1/2   -2  1/2    2    0   -2    1]
+        [ 1/2    0   -1   -3    0    2  5/2   -3]
+        [   2    1    0  3/2   -1    0   -1   -2]
+        [-1/2    3 -3/2    0    1  3/2 -1/2 -1/2]
+        [  -2    0    1   -1    0    0    1   -1]
+        [   0   -2    0 -3/2    0    0  1/2   -2]
+        [   2 -5/2    1  1/2   -1 -1/2    0   -1]
+        [  -1    3    2  1/2    1    2    1    0]
+        sage: F, C = symplectic_basis_over_field(E); F
+        [ 0  0  0  0  1  0  0  0]
+        [ 0  0  0  0  0  1  0  0]
+        [ 0  0  0  0  0  0  1  0]
+        [ 0  0  0  0  0  0  0  1]
+        [-1  0  0  0  0  0  0  0]
+        [ 0 -1  0  0  0  0  0  0]
+        [ 0  0 -1  0  0  0  0  0]
+        [ 0  0  0 -1  0  0  0  0]
+        sage: F == C * E * C.transpose()
+        True
+
+    An example over a finite field::
+
+        sage: E = matrix(GF(7), 8, 8,
+        ....:            [0, -1/2, -2, 1/2, 2, 0, -2, 1, 1/2, 0, -1, -3, 0, 2, 5/2,
+        ....:             -3, 2, 1, 0, 3/2, -1, 0, -1, -2, -1/2, 3, -3/2, 0, 1, 3/2,
+        ....:             -1/2, -1/2, -2, 0, 1, -1, 0, 0, 1, -1, 0, -2, 0, -3/2, 0,
+        ....:             0, 1/2, -2, 2, -5/2, 1, 1/2, -1, -1/2, 0, -1, -1, 3, 2,
+        ....:             1/2, 1, 2, 1, 0]); E
+        [0 3 5 4 2 0 5 1]
+        [4 0 6 4 0 2 6 4]
+        [2 1 0 5 6 0 6 5]
+        [3 3 2 0 1 5 3 3]
+        [5 0 1 6 0 0 1 6]
+        [0 5 0 2 0 0 4 5]
+        [2 1 1 4 6 3 0 6]
+        [6 3 2 4 1 2 1 0]
+        sage: F, C = symplectic_basis_over_field(E); F
+        [0 0 0 0 1 0 0 0]
+        [0 0 0 0 0 1 0 0]
+        [0 0 0 0 0 0 1 0]
+        [0 0 0 0 0 0 0 1]
+        [6 0 0 0 0 0 0 0]
+        [0 6 0 0 0 0 0 0]
+        [0 0 6 0 0 0 0 0]
+        [0 0 0 6 0 0 0 0]
+        sage: F == C * E * C.transpose()
+        True
+
+    The tricky case of characteristic 2::
+
+        sage: E = matrix(GF(2), 8, 8,
+        ....:            [0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0,
+        ....:            0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0,
+        ....:            1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1,
+        ....:            0, 1, 0, 0]); E
+        [0 0 1 1 0 1 0 1]
+        [0 0 0 0 0 0 0 0]
+        [1 0 0 0 0 0 1 1]
+        [1 0 0 0 0 0 0 1]
+        [0 0 0 0 0 1 1 0]
+        [1 0 0 0 1 0 1 1]
+        [0 0 1 0 1 1 0 0]
+        [1 0 1 1 0 1 0 0]
+        sage: F, C = symplectic_basis_over_field(E); F
+        [0 0 0 1 0 0 0 0]
+        [0 0 0 0 1 0 0 0]
+        [0 0 0 0 0 1 0 0]
+        [1 0 0 0 0 0 0 0]
+        [0 1 0 0 0 0 0 0]
+        [0 0 1 0 0 0 0 0]
+        [0 0 0 0 0 0 0 0]
+        [0 0 0 0 0 0 0 0]
+        sage: F == C * E * C.transpose()
+        True
+
+    An inexact example::
+
+        sage: E = matrix(RR, 8, 8, [0.000000000000000, 0.420674846479344, -0.839702420666807, 0.658715385244413, 1.69467394825853, -1.14718543053828, 1.03076138152950, -0.227739521708484, -0.420674846479344, 0.000000000000000, 0.514381455379082, 0.282194064028260, -1.38977093018412, 0.278305070958958, -0.0781320488361574, -0.496003664217833, 0.839702420666807, -0.514381455379082, 0.000000000000000, -0.00618222322875384, -0.318386939149028, -0.0840205427053993, 1.28202592892333, -0.512563654267693, -0.658715385244413, -0.282194064028260, 0.00618222322875384, 0.000000000000000, 0.852525732369211, -0.356957405431611, -0.699960114607661, 0.0260496330859998, -1.69467394825853, 1.38977093018412, 0.318386939149028, -0.852525732369211, 0.000000000000000, -0.836072521423577, 0.450137632758469, -0.696145287292091, 1.14718543053828, -0.278305070958958, 0.0840205427053993, 0.356957405431611, 0.836072521423577, 0.000000000000000, 0.214878541347751, -1.20221688928379, -1.03076138152950, 0.0781320488361574, -1.28202592892333, 0.699960114607661, -0.450137632758469, -0.214878541347751, 0.000000000000000, 0.785074452163036, 0.227739521708484, 0.496003664217833, 0.512563654267693, -0.0260496330859998, 0.696145287292091, 1.20221688928379, -0.785074452163036, 0.000000000000000]); E
+        [   0.000000000000000    0.420674846479344   -0.839702420666807    0.658715385244413     1.69467394825853    -1.14718543053828     1.03076138152950   -0.227739521708484]
+        [  -0.420674846479344    0.000000000000000    0.514381455379082    0.282194064028260    -1.38977093018412    0.278305070958958  -0.0781320488361574   -0.496003664217833]
+        [   0.839702420666807   -0.514381455379082    0.000000000000000 -0.00618222322875384   -0.318386939149028  -0.0840205427053993     1.28202592892333   -0.512563654267693]
+        [  -0.658715385244413   -0.282194064028260  0.00618222322875384    0.000000000000000    0.852525732369211   -0.356957405431611   -0.699960114607661   0.0260496330859998]
+        [   -1.69467394825853     1.38977093018412    0.318386939149028   -0.852525732369211    0.000000000000000   -0.836072521423577    0.450137632758469   -0.696145287292091]
+        [    1.14718543053828   -0.278305070958958   0.0840205427053993    0.356957405431611    0.836072521423577    0.000000000000000    0.214878541347751    -1.20221688928379]
+        [   -1.03076138152950   0.0781320488361574    -1.28202592892333    0.699960114607661   -0.450137632758469   -0.214878541347751    0.000000000000000    0.785074452163036]
+        [   0.227739521708484    0.496003664217833    0.512563654267693  -0.0260496330859998    0.696145287292091     1.20221688928379   -0.785074452163036    0.000000000000000]
+        sage: F, C = symplectic_basis_over_field(E); F  # random
+        [    0.000000000000000     0.000000000000000  2.22044604925031e-16 -2.22044604925031e-16      1.00000000000000     0.000000000000000     0.000000000000000 -3.33066907387547e-16]
+        [    0.000000000000000  8.14814392305203e-17 -1.66533453693773e-16 -1.11022302462516e-16     0.000000000000000      1.00000000000000 -1.11022302462516e-16     0.000000000000000]
+        [-5.27829526256056e-16 -2.40004077757759e-16  1.28373418199470e-16 -1.11022302462516e-16     0.000000000000000 -3.15483812822081e-16      1.00000000000000 -4.44089209850063e-16]
+        [ 1.31957381564014e-16  1.41622049084608e-16 -6.68515202578511e-17 -3.95597468756028e-17 -4.85722573273506e-17 -5.32388011580111e-17 -1.31328455615552e-16      1.00000000000000]
+        [    -1.00000000000000     0.000000000000000     0.000000000000000  4.85722573273506e-17     0.000000000000000 -5.55111512312578e-17 -1.11022302462516e-16  2.22044604925031e-16]
+        [    0.000000000000000     -1.00000000000000     0.000000000000000 -2.77555756156289e-17  5.55111512312578e-17 -8.69223574327834e-17     0.000000000000000 -4.44089209850063e-16]
+        [    0.000000000000000 -1.05042437087238e-17     -1.00000000000000  3.33066907387547e-16  1.11022302462516e-16 -1.18333563634309e-16  4.40064433050777e-17  2.22044604925031e-16]
+        [ 5.27829526256056e-16  1.99901485752317e-16  1.65710718121313e-17     -1.00000000000000 -2.22044604925031e-16  5.52150940090699e-16 -3.93560383111738e-16  1.01155762925061e-16]
+        sage: F == C * E * C.transpose()
+        True
+        sage: abs(F[0, 4] - 1) < 1e-10
+        True
+        sage: abs(F[4, 0] + 1) < 1e-10
+        True
+
+        sage: F.parent()
+        Full MatrixSpace of 8 by 8 dense matrices over Real Field with 53 bits of precision
+        sage: C.parent()
+        Full MatrixSpace of 8 by 8 dense matrices over Real Field with 53 bits of precision
+    """
+    if not M.base_ring().is_field():
+        raise ValueError("Can only find symplectic bases for matrices over fields")
+    if not M.is_square():
+        raise ValueError("Can only find symplectic bases for square matrices")
+    if not M.transpose() + M == 0:
+        raise ValueError("Can only find symplectic bases for anti-symmetric matrices")
+
+    E = M.__copy__()
+    n = E.nrows()
+    for i in range(n):
+        if not E[i, i].is_zero():
+            raise ValueError("Can only find symplectic bases for alternating matrices")
+    B = E.parent().one().__copy__()
+
+    zeroes = []
+    es = []
+    fs = []
+    pivot = 0
+    while pivot < n:
+        # find nonzero element in row
+        found_i = None
+        for i in range(pivot, n):
+            if E[pivot, i] != 0:
+                found_i = i
+                break
+        if found_i is None:
+            zeroes.append(pivot)
+            pivot += 1
+            continue
+
+        # move non-trivial entry to pivot position
+        _inplace_move_to_positive_pivot(E, pivot, found_i, B, pivot)
+
+        # scale row and col
+        v = ZZ(1)/E[pivot, pivot+1]
+        E.rescale_row(pivot, v)
+        E.rescale_col(pivot, v)
+        B.rescale_row(pivot, v)
+
+        # use nonzero element to clean row pivot
+        for i in range(pivot+2, n):
+            v = - E[i, pivot] / E[pivot+1, pivot]
+            if v != 0:
+                E.add_multiple_of_row(i, pivot+1, v)
+                E.add_multiple_of_column(i, pivot+1, v)
+                B.add_multiple_of_row(i, pivot+1, v)
+
+        # use nonzero element to clean row pivot+1
+        for i in range(pivot+2, n):
+            v = - E[i, pivot+1] / E[pivot, pivot+1]
+            if v != 0:
+                E.add_multiple_of_row(i, pivot, v)
+                E.add_multiple_of_column(i, pivot, v)
+                B.add_multiple_of_row(i, pivot, v)
+
+        # record for basis reconstruction
+        es.append(pivot)
+        fs.append(pivot+1)
+        pivot += 2
+
+    C = B.matrix_from_rows(es + fs + zeroes)
+    F = C * M * C.transpose()
+    return F, C
+
+
+def _smallest_element_position_or_None(E, pivot):
+    r"""
+    Return a tuple (row, col) such that E[row, col] is the smallest
+    positive element of E, or None if E has no positive elements, and
+    ``row >= pivot`` and ``col >= pivot``.
+
+    WARNING: not intended for external use!
+
+    EXAMPLES::
+
+        sage: from sage.matrix.symplectic_basis import _smallest_element_position_or_None
+
+        sage: E = matrix(ZZ, 4, 4, [0, 16, 0, 2, -16, 0, 0, -4, 0, 0, 0, 0, -2, 4, 0, 0]); E
+        [  0  16   0   2]
+        [-16   0   0  -4]
+        [  0   0   0   0]
+        [ -2   4   0   0]
+        sage: _smallest_element_position_or_None(E, 0)
+        (0, 3)
+        sage: _smallest_element_position_or_None(E, 1)
+        (3, 1)
+        sage: _smallest_element_position_or_None(E, 2) is None
+        True
+    """
+    found = None
+    min = Infinity
+    n = E.nrows()
+    for i in range(pivot, n):
+        for j in range(pivot, n):
+            v = E[j, i]
+            if 0 < v < min:
+                min = v
+                found = (j, i)
+    return found
+
+
+def symplectic_basis_over_ZZ(M):
+    r"""
+    Find a symplectic basis for an anti-symmetric, alternating matrix
+    M defined over the integers.
+
+    Returns a pair (F, C) such that the rows of C form a symplectic
+    basis for M and F = C * M * C.transpose().
+
+    Anti-symmetric means that `M = -M^t`.  Alternating means that the
+    diagonal of `M` is identically zero.
+
+    A symplectic basis is a basis of the form `e_1,
+    \ldots, e_j, f_1, \ldots, f_j, z_1, \ldots, z_k` such that
+
+    * `z_i M v^t` = 0 for all vectors `v`;
+    * `e_i M {e_j}^t = 0` for all `i, j`;
+    * `f_i M {f_j}^t = 0` for all `i, j`;
+    * `e_i M {f_i}^t = d_i` for all `i`, where d_i are positive integers such that `d_{i} | d_{i+1}` for all `i`;
+    * `e_i M {f_j}^t = 0` for all `i` not equal `j`.
+
+    The ordering for the factors `d_{i} | d_{i+1}` and for the
+    placement of zeroes was chosen to agree with the output of
+    ``smith_form``.
+
+    See the examples for a pictorial description of such a basis.
+
+    EXAMPLES::
+
+        sage: from sage.matrix.symplectic_basis import symplectic_basis_over_ZZ
+
+    An example which does not have full rank::
+
+        sage: E = matrix(ZZ, 4, 4, [0, 16, 0, 2, -16, 0, 0, -4, 0, 0, 0, 0, -2, 4, 0, 0]); E
+        [  0  16   0   2]
+        [-16   0   0  -4]
+        [  0   0   0   0]
+        [ -2   4   0   0]
+        sage: F, C = symplectic_basis_over_ZZ(E)
+        sage: F
+        [ 0  2  0  0]
+        [-2  0  0  0]
+        [ 0  0  0  0]
+        [ 0  0  0  0]
+        sage: C * E * C.transpose() == F
+        True
+
+    A larger example::
+
+        sage: E = matrix(ZZ, 8, 8, [0, 25, 0, 0, -37, -3, 2, -5, -25, 0, 1, -5, -54, -3, 3, 3, 0, -1, 0, 7, 0, -4, -20, 0, 0, 5, -7, 0, 0, 14, 0, -3, 37, 54, 0, 0, 0, 2, 3, -12, 3, 3, 4, -14, -2, 0, -3, 2, -2, -3, 20, 0, -3, 3, 0, -2, 5, -3, 0, 3, 12, -2, 2, 0]); E
+        [  0  25   0   0 -37  -3   2  -5]
+        [-25   0   1  -5 -54  -3   3   3]
+        [  0  -1   0   7   0  -4 -20   0]
+        [  0   5  -7   0   0  14   0  -3]
+        [ 37  54   0   0   0   2   3 -12]
+        [  3   3   4 -14  -2   0  -3   2]
+        [ -2  -3  20   0  -3   3   0  -2]
+        [  5  -3   0   3  12  -2   2   0]
+        sage: F, C = symplectic_basis_over_ZZ(E)
+        sage: F
+        [     0      0      0      0      1      0      0      0]
+        [     0      0      0      0      0      1      0      0]
+        [     0      0      0      0      0      0      1      0]
+        [     0      0      0      0      0      0      0  20191]
+        [    -1      0      0      0      0      0      0      0]
+        [     0     -1      0      0      0      0      0      0]
+        [     0      0     -1      0      0      0      0      0]
+        [     0      0      0 -20191      0      0      0      0]
+        sage: F == C * E * C.transpose()
+        True
+        sage: E.smith_form()[0]                                                         # needs sage.libs.pari
+        [    1     0     0     0     0     0     0     0]
+        [    0     1     0     0     0     0     0     0]
+        [    0     0     1     0     0     0     0     0]
+        [    0     0     0     1     0     0     0     0]
+        [    0     0     0     0     1     0     0     0]
+        [    0     0     0     0     0     1     0     0]
+        [    0     0     0     0     0     0 20191     0]
+        [    0     0     0     0     0     0     0 20191]
+
+    An odd dimensional example::
+
+        sage: E = matrix(ZZ, 5, 5, [0, 14, 0, -8, -2, -14, 0, -3, -11, 4, 0, 3, 0, 0, 0, 8, 11, 0, 0, 8, 2, -4, 0, -8, 0]); E
+        [  0  14   0  -8  -2]
+        [-14   0  -3 -11   4]
+        [  0   3   0   0   0]
+        [  8  11   0   0   8]
+        [  2  -4   0  -8   0]
+        sage: F, C = symplectic_basis_over_ZZ(E)
+        sage: F
+        [ 0  0  1  0  0]
+        [ 0  0  0  2  0]
+        [-1  0  0  0  0]
+        [ 0 -2  0  0  0]
+        [ 0  0  0  0  0]
+        sage: F == C * E * C.transpose()
+        True
+        sage: E.smith_form()[0]                                                         # needs sage.libs.pari
+        [1 0 0 0 0]
+        [0 1 0 0 0]
+        [0 0 2 0 0]
+        [0 0 0 2 0]
+        [0 0 0 0 0]
+
+        sage: F.parent()
+        Full MatrixSpace of 5 by 5 dense matrices over Integer Ring
+        sage: C.parent()
+        Full MatrixSpace of 5 by 5 dense matrices over Integer Ring
+    """
+    if not M.is_square():
+        raise ValueError("Can only find symplectic bases for square matrices")
+    if not M.transpose() + M == 0:
+        raise ValueError("Can only find symplectic bases for anti-symmetric matrices")
+
+    E = M.__copy__().change_ring(ZZ)
+    n = E.nrows()
+    for i in range(n):
+        if not E[i, i].is_zero():
+            raise ValueError("Can only find symplectic bases for alternating matrices")
+    B = E.parent().one().__copy__()
+
+    zeroes = []
+    ps = []
+    pivot = 0
+    while pivot < n:
+        # find smallest element in matrix
+        found = _smallest_element_position_or_None(E, pivot)
+        if found is None:
+            zeroes.append(pivot)
+            pivot += 1
+            continue
+        _inplace_move_to_positive_pivot(E, found[0], found[1], B, pivot)
+
+        # use nonzero element to clean row pivot
+        all_zero = True
+        u = E[pivot+1, pivot]
+        for i in range(pivot+2, n):
+            v, r = (-E[i, pivot]).quo_rem(u)
+            if v != 0:
+                all_zero = False
+                E.add_multiple_of_row(i, pivot+1, v)
+                E.add_multiple_of_column(i, pivot+1, v)
+                B.add_multiple_of_row(i, pivot+1, v)
+
+        # use nonzero element to clean row pivot+1
+        u = E[pivot, pivot+1]
+        for i in range(pivot+2, n):
+            v, r = (-E[i, pivot+1]).quo_rem(u)
+            if v != 0:
+                all_zero = False
+                E.add_multiple_of_row(i, pivot, v)
+                E.add_multiple_of_column(i, pivot, v)
+                B.add_multiple_of_row(i, pivot, v)
+
+        if all_zero:
+            # record for basis reconstruction
+            ps.append((E[pivot, pivot+1], pivot))
+            pivot += 2
+
+    ps.sort()
+    es = [p[1] for p in ps]
+    fs = [p[1] + 1 for p in ps]
+    C = B.matrix_from_rows(es + fs + zeroes)
+    F = C * M * C.transpose()
+    return F, C

sage/matrix/template.pxd

@@ -0,0 +1,6 @@
+# sage_setup: distribution = sagemath-modules
+from sage.matrix.matrix_dense cimport Matrix_dense
+
+
+cdef class Matrix_generic_dense(Matrix_dense):
+    pass

sage/matrix/tests.py

@@ -0,0 +1,71 @@
+# sage_setup: distribution = sagemath-modules
+"""
+TESTS:
+
+We test various degenerate cases of kernel computation::
+
+    sage: matrix(ZZ,1,0).kernel()
+    Free module of degree 1 and rank 1 over Integer Ring
+    Echelon basis matrix:
+    [1]
+    sage: matrix(QQ,1,0).kernel()
+    Vector space of degree 1 and dimension 1 over Rational Field
+    Basis matrix:
+    [1]
+    sage: matrix(GF(7), 1, 0).kernel()
+    Vector space of degree 1 and dimension 1 over Finite Field of size 7
+    Basis matrix:
+    [1]
+    sage: matrix(Frac(QQ['x']),1,0).kernel()
+    Vector space of degree 1 and dimension 1 over Fraction Field of Univariate Polynomial Ring in x over Rational Field
+    Basis matrix:
+    [1]
+
+    sage: matrix(ZZ,0,1).kernel()
+    Free module of degree 0 and rank 0 over Integer Ring
+    Echelon basis matrix:
+    []
+    sage: matrix(QQ,0,1).kernel()
+    Vector space of degree 0 and dimension 0 over Rational Field
+    Basis matrix:
+    []
+    sage: matrix(GF(7), 0, 1).kernel()
+    Vector space of degree 0 and dimension 0 over Finite Field of size 7
+    Basis matrix:
+    []
+    sage: matrix(Frac(QQ['x']),0,1).kernel()
+    Vector space of degree 0 and dimension 0 over Fraction Field of Univariate Polynomial Ring in x over Rational Field
+    Basis matrix:
+    []
+
+Division by a scalar::
+
+    sage: matrix(QQ, 2, 2, [1, 1, 1, 1]) / 2
+    [1/2 1/2]
+    [1/2 1/2]
+    sage: matrix(QQ, 2, 2, [1, 1, 1, 1]) / (1/2)
+    [2 2]
+    [2 2]
+    sage: matrix(QQ['x,y'], 2, 2, [1, 1, 1, 1]) / x                                     # needs sage.symbolic
+    [1/x 1/x]
+    [1/x 1/x]
+    sage: A = matrix(CC, 2, 2, [1, 1, 1, 1]) / I; A                                     # needs sage.rings.real_mpfr sage.symbolic
+    [-1.00000000000000*I -1.00000000000000*I]
+    [-1.00000000000000*I -1.00000000000000*I]
+    sage: A.parent()                                                                    # needs sage.rings.real_mpfr sage.symbolic
+    Full MatrixSpace of 2 by 2 dense matrices over Complex Field with 53 bits of precision
+
+We test an example determinant computation where LinBox gave an incorrect
+result::
+
+    sage: L = [-32672924, 402859388, -140623668, 430658721, 106946787, 621276047,-192782447, 431682021, 102255307, 94626176, -34905583, -95358049, 19932420, 123725915, 52076617, -202693998, -104950285, 75183320, 90638691, -10508577, -159993345, 544819075, -205041193, 530536794, 34425198, 812190067, -260981874, 580644585, 123763815, 100094135, -69769038, -119580389, 66415448, 141833716, 62768834, -269408072, -133259211, 100392022, 122810015, -14169559, -116742143, 255636730, -101946387, 229909806, -23983454, 370713224, -122485286, 271167855, 52843557, 36798922, -40542776, -53268126, 45195782, 57579762, 26577120, -124502451, -59510085, 46572885, 57450083, -6605856, 15000427, -30582942, 12516546, -26821359, 4119829, -44014478, 14639368, -32285711, -6171530, -4068360, 4862805, 6668897, -5647699, -6841120, -3067309, 14771590, 7115903, -5537058, -6739292, 775422, 7350404, 230921981, -76923414, 258735233, 86438125, 362368415, -110372559, 248213386, 62007340, 60606320, -15120637, -56148382, 2793135, 76364724, 31673380, -117264550, -61940375, 43368039, 52065723, -6050134, -151307549, 78679036, -46266959, 18647207, -117585287, 85433954, -37642136, 80027656, 2018840, -16574471, -34635562, -6981346, 53375886, -7793292, 519003, -33205642, -9545608, 12868856, 17687995, -1966305, -363614357, 1120703653, -426407076, 1075510629, 37584638, 1662076505, -536823334, 1193214389, 250295666, 197458670, -149948886, -243590352, 148290926, 284338202, 126789390, -552585008, -271574842, 206055077, 252487220, -29112407, -24118132, 125489794, -45531102, 127679943, 19878772, 189727909, -59873328, 133891226, 30235317, 26062022, -13427908, -28437884, 11088522, 35371542, 15314003, -62344332, -31541764, 23159538, 28169710, -3257928, 23875931, -55361113, 21777071, -50092756, 4072588, -80196200, 26290253, -58432798, -11789547, -8211985, 8277760, 11589279, -9463444, -12750488, -5909614, 26780705, 12871707, -9986858, -12330558, 1418788, -123640072, 350287850, -134402037, 331686546, 2311861, 516848375, -167690026, 372647615, 77107961, 59330726, -48837778, -74960963, 49935779, 86475403, 39012673, -172208210, -84008378, 64235307, 78969119, -9098718, 29206401, -58665698, 23367942, -51628286, 7704232, -84008009, 27841118, -62026237, -12049237, -7882950, 9778971, 11364995, -11528692, -12326307, -6027486, 28258762, 13229006, -10541794, -13232024, 1518814, -15226123, -162474710, 52643231, -186629243, -70538436, -257338018, 77581589, -174915120, -44964751, -45100633, 8768165, 39990351, 1319955, -55787679, -23007336, 82911599, 44234087, -30609520, -36691281, 4268583, -3067101, -187862053, 62406108, -208934856, -67593203, -293436726, 89390112, -201449078, -50438313, -48568925, 12749582, 44690794, -3756544, -61132699, -25770007, 94967436, 49821864, -35071658, -42392728, 4922722, -83860746, 387091065, -141493308, 390611827, 53261700, 584183024, -185296915, 413534644, 91854856, 78421794, -44059309, -86512345, 37363320, 106897933, 46669076, -192648548, -96693655, 71636948, 87410231, -10100657, -56763493, 123532651, -49071162, 111379401, -11435705, 179568616, -59393552, 131295311, 25428711, 17842335, -20018876, -25373934, 22014146, 27645710, 12901369, -60462971, -28718167, 22624087, 28023128, -3220309, 74635684, 42414796, -4598855, 80612787, 85891705, 84744646, -20275295, 47713903, 20441907, 28852448, 11300266, -16245887, -24534126, 30219206, 10703344, -24779029, -16921909, 8890606, 9568309, -1154549, -129928022, 450121954, -169305350, 439469539, 30630839, 672148465, -215901643, 479926644, 102311525, 83254236, -57276284, -99501795, 53823660, 117995313, 51970498, -222955007, -110479289, 83108429, 101494954, -11712185, -144442660, 396456359, -153843052, 373857888, -1782212, 585684397, -190815470, 422383108, 85815948, 66107666, -56349192, -86531733, 56862804, 97958280, 43498721, -195572942, -95613139, 73115455, 89344289, -10295212, 10964325, -5070815, 2648146, -839025, 8356359, -4976355, 2255047, -5129380, -209043, 1262716, 2672540, -558453, -4261247, 1210201, -101067, 2031870, 246414, -752782, -1334683, 146103, 117556641, -635133625, 229805379, -649558626, -106084208, -963569121, 304047081, -678780364, -153015989, -133365649, 68083651, 144472798, -54146381, -180316114, -77858131, 316948599, 160367139, -117807494, -143206514, 16562032]
+    sage: M = Matrix(Integers(),20,20,L)
+    sage: M.det()
+    3951360
+
+Test that a certain bug in GP's mathnf was fixed::
+
+    sage: a = gp('Mat([-15,18,-23,-20,-32,11,-19,2,-1,15,22,29,-29,3,-31,25,11,-6,32,7; -31,0,30,-27,-15,13,-21,6,-27,6,3,-4,-4,-28,-30,-16,29,-4,29,-20; -15,-19,-30,9,-18,-31,23,-15,15,-9,20,10,-29,9,18,-6,-1,-20,19,-29; 2,-32,4,-13,17,21,12,-32,12,0,27,-10,-31,-33,-8,-31,-23,25,-18,6; -10,33,4,27,1,25,1,6,31,-7,3,30,23,-4,18,16,-12,21,0,4; -19,20,31,-34,-24,20,-13,-2,18,12,-18,33,22,0,0,10,-25,-29,6,-23; -15,-33,27,-9,-21,-20,5,-20,-31,-11,20,19,31,25,16,20,5,23,-32,-2; 20,18,12,-10,-3,-29,-14,4,-9,21,7,-34,6,16,7,10,11,-21,8,28; 10,-4,-11,-8,-29,33,-23,21,-3,-17,21,7,-28,-10,-16,-1,-29,32,12,16; 13,33,-7,15,-31,20,22,33,21,8,-24,20,27,30,24,20,-29,31,-20,-16; -24,-16,24,-8,7,-22,3,12,-1,-4,-9,10,13,-2,-14,-4,-3,-26,28,-25; 7,-7,19,-26,25,-27,33,12,6,3,31,-30,-14,6,-17,11,-6,5,15,0; 9,-32,-14,9,12,-8,-19,22,20,-23,14,29,-17,-28,-34,-10,4,26,-3,-14; 7,-13,-16,32,-2,11,-2,3,33,-22,-7,-3,12,-24,-7,-7,-1,31,26,22; 8,7,30,29,26,-12,13,21,-18,-5,-27,-33,1,16,-34,-10,-1,8,6,20; 32,-30,27,-21,33,5,14,30,13,24,10,-23,30,-18,13,25,0,-22,18,-19; -4,-6,7,28,-4,9,32,21,29,2,-7,7,-24,-10,2,-9,-23,-18,6,5; 3,19,0,23,-24,-16,-33,-15,-2,16,2,19,28,33,-16,32,-20,-15,28,-18])')  # needs sage.libs.pari
+    sage: a.mathnf(1)[1][1,] == gp('[4, 2, 1, 0, 3, 1, 1, 0, 1, 1, 2, 2, 3, 3, 0, 0, 1, 3]')        # needs sage.libs.pari
+    True
+"""