passagemath-repl 10.5.28__py3-none-any.whl → 10.5.30__py3-none-any.whl

sage/tests/books/judson-abstract-algebra/groups-sage.py

@@ -0,0 +1,281 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: needs sage.modules sage.groups sage.symbolics
+##          Sage Doctest File         ##
+#**************************************#
+#*    Generated from PreTeXt source   *#
+#*    on 2017-08-24T11:43:34-07:00    *#
+#*                                    *#
+#*   http://mathbook.pugetsound.edu   *#
+#*                                    *#
+#**************************************#
+##
+"""
+Please contact Rob Beezer (beezer@ups.edu) with
+any test failures here that need to be changed
+as a result of changes accepted into Sage.  You
+may edit/change this file in any sensible way, so
+that development work may procede.  Your changes
+may later be replaced by the authors of "Abstract
+Algebra: Theory and Applications" when the text is
+updated, and a replacement of this file is proposed
+for review.
+"""
+##
+## To execute doctests in these files, run
+##   $ $SAGE_ROOT/sage -t <directory-of-these-files>
+## or
+##   $ $SAGE_ROOT/sage -t <a-single-file>
+##
+## Replace -t by "-tp n" for parallel testing,
+##   "-tp 0" will use a sensible number of threads
+##
+## See: http://www.sagemath.org/doc/developer/doctesting.html
+##   or run  $ $SAGE_ROOT/sage --advanced  for brief help
+##
+## Generated at 2017-08-24T11:43:34-07:00
+## From "Abstract Algebra"
+## At commit 26d3cac0b4047f4b8d6f737542be455606e2c4b4
+##
+## Section 3.7 Sage
+##
+r"""
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Z8 = Integers(8)
+    sage: Z8
+    Ring of integers modulo 8
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Z8.list()
+    [0, 1, 2, 3, 4, 5, 6, 7]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a = Z8.an_element(); a
+    0
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a.parent()
+    Ring of integers modulo 8
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a = 6
+    sage: a
+    6
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a.parent()
+    Integer Ring
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: b = 7
+    sage: c = a + b; c
+    13
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: d = Z8(6)
+    sage: d
+    6
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: d.parent()
+    Ring of integers modulo 8
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: e = Z8(7)
+    sage: f = d+e; f
+    5
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: g = Z8(85); g
+    5
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: f == g
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Z8.addition_table(names='elements')
+    +  0 1 2 3 4 5 6 7
+     +----------------
+    0| 0 1 2 3 4 5 6 7
+    1| 1 2 3 4 5 6 7 0
+    2| 2 3 4 5 6 7 0 1
+    3| 3 4 5 6 7 0 1 2
+    4| 4 5 6 7 0 1 2 3
+    5| 5 6 7 0 1 2 3 4
+    6| 6 7 0 1 2 3 4 5
+    7| 7 0 1 2 3 4 5 6
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: triangle = SymmetricGroup(3)
+    sage: rho2 = triangle([3,1,2])
+    sage: rho2
+    (1,3,2)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: [rho2(x) for x in triangle.domain()]
+    [3, 1, 2]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: [[a(x) for x in triangle.domain()] for a in triangle]
+    [[1, 2, 3], [3, 1, 2], [2, 3, 1], [1, 3, 2], [3, 2, 1], [2, 1, 3]]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: mu1 = triangle([1,3,2])
+    sage: mu2 = triangle([3,2,1])
+    sage: mu3 = triangle([2,1,3])
+    sage: rho1 = triangle([2,3,1])
+    sage: product = rho1*mu1
+    sage: product == mu2
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: [product(x) for x in triangle.domain()]
+    [3, 2, 1]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: rho1*mu1 == mu1*rho1
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: mu1*rho1 == mu3
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: triangle.cayley_table()
+    *  a b c d e f
+     +------------
+    a| a b c d e f
+    b| b a d c f e
+    c| c e a f b d
+    d| d f b e a c
+    e| e c f a d b
+    f| f d e b c a
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: triangle.cayley_table(names='elements')
+          *       ()   (2,3)   (1,2) (1,2,3) (1,3,2)   (1,3)
+           +------------------------------------------------
+         ()|      ()   (2,3)   (1,2) (1,2,3) (1,3,2)   (1,3)
+      (2,3)|   (2,3)      () (1,2,3)   (1,2)   (1,3) (1,3,2)
+      (1,2)|   (1,2) (1,3,2)      ()   (1,3)   (2,3) (1,2,3)
+    (1,2,3)| (1,2,3)   (1,3)   (2,3) (1,3,2)      ()   (1,2)
+    (1,3,2)| (1,3,2)   (1,2)   (1,3)      () (1,2,3)   (2,3)
+      (1,3)|   (1,3) (1,2,3) (1,3,2)   (2,3)   (1,2)      ()
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: triangle.cayley_table(names=['id','u1','u3','r1','r2','u2'])
+     *  id u1 u3 r1 r2 u2
+      +------------------
+    id| id u1 u3 r1 r2 u2
+    u1| u1 id r1 u3 u2 r2
+    u3| u3 r2 id u2 u1 r1
+    r1| r1 u2 u1 r2 id u3
+    r2| r2 u3 u2 id r1 u1
+    u2| u2 r1 r2 u1 u3 id
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Q = QuaternionGroup()
+    sage: [[a(x) for x in Q.domain()] for a in Q]
+    [[1, 2, 3, 4, 5, 6, 7, 8],
+     [3, 4, 1, 2, 7, 8, 5, 6],
+     [4, 1, 2, 3, 8, 5, 6, 7],
+     [2, 3, 4, 1, 6, 7, 8, 5],
+     [7, 6, 5, 8, 1, 4, 3, 2],
+     [5, 8, 7, 6, 3, 2, 1, 4],
+     [8, 7, 6, 5, 2, 1, 4, 3],
+     [6, 5, 8, 7, 4, 3, 2, 1]]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Q.cayley_table()
+    *  a b c d e f g h
+     +----------------
+    a| a b c d e f g h
+    b| b c d a h e f g
+    c| c d a b g h e f
+    d| d a b c f g h e
+    e| e f g h c d a b
+    f| f g h e b c d a
+    g| g h e f a b c d
+    h| h e f g d a b c
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: id = Q.identity()
+    sage: [id(x) for x in Q.domain()]
+    [1, 2, 3, 4, 5, 6, 7, 8]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: minus_one = Q([3, 4, 1, 2, 7, 8, 5, 6])
+    sage: minus_one*minus_one == Q.identity()
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Q.is_finite()
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Q.order()
+    8
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Q.is_abelian()
+    False
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: S8 = SymmetricGroup(8)
+    sage: a = S8.random_element()
+    sage: [a(x) for x in S8.domain()]     # random
+    [5, 2, 6, 4, 1, 8, 3, 7]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: S8.order()
+    40320
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Q.is_subgroup(S8)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: H = [CC(1), CC(-1), CC(I), CC(-I)]
+    sage: CC.multiplication_table(elements=H,
+    ....:                         names=['1', '-1', 'i', '-i'])
+    *   1 -1  i -i
+      +------------
+     1|  1 -1  i -i
+    -1| -1  1 -i  i
+     i|  i -i -1  1
+    -i| -i  i  1 -1
+"""

