algebra 0.2.1

data/lib/algebra/version.rb

@@ -0,0 +1,3 @@
+module Algebra
+  VERSION = "0.2.1"
+end

data/sample/Makefile

@@ -0,0 +1,10 @@
+ruby = ruby
+all: sample list
+
+sample:
+	export RUBYLIB=../lib:$(RUBYLIB);\
+	$(ruby) do-testscripts.rb sample-*.rb
+
+list:
+	export RUBYLIB=.:$(RUBYLIB);\
+	$(ruby) do-testscripts.rb *.list

data/sample/do-testscripts.rb

@@ -0,0 +1,100 @@
+#!/usr/local/bin/ruby
+ENV["RUBYLIB"] ||= ""
+ENV["RUBYLIB"] = "tests:../lib:" + ENV["RUBYLIB"]
+
+SKIPED = []
+def skip(s)
+  SKIPED.push s
+end
+
+def allow(script)
+  # slow
+  if !ENV["TESTS"] || ENV["TESTS"].empty?
+    case script
+    when /^sample-factorize04\.rb$/ ; skip(script); return false
+    end
+  end
+
+  # little slow
+  if ENV["TESTF"] && !ENV["TESTF"].empty?
+    case script
+    when /\bsample-factorize05\.rb$/; skip(script); return false
+    when /\bsample-jordan-form\.rb$/; skip(script); return false
+    when /\bsample-jordan-form01\.rb$/; skip(script); return false
+    end
+  end
+
+  # 1.8.0 BUG
+  if ENV["TEST8"] && !ENV["TEST8"].empty?
+    case script
+    when /\bsample-m-factorize01\.rb$/; skip(script); return false
+    when /\bsample-galois-group01\.rb$/; skip(script); return false
+    when /\btest-algebraic-equation\.rb$/; skip(script); return false
+    when /\btest-jordan-form\.rb$/; skip(script); return false
+    when /\btest-splitting-field\.rb$/; skip(script); return false
+    end
+  end
+  true
+end
+
+$SUDDEN_DETH = true
+
+def mktitle(head, ch = "#", ch0 = ch)
+  title = ch0 + "  #{head}  " + ch0
+  f = ""
+  f << ch * (title.size/ch.size) << "\n"
+  f << ch0 <<  " " * (title.size-ch0.size*2) << ch0 << "\n"
+  f << title << "\n"
+  f << ch0 <<  " " * (title.size-ch0.size*2) << ch0 << "\n"
+  f << ch * (title.size/ch.size) << "\n"
+  f
+end
+
+def testscript(fname)
+  script = File.basename(fname)
+  command = "ruby" + " " + fname
+  # print mktitle("TEST of '#{script}'")
+  r = system(command)
+  # if r
+  #   print mktitle("TEST SUCCEEDED. '#{script}'", "*", "|")
+  #   puts
+  # else
+  #   print mktitle("TEST FAILED. '#{script}'", "X")
+  #   puts
+  #   if $SUDDEN_DETH
+  #     puts "\007"
+  #     exit(255)
+  #   end
+  # end
+end
+
+starttime = Time.new
+ARGV.each do |fname|
+  script = File.basename(fname)
+  dir = File.dirname(fname)
+  if script =~ /^test-.*.list$/
+    open(fname) do |f|
+      f.each do |line|
+	next if line =~ /^#/ || line =~ /^\s*$/
+	x = dir + "/" + line.chomp
+	testscript(x)
+      end
+    end
+  elsif script =~ /^test-00-.*\.rb$/
+    #testscript(fname)
+  elsif script =~ /^test-.*\.rb$/ && allow(script)
+    testscript(fname)
+  elsif script =~ /^sample-.*\.rb$/ && allow(script)
+    testscript(fname)
+  else
+    puts "SKIP: #{fname}"
+    next
+  end
+end
+spendtime = Time.now - starttime
+puts
+SKIPED.each do |s|
+  puts "SKIPED: #{s}."
+end
+puts "\007"; sleep 0.2; puts "\007"
+print mktitle("     ALL TEST SUCCEEDED. (#{spendtime} sec.)     ", "o", "|")

