passagemath-fricas 10.5.40__cp39-cp39-macosx_14_0_arm64.whl → 10.5.41__cp39-cp39-macosx_14_0_arm64.whl

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/manip.spad

@@ -280,7 +280,7 @@ AlgebraicManipulations(R, F) : Exports == Implementation where
     ALGOP := '%alg
 
     innerRF    : (F, List K) -> F
-    rootExpand : K -> F
+    rootExpand : (List(K), List(F), K) -> F
     algkernels : List K -> List K
     rootkernels : List K -> List K
 
@@ -299,13 +299,20 @@ AlgebraicManipulations(R, F) : Exports == Implementation where
       numer univariate(denom(ratDenom inv(dummy::P::F - x))::F, dummy)
 
     rootSplit x ==
-      lk := rootkernels tower x
-      eval(x, lk, [rootExpand k for k in lk])
+        lk0 := rootkernels(tower(x))
+        lk : List(K) := []
+        lv : List(F) := []
+        for k in lk0 repeat
+            v := rootExpand(lk, lv, k)
+            lk := cons(k, lk)
+            lv := cons(v, lv)
+        eval(x, lk, lv)
 
-    rootExpand k ==
+    rootExpand(lk : List(K), lv : List(F), k : K) : F ==
       x  := first argument k
       n  := second argument k
       op := operator k
+      x := eval(x, lk, lv)
       op(numer(x)::F, n) / op(denom(x)::F, n)
 
 -- all the kernels in ll must be algebraic
@@ -354,22 +361,28 @@ AlgebraicManipulations(R, F) : Exports == Implementation where
 
           pol_root(p : P, op : OP, n : N) : F ==
               cp : R := content(p)$P
-              cp::F
               pp := (p exquo cp::P)::P
               fp_root(factor(pp)$MPfact, op, n)
                 *fp_root(map(x +-> x::P, factor(cp)
                             )$FactoredFunctions2(R, P), op, n)
 
-          root_factor_k(k : K) : F ==
+          root_factor_k(lk : List(K), lv : List(F), k : K) : F ==
               x  := first argument k
               nf  := second argument k
               n := (retract(nf)@Z)::N
               op := operator k
+              x := eval(x, lk, lv)
               pol_root(numer(x), op, n)/pol_root(denom(x), op, n)
 
           rootFactor x ==
-              lk := rootkernels tower x
-              eval(x, lk, [root_factor_k k for k in lk])
+              lk0 := rootkernels(tower(x))
+              lk : List(K) := []
+              lv : List(F) := []
+              for k in lk0 repeat
+                  v := root_factor_k(lk, lv, k)
+                  lk := cons(k, lk)
+                  lv := cons(v, lv)
+              eval(x, lk, lv)
 
       if R has RadicalCategory then
         rootKerSimp(op, x, n) ==
@@ -790,7 +803,7 @@ TranscendentalManipulations(R, F) : Exports == Implementation where
       l := cons([1, coef, coef, 1::F], l)
       l := powersimp l
       -- powersimp might produce new power kernels, opening new simplification
-      -- opportunities, so run it in a loop until no new kernels occour.
+      -- opportunities, so run it in a loop until no new kernels occur.
       repeat
         lnew := powersimp l
         # l = # lnew => break

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/mantepse.spad

@@ -625,7 +625,7 @@ GuessExpBin(F, S, EXPRR, retract, coerce) : Exports == Implementation where
       else error "Guess: type parameter F should be either equal to S or"
                  " equal to Fraction S"
 
-    -- convertion routines
+    -- conversion routines
 
     F2FPOLYS(p : F) : FPOLYS ==
       if F is S then
@@ -2068,7 +2068,7 @@ the size of the part is interpreted as derivative, the exponent as power.
         guessModGenCached(cache, np, sigma, addOne, maxD, prodl,
                           terml, prime)
 
-    -- checks whether partition is a product of two elememts in partitions
+    -- checks whether partition is a product of two elements in partitions
     optimiseFactor(partition : Partition,
                    partitions : List Partition) : Union(PAIR, "failed") ==
         n := # partitions
@@ -3195,9 +3195,9 @@ We are not allowed to skip checking the low degrees when using the modular
 solver, since it is possible to get spurious solution after modular reduction.
 If at least one modular reduction has no spurious solutions, the solver will
 discover that other reductions are bad and discard them.  But it is possible