sage/tests/books/judson-abstract-algebra/homomorph-sage-exercises.py

@@ -0,0 +1,66 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: needs sage.groups
+##          Sage Doctest File         ##
+#**************************************#
+#*    Generated from PreTeXt source   *#
+#*    on 2017-08-24T11:43:34-07:00    *#
+#*                                    *#
+#*   http://mathbook.pugetsound.edu   *#
+#*                                    *#
+#**************************************#
+##
+"""
+Please contact Rob Beezer (beezer@ups.edu) with
+any test failures here that need to be changed
+as a result of changes accepted into Sage.  You
+may edit/change this file in any sensible way, so
+that development work may procede.  Your changes
+may later be replaced by the authors of "Abstract
+Algebra: Theory and Applications" when the text is
+updated, and a replacement of this file is proposed
+for review.
+"""
+##
+## To execute doctests in these files, run
+##   $ $SAGE_ROOT/sage -t <directory-of-these-files>
+## or
+##   $ $SAGE_ROOT/sage -t <a-single-file>
+##
+## Replace -t by "-tp n" for parallel testing,
+##   "-tp 0" will use a sensible number of threads
+##
+## See: http://www.sagemath.org/doc/developer/doctesting.html
+##   or run  $ $SAGE_ROOT/sage --advanced  for brief help
+##
+## Generated at 2017-08-24T11:43:34-07:00
+## From "Abstract Algebra"
+## At commit 26d3cac0b4047f4b8d6f737542be455606e2c4b4
+##
+## Exercises 11.6 Sage Exercises
+##
+r"""
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = CyclicPermutationGroup(3)
+    sage: H = DihedralGroup(4)
+    sage: results = G.direct_product(H)
+    sage: phi = results[2]
+    sage: H.gens()
+    ((1,2,3,4), (1,4)(2,3))
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a = H.gen(0); a
+    (1,2,3,4)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: phi(a)
+    (4,5,6,7)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = DihedralGroup(20)
+    sage: l=[H.order() for H in G.normal_subgroups()]; l.sort(); l
+    [1, 2, 4, 5, 10, 20, 20, 20, 40]
+"""