data/sample/sample-algebraic-equation01.rb

@@ -0,0 +1,6 @@
+require "algebra"
+
+PQ = MPolynomial(Rational)
+a, b, c = PQ.vars("abc")
+p AlgebraicEquation.minimal_polynomial(a + b + c, a**2-2, b**2-3, c**2-5)
+#=> x^8 - 40x^6 + 352x^4 - 960x^2 + 576

data/sample/sample-algebraic-equation02.rb

@@ -0,0 +1,6 @@
+require "algebra"
+
+PQ = MPolynomial(Rational)
+a, b, c = PQ.vars("abc")
+p AlgebraicEquation.minimal_polynomial(a + b + c, a**2-2, b**2-3, c**2-5)
+#=> x^8 - 40x^6 + 352x^4 - 960x^2 + 576

data/sample/sample-algebraic-root01.rb

@@ -0,0 +1,15 @@
+require "algebra"
+
+R2, r2, r2_ = Root(Rational, 2) # r2 = sqrt(2), -sqrt(2)
+p r2 #=> sqrt(2)
+R3, r3, r3_ = Root(R2, 3)       # r3 = sqrt(3), -sqrt(3)
+p r3 #=> sqrt(3)
+R6, r6, r6_ = Root(R3, 6)       # R6 = R3, r6 = sqrt(6), -sqrt(6)
+p r6 #=> -r2r3
+p( (r6 + r2)*(r6 - r2) ) #=> 4
+
+F, a, b =  QuadraticExtensionField(Rational){|x| x**2 - x - 1}
+# fibonacci numbers
+(0..100).each do |n|
+  puts( (a**n - b**n)/(a - b) )
+end

data/sample/sample-algebraicfield01.rb

@@ -0,0 +1,21 @@
+require "algebra"
+
+Px = Polynomial(Rational, "x")
+x = Px.var
+F = ResidueClassRing(Px, x**2 + x + 1)
+x = F[x]
+p( (x + 1)**100 )
+    #=> -x - 1
+p( (x-1)** 3 / (x**2 - 1) )
+    #=> -3x - 3
+
+G = Polynomial(F, "y")
+y = G.var
+p( (x + y + 1)** 7 )
+    #=> y^7 + (7x + 7)y^6 + 8xy^5 + 4y^4 + (4x + 4)y^3 + 5xy^2 + 7y + x + 1
+
+H = ResidueClassRing(G, y**5 + x*y + 1)
+y = H[y]
+p( 1/(x + y + 1)**7 )
+  #=> (1798/3x + 1825/9)y^4 + (-74x + 5176/9)y^3 + 
+  #     (-6886/9x - 5917/9)y^2 + (1826/3x - 3101/9)y + 2146/9x + 4702/9

data/sample/sample-algebraicfield02.rb

@@ -0,0 +1,10 @@
+require "algebra"
+
+F = AlgebraicExtensionField(Rational, "x") {|x| x**2 + x + 1}
+x = F.var
+p( (x + 1)**100 )
+p( (x-1)** 3 / (x**2 - 1) )
+
+H = AlgebraicExtensionField(F, "y") {|y| y**5 + x*y + 1}
+y = H.var
+p( 1/(x + y + 1)**7 )

data/sample/sample-cayleyhamilton01.rb

@@ -0,0 +1,9 @@
+require "algebra"
+
+n = 4
+R = MPolynomial(Integer)
+MR = SquareMatrix(R, n)
+m = MR.matrix{|i, j| R.var("x#{i}#{j}") }
+Rx = Polynomial(R, "x")
+ch = m.char_polynomial(Rx)
+p ch.evaluate(m) #=> 0

data/sample/sample-diagonalization01.rb