-(or at least without deeper analysis we cannot exlude the possiblity) that all
+(or at least without deeper analysis we cannot exclude the possibility) that all
 reductions are bad.  In this case the solver would reconstruct something which
-is not a solution to Hermite-Pade problem.
+is not a solution to Hermite-Padé problem.
 
 )endif
 

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/matcat.spad

@@ -74,7 +74,7 @@ of \spadfun{determinant} are a good example to look at.
 ++   \spadtype{MatrixCategory} is a general matrix category which allows
 ++   different representations and indexing schemes.  Rows and
 ++   columns may be extracted with rows returned as objects of
-++   type Row and colums returned as objects of type Col.
+++   type Row and columns returned as objects of type Col.
 ++   A domain belonging to this category will be shallowly mutable.
 ++   The index of the 'first' row may be obtained by calling the
 ++   function \spadfun{minRowIndex}.  The index of the 'first' column may
@@ -136,7 +136,7 @@ MatrixCategory(R, Row, Col) : Category == Definition where
        ++ \spad{diagonalMatrix([m1, ..., mk])} creates a block diagonal matrix
        ++ M with block matrices {\em m1}, ..., {\em mk} down the diagonal,
        ++ with 0 block matrices elsewhere.
-       ++ More precisly: if \spad{ri := nrows mi}, \spad{ci := ncols mi},
+       ++ More precisely: if \spad{ri := nrows mi}, \spad{ci := ncols mi},
        ++ then m is an (r1+..+rk) by (c1+..+ck) - matrix  with entries
        ++ \spad{m.i.j = ml.(i-r1-..-r(l-1)).(j-n1-..-n(l-1))}, if
        ++ \spad{(r1+..+r(l-1)) < i <= r1+..+rl} and
@@ -919,7 +919,7 @@ RectangularMatrixCategory(m, n, R, Row, Col) : Category == Definition where
 ++   \spadtype{SquareMatrixCategory} is a general square matrix category which
 ++   allows different representations and indexing schemes.  Rows and
 ++   columns may be extracted with rows returned as objects of
-++   type Row and colums returned as objects of type Col.
+++   type Row and columns returned as objects of type Col.
 SquareMatrixCategory(ndim, R, Row, Col) : Category == Definition where
   ndim : NonNegativeInteger
   R    : Join(SemiRng, AbelianMonoid)

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/mathml.spad

@@ -386,7 +386,7 @@ MathMLFormat() : public == private where
     displayElt :     S -> Void
       ++ function for recursively displaying mathml nicely formatted
     eltLimit :       (S, I, S) -> I
-      ++ demarcates end postion of mathml element with name: S starting at
+      ++ demarcates end position of mathml element with name: S starting at
       ++ position i: I in mathml string s: S and returns end of end tag as
       ++  i: I position in mathml string, i.e. find start and end of
       ++  substring:  <name ...>...</name>

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/mesh.spad

@@ -3,6 +3,7 @@
 ++ Keywords:
 ++ Examples:
 ++ References:
+++ Description: This package generates meshes for 3D plots.
 MeshCreationRoutinesForThreeDimensions() : Exports == Implementation where
 
   I       ==> Integer

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/mkfunc.spad

@@ -13,7 +13,7 @@ InputForm():
       ++ interpret(f) passes f to the interpreter.
     interpret_in_new_env : % -> Any
       ++ interpret_in_new_env(f) evaluates f in the interpreter
-      ++ using fresh environment which is discared after evaluation
+      ++ using fresh environment which is discarded after evaluation
     convert  : SExpression -> %
       ++ convert(s) makes s into an input form.
     binary   : (%, List %) -> %
@@ -122,6 +122,8 @@ InputForm():
         'LET)@%, a, conv(concat(first l,
              [u.symb for u in l2]))@%]$List(%))@%), a]
 
+    import from Symbol
+
     strsym s ==
       string? s => string s
       symbol? s => string symbol s

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/modhpsol.spad

@@ -564,7 +564,7 @@ InnerModularHermitePade : with
         -- result lists
         il : List Integer := []
         jl : List Integer := []
-        -- kk counts trough polynomials
+        -- kk counts through polynomials
         kk : Integer := 1
         nn := nvars - 1
         repeat

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/multsqfr.spad

@@ -1,7 +1,7 @@
 )abbrev package MULTSQFR MultivariateSquareFree
 ++ Author : P.Gianni