sage/tests/books/judson-abstract-algebra/homomorph-sage.py

@@ -0,0 +1,201 @@
+# sage_setup: distribution = sagemath-repl
+# sage.doctest: needs sage.groups
+##          Sage Doctest File         ##
+#**************************************#
+#*    Generated from PreTeXt source   *#
+#*    on 2017-08-24T11:43:34-07:00    *#
+#*                                    *#
+#*   http://mathbook.pugetsound.edu   *#
+#*                                    *#
+#**************************************#
+##
+"""
+Please contact Rob Beezer (beezer@ups.edu) with
+any test failures here that need to be changed
+as a result of changes accepted into Sage.  You
+may edit/change this file in any sensible way, so
+that development work may procede.  Your changes
+may later be replaced by the authors of "Abstract
+Algebra: Theory and Applications" when the text is
+updated, and a replacement of this file is proposed
+for review.
+"""
+##
+## To execute doctests in these files, run
+##   $ $SAGE_ROOT/sage -t <directory-of-these-files>
+## or
+##   $ $SAGE_ROOT/sage -t <a-single-file>
+##
+## Replace -t by "-tp n" for parallel testing,
+##   "-tp 0" will use a sensible number of threads
+##
+## See: http://www.sagemath.org/doc/developer/doctesting.html
+##   or run  $ $SAGE_ROOT/sage --advanced  for brief help
+##
+## Generated at 2017-08-24T11:43:34-07:00
+## From "Abstract Algebra"
+## At commit 26d3cac0b4047f4b8d6f737542be455606e2c4b4
+##
+## Section 11.5 Sage
+##
+r"""
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: C12 = CyclicPermutationGroup(12)
+    sage: C20 = CyclicPermutationGroup(20)
+    sage: domain_gens = C12.gens()
+    sage: [g.order() for g in domain_gens]
+    [12]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: x = C20.gen(0)
+    sage: y = x^5
+    sage: y.order()
+    4
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: phi = PermutationGroupMorphism(C12, C20, [y])
+    sage: phi
+    Permutation group morphism:
+      From: Cyclic group of order 12 as a permutation group
+      To:   Cyclic group of order 20 as a permutation group
+      Defn: [(1,2,3,4,5,6,7,8,9,10,11,12)] ->
+            [(1,6,11,16)(2,7,12,17)(3,8,13,18)(4,9,14,19)(5,10,15,20)]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: a = C12("(1,6,11,4,9,2,7,12,5,10,3,8)")
+    sage: phi(a)
+    (1,6,11,16)(2,7,12,17)(3,8,13,18)(4,9,14,19)(5,10,15,20)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: b = C12("(1,3,5,7,9,11)(2,4,6,8,10,12)")
+    sage: phi(b)
+    (1,11)(2,12)(3,13)(4,14)(5,15)(6,16)(7,17)(8,18)(9,19)(10,20)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: c = C12("(1,9,5)(2,10,6)(3,11,7)(4,12,8)")
+    sage: phi(c)
+    ()
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: K = phi.kernel(); K
+    Subgroup generated by [(1,5,9)(2,6,10)(3,7,11)(4,8,12)]
+    of (Cyclic group of order 12 as a permutation group)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Im = phi.image(C12); Im
+    Subgroup generated by
+    [(1,6,11,16)(2,7,12,17)(3,8,13,18)(4,9,14,19)(5,10,15,20)]
+    of (Cyclic group of order 20 as a permutation group)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Im.is_isomorphic(C12.quotient(K))
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = DihedralGroup(5)
+    sage: H = DihedralGroup(20)
+    sage: G.gens()
+    ((1,2,3,4,5), (1,5)(2,4))
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: H.gens()
+    ((1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20),
+     (1,20)(2,19)(3,18)(4,17)(5,16)(6,15)(7,14)(8,13)(9,12)(10,11))
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: x = H.gen(0)^4
+    sage: y = H.gen(1)
+    sage: rho = PermutationGroupMorphism(G, H, [x, y])
+    sage: rho.kernel()
+    Subgroup generated by
+    [()] of (Dihedral group of order 10 as a permutation group)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Im = rho.image(G); Im
+    Subgroup generated by
+    [(1,5,9,13,17)(2,6,10,14,18)(3,7,11,15,19)(4,8,12,16,20),
+     (1,20)(2,19)(3,18)(4,17)(5,16)(6,15)(7,14)(8,13)(9,12)(10,11)]
+    of (Dihedral group of order 40 as a permutation group)
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Im.is_subgroup(H)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: Im.is_isomorphic(G)
+    True
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = CyclicPermutationGroup(7)
+    sage: H = CyclicPermutationGroup(4)
+    sage: tau = PermutationGroupMorphism_im_gens(G, H, H.gens())
+    sage: tau
+    Permutation group morphism:
+      From: Cyclic group of order 7 as a permutation group
+      To:   Cyclic group of order 4 as a permutation group
+      Defn: [(1,2,3,4,5,6,7)] -> [(1,2,3,4)]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: tau.kernel()
+    Traceback (most recent call last):
+    ...
+    sage.libs.gap.util.GAPError: Error, no method found! Error, no 1st choice method found for `Kernel' on 1 arguments
+    The 1st argument is 'fail' which might point to an earlier problem
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: G = CyclicPermutationGroup(3)
+    sage: H = DihedralGroup(4)
+    sage: results = G.direct_product(H)
+    sage: results[0]
+    Permutation Group with generators [(1,2,3), (4,5,6,7), (4,7)(5,6)]
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: results[1]
+    Permutation group morphism:
+      From: Cyclic group of order 3 as a permutation group
+      To:   Permutation Group with generators [(1,2,3), (4,5,6,7), (4,7)(5,6)]
+      Defn: Embedding( Group( [ (1,2,3), (4,5,6,7), (4,7)(5,6) ] ), 1 )
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: results[2]
+    Permutation group morphism:
+      From: Dihedral group of order 8 as a permutation group
+      To:   Permutation Group with generators [(1,2,3), (4,5,6,7), (4,7)(5,6)]
+      Defn: Embedding( Group( [ (1,2,3), (4,5,6,7), (4,7)(5,6) ] ), 2 )
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: results[3]
+    Permutation group morphism:
+      From: Permutation Group with generators [(1,2,3), (4,5,6,7), (4,7)(5,6)]
+      To:   Cyclic group of order 3 as a permutation group
+      Defn: Projection( Group( [ (1,2,3), (4,5,6,7), (4,7)(5,6) ] ), 1 )
+
+~~~~~~~~~~~~~~~~~~~~~~ ::
+
+    sage: results[4]
+    Permutation group morphism:
+      From: Permutation Group with generators [(1,2,3), (4,5,6,7), (4,7)(5,6)]
+      To:   Dihedral group of order 8 as a permutation group
+      Defn: Projection( Group( [ (1,2,3), (4,5,6,7), (4,7)(5,6) ] ), 2 )
+"""