@@ -0,0 +1,43 @@
+require "algebra"
+M = SquareMatrix(Rational, 3)
+a = M[[1,-1,-1], [-1,1,-1], [2,1,-1]]
+puts "A = "; a.display; puts
+#A =
+#  1,  -1,  -1
+# -1,   1,  -1
+#  2,   1,  -1
+
+e = a.diagonalize
+
+puts "Charactoristic Poly.: #{e.chpoly} => #{e.facts}";puts
+#Charactoristic Poly.: t^3 - t^2 + t - 6 => (t - 2)(t^2 + t + 3)
+
+puts "Algebraic Numbers:"
+e.roots.each do |po, rs|
+  puts "#{rs.join(', ')} : roots of #{po} == 0"
+end; puts
+#Algebraic Numbers:
+#a, -a - 1 : roots of t^2 + t + 3 == 0
+
+puts "EigenSpaces: "
+e.evalues.uniq.each do |ev|
+  puts "W_{#{ev}} = <#{e.espaces[ev].map { |e| e.to_s }.join(', ')}>"
+end; puts
+#EigenSpaces:
+#W_{2} = <[4, -5, 1]>
+#W_{a} = <[1/3a + 1/3, 1/3a + 1/3, 1]>
+#W_{-a - 1} = <[-1/3a, -1/3a, 1]>
+
+puts "Trans. Matrix:"
+puts "P ="
+e.tmatrix.display; puts
+puts "P^-1 * A * P = "; (e.tmatrix.inverse * a * e.tmatrix).display; puts
+#P =
+#  4, 1/3a + 1/3, -1/3a
+# -5, 1/3a + 1/3, -1/3a
+#  1,   1,   1
+#
+#P^-1 * A * P =
+#  2,   0,   0
+#  0,   a,   0
+#  0,   0, -a - 1

data/sample/sample-divmod01.rb

@@ -0,0 +1,12 @@
+require "algebra"
+P = MPolynomial(Rational)
+x, y, z = P.vars("xyz")
+f = x**2*y + x*y**2 + y*2 + z**3
+g = x*y-z**3
+h = y*2-6*z
+
+P.set_ord(:lex) # lex, grlex, grevlex
+puts "(#{f}).divmod([#{g}, #{h}]) =>", "#{f.divmod(g, h).inspect}"
+#=> (x^2y + xy^2 + 2y + z^3).divmod([xy - z^3, 2y - 6z]) =>
+#   [[x + y, 1/2z^3 + 1], xz^3 + 3z^4 + z^3 + 6z]
+#   = [[Quotient1,Quotient2], Remainder]

data/sample/sample-elementary-divisor01.rb

@@ -0,0 +1,43 @@
+require "algebra"
+
+M = SquareMatrix(Rational, 4)
+a = M[
+  [2, 0, 0, 0],
+  [0, 2, 0, 0],
+  [0, 0, 2, 0],
+  [5, 0, 0, 2]
+]
+P = Polynomial(Rational, "x")
+MP = SquareMatrix(P, 4)
+
+ac = a._char_matrix(MP)
+ac.display; puts #=>
+#x - 2,   0,   0,   0
+#  0, x - 2,   0,   0
+#  0,   0, x - 2,   0
+# -5,   0,   0, x - 2
+
+p ac.elementary_divisor #=> [1, x - 2, x - 2, x^2 - 4x + 4]
+
+require "algebra/matrix-algebra-triplet"
+at = ac.to_triplet.e_diagonalize
+
+at.body.display; puts #=>
+#  1,   0,   0,   0
+#  0, x - 2,   0,   0
+#  0,   0, x - 2,   0
+#  0,   0,   0, x^2 - 4x + 4
+
+at.left.display; puts #=>
+#  0,   0,   0, -1/5
+#  0,   1,   0,   0
+#  0,   0,   1,   0
+#  5,   0,   0, x - 2
+
+at.right.display; puts #=>
+#  1,   0,   0, 1/5x - 2/5
+#  0,   1,   0,   0
+#  0,   0,   1,   0
+#  0,   0,   0,   1
+
+p at.left * ac * at.right == at.body #=> true

data/sample/sample-factorize01.rb