-++ This package provides the functions for the computation of the square
-++ free decomposition of a multivariate polynomial.
+++ Description: This package provides the functions for the computation of
+++ the square free decomposition of a multivariate polynomial.
 ++ It uses modular reduction and the package \spad{MultivariateLifting}
 ++ for the "multivariate" lifting.
 
@@ -252,7 +252,7 @@ MultivariateSquareFree (E, OV, R, P) : C == T where
          return [1$BP, lval, lfact, 1$R]$Choice
 
        d0 := compdegd lfact
-                 ----      inizialize lfact1      ----
+                 ----      initialize lfact1      ----
        try_n = 0 =>
          f1 := f0
          lfact1 := lfact

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/naalg.spad

@@ -96,6 +96,8 @@ AlgebraGivenByStructuralConstants(R : CommutativeRing, n : PositiveInteger, _
                     v(i) := x(i)
         directProduct(v)
 
+    import from OV
+
     construct(l : List(Term)) : % ==
         v : Vector R :=  new(n, 0)
         for el in l repeat
@@ -193,7 +195,6 @@ AlgebraGivenByStructuralConstants(R : CommutativeRing, n : PositiveInteger, _
                   (elt(gamma.l, i, j)*elt(gamma.r, l, k) + elt(gamma.l, i, k)*_
                   elt(gamma.r, l, j) )
               not zero? res =>
-                messagePrint("algebra is not right alternative")$OutputForm
                 return false
         for j in i..n repeat
           for k in 1..j-1 repeat
@@ -206,7 +207,6 @@ AlgebraGivenByStructuralConstants(R : CommutativeRing, n : PositiveInteger, _
                   (elt(gamma.l, j, k)*elt(gamma.r, i, l) + elt(gamma.l, i, k)*_
                    elt(gamma.r, j, l) )
               not (zero? res) =>
-                messagePrint("algebra is not left alternative")$OutputForm
                 return false
 
           for k in j..n repeat
@@ -219,7 +219,6 @@ AlgebraGivenByStructuralConstants(R : CommutativeRing, n : PositiveInteger, _
                   (elt(gamma.l, j, k)*elt(gamma.r, i, l) + elt(gamma.l, i, k)*_
                    elt(gamma.r, j, l) )
               not (zero? res) =>
-                messagePrint("algebra is not left alternative")$OutputForm
                 return false
             -- right check
             for r in 1..n repeat
@@ -230,10 +229,8 @@ AlgebraGivenByStructuralConstants(R : CommutativeRing, n : PositiveInteger, _
                   (elt(gamma.l, i, j)*elt(gamma.r, l, k) + elt(gamma.l, i, k)*_
                   elt(gamma.r, l, j) )
               not (zero? res) =>
-                messagePrint("algebra is not right alternative")$OutputForm
                 return false
 
-      messagePrint("algebra satisfies 2*associator(a,b,b) = 0 = 2*associator(a,a,b) = 0")$OutputForm
       true
 
     -- should be in the category, but is not exported
@@ -266,9 +263,7 @@ AlgebraGivenByStructuralConstants(R : CommutativeRing, n : PositiveInteger, _
              res := res + elt(gamma.l, i, j)*elt(gamma.r, l, k)-_
                           elt(gamma.l, j, k)*elt(gamma.r, i, l)
            not (zero? res) =>
-            messagePrint("algebra is not associative")$OutputForm
             return false
-      messagePrint("algebra is associative")$OutputForm
       true
 
 
@@ -282,9 +277,7 @@ AlgebraGivenByStructuralConstants(R : CommutativeRing, n : PositiveInteger, _
              res := res + elt(gamma.l, i, j)*elt(gamma.r, l, k)+_
                           elt(gamma.l, j, k)*elt(gamma.r, i, l)
            not (zero? res) =>
-            messagePrint("algebra is not anti-associative")$OutputForm
             return false
-      messagePrint("algebra is anti-associative")$OutputForm
       true
 
     commutative?() ==
@@ -292,9 +285,7 @@ AlgebraGivenByStructuralConstants(R : CommutativeRing, n : PositiveInteger, _
        for j in (i+1)..n repeat
         for k in 1..n repeat
            not ( elt(gamma.k, i, j)=elt(gamma.k, j, i) ) =>
-            messagePrint("algebra is not commutative")$OutputForm
             return false
-      messagePrint("algebra is commutative")$OutputForm
       true
 
     antiCommutative?() ==
@@ -302,9 +293,7 @@ AlgebraGivenByStructuralConstants(R : CommutativeRing, n : PositiveInteger, _
        for j in i..n repeat
         for k in 1..n repeat
           not zero? (i = j => elt(gamma.k, i, i); elt(gamma.k, i, j)+elt(gamma.k, j, i) ) =>
-            messagePrint("algebra is not anti-commutative")$OutputForm
             return false
-      messagePrint("algebra is anti-commutative")$OutputForm
       true
 
     leftAlternative?() ==
@@ -318,9 +307,7 @@ AlgebraGivenByStructuralConstants(R : CommutativeRing, n : PositiveInteger, _
              res := res + (elt(gamma.l, i, j)+elt(gamma.l, j, i))*elt(gamma.r, l, k)-_
                (elt(gamma.l, j, k)*elt(gamma.r, i, l) + elt(gamma.l, i, k)*elt(gamma.r, j, l) )
            not (zero? res) =>
-            messagePrint("algebra is not left alternative")$OutputForm
             return false
-      messagePrint("algebra is left alternative")$OutputForm
       true
 
 
@@ -335,9 +322,7 @@ AlgebraGivenByStructuralConstants(R : CommutativeRing, n : PositiveInteger, _
              res := res - (elt(gamma.l, j, k)+elt(gamma.l, k, j))*elt(gamma.r, i, l)+_
                (elt(gamma.l, i, j)*elt(gamma.r, l, k) + elt(gamma.l, i, k)*elt(gamma.r, l, j) )
            not (zero? res) =>
-            messagePrint("algebra is not right alternative")$OutputForm
             return false
-      messagePrint("algebra is right alternative")$OutputForm
       true
 
 
@@ -354,9 +339,7 @@ AlgebraGivenByStructuralConstants(R : CommutativeRing, n : PositiveInteger, _
                           elt(gamma.l, k, j)*elt(gamma.r, l, i)-_
                           elt(gamma.l, j, i)*elt(gamma.r, k, l)
            not (zero? res) =>
-            messagePrint("algebra is not flexible")$OutputForm
             return false
-      messagePrint("algebra is flexible")$OutputForm
       true
 
     lieAdmissible?() ==
@@ -371,14 +354,11 @@ AlgebraGivenByStructuralConstants(R : CommutativeRing, n : PositiveInteger, _
               + (elt(gamma.l, j, k)-elt(gamma.l, k, j))*(elt(gamma.r, l, i)-elt(gamma.r, i, l)) _
               + (elt(gamma.l, k, i)-elt(gamma.l, i, k))*(elt(gamma.r, l, j)-elt(gamma.r, j, l))
            not (zero? res) =>
-            messagePrint("algebra is not Lie admissible")$OutputForm
             return false
-      messagePrint("algebra is Lie admissible")$OutputForm
       true
 
     jordanAdmissible?()  ==
       recip(2 * 1$R) case "failed" =>
-        messagePrint("this algebra is not Jordan admissible, as 2 is not invertible in the ground ring")$OutputForm
         false
       for i in 1..n repeat
        for j in 1..n repeat
@@ -408,17 +388,13 @@ AlgebraGivenByStructuralConstants(R : CommutativeRing, n : PositiveInteger, _
                 * (elt(gamma.l, j, r)+elt(gamma.l, r, j))_
                 * (elt(gamma.t, k, l)+elt(gamma.t, l, k))
            not (zero? res) =>
-             messagePrint("algebra is not Jordan admissible")$OutputForm
              return false
-      messagePrint("algebra is Jordan admissible")$OutputForm
       true
 
     jordanAlgebra?()  ==
       recip(2 * 1$R) case "failed" =>
-        messagePrint("this is not a Jordan algebra, as 2 is not invertible in the ground ring")$OutputForm
         false
       not commutative?() =>
-        messagePrint("this is not a Jordan algebra")$OutputForm
         false
       for i in 1..n repeat
        for j in 1..n repeat
@@ -436,9 +412,7 @@ AlgebraGivenByStructuralConstants(R : CommutativeRing, n : PositiveInteger, _
                    elt(gamma.r, k, j)*elt(gamma.s, i, k)*elt(gamma.t, r, s) - _
                    elt(gamma.r, i, l)*elt(gamma.s, j, r)*elt(gamma.t, k, s)
                  not zero? res =>
-                   messagePrint("this is not a Jordan algebra")$OutputForm
                    return false
-      messagePrint("this is a Jordan algebra")$OutputForm
       true
 
 
@@ -453,9 +427,7 @@ AlgebraGivenByStructuralConstants(R : CommutativeRing, n : PositiveInteger, _
                                elt(gamma.s, j, k)*elt(gamma.r, s, i) +_
                                elt(gamma.s, k, i)*elt(gamma.r, s, j)
            not zero? res =>
-                 messagePrint("Jacobi identity does not hold")$OutputForm
                  return false
-      messagePrint("Jacobi identity holds")$OutputForm
       true
 
 )abbrev package SCPKG StructuralConstantsPackage

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/naalgc.spad

@@ -533,9 +533,7 @@ FiniteRankNonAssociativeAlgebra(R : CommutativeRing):
         for j in 1..n repeat
           for k in 1..n repeat
             not zero? ( (b.i*b.j)*b.k + b.i*(b.j*b.k) )  =>
-              messagePrint("algebra is not anti-associative")$OutputForm
               return false
-      messagePrint("algebra is anti-associative")$OutputForm
       true
 
 
@@ -543,7 +541,6 @@ FiniteRankNonAssociativeAlgebra(R : CommutativeRing):
       b := someBasis()
       n := rank()
       recip(2 * 1$R) case "failed" =>
-        messagePrint("this algebra is not Jordan admissible, as 2 is not invertible in the ground ring")$OutputForm
         false
       for i in 1..n repeat
        for j in 1..n repeat
@@ -554,9 +551,7 @@ FiniteRankNonAssociativeAlgebra(R : CommutativeRing):
              antiCommutator(antiCommutator(b.l, b.j), antiCommutator(b.k, b.i)) + _
              antiCommutator(antiCommutator(b.k, b.j), antiCommutator(b.i, b.l))   _
                       ) =>
-               messagePrint("this algebra is not Jordan admissible")$OutputForm
                return false
-      messagePrint("this algebra is Jordan admissible")$OutputForm
       true
 
     lieAdmissible?() ==
@@ -568,9 +563,7 @@ FiniteRankNonAssociativeAlgebra(R : CommutativeRing):
           not zero? (commutator(commutator(b.i, b.j), b.k) _
                   + commutator(commutator(b.j, b.k), b.i) _
                   + commutator(commutator(b.k, b.i), b.j))   =>
-            messagePrint("this algebra is not Lie admissible")$OutputForm
             return false
-      messagePrint("this algebra is Lie admissible")$OutputForm
       true
 
     conditionsForIdempotents(b) ==
@@ -724,19 +717,14 @@ FiniteRankNonAssociativeAlgebra(R : CommutativeRing):
        for j in 1..n repeat
         for k in 1..n repeat
           not zero? ((b.i*b.j)*b.k + (b.j*b.k)*b.i + (b.k*b.i)*b.j) =>
-            messagePrint("Jacobi identity does not hold")$OutputForm
             return false
-      messagePrint("Jacobi identity holds")$OutputForm
       true
 
     lieAlgebra?()  ==
       not antiCommutative?() =>
-        messagePrint("this is not a Lie algebra")$OutputForm
         false
       not jacobiIdentity?() =>
-        messagePrint("this is not a Lie algebra")$OutputForm
         false
-      messagePrint("this is a Lie algebra")$OutputForm
       true
 
 
@@ -746,10 +734,8 @@ FiniteRankNonAssociativeAlgebra(R : CommutativeRing):
       b := someBasis()
       n := rank()
       recip(2 * 1$R) case "failed" =>
-        messagePrint("this is not a Jordan algebra, as 2 is not invertible in the ground ring")$OutputForm
         false
       not commutative?() =>
-        messagePrint("this is not a Jordan algebra")$OutputForm
         false
       for i in 1..n repeat
        for j in 1..n repeat
@@ -757,22 +743,16 @@ FiniteRankNonAssociativeAlgebra(R : CommutativeRing):
          for l in 1..n repeat
            not zero? (associator(b.i, b.j, b.l*b.k)+_
                associator(b.l, b.j, b.k*b.i)+associator(b.k, b.j, b.i*b.l)) =>
-             messagePrint("not a Jordan algebra")$OutputForm
              return false
-      messagePrint("this is a Jordan algebra")$OutputForm
       true
 
     noncommutativeJordanAlgebra?() ==
       recip(2 * 1$R) case "failed" =>
-        messagePrint("this is not a noncommutative Jordan algebra, as 2 is not invertible in the ground ring")$OutputForm
         false
       not flexible?()$% =>
-        messagePrint("this is not a noncommutative Jordan algebra, as it is not flexible")$OutputForm
         false
       not jordanAdmissible?()$% =>
-        messagePrint("this is not a noncommutative Jordan algebra, as it is not Jordan admissible")$OutputForm
         false
-      messagePrint("this is a noncommutative Jordan algebra")$OutputForm
       true
 
     antiCommutative?() ==
@@ -781,9 +761,7 @@ FiniteRankNonAssociativeAlgebra(R : CommutativeRing):
       for i in 1..n repeat
         for j in i..n repeat
           not zero? (i = j => b.i*b.i; b.i*b.j + b.j*b.i) =>
-            messagePrint("algebra is not anti-commutative")$OutputForm
             return false
-      messagePrint("algebra is anti-commutative")$OutputForm
       true
 
     commutative?() ==
@@ -792,9 +770,7 @@ FiniteRankNonAssociativeAlgebra(R : CommutativeRing):
       for i in 1..n repeat
        for j in i+1..n repeat
          not zero? commutator(b.i, b.j) =>
-           messagePrint("algebra is not commutative")$OutputForm
            return false
-      messagePrint("algebra is commutative")$OutputForm
       true
 
 
@@ -805,9 +781,7 @@ FiniteRankNonAssociativeAlgebra(R : CommutativeRing):
        for j in 1..n repeat
         for k in 1..n repeat
          not zero? associator(b.i, b.j, b.k) =>
-           messagePrint("algebra is not associative")$OutputForm
            return false
-      messagePrint("algebra is associative")$OutputForm
       true
 
     leftAlternative?() ==
@@ -817,9 +791,7 @@ FiniteRankNonAssociativeAlgebra(R : CommutativeRing):
        for j in 1..n repeat
         for k in 1..n repeat
          not zero? (associator(b.i, b.j, b.k) + associator(b.j, b.i, b.k)) =>
-           messagePrint("algebra is not left alternative")$OutputForm
            return false
-      messagePrint("algebra satisfies 2*associator(a,a,b) = 0")$OutputForm
       true
 
     rightAlternative?() ==
@@ -829,9 +801,7 @@ FiniteRankNonAssociativeAlgebra(R : CommutativeRing):
        for j in 1..n repeat
         for k in 1..n repeat
          not zero? (associator(b.i, b.j, b.k) + associator(b.i, b.k, b.j)) =>
-           messagePrint("algebra is not right alternative")$OutputForm
            return false
-      messagePrint("algebra satisfies 2*associator(a,b,b) = 0")$OutputForm
       true
 
     flexible?() ==
@@ -841,9 +811,7 @@ FiniteRankNonAssociativeAlgebra(R : CommutativeRing):
        for j in 1..n repeat
         for k in 1..n repeat
          not zero? (associator(b.i, b.j, b.k) + associator(b.k, b.j, b.i)) =>
-           messagePrint("algebra is not flexible")$OutputForm
            return false
-      messagePrint("algebra satisfies 2*associator(a,b,a) = 0")$OutputForm
       true
 
     alternative?() ==
@@ -853,12 +821,9 @@ FiniteRankNonAssociativeAlgebra(R : CommutativeRing):
        for j in 1..n repeat
         for k in 1..n repeat
          not zero? (associator(b.i, b.j, b.k) + associator(b.j, b.i, b.k)) =>
-           messagePrint("algebra is not alternative")$OutputForm
            return false
          not zero? (associator(b.i, b.j, b.k) + associator(b.i, b.k, b.j)) =>
-           messagePrint("algebra is not alternative")$OutputForm
            return false
-      messagePrint("algebra satisfies 2*associator(a,b,b) = 0 =  2*associator(a,a,b) = 0")$OutputForm
       true
 
     leftDiscriminant v == determinant leftTraceMatrix v
@@ -1064,14 +1029,12 @@ FramedNonAssociativeAlgebra(R : CommutativeRing): Category ==
       leftUnit() ==
         res : REC := leftUnitsInternal()
         res.particular case "failed" =>
-          messagePrint("this algebra has no left unit")$OutputForm
           "failed"
         represents (res.particular :: V R)
 
       leftUnits() ==
         res : REC := leftUnitsInternal()
         res.particular case "failed" =>
-          messagePrint("this algebra has no left unit")$OutputForm
           "failed"
         [represents(res.particular :: V R)$%, _
           map(represents, res.basis)$ListFunctions2(Vector R, %) ]
@@ -1099,14 +1062,12 @@ FramedNonAssociativeAlgebra(R : CommutativeRing): Category ==
       rightUnit() ==
         res : REC := rightUnitsInternal()
         res.particular case "failed" =>
-          messagePrint("this algebra has no right unit")$OutputForm
           "failed"
         represents (res.particular :: V R)
 
       rightUnits() ==
         res : REC := rightUnitsInternal()
         res.particular case "failed" =>
-          messagePrint("this algebra has no right unit")$OutputForm
           "failed"
         [represents(res.particular :: V R)$%, _
           map(represents, res.basis)$ListFunctions2(Vector R, %) ]
@@ -1137,7 +1098,6 @@ FramedNonAssociativeAlgebra(R : CommutativeRing): Category ==
              setelt!(cond, u, j, elt(gamma.k, i, j))$Matrix(R)
         res := solveUniquely(cond, rhs)$LSMP2
         res case "failed" =>
-          messagePrint("this algebra has no unit")$OutputForm
           "failed"
         represents(res@V(R))
 

sage_wheels/lib/fricas/target/aarch64-apple-darwin23.6.0/src/algebra/newpoly.spad

@@ -22,11 +22,11 @@ NewSparseUnivariatePolynomial(R) : Exports == Implementation where
    CoercibleTo(SUPR), RetractableTo(SUPR)) with
      monicModulo : (%, %) -> %
         ++ \spad{monicModulo(a, b)} returns \spad{r} such that \spad{r} is
-        ++ reduced w.r.t. \spad{b} and \spad{b} divides \spad{a - r}
+        ++ reduced with respect to \spad{b} and \spad{b} divides \spad{a - r}
         ++ where \spad{b} is monic.
      lazyResidueClass : (%, %) -> Record(polnum : %, polden : R, power : NNI)
         ++ \spad{lazyResidueClass(a, b)} returns \spad{[r, c, n]} such that
-        ++ \spad{r} is reduced w.r.t. \spad{b} and \spad{b} divides
+        ++ \spad{r} is reduced with respect to \spad{b} and \spad{b} divides
         ++ \spad{c^n * a - r} where \spad{c} is \spad{leadingCoefficient(b)}
         ++ and \spad{n} is as small as possible with the previous properties.
      lazyPseudoRemainder : (%, %) -> %
@@ -309,15 +309,18 @@ RecursivePolynomialCategory(R : Ring, E : OrderedAbelianMonoidSup, V : OrderedSe
          ++ otherwise returns the list of the monomials of \spad{p},
          ++ where \spad{p} is viewed as a univariate polynomial in its main variable.
      RittWuCompare : (%, %) -> Union(Boolean,"failed")
-         ++ \spad{RittWuCompare(a,b)} returns \spad{"failed"} if \spad{a} and \spad{b} have same rank w.r.t.
+         ++ \spad{RittWuCompare(a,b)} returns \spad{"failed"} if \spad{a}
+         ++ and \spad{b} have same rank with respect to
          ++ Ritt and Wu Wen Tsun ordering using the refinement of Lazard,
          ++ otherwise returns \spad{infRittWu?(a, b)}.
      infRittWu? : (%, %) -> Boolean
-         ++ \spad{infRittWu?(a, b)} returns true if \spad{a} is less than \spad{b}
-         ++ w.r.t. the Ritt and Wu Wen Tsun ordering using the refinement of Lazard.
+         ++ \spad{infRittWu?(a, b)} returns true if \spad{a} is less than
+         ++ \spad{b} with respect to the Ritt and Wu Wen Tsun ordering
+         ++ using the refinement of Lazard.
      supRittWu? : (%, %) -> Boolean
-         ++ \spad{supRittWu?(a, b)} returns true if \spad{a} is greater than \spad{b}
-         ++ w.r.t. the Ritt and Wu Wen Tsun ordering using the refinement of Lazard.
+         ++ \spad{supRittWu?(a, b)} returns true if \spad{a} is greater than
+         ++ \spad{b} with respect to the Ritt and Wu Wen Tsun ordering using
+         ++ the refinement of Lazard.
      reduced? : (%, %) -> Boolean
          ++ \spad{reduced?(a, b)} returns true iff \spad{degree(a, mvar(b)) < mdeg(b)}.
      reduced? : (%, List(%)) -> Boolean
@@ -330,13 +333,14 @@ RecursivePolynomialCategory(R : Ring, E : OrderedAbelianMonoidSup, V : OrderedSe
          ++ for every \spad{p} in \spad{lp}.
      initiallyReduced? : (%, %) -> Boolean
          ++ \spad{initiallyReduced?(a, b)} returns false iff there exists an iterated initial
-         ++ of \spad{a} which is not reduced w.r.t \spad{b}.
+         ++ of \spad{a} which is not reduced with respect to \spad{b}.
      initiallyReduced? : (%, List(%)) -> Boolean
          ++ \spad{initiallyReduced?(q, lp)} returns true iff \spad{initiallyReduced?(q, p)} holds
          ++ for every \spad{p} in \spad{lp}.
      normalized? : (%, %) -> Boolean
-         ++ \spad{normalized?(a, b)} returns true iff \spad{a} and its iterated initials have
-         ++ degree zero w.r.t. the main variable of \spad{b}
+         ++ \spad{normalized?(a, b)} returns true iff \spad{a} and its
+         ++ iterated initials have degree zero with respect to the main
+         ++ variable of \spad{b}
      normalized? : (%, List(%)) -> Boolean
          ++ \spad{normalized?(q, lp)} returns true iff \spad{normalized?(q, p)} holds
          ++ for every \spad{p} in \spad{lp}.
@@ -353,17 +357,19 @@ RecursivePolynomialCategory(R : Ring, E : OrderedAbelianMonoidSup, V : OrderedSe
          ++ \spad{pquo(a, b, v)} computes the pseudo-quotient of \spad{a} by \spad{b},
          ++ both viewed as univariate polynomials in \spad{v}.
      lazyPrem : (%, %) -> %
-         ++ \spad{lazyPrem(a, b)} returns the polynomial \spad{r} reduced w.r.t. \spad{b}
-         ++ and such that \spad{b} divides \spad{init(b)^e a - r} where \spad{e}
-         ++ is the number of steps of this pseudo-division.
+         ++ \spad{lazyPrem(a, b)} returns the polynomial \spad{r} reduced
+         ++ with respect to \spad{b} and such that \spad{b} divides
+         ++ \spad{init(b)^e a - r} where \spad{e} is the number of steps
+         ++ of this pseudo-division.
      lazyPquo : (%, %) -> %
          ++ \spad{lazyPquo(a, b)} returns the polynomial \spad{q} such that
          ++ \spad{lazyPseudoDivide(a, b)} returns \spad{[c, g, q, r]}.
      lazyPrem : (%, %, V) -> %
          ++ \spad{lazyPrem(a, b, v)} returns the polynomial \spad{r}
-         ++ reduced w.r.t. \spad{b} viewed as univariate polynomials in the variable
-         ++ \spad{v} such that \spad{b} divides \spad{init(b)^e a - r}
-         ++ where \spad{e} is the number of steps of this pseudo-division.
+         ++ reduced with respect to \spad{b} viewed as univariate polynomials
+         ++ in the variable \spad{v} such that \spad{b} divides
+         ++ \spad{init(b)^e a - r} where \spad{e} is the number of steps
+         ++ of this pseudo-division.
      lazyPquo : (%, %, V) -> %
          ++ \spad{lazyPquo(a, b, v)} returns the polynomial \spad{q} such that
          ++ \spad{lazyPseudoDivide(a, b, v)} returns \spad{[c, g, q, r]}.
@@ -389,9 +395,10 @@ RecursivePolynomialCategory(R : Ring, E : OrderedAbelianMonoidSup, V : OrderedSe
          ++ \spad{monicModulo(a, b)} computes \spad{a mod b}, if \spad{b} is
          ++ monic as univariate polynomial in its main variable.
      lazyResidueClass : (%, %) -> Record(polnum : %, polden : %, power : NonNegativeInteger)
-         ++ \spad{lazyResidueClass(a, b)} returns \spad{[p, q, n]} where \spad{p / q^n}
-         ++ represents the residue class of \spad{a} modulo \spad{b}
-         ++ and \spad{p} is reduced w.r.t. \spad{b} and \spad{q} is \spad{init(b)}.
+         ++ \spad{lazyResidueClass(a, b)} returns \spad{[p, q, n]} where
+         ++ \spad{p / q^n} represents the residue class of \spad{a} modulo
+         ++ \spad{b} and \spad{p} is reduced with respect to \spad{b} and
+         ++ \spad{q} is \spad{init(b)}.
      headReduce : (%, %) -> %
          ++ \spad{headReduce(a, b)} returns a polynomial \spad{r} such that
          ++ \spad{headReduced?(r, b)} holds and there exists an integer \spad{e}