@@ -0,0 +1,6 @@
+require "algebra"
+
+P = Polynomial(Integer, "x")
+x = P.var
+f = 8*x**7 - 20*x**6 + 6*x**5 - 11*x**4 + 44*x**3 - 9*x**2 - 27
+p f.factorize #=> (2x - 3)^3(x^2 + x + 1)^2

data/sample/sample-factorize02.rb

@@ -0,0 +1,8 @@
+require "algebra"
+
+Z7 = ResidueClassRing(Integer, 7)
+P = Polynomial(Z7, "x")
+x = P.var
+f = 8*x**7 - 20*x**6 + 6*x**5 - 11*x**4 + 44*x**3 - 9*x**2 - 27
+p f.factorize #=> (x + 5)^2(x + 3)^2(x + 2)^3
+

data/sample/sample-factorize03.rb

@@ -0,0 +1,9 @@
+require "algebra"
+
+A = AlgebraicExtensionField(Rational, "a") {|a| a**2 + a + 1}
+a = A.var
+P = Polynomial(A, "x")
+x = P.var
+f = x**4 + (2*a + 1)*x**3 + 3*a*x**2 + (-3*a - 5)*x - a + 1
+p f.factorize #=> (x + a)^3(x - a + 1)
+

data/sample/sample-factorize04.rb

@@ -0,0 +1,9 @@
+require "algebra"
+
+A = AlgebraicExtensionField(Rational, "a") {|a| a**2 - 2}
+B = AlgebraicExtensionField(A, "b"){|b| b**2 + 1}
+P = Polynomial(B, "x")
+x = P.var
+f = x**4 + 1
+p f.factorize
+#=> (x - 1/2ab - 1/2a)(x + 1/2ab - 1/2a)(x + 1/2ab + 1/2a)(x - 1/2ab + 1/2a)

data/sample/sample-factorize05.rb

@@ -0,0 +1,48 @@
+require "algebra"
+
+def show(f, mod = 0)
+  if mod > 0
+    zp = ResidueClassRing(Integer, mod)
+    pzp = Polynomial(zp, f.variable)
+    f = f.convert_to(pzp)
+  end
+  fact = f.factorize
+  printf "mod %2d: %-15s  =>  %s\n", mod, f, fact
+end
+
+Px = Polynomial(Integer, "x")
+x = Px.var
+f = x**4 + 10*x**2 + 1
+#f = x**4 - 10*x**2 + 1
+show(f)
+Primes.new.each do |mod|
+  break if mod > 100
+  show(f, mod)
+end
+
+#mod  0: x^4 + 10x^2 + 1  =>  x^4 + 10x^2 + 1
+#mod  2: x^4 + 1          =>  (x + 1)^4
+#mod  3: x^4 + x^2 + 1    =>  (x + 2)^2(x + 1)^2
+#mod  5: x^4 + 1          =>  (x^2 + 3)(x^2 + 2)
+#mod  7: x^4 + 3x^2 + 1   =>  (x^2 + 4x + 6)(x^2 + 3x + 6)
+#mod 11: x^4 - x^2 + 1    =>  (x^2 + 5x + 1)(x^2 + 6x + 1)
+#mod 13: x^4 + 10x^2 + 1  =>  (x^2 - x + 12)(x^2 + x + 12)
+#mod 17: x^4 + 10x^2 + 1  =>  (x^2 + 3x + 1)(x^2 + 14x + 1)
+#mod 19: x^4 + 10x^2 + 1  =>  (x + 17)(x + 10)(x + 9)(x + 2)
+#mod 23: x^4 + 10x^2 + 1  =>  (x^2 + 6)(x^2 + 4)
+#mod 29: x^4 + 10x^2 + 1  =>  (x^2 + 21)(x^2 + 18)
+#mod 31: x^4 + 10x^2 + 1  =>  (x^2 + 22x + 30)(x^2 + 9x + 30)
+#mod 37: x^4 + 10x^2 + 1  =>  (x^2 + 32x + 36)(x^2 + 5x + 36)
+#mod 41: x^4 + 10x^2 + 1  =>  (x^2 + 19x + 1)(x^2 + 22x + 1)
+#mod 43: x^4 + 10x^2 + 1  =>  (x + 40)(x + 29)(x + 14)(x + 3)
+#mod 47: x^4 + 10x^2 + 1  =>  (x^2 + 32)(x^2 + 25)
+#mod 53: x^4 + 10x^2 + 1  =>  (x^2 + 41)(x^2 + 22)
+#mod 59: x^4 + 10x^2 + 1  =>  (x^2 + 13x + 1)(x^2 + 46x + 1)
+#mod 61: x^4 + 10x^2 + 1  =>  (x^2 + 54x + 60)(x^2 + 7x + 60)
+#mod 67: x^4 + 10x^2 + 1  =>  (x + 55)(x + 39)(x + 28)(x + 12)
+#mod 71: x^4 + 10x^2 + 1  =>  (x^2 + 43)(x^2 + 38)
+#mod 73: x^4 + 10x^2 + 1  =>  (x + 68)(x + 44)(x + 29)(x + 5)
+#mod 79: x^4 + 10x^2 + 1  =>  (x^2 + 64x + 78)(x^2 + 15x + 78)
+#mod 83: x^4 + 10x^2 + 1  =>  (x^2 + 18x + 1)(x^2 + 65x + 1)
+#mod 89: x^4 + 10x^2 + 1  =>  (x^2 + 9x + 1)(x^2 + 80x + 1)
+#mod 97: x^4 + 10x^2 + 1  =>  (x + 88)(x + 54)(x + 43)(x + 9)

data/sample/sample-galois-group01.rb

@@ -0,0 +1,22 @@
+require "algebra/rational"
+require "algebra/polynomial"
+
+P = Algebra.Polynomial(Rational, "x")
+x = P.var
+
+(x**3 - 3*x + 1).galois_group.each do |g|
+  p g
+end
+#=> [0, 1, 2]
+#   [1, 2, 0]
+#   [2, 0, 1]]
+
+(x**3 - x + 1).galois_group.each do |g|
+  p g
+end
+#=> [0, 1, 2]
+#   [1, 0, 2]
+#   [2, 0, 1]
+#   [0, 2, 1]
+#   [1, 2, 0]
+#   [2, 1, 0]

data/sample/sample-gaussian-elimination01.rb

@@ -0,0 +1,14 @@
+require "algebra"
+M = MatrixAlgebra(Rational, 5, 4)
+a = M.matrix{|i, j| i + j}
+a.display #=>
+  #[0, 1, 2, 3]
+  #[1, 2, 3, 4]
+  #[2, 3, 4, 5]
+  #[3, 4, 5, 6]
+  #[4, 5, 6, 7]
+a.kernel_basis.each do |v|
+  puts "a * #{v} = #{a * v}"
+  #=> a * [1, -2, 1, 0] = [0, 0, 0, 0, 0]
+  #=> a * [2, -3, 0, 1] = [0, 0, 0, 0, 0]
+end

data/sample/sample-geometry01.rb

@@ -0,0 +1,28 @@
+require 'algebra'
+R = MPolynomial(Rational)
+x,y,a1,a2,b1,b2,c1,c2 = R.vars('xya1a2b1b2c1c2')
+
+V = Vector(R, 2)
+X, A, B, C = V[x,y], V[a1,a2], V[b1,b2], V[c1,c2]
+
+D = (B + C) /2
+E = (C + A) /2
+F = (A + B) /2
+
+def line(p1, p2, p3)
+  SquareMatrix.det([[1, *p1], [1, *p2], [1, *p3]])
+end
+
+l1 = line(X, A, D)
+l2 = line(X, B, E)
+l3 = line(X, C, F)
+s = line(A, B, C)
+
+g = Groebner.basis [l1, l2, l3, s-1] #s-1 means non degeneracy
+
+g.each_with_index do |f, i|
+  p f
+end
+#x - 1/3a1 - 1/3b1 - 1/3c1
+#y - 1/3a2 - 1/3b2 - 1/3c2
+#a1b2 - a1c2 - a2b1 + a2c1 + b1c2 - b2c1 - 1